0; 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/2
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.",
+ "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 X w ^ 2) μ) :
+ p*s + q*t ≤ moment μ X 2 :=
+ D2AtomIntegral.second_moment_floor μ X s t p q hs ht hst hS hT hp hq h2
+
+example (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)
+ (s t p q : ℝ) (hp0 : 0 < p) (hq0 : 0 < q) (hst : s ≠ t)
+ (hS : MeasurableSet {w | X w ^ 2 = s})
+ (hT : MeasurableSet {w | X w ^ 2 = t})
+ (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ) :
+ p*q/(p+q)*(s-t)^2 ≤ moment μ X 4 - (moment μ X 2)^2 :=
+ D2AtomIntegral.fourth_gap_floor μ X s t p q hp0 hq0 hst hS hT hp hq h2 h4
+
+example (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)
+ (s t p q : ℝ) (hs : 0 < s) (ht : 0 < t) (hp0 : 0 < p) (hq0 : 0 < q)
+ (hst : s ≠ t) (hS : MeasurableSet {w | X w ^ 2 = s})
+ (hT : MeasurableSet {w | X w ^ 2 = t})
+ (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ)
+ (h6 : Integrable (fun w => X w ^ 6) μ) :
+ (p*s)*(q*t)/(p*s+q*t)*(s-t)^2 ≤
+ d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) :=
+ D2AtomIntegral.residual_moment_floor μ X s t p q hs ht hp0 hq0 hst hS hT hp hq h2 h4 h6
+
+example (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)
+ (s t p q u : ℝ) (hs : 0 < s) (ht : 0 < t) (hp0 : 0 < p) (hq0 : 0 < q)
+ (hst : s ≠ t) (hS : MeasurableSet {w | X w ^ 2 = s})
+ (hT : MeasurableSet {w | X w ^ 2 = t})
+ (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ) (hu0 : 0 ≤ u) (hu1 : u ≤ 1/4) :
+ min (p*q/(p+q)*(s-t)^2) (2*(p*s+q*t)^2) ≤
+ d2Schur (moment μ X 2) (moment μ X 4) u :=
+ D2AtomIntegral.schur_floor_of_radius_masses μ X s t p q u hs ht hp0 hq0 hst hS hT hp hq h2 h4 hu0 hu1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_atom_integral_20261006/D2AtomIntegral.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_atom_integral_20261006/D2AtomIntegral.lean
new file mode 100644
index 000000000..adbbf5557
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_atom_integral_20261006/D2AtomIntegral.lean
@@ -0,0 +1,149 @@
+import D2MomentBridge
+import D2SquareSchur
+import Mathlib.MeasureTheory.Integral.Bochner.Set
+
+/-!
+Quantitative squared-radius event masses give actual Bochner-integral floors.
+This supplies the six previously published contracts; no finite-model surrogate
+or changed definition of moment, residual or Schur expression is introduced.
+-/
+noncomputable section
+namespace D2AtomIntegral
+
+open MeasureTheory D2MomentBridge ResearchFormalCoreR1
+set_option autoImplicit false
+
+variable {Ω : Type*} [MeasurableSpace Ω]
+
+theorem two_event_integral_lower (μ : Measure Ω) [IsProbabilityMeasure μ] (f : Ω → ℝ)
+ (S T : Set Ω) (hS : MeasurableSet S) (hT : MeasurableSet T)
+ (hST : Disjoint S T) (hf : Integrable f μ) (hf0 : ∀ w, 0 ≤ f w)
+ (a b : ℝ) (ha : ∀ w ∈ S, a ≤ f w) (hb : ∀ w ∈ T, b ≤ f w) :
+ μ.real S * a + μ.real T * b ≤ ∫ w, f w ∂μ := by
+ classical
+ have hsi : Integrable (S.indicator (fun _ : Ω => a)) μ :=
+ (integrable_const a).indicator hS
+ have hti : Integrable (T.indicator (fun _ : Ω => b)) μ :=
+ (integrable_const b).indicator hT
+ have hle : ∀ w, S.indicator (fun _ : Ω => a) w +
+ T.indicator (fun _ : Ω => b) w ≤ f w := by
+ intro w
+ by_cases hs : w ∈ S
+ · have ht : w ∉ T := fun ht => Set.disjoint_left.mp hST hs ht
+ simpa only [Set.indicator_of_mem hs, Set.indicator_of_notMem ht, add_zero]
+ using ha w hs
+ · by_cases ht : w ∈ T
+ · simpa only [Set.indicator_of_notMem hs, Set.indicator_of_mem ht, zero_add]
+ using hb w ht
+ · simpa only [Set.indicator_of_notMem hs, Set.indicator_of_notMem ht, zero_add]
+ using hf0 w
+ calc
+ μ.real S * a + μ.real T * b =
+ ∫ w, S.indicator (fun _ : Ω => a) w + T.indicator (fun _ : Ω => b) w ∂μ := by
+ rw [integral_add hsi hti, integral_indicator hS, integral_indicator hT]
+ simp [Measure.real, smul_eq_mul]
+ _ ≤ ∫ w, f w ∂μ := integral_mono (hsi.add hti) hf hle
+
+theorem two_radius_integral_lower (μ : Measure Ω) [IsProbabilityMeasure μ] (X f : Ω → ℝ)
+ (s t p q a b : ℝ)
+ (hS : MeasurableSet {w | X w ^ 2 = s})
+ (hT : MeasurableSet {w | X w ^ 2 = t}) (hst : s ≠ t)
+ (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})
+ (ha0 : 0 ≤ a) (hb0 : 0 ≤ b) (hf : Integrable f μ) (hf0 : ∀ w, 0 ≤ f w)
+ (ha : ∀ w, X w ^ 2 = s → f w = a) (hb : ∀ w, X w ^ 2 = t → f w = b) :
+ p * a + q * b ≤ ∫ w, f w ∂μ := by
+ have hd : Disjoint {w | X w ^ 2 = s} {w | X w ^ 2 = t} := by
+ apply Set.disjoint_left.mpr
+ intro w hwS hwT
+ exact hst (hwS.symm.trans hwT)
+ have hmass := add_le_add (mul_le_mul_of_nonneg_right hp ha0)
+ (mul_le_mul_of_nonneg_right hq hb0)
+ exact le_trans hmass (two_event_integral_lower μ f _ _ hS hT hd hf hf0 a b
+ (fun w hw => (ha w hw).symm.le) (fun w hw => (hb w hw).symm.le))
+
+theorem second_moment_floor (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)
+ (s t p q : ℝ) (hs : 0 < s) (ht : 0 < t) (hst : s ≠ t)
+ (hS : MeasurableSet {w | X w ^ 2 = s})
+ (hT : MeasurableSet {w | X w ^ 2 = t})
+ (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})
+ (h2 : Integrable (fun w => X w ^ 2) μ) :
+ p*s + q*t ≤ moment μ X 2 := by
+ exact two_radius_integral_lower μ X (fun w => X w ^ 2) s t p q s t
+ hS hT hst hp hq hs.le ht.le h2 (fun w => sq_nonneg (X w))
+ (fun _ h => h) (fun _ h => h)
+
+theorem fourth_gap_floor (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)
+ (s t p q : ℝ) (hp0 : 0 < p) (hq0 : 0 < q) (hst : s ≠ t)
+ (hS : MeasurableSet {w | X w ^ 2 = s})
+ (hT : MeasurableSet {w | X w ^ 2 = t})
+ (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ) :
+ p*q/(p+q)*(s-t)^2 ≤ moment μ X 4 - (moment μ X 2)^2 := by
+ have h := two_radius_integral_lower μ X (fun w => (X w ^ 2 - moment μ X 2)^2)
+ s t p q ((s-moment μ X 2)^2) ((t-moment μ X 2)^2)
+ hS hT hst hp hq (sq_nonneg _) (sq_nonneg _)
+ (square_gap_integrable μ X h2 h4) (fun _ => sq_nonneg _)
+ (by intro w hw; rw [hw]) (by intro w hw; rw [hw])
+ rw [square_gap_integral μ X h2 h4] at h
+ exact le_trans (D2SquareSchur.weighted_square_lower p q s t (moment μ X 2) hp0 hq0) h
+
+theorem residual_moment_floor (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)
+ (s t p q : ℝ) (hs : 0 < s) (ht : 0 < t) (hp0 : 0 < p) (hq0 : 0 < q)
+ (hst : s ≠ t) (hS : MeasurableSet {w | X w ^ 2 = s})
+ (hT : MeasurableSet {w | X w ^ 2 = t})
+ (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ)
+ (h6 : Integrable (fun w => X w ^ 6) μ) :
+ (p*s)*(q*t)/(p*s+q*t)*(s-t)^2 ≤
+ d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) := by
+ let c : ℝ := moment μ X 4 / moment μ X 2
+ have hsecond := second_moment_floor μ X s t p q hs ht hst hS hT hp hq h2
+ have hm2 : 0 < moment μ X 2 :=
+ lt_of_lt_of_le (add_pos (mul_pos hp0 hs) (mul_pos hq0 ht)) hsecond
+ have h := two_radius_integral_lower μ X (fun w => cubicResidual c (X w)^2)
+ s t p q (s*(s-c)^2) (t*(t-c)^2) hS hT hst hp hq
+ (mul_nonneg hs.le (sq_nonneg _)) (mul_nonneg ht.le (sq_nonneg _))
+ (residual_sq_integrable μ X c h2 h4 h6) (fun _ => sq_nonneg _)
+ (by
+ intro w hw
+ calc
+ cubicResidual c (X w)^2 = X w ^ 2 * (X w ^ 2-c)^2 := by
+ unfold cubicResidual
+ ring
+ _ = s*(s-c)^2 := by rw [hw])
+ (by
+ intro w hw
+ calc
+ cubicResidual c (X w)^2 = X w ^ 2 * (X w ^ 2-c)^2 := by
+ unfold cubicResidual
+ ring
+ _ = t*(t-c)^2 := by rw [hw])
+ have hr : (∫ w, cubicResidual c (X w)^2 ∂μ) =
+ d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) :=
+ residual_integral_eq_delta μ X h2 h4 h6 (ne_of_gt hm2)
+ rw [hr] at h
+ have hl := D2SquareSchur.weighted_square_lower (p*s) (q*t) s t c
+ (mul_pos hp0 hs) (mul_pos hq0 ht)
+ exact le_trans hl (by simpa only [mul_assoc] using h)
+
+theorem schur_floor_of_radius_masses (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)
+ (s t p q u : ℝ) (hs : 0 < s) (ht : 0 < t) (hp0 : 0 < p) (hq0 : 0 < q)
+ (hst : s ≠ t) (hS : MeasurableSet {w | X w ^ 2 = s})
+ (hT : MeasurableSet {w | X w ^ 2 = t})
+ (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ) (hu0 : 0 ≤ u) (hu1 : u ≤ 1/4) :
+ min (p*q/(p+q)*(s-t)^2) (2*(p*s+q*t)^2) ≤
+ d2Schur (moment μ X 2) (moment μ X 4) u := by
+ have hm := second_moment_floor μ X s t p q hs ht hst hS hT hp hq h2
+ have hg := fourth_gap_floor μ X s t p q hp0 hq0 hst hS hT hp hq h2 h4
+ have hm0 : 0 < p*s+q*t := add_pos (mul_pos hp0 hs) (mul_pos hq0 ht)
+ have hg0 : 0 < p*q/(p+q)*(s-t)^2 :=
+ mul_pos (div_pos (mul_pos hp0 hq0) (add_pos hp0 hq0))
+ (sq_pos_of_ne_zero (sub_ne_zero.mpr hst))
+ exact D2SquareSchur.schur_from_lower_inputs (moment μ X 2) (moment μ X 4) u
+ (p*s+q*t) (p*q/(p+q)*(s-t)^2) hm0 hg0 hm hg hu0 hu1
+
+end D2AtomIntegral
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_moment_bridge_20261006/D2MomentBridge.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_moment_bridge_20261006/D2MomentBridge.lean
new file mode 100644
index 000000000..b3184107e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_moment_bridge_20261006/D2MomentBridge.lean
@@ -0,0 +1,238 @@
+import ResearchFormalCoreR1.D2Schur
+import Mathlib.MeasureTheory.Integral.Bochner.Basic
+import Mathlib.Tactic
+
+/-!
+# Actual-law d2 moment bridge
+
+Dylan Roy — delegated AI work. Author: OpenAI / GPT-6 Astra Pro.
+This companion uses actual integrals, not assigned scalar moments. It does not
+construct a periodic spectral law, a Gaussian field, or a Palm conditioning.
+Second/fourth/sixth integrability and positive atom masses remain explicit.
+-/
+
+noncomputable section
+namespace D2MomentBridge
+
+open MeasureTheory ResearchFormalCoreR1
+set_option autoImplicit false
+
+variable {Ω : Type*} [MeasurableSpace Ω]
+
+def moment (μ : Measure Ω) (X : Ω → ℝ) (n : ℕ) : ℝ := ∫ w, X w ^ n ∂μ
+
+def cubicResidual (c x : ℝ) : ℝ := x ^ 3 - c * x
+
+theorem residual_sq_expand (c x : ℝ) :
+ cubicResidual c x ^ 2 = x ^ 6 - (2 * c) * x ^ 4 + c ^ 2 * x ^ 2 := by
+ unfold cubicResidual
+ ring
+
+theorem residual_sq_integrable (μ : Measure Ω) (X : Ω → ℝ) (c : ℝ)
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ)
+ (h6 : Integrable (fun w => X w ^ 6) μ) :
+ Integrable (fun w => cubicResidual c (X w) ^ 2) μ := by
+ simp_rw [residual_sq_expand]
+ exact (h6.sub (h4.const_mul (2 * c))).add (h2.const_mul (c ^ 2))
+
+/-- The exact residual identity; integrability prevents Bochner totalization. -/
+theorem residual_integral_eq_delta (μ : Measure Ω) (X : Ω → ℝ)
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ)
+ (h6 : Integrable (fun w => X w ^ 6) μ)
+ (hm2 : moment μ X 2 ≠ 0) :
+ (∫ w, cubicResidual (moment μ X 4 / moment μ X 2) (X w) ^ 2 ∂μ) =
+ d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) := by
+ simp_rw [residual_sq_expand]
+ have hs : Integrable
+ (fun w => X w ^ 6 - (2 * (moment μ X 4 / moment μ X 2)) * X w ^ 4) μ :=
+ h6.sub (h4.const_mul (2 * (moment μ X 4 / moment μ X 2)))
+ have hl : Integrable
+ (fun w => (moment μ X 4 / moment μ X 2) ^ 2 * X w ^ 2) μ :=
+ h2.const_mul ((moment μ X 4 / moment μ X 2) ^ 2)
+ rw [integral_add hs hl,
+ integral_sub h6 (h4.const_mul (2 * (moment μ X 4 / moment μ X 2))),
+ integral_const_mul, integral_const_mul]
+ change moment μ X 6 - (2 * (moment μ X 4 / moment μ X 2)) * moment μ X 4 +
+ (moment μ X 4 / moment μ X 2) ^ 2 * moment μ X 2 =
+ d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6)
+ unfold d2Delta
+ field_simp [hm2]
+ ring
+
+theorem delta_nonneg (μ : Measure Ω) (X : Ω → ℝ)
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ)
+ (h6 : Integrable (fun w => X w ^ 6) μ)
+ (hm2 : moment μ X 2 ≠ 0) :
+ 0 ≤ d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) := by
+ rw [← residual_integral_eq_delta μ X h2 h4 h6 hm2]
+ exact integral_nonneg (fun w => sq_nonneg _)
+
+theorem delta_eq_zero_iff_residual (μ : Measure Ω) (X : Ω → ℝ)
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ)
+ (h6 : Integrable (fun w => X w ^ 6) μ)
+ (hm2 : moment μ X 2 ≠ 0) :
+ d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) = 0 ↔
+ ∀ᵐ w ∂μ, cubicResidual (moment μ X 4 / moment μ X 2) (X w) = 0 := by
+ rw [← residual_integral_eq_delta μ X h2 h4 h6 hm2]
+ have hz := integral_eq_zero_iff_of_nonneg_ae
+ (Filter.Eventually.of_forall (fun w => sq_nonneg
+ (cubicResidual (moment μ X 4 / moment μ X 2) (X w))))
+ (residual_sq_integrable μ X _ h2 h4 h6)
+ constructor
+ · intro h
+ filter_upwards [hz.mp h] with w hw
+ exact sq_eq_zero_iff.mp hw
+ · intro h
+ apply hz.mpr
+ filter_upwards [h] with w hw
+ change cubicResidual (moment μ X 4 / moment μ X 2) (X w) ^ 2 = 0
+ exact sq_eq_zero_iff.mpr hw
+
+theorem cubicResidual_eq_zero_iff (c x : ℝ) :
+ cubicResidual c x = 0 ↔ x = 0 ∨ x ^ 2 = c := by
+ have h : cubicResidual c x = x * (x ^ 2 - c) := by
+ unfold cubicResidual
+ ring
+ rw [h, mul_eq_zero, sub_eq_zero]
+
+/-- Zero may carry positive mass: the nonzero support, not all |X|, has one radius. -/
+theorem delta_eq_zero_iff_support (μ : Measure Ω) (X : Ω → ℝ)
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ)
+ (h6 : Integrable (fun w => X w ^ 6) μ)
+ (hm2 : moment μ X 2 ≠ 0) :
+ d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) = 0 ↔
+ ∀ᵐ w ∂μ, X w = 0 ∨ X w ^ 2 = moment μ X 4 / moment μ X 2 := by
+ rw [delta_eq_zero_iff_residual μ X h2 h4 h6 hm2]
+ simp_rw [cubicResidual_eq_zero_iff]
+
+theorem delta_pos_iff_not_support (μ : Measure Ω) (X : Ω → ℝ)
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ)
+ (h6 : Integrable (fun w => X w ^ 6) μ)
+ (hm2 : moment μ X 2 ≠ 0) :
+ 0 < d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) ↔
+ ¬ (∀ᵐ w ∂μ, X w = 0 ∨ X w ^ 2 = moment μ X 4 / moment μ X 2) := by
+ have hn := delta_nonneg μ X h2 h4 h6 hm2
+ have he := delta_eq_zero_iff_support μ X h2 h4 h6 hm2
+ constructor
+ · intro hp hs
+ exact (ne_of_gt hp) (he.mpr hs)
+ · intro hs
+ by_contra hp
+ exact hs (he.mp (le_antisymm (le_of_not_gt hp) hn))
+
+/-- Positive mass turns an a.e. value property into a property of that atom. -/
+theorem property_of_ae_of_atom (μ : Measure Ω) (X : Ω → ℝ) (p : ℝ → Prop)
+ (h : ∀ᵐ w ∂μ, p (X w)) (a : ℝ) (ha : μ {w | X w = a} ≠ 0) : p a := by
+ by_contra hp
+ apply ha
+ have hz : μ {w | ¬ p (X w)} = 0 := ae_iff.mp h
+ refine measure_mono_null ?_ hz
+ intro w hw
+ change X w = a at hw
+ change ¬ p (X w)
+ simpa only [hw] using hp
+
+theorem moment_two_pos_of_atom (μ : Measure Ω) (X : Ω → ℝ)
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (a : ℝ) (ha0 : a ≠ 0) (ha : μ {w | X w = a} ≠ 0) : 0 < moment μ X 2 := by
+ have hn : 0 ≤ moment μ X 2 := integral_nonneg (fun w => sq_nonneg _)
+ by_contra hp
+ have he : moment μ X 2 = 0 := le_antisymm (le_of_not_gt hp) hn
+ have hz := (integral_eq_zero_iff_of_nonneg_ae
+ (Filter.Eventually.of_forall (fun w => sq_nonneg (X w))) h2).mp he
+ have hz' : ∀ᵐ w ∂μ, X w ^ 2 = 0 := hz
+ have ha2 := property_of_ae_of_atom μ X (fun x => x ^ 2 = 0) hz' a ha
+ exact ha0 (sq_eq_zero_iff.mp ha2)
+
+theorem delta_pos_of_two_atoms (μ : Measure Ω) (X : Ω → ℝ)
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ)
+ (h6 : Integrable (fun w => X w ^ 6) μ)
+ (a b : ℝ) (ha0 : a ≠ 0) (hb0 : b ≠ 0) (hab : a ^ 2 ≠ b ^ 2)
+ (ha : μ {w | X w = a} ≠ 0) (hb : μ {w | X w = b} ≠ 0) :
+ 0 < d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) := by
+ have hm2 := moment_two_pos_of_atom μ X h2 a ha0 ha
+ apply (delta_pos_iff_not_support μ X h2 h4 h6 (ne_of_gt hm2)).mpr
+ intro hs
+ have hsa := property_of_ae_of_atom μ X
+ (fun x => x = 0 ∨ x ^ 2 = moment μ X 4 / moment μ X 2) hs a ha
+ have hsb := property_of_ae_of_atom μ X
+ (fun x => x = 0 ∨ x ^ 2 = moment μ X 4 / moment μ X 2) hs b hb
+ exact hab ((hsa.resolve_left ha0).trans (hsb.resolve_left hb0).symm)
+
+theorem square_gap_integrable (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ) :
+ Integrable (fun w => (X w ^ 2 - moment μ X 2) ^ 2) μ := by
+ have hf : (fun w => (X w ^ 2 - moment μ X 2) ^ 2) =
+ (fun w => X w ^ 4 - (2 * moment μ X 2) * X w ^ 2 + (moment μ X 2) ^ 2) := by
+ funext w
+ ring
+ rw [hf]
+ exact (h4.sub (h2.const_mul _)).add (integrable_const _)
+
+/-- Probability normalization is essential for the unscaled m4-m2^2 gap. -/
+theorem square_gap_integral (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ) :
+ (∫ w, (X w ^ 2 - moment μ X 2) ^ 2 ∂μ) = moment μ X 4 - (moment μ X 2) ^ 2 := by
+ have hf : (fun w => (X w ^ 2 - moment μ X 2) ^ 2) =
+ (fun w => X w ^ 4 - (2 * moment μ X 2) * X w ^ 2 + (moment μ X 2) ^ 2) := by
+ funext w
+ ring
+ have hs : Integrable
+ (fun w => X w ^ 4 - (2 * moment μ X 2) * X w ^ 2) μ :=
+ h4.sub (h2.const_mul (2 * moment μ X 2))
+ have hc : Integrable (fun _ : Ω => (moment μ X 2) ^ 2) μ := integrable_const _
+ rw [hf, integral_add hs hc,
+ integral_sub h4 (h2.const_mul (2 * moment μ X 2)), integral_const_mul]
+ simp only [integral_const, probReal_univ, one_smul]
+ change moment μ X 4 - (2 * moment μ X 2) * moment μ X 2 + (moment μ X 2) ^ 2 = _
+ ring
+
+theorem fourth_gt_second_sq_of_two_atoms (μ : Measure Ω) [IsProbabilityMeasure μ]
+ (X : Ω → ℝ) (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ)
+ (a b : ℝ) (hab : a ^ 2 ≠ b ^ 2)
+ (ha : μ {w | X w = a} ≠ 0) (hb : μ {w | X w = b} ≠ 0) :
+ (moment μ X 2) ^ 2 < moment μ X 4 := by
+ have hn : 0 ≤ moment μ X 4 - (moment μ X 2) ^ 2 := by
+ rw [← square_gap_integral μ X h2 h4]
+ exact integral_nonneg (fun w => sq_nonneg _)
+ by_contra hp
+ have he : moment μ X 4 - (moment μ X 2) ^ 2 = 0 := by linarith
+ rw [← square_gap_integral μ X h2 h4] at he
+ have hz := (integral_eq_zero_iff_of_nonneg_ae
+ (Filter.Eventually.of_forall (fun w => sq_nonneg (X w ^ 2 - moment μ X 2)))
+ (square_gap_integrable μ X h2 h4)).mp he
+ have hs : ∀ᵐ w ∂μ, X w ^ 2 = moment μ X 2 := by
+ filter_upwards [hz] with w hw
+ exact sub_eq_zero.mp (sq_eq_zero_iff.mp hw)
+ exact hab ((property_of_ae_of_atom μ X (fun x => x ^ 2 = moment μ X 2) hs a ha).trans
+ (property_of_ae_of_atom μ X (fun x => x ^ 2 = moment μ X 2) hs b hb).symm)
+
+/-- The actual-law sufficient assumptions now supply all strict moment premises. -/
+theorem tau_pos_of_two_atoms (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)
+ (h2 : Integrable (fun w => X w ^ 2) μ)
+ (h4 : Integrable (fun w => X w ^ 4) μ)
+ (h6 : Integrable (fun w => X w ^ 6) μ)
+ (a b q : ℝ) (ha0 : a ≠ 0) (hb0 : b ≠ 0) (hab : a ^ 2 ≠ b ^ 2)
+ (ha : μ {w | X w = a} ≠ 0) (hb : μ {w | X w = b} ≠ 0)
+ (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) :
+ 0 < d2Tau (moment μ X 2) (moment μ X 4) (moment μ X 6) q :=
+ d2_tau_pos _ _ _ q (moment_two_pos_of_atom μ X h2 a ha0 ha)
+ (fourth_gt_second_sq_of_two_atoms μ X h2 h4 a b hab ha hb)
+ (delta_pos_of_two_atoms μ X h2 h4 h6 a b ha0 hb0 hab ha hb) hq0 hq1
+
+/-- Moments of the zero/+-1 countermodel; the actual finite law is tested separately. -/
+theorem zero_atom_counterexample :
+ (1 / 2 : ℝ) - (1 / 2) ^ 2 = 1 / 4 ∧ d2Delta (1 / 2) (1 / 2) (1 / 2) = 0 := by
+ norm_num [d2Delta]
+
+end D2MomentBridge
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_square_schur_20261006/Contract.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_square_schur_20261006/Contract.lean
new file mode 100644
index 000000000..1ba8dc0d3
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_square_schur_20261006/Contract.lean
@@ -0,0 +1,22 @@
+import D2SquareSchur
+
+open ResearchFormalCoreR1
+
+example (u v a b c : ℝ) (huv : u + v ≠ 0) :
+ u * (a-c)^2 + v * (b-c)^2 =
+ u*v/(u+v)*(a-b)^2 + (u+v)*(c-(u*a+v*b)/(u+v))^2 :=
+ D2SquareSchur.weighted_square_identity u v a b c huv
+
+example (u v a b c : ℝ) (hu : 0 < u) (hv : 0 < v) :
+ u*v/(u+v)*(a-b)^2 ≤ u*(a-c)^2 + v*(b-c)^2 :=
+ D2SquareSchur.weighted_square_lower u v a b c hu hv
+
+example (m2 m4 q : ℝ) (hm2 : 0 < m2) (hm4 : m2^2 < m4)
+ (hq0 : 0 ≤ q) (hq1 : q ≤ 1/4) :
+ min (m4-m2^2) (2*m2^2) ≤ d2Schur m2 m4 q :=
+ D2SquareSchur.schur_no_upper m2 m4 q hm2 hm4 hq0 hq1
+
+example (m2 m4 q s0 g0 : ℝ) (hs0 : 0 < s0) (hg0 : 0 < g0)
+ (hm2 : s0 ≤ m2) (hgap : g0 ≤ m4-m2^2) (hq0 : 0 ≤ q) (hq1 : q ≤ 1/4) :
+ min g0 (2*s0^2) ≤ d2Schur m2 m4 q :=
+ D2SquareSchur.schur_from_lower_inputs m2 m4 q s0 g0 hs0 hg0 hm2 hgap hq0 hq1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_square_schur_20261006/D2SquareSchur.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_square_schur_20261006/D2SquareSchur.lean
new file mode 100644
index 000000000..4855c92d5
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_square_schur_20261006/D2SquareSchur.lean
@@ -0,0 +1,77 @@
+import ResearchFormalCoreR1.D2Schur
+
+/-!
+Four real scalar statements from #328 sections 3 and 5. This module does not
+construct a measure, a field, or a conditional covariance. All strict moment
+and direction assumptions remain in the exact-type Contract.
+-/
+namespace D2SquareSchur
+
+open ResearchFormalCoreR1
+set_option autoImplicit false
+
+theorem weighted_square_identity (u v a b c : ℝ) (huv : u + v ≠ 0) :
+ u * (a-c)^2 + v * (b-c)^2 =
+ u*v/(u+v)*(a-b)^2 + (u+v)*(c-(u*a+v*b)/(u+v))^2 := by
+ field_simp [huv]
+ ring
+
+theorem weighted_square_lower (u v a b c : ℝ) (hu : 0 < u) (hv : 0 < v) :
+ u*v/(u+v)*(a-b)^2 ≤ u*(a-c)^2 + v*(b-c)^2 := by
+ rw [weighted_square_identity u v a b c (ne_of_gt (add_pos hu hv))]
+ exact le_add_of_nonneg_right (mul_nonneg (add_pos hu hv).le (sq_nonneg _))
+
+/-- Endpoint upper control of the denominator, not lower-bound substitution. -/
+theorem schur_no_upper (m2 m4 q : ℝ) (hm2 : 0 < m2) (hm4 : m2^2 < m4)
+ (hq0 : 0 ≤ q) (hq1 : q ≤ 1/4) :
+ min (m4-m2^2) (2*m2^2) ≤ d2Schur m2 m4 q := by
+ let x : ℝ := m2^2
+ let g : ℝ := m4-x
+ let A : ℝ := x*m4
+ let B : ℝ := g*(m4+3*x)/4
+ let N : ℝ := d2Numerator m2 m4
+ let h : ℝ := min g (2*x)
+ have hx : 0 < x := sq_pos_of_pos hm2
+ have hg : 0 < g := sub_pos.mpr hm4
+ have hm4pos : 0 < m4 := lt_trans hx hm4
+ have hA : 0 < A := mul_pos hx hm4pos
+ have hB : 0 < B := by
+ dsimp [B]
+ positivity
+ have hNA : N-g*A = x^2*g := by
+ dsimp [N, g, A, x, d2Numerator]
+ ring
+ have hNB : N-(2*x)*B = x*g^2/2 := by
+ dsimp [N, g, B, x, d2Numerator]
+ ring
+ have hga : g*A ≤ N := by
+ have hp := mul_nonneg (sq_nonneg x) hg.le
+ linarith [hNA]
+ have h2xb : (2*x)*B ≤ N := by
+ have hp : 0 ≤ x*g^2/2 := div_nonneg (mul_nonneg hx.le (sq_nonneg g)) (by norm_num)
+ linarith [hNB]
+ have hmulA : h*A ≤ N :=
+ le_trans (mul_le_mul_of_nonneg_right (min_le_left g (2*x)) hA.le) hga
+ have hmulB : h*B ≤ N :=
+ le_trans (mul_le_mul_of_nonneg_right (min_le_right g (2*x)) hB.le) h2xb
+ have hM : 0 < max A B := lt_of_lt_of_le hA (le_max_left _ _)
+ have hmax : h*max A B ≤ N := by
+ rcases le_total A B with hab | hba
+ · simpa only [max_eq_right hab] using hmulB
+ · simpa only [max_eq_left hba] using hmulA
+ have hquot : h ≤ N/max A B := (le_div_iff₀ hM).2 hmax
+ exact le_trans hquot (d2_schur_endpoint_lower m2 m4 q hm2 hm4 hq0 hq1)
+
+theorem schur_from_lower_inputs (m2 m4 q s0 g0 : ℝ) (hs0 : 0 < s0) (hg0 : 0 < g0)
+ (hm2 : s0 ≤ m2) (hgap : g0 ≤ m4-m2^2) (hq0 : 0 ≤ q) (hq1 : q ≤ 1/4) :
+ min g0 (2*s0^2) ≤ d2Schur m2 m4 q := by
+ have hm2pos : 0 < m2 := lt_of_lt_of_le hs0 hm2
+ have hm4 : m2^2 < m4 := by linarith
+ have hsquare : s0^2 ≤ m2^2 := by
+ have hp := mul_nonneg (sub_nonneg.mpr hm2) (add_nonneg hm2pos.le hs0.le)
+ nlinarith
+ have hmin : min g0 (2*s0^2) ≤ min (m4-m2^2) (2*m2^2) :=
+ min_le_min hgap (by linarith)
+ exact le_trans hmin (schur_no_upper m2 m4 q hm2pos hm4 hq0 hq1)
+
+end D2SquareSchur
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/ClosedSuperlevel.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/ClosedSuperlevel.lean
new file mode 100644
index 000000000..a4323cb50
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/ClosedSuperlevel.lean
@@ -0,0 +1,197 @@
+import Mathlib
+
+/-!
+# Closed superlevels and their actual component and singular H0 functors
+
+C254 proposed source. Compilation and kernel audit: NOT_RUN.
+The parameter is `t = -h`; endpoint membership uses `≤`.
+This file supplies no Morse theorem, labels, bars, or H0/component naturality.
+Compile fix at the pin (Lean v4.34.1, Mathlib d13f23b7), altering no statement: in
+`superlevel_componentMap` the `ZerothHomotopy.lift` witness binds its two strict-implicit
+points before the `Path` argument (`fun _ _ p => ...`), as `ZerothHomotopy.lift` requires here.
+-/
+
+noncomputable section
+
+open CategoryTheory
+
+universe w v u
+
+namespace TorusFiltration
+/-- The increasing closed-superlevel family, with parameter `t = -h`. -/
+def superlevel_set {X : Type*} (g : X → ℝ) (t : ℝ) : Set X :=
+ {x | -t ≤ g x}
+
+/-- Control: the point at the threshold belongs to the closed superlevel.
+Changing `≤` to `<` invalidates this statement. -/
+theorem superlevel_control_closed_endpoint (b : ℝ) :
+ () ∈ superlevel_set (fun _ : Unit => b) (-b) := by
+ simp [superlevel_set]
+
+/-- Control: the strict condition fails at that same threshold. -/
+theorem superlevel_control_strict_endpoint (b : ℝ) :
+ ¬ (-(-b) < (fun _ : Unit => b) ()) := by
+ simp
+
+/-- Control: at parameter `1` the constant height `0` is present.
+Changing `-t` to `t` invalidates this statement. -/
+theorem superlevel_control_parameter_sign :
+ () ∈ superlevel_set (fun _ : Unit => (0 : ℝ)) 1 := by
+ norm_num [superlevel_set]
+
+/-- Control: inclusion cannot run from parameter `1` back to `-1`. -/
+theorem superlevel_control_inclusion_direction :
+ ¬ superlevel_set (fun _ : Unit => (0 : ℝ)) 1 ⊆
+ superlevel_set (fun _ : Unit => (0 : ℝ)) (-1) := by
+ intro h
+ have hc := h superlevel_control_parameter_sign
+ norm_num [superlevel_set] at hc
+
+/-- A global maximum has no strictly higher endpoint, regardless of paths. -/
+theorem superlevel_control_essential {X : Type*} (g : X → ℝ) (M : X)
+ (hM : ∀ y, g y ≤ g M) : ¬ ∃ y, g M < g y := by
+ rintro ⟨y, hy⟩
+ exact (not_lt_of_ge (hM y)) hy
+
+/-- Increasing parameters give increasing closed superlevels. -/
+theorem superlevel_mono {X : Type*} (g : X → ℝ) {s t : ℝ} (hst : s ≤ t) :
+ superlevel_set g s ⊆ superlevel_set g t := by
+ intro x hx
+ exact le_trans (neg_le_neg hst) hx
+
+/-- Each level is closed when the function is continuous. -/
+theorem superlevel_isClosed {X : Type*} [TopologicalSpace X]
+ (g : X → ℝ) (hg : Continuous g) (t : ℝ) : IsClosed (superlevel_set g t) := by
+ exact isClosed_le continuous_const hg
+
+/-- Continuity of the inclusion is independent of continuity of the height function. -/
+def superlevel_inclusion {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) {s t : ℝ} (hst : s ≤ t) :
+ C(superlevel_set g s, superlevel_set g t) :=
+ ContinuousMap.inclusion (superlevel_mono g hst)
+
+theorem superlevel_inclusion_id {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (t : ℝ) :
+ superlevel_inclusion g (le_refl t) = ContinuousMap.id (superlevel_set g t) := by
+ ext x
+ rfl
+
+theorem superlevel_inclusion_comp {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) {r s t : ℝ} (hrs : r ≤ s) (hst : s ≤ t) :
+ (superlevel_inclusion g hst).comp (superlevel_inclusion g hrs) =
+ superlevel_inclusion g (hrs.trans hst) := by
+ ext x
+ rfl
+
+/-- Point membership at its own height; this is not a component-birth theorem. -/
+theorem superlevel_mem_at_own_height {X : Type*} (g : X → ℝ) (x : X) :
+ x ∈ superlevel_set g (-g x) := by
+ simp [superlevel_set]
+
+theorem superlevel_neg_height {X : Type*} (g : X → ℝ) (h : ℝ) :
+ superlevel_set g (-h) = {x | h ≤ g x} := by
+ ext x
+ simp [superlevel_set]
+
+/-- An explicit threshold countercontrol; it is not a compact Morse counterexample. -/
+theorem superlevel_control_strict_thresholds :
+ (∀ h : ℝ, h < 0 → ∃ k : ℝ, h < k ∧ k < 0) ∧
+ ¬ ∃ k : ℝ, 0 ≤ k ∧ k < 0 := by
+ constructor
+ · intro h hh
+ exact ⟨h / 2, by linarith, by linarith⟩
+ · rintro ⟨k, hk, hk'⟩
+ exact (not_lt_of_ge hk) hk'
+
+/-- The induced map on actual path-component quotients. -/
+def superlevel_componentMap {X Y : Type w} [TopologicalSpace X] [TopologicalSpace Y]
+ (f : C(X, Y)) : ZerothHomotopy X → ZerothHomotopy Y :=
+ ZerothHomotopy.lift (fun x => ZerothHomotopy.mk (f x))
+ (fun _ _ p => ZerothHomotopy.sound (p.map f.continuous))
+
+theorem superlevel_componentMap_mk {X Y : Type w}
+ [TopologicalSpace X] [TopologicalSpace Y] (f : C(X, Y)) (x : X) :
+ superlevel_componentMap f (ZerothHomotopy.mk x) = ZerothHomotopy.mk (f x) := rfl
+
+theorem superlevel_componentMap_id {X : Type w} [TopologicalSpace X] :
+ superlevel_componentMap (ContinuousMap.id X) = id := by
+ funext q
+ obtain ⟨x, rfl⟩ := ZerothHomotopy.mk_surjective q
+ rfl
+
+theorem superlevel_componentMap_comp {X Y Z : Type w}
+ [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace Z]
+ (f : C(X, Y)) (g : C(Y, Z)) :
+ superlevel_componentMap (g.comp f) =
+ superlevel_componentMap g ∘ superlevel_componentMap f := by
+ funext q
+ obtain ⟨x, rfl⟩ := ZerothHomotopy.mk_surjective q
+ rfl
+
+def superlevel_componentInclusion {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) {s t : ℝ} (hst : s ≤ t) :
+ ZerothHomotopy (superlevel_set g s) → ZerothHomotopy (superlevel_set g t) :=
+ superlevel_componentMap (superlevel_inclusion g hst)
+
+theorem superlevel_componentInclusion_id {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (t : ℝ) : superlevel_componentInclusion g (le_refl t) = id := by
+ funext q
+ obtain ⟨x, rfl⟩ := ZerothHomotopy.mk_surjective q
+ rfl
+
+theorem superlevel_componentInclusion_comp {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) {r s t : ℝ} (hrs : r ≤ s) (hst : s ≤ t) :
+ superlevel_componentInclusion g (hrs.trans hst) =
+ superlevel_componentInclusion g hst ∘ superlevel_componentInclusion g hrs := by
+ funext q
+ obtain ⟨x, rfl⟩ := ZerothHomotopy.mk_surjective q
+ rfl
+
+/-- Actual component equality is precisely a path in the ambient closed superlevel. -/
+theorem superlevel_component_eq_iff_joinedIn {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (t : ℝ) (x y : superlevel_set g t) :
+ ZerothHomotopy.mk x = ZerothHomotopy.mk y ↔
+ JoinedIn (superlevel_set g t) x.val y.val := by
+ constructor
+ · intro h
+ have hxy : Joined x y := Quotient.exact h
+ exact (joinedIn_iff_joined x.property y.property).2 hxy
+ · intro h
+ obtain ⟨p⟩ := (joinedIn_iff_joined x.property y.property).1 h
+ exact ZerothHomotopy.sound p
+
+/-- The topological filtration in the preorder category of real numbers. -/
+def superlevel_filtration {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) : ℝ ⥤ TopCat.{w} where
+ obj t := TopCat.of (superlevel_set g t)
+ map f := TopCat.ofHom (superlevel_inclusion g (leOfHom f))
+ map_id t := by
+ ext x
+ rfl
+ map_comp f k := by
+ ext x
+ rfl
+
+variable {C : Type u} [Category.{v} C]
+ [CategoryTheory.Limits.HasCoproducts.{w} C]
+ [Preadditive C] [CategoryWithHomology C]
+
+/-- Actual singular H0 with coefficient object R, including the inclusion maps. -/
+def superlevel_h0Filtration {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (R : C) : ℝ ⥤ C :=
+ superlevel_filtration g ⋙ (AlgebraicTopology.singularHomologyFunctor C 0).obj R
+
+/-- This target includes the actual H0 definition in the transitive dependency audit. -/
+theorem superlevel_h0Filtration_map_id {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (R : C) (t : ℝ) :
+ (superlevel_h0Filtration g R).map (𝟙 t) =
+ 𝟙 ((superlevel_h0Filtration g R).obj t) :=
+ (superlevel_h0Filtration g R).map_id t
+
+theorem superlevel_h0Filtration_map_comp {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (R : C) {r s t : ℝ} (f : r ⟶ s) (k : s ⟶ t) :
+ (superlevel_h0Filtration g R).map (f ≫ k) =
+ (superlevel_h0Filtration g R).map f ≫ (superlevel_h0Filtration g R).map k :=
+ (superlevel_h0Filtration g R).map_comp f k
+
+end TorusFiltration
\ No newline at end of file
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean
new file mode 100644
index 000000000..7bc5f8002
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean
@@ -0,0 +1,339 @@
+import Mathlib
+import ClosedSuperlevel
+
+/-!
+# Actual ordinary singular H0 and path components, naturally
+
+C264 isolated source candidate. Compilation and kernel audit: NOT_RUN.
+The homology objects and maps below are Mathlib's singular homology functor.
+The comparison is its existing objectwise `TopCat.singularHomology₀Iso`;
+its naturality is proved here from actual zero-cycle generators.
+
+The coefficient object belongs to an arbitrary preadditive category with
+the required coproducts and homology. Nonzero/distinction controls explicitly
+require `𝟙 R ≠ 0`; no nonzero claim is made for a zero coefficient object.
+
+This supplies the component/H0 comparison for the existing closed-superlevel
+filtration. It supplies no Morse chart, critical-level attainment theorem,
+interval decomposition, elder correspondence, Field adapter, count identity,
+stochastic law, or scientific-status promotion.
+
+Owner repairs at the pin (Anthropic/Claude lane, companion owner, recorded as the
+actual repair author; handoff bytes SHA-256
+261dd0526d42890d8a4ac1225fcf47228eb3c9799af4106cb643a528bcbf968e did not elaborate
+with `-DwarningAsError=true`, Math- #428 comments 6113300903 and 6113372506): the
+homology instances `[Preadditive C] [CategoryWithHomology C]` enter the `variable`
+scope only after `ordinaryH0_componentCoproductMap_iota`, `ordinaryH0_componentFiltration`
+and `ordinaryH0_componentFiltration_map_iota`, which do not use them (the two filtration
+declarations therefore precede the homology ones; no statement changed);
+`ordinaryH0_iso_naturality` is proved by explicit `rw`/`erw` reassociation of both sides
+(the source author's five-step `calc` elaborated with an unresolved `Trans` instance
+at the pin) instead of a `simp only` that left the right side unreassociated; `isoWhiskerLeft` is referred to as `Functor.isoWhiskerLeft`; the
+three declaration names ending in `ι` are spelled `…_iota` / `…Iota…` for the
+companion's ASCII identifier rule. No statement changed.
+-/
+
+noncomputable section
+
+open CategoryTheory Limits AlgebraicTopology
+open scoped Simplicial
+
+universe w v u
+
+namespace TorusFiltration
+
+/-- Proves: actual path-component quotients form a functor on topological spaces.
+Method: use the existing continuous-map quotient map and its identity/composition laws.
+Does not establish: equality of connected and path-connected components. -/
+def ordinaryH0_componentFunctor : TopCat.{w} ⥤ Type w where
+ obj X := ZerothHomotopy X
+ map f := TypeCat.ofHom (superlevel_componentMap f.hom)
+ map_id X := by
+ apply ConcreteCategory.hom_ext
+ intro q
+ exact congrFun superlevel_componentMap_id q
+ map_comp f g := by
+ apply ConcreteCategory.hom_ext
+ intro q
+ exact congrFun (superlevel_componentMap_comp f.hom g.hom) q
+
+variable {C : Type u} [Category.{v} C] [HasCoproducts.{w} C]
+
+/-- Proves: the component-indexed coproduct construction is a functor.
+Method: compose the actual component functor with the categorical coproduct functor.
+Does not establish: an identification with homology until naturality is proved below. -/
+def ordinaryH0_componentCoproductFunctor (R : C) : TopCat.{w} ⥤ C :=
+ ordinaryH0_componentFunctor ⋙ sigmaConst.obj R
+
+/-- Proves: a coproduct generator maps to the component of its continuous image.
+Method: the universal coproduct map sends each inclusion to its indexed image.
+Does not establish: that distinct source components stay distinct. -/
+theorem ordinaryH0_componentCoproductMap_iota (R : C) {X Y : TopCat.{w}}
+ (f : X ⟶ Y) (q : ZerothHomotopy X) :
+ Sigma.ι (fun _ : ZerothHomotopy X => R) q ≫
+ (ordinaryH0_componentCoproductFunctor R).map f =
+ Sigma.ι (fun _ : ZerothHomotopy Y => R) (superlevel_componentMap f.hom q) := by
+ simp [ordinaryH0_componentCoproductFunctor, ordinaryH0_componentFunctor, sigmaConst]
+
+/-- Proves: the existing closed-superlevel family has a component-indexed coproduct filtration.
+Method: compose its actual continuous inclusions with the proved component coproduct functor.
+Does not establish: regularity, finite dimensionality, or Morse hypotheses for the height function. -/
+def ordinaryH0_componentFiltration {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (R : C) : ℝ ⥤ C :=
+ superlevel_filtration g ⋙ ordinaryH0_componentCoproductFunctor R
+
+/-- Proves: a filtration component generator maps by the existing actual component inclusion.
+Method: specialize the coproduct generator map formula to a closed-superlevel inclusion.
+Does not establish: a reverse inclusion or endpoint deletion. -/
+theorem ordinaryH0_componentFiltration_map_iota {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (R : C) {s t : ℝ} (hst : s ≤ t)
+ (q : ZerothHomotopy (superlevel_set g s)) :
+ Sigma.ι (fun _ : ZerothHomotopy (superlevel_set g s) => R) q ≫
+ (ordinaryH0_componentFiltration g R).map (homOfLE hst) =
+ Sigma.ι (fun _ : ZerothHomotopy (superlevel_set g t) => R)
+ (superlevel_componentInclusion g hst q) := by
+ exact ordinaryH0_componentCoproductMap_iota R
+ (TopCat.ofHom (superlevel_inclusion g hst)) q
+
+variable [Preadditive C] [CategoryWithHomology C]
+
+/-- Proves: a zero-simplex defines a morphism into actual simplicial homology.
+Method: include its chain generator, lift through the zero differential, then take its class.
+Does not establish: a replacement definition of homology or any naturality premise. -/
+def ordinaryH0_simplicialPointClass (S : SSet.{w}) (R : C) (x : S _⦋0⦌) :
+ R ⟶ S.homology R 0 :=
+ (S.chainComplex R).liftCycles (S.ιChainComplex x) 0 (by simp) (by simp) ≫
+ (S.chainComplex R).homologyπ 0
+
+/-- Proves: the existing simplicial H0 isomorphism sends a point class to its component.
+Method: apply Mathlib's zero-cycle generator formula.
+Does not establish: naturality merely from the existence of the objectwise isomorphism. -/
+theorem ordinaryH0_simplicialPointClass_iso (S : SSet.{w}) (R : C)
+ (x : S _⦋0⦌) :
+ ordinaryH0_simplicialPointClass S R x ≫ (S.homology₀Iso R).hom =
+ Sigma.ι (fun _ : S.π₀ => R) (SSet.π₀.mk x) := by
+ simpa only [ordinaryH0_simplicialPointClass, Category.assoc] using
+ SSet.liftCycles_ιChainComplex_homologyπ_homology₀Iso_hom S R x
+
+/-- Proves: the actual simplicial homology map carries a point class to its image class.
+Method: homology projection naturality, cycle-lift naturality, and the chain generator formula.
+Does not establish: a transported or postulated substitute for the actual homology map. -/
+theorem ordinaryH0_simplicialPointClass_map (R : C) {S T : SSet.{w}}
+ (f : S ⟶ T) (x : S _⦋0⦌) :
+ ordinaryH0_simplicialPointClass S R x ≫ SSet.homologyMap f R 0 =
+ ordinaryH0_simplicialPointClass T R (f.app _ x) := by
+ simp only [ordinaryH0_simplicialPointClass, SSet.homologyMap, Category.assoc,
+ HomologicalComplex.homologyπ_naturality,
+ HomologicalComplex.liftCycles_comp_cyclesMap_assoc, SSet.ι_chainComplexMap_f]
+
+/-- Proves: the singular zero-simplex of a point maps to that of its continuous image.
+Method: unfold the point/simplex correspondence and the singular-set map.
+Does not establish: a chain or homology identification by itself. -/
+theorem ordinaryH0_toSSet_pointMap {X Y : TopCat.{w}} (f : X ⟶ Y) (x : X) :
+ (TopCat.toSSet.map f).app _ (TopCat.toSSetObj₀Equiv.symm x) =
+ TopCat.toSSetObj₀Equiv.symm (f x) := by
+ rfl
+
+/-- Proves: each point has its actual ordinary singular zero-homology class morphism.
+Method: use the actual singular zero-simplex and the cycle/projection construction above.
+Does not establish: a free-module definition standing in for singular H0. -/
+def ordinaryH0_pointClass (X : TopCat.{w}) (R : C) (x : X) :
+ R ⟶ ((singularHomologyFunctor C 0).obj R).obj X :=
+ ordinaryH0_simplicialPointClass (TopCat.toSSet.obj X) R
+ (TopCat.toSSetObj₀Equiv.symm x)
+
+/-- Proves: actual continuous-map-induced singular H0 maps transport point classes.
+Method: specialize the proved simplicial generator naturality to the singular-set functor.
+Does not establish: injectivity of the induced map. -/
+theorem ordinaryH0_pointClass_map (R : C) {X Y : TopCat.{w}}
+ (f : X ⟶ Y) (x : X) :
+ ordinaryH0_pointClass X R x ≫ ((singularHomologyFunctor C 0).obj R).map f =
+ ordinaryH0_pointClass Y R (f x) := by
+ change ordinaryH0_simplicialPointClass (TopCat.toSSet.obj X) R
+ (TopCat.toSSetObj₀Equiv.symm x) ≫
+ SSet.homologyMap (TopCat.toSSet.map f) R 0 =
+ ordinaryH0_simplicialPointClass (TopCat.toSSet.obj Y) R
+ (TopCat.toSSetObj₀Equiv.symm (f x))
+ rw [ordinaryH0_simplicialPointClass_map, ordinaryH0_toSSet_pointMap]
+
+/-- Proves: Mathlib's existing topological comparison sends actual point classes to components.
+Method: combine the simplicial generator formula with the actual path-component equivalence.
+Does not establish: any connected-component substitution. -/
+theorem ordinaryH0_pointClass_iso (X : TopCat.{w}) (R : C) (x : X) :
+ ordinaryH0_pointClass X R x ≫ (TopCat.singularHomology₀Iso X R).hom =
+ Sigma.ι (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk x) := by
+ change ordinaryH0_simplicialPointClass (TopCat.toSSet.obj X) R
+ (TopCat.toSSetObj₀Equiv.symm x) ≫
+ ((SSet.homology₀Iso (TopCat.toSSet.obj X) R).hom ≫
+ (sigmaConst.obj R).map TopCat.zerothHomotopyEquiv.toIso.inv) = _
+ rw [← Category.assoc, ordinaryH0_simplicialPointClass_iso]
+ simp [sigmaConst]
+
+/-- Proves: inverse comparison takes each component generator to any representing point class.
+Method: cancel the comparison isomorphism and use the point-class formula.
+Does not establish: a choice of distinguished geometric representative. -/
+theorem ordinaryH0_componentIota_isoInv (X : TopCat.{w}) (R : C) (x : X) :
+ Sigma.ι (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk x) ≫
+ (TopCat.singularHomology₀Iso X R).inv = ordinaryH0_pointClass X R x := by
+ apply (cancel_mono (TopCat.singularHomology₀Iso X R).hom).1
+ simp only [Category.assoc, Iso.inv_hom_id, Category.comp_id, ordinaryH0_pointClass_iso]
+
+/-- Proves: morphisms out of actual singular H0 agree if they agree on all point classes.
+Method: cancel the inverse comparison, use coproduct extensionality and quotient surjectivity.
+Does not establish: a basis of geometric maxima or finiteness of components. -/
+theorem ordinaryH0_hom_ext (X : TopCat.{w}) (R : C) {A : C}
+ {f g : ((singularHomologyFunctor C 0).obj R).obj X ⟶ A}
+ (h : ∀ x : X, ordinaryH0_pointClass X R x ≫ f = ordinaryH0_pointClass X R x ≫ g) :
+ f = g := by
+ apply (cancel_epi (TopCat.singularHomology₀Iso X R).inv).1
+ apply Sigma.hom_ext
+ intro q
+ obtain ⟨x, rfl⟩ := ZerothHomotopy.mk_surjective q
+ simpa only [← Category.assoc, ordinaryH0_componentIota_isoInv] using h x
+
+/-- Proves: the existing actual singular H0 comparison commutes with every continuous map.
+Method: test both composites on actual point classes, transport them, and compare component images.
+Does not establish: naturality by adding an assumption or a compatibility record. -/
+theorem ordinaryH0_iso_naturality (R : C) {X Y : TopCat.{w}} (f : X ⟶ Y) :
+ ((singularHomologyFunctor C 0).obj R).map f ≫
+ (TopCat.singularHomology₀Iso Y R).hom =
+ (TopCat.singularHomology₀Iso X R).hom ≫
+ (ordinaryH0_componentCoproductFunctor R).map f := by
+ apply ordinaryH0_hom_ext X R
+ intro x
+ rw [← Category.assoc, ordinaryH0_pointClass_map, ordinaryH0_pointClass_iso]
+ -- the right side composes through `(ordinaryH0_componentCoproductFunctor R).obj X`, which is
+ -- `∐ fun _ => R` only after unfolding, so its reassociation is rewritten at default transparency
+ erw [← Category.assoc, ordinaryH0_pointClass_iso, ordinaryH0_componentCoproductMap_iota]
+ rfl
+
+/-- Proves: actual ordinary singular H0 is naturally isomorphic to component-indexed coproducts.
+Method: assemble the existing objectwise isomorphisms using the commuting square proved above.
+Does not establish: an interval decomposition or persistence-bar classification. -/
+def ordinaryH0_naturalIso (R : C) :
+ (singularHomologyFunctor C 0).obj R ≅ ordinaryH0_componentCoproductFunctor R :=
+ NatIso.ofComponents (fun X => TopCat.singularHomology₀Iso X R)
+ (fun f => ordinaryH0_iso_naturality R f)
+
+/-- Proves: ordinary augmentation sends every actual point-class morphism to the coefficient identity.
+Method: use the comparison's augmentation formula and the coproduct universal property.
+Does not establish: reduced-H0 vanishing; this retains the ordinary point class. -/
+theorem ordinaryH0_pointClass_augmentation (X : TopCat.{w}) (R : C) (x : X) :
+ ordinaryH0_pointClass X R x ≫ TopCat.singularHomology₀ε X R = 𝟙 R := by
+ rw [← TopCat.singularHomology₀Iso_sigma_desc_id X R, ← Category.assoc,
+ ordinaryH0_pointClass_iso]
+ simp
+
+/-- Proves: an actual point class is nonzero for a coefficient object with nonzero identity.
+Method: compose a proposed zero class with ordinary augmentation.
+Does not establish: nonzero classes for a zero coefficient object. -/
+theorem ordinaryH0_pointClass_ne_zero (X : TopCat.{w}) (R : C)
+ (hR : (𝟙 R : R ⟶ R) ≠ 0) (x : X) : ordinaryH0_pointClass X R x ≠ 0 := by
+ intro h
+ have hε := ordinaryH0_pointClass_augmentation X R x
+ rw [h, zero_comp] at hε
+ exact hR hε.symm
+
+/-- Proves: points in the same actual path component give equal ordinary H0 class morphisms.
+Method: cancel the objectwise comparison and compare their component indices.
+Does not establish: a converse for zero coefficients. -/
+theorem ordinaryH0_pointClass_eq_of_component_eq (X : TopCat.{w}) (R : C)
+ (x y : X) (h : ZerothHomotopy.mk x = ZerothHomotopy.mk y) :
+ ordinaryH0_pointClass X R x = ordinaryH0_pointClass X R y := by
+ apply (cancel_mono (TopCat.singularHomology₀Iso X R).hom).1
+ rw [ordinaryH0_pointClass_iso, ordinaryH0_pointClass_iso, h]
+
+/-- Proves: the difference of same-component point classes is zero for arbitrary coefficients.
+Method: subtract the equality proved from actual path-component equality.
+Does not establish: that either individual point class dies. -/
+theorem ordinaryH0_sameComponent_difference_zero (X : TopCat.{w}) (R : C)
+ (x y : X) (h : ZerothHomotopy.mk x = ZerothHomotopy.mk y) :
+ ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y = 0 := by
+ rw [ordinaryH0_pointClass_eq_of_component_eq X R x y h, sub_self]
+
+/-- Proves: distinct actual path components have distinct ordinary H0 class morphisms if coefficients are nonzero.
+Method: separate the two coproduct injections by an identity/zero component projection.
+Does not establish: distinction with zero coefficients or distinction of points within one component. -/
+theorem ordinaryH0_pointClass_ne_of_component_ne (X : TopCat.{w}) (R : C)
+ (hR : (𝟙 R : R ⟶ R) ≠ 0) (x y : X)
+ (hxy : ZerothHomotopy.mk x ≠ ZerothHomotopy.mk y) :
+ ordinaryH0_pointClass X R x ≠ ordinaryH0_pointClass X R y := by
+ classical
+ intro h
+ have hc : Sigma.ι (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk x) =
+ Sigma.ι (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk y) := by
+ simpa only [ordinaryH0_pointClass_iso] using
+ congrArg (fun k => k ≫ (TopCat.singularHomology₀Iso X R).hom) h
+ let p : (∐ fun _ : ZerothHomotopy X => R) ⟶ R :=
+ Sigma.desc (fun q => if q = ZerothHomotopy.mk x then 𝟙 R else 0)
+ apply hR
+ simpa [p, Ne.symm hxy] using congrArg (fun k => k ≫ p) hc
+
+/-- Proves: with nonzero coefficients, actual point-class equality is exactly path-component equality.
+Method: combine the same-component formula with the separating projection control.
+Does not establish: equality of geometric points or connected components. -/
+theorem ordinaryH0_pointClass_eq_iff (X : TopCat.{w}) (R : C)
+ (hR : (𝟙 R : R ⟶ R) ≠ 0) (x y : X) :
+ ordinaryH0_pointClass X R x = ordinaryH0_pointClass X R y ↔
+ ZerothHomotopy.mk x = ZerothHomotopy.mk y := by
+ constructor
+ · intro h
+ by_contra hn
+ exact ordinaryH0_pointClass_ne_of_component_ne X R hR x y hn h
+ · exact ordinaryH0_pointClass_eq_of_component_eq X R x y
+
+/-- Proves: the actual H0 map sends a difference of point classes to the difference of image classes.
+Method: distribute composition over subtraction and use proved actual point-class transport.
+Does not establish: death of the individual ordinary point classes. -/
+theorem ordinaryH0_difference_map (R : C) {X Y : TopCat.{w}} (f : X ⟶ Y) (x y : X) :
+ (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) ≫
+ ((singularHomologyFunctor C 0).obj R).map f =
+ ordinaryH0_pointClass Y R (f x) - ordinaryH0_pointClass Y R (f y) := by
+ rw [Preadditive.sub_comp, ordinaryH0_pointClass_map, ordinaryH0_pointClass_map]
+
+/-- Proves: with nonzero coefficients, a mapped difference vanishes exactly when the image points merge in path components.
+Method: actual homology-map transport, subtraction cancellation, and the component equality criterion.
+Does not establish: a Morse merger event, elder selection, death height, or barcode. -/
+theorem ordinaryH0_difference_map_eq_zero_iff (R : C) (hR : (𝟙 R : R ⟶ R) ≠ 0)
+ {X Y : TopCat.{w}} (f : X ⟶ Y) (x y : X) :
+ (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) ≫
+ ((singularHomologyFunctor C 0).obj R).map f = 0 ↔
+ ZerothHomotopy.mk (f x) = ZerothHomotopy.mk (f y) := by
+ rw [ordinaryH0_difference_map, sub_eq_zero, ordinaryH0_pointClass_eq_iff Y R hR]
+
+/-- Proves: the existing actual singular H0 filtration is naturally isomorphic to its component coproduct filtration.
+Method: restrict the proved natural comparison along the existing topological filtration.
+Does not establish: the later interval, elder, maximum/saddle, count, Field, or stochastic bridges. -/
+def ordinaryH0_filtrationIso {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (R : C) :
+ superlevel_h0Filtration g R ≅ ordinaryH0_componentFiltration g R :=
+ Functor.isoWhiskerLeft (superlevel_filtration g) (ordinaryH0_naturalIso R)
+
+/-- Proves: all ordered closed-superlevel inclusion maps satisfy the actual H0/component square.
+Method: read the naturality of the proved filtration isomorphism at the preorder morphism.
+Does not establish: strict-level conventions or any unproved geometric persistence hypothesis. -/
+theorem ordinaryH0_filtration_naturality {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (R : C) {s t : ℝ} (hst : s ≤ t) :
+ (superlevel_h0Filtration g R).map (homOfLE hst) ≫
+ (ordinaryH0_filtrationIso g R).hom.app t =
+ (ordinaryH0_filtrationIso g R).hom.app s ≫
+ (ordinaryH0_componentFiltration g R).map (homOfLE hst) :=
+ (ordinaryH0_filtrationIso g R).hom.naturality (homOfLE hst)
+
+/-- Proves: under a closed-superlevel inclusion, a difference vanishes exactly when the two included points are joined in the target closed superlevel.
+Method: apply the actual H0 difference control and the existing component/JoinedIn equivalence.
+Does not establish: attainment of a critical death threshold or an elder/barcode theorem. -/
+theorem ordinaryH0_filtration_difference_zero_iff_joinedIn
+ {X : Type w} [TopologicalSpace X] (g : X → ℝ) (R : C)
+ (hR : (𝟙 R : R ⟶ R) ≠ 0) {s t : ℝ} (hst : s ≤ t)
+ (x y : superlevel_set g s) :
+ (ordinaryH0_pointClass (TopCat.of (superlevel_set g s)) R x -
+ ordinaryH0_pointClass (TopCat.of (superlevel_set g s)) R y) ≫
+ (superlevel_h0Filtration g R).map (homOfLE hst) = 0 ↔
+ JoinedIn (superlevel_set g t) x.val y.val := by
+ exact (ordinaryH0_difference_map_eq_zero_iff R hR
+ (TopCat.ofHom (superlevel_inclusion g hst)) x y).trans
+ (superlevel_component_eq_iff_joinedIn g t
+ (superlevel_inclusion g hst x) (superlevel_inclusion g hst y))
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/OrdinaryH0Controls.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/OrdinaryH0Controls.lean
new file mode 100644
index 000000000..187bbcadb
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/OrdinaryH0Controls.lean
@@ -0,0 +1,453 @@
+import Mathlib
+import OrdinaryH0
+
+/-!
+# Instantiated ordinary-H0 controls for the C264 module
+
+C264 owner task item 4 (Math- #428 comment 6113277485): concrete fixtures for the
+CONTROL_OBLIGATIONS matrix quoted in the C264 nonauthor source review (Math- #428 comment
+6113277173), exercised against the registered `OrdinaryH0` successor that this module
+imports: SHA-256 3d6b0d6b53413c484b1d010bccf0d53ae7f75becb2d747868f22dbd673fe0a88,
+19803 bytes, the owner repair of the handoff bytes SHA-256
+261dd0526d42890d8a4ac1225fcf47228eb3c9799af4106cb643a528bcbf968e (18469 bytes). That
+successor stands under the C264 handoff's own FORMAL HOLD; registration is not review. The
+handoffs rest that hold on their own listed conditions (Math- #428 comments 6113277485 item
+5 and 6113372506; for C263, 6113033545 item 4), among them a distinct review of the
+source-bound execution output and source-bound hosted evidence and custody; they say a
+source review alone does not meet them. The C264 nonauthor source review (Math- #428
+comment 6113277173) read the handoff bytes, not the successor. The nonauthor engineering
+readback of 4c33d8cd..940dffc9 (Math- #428 review 5485829137, 01:16Z on 2026-10-12, PASS)
+read the successor bytes for identity and registration only and records
+organizational-independence credit 0. Since 01:32Z on 2026-10-12 a nonauthor exact-source
+review of the compiled successors exists, source-scoped only: Math- #428 review 5485883117
+(Muse Spark / Meta, first read, PASS source-scoped for each module; count corrected in Math-
+#428 comment 6116328276). Its reviewer did not run Lean and keeps Lean execution as an open
+condition under FORMAL HOLD; it states no organizational-independence credit and was posted
+from the same project account. FORMAL HOLD is unchanged; its disposition is for the
+C263/C264 handoff owners, and alignment still needs a reviewer with nonzero
+organizational-independence credit. These fixtures are not a review of `OrdinaryH0` and
+lift nothing.
+Universe 0 throughout: spaces in `TopCat.{0}`, coefficients in `ModuleCat.{0} ℤ`.
+
+Every premise is proved inside the fixture: the nonzero identities of `ℤ` and of `ZMod 2`,
+the zero identity of the zero module, the path joining `0` and `1` in `ℝ`, the separation
+of distinct points of a discrete space, the target-component equalities and separations
+under the collapse `Bool → Unit` and the first projection `Bool × Bool → Bool`, and the
+absence of a path through `0` in the closed superlevel `{x | 1/4 ≤ x ^ 2}`. No hypothesis,
+compatibility field or axiom states a naturality, merger or separation fact.
+
+The fixtures keep the death of a difference apart from the survival of each individual
+point class: a merger kills the difference while each image class stays nonzero. One
+non-injective map (the projection) kills one difference and keeps another, and a strict
+closed-superlevel inclusion keeps a difference alive. With zero coefficients ordinary H0
+of every space in `TopCat.{0}` is a zero object through the module's natural comparison,
+so the two point classes of `Bool` coincide although their path components differ: the
+nonzero-coefficient hypothesis of the separation statements cannot be dropped. With
+`ZMod 2` coefficients, a characteristic-two object, the separation holds.
+
+Author: Anthropic/Claude lane (companion owner), delegated AI work for Dylan Roy.
+Compilation and kernel audit of these bytes are recorded only where a run is reported.
+Organizational-independence credit 0. Scientific effect NONE.
+
+These are instantiated controls of the categorical H0/path-component comparison only.
+They supply no Morse chart, critical-level attainment theorem, interval decomposition,
+elder correspondence, Field adapter, count identity, stochastic law, or scientific-status
+promotion.
+-/
+
+noncomputable section
+
+open CategoryTheory Limits AlgebraicTopology
+
+namespace TorusFiltration
+
+/-- Proves: nothing; it names the integer coefficient object `ℤ` as a `ℤ`-module at universe 0.
+Method: Mathlib's `ModuleCat.of`.
+Does not establish: any homology computation. -/
+abbrev ordinaryH0Control_intCoeff : ModuleCat.{0} ℤ := ModuleCat.of ℤ ℤ
+
+/-- Proves: nothing; it names the zero coefficient object, the one-point `ℤ`-module at universe 0.
+Method: Mathlib's `ModuleCat.of` on `PUnit`.
+Does not establish: any homology computation. -/
+abbrev ordinaryH0Control_zeroCoeff : ModuleCat.{0} ℤ := ModuleCat.of ℤ PUnit.{1}
+
+/-- Proves: nothing; it names the characteristic-two coefficient object `ZMod 2` as a `ℤ`-module at universe 0.
+Method: Mathlib's `ModuleCat.of`.
+Does not establish: any homology computation. -/
+abbrev ordinaryH0Control_mod2Coeff : ModuleCat.{0} ℤ := ModuleCat.of ℤ (ZMod 2)
+
+/-- Proves: the identity of the integer coefficient object is not the zero morphism.
+Method: evaluate both morphisms at `1 : ℤ`, where they give `1` and `0`.
+Does not establish: nonvanishing of any homology class by itself. -/
+theorem ordinaryH0Control_intCoeff_id_ne_zero :
+ (𝟙 ordinaryH0Control_intCoeff : ordinaryH0Control_intCoeff ⟶ ordinaryH0Control_intCoeff) ≠ 0 := by
+ intro h
+ have h1 : (1 : ℤ) = 0 :=
+ congrArg (fun f : ordinaryH0Control_intCoeff ⟶ ordinaryH0Control_intCoeff => f.hom (1 : ℤ)) h
+ exact one_ne_zero h1
+
+/-- Proves: the identity of the `ZMod 2` coefficient object is not the zero morphism.
+Method: evaluate both morphisms at `1 : ZMod 2`, where they give `1` and `0`, which differ by `decide`.
+Does not establish: nonvanishing of any homology class by itself. -/
+theorem ordinaryH0Control_mod2Coeff_id_ne_zero :
+ (𝟙 ordinaryH0Control_mod2Coeff : ordinaryH0Control_mod2Coeff ⟶ ordinaryH0Control_mod2Coeff) ≠ 0 := by
+ intro h
+ have h1 : (1 : ZMod 2) = 0 :=
+ congrArg (fun f : ordinaryH0Control_mod2Coeff ⟶ ordinaryH0Control_mod2Coeff => f.hom (1 : ZMod 2)) h
+ exact absurd h1 (by decide)
+
+/-- Proves: the `ZMod 2` coefficient object has characteristic two: its identity added to itself is zero.
+Method: pointwise, `x + x = 0` in `ZMod 2` by Mathlib's characteristic-two identity.
+Does not establish: any homology computation. -/
+theorem ordinaryH0Control_mod2Coeff_id_add_self :
+ (𝟙 ordinaryH0Control_mod2Coeff : ordinaryH0Control_mod2Coeff ⟶ ordinaryH0Control_mod2Coeff) +
+ 𝟙 ordinaryH0Control_mod2Coeff = 0 := by
+ ext x
+ change x + x = 0
+ exact CharTwo.add_self_eq_zero x
+
+/-- Proves: the one-point module is a zero object of `ModuleCat ℤ`.
+Method: Mathlib's zero-object criterion for a subsingleton module.
+Does not establish: vanishing of homology with nonzero coefficients. -/
+theorem ordinaryH0Control_zeroCoeff_isZero : IsZero ordinaryH0Control_zeroCoeff :=
+ ModuleCat.isZero_of_subsingleton _
+
+/-- Proves: the identity of the zero coefficient object is the zero morphism.
+Method: any two morphisms out of a zero object agree.
+Does not establish: that the zero coefficient object satisfies the nonzero-coefficient hypothesis. -/
+theorem ordinaryH0Control_zeroCoeff_id_eq_zero :
+ (𝟙 ordinaryH0Control_zeroCoeff : ordinaryH0Control_zeroCoeff ⟶ ordinaryH0Control_zeroCoeff) = 0 :=
+ ordinaryH0Control_zeroCoeff_isZero.eq_of_src _ _
+
+/-- Proves: the empty space has no path component.
+Method: every component is the class of a point, and the empty space has no point.
+Does not establish: anything about a nonempty space. -/
+theorem ordinaryH0Control_empty_components : IsEmpty (ZerothHomotopy (TopCat.of Empty)) := by
+ constructor
+ intro q
+ obtain ⟨x, rfl⟩ := ZerothHomotopy.mk_surjective q
+ exact Empty.elim x
+
+/-- Proves: the component-indexed coproduct of the empty space is a zero object for every coefficient module.
+Method: its identity and zero morphism agree on every (absent) coproduct inclusion.
+Does not establish: vanishing for a nonempty space with nonzero coefficients. -/
+theorem ordinaryH0Control_empty_componentCoproduct_isZero (R : ModuleCat.{0} ℤ) :
+ IsZero ((ordinaryH0_componentCoproductFunctor R).obj (TopCat.of Empty)) := by
+ rw [IsZero.iff_id_eq_zero]
+ change 𝟙 (∐ fun _ : ZerothHomotopy (TopCat.of Empty) => R) = 0
+ exact Sigma.hom_ext _ _ (fun q => (ordinaryH0Control_empty_components.false q).elim)
+
+/-- Proves: actual ordinary singular H0 of the empty space with integer coefficients is a zero object.
+Method: transport the empty-coproduct zero object along the proved natural comparison `ordinaryH0_naturalIso`.
+Does 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. -/
+theorem ordinaryH0Control_empty_h0_isZero :
+ IsZero (((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intCoeff).obj
+ (TopCat.of Empty)) :=
+ (ordinaryH0Control_empty_componentCoproduct_isZero ordinaryH0Control_intCoeff).of_iso
+ ((ordinaryH0_naturalIso ordinaryH0Control_intCoeff).app (TopCat.of Empty))
+
+/-- Proves: with zero coefficients the component-indexed coproduct of every space is a zero object.
+Method: its identity and zero morphism agree on every coproduct inclusion, each out of the zero module.
+Does not establish: vanishing with nonzero coefficients. -/
+theorem ordinaryH0Control_zeroCoeff_componentCoproduct_isZero (X : TopCat.{0}) :
+ IsZero ((ordinaryH0_componentCoproductFunctor ordinaryH0Control_zeroCoeff).obj X) := by
+ rw [IsZero.iff_id_eq_zero]
+ change 𝟙 (∐ fun _ : ZerothHomotopy X => ordinaryH0Control_zeroCoeff) = 0
+ exact Sigma.hom_ext _ _ (fun _ => ordinaryH0Control_zeroCoeff_isZero.eq_of_src _ _)
+
+/-- Proves: with zero coefficients actual ordinary singular H0 of every space is a zero object.
+Method: transport along the module's natural comparison `ordinaryH0_naturalIso` instantiated at the zero module.
+Does not establish: any statement for nonzero coefficients, or that component distinctions are visible with zero coefficients. -/
+theorem ordinaryH0Control_zeroCoeff_h0_isZero (X : TopCat.{0}) :
+ IsZero (((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_zeroCoeff).obj X) :=
+ (ordinaryH0Control_zeroCoeff_componentCoproduct_isZero X).of_iso
+ ((ordinaryH0_naturalIso ordinaryH0Control_zeroCoeff).app X)
+
+/-- Proves: the point class of the one-point space with integer coefficients augments to the identity of `ℤ`.
+Method: specialize the module's ordinary augmentation formula.
+Does not establish: reduced-H0 vanishing; this is the ordinary point class. -/
+theorem ordinaryH0Control_point_augmentation :
+ ordinaryH0_pointClass (TopCat.of Unit) ordinaryH0Control_intCoeff () ≫
+ TopCat.singularHomology₀ε (TopCat.of Unit) ordinaryH0Control_intCoeff =
+ 𝟙 ordinaryH0Control_intCoeff :=
+ ordinaryH0_pointClass_augmentation _ _ _
+
+/-- Proves: the point class of the one-point space with integer coefficients is nonzero.
+Method: the module's nonvanishing theorem with the proved nonzero identity of `ℤ`.
+Does not establish: nonvanishing with zero coefficients. -/
+theorem ordinaryH0Control_point_ne_zero :
+ ordinaryH0_pointClass (TopCat.of Unit) ordinaryH0Control_intCoeff () ≠ 0 :=
+ ordinaryH0_pointClass_ne_zero (TopCat.of Unit) ordinaryH0Control_intCoeff
+ ordinaryH0Control_intCoeff_id_ne_zero ()
+
+/-- Proves: actual ordinary singular H0 of the one-point space with integer coefficients is not a zero object.
+Method: a zero target would force the nonzero point class to vanish.
+Does not establish: a computation of that H0 beyond its nonvanishing. -/
+theorem ordinaryH0Control_point_h0_not_isZero :
+ ¬ IsZero (((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intCoeff).obj
+ (TopCat.of Unit)) :=
+ fun h => ordinaryH0Control_point_ne_zero (h.eq_of_tgt _ _)
+
+/-- Proves: `0` and `1` lie in the same actual path component of the real line.
+Method: the explicit path `t ↦ t` along the unit interval.
+Does not establish: path-connectedness of any closed superlevel. -/
+theorem ordinaryH0Control_line_component_eq :
+ ZerothHomotopy.mk (0 : ℝ) = ZerothHomotopy.mk (1 : ℝ) :=
+ ZerothHomotopy.sound
+ { toFun := fun t => (t : ℝ)
+ continuous_toFun := continuous_subtype_val
+ source' := rfl
+ target' := rfl }
+
+/-- Proves: with integer coefficients the point classes of `0` and `1` in the real line have zero difference.
+Method: the module's same-component theorem with the proved path premise.
+Does not establish: that either individual point class dies. -/
+theorem ordinaryH0Control_line_difference_zero_int :
+ ordinaryH0_pointClass (TopCat.of ℝ) ordinaryH0Control_intCoeff (0 : ℝ) -
+ ordinaryH0_pointClass (TopCat.of ℝ) ordinaryH0Control_intCoeff (1 : ℝ) = 0 :=
+ ordinaryH0_sameComponent_difference_zero _ _ _ _ ordinaryH0Control_line_component_eq
+
+/-- Proves: with zero coefficients the point classes of `0` and `1` in the real line have zero difference.
+Method: the module's same-component theorem, which carries no coefficient hypothesis.
+Does not establish: any separation statement for zero coefficients. -/
+theorem ordinaryH0Control_line_difference_zero_zeroCoeff :
+ ordinaryH0_pointClass (TopCat.of ℝ) ordinaryH0Control_zeroCoeff (0 : ℝ) -
+ ordinaryH0_pointClass (TopCat.of ℝ) ordinaryH0Control_zeroCoeff (1 : ℝ) = 0 :=
+ ordinaryH0_sameComponent_difference_zero _ _ _ _ ordinaryH0Control_line_component_eq
+
+/-- Proves: with integer coefficients each of the two same-component point classes in the real line is nonzero.
+Method: the module's nonvanishing theorem with the proved nonzero identity of `ℤ`.
+Does not establish: distinctness of the two classes, which are equal. -/
+theorem ordinaryH0Control_line_classes_ne_zero :
+ ordinaryH0_pointClass (TopCat.of ℝ) ordinaryH0Control_intCoeff (0 : ℝ) ≠ 0 ∧
+ ordinaryH0_pointClass (TopCat.of ℝ) ordinaryH0Control_intCoeff (1 : ℝ) ≠ 0 :=
+ ⟨ordinaryH0_pointClass_ne_zero _ _ ordinaryH0Control_intCoeff_id_ne_zero _,
+ ordinaryH0_pointClass_ne_zero _ _ ordinaryH0Control_intCoeff_id_ne_zero _⟩
+
+/-- Proves: distinct points of a discrete space lie in distinct actual path components.
+Method: a path is a continuous map from the connected unit interval into a discrete space, hence constant.
+Does not establish: anything about path components of a non-discrete space. -/
+theorem ordinaryH0Control_discrete_component_ne {X : Type} [TopologicalSpace X] [DiscreteTopology X]
+ {x y : X} (hxy : x ≠ y) : ZerothHomotopy.mk x ≠ ZerothHomotopy.mk y := by
+ intro h
+ obtain ⟨p⟩ : Joined x y := Quotient.exact h
+ have hc : p 0 = p 1 := PreconnectedSpace.constant inferInstance p.continuous
+ rw [p.source, p.target] at hc
+ exact hxy hc
+
+/-- Proves: `true` and `false` lie in distinct actual path components of the discrete space `Bool`.
+Method: the discrete-space separation above with `true ≠ false` by `decide`.
+Does not establish: anything about connected components of other spaces. -/
+theorem ordinaryH0Control_bool_component_ne :
+ ZerothHomotopy.mk true ≠ ZerothHomotopy.mk false :=
+ ordinaryH0Control_discrete_component_ne (by decide)
+
+/-- Proves: with integer coefficients the point classes of `true` and `false` in `Bool` differ.
+Method: the module's separation theorem with the two proved premises.
+Does not establish: separation with zero coefficients. -/
+theorem ordinaryH0Control_bool_pointClass_ne :
+ ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff true ≠
+ ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff false :=
+ ordinaryH0_pointClass_ne_of_component_ne _ _ ordinaryH0Control_intCoeff_id_ne_zero _ _
+ ordinaryH0Control_bool_component_ne
+
+/-- Proves: with `ZMod 2` coefficients, a characteristic-two object, the point classes of `true` and `false` in `Bool` differ.
+Method: the module's separation theorem with the proved nonzero identity of `ZMod 2` and the proved component separation.
+Does not establish: separation for every characteristic-two coefficient object, or with zero coefficients. -/
+theorem ordinaryH0Control_bool_pointClass_ne_mod2 :
+ ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_mod2Coeff true ≠
+ ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_mod2Coeff false :=
+ ordinaryH0_pointClass_ne_of_component_ne _ _ ordinaryH0Control_mod2Coeff_id_ne_zero _ _
+ ordinaryH0Control_bool_component_ne
+
+/-- Proves: nothing; it names the continuous collapse of `Bool` onto the one-point space.
+Method: Mathlib's constant continuous map.
+Does not establish: any homology statement by itself. -/
+def ordinaryH0Control_collapse : TopCat.of Bool ⟶ TopCat.of Unit :=
+ TopCat.ofHom (ContinuousMap.const Bool ())
+
+/-- Proves: with integer coefficients the collapse kills the difference of the two point classes of `Bool`.
+Method: the module's merger criterion with the proved target-component equality in the one-point space.
+Does not establish: that an individual point class dies. -/
+theorem ordinaryH0Control_collapse_difference_zero :
+ (ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff true -
+ ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff false) ≫
+ ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intCoeff).map
+ ordinaryH0Control_collapse = 0 :=
+ (ordinaryH0_difference_map_eq_zero_iff _ ordinaryH0Control_intCoeff_id_ne_zero _ _ _).2 rfl
+
+/-- Proves: with integer coefficients each image point class under the collapse is nonzero.
+Method: actual point-class transport followed by the module's nonvanishing theorem.
+Does not establish: distinctness of the two image classes, which are equal. -/
+theorem ordinaryH0Control_collapse_image_ne_zero (b : Bool) :
+ ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff b ≫
+ ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intCoeff).map
+ ordinaryH0Control_collapse ≠ 0 := by
+ rw [ordinaryH0_pointClass_map]
+ exact ordinaryH0_pointClass_ne_zero _ _ ordinaryH0Control_intCoeff_id_ne_zero _
+
+/-- Proves: a merger kills the difference of the two point classes of `Bool` while each image class survives.
+Method: combine the two collapse controls above.
+Does not establish: a Morse merger event, elder selection or death height. -/
+theorem ordinaryH0Control_collapse_difference_dies_classes_survive :
+ (ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff true -
+ ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff false) ≫
+ ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intCoeff).map
+ ordinaryH0Control_collapse = 0 ∧
+ ∀ b : Bool, ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff b ≫
+ ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intCoeff).map
+ ordinaryH0Control_collapse ≠ 0 :=
+ ⟨ordinaryH0Control_collapse_difference_zero, ordinaryH0Control_collapse_image_ne_zero⟩
+
+/-- Proves: nothing; it names the continuous first projection of the discrete square `Bool × Bool` onto `Bool`, a non-injective map.
+Method: Mathlib's continuous first projection.
+Does not establish: any homology statement by itself. -/
+def ordinaryH0Control_fst : TopCat.of (Bool × Bool) ⟶ TopCat.of Bool :=
+ TopCat.ofHom ⟨Prod.fst, continuous_fst⟩
+
+/-- 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.
+Method: the module's separation theorem with the proved discrete-space component separation, then `sub_ne_zero`.
+Does not establish: any statement about their images. -/
+theorem ordinaryH0Control_square_differences_ne_zero :
+ ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool × Bool) -
+ ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, true) : Bool × Bool) ≠ 0 ∧
+ ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool × Bool) -
+ ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((false, true) : Bool × Bool) ≠ 0 :=
+ ⟨sub_ne_zero.mpr (ordinaryH0_pointClass_ne_of_component_ne _ _ ordinaryH0Control_intCoeff_id_ne_zero _ _
+ (ordinaryH0Control_discrete_component_ne (X := Bool × Bool) (by decide))),
+ sub_ne_zero.mpr (ordinaryH0_pointClass_ne_of_component_ne _ _ ordinaryH0Control_intCoeff_id_ne_zero _ _
+ (ordinaryH0Control_discrete_component_ne (X := Bool × Bool) (by decide)))⟩
+
+/-- Proves: with integer coefficients the projection kills the difference of the classes of `(true, false)` and `(true, true)`, whose images coincide.
+Method: the module's merger criterion with the proved target-component equality.
+Does not establish: that an individual point class dies. -/
+theorem ordinaryH0Control_fst_difference_zero :
+ (ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool × Bool) -
+ ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, true) : Bool × Bool)) ≫
+ ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intCoeff).map
+ ordinaryH0Control_fst = 0 :=
+ (ordinaryH0_difference_map_eq_zero_iff _ ordinaryH0Control_intCoeff_id_ne_zero _ _ _).2 rfl
+
+/-- 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.
+Method: the module's merger criterion, used contrapositively with the proved separation of the image components.
+Does not establish: injectivity of the induced H0 map, which fails on the first pair. -/
+theorem ordinaryH0Control_fst_difference_ne_zero :
+ (ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool × Bool) -
+ ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((false, true) : Bool × Bool)) ≫
+ ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intCoeff).map
+ ordinaryH0Control_fst ≠ 0 := by
+ rw [Ne, ordinaryH0_difference_map_eq_zero_iff _ ordinaryH0Control_intCoeff_id_ne_zero]
+ exact ordinaryH0Control_bool_component_ne
+
+/-- Proves: with zero coefficients the point classes of `true` and `false` in `Bool` are equal.
+Method: any two morphisms out of the zero coefficient object agree.
+Does not establish: equality of their path components, which differ. -/
+theorem ordinaryH0Control_bool_zeroCoeff_eq :
+ ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_zeroCoeff true =
+ ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_zeroCoeff false :=
+ ordinaryH0Control_zeroCoeff_isZero.eq_of_src _ _
+
+/-- Proves: with zero coefficients the point class of the one-point space is zero.
+Method: any two morphisms out of the zero coefficient object agree.
+Does not establish: vanishing of ordinary H0 with nonzero coefficients. -/
+theorem ordinaryH0Control_point_zeroCoeff_eq_zero :
+ ordinaryH0_pointClass (TopCat.of Unit) ordinaryH0Control_zeroCoeff () = 0 :=
+ ordinaryH0Control_zeroCoeff_isZero.eq_of_src _ _
+
+/-- Proves: the separation statement is false once its nonzero-coefficient hypothesis is deleted.
+Method: the zero-coefficient fixture on `Bool` has distinct components and equal point classes.
+Does not establish: any failure of the module's statements, which retain that hypothesis. -/
+theorem ordinaryH0Control_separation_needs_nonzero :
+ ¬ ∀ (X : TopCat.{0}) (R : ModuleCat.{0} ℤ) (x y : X),
+ ZerothHomotopy.mk x ≠ ZerothHomotopy.mk y →
+ ordinaryH0_pointClass X R x ≠ ordinaryH0_pointClass X R y :=
+ fun h => h (TopCat.of Bool) ordinaryH0Control_zeroCoeff true false
+ ordinaryH0Control_bool_component_ne ordinaryH0Control_bool_zeroCoeff_eq
+
+/-- Proves: the nonvanishing statement is false once its nonzero-coefficient hypothesis is deleted.
+Method: the zero-coefficient fixture on the one-point space has a zero point class.
+Does not establish: any failure of the module's statements, which retain that hypothesis. -/
+theorem ordinaryH0Control_nonvanishing_needs_nonzero :
+ ¬ ∀ (X : TopCat.{0}) (R : ModuleCat.{0} ℤ) (x : X), ordinaryH0_pointClass X R x ≠ 0 :=
+ fun h => h (TopCat.of Unit) ordinaryH0Control_zeroCoeff () ordinaryH0Control_point_zeroCoeff_eq_zero
+
+/-- Proves: nothing; it names the point `-1` of the closed superlevel of `x ↦ x ^ 2` at parameter `-1`.
+Method: membership is `-(-1) ≤ (-1) ^ 2`, checked by `norm_num`.
+Does not establish: any component statement by itself. -/
+def ordinaryH0Control_parabolaLeft : superlevel_set (fun x : ℝ => x ^ 2) (-1) :=
+ ⟨-1, by norm_num [superlevel_set]⟩
+
+/-- Proves: nothing; it names the point `1` of the closed superlevel of `x ↦ x ^ 2` at parameter `-1`.
+Method: membership is `-(-1) ≤ 1 ^ 2`, checked by `norm_num`.
+Does not establish: any component statement by itself. -/
+def ordinaryH0Control_parabolaRight : superlevel_set (fun x : ℝ => x ^ 2) (-1) :=
+ ⟨1, by norm_num [superlevel_set]⟩
+
+/-- 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.
+Method: `norm_num`.
+Does not establish: any component or homology statement by itself. -/
+theorem ordinaryH0Control_parabola_le : (-1 : ℝ) ≤ -1 / 4 := by
+ norm_num
+
+/-- 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}`.
+Method: `norm_num` on the three numeric facts.
+Does not establish: any component or homology statement by itself. -/
+theorem ordinaryH0Control_parabola_strict_growth :
+ (-1 : ℝ) < -1 / 4 ∧ (1 / 2 : ℝ) ∈ superlevel_set (fun x : ℝ => x ^ 2) (-1 / 4) ∧
+ (1 / 2 : ℝ) ∉ superlevel_set (fun x : ℝ => x ^ 2) (-1) := by
+ refine ⟨by norm_num, ?_, ?_⟩ <;> norm_num [superlevel_set]
+
+/-- Proves: `-1` and `1` are not joined inside the closed superlevel `{x | 1/4 ≤ x ^ 2}` of `x ↦ x ^ 2` at parameter `-1/4`.
+Method: intermediate value theorem; a joining path would pass through `0`, which lies outside that level.
+Does not establish: a first merger level or threshold attainment. -/
+theorem ordinaryH0Control_parabola_not_joined_quarter :
+ ¬ JoinedIn (superlevel_set (fun x : ℝ => x ^ 2) (-1 / 4))
+ ordinaryH0Control_parabolaLeft.val ordinaryH0Control_parabolaRight.val := by
+ rintro ⟨γ, hγ⟩
+ obtain ⟨t, ht⟩ : (0 : ℝ) ∈ Set.range γ :=
+ intermediate_value_univ 0 1 γ.continuous
+ ⟨by norm_num [ordinaryH0Control_parabolaLeft], by norm_num [ordinaryH0Control_parabolaRight]⟩
+ have hmem := hγ t
+ rw [ht] at hmem
+ norm_num [superlevel_set] at hmem
+
+/-- Proves: `-1` and `1` are joined inside the closed superlevel of `x ↦ x ^ 2` at parameter `0`, which is the whole line.
+Method: the straight segment lies in that level because squares are nonnegative.
+Does not establish: path-connectedness of any other level. -/
+theorem ordinaryH0Control_parabola_joined :
+ JoinedIn (superlevel_set (fun x : ℝ => x ^ 2) 0)
+ ordinaryH0Control_parabolaLeft.val ordinaryH0Control_parabolaRight.val :=
+ JoinedIn.of_segment_subset (by
+ intro z _
+ show -(0 : ℝ) ≤ z ^ 2
+ rw [neg_zero]
+ exact sq_nonneg z)
+
+/-- Proves: with integer coefficients the closed-superlevel inclusion from parameter `-1` to `0` kills the difference of the classes of `-1` and `1`.
+Method: the module's filtration criterion with the proved target-level path.
+Does not establish: that either included point class dies, or that `0` is the first merger level. -/
+theorem ordinaryH0Control_parabola_difference_zero :
+ (ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : ℝ => x ^ 2) (-1)))
+ ordinaryH0Control_intCoeff ordinaryH0Control_parabolaLeft -
+ ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : ℝ => x ^ 2) (-1)))
+ ordinaryH0Control_intCoeff ordinaryH0Control_parabolaRight) ≫
+ (superlevel_h0Filtration (fun x : ℝ => x ^ 2) ordinaryH0Control_intCoeff).map
+ (homOfLE (neg_nonpos.mpr zero_le_one : (-1 : ℝ) ≤ 0)) = 0 :=
+ (ordinaryH0_filtration_difference_zero_iff_joinedIn _ _ ordinaryH0Control_intCoeff_id_ne_zero
+ _ _ _).2 ordinaryH0Control_parabola_joined
+
+/-- 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.
+Method: the module's filtration criterion, used contrapositively with the proved absence of a path in the target level.
+Does not establish: the behaviour at any parameter strictly between `-1/4` and `0`, or the first merger level. -/
+theorem ordinaryH0Control_parabola_strict_difference_ne_zero :
+ (ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : ℝ => x ^ 2) (-1)))
+ ordinaryH0Control_intCoeff ordinaryH0Control_parabolaLeft -
+ ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : ℝ => x ^ 2) (-1)))
+ ordinaryH0Control_intCoeff ordinaryH0Control_parabolaRight) ≫
+ (superlevel_h0Filtration (fun x : ℝ => x ^ 2) ordinaryH0Control_intCoeff).map
+ (homOfLE ordinaryH0Control_parabola_le) ≠ 0 := fun h =>
+ ordinaryH0Control_parabola_not_joined_quarter
+ ((ordinaryH0_filtration_difference_zero_iff_joinedIn _ _ ordinaryH0Control_intCoeff_id_ne_zero
+ _ _ _).1 h)
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean
new file mode 100644
index 000000000..b047384e2
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean
@@ -0,0 +1,299 @@
+import Mathlib
+
+/-!
+# C263 total strict-clearance cut for continuous Euclidean heights
+
+Proves: total essentiality, strict-clearance set and real death value with an
+explicit empty-set value zero; an unconditional bound for clearance members;
+nonemptiness for continuous nonessential inputs; strict witness improvement;
+the exact strict supremum cut, guarded death bound and cut uniqueness.
+
+Method: the starting endpoint bounds every clearance; a straight path and the
+attained minimum on its compact unit-interval parameter supply a lower witness
+and a uniform strict margin; conditional real supremum laws identify the cut.
+
+Does not establish: an inhabitant of the separately owned Field or Lifetime
+record, an elder relation, Morse endpoint attainment, ordinary H0 bar pairing,
+finite-bar counts, a Gaussian field or weighted law, or scientific acceptance.
+The scalar zero on an empty set is a default, not an essential-bar death.
+
+Authored by OpenAI/Codex c262_lean_source_review, now acting as C263 implementer,
+delegated for Dylan Roy. Source/design-exposed; organizational independence 0;
+no human review. Consumes C260 prose SHA-256
+d2462639df32364e6fc8b0fea0703106c668cedb0aa7bb00e139aa81561bd845.
+Target pin: Lean 4.34.1 / Mathlib d13f23b723b8a846827a245b89c10fc7d3f11612.
+Elaboration, kernel audit and executed controls are recorded in separate
+source-bound receipts; this text makes no execution claim.
+
+Compile fix at the pin (Anthropic/Claude lane, companion owner; handoff bytes
+SHA-256 d74dc8b2c25eff5b90ce7133e51a0888c7885cae24ca6d5e648bc514089637a8 did not
+elaborate with `-DwarningAsError=true`): in `superlevelBar_death_eq_sSup_of_nonempty`
+the simp lemma `if_pos` (deprecated in Lean core since 2026-07-21) is replaced by
+its successor `ite_eq_left`, the same statement; no other byte changes.
+-/
+
+noncomputable section
+
+namespace TorusFiltration
+
+/-- Proves: the ambient type is real Euclidean space in the stated dimension.
+Method: a type abbreviation. Does not establish: a positive-dimensional or
+periodic quotient-space hypothesis. -/
+abbrev superlevelBar_E (d : ℕ) := EuclideanSpace ℝ (Fin d)
+
+/-- Proves: the essentiality datum is total. Method: global order comparison.
+Does not establish: an actual persistence interpretation off the guarded locus. -/
+def superlevelBar_isEssential {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) : Prop :=
+ ∀ y, g y ≤ g M
+
+/-- Proves: a total strict-clearance set with the source's existential endpoint.
+Method: quantify over actual paths and every parameter, including endpoints.
+Does not establish: a path attaining the supremum with closed inequalities. -/
+def superlevelBar_clearanceSet {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) : Set ℝ :=
+ {h | ∃ y, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)}
+
+/-- Proves: the death datum is a total real number with explicit empty default.
+Method: nonempty conditional supremum; boundedness is proved below.
+Does not establish: a finite death for an essential class. -/
+def superlevelBar_deathHeight {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) : ℝ := by
+ classical
+ exact if (superlevelBar_clearanceSet g M).Nonempty then
+ sSup (superlevelBar_clearanceSet g M) else 0
+
+/-- Proves: essentiality is exactly global maximality for these total data.
+Method: unfold the defining proposition. Does not establish: agreement with
+an independently defined essential persistence class. -/
+theorem superlevelBar_essential_iff {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) :
+ superlevelBar_isEssential g M ↔ ∀ y, g y ≤ g M := Iff.rfl
+
+/-- Proves: an unconditional strict bound on each clearance member.
+Method: evaluate its path at zero. Does not establish: an unconditional bound
+on the default death value when the clearance set is empty. -/
+theorem superlevelBar_mem_lt_start {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) {h : ℝ} (hh : h ∈ superlevelBar_clearanceSet g M) :
+ h < g M := by
+ obtain ⟨y, hy, γ, hγ⟩ := hh
+ have hzero := hγ (0 : unitInterval)
+ simpa only [γ.source] using hzero
+
+/-- Proves: the clearance set is bounded above, including when empty.
+Method: the initial height bounds each member. Does not establish: that the
+empty-set default death value obeys the same bound. -/
+theorem superlevelBar_clearance_bddAbove {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) : BddAbove (superlevelBar_clearanceSet g M) := by
+ exact ⟨g M, fun h hh => (superlevelBar_mem_lt_start g M hh).le⟩
+
+/-- Proves: essentiality forces the clearance set to be empty.
+Method: contradict the required strictly higher endpoint.
+Does not establish: a converse for arbitrary discontinuous heights. -/
+theorem superlevelBar_clearance_empty_of_essential {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)
+ (hM : superlevelBar_isEssential g M) : superlevelBar_clearanceSet g M = ∅ := by
+ ext h
+ constructor
+ · rintro ⟨y, hy, γ, hγ⟩
+ exact False.elim ((not_lt_of_ge (hM y)) hy)
+ · intro hh
+ exact False.elim hh
+
+/-- Proves: an empty clearance set selects the declared real value zero.
+Method: simplify the conditional definition. Does not establish: a geometric
+death event or finite persistence interval at that zero. -/
+theorem superlevelBar_death_eq_zero_of_empty {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)
+ (he : superlevelBar_clearanceSet g M = ∅) : superlevelBar_deathHeight g M = 0 := by
+ classical
+ simp [superlevelBar_deathHeight, he]
+
+/-- Proves: essential inputs have the declared zero default.
+Method: essentiality implies empty clearance, then use the empty branch.
+Does not establish: an essential-bar death height. -/
+theorem superlevelBar_death_eq_zero_of_essential {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)
+ (hM : superlevelBar_isEssential g M) : superlevelBar_deathHeight g M = 0 := by
+ exact superlevelBar_death_eq_zero_of_empty g M
+ (superlevelBar_clearance_empty_of_essential g M hM)
+
+/-- Proves: nonempty clearance selects its real supremum in the total data.
+Method: simplify the nonempty conditional branch. Does not establish:
+nonemptiness without a witness or a regularity hypothesis. -/
+theorem superlevelBar_death_eq_sSup_of_nonempty {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)
+ (hne : (superlevelBar_clearanceSet g M).Nonempty) :
+ superlevelBar_deathHeight g M = sSup (superlevelBar_clearanceSet g M) := by
+ classical
+ simp only [superlevelBar_deathHeight, ite_eq_left hne]
+
+/-- Proves: a continuous height attains a minimum along each actual path.
+Method: compact unit interval and the extreme-value theorem.
+Does not establish: a minimum over all paths or an optimal path. -/
+theorem superlevelBar_path_minimum {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) {M y : superlevelBar_E d} (γ : Path M y) :
+ ∃ t₀ : unitInterval, ∀ t : unitInterval, g (γ t₀) ≤ g (γ t) := by
+ obtain ⟨t₀, ht₀, hmin⟩ :=
+ (isCompact_univ : IsCompact (Set.univ : Set unitInterval)).exists_isMinOn
+ (show (Set.univ : Set unitInterval).Nonempty from ⟨0, Set.mem_univ _⟩)
+ (hg.comp γ.continuous).continuousOn
+ exact ⟨t₀, fun t => hmin (Set.mem_univ t)⟩
+
+/-- Proves: nonessential continuous inputs have a nonempty clearance set.
+Method: a higher endpoint, Path.segment, and minimum minus one.
+Does not establish: compactness of the whole Euclidean domain. -/
+theorem superlevelBar_clearance_nonempty {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) (M : superlevelBar_E d)
+ (hM : ¬ superlevelBar_isEssential g M) :
+ (superlevelBar_clearanceSet g M).Nonempty := by
+ classical
+ have hhigh : ∃ y, g M < g y := by
+ by_contra hn
+ apply hM
+ intro y
+ exact le_of_not_gt (fun hy => hn ⟨y, hy⟩)
+ obtain ⟨y, hy⟩ := hhigh
+ let γ : Path M y := Path.segment M y
+ obtain ⟨t₀, hmin⟩ := superlevelBar_path_minimum g hg γ
+ refine ⟨g (γ t₀) - 1, y, hy, γ, ?_⟩
+ intro t
+ have ht := hmin t
+ linarith
+
+/-- Proves: for continuous heights, clearance is nonempty exactly off the
+essential locus. Method: the higher witness endpoint and the straight-path
+construction. Does not establish: this equivalence without continuity. -/
+theorem superlevelBar_clearance_nonempty_iff {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (hg : Continuous g) (M : superlevelBar_E d) :
+ (superlevelBar_clearanceSet g M).Nonempty ↔ ¬ superlevelBar_isEssential g M := by
+ constructor
+ · rintro ⟨h, y, hy, γ, hγ⟩ hM
+ exact (not_lt_of_ge (hM y)) hy
+ · exact superlevelBar_clearance_nonempty g hg M
+
+/-- Proves: any smaller threshold than an existing clearance is a clearance.
+Method: reuse the same endpoint and path and compose strict inequalities.
+Does not establish: strict improvement to a larger threshold. -/
+theorem superlevelBar_clearance_downward {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) {h c : ℝ} (hhc : h < c)
+ (hc : c ∈ superlevelBar_clearanceSet g M) : h ∈ superlevelBar_clearanceSet g M := by
+ obtain ⟨y, hy, γ, hγ⟩ := hc
+ exact ⟨y, hy, γ, fun t => hhc.trans (hγ t)⟩
+
+/-- Proves: each strict witness has a larger strict witness on its same path.
+Method: attained minimum and a midpoint below it.
+Does not establish: a witness with clearance strictly above the supremum. -/
+theorem superlevelBar_clearance_improve {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) (M : superlevelBar_E d) {h : ℝ}
+ (hh : h ∈ superlevelBar_clearanceSet g M) :
+ ∃ c : ℝ, h < c ∧ c ∈ superlevelBar_clearanceSet g M := by
+ obtain ⟨y, hy, γ, hγ⟩ := hh
+ obtain ⟨t₀, hmin⟩ := superlevelBar_path_minimum g hg γ
+ have hmargin := hγ t₀
+ refine ⟨(h + g (γ t₀)) / 2, ?_, y, hy, γ, ?_⟩
+ · linarith
+ · intro t
+ have ht := hmin t
+ linarith
+
+/-- Proves: the exact strict cut for continuous nonessential inputs.
+Method: least-upper-bound property, downward closure and strict improvement.
+Does not establish: closed-threshold attainment at the death height. -/
+theorem superlevelBar_strict_cut {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) (M : superlevelBar_E d)
+ (hM : ¬ superlevelBar_isEssential g M) (h : ℝ) :
+ h < superlevelBar_deathHeight g M ↔ h ∈ superlevelBar_clearanceSet g M := by
+ classical
+ have hne := superlevelBar_clearance_nonempty g hg M hM
+ rw [superlevelBar_death_eq_sSup_of_nonempty g M hne]
+ constructor
+ · intro hlt
+ have hex : ∃ c ∈ superlevelBar_clearanceSet g M, h < c := by
+ by_contra hn
+ have hub : ∀ c ∈ superlevelBar_clearanceSet g M, c ≤ h := by
+ intro c hc
+ exact le_of_not_gt (fun hhc => hn ⟨c, hc, hhc⟩)
+ exact (not_le_of_gt hlt) (csSup_le hne hub)
+ obtain ⟨c, hc, hhc⟩ := hex
+ exact superlevelBar_clearance_downward g M hhc hc
+ · intro hh
+ obtain ⟨c, hhc, hc⟩ := superlevelBar_clearance_improve g hg M hh
+ exact hhc.trans_le (le_csSup (superlevelBar_clearance_bddAbove g M) hc)
+
+/-- Proves: the death value is at most the initial height when clearance is
+nonempty. Method: the supremum is at most this upper bound.
+Does not establish: the bound on the empty default branch. -/
+theorem superlevelBar_death_le_start_of_nonempty {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)
+ (hne : (superlevelBar_clearanceSet g M).Nonempty) :
+ superlevelBar_deathHeight g M ≤ g M := by
+ rw [superlevelBar_death_eq_sSup_of_nonempty g M hne]
+ exact csSup_le hne (fun h hh => (superlevelBar_mem_lt_start g M hh).le)
+
+/-- Proves: the death upper bound for continuous nonessential inputs.
+Method: establish nonempty clearance and apply its guarded supremum bound.
+Does not establish: a strict inequality or an attained optimal path. -/
+theorem superlevelBar_death_le_start {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) (M : superlevelBar_E d)
+ (hM : ¬ superlevelBar_isEssential g M) : superlevelBar_deathHeight g M ≤ g M := by
+ exact superlevelBar_death_le_start_of_nonempty g M
+ (superlevelBar_clearance_nonempty g hg M hM)
+
+/-- Proves: the clearance set is the open lower interval below death on the
+continuous nonessential locus. Method: extensionality and the strict cut.
+Does not establish: a closed-threshold path at the excluded endpoint. -/
+theorem superlevelBar_clearance_eq_Iio {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) (M : superlevelBar_E d)
+ (hM : ¬ superlevelBar_isEssential g M) :
+ superlevelBar_clearanceSet g M = Set.Iio (superlevelBar_deathHeight g M) := by
+ ext h
+ exact (superlevelBar_strict_cut g hg M hM h).symm
+
+/-- Proves: death is not a strict clearance for continuous nonessential inputs.
+Method: the cut would otherwise imply that death is strictly below itself.
+Does not establish: failure or success of closed-threshold attainment. -/
+theorem superlevelBar_death_not_mem_clearance {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (hg : Continuous g) (M : superlevelBar_E d)
+ (hM : ¬ superlevelBar_isEssential g M) :
+ superlevelBar_deathHeight g M ∉ superlevelBar_clearanceSet g M := by
+ intro hh
+ have hlt := (superlevelBar_strict_cut g hg M hM (superlevelBar_deathHeight g M)).2 hh
+ exact (lt_irrefl _) hlt
+
+/-- Proves: uniqueness of a real number with this strict cut on the valid locus.
+Method: evaluate either cut at the competing endpoint.
+Does not establish: equality of arbitrary total interface records off that locus. -/
+theorem superlevelBar_cut_unique {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) (M : superlevelBar_E d)
+ (hM : ¬ superlevelBar_isEssential g M) (a : ℝ)
+ (ha : ∀ h : ℝ, h < a ↔ h ∈ superlevelBar_clearanceSet g M) :
+ a = superlevelBar_deathHeight g M := by
+ apply le_antisymm
+ · by_contra hn
+ have hlt : superlevelBar_deathHeight g M < a := lt_of_not_ge hn
+ exact superlevelBar_death_not_mem_clearance g hg M hM ((ha _).1 hlt)
+ · by_contra hn
+ have hlt : a < superlevelBar_deathHeight g M := lt_of_not_ge hn
+ have hc := (superlevelBar_strict_cut g hg M hM a).1 hlt
+ exact (lt_irrefl a) ((ha a).2 hc)
+
+/-- Proves: any constant height selects the zero default at every point.
+Method: every point is globally maximal, hence essential in these data.
+Does not establish: any finite ordinary bar for that constant height. -/
+theorem superlevelBar_death_const (d : ℕ) (b : ℝ) (M : superlevelBar_E d) :
+ superlevelBar_deathHeight (fun _ : superlevelBar_E d => b) M = 0 := by
+ apply superlevelBar_death_eq_zero_of_essential
+ intro y
+ exact le_rfl
+
+/-- Proves: the essential default forbids an unconditional death/start bound.
+Method: constant height minus one has empty clearance and death zero.
+Does not establish: any finite ordinary bar on a constant field. -/
+theorem superlevelBar_control_negative_essential (d : ℕ) (M : superlevelBar_E d) :
+ superlevelBar_deathHeight (fun _ : superlevelBar_E d => (-1 : ℝ)) M = 0 ∧
+ ¬ superlevelBar_deathHeight (fun _ : superlevelBar_E d => (-1 : ℝ)) M ≤ (-1 : ℝ) := by
+ rw [superlevelBar_death_const d (-1) M]
+ norm_num
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean
new file mode 100644
index 000000000..f0300a6b4
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean
@@ -0,0 +1,205 @@
+import Mathlib
+import SuperlevelBar
+import Specifications.Field
+
+/-!
+# C263 adapter: an inhabitant of the Field superlevel-bar interface
+
+Proves: the C263 strict-clearance data (`superlevelBar_deathHeight`,
+`superlevelBar_isEssential`) together with the elder clause's own right-hand side
+inhabit `UniversalLaw.Spec.Field.SuperlevelBarInterface d L` for every `d` and `L`;
+on smooth `L`-periodic heights every inhabitant agrees with this one on essentiality,
+on the death height at nonessential points and, on the Morse distinct-value locus, on
+the elder relation; and the interface leaves the death height at essential points free
+(two inhabitants differ there).
+
+Method: `IsSmooth` at `n = 0` gives continuity, so `superlevelBar_strict_cut` is the
+maximin clause and `superlevelBar_cut_unique` forces agreement of any other death
+height; `essential_iff` is `superlevelBar_essential_iff`; `ElderPartner` is defined as
+the right-hand side of `elderPartner_iff`, so that clause holds by `Iff.rfl`.
+
+Does not establish: an identification of `ElderPartner` with a persistence-module elder
+rule, the source's elder event or its Borel measurability (the clause holds by
+definition, not as a theorem about persistence); any use of periodicity or of `L` in the
+construction (the uniqueness theorems take the periodicity hypothesis only to apply an
+arbitrary inhabitant's clauses, and are false without it); a torus quotient; Morse
+genericity; any meaning of the value `0` that the C263 default
+gives at essential points; anything about the separate
+`UniversalLaw.Spec.Lifetime.SuperlevelBarInterface` (not inhabited here) or about any
+Lifetime statement; scientific acceptance. The statement packet's own text "no
+inhabitant is constructed" is about that packet and stays true of it; nothing in it
+changes. No claim-level label moves; alignment stays PENDING_INDEPENDENT_REVIEW.
+
+Authored by the Anthropic/Claude lane (owner of this companion's gate), delegated AI
+work for Dylan Roy, under the adapter route of Math- #428 comments 6112932068 and
+6124097060; organizational-independence credit 0; no human review. It consumes the
+C263 definitions, whose FORMAL HOLD extends to this module. The interface is
+`specifications/lean_statements_20261010/Specifications/Field.lean`, blob
+cc40e9d19446b8a150401c574d3cfd56177f195f, compiled in the same replay.
+Target pin: Lean 4.34.1 / Mathlib d13f23b723b8a846827a245b89c10fc7d3f11612.
+Elaboration, kernel audit and executed controls are recorded in separate source-bound
+receipts; this text makes no execution claim.
+-/
+
+noncomputable section
+
+open UniversalLaw.Spec.Field
+
+namespace TorusFiltration
+
+/-- Proves: a smooth height in the Field sense is continuous.
+Method: the `n = 0` instance of `IsSmooth` and `ContDiff.continuous`.
+Does not establish: any regularity beyond continuity. -/
+theorem superlevelBarField_continuous {d : ℕ} {g : E d → ℝ} (hg : IsSmooth d g) :
+ Continuous g :=
+ (hg 0).continuous
+
+/-- Proves: the C263 data inhabit the Field interface for every dimension and period.
+Method: death height and essentiality are the C263 definitions, the maximin clause is
+`superlevelBar_strict_cut`, and the elder relation is the right-hand side of its clause.
+Does not establish: a persistence-module elder rule; `elderPartner_iff` holds by
+definition, and periodicity and `L` are not used. -/
+def superlevelBarField_interface (d : ℕ) (L : ℝ) : SuperlevelBarInterface d L where
+ deathHeight := superlevelBar_deathHeight
+ IsEssential := superlevelBar_isEssential
+ ElderPartner := fun g M S =>
+ IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ superlevelBar_isEssential g M ∧
+ superlevelBar_deathHeight g M = g S
+ essential_iff := fun g _ _ M => superlevelBar_essential_iff g M
+ deathHeight_maximin := fun g hs _ M hM h =>
+ superlevelBar_strict_cut g (superlevelBarField_continuous hs) M hM h
+ elderPartner_iff := fun _ _ _ _ _ _ => Iff.rfl
+
+/-- Proves: the Field superlevel-bar interface is inhabited for every `d` and `L`.
+Method: the record above. Does not establish: that any inhabitant is the source's
+superlevel H0 object. -/
+theorem superlevelBarField_nonempty (d : ℕ) (L : ℝ) :
+ Nonempty (SuperlevelBarInterface d L) :=
+ ⟨superlevelBarField_interface d L⟩
+
+/-- Proves: the death height of the record is the C263 death height.
+Method: `rfl`. Does not establish: a finite death for an essential point. -/
+theorem superlevelBarField_deathHeight_eq {d : ℕ} {L : ℝ} (g : E d → ℝ) (M : E d) :
+ (superlevelBarField_interface d L).deathHeight g M = superlevelBar_deathHeight g M :=
+ rfl
+
+/-- Proves: essentiality in the record is global maximality.
+Method: `Iff.rfl`. Does not establish: agreement with a persistence essential class. -/
+theorem superlevelBarField_isEssential_iff {d : ℕ} {L : ℝ} (g : E d → ℝ) (M : E d) :
+ (superlevelBarField_interface d L).IsEssential g M ↔ ∀ y, g y ≤ g M :=
+ Iff.rfl
+
+/-- Proves: the elder relation of the record is, for every height, the right-hand side
+of the interface clause. Method: `Iff.rfl`, since it is defined that way.
+Does not establish: that this relation is ordinary elder death in any persistence sense. -/
+theorem superlevelBarField_elderPartner_iff {d : ℕ} {L : ℝ} (g : E d → ℝ) (M S : E d) :
+ (superlevelBarField_interface d L).ElderPartner g M S ↔
+ (IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ superlevelBar_isEssential g M ∧
+ superlevelBar_deathHeight g M = g S) :=
+ Iff.rfl
+
+/-- Proves: on smooth periodic heights every inhabitant's essentiality is global maximality.
+Method: its own `essential_iff` clause. Does not establish: anything off that locus. -/
+theorem superlevelBarField_essential_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)
+ (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d) :
+ I.IsEssential g M ↔ superlevelBar_isEssential g M :=
+ I.essential_iff g hs hp M
+
+/-- Proves: on smooth periodic heights every inhabitant's death height at a nonessential
+point is the C263 death height. Method: its maximin clause is a strict cut for the
+clearance set, and `superlevelBar_cut_unique` leaves one such number.
+Does not establish: agreement at essential points (see the control below). -/
+theorem superlevelBarField_deathHeight_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)
+ (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d)
+ (hM : ¬ I.IsEssential g M) :
+ I.deathHeight g M = superlevelBar_deathHeight g M := by
+ have hM' : ¬ superlevelBar_isEssential g M :=
+ fun h => hM ((superlevelBarField_essential_unique I g hs hp M).2 h)
+ exact superlevelBar_cut_unique g (superlevelBarField_continuous hs) M hM' _
+ (fun h => I.deathHeight_maximin g hs hp M hM h)
+
+/-- Proves: on the Morse distinct-value locus of smooth periodic heights every inhabitant's
+elder relation is the record's. Method: both are their clause's right-hand side, whose
+essentiality and death-height terms agree by the two uniqueness theorems above.
+Does not establish: agreement off the Morse distinct-value locus, where the interface
+constrains no elder relation. -/
+theorem superlevelBarField_elderPartner_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)
+ (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (hm : IsMorseDistinct d L g)
+ (M S : E d) :
+ I.ElderPartner g M S ↔ (superlevelBarField_interface d L).ElderPartner g M S := by
+ rw [I.elderPartner_iff g hs hp hm M S]
+ constructor
+ · rintro ⟨hmax, hsad, hne, hdeath⟩
+ exact ⟨hmax, hsad, fun h => hne ((superlevelBarField_essential_unique I g hs hp M).2 h),
+ (superlevelBarField_deathHeight_unique I g hs hp M hne).symm.trans hdeath⟩
+ · rintro ⟨hmax, hsad, hne, hdeath⟩
+ have hne' : ¬ I.IsEssential g M :=
+ fun h => hne ((superlevelBarField_essential_unique I g hs hp M).1 h)
+ exact ⟨hmax, hsad, hne', (superlevelBarField_deathHeight_unique I g hs hp M hne').trans hdeath⟩
+
+/-- Proves: a second record, equal to the first except that its death height is the
+constant `c` at essential points, also inhabits the interface. Method: off the essential
+points it is the C263 death height, so the same strict cut applies; its elder relation is
+again its clause's right-hand side. Does not establish: any preferred value at essential
+points. -/
+def superlevelBarField_shift (d : ℕ) (L c : ℝ) : SuperlevelBarInterface d L where
+ deathHeight := fun g M => by
+ classical
+ exact if superlevelBar_isEssential g M then c else superlevelBar_deathHeight g M
+ IsEssential := superlevelBar_isEssential
+ ElderPartner := fun g M S =>
+ IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ superlevelBar_isEssential g M ∧
+ (by classical
+ exact if superlevelBar_isEssential g M then c else superlevelBar_deathHeight g M) = g S
+ essential_iff := fun g _ _ M => superlevelBar_essential_iff g M
+ deathHeight_maximin := fun g hs _ M hM h => by
+ classical
+ rw [ite_eq_right hM]
+ exact superlevelBar_strict_cut g (superlevelBarField_continuous hs) M hM h
+ elderPartner_iff := fun _ _ _ _ _ _ => Iff.rfl
+
+/-- Proves: at a constant height the shifted record's death height is `c`.
+Method: every point of a constant height is essential. Does not establish: a finite bar
+for a constant height. -/
+theorem superlevelBarField_shift_deathHeight_const (d : ℕ) (L c b : ℝ) (M : E d) :
+ (superlevelBarField_shift d L c).deathHeight (fun _ => b) M = c := by
+ classical
+ show (if superlevelBar_isEssential (fun _ : E d => b) M then c
+ else superlevelBar_deathHeight (fun _ : E d => b) M) = c
+ have hM : superlevelBar_isEssential (fun _ : E d => b) M := fun _ => le_rfl
+ rw [ite_eq_left hM]
+
+/-- Proves: constant heights are smooth. Method: `contDiff_const`.
+Does not establish: anything about nonconstant heights. -/
+theorem superlevelBarField_const_smooth (d : ℕ) (b : ℝ) : IsSmooth d (fun _ : E d => b) :=
+ fun _ => contDiff_const
+
+/-- Proves: constant heights are `L`-periodic. Method: both sides are the constant.
+Does not establish: anything about the lattice. -/
+theorem superlevelBarField_const_periodic (d : ℕ) (L b : ℝ) :
+ IsLPeriodic d L (fun _ : E d => b) :=
+ fun _ _ => rfl
+
+/-- Proves: the nonessential hypothesis of `superlevelBarField_deathHeight_unique` cannot
+be dropped: at the smooth periodic constant height `0` every point is essential for both
+records, the record's death height there is `0`, its shift by `1` has death height `1`,
+and the two differ. Method: `superlevelBar_death_const` and the shifted value.
+Does not establish: anything about nonessential points, where all inhabitants agree. -/
+theorem superlevelBarField_control_essential_free (d : ℕ) (L : ℝ) (M : E d) :
+ IsSmooth d (fun _ : E d => (0 : ℝ)) ∧ IsLPeriodic d L (fun _ : E d => (0 : ℝ)) ∧
+ (superlevelBarField_interface d L).IsEssential (fun _ => (0 : ℝ)) M ∧
+ (superlevelBarField_shift d L 1).IsEssential (fun _ => (0 : ℝ)) M ∧
+ (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M = 0 ∧
+ (superlevelBarField_shift d L 1).deathHeight (fun _ => (0 : ℝ)) M = 1 ∧
+ (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M ≠
+ (superlevelBarField_shift d L 1).deathHeight (fun _ => (0 : ℝ)) M := by
+ have h0 : (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M = 0 := by
+ rw [superlevelBarField_deathHeight_eq, superlevelBar_death_const]
+ have h1 : (superlevelBarField_shift d L 1).deathHeight (fun _ => (0 : ℝ)) M = 1 :=
+ superlevelBarField_shift_deathHeight_const d L 1 0 M
+ refine ⟨superlevelBarField_const_smooth d 0, superlevelBarField_const_periodic d L 0,
+ fun _ => le_rfl, fun _ => le_rfl, h0, h1, ?_⟩
+ rw [h0, h1]
+ norm_num
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/TorusFiltration.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/TorusFiltration.lean
new file mode 100644
index 000000000..7dff5dbab
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/TorusFiltration.lean
@@ -0,0 +1,6 @@
+import TorusTopology
+import ClosedSuperlevel
+import SuperlevelBar
+import OrdinaryH0
+import OrdinaryH0Controls
+import SuperlevelBarField
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/TorusTopology.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/TorusTopology.lean
new file mode 100644
index 000000000..ed678ea32
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/TorusTopology.lean
@@ -0,0 +1,247 @@
+import Mathlib
+
+/-!
+# The actual period-lattice quotient and specified-start path compatibility
+
+C254 proposed source. Compilation and kernel audit: NOT_RUN.
+The ambient space and lattice-vector formula below are exactly those in the
+source-bound Field.lean; this module does not import or alter that owner's file.
+All quotient, compactness, covering and descent properties are constructed.
+The final lift endpoint is existential. No critical-level attainment is claimed.
+Compile fixes at the pin (Lean v4.34.1, Mathlib d13f23b7), no statement altered: `Basis` → `Module.Basis`, `Basis.unitsSMul_apply` → `Module.Basis.unitsSMul_apply`, lattice discreteness passed via `SetLike.isDiscrete_iff_discreteTopology.mpr` instead of `DiscreteTopology.isDiscrete`, quotient path-connectedness via `inferInstanceAs (PathConnectedSpace (Quotient _))` instead of `infer_instance`.
+Three unused simp arguments (`PiLp.single_apply` twice, `hij`) removed from `torus_basis_sum_eq_latticeVec` so the
+file elaborates with warnings as errors; namespace `TorusFiltration` in this companion (handoff: `ResearchFormalCoreR1`).
+-/
+
+noncomputable section
+
+open Topology
+
+namespace TorusFiltration
+abbrev torus_E (d : ℕ) := EuclideanSpace ℝ (Fin d)
+
+/-- The exact `Field.latticeVec` formula, retained without any coordinate rescaling. -/
+def torus_latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : torus_E d :=
+ ∑ i, EuclideanSpace.single i (L * (n i : ℝ))
+
+theorem torus_field_latticeVec_formula (d : ℕ) (L : ℝ) (n : Fin d → ℤ) :
+ torus_latticeVec d L n = ∑ i, EuclideanSpace.single i (L * (n i : ℝ)) := rfl
+
+def torus_periodBasis (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ Module.Basis (Fin d) ℝ (torus_E d) :=
+ (EuclideanSpace.basisFun (Fin d) ℝ).toBasis.unitsSMul
+ (fun _ => Units.mk0 L hL.ne')
+
+def torus_periodLattice (d : ℕ) (L : ℝ) (hL : 0 < L) : Submodule ℤ (torus_E d) :=
+ Submodule.span ℤ (Set.range (torus_periodBasis d L hL))
+
+abbrev torus_quotient (d : ℕ) (L : ℝ) (hL : 0 < L) :=
+ torus_E d ⧸ (torus_periodLattice d L hL).toAddSubgroup
+
+def torus_proj (d : ℕ) (L : ℝ) (hL : 0 < L) : torus_E d → torus_quotient d L hL :=
+ QuotientAddGroup.mk
+
+/-- Concrete adapter from integer basis coefficients to Field's exact vector formula. -/
+theorem torus_basis_sum_eq_latticeVec (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (n : Fin d → ℤ) :
+ ∑ i, n i • torus_periodBasis d L hL i = torus_latticeVec d L n := by
+ classical
+ unfold torus_latticeVec
+ apply Finset.sum_congr rfl
+ intro i hi
+ ext j
+ by_cases hij : i = j
+ · subst j
+ simp [torus_periodBasis, Module.Basis.unitsSMul_apply, OrthonormalBasis.coe_toBasis,
+ EuclideanSpace.basisFun_apply, Units.smul_def, PiLp.smul_apply,
+ zsmul_eq_mul, mul_comm]
+ · simp [torus_periodBasis, Module.Basis.unitsSMul_apply, OrthonormalBasis.coe_toBasis,
+ EuclideanSpace.basisFun_apply, Units.smul_def, PiLp.smul_apply,
+ Ne.symm hij]
+
+theorem torus_lattice_mem_iff (d : ℕ) (L : ℝ) (hL : 0 < L) (x : torus_E d) :
+ x ∈ torus_periodLattice d L hL ↔ ∃ n : Fin d → ℤ, torus_latticeVec d L n = x := by
+ classical
+ change x ∈ Submodule.span ℤ (Set.range (torus_periodBasis d L hL)) ↔ _
+ rw [Submodule.mem_span_range_iff_exists_fun]
+ simp only [torus_basis_sum_eq_latticeVec]
+
+instance torus_lattice_discrete (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ DiscreteTopology (torus_periodLattice d L hL) := by
+ unfold torus_periodLattice
+ infer_instance
+
+instance torus_lattice_addSubgroup_discrete (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ DiscreteTopology (torus_periodLattice d L hL).toAddSubgroup := by
+ unfold torus_periodLattice
+ infer_instance
+
+instance torus_lattice_isZLattice (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ IsZLattice ℝ (torus_periodLattice d L hL) := by
+ unfold torus_periodLattice
+ infer_instance
+
+theorem torus_proj_surjective (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ Function.Surjective (torus_proj d L hL) := QuotientAddGroup.mk_surjective
+
+theorem torus_proj_continuous (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ Continuous (torus_proj d L hL) := continuous_quotient_mk'
+
+theorem torus_proj_eq_iff (d : ℕ) (L : ℝ) (hL : 0 < L) (x y : torus_E d) :
+ torus_proj d L hL x = torus_proj d L hL y ↔
+ ∃ n : Fin d → ℤ, y = x + torus_latticeVec d L n := by
+ change (QuotientAddGroup.mk x : torus_quotient d L hL) = QuotientAddGroup.mk y ↔ _
+ rw [QuotientAddGroup.eq]
+ change -x + y ∈ torus_periodLattice d L hL ↔ _
+ rw [torus_lattice_mem_iff]
+ constructor
+ · rintro ⟨n, hn⟩
+ exact ⟨n, by rw [hn]; abel⟩
+ · rintro ⟨n, rfl⟩
+ exact ⟨n, by abel⟩
+
+/-- Duplicate representatives have exactly the same quotient image. -/
+theorem torus_control_lattice_translate (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (x : torus_E d) (n : Fin d → ℤ) :
+ torus_proj d L hL (x + torus_latticeVec d L n) = torus_proj d L hL x :=
+ ((torus_proj_eq_iff d L hL x _).2 ⟨n, rfl⟩).symm
+
+theorem torus_proj_isCoveringMap (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ IsCoveringMap (torus_proj d L hL) :=
+ ((torus_periodLattice d L hL).toAddSubgroup.isAddQuotientCoveringMap_of_comm
+ (SetLike.isDiscrete_iff_discreteTopology.mpr
+ (torus_lattice_addSubgroup_discrete d L hL))).isCoveringMap
+
+theorem torus_compact (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ IsCompact (Set.univ : Set (torus_quotient d L hL)) := by
+ have hc := IsZLattice.isCompact_range_of_periodic (torus_periodLattice d L hL)
+ (torus_proj d L hL) (torus_proj_continuous d L hL)
+ (fun z w hw => QuotientAddGroup.mk_add_of_mem z hw)
+ rwa [Set.range_eq_univ.mpr (torus_proj_surjective d L hL)] at hc
+
+theorem torus_pathConnectedSpace (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ PathConnectedSpace (torus_quotient d L hL) := by
+ exact inferInstanceAs <| PathConnectedSpace (Quotient _)
+
+/-- Exact Field periodicity predicate with the literal lattice-vector adapter above. -/
+def torus_isPeriodic (d : ℕ) (L : ℝ) (g : torus_E d → ℝ) : Prop :=
+ ∀ (x : torus_E d) (n : Fin d → ℤ), g (x + torus_latticeVec d L n) = g x
+
+theorem torus_field_periodic_formula (d : ℕ) (L : ℝ) (g : torus_E d → ℝ) :
+ torus_isPeriodic d L g ↔
+ ∀ (x : EuclideanSpace ℝ (Fin d)) (n : Fin d → ℤ),
+ g (x + ∑ i, EuclideanSpace.single i (L * (n i : ℝ))) = g x := Iff.rfl
+
+theorem torus_periodic_respects (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (x y : torus_E d)
+ (hxy : QuotientAddGroup.leftRel (torus_periodLattice d L hL).toAddSubgroup x y) :
+ g x = g y := by
+ have hq : torus_proj d L hL x = torus_proj d L hL y := Quotient.sound hxy
+ obtain ⟨n, rfl⟩ := (torus_proj_eq_iff d L hL x y).1 hq
+ exact (hg x n).symm
+
+def torus_descend (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) : torus_quotient d L hL → ℝ :=
+ Quotient.lift g (torus_periodic_respects d L hL g hg)
+
+theorem torus_descend_proj (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (x : torus_E d) :
+ torus_descend d L hL g hg (torus_proj d L hL x) = g x := rfl
+
+theorem torus_descend_continuous (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (hgc : Continuous g) :
+ Continuous (torus_descend d L hL g hg) :=
+ hgc.quotient_lift (torus_periodic_respects d L hL g hg)
+
+/-- Lift from a prescribed representative; the endpoint is determined existentially. -/
+theorem torus_path_lift_from (d : ℕ) (L : ℝ) (hL : 0 < L)
+ {M : torus_E d} {y : torus_quotient d L hL}
+ (γ : Path (torus_proj d L hL M) y) :
+ ∃ z : torus_E d, ∃ Γ : Path M z,
+ torus_proj d L hL z = y ∧
+ ∀ t : unitInterval, torus_proj d L hL (Γ t) = γ t := by
+ let cov := torus_proj_isCoveringMap d L hL
+ let Γ := cov.liftPath γ M γ.source
+ refine ⟨Γ 1, ⟨Γ, cov.liftPath_zero γ M γ.source, rfl⟩, ?_, ?_⟩
+ · exact (congrFun (cov.liftPath_lifts γ M γ.source) 1).trans γ.target
+ · intro t
+ exact congrFun (cov.liftPath_lifts γ M γ.source) t
+
+/-- Control: a constant projected path cannot be lifted from M to a different lift.
+This refutes replacing the existential endpoint by an arbitrary chosen representative. -/
+theorem torus_control_constant_path_endpoint (d : ℕ) (L : ℝ) (hL : 0 < L)
+ {M z : torus_E d} (Γ : Path M z)
+ (hΓ : ∀ t : unitInterval, torus_proj d L hL (Γ t) = torus_proj d L hL M) : z = M := by
+ have heq : (Γ : unitInterval → torus_E d) = fun _ => M :=
+ (torus_proj_isCoveringMap d L hL).eq_of_comp_eq Γ.continuous continuous_const
+ (funext hΓ) 0 Γ.source
+ exact Γ.target.symm.trans (congrFun heq 1)
+
+/-- Combining the duplicate-image and uniqueness controls gives a direct rejection
+of any different preselected endpoint for a constant quotient path. -/
+theorem torus_control_no_arbitrary_endpoint (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (M : torus_E d) (n : Fin d → ℤ) (hn : torus_latticeVec d L n ≠ 0) :
+ torus_proj d L hL (M + torus_latticeVec d L n) = torus_proj d L hL M ∧
+ ¬ ∃ Γ : Path M (M + torus_latticeVec d L n),
+ ∀ t : unitInterval, torus_proj d L hL (Γ t) = torus_proj d L hL M := by
+ refine ⟨torus_control_lattice_translate d L hL M n, ?_⟩
+ rintro ⟨Γ, hΓ⟩
+ have heq := torus_control_constant_path_endpoint d L hL Γ hΓ
+ apply hn
+ exact add_left_cancel (show M + torus_latticeVec d L n = M + 0 by simpa using heq)
+
+/-- Higher-endpoint compatibility for any scalar path predicate, including strict
+and closed thresholds. No conclusion here asserts critical-level attainment. -/
+theorem torus_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (P : ℝ → Prop) :
+ (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, P (g (γ t))) ↔
+ (∃ y : torus_quotient d L hL,
+ torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧
+ ∃ γ : Path (torus_proj d L hL M) y,
+ ∀ t : unitInterval, P (torus_descend d L hL g hg (γ t))) := by
+ constructor
+ · rintro ⟨y, hy, γ, hγ⟩
+ exact ⟨torus_proj d L hL y, hy, γ.map (torus_proj_continuous d L hL), hγ⟩
+ · rintro ⟨y, hy, γ, hγ⟩
+ obtain ⟨z, Γ, hz, hΓ⟩ := torus_path_lift_from d L hL γ
+ refine ⟨z, ?_, Γ, ?_⟩
+ · have hz' := congrArg (torus_descend d L hL g hg) hz
+ change g z = torus_descend d L hL g hg y at hz'
+ change g M < torus_descend d L hL g hg y at hy
+ rwa [← hz'] at hy
+ · intro t
+ have ht := hγ t
+ rw [← hΓ t] at ht
+ exact ht
+
+theorem torus_strict_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : ℝ) :
+ (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)) ↔
+ (∃ y : torus_quotient d L hL,
+ torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧
+ ∃ γ : Path (torus_proj d L hL M) y,
+ ∀ t : unitInterval, h < torus_descend d L hL g hg (γ t)) :=
+ torus_higher_path_iff d L hL g hg M (fun a => h < a)
+
+theorem torus_closed_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : ℝ) :
+ (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h ≤ g (γ t)) ↔
+ (∃ y : torus_quotient d L hL,
+ torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧
+ ∃ γ : Path (torus_proj d L hL M) y,
+ ∀ t : unitInterval, h ≤ torus_descend d L hL g hg (γ t)) :=
+ torus_higher_path_iff d L hL g hg M (fun a => h ≤ a)
+
+theorem torus_global_max_iff (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) :
+ (∀ y : torus_E d, g y ≤ g M) ↔
+ ∀ y : torus_quotient d L hL,
+ torus_descend d L hL g hg y ≤ torus_descend d L hL g hg (torus_proj d L hL M) := by
+ constructor
+ · intro h y
+ obtain ⟨z, rfl⟩ := torus_proj_surjective d L hL y
+ exact h z
+ · intro h y
+ exact h (torus_proj d L hL y)
+
+end TorusFiltration
\ No newline at end of file
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1.lean
new file mode 100644
index 000000000..7e484d7d5
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1.lean
@@ -0,0 +1,8 @@
+import ResearchFormalCoreR1.AlgebraV2
+import ResearchFormalCoreR1.ProbabilityCompanionsV2
+import ResearchFormalCoreR1.MeasureBridge
+import ResearchFormalCoreR1.WeightedLaw
+import ResearchFormalCoreR1.MomentTail
+import ResearchFormalCoreR1.MomentGenerality
+import ResearchFormalCoreR1.WeightPerturbation
+import ResearchFormalCoreR1.D2Schur
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/AlgebraV2.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/AlgebraV2.lean
new file mode 100644
index 000000000..a8b42432c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/AlgebraV2.lean
@@ -0,0 +1,50 @@
+import Mathlib
+
+namespace ResearchFormalCoreR1
+
+set_option autoImplicit false
+
+/-- Canonical A₂ normal-form potential, parameterized by `s` with λ = s². -/
+noncomputable def foldPotential (s x : ℝ) : ℝ := -(x ^ 3) / 3 + (s ^ 2) * x
+
+/-- EC-005: exact canonical fold-gap identity in the normalized coordinate. -/
+theorem ec005_fold_gap (s : ℝ) :
+ foldPotential s s - foldPotential s (-s) = (2 * s) ^ 3 / 6 := by
+ unfold foldPotential
+ ring
+
+/-- EC-008: scalar polynomial companion for the planar collision-Gram determinant.
+ This is not the matrix-construction theorem. -/
+theorem ec008_factor_expansion (c s : ℝ) :
+ 2 * s ^ 2 *
+ ((s ^ 2 * (3 * c ^ 4 + 3 * c ^ 2 * s ^ 2 + s ^ 4) / 24) *
+ (s ^ 2 * (4 * c ^ 2 + s ^ 2) / 2) -
+ (-c * s ^ 2 * (2 * c ^ 2 + s ^ 2) / 4) ^ 2) =
+ s ^ 8 * (c ^ 2 + s ^ 2) * (3 * c ^ 2 + s ^ 2) / 24 := by
+ ring
+
+/-- EC-010, generic chart: declared convex-combination polynomial identity. -/
+theorem ec010_generic (α K c η : ℝ) :
+ (K + 8 * α * c * η) ^ 2 + 64 * α * (1 - α) * c ^ 2 * η ^ 2 =
+ (1 - α) * K ^ 2 + α * (K + 8 * c * η) ^ 2 := by
+ ring
+
+/-- EC-010, transverse chart: declared convex-combination polynomial identity. -/
+theorem ec010_transverse (α a η : ℝ) :
+ (a + (1 - 2 * α) * η) ^ 2 + 4 * α * (1 - α) * η ^ 2 =
+ (1 - α) * (a + η) ^ 2 + α * (a - η) ^ 2 := by
+ ring
+
+/-- EC-011: scalar cancellation companion to the adjoint-orbit calculation.
+ It does not formalize the ODE, Hessian symmetry, or section normalization. -/
+theorem ec011_scalar_cancellation (h w g : ℝ) :
+ (-h * w) * g + w * (h * g) = 0 := by
+ ring
+
+/-- EC-014: exact contact-power scalar identity for nonzero separation.
+ It does not formalize the six-pin matrix determinant or density transform. -/
+theorem ec014_contact_power (r : ℝ) (hr : r ≠ 0) :
+ (r ^ 3 / 6) * (1 / r ^ 5) * r ^ 2 = (1 / 6 : ℝ) := by
+ field_simp [hr]
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/D2Schur.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/D2Schur.lean
new file mode 100644
index 000000000..b95460c0d
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/D2Schur.lean
@@ -0,0 +1,169 @@
+import Mathlib.Data.Real.Basic
+import Mathlib.Tactic
+
+/-!
+# Algebraic d=2 Schur and positivity companion
+
+Dylan Roy — delegated AI work. Actual author: OpenAI / GPT-6 Astra Pro.
+Source: Math-#302 NOTE section 2 and additive identity comment 6005199919.
+These are real algebraic expressions with explicit hypotheses, not a
+construction of the Gaussian field or a proof of the coefficient integral.
+-/
+
+namespace ResearchFormalCoreR1
+
+noncomputable def d2Alpha (m2 m4 q : ℝ) : ℝ :=
+ m4 - 2 * (m4 - 3 * m2 ^ 2) * q
+
+noncomputable def d2Gamma (m2 m4 q : ℝ) : ℝ :=
+ m2 ^ 2 + 2 * (m4 - 3 * m2 ^ 2) * q
+
+noncomputable def d2DetV (m2 m4 q : ℝ) : ℝ :=
+ m2 ^ 2 * m4 + (m4 - 3 * m2 ^ 2) * (m4 + m2 ^ 2) * q
+
+noncomputable def d2Numerator (m2 m4 : ℝ) : ℝ :=
+ m2 ^ 2 * (m4 ^ 2 - m2 ^ 4)
+
+noncomputable def d2Schur (m2 m4 q : ℝ) : ℝ :=
+ d2Alpha m2 m4 q -
+ (d2Gamma m2 m4 q ^ 3 +
+ (2 * d2Gamma m2 m4 q + d2Alpha m2 m4 q) *
+ (m4 - 3 * m2 ^ 2) ^ 2 * q * (1 - 4 * q)) / d2DetV m2 m4 q
+
+noncomputable def d2Delta (m2 m4 m6 : ℝ) : ℝ := m6 - m4 ^ 2 / m2
+
+noncomputable def d2Tau (m2 m4 m6 q : ℝ) : ℝ :=
+ (1 - 4 * q) * d2Delta m2 m4 m6 +
+ 4 * q * ((d2Delta m2 m4 m6 + 9 * m2 * (m4 - m2 ^ 2)) / 4)
+
+/-- Exact polynomial cancellation; it does not divide by the pin determinant. -/
+theorem d2_schur_numerator (m2 m4 q : ℝ) :
+ d2Alpha m2 m4 q * d2DetV m2 m4 q - d2Gamma m2 m4 q ^ 3 -
+ (2 * d2Gamma m2 m4 q + d2Alpha m2 m4 q) *
+ (m4 - 3 * m2 ^ 2) ^ 2 * q * (1 - 4 * q) = d2Numerator m2 m4 := by
+ unfold d2Alpha d2Gamma d2DetV d2Numerator
+ ring
+
+theorem d2_det_axis (m2 m4 : ℝ) : d2DetV m2 m4 0 = m2 ^ 2 * m4 := by
+ simp [d2DetV]
+
+theorem d2_det_diagonal (m2 m4 : ℝ) :
+ d2DetV m2 m4 (1 / 4) = (m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4 := by
+ unfold d2DetV
+ ring
+
+theorem d2_det_interpolation (m2 m4 q : ℝ) :
+ d2DetV m2 m4 q = (1 - 4 * q) * (m2 ^ 2 * m4) +
+ 4 * q * ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4) := by
+ unfold d2DetV
+ ring
+
+/-- The nonzero hypothesis is essential even with Lean's total division. -/
+theorem d2_schur_ratio (m2 m4 q : ℝ) (hD : d2DetV m2 m4 q ≠ 0) :
+ d2Schur m2 m4 q = d2Numerator m2 m4 / d2DetV m2 m4 q := by
+ have h := d2_schur_numerator m2 m4 q
+ unfold d2Schur
+ apply (eq_div_iff hD).2
+ rw [sub_mul, div_mul_cancel₀ _ hD]
+ linarith
+
+theorem d2_numerator_pos (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :
+ 0 < d2Numerator m2 m4 := by
+ have hx : 0 < m2 ^ 2 := sq_pos_of_pos hm2
+ have hv : 0 < m4 - m2 ^ 2 := sub_pos.mpr hm4
+ have hs : 0 < m4 + m2 ^ 2 := by linarith
+ have he : d2Numerator m2 m4 = m2 ^ 2 * (m4 - m2 ^ 2) * (m4 + m2 ^ 2) := by
+ unfold d2Numerator
+ ring
+ rw [he]
+ exact mul_pos (mul_pos hx hv) hs
+
+theorem d2_det_pos (m2 m4 q : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)
+ (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) : 0 < d2DetV m2 m4 q := by
+ have hx : 0 < m2 ^ 2 := sq_pos_of_pos hm2
+ have hm4pos : 0 < m4 := lt_trans hx hm4
+ have ha : 0 < m2 ^ 2 * m4 := mul_pos hx hm4pos
+ have hv : 0 < m4 - m2 ^ 2 := sub_pos.mpr hm4
+ have hs : 0 < m4 + 3 * m2 ^ 2 := by positivity
+ have hb : 0 < (m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4 := by positivity
+ rw [d2_det_interpolation]
+ by_cases hq : q = 0
+ · simpa [hq] using ha
+ · have hqp : 0 < q := lt_of_le_of_ne hq0 (Ne.symm hq)
+ have hw : 0 ≤ 1 - 4 * q := by linarith
+ exact add_pos_of_nonneg_of_pos (mul_nonneg hw ha.le) (mul_pos (by positivity) hb)
+
+theorem d2_schur_pos (m2 m4 q : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)
+ (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) : 0 < d2Schur m2 m4 q := by
+ have hD := d2_det_pos m2 m4 q hm2 hm4 hq0 hq1
+ rw [d2_schur_ratio m2 m4 q (ne_of_gt hD)]
+ exact div_pos (d2_numerator_pos m2 m4 hm2 hm4) hD
+
+theorem d2_det_le_endpoint_max (m2 m4 q : ℝ) (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) :
+ d2DetV m2 m4 q ≤
+ max (m2 ^ 2 * m4) ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4) := by
+ have hw : 0 ≤ 1 - 4 * q := by linarith
+ have hv : 0 ≤ 4 * q := by positivity
+ rw [d2_det_interpolation]
+ calc
+ _ ≤ (1 - 4 * q) * max (m2 ^ 2 * m4) ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4) +
+ 4 * q * max (m2 ^ 2 * m4) ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4) :=
+ add_le_add (mul_le_mul_of_nonneg_left (le_max_left _ _) hw)
+ (mul_le_mul_of_nonneg_left (le_max_right _ _) hv)
+ _ = _ := by ring
+
+/-- A uniform positive lower bound on q in [0,1/4], with moment premises explicit. -/
+theorem d2_schur_endpoint_lower (m2 m4 q : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)
+ (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) :
+ d2Numerator m2 m4 /
+ max (m2 ^ 2 * m4) ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4) ≤
+ d2Schur m2 m4 q := by
+ have hD := d2_det_pos m2 m4 q hm2 hm4 hq0 hq1
+ have hbound := d2_det_le_endpoint_max m2 m4 q hq0 hq1
+ have hM := lt_of_lt_of_le hD hbound
+ rw [d2_schur_ratio m2 m4 q (ne_of_gt hD)]
+ exact (div_le_div_iff₀ hM hD).2
+ (mul_le_mul_of_nonneg_left hbound (d2_numerator_pos m2 m4 hm2 hm4).le)
+
+theorem d2_tau_cumulant_eq (m2 m4 m6 q : ℝ) (hm2 : m2 ≠ 0) :
+ 6 * m2 ^ 3 + 9 * m2 * (m4 - 3 * m2 ^ 2) * (1 - 2 * q) +
+ (m6 - 15 * m4 * m2 + 30 * m2 ^ 3 - (m4 - 3 * m2 ^ 2) ^ 2 / m2) *
+ (1 - 3 * q) = d2Tau m2 m4 m6 q := by
+ unfold d2Tau d2Delta
+ field_simp [hm2]
+ <;> ring
+
+theorem d2_tau_axis (m2 m4 m6 : ℝ) : d2Tau m2 m4 m6 0 = d2Delta m2 m4 m6 := by
+ simp [d2Tau]
+
+theorem d2_tau_diagonal (m2 m4 m6 : ℝ) :
+ d2Tau m2 m4 m6 (1 / 4) =
+ (d2Delta m2 m4 m6 + 9 * m2 * (m4 - m2 ^ 2)) / 4 := by
+ unfold d2Tau
+ ring
+
+theorem d2_tau_pos (m2 m4 m6 q : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)
+ (hDelta : 0 < d2Delta m2 m4 m6) (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) :
+ 0 < d2Tau m2 m4 m6 q := by
+ have hv : 0 < m4 - m2 ^ 2 := sub_pos.mpr hm4
+ have hb : 0 < (d2Delta m2 m4 m6 + 9 * m2 * (m4 - m2 ^ 2)) / 4 := by positivity
+ unfold d2Tau
+ by_cases hq : q = 0
+ · simpa [hq] using hDelta
+ · have hqp : 0 < q := lt_of_le_of_ne hq0 (Ne.symm hq)
+ have hw : 0 ≤ 1 - 4 * q := by linarith
+ exact add_pos_of_nonneg_of_pos (mul_nonneg hw hDelta.le) (mul_pos (by positivity) hb)
+
+/-- Gaussian-reference algebra, for all real q, not a probabilistic identification. -/
+theorem d2_gaussian_control (q : ℝ) :
+ d2DetV 1 3 q = 3 ∧ d2Schur 1 3 q = 8 / 3 ∧ d2Tau 1 3 15 q = 6 := by
+ norm_num [d2DetV, d2Schur, d2Alpha, d2Gamma, d2Tau, d2Delta]
+ <;> ring
+
+/-- At a singular moment boundary the unguarded quotient identity is false. -/
+theorem d2_degenerate_control :
+ d2DetV 1 1 (1 / 4) = 0 ∧ d2Schur 1 1 (1 / 4) = 2 ∧
+ d2Numerator 1 1 / d2DetV 1 1 (1 / 4) = 0 ∧ d2Tau 1 1 1 0 = 0 := by
+ norm_num [d2DetV, d2Schur, d2Alpha, d2Gamma, d2Numerator, d2Tau, d2Delta]
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MeasureBridge.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MeasureBridge.lean
new file mode 100644
index 000000000..11843e558
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MeasureBridge.lean
@@ -0,0 +1,145 @@
+import ResearchFormalCoreR1.ProbabilityCompanionsV2
+
+/-!
+# Measure-theoretic companions to P02-LM-008
+
+These declarations use one measure and one weight throughout. They supply the
+Cauchy-Schwarz step rather than assuming its numerator estimate. The concrete
+second-moment and lower-normalizer estimates remain hypotheses. No Gaussian
+field, typed Palm measure, uniform family of constants, or parent theorem is
+constructed here. See ../MEASURE_BRIDGE.md for the exact source correspondence.
+-/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory
+open scoped ENNReal
+
+set_option autoImplicit false
+
+variable {Ω : Type*} [MeasurableSpace Ω]
+
+/-- Actual Bochner-integral Cauchy-Schwarz for nonnegative square-integrable
+functions, obtained from the pinned mathlib Holder theorem with exponents 2,2. -/
+theorem p02_lm008_integral_cs
+ (μ : Measure Ω) (f g : Ω → ℝ)
+ (hf : MemLp f 2 μ) (hg : MemLp g 2 μ)
+ (hf0 : 0 ≤ᵐ[μ] f) (hg0 : 0 ≤ᵐ[μ] g) :
+ (∫ x, f x * g x ∂μ) ≤
+ Real.sqrt (∫ x, f x ^ 2 ∂μ) * Real.sqrt (∫ x, g x ^ 2 ∂μ) := by
+ have h := integral_mul_le_Lp_mul_Lq_of_nonneg
+ Real.HolderConjugate.two_two hf0 hg0
+ (by simpa using hf) (by simpa using hg)
+ simpa only [Real.rpow_two, ← Real.sqrt_eq_rpow] using h
+
+/-- The event may depend arbitrarily on W. Its indicator's second moment is
+its probability under this same μ; no independence assumption is used. -/
+theorem p02_lm008_event_cs
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)
+ (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A) :
+ (∫ x in A, W x ∂μ) ≤
+ Real.sqrt (∫ x, W x ^ 2 ∂μ) * Real.sqrt ((μ A).toReal) := by
+ classical
+ have hI : MemLp (A.indicator (fun _ : Ω => (1 : ℝ))) 2 μ :=
+ (memLp_const (1 : ℝ)).indicator hA
+ have hI0 : 0 ≤ᵐ[μ] A.indicator (fun _ : Ω => (1 : ℝ)) := by
+ apply Filter.Eventually.of_forall
+ intro x
+ by_cases hx : x ∈ A <;> simp [hx]
+ have hcs := p02_lm008_integral_cs μ W
+ (A.indicator (fun _ : Ω => (1 : ℝ))) hW hI hW0 hI0
+ have hprod : (fun x => W x * A.indicator (fun _ : Ω => (1 : ℝ)) x) =
+ A.indicator W := by
+ funext x
+ by_cases hx : x ∈ A <;> simp [hx]
+ have hsquare : (fun x => (A.indicator (fun _ : Ω => (1 : ℝ)) x) ^ 2) =
+ A.indicator (fun _ : Ω => (1 : ℝ)) := by
+ funext x
+ by_cases hx : x ∈ A <;> simp [hx]
+ rw [hprod, integral_indicator hA, hsquare, integral_indicator hA] at hcs
+ simpa [MeasureTheory.measureReal_def] using hcs
+
+/-- The r^4 second-moment premise supplies the previously assumed r^2
+numerator bound. This theorem does not establish that premise for a model. -/
+theorem p02_lm008_event_numerator
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)
+ (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)
+ (r cW : ℝ) (hcW : 0 ≤ cW)
+ (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4) :
+ (∫ x in A, W x ∂μ) ≤ Real.sqrt cW * r ^ 2 * Real.sqrt ((μ A).toReal) := by
+ have hsqrt : Real.sqrt (∫ x, W x ^ 2 ∂μ) ≤ Real.sqrt cW * r ^ 2 := by
+ calc
+ Real.sqrt (∫ x, W x ^ 2 ∂μ) ≤ Real.sqrt (cW * r ^ 4) :=
+ Real.sqrt_le_sqrt hsecond
+ _ = Real.sqrt cW * r ^ 2 := by
+ rw [Real.sqrt_mul hcW]
+ rw [show r ^ 4 = (r ^ 2) ^ 2 by ring, Real.sqrt_sq (sq_nonneg r)]
+ exact (p02_lm008_event_cs μ W A hW hW0 hA).trans
+ (mul_le_mul_of_nonneg_right hsqrt (Real.sqrt_nonneg _))
+
+/-- Same-law integral-ratio transfer. Positivity of the actual normalizer
+is derived from its explicit lower bound, never from an upper bound. -/
+theorem p02_lm008_measure_transfer
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)
+ (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)
+ (r cW cZ : ℝ) (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)
+ (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)
+ (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ) :
+ (∫ x in A, W x ∂μ) / (∫ x, W x ∂μ) ≤
+ (Real.sqrt cW / cZ) * Real.sqrt ((μ A).toReal) := by
+ have hzpos : 0 < ∫ x, W x ∂μ :=
+ lt_of_lt_of_le (mul_pos hcZ (sq_pos_of_pos hr)) hlower
+ exact p02_lm008_quotient_bound
+ (∫ x in A, W x ∂μ) (∫ x, W x ∂μ) r cW cZ ((μ A).toReal)
+ hr hcW hcZ ENNReal.toReal_nonneg hzpos hlower
+ (p02_lm008_event_numerator μ W A hW hW0 hA r cW hcW hsecond)
+
+/-- An explicitly supplied eighth-order event bound transfers to a cubic
+bound on 0 < r ≤ 1. Uniformity in r and the input tail remain unproved here. -/
+theorem p02_lm009_measure_transfer_r8_to_r3
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)
+ (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)
+ (r cW cZ K : ℝ) (hr : 0 < r) (hr1 : r ≤ 1)
+ (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hK : 0 ≤ K)
+ (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)
+ (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ)
+ (htail : (μ A).toReal ≤ K * r ^ 8) :
+ (∫ x in A, W x ∂μ) / (∫ x, W x ∂μ) ≤
+ ((Real.sqrt cW / cZ) * Real.sqrt K) * r ^ 3 := by
+ have hcoef : 0 ≤ Real.sqrt cW / cZ :=
+ div_nonneg (Real.sqrt_nonneg _) hcZ.le
+ have hsqrt : Real.sqrt ((μ A).toReal) ≤ Real.sqrt K * r ^ 4 := by
+ calc
+ Real.sqrt ((μ A).toReal) ≤ Real.sqrt (K * r ^ 8) := Real.sqrt_le_sqrt htail
+ _ = Real.sqrt K * r ^ 4 := by
+ rw [Real.sqrt_mul hK]
+ rw [show r ^ 8 = (r ^ 4) ^ 2 by ring, Real.sqrt_sq (pow_nonneg hr.le 4)]
+ have hfourth : (∫ x in A, W x ∂μ) / (∫ x, W x ∂μ) ≤
+ ((Real.sqrt cW / cZ) * Real.sqrt K) * r ^ 4 := by
+ calc
+ (∫ x in A, W x ∂μ) / (∫ x, W x ∂μ) ≤
+ (Real.sqrt cW / cZ) * Real.sqrt ((μ A).toReal) :=
+ p02_lm008_measure_transfer μ W A hW hW0 hA r cW cZ hr hcW hcZ hsecond hlower
+ _ ≤ (Real.sqrt cW / cZ) * (Real.sqrt K * r ^ 4) :=
+ mul_le_mul_of_nonneg_left hsqrt hcoef
+ _ = ((Real.sqrt cW / cZ) * Real.sqrt K) * r ^ 4 := by ring
+ exact p02_lm009_palm_r4_to_r3 _ _ r
+ (mul_nonneg hcoef (Real.sqrt_nonneg _)) hr.le hr1 hfourth
+
+/-- Scalar data realized by W=4 on an event of probability 1/4 and W=0
+elsewhere. Cauchy-Schwarz is sharp; omitting the event square root is false.
+The realization is checked separately by exact finite-model Python tests. -/
+theorem p02_lm008_sqrt_counterexample :
+ (1 : ℝ) = Real.sqrt 4 * Real.sqrt (1 / 4 : ℝ) ∧
+ ¬ (1 : ℝ) ≤ Real.sqrt 4 * (1 / 4 : ℝ) := by
+ norm_num
+
+/-- Scalar data realized by W=1 on a one-point probability space, r=1,
+cW=1, cZ=2. The upper bound on z holds but the proposed ratio bound fails.
+This does not assert that the required lower bound holds. -/
+theorem p02_lm008_upper_normalizer_counterexample :
+ (1 : ℝ) ≤ 2 * 1 ^ 2 ∧
+ (1 : ℝ) / 1 > (Real.sqrt 1 / 2) * Real.sqrt 1 := by
+ norm_num
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MomentGenerality.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MomentGenerality.lean
new file mode 100644
index 000000000..2398c6b0e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MomentGenerality.lean
@@ -0,0 +1,95 @@
+import ResearchFormalCoreR1.MomentTail
+
+/-!
+# Finite-measure and interval-only moment-tail companions
+
+Executable adaptation by OpenAI / GPT-6 Astra Pro of the separately attributed
+Grok Bot agent 6 and agent 7 proposals in Math-#277/#278. Their underlying model
+providers are not inferred from their role labels. See ../MOMENT_GENERALITY.md.
+The original 36 theorem statements and proofs are unchanged.
+-/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory
+open scoped ENNReal
+
+set_option autoImplicit false
+
+variable {Ω : Type*} [MeasurableSpace Ω]
+
+/-- The fortieth-moment event bound for any finite measure. The event mass is
+not normalized by the total mass; both sides scale with the ambient measure. -/
+theorem p02_lm009_moment40_tail_finite
+ (μ : Measure Ω) [IsFiniteMeasure μ] (R : Ω → ℝ)
+ (r ε M : ℝ) (hr : 0 < r) (hε : 0 < ε)
+ (hRi : Integrable (fun x => R x ^ 40) μ)
+ (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M) :
+ (μ (badJetEvent R r ε)).toReal ≤ (M / ε ^ 8) * r ^ 8 := by
+ have hnonneg : 0 ≤ᵐ[μ] (fun x => R x ^ 40) := by
+ apply Filter.Eventually.of_forall
+ intro x
+ positivity
+ have ha : 0 < (ε / r) ^ 8 := pow_pos (div_pos hε hr) 8
+ calc
+ (μ (badJetEvent R r ε)).toReal ≤ (∫ x, R x ^ 40 ∂μ) / (ε / r) ^ 8 :=
+ p02_lm009_markov_event μ (fun x => R x ^ 40) (badJetEvent R r ε)
+ hRi hnonneg ((ε / r) ^ 8) ha (p02_lm009_badJet_subset R r ε hr hε)
+ _ ≤ M / (ε / r) ^ 8 := div_le_div_of_nonneg_right hMbound ha.le
+ _ = (M / ε ^ 8) * r ^ 8 := by
+ field_simp [ne_of_gt hr, ne_of_gt hε]
+
+/-- The original probability-space conclusion specializes from the finite
+measure companion. This does not replace or edit the original declaration. -/
+theorem p02_lm009_moment40_tail_of_finite
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (R : Ω → ℝ)
+ (r ε M : ℝ) (hr : 0 < r) (hε : 0 < ε)
+ (hRi : Integrable (fun x => R x ^ 40) μ)
+ (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M) :
+ (μ (badJetEvent R r ε)).toReal ≤ (M / ε ^ 8) * r ^ 8 :=
+ p02_lm009_moment40_tail_finite μ R r ε M hr hε hRi hMbound
+
+/-- One fixed cubic constant, with probability and all model bounds required
+only on 0 < r ≤ r0. No probability assumption is made outside that interval. -/
+theorem p02_lm009_moment40_family_r3_interval
+ (μ : ℝ → Measure Ω)
+ (W R : ℝ → Ω → ℝ) (r0 ε M cW cZ : ℝ)
+ (hr0 : 0 < r0 ∧ r0 ≤ 1) (hε : 0 < ε)
+ (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)
+ (hdata : ∀ r, 0 < r → r ≤ r0 →
+ IsProbabilityMeasure (μ r) ∧
+ MemLp (W r) 2 (μ r) ∧ (0 ≤ᵐ[μ r] W r) ∧ Measurable (R r) ∧
+ Integrable (fun x => R r x ^ 40) (μ r) ∧
+ (∫ x, R r x ^ 40 ∂(μ r)) ≤ M ∧
+ (∫ x, W r x ^ 2 ∂(μ r)) ≤ cW * r ^ 4 ∧
+ cZ * r ^ 2 ≤ ∫ x, W r x ∂(μ r)) :
+ ∃ C : ℝ, 0 ≤ C ∧ ∀ r, 0 < r → r ≤ r0 →
+ IsProbabilityMeasure (weightedLaw (μ r) (W r)) ∧
+ (weightedLaw (μ r) (W r) (badJetEvent (R r) r ε)).toReal ≤ C * r ^ 3 := by
+ refine ⟨(Real.sqrt cW / cZ) * Real.sqrt (M / ε ^ 8), by positivity, ?_⟩
+ intro r hr hrr0
+ obtain ⟨hProb, hW, hW0, hR, hRi, hMb, hsecond, hlower⟩ := hdata r hr hrr0
+ letI : IsProbabilityMeasure (μ r) := hProb
+ exact p02_lm009_moment40_weighted_r3 (μ r) (W r) (R r) hW hW0 hR
+ r ε M cW cZ hr (hrr0.trans hr0.2) hε hM hcW hcZ hRi hMb hsecond hlower
+
+/-- A globally supplied probability family is a specialization of the interval
+version, so the previous interface is retained without changing its source. -/
+theorem p02_lm009_moment40_family_r3_of_interval
+ (μ : ℝ → Measure Ω) [∀ r, IsProbabilityMeasure (μ r)]
+ (W R : ℝ → Ω → ℝ) (r0 ε M cW cZ : ℝ)
+ (hr0 : 0 < r0 ∧ r0 ≤ 1) (hε : 0 < ε)
+ (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)
+ (hdata : ∀ r, 0 < r → r ≤ r0 →
+ MemLp (W r) 2 (μ r) ∧ (0 ≤ᵐ[μ r] W r) ∧ Measurable (R r) ∧
+ Integrable (fun x => R r x ^ 40) (μ r) ∧
+ (∫ x, R r x ^ 40 ∂(μ r)) ≤ M ∧
+ (∫ x, W r x ^ 2 ∂(μ r)) ≤ cW * r ^ 4 ∧
+ cZ * r ^ 2 ≤ ∫ x, W r x ∂(μ r)) :
+ ∃ C : ℝ, 0 ≤ C ∧ ∀ r, 0 < r → r ≤ r0 →
+ IsProbabilityMeasure (weightedLaw (μ r) (W r)) ∧
+ (weightedLaw (μ r) (W r) (badJetEvent (R r) r ε)).toReal ≤ C * r ^ 3 :=
+ p02_lm009_moment40_family_r3_interval μ W R r0 ε M cW cZ hr0 hε hM hcW hcZ
+ (fun r hr hrr0 => ⟨inferInstance, hdata r hr hrr0⟩)
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MomentTail.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MomentTail.lean
new file mode 100644
index 000000000..c8282f297
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MomentTail.lean
@@ -0,0 +1,151 @@
+import ResearchFormalCoreR1.WeightedLaw
+
+/-!
+# From a genuine fortieth moment to a weighted bad-event bound
+
+This module supplies Markov's measure-theoretic step. It does not prove a
+fortieth-moment estimate for a Gaussian jet, or a concrete Palm normalizer.
+All law/weight/jet objects and uniform family premises remain explicit.
+-/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory
+open scoped ENNReal
+
+set_option autoImplicit false
+
+variable {Ω : Type*} [MeasurableSpace Ω]
+
+/-- The exact strict threshold event used by the fifth-power jet ledger. -/
+def badJetEvent (R : Ω → ℝ) (r ε : ℝ) : Set Ω :=
+ {x | ε < r * R x ^ 5}
+
+/-- Markov for any event contained in a positive superlevel set, on a finite
+measure. Integrability prevents totalized divergent integrals from being used. -/
+theorem p02_lm009_markov_event
+ (μ : Measure Ω) [IsFiniteMeasure μ] (Y : Ω → ℝ) (A : Set Ω)
+ (hY : Integrable Y μ) (hY0 : 0 ≤ᵐ[μ] Y)
+ (a : ℝ) (ha : 0 < a) (hsub : A ⊆ {x | a ≤ Y x}) :
+ (μ A).toReal ≤ (∫ x, Y x ∂μ) / a := by
+ have hm : (μ A).toReal ≤ (μ {x | a ≤ Y x}).toReal :=
+ ENNReal.toReal_mono (by finiteness) (measure_mono hsub)
+ have hmarkov := mul_meas_ge_le_integral_of_nonneg hY0 hY a
+ apply (le_div_iff₀ ha).2
+ calc
+ (μ A).toReal * a = a * (μ A).toReal := by ring
+ _ ≤ a * (μ {x | a ≤ Y x}).toReal := mul_le_mul_of_nonneg_left hm ha.le
+ _ ≤ ∫ x, Y x ∂μ := by simpa only [measureReal_def] using hmarkov
+
+/-- Actual measurability of the bad event from measurability of the jet norm. -/
+theorem p02_lm009_badJet_measurable
+ (R : Ω → ℝ) (hR : Measurable R) (r ε : ℝ) :
+ MeasurableSet (badJetEvent R r ε) := by
+ unfold badJetEvent
+ exact measurableSet_lt measurable_const (by fun_prop)
+
+/-- The event itself implies the needed positive fifth-power threshold, even
+for signed R; no global sign assumption on R is necessary. -/
+theorem p02_lm009_badJet_subset
+ (R : Ω → ℝ) (r ε : ℝ) (hr : 0 < r) (hε : 0 < ε) :
+ badJetEvent R r ε ⊆ {x | (ε / r) ^ 8 ≤ R x ^ 40} := by
+ intro x hx
+ change ε < r * R x ^ 5 at hx
+ change (ε / r) ^ 8 ≤ R x ^ 40
+ have ht := p02_lm009_bad_event_threshold r (R x) ε hr hx
+ have hp := pow_le_pow_left₀ (le_of_lt (div_pos hε hr)) ht.le 8
+ simpa only [p02_lm009_power40_identity] using hp
+
+/-- A supplied integrable fortieth-moment bound gives the actual eighth-order
+event tail, with the exact epsilon denominator and no independence hypothesis. -/
+theorem p02_lm009_moment40_tail
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (R : Ω → ℝ)
+ (r ε M : ℝ) (hr : 0 < r) (hε : 0 < ε)
+ (hRi : Integrable (fun x => R x ^ 40) μ)
+ (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M) :
+ (μ (badJetEvent R r ε)).toReal ≤ (M / ε ^ 8) * r ^ 8 := by
+ have hnonneg : 0 ≤ᵐ[μ] (fun x => R x ^ 40) := by
+ apply Filter.Eventually.of_forall
+ intro x
+ positivity
+ have ha : 0 < (ε / r) ^ 8 := pow_pos (div_pos hε hr) 8
+ calc
+ (μ (badJetEvent R r ε)).toReal ≤ (∫ x, R x ^ 40 ∂μ) / (ε / r) ^ 8 :=
+ p02_lm009_markov_event μ (fun x => R x ^ 40) (badJetEvent R r ε)
+ hRi hnonneg ((ε / r) ^ 8) ha (p02_lm009_badJet_subset R r ε hr hε)
+ _ ≤ M / (ε / r) ^ 8 := div_le_div_of_nonneg_right hMbound ha.le
+ _ = (M / ε ^ 8) * r ^ 8 := by
+ field_simp [ne_of_gt hr, ne_of_gt hε]
+
+/-- The constructed weighted probability law satisfies the stronger fourth-
+order tail. The model's moment and positive lower-normalizer bounds are premises. -/
+theorem p02_lm009_moment40_weighted_r4
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (W R : Ω → ℝ)
+ (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hR : Measurable R)
+ (r ε M cW cZ : ℝ) (hr : 0 < r) (hε : 0 < ε)
+ (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)
+ (hRi : Integrable (fun x => R x ^ 40) μ)
+ (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M)
+ (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)
+ (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ) :
+ IsProbabilityMeasure (weightedLaw μ W) ∧
+ (weightedLaw μ W (badJetEvent R r ε)).toReal ≤
+ ((Real.sqrt cW / cZ) * Real.sqrt (M / ε ^ 8)) * r ^ 4 := by
+ have hA := p02_lm009_badJet_measurable R hR r ε
+ have ht := p02_lm009_moment40_tail μ R r ε M hr hε hRi hMbound
+ have hK : 0 ≤ M / ε ^ 8 := by positivity
+ have hs : Real.sqrt ((μ (badJetEvent R r ε)).toReal) ≤
+ Real.sqrt (M / ε ^ 8) * r ^ 4 := by
+ calc
+ _ ≤ Real.sqrt ((M / ε ^ 8) * r ^ 8) := Real.sqrt_le_sqrt ht
+ _ = _ := by
+ rw [Real.sqrt_mul hK]
+ rw [show r ^ 8 = (r ^ 4) ^ 2 by ring, Real.sqrt_sq (pow_nonneg hr.le 4)]
+ obtain ⟨hp, hb⟩ := p02_lm008_probability_transfer μ W (badJetEvent R r ε)
+ hW hW0 hA r cW cZ hr hcW hcZ hsecond hlower
+ refine ⟨hp, hb.trans ?_⟩
+ calc
+ _ ≤ (Real.sqrt cW / cZ) * (Real.sqrt (M / ε ^ 8) * r ^ 4) :=
+ mul_le_mul_of_nonneg_left hs (by positivity)
+ _ = _ := by ring
+
+/-- Cubic consequence on the explicit domain 0 < r ≤ 1. -/
+theorem p02_lm009_moment40_weighted_r3
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (W R : Ω → ℝ)
+ (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hR : Measurable R)
+ (r ε M cW cZ : ℝ) (hr : 0 < r) (hr1 : r ≤ 1) (hε : 0 < ε)
+ (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)
+ (hRi : Integrable (fun x => R x ^ 40) μ)
+ (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M)
+ (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)
+ (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ) :
+ IsProbabilityMeasure (weightedLaw μ W) ∧
+ (weightedLaw μ W (badJetEvent R r ε)).toReal ≤
+ ((Real.sqrt cW / cZ) * Real.sqrt (M / ε ^ 8)) * r ^ 3 := by
+ obtain ⟨hp, hb⟩ := p02_lm009_moment40_weighted_r4 μ W R hW hW0 hR
+ r ε M cW cZ hr hε hM hcW hcZ hRi hMbound hsecond hlower
+ exact ⟨hp, p02_lm009_palm_r4_to_r3 _ _ r (by positivity) hr.le hr1 hb⟩
+
+/-- A uniform family conclusion only when all law-specific bounds are supplied
+uniformly. This proves the quantifier assembly, not the existence of model bounds. -/
+theorem p02_lm009_moment40_family_r3
+ (μ : ℝ → Measure Ω) [∀ r, IsProbabilityMeasure (μ r)]
+ (W R : ℝ → Ω → ℝ) (r0 ε M cW cZ : ℝ)
+ (hr0 : 0 < r0 ∧ r0 ≤ 1) (hε : 0 < ε)
+ (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)
+ (hdata : ∀ r, 0 < r → r ≤ r0 →
+ MemLp (W r) 2 (μ r) ∧ (0 ≤ᵐ[μ r] W r) ∧ Measurable (R r) ∧
+ Integrable (fun x => R r x ^ 40) (μ r) ∧
+ (∫ x, R r x ^ 40 ∂(μ r)) ≤ M ∧
+ (∫ x, W r x ^ 2 ∂(μ r)) ≤ cW * r ^ 4 ∧
+ cZ * r ^ 2 ≤ ∫ x, W r x ∂(μ r)) :
+ ∃ C : ℝ, 0 ≤ C ∧ ∀ r, 0 < r → r ≤ r0 →
+ IsProbabilityMeasure (weightedLaw (μ r) (W r)) ∧
+ (weightedLaw (μ r) (W r) (badJetEvent (R r) r ε)).toReal ≤ C * r ^ 3 := by
+ refine ⟨(Real.sqrt cW / cZ) * Real.sqrt (M / ε ^ 8), by positivity, ?_⟩
+ intro r hr hrr0
+ obtain ⟨hW, hW0, hR, hRi, hMb, hsecond, hlower⟩ := hdata r hr hrr0
+ exact p02_lm009_moment40_weighted_r3 (μ r) (W r) (R r) hW hW0 hR
+ r ε M cW cZ hr (hrr0.trans hr0.2) hε hM hcW hcZ hRi hMb hsecond hlower
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean
new file mode 100644
index 000000000..57adcc3d1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean
@@ -0,0 +1,88 @@
+import Mathlib
+
+namespace ResearchFormalCoreR1
+
+set_option autoImplicit false
+
+/-- P02-LM-008 algebraic companion: exact cancellation of the `r²` factor
+ after the Cauchy–Schwarz numerator bound and the normalizer lower bound
+ have been established in the surrounding probability theorem. -/
+theorem p02_lm008_r2_cancel
+ (r cW cZ q : ℝ) (hr : r ≠ 0) (hcZ : cZ ≠ 0) :
+ (Real.sqrt cW * r ^ 2 * Real.sqrt q) / (cZ * r ^ 2) =
+ (Real.sqrt cW / cZ) * Real.sqrt q := by
+ field_simp [hr, hcZ]
+
+/-- P02-LM-008 cross-multiplied transfer companion. This theorem starts
+ from an already supplied Cauchy–Schwarz numerator estimate and an exact
+ normalizer lower bound. It does not formalize the measure-theoretic
+ Cauchy–Schwarz step itself. -/
+theorem p02_lm008_cross_multiplied
+ (n z r cW cZ q : ℝ)
+ (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hq : 0 ≤ q)
+ (hz : cZ * r ^ 2 ≤ z)
+ (hn : n ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q) :
+ n * (cZ * r ^ 2) ≤
+ (Real.sqrt cW * r ^ 2 * Real.sqrt q) * z := by
+ have hden : 0 ≤ cZ * r ^ 2 :=
+ mul_nonneg (le_of_lt hcZ) (sq_nonneg r)
+ have hnum : 0 ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q := by
+ positivity
+ calc
+ n * (cZ * r ^ 2) ≤
+ (Real.sqrt cW * r ^ 2 * Real.sqrt q) * (cZ * r ^ 2) := by
+ exact mul_le_mul_of_nonneg_right hn hden
+ _ ≤ (Real.sqrt cW * r ^ 2 * Real.sqrt q) * z := by
+ exact mul_le_mul_of_nonneg_left hz hnum
+
+/-- P02-LM-008 quotient companion. With positive denominators, the
+ cross-multiplied inequality and exact `r²` cancellation yield the Palm
+ square-root transfer coefficient. -/
+theorem p02_lm008_quotient_bound
+ (n z r cW cZ q : ℝ)
+ (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hq : 0 ≤ q)
+ (hzpos : 0 < z) (hz : cZ * r ^ 2 ≤ z)
+ (hn : n ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q) :
+ n / z ≤ (Real.sqrt cW / cZ) * Real.sqrt q := by
+ have hscaled : 0 < cZ * r ^ 2 :=
+ mul_pos hcZ (sq_pos_of_pos hr)
+ have hcross :=
+ p02_lm008_cross_multiplied n z r cW cZ q hr hcW hcZ hq hz hn
+ rw [← p02_lm008_r2_cancel r cW cZ q (ne_of_gt hr) (ne_of_gt hcZ)]
+ exact (div_le_div_iff₀ hzpos hscaled).2 hcross
+
+/-- P02-LM-009 deterministic threshold companion. Failure of
+ `r * R^5 ≤ ε` implies the fifth-power threshold used before Markov's
+ inequality. -/
+theorem p02_lm009_bad_event_threshold
+ (r R ε : ℝ) (hr : 0 < r) (hbad : ε < r * R ^ 5) :
+ ε / r < R ^ 5 := by
+ exact (div_lt_iff₀ hr).2 (by simpa [mul_comm] using hbad)
+
+/-- The fixed exponent identity used when the 40th moment is selected in
+ the P02-LM-009 application. -/
+theorem p02_lm009_power40_identity (R : ℝ) :
+ (R ^ 5) ^ 8 = R ^ 40 := by
+ ring
+
+/-- In the final P0.2 power ledger, an `O(r^4)` Palm tail is also `O(r^3)`
+ on `0 ≤ r ≤ 1`. -/
+theorem p02_lm009_r4_le_r3
+ (r : ℝ) (hr0 : 0 ≤ r) (hr1 : r ≤ 1) :
+ r ^ 4 ≤ r ^ 3 := by
+ have h : 0 ≤ r ^ 3 * (1 - r) :=
+ mul_nonneg (pow_nonneg hr0 3) (sub_nonneg.mpr hr1)
+ nlinarith
+
+/-- Conditional rate companion: once the Palm square-root transfer has
+ produced a uniform `C r^4` bound, the cubic target follows on `r ≤ 1`. -/
+theorem p02_lm009_palm_r4_to_r3
+ (p C r : ℝ) (hC : 0 ≤ C) (hr0 : 0 ≤ r) (hr1 : r ≤ 1)
+ (hp : p ≤ C * r ^ 4) :
+ p ≤ C * r ^ 3 := by
+ calc
+ p ≤ C * r ^ 4 := hp
+ _ ≤ C * r ^ 3 := by
+ exact mul_le_mul_of_nonneg_left (p02_lm009_r4_le_r3 r hr0 hr1) hC
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/WeightPerturbation.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/WeightPerturbation.lean
new file mode 100644
index 000000000..8dfd69326
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/WeightPerturbation.lean
@@ -0,0 +1,141 @@
+import ResearchFormalCoreR1.WeightedLaw
+
+/-!
+# Same-law stability of normalized nonnegative weights
+
+An actual L1 error controls the normalizer and every measurable-event probability.
+The reference lower bound and the concrete L1 estimate remain premises. Both
+weights use the same underlying measure. See ../WEIGHT_PERTURBATION.md.
+-/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory
+open scoped ENNReal
+
+set_option autoImplicit false
+
+variable {Ω : Type*} [MeasurableSpace Ω]
+
+/-- Integrability, not a totalized divergent integral, justifies subtraction. -/
+theorem weightPerturbation_integral
+ (μ : Measure Ω) (W V : Ω → ℝ) (hW : Integrable W μ) (hV : Integrable V μ) :
+ |(∫ x, W x ∂μ) - (∫ x, V x ∂μ)| ≤ ∫ x, |W x - V x| ∂μ := by
+ rw [← integral_sub hW hV]
+ exact abs_integral_le_integral_abs
+
+/-- Restricting to any set cannot increase the integral absolute error. The
+probability formula below separately requires measurable events. -/
+theorem weightPerturbation_setIntegral
+ (μ : Measure Ω) (W V : Ω → ℝ) (A : Set Ω)
+ (hW : Integrable W μ) (hV : Integrable V μ) :
+ |(∫ x in A, W x ∂μ) - (∫ x in A, V x ∂μ)| ≤ ∫ x, |W x - V x| ∂μ := by
+ exact (weightPerturbation_integral (μ.restrict A) W V
+ hW.integrableOn hV.integrableOn).trans
+ (setIntegral_le_integral (hW.sub hV).abs
+ (Filter.Eventually.of_forall (fun x => abs_nonneg (W x - V x))))
+
+/-- A reference normalizer lower bound loses at most the supplied L1 budget. -/
+theorem weightPerturbation_normalizer_lower
+ (μ : Measure Ω) (W V : Ω → ℝ) (hW : Integrable W μ) (hV : Integrable V μ)
+ (c δ : ℝ) (hreference : c ≤ ∫ x, V x ∂μ)
+ (herror : (∫ x, |W x - V x| ∂μ) ≤ δ) :
+ c - δ ≤ ∫ x, W x ∂μ := by
+ have h := (abs_le.mp ((weightPerturbation_integral μ W V hW hV).trans herror)).1
+ linarith
+
+/-- A nonnegative event numerator lies between zero and its own normalizer. -/
+theorem weightPerturbation_event_integral_bounds
+ (μ : Measure Ω) (W : Ω → ℝ) (A : Set Ω)
+ (hW : Integrable W μ) (hW0 : 0 ≤ᵐ[μ] W) :
+ 0 ≤ (∫ x in A, W x ∂μ) ∧ (∫ x in A, W x ∂μ) ≤ ∫ x, W x ∂μ := by
+ exact ⟨integral_nonneg_of_ae (ae_restrict_of_ae hW0),
+ setIntegral_le_integral hW hW0⟩
+
+/-- Scalar ratio stability with the reference denominator t. The factor 2 is
+convenient, not claimed optimal. No sign premise on b is needed for this lemma. -/
+theorem weightPerturbation_quotient_bound
+ (a b z t δ : ℝ) (hz : 0 < z) (ht : 0 < t)
+ (ha : 0 ≤ a) (haz : a ≤ z) (hab : |a - b| ≤ δ) (hzt : |z - t| ≤ δ) :
+ |a / z - b / t| ≤ 2 * δ / t := by
+ have hfrac0 : 0 ≤ a / z := div_nonneg ha hz.le
+ have hfrac1 : a / z ≤ 1 := (div_le_one hz).2 haz
+ have hgap : |t - z| ≤ δ := by
+ rw [abs_sub_comm]
+ exact hzt
+ have hprod : |a / z| * |t - z| ≤ δ := by
+ rw [abs_of_nonneg hfrac0]
+ calc
+ (a / z) * |t - z| ≤ 1 * |t - z| :=
+ mul_le_mul_of_nonneg_right hfrac1 (abs_nonneg _)
+ _ ≤ δ := by simpa only [one_mul] using hgap
+ have heq : a / z - b / t = ((a - b) + (a / z) * (t - z)) / t := by
+ field_simp [ne_of_gt hz, ne_of_gt ht] <;> ring
+ calc
+ |a / z - b / t| = |(a - b) + (a / z) * (t - z)| / t := by
+ rw [heq, abs_div, abs_of_pos ht]
+ _ ≤ (|a - b| + |(a / z) * (t - z)|) / t :=
+ div_le_div_of_nonneg_right (abs_add_le _ _) ht.le
+ _ ≤ (δ + δ) / t := by
+ apply div_le_div_of_nonneg_right _ ht.le
+ rw [abs_mul]
+ exact add_le_add hab hprod
+ _ = 2 * δ / t := by ring
+
+/-- Under one common measure, a small L1 weight error transfers a positive
+reference normalizer to W and controls all measurable-event probabilities.
+The ambient measure need not be finite or a probability measure. -/
+theorem weightedLaw_event_perturbation
+ (μ : Measure Ω) (W V : Ω → ℝ) (hW : Integrable W μ) (hV : Integrable V μ)
+ (hW0 : 0 ≤ᵐ[μ] W) (hV0 : 0 ≤ᵐ[μ] V)
+ (c δ : ℝ) (hc : 0 < c) (hreference : c ≤ ∫ x, V x ∂μ)
+ (herror : (∫ x, |W x - V x| ∂μ) ≤ δ) (hsmall : δ ≤ c / 2) :
+ c / 2 ≤ (∫ x, W x ∂μ) ∧
+ IsProbabilityMeasure (weightedLaw μ W) ∧
+ IsProbabilityMeasure (weightedLaw μ V) ∧
+ ∀ A : Set Ω, MeasurableSet A →
+ |(weightedLaw μ W A).toReal - (weightedLaw μ V A).toReal| ≤ 2 * δ / c := by
+ have hL1nonneg : 0 ≤ ∫ x, |W x - V x| ∂μ :=
+ integral_nonneg (fun x => abs_nonneg (W x - V x))
+ have hδ0 : 0 ≤ δ := hL1nonneg.trans herror
+ have hlower := weightPerturbation_normalizer_lower μ W V hW hV c δ hreference herror
+ have hz : 0 < ∫ x, W x ∂μ := by linarith
+ have ht : 0 < ∫ x, V x ∂μ := lt_of_lt_of_le hc hreference
+ refine ⟨by linarith, weightedLaw_isProbabilityMeasure μ W hW hW0 hz,
+ weightedLaw_isProbabilityMeasure μ V hV hV0 ht, ?_⟩
+ intro A hA
+ rw [weightedLaw_event_real μ W A hW hW0 hA hz,
+ weightedLaw_event_real μ V A hV hV0 hA ht]
+ have hb := weightPerturbation_event_integral_bounds μ W A hW hW0
+ exact (weightPerturbation_quotient_bound _ _ _ _ δ hz ht hb.1 hb.2
+ ((weightPerturbation_setIntegral μ W V A hW hV).trans herror)
+ ((weightPerturbation_integral μ W V hW hV).trans herror)).trans
+ (div_le_div_of_nonneg_left (mul_nonneg (by norm_num) hδ0) hc hreference)
+
+/-- The natural r² normalizer and L1-error scales cancel. No r ≤ 1 restriction
+is needed. Uniform application requires uniform c and the displayed budgets. -/
+theorem weightedLaw_event_perturbation_r2
+ (μ : Measure Ω) (W V : Ω → ℝ) (hW : Integrable W μ) (hV : Integrable V μ)
+ (hW0 : 0 ≤ᵐ[μ] W) (hV0 : 0 ≤ᵐ[μ] V)
+ (r c η : ℝ) (hr : 0 < r) (hc : 0 < c)
+ (hreference : c * r ^ 2 ≤ ∫ x, V x ∂μ)
+ (herror : (∫ x, |W x - V x| ∂μ) ≤ η * r ^ 2) (hsmall : η ≤ c / 2) :
+ (c * r ^ 2) / 2 ≤ (∫ x, W x ∂μ) ∧
+ IsProbabilityMeasure (weightedLaw μ W) ∧
+ IsProbabilityMeasure (weightedLaw μ V) ∧
+ ∀ A : Set Ω, MeasurableSet A →
+ |(weightedLaw μ W A).toReal - (weightedLaw μ V A).toReal| ≤ 2 * η / c := by
+ have hs : η * r ^ 2 ≤ (c * r ^ 2) / 2 := by
+ calc
+ η * r ^ 2 ≤ (c / 2) * r ^ 2 :=
+ mul_le_mul_of_nonneg_right hsmall (sq_nonneg r)
+ _ = (c * r ^ 2) / 2 := by ring
+ obtain ⟨hlower, hpW, hpV, hA⟩ := weightedLaw_event_perturbation μ W V hW hV hW0 hV0
+ (c * r ^ 2) (η * r ^ 2) (mul_pos hc (sq_pos_of_pos hr)) hreference herror hs
+ refine ⟨hlower, hpW, hpV, ?_⟩
+ intro A hmeas
+ have heq : 2 * (η * r ^ 2) / (c * r ^ 2) = 2 * η / c := by
+ field_simp [ne_of_gt hr, ne_of_gt hc]
+ simpa only [heq] using hA A hmeas
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/WeightedLaw.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/WeightedLaw.lean
new file mode 100644
index 000000000..b51ca969a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/WeightedLaw.lean
@@ -0,0 +1,127 @@
+import ResearchFormalCoreR1.MeasureBridge
+
+/-!
+# A normalized nonnegative weighted probability law
+
+This supplies the probability-law construction deliberately excluded from
+MeasureBridge. The concrete field, conditioning, moment, normalizer and tail
+estimates are not constructed. See ../WEIGHTED_LAW.md for exact scope.
+-/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory
+open scoped ENNReal
+
+set_option autoImplicit false
+
+variable {Ω : Type*} [MeasurableSpace Ω]
+
+/-- A measure for any W; it is a probability measure only under the hypotheses
+proved below. `ofReal` clips negative values, so a.e. nonnegativity is essential
+when identifying its density integral with the signed Bochner integral. -/
+noncomputable def weightedLaw (μ : Measure Ω) (W : Ω → ℝ) : Measure Ω :=
+ (ENNReal.ofReal (∫ x, W x ∂μ))⁻¹ •
+ μ.withDensity (fun x => ENNReal.ofReal (W x))
+
+/-- Measurable-event mass before taking real values. Genuine integrability and
+nonnegativity identify the density integral with the Bochner set integral. -/
+theorem weightedLaw_apply
+ (μ : Measure Ω) (W : Ω → ℝ) (A : Set Ω)
+ (hW : Integrable W μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A) :
+ weightedLaw μ W A = (ENNReal.ofReal (∫ x, W x ∂μ))⁻¹ *
+ ENNReal.ofReal (∫ x in A, W x ∂μ) := by
+ simp only [weightedLaw, Measure.smul_apply, smul_eq_mul, withDensity_apply _ hA]
+ rw [← ofReal_integral_eq_lintegral_ofReal hW.integrableOn (ae_restrict_of_ae hW0)]
+
+/-- Total mass one follows from a positive finite normalizer. This theorem does
+not assume that the measure it constructs is already a probability measure. -/
+theorem weightedLaw_isProbabilityMeasure
+ (μ : Measure Ω) (W : Ω → ℝ)
+ (hW : Integrable W μ) (hW0 : 0 ≤ᵐ[μ] W)
+ (hz : 0 < ∫ x, W x ∂μ) : IsProbabilityMeasure (weightedLaw μ W) := by
+ constructor
+ rw [weightedLaw_apply μ W Set.univ hW hW0 MeasurableSet.univ]
+ simp only [Measure.restrict_univ]
+ exact ENNReal.inv_mul_cancel (ne_of_gt (ENNReal.ofReal_pos.mpr hz))
+ ENNReal.ofReal_ne_top
+
+/-- The real event probability is the same-law integral ratio. The positive
+normalizer is retained explicitly for its intended probability interpretation. -/
+theorem weightedLaw_event_real
+ (μ : Measure Ω) (W : Ω → ℝ) (A : Set Ω)
+ (hW : Integrable W μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)
+ (hz : 0 < ∫ x, W x ∂μ) :
+ (weightedLaw μ W A).toReal = (∫ x in A, W x ∂μ) / (∫ x, W x ∂μ) := by
+ rw [weightedLaw_apply μ W A hW hW0 hA, ENNReal.toReal_mul,
+ ENNReal.toReal_inv, ENNReal.toReal_ofReal hz.le,
+ ENNReal.toReal_ofReal (integral_nonneg_of_ae (ae_restrict_of_ae hW0))]
+ ring
+
+/-- A null event under the original law is also null under the weighted law.
+No independence or strict positivity of W is required for absolute continuity. -/
+theorem weightedLaw_absolutelyContinuous
+ (μ : Measure Ω) (W : Ω → ℝ) : weightedLaw μ W ≪ μ := by
+ intro A hA
+ have hzero := (withDensity_absolutelyContinuous μ (fun x => ENNReal.ofReal (W x))) hA
+ simp only [weightedLaw, Measure.smul_apply, smul_eq_mul, hzero, mul_zero]
+
+/-- Changing W on a null set changes neither its normalizer nor the law. -/
+theorem weightedLaw_congr_ae
+ (μ : Measure Ω) (W V : Ω → ℝ) (h : W =ᵐ[μ] V) :
+ weightedLaw μ W = weightedLaw μ V := by
+ have hd : (fun x => ENNReal.ofReal (W x)) =ᵐ[μ]
+ (fun x => ENNReal.ofReal (V x)) :=
+ h.mono (fun _ hx => congrArg ENNReal.ofReal hx)
+ unfold weightedLaw
+ rw [integral_congr_ae h, withDensity_congr_ae hd]
+
+/-- The zero weight gives the zero measure, not a probability law. This exposes
+why normalization positivity cannot be removed from the construction theorem. -/
+theorem weightedLaw_zero (μ : Measure Ω) :
+ weightedLaw μ (fun _ : Ω => (0 : ℝ)) = 0 := by
+ simp [weightedLaw]
+
+/-- A unit weight on a probability space recovers the original probability law. -/
+theorem weightedLaw_one (μ : Measure Ω) [IsProbabilityMeasure μ] :
+ weightedLaw μ (fun _ : Ω => (1 : ℝ)) = μ := by
+ simp [weightedLaw]
+
+/-- P02-LM-008 for the actual constructed measure, including its probability
+property. The concrete moment and lower-normalizer estimates remain premises. -/
+theorem p02_lm008_probability_transfer
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)
+ (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)
+ (r cW cZ : ℝ) (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)
+ (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)
+ (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ) :
+ IsProbabilityMeasure (weightedLaw μ W) ∧
+ (weightedLaw μ W A).toReal ≤ (Real.sqrt cW / cZ) * Real.sqrt ((μ A).toReal) := by
+ have hi : Integrable W μ := hW.integrable (by norm_num)
+ have hz : 0 < ∫ x, W x ∂μ :=
+ lt_of_lt_of_le (mul_pos hcZ (sq_pos_of_pos hr)) hlower
+ refine ⟨weightedLaw_isProbabilityMeasure μ W hi hW0 hz, ?_⟩
+ rw [weightedLaw_event_real μ W A hi hW0 hA hz]
+ exact p02_lm008_measure_transfer μ W A hW hW0 hA r cW cZ hr hcW hcZ hsecond hlower
+
+/-- The supplied eighth-order event bound transfers to the constructed law's
+cubic bound. Neither the event bound nor uniformity in r is proved here. -/
+theorem p02_lm009_probability_transfer_r8_to_r3
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)
+ (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)
+ (r cW cZ K : ℝ) (hr : 0 < r) (hr1 : r ≤ 1)
+ (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hK : 0 ≤ K)
+ (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)
+ (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ)
+ (htail : (μ A).toReal ≤ K * r ^ 8) :
+ IsProbabilityMeasure (weightedLaw μ W) ∧
+ (weightedLaw μ W A).toReal ≤ ((Real.sqrt cW / cZ) * Real.sqrt K) * r ^ 3 := by
+ have hi : Integrable W μ := hW.integrable (by norm_num)
+ have hz : 0 < ∫ x, W x ∂μ :=
+ lt_of_lt_of_le (mul_pos hcZ (sq_pos_of_pos hr)) hlower
+ refine ⟨weightedLaw_isProbabilityMeasure μ W hi hW0 hz, ?_⟩
+ rw [weightedLaw_event_real μ W A hi hW0 hA hz]
+ exact p02_lm009_measure_transfer_r8_to_r3 μ W A hW hW0 hA r cW cZ K
+ hr hr1 hcW hcZ hK hsecond hlower htail
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean
new file mode 100644
index 000000000..a59ee9daa
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean
@@ -0,0 +1,83 @@
+import ElderClearance
+import ElderInterval
+
+/-!
+Geometric input join for the actual ordinary-H0 interval construction.
+Root01a11cbf, local author candidate, 17 October 2026.
+No analytic fold, Morse uniqueness or torus theorem is assumed proved here.
+-/
+
+noncomputable section
+open CategoryTheory Limits
+
+namespace TorusFiltration
+universe u
+
+/-- Every active closed level includes continuously into the strict level
+above d. Pulling back the proved strict separation gives closed-level separation. -/
+theorem elderTrap_closedTrace_isClopen {X : Type u} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (d t : ℝ)
+ (htrace : IsClopen (elderTrap_strictTrace g D d)) (ht : t < -d) :
+ IsClopen {x : superlevel_set g t | x.val ∈ D} := by
+ have hdt : d < -t := by linarith
+ let i : superlevel_set g t → {x : X // d < g x} :=
+ fun x => ⟨x.val, lt_of_lt_of_le hdt x.property⟩
+ have hi : Continuous i := continuous_subtype_val.subtype_mk _
+ exact htrace.preimage hi
+
+/-- Actual geometric boundary, ceiling and closed path data inhabit the interval
+trap. There is no H0 equation, interval split, clearance or death among inputs. -/
+theorem elderTrap_of_boundary {X : Type u} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (m d : ℝ) (M P : X)
+ (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)
+ (hdm : d < m) (hMheight : g M = m) (hM : M ∈ D)
+ (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)
+ (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :
+ ElderTrap g M P m d D where
+ death_lt_birth := hdm
+ maximum_height := hMheight
+ older_height := hP
+ maximum_inside := hM
+ older_outside := by
+ intro hPD
+ exact (not_lt_of_ge (hheight P hPD)) hP
+ height_ceiling := hheight
+ active_clopen := fun t ht => elderTrap_closedTrace_isClopen g D d t
+ (elderTrap_strictTrace_isClopen g D d hD hboundary) ht.2
+ closed_path := by
+ refine ⟨γ, ?_⟩
+ intro t
+ change -(-d) ≤ g (γ t)
+ simpa only [neg_neg] using hγ t
+
+/-- The constructed singular-H0 direct summand, instantiated from geometric
+inputs, rather than a premise asserting that a persistence summand exists. -/
+def elderBoundaryDirectSummand (k : Type u) [Field k]
+ {X : Type u} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (m d : ℝ) (M P : X)
+ (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)
+ (hdm : d < m) (hMheight : g M = m) (hM : M ∈ D)
+ (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)
+ (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :
+ superlevel_h0Filtration g (ModuleCat.of k k) ≅
+ elderInterval k m d ⊞ kernel (elderRetraction (k := k)
+ (elderTrap_of_boundary g D m d M P hD hboundary hdm hMheight hM hheight hP γ hγ)) :=
+ elderDirectSummand (k := k)
+ (elderTrap_of_boundary g D m d M P hD hboundary hdm hMheight hM hheight hP γ hγ)
+
+/-- On Euclidean heights the same geometric inputs also give the literal C263
+death. This is a proved join, not identification of an abstract death field. -/
+theorem elderBoundary_death_eq {n : ℕ}
+ (g : superlevelBar_E n → ℝ) (hg : Continuous g)
+ (D : Set (superlevelBar_E n)) (m d : ℝ) (M P : superlevelBar_E n)
+ (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)
+ (hMheight : g M = m) (hM : M ∈ D)
+ (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)
+ (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :
+ superlevelBar_deathHeight g M = d := by
+ apply elderTrap_death_eq g hg D d
+ (elderTrap_strictTrace_isClopen g D d hD hboundary) M hM
+ (fun x hx => (hheight x hx).trans_eq hMheight.symm) P
+ (hMheight.trans_lt hP) γ hγ
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridgeAudit.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridgeAudit.lean
new file mode 100644
index 000000000..d5979bcc8
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridgeAudit.lean
@@ -0,0 +1,9 @@
+import ElderBridge
+
+#print axioms TorusFiltration.elderTrap_closedTrace_isClopen
+#print axioms TorusFiltration.elderTrap_of_boundary
+#print axioms TorusFiltration.elderBoundaryDirectSummand
+#print axioms TorusFiltration.elderBoundary_death_eq
+
+#check TorusFiltration.elderBoundaryDirectSummand
+#check TorusFiltration.elderBoundary_death_eq
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean
new file mode 100644
index 000000000..bc6136ee5
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean
@@ -0,0 +1,129 @@
+import SuperlevelBar
+
+/-!
+# From a geometric exit trap to the literal strict-clearance death
+
+Author: OpenAI/Codex ROOT01a11cbf. Local candidate, 17 October 2026.
+This proves a topological interface used by the reviewed asymmetric fold trap.
+It does not assume the desired elder relation, clearance cut or death value.
+The hypotheses are an actual closed domain with boundary below the threshold,
+a bound on all heights inside, and an actual higher-endpoint path at the closed
+threshold. The analytic fold construction of these hypotheses, the torus lift,
+Morse saddle uniqueness and the H0 interval split are separate obligations.
+Compilation, kernel checking and alignment are recorded separately.
+-/
+
+noncomputable section
+
+namespace TorusFiltration
+
+/-- The trace of a geometric domain in the strict superlevel above d. -/
+def elderTrap_strictTrace {X : Type*} (g : X → ℝ) (D : Set X) (d : ℝ) :
+ Set {x : X // d < g x} := {x | x.val ∈ D}
+
+/-- A boundary height bound makes the trace clopen in the strict superlevel.
+This derives separation from a geometric domain; it does not assume a path cut. -/
+theorem elderTrap_strictTrace_isClopen {X : Type*} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (d : ℝ) (hD : IsClosed D)
+ (hboundary : ∀ x ∈ frontier D, g x ≤ d) :
+ IsClopen (elderTrap_strictTrace g D d) := by
+ have heq : elderTrap_strictTrace g D d =
+ (Subtype.val : {x : X // d < g x} → X) ⁻¹' interior D := by
+ ext x
+ constructor
+ · intro hx
+ change x.val ∈ D at hx
+ change x.val ∈ interior D
+ apply (mem_interior_iff_notMem_frontier hx).2
+ intro hfrontier
+ exact (not_lt_of_ge (hboundary x.val hfrontier)) x.property
+ · intro hx
+ change x.val ∈ interior D at hx
+ change x.val ∈ D
+ exact interior_subset hx
+ refine ⟨hD.preimage continuous_subtype_val, ?_⟩
+ rw [heq]
+ exact isOpen_interior.preimage continuous_subtype_val
+
+/-- A path strictly above the exit threshold cannot leave the geometric trap. -/
+theorem elderTrap_path_stays {X : Type*} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (d : ℝ)
+ (htrace : IsClopen (elderTrap_strictTrace g D d))
+ {M y : X} (hM : M ∈ D) (γ : Path M y)
+ (hγ : ∀ t : unitInterval, d < g (γ t)) : y ∈ D := by
+ let δ : unitInterval → {x : X // d < g x} := fun t => ⟨γ t, hγ t⟩
+ have hδ : Continuous δ := γ.continuous.subtype_mk _
+ have hpre := htrace.preimage hδ
+ have hzero : (0 : unitInterval) ∈ δ ⁻¹' elderTrap_strictTrace g D d := by
+ change γ 0 ∈ D
+ simpa only [γ.source] using hM
+ have hall := hpre.eq_univ ⟨0, hzero⟩
+ have hone : (1 : unitInterval) ∈ δ ⁻¹' elderTrap_strictTrace g D d := by
+ rw [hall]
+ exact Set.mem_univ _
+ change γ 1 ∈ D at hone
+ simpa only [γ.target] using hone
+
+/-- Every higher-endpoint path must meet or fall below the exit threshold.
+The conclusion quantifies over all ambient paths, including remote detours. -/
+theorem elderTrap_higher_path_meets_threshold {X : Type*} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (d : ℝ)
+ (htrace : IsClopen (elderTrap_strictTrace g D d))
+ (M : X) (hM : M ∈ D) (hheight : ∀ x ∈ D, g x ≤ g M)
+ {y : X} (hy : g M < g y) (γ : Path M y) :
+ ∃ t : unitInterval, g (γ t) ≤ d := by
+ by_contra hnone
+ push Not at hnone
+ have hyD := elderTrap_path_stays g D d htrace hM γ hnone
+ exact (not_lt_of_ge (hheight y hyD)) hy
+
+/-- The literal C263 clearance is exactly the strict interval below d.
+The closed path is supplied by the geometric construction, rather than inferred
+from a supremum over paths or from a compactness assertion about path space. -/
+theorem elderTrap_clearance_eq_Iio {n : ℕ}
+ (g : superlevelBar_E n → ℝ) (D : Set (superlevelBar_E n)) (d : ℝ)
+ (htrace : IsClopen (elderTrap_strictTrace g D d))
+ (M : superlevelBar_E n) (hM : M ∈ D)
+ (hheight : ∀ x ∈ D, g x ≤ g M)
+ (P : superlevelBar_E n) (hP : g M < g P) (γ : Path M P)
+ (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :
+ superlevelBar_clearanceSet g M = Set.Iio d := by
+ ext h
+ constructor
+ · rintro ⟨y, hy, η, hη⟩
+ obtain ⟨t, ht⟩ := elderTrap_higher_path_meets_threshold g D d htrace M hM hheight hy η
+ exact lt_of_lt_of_le (hη t) ht
+ · intro hh
+ exact ⟨P, hP, γ, fun t => lt_of_lt_of_le hh (hγ t)⟩
+
+/-- With continuity, the new geometric cut identifies the existing C263 death.
+Nonessentiality is derived from the actual higher point P. -/
+theorem elderTrap_death_eq {n : ℕ}
+ (g : superlevelBar_E n → ℝ) (hg : Continuous g)
+ (D : Set (superlevelBar_E n)) (d : ℝ)
+ (htrace : IsClopen (elderTrap_strictTrace g D d))
+ (M : superlevelBar_E n) (hM : M ∈ D)
+ (hheight : ∀ x ∈ D, g x ≤ g M)
+ (P : superlevelBar_E n) (hP : g M < g P) (γ : Path M P)
+ (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :
+ superlevelBar_deathHeight g M = d := by
+ have hne : ¬ superlevelBar_isEssential g M := fun hess =>
+ (not_lt_of_ge (hess P)) hP
+ apply (superlevelBar_cut_unique g hg M hne d ?_).symm
+ intro h
+ rw [elderTrap_clearance_eq_Iio g D d htrace M hM hheight P hP γ hγ]
+ rfl
+
+/-- The displayed closed path actually attains d. This does not replace strict
+clearance by a closed inequality or infer an optimal path from a supremum. -/
+theorem elderTrap_closed_path_attains {X : Type*} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (d : ℝ)
+ (htrace : IsClopen (elderTrap_strictTrace g D d))
+ (M : X) (hM : M ∈ D) (hheight : ∀ x ∈ D, g x ≤ g M)
+ {P : X} (hP : g M < g P) (γ : Path M P)
+ (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :
+ ∃ t : unitInterval, g (γ t) = d := by
+ obtain ⟨t, ht⟩ := elderTrap_higher_path_meets_threshold g D d htrace M hM hheight hP γ
+ exact ⟨t, le_antisymm ht (hγ t)⟩
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearanceAudit.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearanceAudit.lean
new file mode 100644
index 000000000..2a8371db0
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearanceAudit.lean
@@ -0,0 +1,12 @@
+import ElderClearanceControls
+
+#print axioms TorusFiltration.elderTrap_strictTrace
+#print axioms TorusFiltration.elderTrap_strictTrace_isClopen
+#print axioms TorusFiltration.elderTrap_path_stays
+#print axioms TorusFiltration.elderTrap_higher_path_meets_threshold
+#print axioms TorusFiltration.elderTrap_clearance_eq_Iio
+#print axioms TorusFiltration.elderTrap_death_eq
+#print axioms TorusFiltration.elderTrap_closed_path_attains
+#print axioms TorusFiltration.elder_control_below
+#print axioms TorusFiltration.elder_control_death_excluded
+#print axioms TorusFiltration.elder_control_positive_lifetime
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearanceControls.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearanceControls.lean
new file mode 100644
index 000000000..2fc74bc87
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearanceControls.lean
@@ -0,0 +1,33 @@
+import ElderClearance
+
+noncomputable section
+namespace TorusFiltration
+
+variable {n : ℕ} (g : superlevelBar_E n → ℝ)
+ (D : Set (superlevelBar_E n)) (d : ℝ)
+ (htrace : IsClopen (elderTrap_strictTrace g D d))
+ (M : superlevelBar_E n) (hM : M ∈ D)
+ (hheight : ∀ x ∈ D, g x ≤ g M)
+ (P : superlevelBar_E n) (hP : g M < g P) (γ : Path M P)
+ (hγ : ∀ t : unitInterval, d ≤ g (γ t))
+
+include D htrace hM hheight P hP γ hγ
+
+/-- A strict subthreshold is genuinely attained as strict clearance. -/
+theorem elder_control_below : d - 1 ∈ superlevelBar_clearanceSet g M := by
+ rw [elderTrap_clearance_eq_Iio g D d htrace M hM hheight P hP γ hγ]
+ change d - 1 < d
+ linarith
+
+/-- The attained closed death is excluded from the strict clearance set. -/
+theorem elder_control_death_excluded : d ∉ superlevelBar_clearanceSet g M := by
+ rw [elderTrap_clearance_eq_Iio g D d htrace M hM hheight P hP γ hγ]
+ exact lt_irrefl d
+
+/-- A strict geometric height gap gives positive lifetime in the literal data. -/
+theorem elder_control_positive_lifetime (hg : Continuous g) (hdm : d < g M) :
+ 0 < g M - superlevelBar_deathHeight g M := by
+ rw [elderTrap_death_eq g hg D d htrace M hM hheight P hP γ hγ]
+ linarith
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean
new file mode 100644
index 000000000..108f880b3
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean
@@ -0,0 +1,392 @@
+import OrdinaryH0
+
+/-!+# One actual ordinary-H0 interval summand from an asymmetric trap
+
+Author implementation. The geometric premises remain visible; this file does not
+prove the analytic ridge estimates, Morse labeling, or an exhaustive barcode.
+The coefficient object is the field itself, and H0 is the existing singular
+homology functor, compared with components by the proved C264 isomorphism.
+-/
+
+noncomputable section
+
+open CategoryTheory Limits AlgebraicTopology
+open scoped Classical
+
+namespace TorusFiltration
+
+universe u
+
+/-- Increasing parameter `t=-height`: closed birth and open death. -/
+def elderActive (m d t : ℝ) : Prop := -m ≤ t ∧ t < -d
+
+variable (k : Type u) [Field k]
+
+/-- The fiber is k on the interval and the zero submodule elsewhere. -/
+def elderFiber (m d t : ℝ) : Submodule k k where
+ carrier := {a | ¬ elderActive m d t → a = 0}
+ zero_mem' := by simp
+ add_mem' := by intro a b ha hb h; simp [ha h, hb h]
+ smul_mem' := by intro a b hb h; simp [hb h]
+
+theorem elderFiber_eq_zero {m d t : ℝ} (ht : ¬ elderActive m d t)
+ (x : elderFiber k m d t) : x = 0 := by
+ apply Subtype.ext
+ exact x.property ht
+
+def elderFiberMap (m d : ℝ) {s t : ℝ} (hst : s ≤ t) :
+ elderFiber k m d s →ₗ[k] elderFiber k m d t where
+ toFun x := ⟨if t < -d then x.val else 0, by
+ intro ht
+ by_cases htd : t < -d
+ · have hsa : ¬ elderActive m d s := by
+ intro hs
+ exact ht ⟨hs.1.trans hst, htd⟩
+ simp [htd, x.property hsa]
+ · simp [htd]⟩
+ map_add' := by intro x y; apply Subtype.ext; dsimp; split_ifs <;> simp
+ map_smul' := by intro a x; apply Subtype.ext; dsimp; split_ifs <;> simp
+
+@[simp] theorem elderFiberMap_val (m d : ℝ) {s t : ℝ} (hst : s ≤ t)
+ (x : elderFiber k m d s) :
+ (elderFiberMap k m d hst x).val = if t < -d then x.val else 0 := rfl
+
+/-- The actual interval persistence functor; no maps are assumed. -/
+def elderInterval (m d : ℝ) : ℝ ⥤ ModuleCat k where
+ obj t := ModuleCat.of k (elderFiber k m d t)
+ map f := ModuleCat.ofHom (elderFiberMap k m d (leOfHom f))
+ map_id t := by
+ apply ModuleCat.hom_ext
+ apply LinearMap.ext
+ intro x
+ apply Subtype.ext
+ change (if t < -d then x.val else 0) = x.val
+ by_cases ht : t < -d
+ · simp [ht]
+ · have hn : ¬ elderActive m d t := fun h => ht h.2
+ simp [ht, x.property hn]
+ map_comp {r s t} f g := by
+ apply ModuleCat.hom_ext
+ apply LinearMap.ext
+ intro x
+ apply Subtype.ext
+ change (if t < -d then x.val else 0) =
+ if t < -d then (if s < -d then x.val else 0) else 0
+ by_cases ht : t < -d
+ · have hs : s < -d := (leOfHom g).trans_lt ht
+ simp [ht, hs]
+ · simp [ht]
+
+/-- A canonical lift of a coefficient to any active interval fiber. -/
+def elderFiberLift {m d t : ℝ} (ht : elderActive m d t) :
+ k →ₗ[k] elderFiber k m d t where
+ toFun a := ⟨a, fun hn => (hn ht).elim⟩
+ map_add' := by intros; rfl
+ map_smul' := by intros; rfl
+
+@[simp] theorem elderFiberLift_val {m d t : ℝ} (ht : elderActive m d t) (a : k) :
+ (elderFiberLift k ht a).val = a := rfl
+
+/-- Endpoint control: birth is included. -/
+theorem elder_control_birth {m d : ℝ} (hdm : d < m) : elderActive m d (-m) := by
+ constructor <;> linarith
+
+/-- Endpoint control: death is excluded, despite closed superlevels. -/
+theorem elder_control_death (m d : ℝ) : ¬ elderActive m d (-d) := by
+ intro h
+ exact (lt_irrefl _) h.2
+
+variable {X : Type u} [TopologicalSpace X] (g : X → ℝ) (M P : X) (m d : ℝ)
+
+/-- The topological consequences of the asymmetric ridge trap. No H0 maps or
+splitting conclusions occur among the premises. The path at d is actual closed
+superlevel connectivity, while active cuts are clopen. -/
+structure ElderTrap (D : Set X) : Prop where
+ death_lt_birth : d < m
+ maximum_height : g M = m
+ older_height : m < g P
+ maximum_inside : M ∈ D
+ older_outside : P ∉ D
+ height_ceiling : ∀ x ∈ D, g x ≤ m
+ active_clopen : ∀ t, elderActive m d t →
+ IsClopen {x : superlevel_set g t | x.val ∈ D}
+ closed_path : JoinedIn (superlevel_set g (-d)) M P
+
+variable {g M P m d} {D : Set X}
+
+theorem ElderTrap.maximum_mem (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) : M ∈ superlevel_set g t := by
+ change -t ≤ g M
+ erw [T.maximum_height]
+ linarith [ht.1]
+
+theorem ElderTrap.older_mem (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) : P ∈ superlevel_set g t := by
+ change -t ≤ g P
+ linarith [ht.1, T.older_height]
+
+/-- Clopen cuts are constant on actual path components, with no local path
+connectivity assumption on the ambient space. -/
+theorem elder_clopen_path_iff {Y : Type u} [TopologicalSpace Y] {U : Set Y}
+ (hU : IsClopen U) {x y : Y} (p : Path x y) : x ∈ U ↔ y ∈ U := by
+ have hxy : y ∈ connectedComponent x :=
+ pathComponent_subset_component x (show y ∈ pathComponent x from ⟨p⟩)
+ have hyx : x ∈ connectedComponent y :=
+ pathComponent_subset_component y (show x ∈ pathComponent y from ⟨p.symm⟩)
+ exact ⟨fun hx => hU.connectedComponent_subset hx hxy,
+ fun hy => hU.connectedComponent_subset hy hyx⟩
+
+/-- The D indicator is genuinely descended to the path-component quotient. -/
+def ElderTrap.componentInside (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) : ZerothHomotopy (superlevel_set g t) → Prop :=
+ ZerothHomotopy.lift (fun x => x.val ∈ D) (fun _ _ p =>
+ propext (elder_clopen_path_iff (T.active_clopen t ht) p))
+
+@[simp] theorem ElderTrap.componentInside_mk (T : ElderTrap g M P m d D)
+ {t : ℝ} (ht : elderActive m d t) (x : superlevel_set g t) :
+ T.componentInside ht (ZerothHomotopy.mk x) ↔ x.val ∈ D := Iff.rfl
+
+variable {k}
+
+/-- The actual singular-H0 point-class difference on an active level. -/
+def elderDifference (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) :
+ ModuleCat.of k k ⟶ (superlevel_h0Filtration g (ModuleCat.of k k)).obj t :=
+ ordinaryH0_pointClass (TopCat.of (superlevel_set g t)) (ModuleCat.of k k)
+ ⟨M, T.maximum_mem ht⟩ -
+ ordinaryH0_pointClass (TopCat.of (superlevel_set g t)) (ModuleCat.of k k)
+ ⟨P, T.older_mem ht⟩
+
+theorem elderDifference_map (T : ElderTrap g M P m d D) {s t : ℝ}
+ (hs : elderActive m d s) (ht : elderActive m d t) (hst : s ≤ t) :
+ elderDifference (k := k) T hs ≫
+ (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) =
+ elderDifference T ht := by
+ exact ordinaryH0_difference_map (ModuleCat.of k k)
+ (TopCat.ofHom (superlevel_inclusion g hst))
+ ⟨M, T.maximum_mem hs⟩ ⟨P, T.older_mem hs⟩
+
+theorem elderDifference_map_dead (T : ElderTrap g M P m d D) {s t : ℝ}
+ (hs : elderActive m d s) (ht : -d ≤ t) (hst : s ≤ t) :
+ elderDifference (k := k) T hs ≫
+ (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) = 0 := by
+ unfold elderDifference
+ erw [ordinaryH0_difference_map]
+ apply ordinaryH0_sameComponent_difference_zero
+ apply (superlevel_component_eq_iff_joinedIn g t _ _).2
+ exact T.closed_path.mono (superlevel_mono g ht)
+
+/-- The component indicator transported by the existing actual H0 comparison. -/
+def elderProjection (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) :
+ (superlevel_h0Filtration g (ModuleCat.of k k)).obj t ⟶ ModuleCat.of k k := by
+ classical
+ exact (ordinaryH0_filtrationIso g (ModuleCat.of k k)).hom.app t ≫
+ Sigma.desc (fun q => if T.componentInside ht q then 𝟙 _ else 0)
+
+theorem elderProjection_point (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) (x : superlevel_set g t) :
+ ordinaryH0_pointClass (TopCat.of (superlevel_set g t)) (ModuleCat.of k k) x ≫
+ elderProjection (k := k) T ht =
+ if x.val ∈ D then 𝟙 _ else 0 := by
+ classical
+ unfold elderProjection
+ erw [← Category.assoc]
+ erw [ordinaryH0_pointClass_iso]
+ erw [Sigma.ι_comp_desc]
+ rfl
+
+theorem elderDifference_projection (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) :
+ elderDifference (k := k) T ht ≫ elderProjection T ht = 𝟙 _ := by
+ classical
+ unfold elderDifference
+ erw [Preadditive.sub_comp,
+ elderProjection_point, elderProjection_point]
+ simp [T.maximum_inside, T.older_outside]
+
+def elderSectionApp (T : ElderTrap g M P m d D) (t : ℝ) :
+ (elderInterval k m d).obj t ⟶
+ (superlevel_h0Filtration g (ModuleCat.of k k)).obj t := by
+ classical
+ exact if ht : elderActive m d t then
+ ModuleCat.ofHom (elderFiber k m d t).subtype ≫ elderDifference T ht else 0
+
+def elderRetractionApp (T : ElderTrap g M P m d D) (t : ℝ) :
+ (superlevel_h0Filtration g (ModuleCat.of k k)).obj t ⟶
+ (elderInterval k m d).obj t := by
+ classical
+ exact if ht : elderActive m d t then
+ elderProjection T ht ≫ ModuleCat.ofHom (elderFiberLift k ht) else 0
+
+theorem elderSectionApp_naturality (T : ElderTrap g M P m d D) {s t : ℝ}
+ (hst : s ≤ t) :
+ (elderInterval k m d).map (homOfLE hst) ≫ elderSectionApp T t =
+ elderSectionApp T s ≫
+ (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) := by
+ classical
+ by_cases hs : elderActive m d s
+ · by_cases ht : elderActive m d t
+ · simp only [elderSectionApp, dite_eq_left hs, dite_eq_left ht]
+ erw [Category.assoc, elderDifference_map T hs ht hst, ← Category.assoc]
+ congr 1
+ ext x
+ change (if t < -d then x.val else 0) = x.val
+ simp [ht.2]
+ · have htd : -d ≤ t := by
+ by_contra h
+ exact ht ⟨hs.1.trans hst, lt_of_not_ge h⟩
+ simp only [elderSectionApp, dite_eq_left hs, dite_eq_right ht, comp_zero]
+ erw [Category.assoc, elderDifference_map_dead T hs htd hst, comp_zero]
+ · apply ModuleCat.hom_ext
+ apply LinearMap.ext
+ intro x
+ have hx : x = 0 := elderFiber_eq_zero k hs x
+ simp [hx]
+
+/-- Section from the interval to actual singular H0. -/
+def elderSection (T : ElderTrap g M P m d D) :
+ elderInterval k m d ⟶ superlevel_h0Filtration g (ModuleCat.of k k) where
+ app := elderSectionApp T
+ naturality := by
+ intro s t f
+ exact elderSectionApp_naturality T (leOfHom f)
+
+theorem elderProjection_naturality_active (T : ElderTrap g M P m d D) {s t : ℝ}
+ (hs : elderActive m d s) (ht : elderActive m d t) (hst : s ≤ t) :
+ (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫
+ elderProjection (k := k) T ht = elderProjection T hs := by
+ classical
+ apply ordinaryH0_hom_ext (TopCat.of (superlevel_set g s)) (ModuleCat.of k k)
+ intro x
+ erw [← Category.assoc]
+ erw [ordinaryH0_pointClass_map]
+ erw [elderProjection_point, elderProjection_point]
+ rfl
+
+/-- The birth-crossing square follows from the geometric height ceiling:
+there is no source point in D above m. It is not an assumed naturality field. -/
+theorem elderProjection_prebirth (T : ElderTrap g M P m d D) {s t : ℝ}
+ (hs : s < -m) (ht : elderActive m d t) (hst : s ≤ t) :
+ (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫
+ elderProjection (k := k) T ht = 0 := by
+ classical
+ apply ordinaryH0_hom_ext (TopCat.of (superlevel_set g s)) (ModuleCat.of k k)
+ intro x
+ erw [← Category.assoc]
+ erw [ordinaryH0_pointClass_map]
+ erw [elderProjection_point]
+ change (if x.val ∈ D then 𝟙 _ else 0) = _
+ have hx : x.val ∉ D := by
+ intro hx
+ have hceil := T.height_ceiling x.val hx
+ have hlevel : -s ≤ g x.val := x.property
+ linarith
+ simp only [ite_eq_right hx]
+ erw [comp_zero]
+
+theorem elderRetractionApp_naturality (T : ElderTrap g M P m d D) {s t : ℝ}
+ (hst : s ≤ t) :
+ (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫
+ elderRetractionApp T t =
+ elderRetractionApp T s ≫ (elderInterval k m d).map (homOfLE hst) := by
+ classical
+ by_cases ht : elderActive m d t
+ · by_cases hs : elderActive m d s
+ · simp only [elderRetractionApp, dite_eq_left hs, dite_eq_left ht]
+ apply ModuleCat.hom_ext
+ apply LinearMap.ext
+ intro x
+ apply Subtype.ext
+ change elderProjection T ht
+ ((superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) x) =
+ if t < -d then elderProjection T hs x else 0
+ rw [ite_eq_left ht.2]
+ have he := congrArg
+ (fun f : (superlevel_h0Filtration g (ModuleCat.of k k)).obj s ⟶
+ ModuleCat.of k k => f x)
+ (elderProjection_naturality_active (k := k) T hs ht hst)
+ exact he
+ · have hsm : s < -m := by
+ by_contra h
+ exact hs ⟨le_of_not_gt h, hst.trans_lt ht.2⟩
+ simp only [elderRetractionApp, dite_eq_right hs, dite_eq_left ht, zero_comp]
+ erw [← Category.assoc, elderProjection_prebirth T hsm ht hst, zero_comp]
+ · simp only [elderRetractionApp, dite_eq_right ht, comp_zero]
+ by_cases hs : elderActive m d s
+ · simp only [dite_eq_left hs]
+ have htd : ¬ t < -d := by
+ intro h
+ exact ht ⟨hs.1.trans hst, h⟩
+ apply ModuleCat.hom_ext
+ apply LinearMap.ext
+ intro x
+ apply Subtype.ext
+ change 0 = if t < -d then _ else 0
+ simp [htd]
+ · simp [hs]
+
+/-- Retraction from actual singular H0 to the interval, using component descent. -/
+def elderRetraction (T : ElderTrap g M P m d D) :
+ superlevel_h0Filtration g (ModuleCat.of k k) ⟶ elderInterval k m d where
+ app := elderRetractionApp T
+ naturality := by
+ intro s t f
+ exact elderRetractionApp_naturality T (leOfHom f)
+
+/-- The constructed section and retraction split the actual interval functor. -/
+@[reassoc (attr := simp)]
+theorem elderSection_retraction (T : ElderTrap g M P m d D) :
+ elderSection (k := k) T ≫ elderRetraction T = 𝟙 (elderInterval k m d) := by
+ classical
+ apply NatTrans.ext
+ funext t
+ change elderSectionApp (k := k) T t ≫ elderRetractionApp (k := k) T t = 𝟙 _
+ by_cases ht : elderActive m d t
+ · simp only [elderSectionApp, elderRetractionApp, dite_eq_left ht]
+ erw [Category.assoc, ← Category.assoc (elderDifference T ht),
+ elderDifference_projection, Category.id_comp]
+ ext x
+ rfl
+ · ext x
+ have hx : x = 0 := elderFiber_eq_zero k ht x
+ simp [hx]
+
+def elderKernelProjection (T : ElderTrap g M P m d D) :
+ superlevel_h0Filtration g (ModuleCat.of k k) ⟶ kernel (elderRetraction (k := k) T) :=
+ kernel.lift (elderRetraction T)
+ (𝟙 _ - elderRetraction T ≫ elderSection T) (by
+ erw [Preadditive.sub_comp, Category.id_comp, Category.assoc,
+ elderSection_retraction, Category.comp_id, sub_self])
+
+/-- An actual natural direct-sum isomorphism, not a postulated decomposition.
+Its maps are v ↦ (qv,v-jqv) and (c,w) ↦ jc+w. -/
+def elderDirectSummand (T : ElderTrap g M P m d D) :
+ superlevel_h0Filtration g (ModuleCat.of k k) ≅
+ elderInterval k m d ⊞ kernel (elderRetraction (k := k) T) where
+ hom := biprod.lift (elderRetraction T) (elderKernelProjection T)
+ inv := biprod.desc (elderSection T) (kernel.ι (elderRetraction T))
+ hom_inv_id := by
+ erw [biprod.lift_desc]
+ simp only [elderKernelProjection, kernel.lift_ι]
+ abel
+ inv_hom_id := by
+ apply biprod.hom_ext' <;> apply biprod.hom_ext
+ · simp [Category.assoc, elderSection_retraction]
+ · apply (cancel_mono (kernel.ι (elderRetraction T))).1
+ simp [Category.assoc, elderKernelProjection, Preadditive.comp_sub]
+ · simp
+ · apply (cancel_mono (kernel.ι (elderRetraction T))).1
+ simp [elderKernelProjection, Category.assoc, Preadditive.comp_sub]
+
+/-- Ordinary individual point classes remain nonzero; the dying section uses
+their difference. This is valid independently of characteristic. -/
+theorem elder_control_ordinary_point_survives (t : ℝ) (x : superlevel_set g t) :
+ ordinaryH0_pointClass (TopCat.of (superlevel_set g t)) (ModuleCat.of k k) x ≠ 0 := by
+ apply ordinaryH0_pointClass_ne_zero
+ intro h
+ have hl := congrArg ModuleCat.Hom.hom h
+ change (LinearMap.id : k →ₗ[k] k) = 0 at hl
+ exact one_ne_zero (LinearMap.congr_fun hl 1)
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderIntervalAxiomAudit.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderIntervalAxiomAudit.lean
new file mode 100644
index 000000000..d86702a95
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderIntervalAxiomAudit.lean
@@ -0,0 +1,37 @@
+import ElderInterval
+
+#print axioms TorusFiltration.elderActive
+#print axioms TorusFiltration.elderFiber
+#print axioms TorusFiltration.elderFiber_eq_zero
+#print axioms TorusFiltration.elderFiberMap
+#print axioms TorusFiltration.elderFiberMap_val
+#print axioms TorusFiltration.elderInterval
+#print axioms TorusFiltration.elderFiberLift
+#print axioms TorusFiltration.elderFiberLift_val
+#print axioms TorusFiltration.elder_control_birth
+#print axioms TorusFiltration.elder_control_death
+#print axioms TorusFiltration.ElderTrap
+#print axioms TorusFiltration.ElderTrap.maximum_mem
+#print axioms TorusFiltration.ElderTrap.older_mem
+#print axioms TorusFiltration.elder_clopen_path_iff
+#print axioms TorusFiltration.ElderTrap.componentInside
+#print axioms TorusFiltration.ElderTrap.componentInside_mk
+#print axioms TorusFiltration.elderDifference
+#print axioms TorusFiltration.elderDifference_map
+#print axioms TorusFiltration.elderDifference_map_dead
+#print axioms TorusFiltration.elderProjection
+#print axioms TorusFiltration.elderProjection_point
+#print axioms TorusFiltration.elderDifference_projection
+#print axioms TorusFiltration.elderSectionApp
+#print axioms TorusFiltration.elderRetractionApp
+#print axioms TorusFiltration.elderSectionApp_naturality
+#print axioms TorusFiltration.elderSection
+#print axioms TorusFiltration.elderProjection_naturality_active
+#print axioms TorusFiltration.elderProjection_prebirth
+#print axioms TorusFiltration.elderRetractionApp_naturality
+#print axioms TorusFiltration.elderRetraction
+#print axioms TorusFiltration.elderSection_retraction
+#print axioms TorusFiltration.elderKernelProjection
+#print axioms TorusFiltration.elderDirectSummand
+#print axioms TorusFiltration.elder_control_ordinary_point_survives
+#print axioms TorusFiltration.elderSection_retraction_assoc
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderIntervalControls.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderIntervalControls.lean
new file mode 100644
index 000000000..01cf6084f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderIntervalControls.lean
@@ -0,0 +1,79 @@
+import ElderInterval
+open CategoryTheory TorusFiltration
+#check elderInterval
+#check elderSection
+#check elderRetraction
+#check elderSection_retraction
+#check elderDirectSummand
+#check elder_control_birth
+#check elder_control_death
+#check elder_control_ordinary_point_survives
+
+/- These pin actual interval endpoints and map direction, not source spelling. -/
+example : elderActive 1 0 (-1) := elder_control_birth (by norm_num)
+example : ¬ elderActive 1 0 0 := by
+ simpa only [neg_zero] using elder_control_death 1 0
+example : ¬ elderActive 1 0 (-2) := by norm_num [elderActive]
+example : elderActive 1 0 (-(1 / 2)) := by norm_num [elderActive]
+
+example (x : elderFiber ℚ 1 0 (-2)) : x = 0 :=
+ elderFiber_eq_zero ℚ (by norm_num [elderActive]) x
+
+example (x : elderFiber ℚ 1 0 (-1)) :
+ (elderFiberMap ℚ 1 0 (show (-1 : ℝ) ≤ -(1 / 2) by norm_num) x).val = x.val := by
+ simp [elderFiberMap]
+
+example (x : elderFiber ℚ 1 0 (-(1 / 2))) :
+ elderFiberMap ℚ 1 0 (show (-(1 / 2) : ℝ) ≤ 0 by norm_num) x = 0 := by
+ apply Subtype.ext
+ simp [elderFiberMap]
+
+/- The actual singular-H0 split also elaborates in characteristic two. -/
+example {X : Type} [TopologicalSpace X] {g : X → ℝ} {M P : X}
+ {m d : ℝ} {D : Set X} (T : ElderTrap g M P m d D) :
+ elderSection (k := ZMod 2) T ≫ elderRetraction T =
+ 𝟙 (elderInterval (ZMod 2) m d) := elderSection_retraction T
+
+example {X : Type} [TopologicalSpace X] {g : X → ℝ} {M P : X}
+ {m d : ℝ} {D : Set X} (T : ElderTrap g M P m d D) :
+ Nonempty ((superlevel_h0Filtration g (ModuleCat.of ℚ ℚ)) ≅
+ elderInterval ℚ m d ⊞ Limits.kernel (elderRetraction (k := ℚ) T)) :=
+ ⟨elderDirectSummand T⟩
+
+/- Complete explicit declaration audit plus generated reassociation. -/
+
+#print axioms TorusFiltration.elderActive
+#print axioms TorusFiltration.elderFiber
+#print axioms TorusFiltration.elderFiber_eq_zero
+#print axioms TorusFiltration.elderFiberMap
+#print axioms TorusFiltration.elderFiberMap_val
+#print axioms TorusFiltration.elderInterval
+#print axioms TorusFiltration.elderFiberLift
+#print axioms TorusFiltration.elderFiberLift_val
+#print axioms TorusFiltration.elder_control_birth
+#print axioms TorusFiltration.elder_control_death
+#print axioms TorusFiltration.ElderTrap
+#print axioms TorusFiltration.ElderTrap.maximum_mem
+#print axioms TorusFiltration.ElderTrap.older_mem
+#print axioms TorusFiltration.elder_clopen_path_iff
+#print axioms TorusFiltration.ElderTrap.componentInside
+#print axioms TorusFiltration.ElderTrap.componentInside_mk
+#print axioms TorusFiltration.elderDifference
+#print axioms TorusFiltration.elderDifference_map
+#print axioms TorusFiltration.elderDifference_map_dead
+#print axioms TorusFiltration.elderProjection
+#print axioms TorusFiltration.elderProjection_point
+#print axioms TorusFiltration.elderDifference_projection
+#print axioms TorusFiltration.elderSectionApp
+#print axioms TorusFiltration.elderRetractionApp
+#print axioms TorusFiltration.elderSectionApp_naturality
+#print axioms TorusFiltration.elderSection
+#print axioms TorusFiltration.elderProjection_naturality_active
+#print axioms TorusFiltration.elderProjection_prebirth
+#print axioms TorusFiltration.elderRetractionApp_naturality
+#print axioms TorusFiltration.elderRetraction
+#print axioms TorusFiltration.elderSection_retraction
+#print axioms TorusFiltration.elderKernelProjection
+#print axioms TorusFiltration.elderDirectSummand
+#print axioms TorusFiltration.elder_control_ordinary_point_survives
+#print axioms TorusFiltration.elderSection_retraction_assoc
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/cap_first_exit_lean_20261002/CapFirstExit.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/cap_first_exit_lean_20261002/CapFirstExit.lean
new file mode 100644
index 000000000..01744e2cf
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/cap_first_exit_lean_20261002/CapFirstExit.lean
@@ -0,0 +1,5473 @@
+/-
+ CapFirstExit: the topological step from a separating cap to the global elder level.
+
+ `CapHyp f C M z b s` bundles the conclusions that CAP §§2–5 derive from the local good event
+ `G_r` (reviews/d1_cap_elder_partner_second_pass_claude_20260930/REVIEW.md, L16–L20):
+
+ (C1) `M ∈ C` and `f ≤ b` on the cap `C` (L16);
+ (C2) `f ≤ s` on the whole frontier of `C` (L17–L19);
+ (C3) `b < f z`, and a path from `M` to `z` along which `f ≥ s` (L17, L20).
+
+ The saddle form adds (C2⁺): every frontier point other than `S` has `f < s` (L19).
+
+ Nothing is assumed about `f` outside `C` beyond the witness path in (C3). The core theorems use
+ no metric, smoothness, Morse, compactness or probabilistic hypothesis, and their separation
+ statements do not even use continuity of `f`. `X` is an arbitrary topological space; the torus
+ is one instance. Only the older-peak theorems add compactness, local connectedness and
+ continuity of `f`, all of which hold on the torus.
+
+ Up to v1.8 the analytic steps L6 and L9–L12 (the `w'` bound and the quantitative `‖h'‖` and `F''`
+ bounds) entered `ridge_capHyp_H1` as `hconv`. L1–L5, L7 (existence,
+ uniqueness and implicit-function regularity of the ridge `h`: `ridge_exists`,
+ `ridge_differentiable`), L8, L11's chain rule, L13 and L16–L20 are proved, and since v1.8
+ `ridge_capHyp_source` composes them from source data on a collar `[-2r - ε, 2r + ε]` of `D`
+ (the source data themselves are hypotheses). Since v1.9, L6 and L9–L12 are proved too, and
+ `ridge_capHyp_C3` derives `hconv`; since v2.0 `ridge_capHyp_C4` also derives SP's
+ `f_xxx ≥ 7/4` (L4, from L2's second statement and (H2)). Since v2.1 `ridge_capHyp_C5` derives
+ the six derivative bounds from the block bound and `|f_xxx| ≤ m` on the pin segment, and
+ `ridge_capHyp_D` assumes SP's quantitative bounds on `D` only (the continuity step to the collar
+ is proved). Since v2.2 `ridge_capHyp_E` assumes only `f ∈ C⁴` on an open neighbourhood of `D`
+ and SP's quantitative bounds on `D`: it builds every derivative datum from `f`, and the collar
+ and its bound `K` come from compactness.
+ `quarticToy_E` (v2.3) exercises it away from the degenerate face, with `D⁴f ≠ 0` and (H2) sharp.
+ Since v2.4 `ridge_capHyp_K` states the cap on P §7's event `G_r` for every pin gap
+ `f(M) − f(S) = k r³` with `k > 0`, namely `(4/(3k)) r m² < λ` and `r n ≤ 3k/10`, by rescaling
+ `f ↦ f/(6k)` (`ridge_capHyp_E` is the case `k = 1/6`). `ridge_capHyp_norm_K` takes the bounds as
+ operator norms `‖D³f‖ ≤ M3`, `‖D⁴f‖ ≤ M4` on `D`.
+ Since v2.5 `ridge_capHyp_blocks` takes CAP (1) as written, with CAP's partial-block norms: the
+ block inequality for `D³f` is derived from the partial blocks (`block_of_partial`), using the
+ symmetry of `D³f` for `f ∈ C³` (`iteratedFDeriv_three_swap₁₂`, `iteratedFDeriv_three_swap₂₃`).
+ `mixedToy_blocks` exercises it with a nonzero mixed block `∂_x D_y² f = 2`.
+ Since v2.6 `torus_capHyp_blocks` and `torus_elder_death_level_blocks` state the cap and the elder
+ death level on the torus `(ℝ/Lℤ)^d` for a field whose periodic lift meets CAP (1) in any frame;
+ `torusToy_elder` is a concrete instance on `(ℝ/16ℤ)²`.
+ Also not formalized: the
+ identification of the H0 persistence pairing with the elder rule (L22, P §8); the
+ unstable-branch analysis (L23); and every probabilistic statement.
+-/
+import Mathlib
+
+open Set unitInterval
+
+namespace CapFirstExit
+
+variable {X : Type*} [TopologicalSpace X]
+
+/-! ### First exit -/
+
+/-- First exit along a path. A path from a point of `C` to a point outside `C` meets the frontier
+of `C`. -/
+theorem path_meets_frontier {C : Set X} {x y : X} (γ : Path x y) (hx : x ∈ C) (hy : y ∉ C) :
+ ∃ t : I, γ t ∈ frontier C := by
+ have hS : (γ ⁻¹' C).Nonempty := ⟨0, by simpa using hx⟩
+ have hS' : γ ⁻¹' C ≠ univ := by
+ intro h
+ have h1 : (1 : I) ∈ γ ⁻¹' C := h ▸ mem_univ _
+ exact hy (by simpa using h1)
+ obtain ⟨t, ht⟩ := nonempty_frontier_iff.mpr ⟨hS, hS'⟩
+ exact ⟨t, γ.continuous.frontier_preimage_subset C ht⟩
+
+/-- First exit for connected sets. A preconnected set that contains a point of `C` and does not
+meet the frontier of `C` lies inside `C`. No path-connectedness is needed. -/
+theorem preconnected_subset_of_frontier_disjoint {C K : Set X} (hK : IsPreconnected K) {M : X}
+ (hMK : M ∈ K) (hMC : M ∈ C) (hfr : ∀ x ∈ K, x ∉ frontier C) : K ⊆ C := by
+ intro w hwK
+ by_contra hwC
+ have : PreconnectedSpace K := isPreconnected_iff_preconnectedSpace.mp hK
+ have hS : (((↑) : K → X) ⁻¹' C).Nonempty := ⟨⟨M, hMK⟩, hMC⟩
+ have hS' : (((↑) : K → X) ⁻¹' C) ≠ univ := by
+ intro h
+ have h1 : (⟨w, hwK⟩ : K) ∈ (((↑) : K → X) ⁻¹' C) := h ▸ mem_univ _
+ exact hwC h1
+ obtain ⟨⟨x, hxK⟩, hx⟩ := nonempty_frontier_iff.mpr ⟨hS, hS'⟩
+ exact hfr x hxK (continuous_subtype_val.frontier_preimage_subset C hx)
+
+/-! ### The cap hypotheses -/
+
+/-- The cap hypotheses (C1)–(C3) for a local maximum `M` of height `b`, a separating level `s`,
+and an older point `z`. -/
+structure CapHyp (f : X → ℝ) (C : Set X) (M z : X) (b s : ℝ) : Prop where
+ /-- (C1) `M` lies in the cap. -/
+ mem : M ∈ C
+ /-- (C1) The ceiling: `f ≤ b` on the cap (L16). -/
+ ceiling : ∀ x ∈ C, f x ≤ b
+ /-- (C2) The frontier bound: `f ≤ s` on the frontier of the cap (L17–L19). -/
+ frontier_le : ∀ x ∈ frontier C, f x ≤ s
+ /-- (C3) The older endpoint: `f z > b` (L17). -/
+ older : b < f z
+ /-- (C3) The ridge: a path from `M` to `z` along which `f ≥ s` (L20). -/
+ ridge : ∃ γ : Path M z, ∀ t, s ≤ f (γ t)
+
+namespace CapHyp
+
+variable {f : X → ℝ} {C : Set X} {M z : X} {b s : ℝ}
+
+/-- `M` itself is at height at least `s` (the ridge starts at `M`). -/
+theorem s_le_f_M (H : CapHyp f C M z b s) : s ≤ f M := by
+ obtain ⟨γ, hγ⟩ := H.ridge
+ simpa using hγ 0
+
+/-! ### The maximin level `d_f(M)` (L21) -/
+
+/-- The upper barrier. Every path from `M` to a point strictly above `b` passes through a point
+of height at most `s`, whatever the path does outside `C`. -/
+theorem barrier (H : CapHyp f C M z b s) {w : X} (hw : b < f w) (γ : Path M w) :
+ ∃ t : I, f (γ t) ≤ s := by
+ have hwC : w ∉ C := fun h => (not_le.mpr hw) (H.ceiling w h)
+ obtain ⟨t, ht⟩ := path_meets_frontier γ H.mem hwC
+ exact ⟨t, H.frontier_le _ ht⟩
+
+end CapHyp
+
+/-- The connection levels of `M`: heights `m` such that some path from `M` to a point strictly
+above `b` stays at height at least `m`. Its supremum is the maximin level `d_f(M)` of L21. -/
+def connectionLevels (f : X → ℝ) (M : X) (b : ℝ) : Set ℝ :=
+ {m | ∃ (w : X) (γ : Path M w), b < f w ∧ ∀ t, m ≤ f (γ t)}
+
+namespace CapHyp
+
+variable {f : X → ℝ} {C : Set X} {M z : X} {b s : ℝ}
+
+/-- The maximin level is attained and equals `s` (L21). -/
+theorem maximin_isGreatest (H : CapHyp f C M z b s) :
+ IsGreatest (connectionLevels f M b) s := by
+ obtain ⟨γ₀, hγ₀⟩ := H.ridge
+ refine ⟨⟨z, γ₀, H.older, hγ₀⟩, ?_⟩
+ rintro m ⟨w, γ, hw, hγ⟩
+ obtain ⟨t, ht⟩ := H.barrier hw γ
+ exact (hγ t).trans ht
+
+/-- `d_f(M) = s`, as a supremum (L21). -/
+theorem maximin_eq (H : CapHyp f C M z b s) : sSup (connectionLevels f M b) = s :=
+ H.maximin_isGreatest.csSup_eq
+
+/-! ### Superlevel components: the persistence filtration (L22) -/
+
+/-- Component separation. If `U` avoids the frontier of `C`, the connected component of `M` in
+`U` lies in `C`, so it contains no point strictly above `b`. -/
+theorem component_separated (H : CapHyp f C M z b s) {U : Set X}
+ (hU : ∀ x ∈ frontier C, x ∉ U) {w : X} (hw : w ∈ connectedComponentIn U M) : f w ≤ b := by
+ have hMU : M ∈ U := by
+ by_contra hMU
+ rw [connectedComponentIn_eq_empty hMU] at hw
+ exact notMem_empty w hw
+ exact H.ceiling w (preconnected_subset_of_frontier_disjoint isPreconnected_connectedComponentIn
+ (mem_connectedComponentIn hMU) H.mem
+ (fun x hx hxf => hU x hxf (connectedComponentIn_subset U M hx)) hw)
+
+end CapHyp
+
+/-- Component joining. If a path from `M` to `z` stays in `U`, then `z` lies in the connected
+component of `M` in `U`. -/
+theorem component_joined {U : Set X} {M z : X} (γ : Path M z) (hγ : ∀ t, γ t ∈ U) :
+ z ∈ connectedComponentIn U M := by
+ have hsub : range γ ⊆ U := by
+ rintro _ ⟨t, rfl⟩
+ exact hγ t
+ exact (isConnected_range γ.continuous).isPreconnected.subset_connectedComponentIn
+ ⟨0, γ.source⟩ hsub ⟨1, γ.target⟩
+
+namespace CapHyp
+
+variable {f : X → ℝ} {C : Set X} {M z : X} {b s : ℝ}
+
+/-- **Elder merge, closed superlevel filtration `{f ≥ h}`** (the filtration of L22). The connected
+component of `M` in `{f ≥ h}` contains a point strictly above `b` if and only if `h ≤ s`. -/
+theorem elder_merge_iff_closed (H : CapHyp f C M z b s) (h : ℝ) :
+ (∃ w ∈ connectedComponentIn {x | h ≤ f x} M, b < f w) ↔ h ≤ s := by
+ constructor
+ · rintro ⟨w, hw, hbw⟩
+ by_contra hhs
+ rw [not_le] at hhs
+ have hU : ∀ x ∈ frontier C, x ∉ {x | h ≤ f x} := by
+ intro x hx hxU
+ have h1 : h ≤ f x := hxU
+ have h2 := H.frontier_le x hx
+ linarith
+ exact absurd (H.component_separated hU hw) (not_le.mpr hbw)
+ · intro hhs
+ obtain ⟨γ₀, hγ₀⟩ := H.ridge
+ exact ⟨z, component_joined γ₀ (fun t => le_trans hhs (hγ₀ t)), H.older⟩
+
+/-- **Elder merge, open superlevel filtration `{f > h}`.** The connected component of `M` in
+`{f > h}` contains a point strictly above `b` if and only if `h < s`. -/
+theorem elder_merge_iff_open (H : CapHyp f C M z b s) (h : ℝ) :
+ (∃ w ∈ connectedComponentIn {x | h < f x} M, b < f w) ↔ h < s := by
+ constructor
+ · rintro ⟨w, hw, hbw⟩
+ by_contra hhs
+ rw [not_lt] at hhs
+ have hU : ∀ x ∈ frontier C, x ∉ {x | h < f x} := by
+ intro x hx hxU
+ have h1 : h < f x := hxU
+ have h2 := H.frontier_le x hx
+ linarith
+ exact absurd (H.component_separated hU hw) (not_le.mpr hbw)
+ · intro hhs
+ obtain ⟨γ₀, hγ₀⟩ := H.ridge
+ exact ⟨z, component_joined γ₀ (fun t => lt_of_lt_of_le hhs (hγ₀ t)), H.older⟩
+
+/-- The set of levels at which the class born at `M` is joined to an older point. -/
+def joinedLevels (f : X → ℝ) (M : X) (b : ℝ) : Set ℝ :=
+ {h | ∃ w ∈ connectedComponentIn {x | h ≤ f x} M, b < f w}
+
+/-- **Elder death level.** In the closed superlevel filtration, the largest level at which the
+component of `M` contains an older point exists and equals `s`, whatever `f` does outside the cap.
+This is the death level of the class born at `M` in L22. -/
+theorem elder_death_level (H : CapHyp f C M z b s) : IsGreatest (joinedLevels f M b) s :=
+ ⟨(H.elder_merge_iff_closed s).mpr le_rfl, fun _ hh => (H.elder_merge_iff_closed _).mp hh⟩
+
+/-! ### The merging saddle -/
+
+/-- Every path from `M` to a point strictly above `b` that stays in `{f ≥ s}` passes through `S`,
+when `S` is the only frontier point at height `s` (C2⁺, L19). The statement says something only when
+`M ≠ S`, as in the source, where the pins are distinct. -/
+theorem path_through_saddle (H : CapHyp f C M z b s) {S : X}
+ (hS : ∀ x ∈ frontier C, x ≠ S → f x < s) {w : X} (hw : b < f w) (γ : Path M w)
+ (hγ : ∀ t, s ≤ f (γ t)) : ∃ t, γ t = S := by
+ have hwC : w ∉ C := fun h => (not_le.mpr hw) (H.ceiling w h)
+ obtain ⟨t, ht⟩ := path_meets_frontier γ H.mem hwC
+ refine ⟨t, ?_⟩
+ by_contra hne
+ have h1 := hS _ ht hne
+ have h2 := hγ t
+ linarith
+
+/-- **`S` is a cut point at the death level.** Assume (C2⁺) and `M ≠ S`. Then `M` lies in its own
+component of `{f ≥ s} \ {S}`, so the statement is not vacuous, and that component contains no
+point strictly above `b`. By contrast, `{f ≥ s}` itself joins `M` to an older point
+(`elder_merge_iff_closed` at `h = s`). Removing `S` therefore disconnects `M` from every older
+point at the death level. -/
+theorem saddle_cut (H : CapHyp f C M z b s) {S : X}
+ (hS : ∀ x ∈ frontier C, x ≠ S → f x < s) (hMS : M ≠ S) :
+ M ∈ connectedComponentIn ({x | s ≤ f x} \ {S}) M ∧
+ ∀ w ∈ connectedComponentIn ({x | s ≤ f x} \ {S}) M, f w ≤ b := by
+ refine ⟨mem_connectedComponentIn ⟨H.s_le_f_M, hMS⟩, fun w hw => ?_⟩
+ refine H.component_separated (fun x hx hxU => ?_) hw
+ obtain ⟨h1, h2⟩ := hxU
+ have h3 := hS x hx h2
+ have h4 : s ≤ f x := h1
+ linarith
+
+/-! ### Exterior invariance -/
+
+/-- **Exterior invariance.** Any `g` that agrees with `f` on the closure of the cap and along one
+ridge path satisfies the same cap hypotheses. Every conclusion above (maximin level, elder merge
+levels, death level, saddle cut) therefore holds for `g` with the same `s`, however `g` behaves
+elsewhere: remote saddles, high corridors and re-entries change nothing. -/
+theorem congr {g : X → ℝ} (H : CapHyp f C M z b s) (γ₀ : Path M z) (hγ₀ : ∀ t, s ≤ f (γ₀ t))
+ (hgC : ∀ x ∈ closure C, g x = f x) (hgγ : ∀ t, g (γ₀ t) = f (γ₀ t)) :
+ CapHyp g C M z b s where
+ mem := H.mem
+ ceiling x hx := (hgC x (subset_closure hx)).symm ▸ H.ceiling x hx
+ frontier_le x hx := (hgC x (frontier_subset_closure hx)).symm ▸ H.frontier_le x hx
+ older := by
+ have h1 := hgγ 1
+ rw [γ₀.target] at h1
+ rw [h1]
+ exact H.older
+ ridge := ⟨γ₀, fun t => (hgγ t).symm ▸ hγ₀ t⟩
+
+end CapHyp
+
+/-! ### The elder-rule interface on a compact, locally connected space
+
+The elder rule pairs the class born at `M` with the level at which its superlevel component first
+contains a strictly higher local maximum (an older class). On a compact, locally connected space
+with continuous `f` (a closed manifold, in particular the torus), the following theorems identify
+that level as `s`. -/
+
+/-- A connected component of a closed set is closed. -/
+theorem isClosed_connectedComponentIn {F : Set X} (hF : IsClosed F) (x : X) :
+ IsClosed (connectedComponentIn F x) := by
+ by_cases hx : x ∈ F
+ · refine isClosed_of_closure_subset ?_
+ exact isPreconnected_connectedComponentIn.closure.subset_connectedComponentIn
+ (subset_closure (mem_connectedComponentIn hx))
+ (closure_minimal (connectedComponentIn_subset F x) hF)
+ · rw [connectedComponentIn_eq_empty hx]
+ exact isClosed_empty
+
+namespace CapHyp
+
+variable {f : X → ℝ} {C : Set X} {M z : X} {b s : ℝ}
+
+/-- **An older peak below the death level.** For every level `h ≤ s`, the component of `M` in
+`{f ≥ h}` contains a point `p` with `f p > b` that maximizes `f` over the component and is a local
+maximum of `f` on `X`: the older class that absorbs the class born at `M`. -/
+theorem older_peak [CompactSpace X] [LocallyConnectedSpace X] (H : CapHyp f C M z b s)
+ (hf : Continuous f) {h : ℝ} (hh : h ≤ s) :
+ ∃ p ∈ connectedComponentIn {x | h ≤ f x} M, b < f p ∧ IsLocalMax f p ∧
+ ∀ w ∈ connectedComponentIn {x | h ≤ f x} M, f w ≤ f p := by
+ have hF : IsClosed {x | h ≤ f x} := isClosed_le continuous_const hf
+ obtain ⟨w, hwK, hbw⟩ := (H.elder_merge_iff_closed h).mpr hh
+ obtain ⟨p, hpK, hpmax⟩ := (isClosed_connectedComponentIn hF M).isCompact.exists_isMaxOn
+ ⟨w, hwK⟩ hf.continuousOn
+ have hmax : ∀ x ∈ connectedComponentIn {x | h ≤ f x} M, f x ≤ f p := isMaxOn_iff.mp hpmax
+ have hbp : b < f p := lt_of_lt_of_le hbw (hmax w hwK)
+ have hsb : s ≤ b := le_trans H.s_le_f_M (H.ceiling M H.mem)
+ have hpU : p ∈ {x | h < f x} := by
+ show h < f p
+ linarith
+ have hU : IsOpen {x | h < f x} := isOpen_lt continuous_const hf
+ have hVK : connectedComponentIn {x | h < f x} p ⊆ connectedComponentIn {x | h ≤ f x} M := by
+ rw [connectedComponentIn_eq hpK]
+ exact connectedComponentIn_mono p (fun x (hx : h < f x) => (le_of_lt hx : h ≤ f x))
+ refine ⟨p, hpK, hbp, ?_, hmax⟩
+ exact Filter.eventually_of_mem (hU.connectedComponentIn.mem_nhds (mem_connectedComponentIn hpU))
+ (fun x hx => hmax x (hVK hx))
+
+/-- **No older point above the death level.** For every level `h > s`, `M` is a highest point of
+its component in `{f ≥ h}`, when `b = f M`: the class born at `M` is the elder of its component. -/
+theorem elder_alive (H : CapHyp f C M z b s) (hMb : f M = b) {h : ℝ} (hh : s < h) :
+ ∀ w ∈ connectedComponentIn {x | h ≤ f x} M, f w ≤ f M := by
+ intro w hw
+ rw [hMb]
+ by_contra hlt
+ rw [not_le] at hlt
+ exact absurd ((H.elder_merge_iff_closed h).mp ⟨w, hw, hlt⟩) (not_le.mpr hh)
+
+/-- The levels at which the component of `M` in `{f ≥ h}` contains a strictly higher local
+maximum of `f`. -/
+def olderPeakLevels (f : X → ℝ) (M : X) : Set ℝ :=
+ {h | ∃ p ∈ connectedComponentIn {x | h ≤ f x} M, f M < f p ∧ IsLocalMax f p}
+
+/-- **Elder death level, peak form.** On a compact, locally connected space with continuous `f`
+and `b = f M`, the largest level at which the component of `M` contains a strictly higher local
+maximum exists and equals `s`. This is the death level of the elder rule. -/
+theorem elder_death_level_peak [CompactSpace X] [LocallyConnectedSpace X]
+ (H : CapHyp f C M z b s) (hf : Continuous f) (hMb : f M = b) :
+ IsGreatest (olderPeakLevels f M) s := by
+ refine ⟨?_, fun h hh => ?_⟩
+ · obtain ⟨p, hpK, hbp, hloc, -⟩ := H.older_peak hf le_rfl
+ exact ⟨p, hpK, hMb ▸ hbp, hloc⟩
+ · obtain ⟨p, hpK, hMp, -⟩ := hh
+ exact (H.elder_merge_iff_closed h).mp ⟨p, hpK, hMb ▸ hMp⟩
+
+end CapHyp
+
+/-! ### Charts: the cap on the torus and its faces
+
+The analysis of CAP §§2–5 runs in Euclidean coordinates on the periodic lift `f ∘ e` of a field
+`f` on the torus, where `e : ℝ^d → T^d` is the covering map. The two lemmas below transport the cap
+hypotheses to the torus and list the faces of the cylinder cap. The transport needs only that `e`
+is continuous and open, that the target is Hausdorff and that the cap is compact; injectivity is
+not used. -/
+
+/-- Frontier of a compact image. If `e` is continuous and open, `X` is Hausdorff and `C` is
+compact, every frontier point of `e '' C` is the image of a frontier point of `C`. -/
+theorem frontier_image_subset {Y : Type*} [TopologicalSpace Y] [T2Space X] {e : Y → X}
+ (hec : Continuous e) (heo : IsOpenMap e) {C : Set Y} (hC : IsCompact C) :
+ frontier (e '' C) ⊆ e '' frontier C := by
+ intro x hx
+ have hcl : IsClosed (e '' C) := (hC.image hec).isClosed
+ have hx1 : x ∈ e '' C := by
+ have h := hx.1
+ rwa [hcl.closure_eq] at h
+ obtain ⟨y, hyC, rfl⟩ := hx1
+ refine ⟨y, ⟨subset_closure hyC, fun hyi => hx.2 ?_⟩, rfl⟩
+ exact interior_maximal (image_mono interior_subset) (heo _ isOpen_interior) ⟨y, hyi, rfl⟩
+
+namespace CapHyp
+
+/-- **Transport along a chart.** The cap hypotheses for the lift `f ∘ e` on a compact cap `C`
+give the cap hypotheses for `f` on `e '' C`, with the same `b` and `s`. -/
+theorem map {Y : Type*} [TopologicalSpace Y] [T2Space X] {e : Y → X} (hec : Continuous e)
+ (heo : IsOpenMap e) {f : X → ℝ} {C : Set Y} (hC : IsCompact C) {M z : Y} {b s : ℝ}
+ (H : CapHyp (f ∘ e) C M z b s) : CapHyp f (e '' C) (e M) (e z) b s where
+ mem := ⟨M, H.mem, rfl⟩
+ ceiling := by
+ rintro _ ⟨y, hy, rfl⟩
+ exact H.ceiling y hy
+ frontier_le := by
+ intro x hx
+ obtain ⟨y, hy, rfl⟩ := frontier_image_subset hec heo hC hx
+ exact H.frontier_le y hy
+ older := H.older
+ ridge := by
+ obtain ⟨γ, hγ⟩ := H.ridge
+ exact ⟨γ.map hec, fun t => hγ t⟩
+
+/-- Transport of (C2⁺): if only `S` attains `s` on the frontier of `C` for the lift, only `e S`
+attains it on the frontier of `e '' C`. -/
+theorem map_saddle {Y : Type*} [TopologicalSpace Y] [T2Space X] {e : Y → X} (hec : Continuous e)
+ (heo : IsOpenMap e) {f : X → ℝ} {C : Set Y} (hC : IsCompact C) {S : Y} {s : ℝ}
+ (hS : ∀ y ∈ frontier C, y ≠ S → (f ∘ e) y < s) :
+ ∀ x ∈ frontier (e '' C), x ≠ e S → f x < s := by
+ intro x hx hne
+ obtain ⟨y, hy, rfl⟩ := frontier_image_subset hec heo hC hx
+ exact hS y hy (fun h => hne (h ▸ rfl))
+
+end CapHyp
+
+/-- **The faces of the cylinder cap** `[a, c] × B̄(0, R)`: the two end faces `{a, c} × B̄(0, R)`
+and the curved side `[a, c] × S(0, R)`. These are the faces estimated in L17–L19. -/
+theorem frontier_cylinder {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {a c R : ℝ}
+ (hac : a ≤ c) (hR : R ≠ 0) :
+ frontier (Icc a c ×ˢ Metric.closedBall (0 : E) R) =
+ ({a, c} : Set ℝ) ×ˢ Metric.closedBall (0 : E) R ∪ Icc a c ×ˢ Metric.sphere (0 : E) R := by
+ rw [frontier_prod_eq, closure_Icc, frontier_closedBall (0 : E) hR, frontier_Icc hac,
+ Metric.isClosed_closedBall.closure_eq]
+ exact union_comm _ _
+
+/-- The cylinder cap is compact in finite dimension. -/
+theorem isCompact_cylinder {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [ProperSpace E]
+ (a c R : ℝ) : IsCompact (Icc a c ×ˢ Metric.closedBall (0 : E) R) :=
+ isCompact_Icc.prod (isCompact_closedBall 0 R)
+
+/-- The covering map of the flat torus `(ℝ / Lℤ)^d`. -/
+def torusCover (L : ℝ) (d : ℕ) : (Fin d → ℝ) → (Fin d → AddCircle L) :=
+ Pi.map fun _ => ((↑) : ℝ → AddCircle L)
+
+theorem torusCover_continuous (L : ℝ) (d : ℕ) : Continuous (torusCover L d) :=
+ Continuous.piMap fun _ => continuous_quotient_mk'
+
+theorem torusCover_isOpenMap (L : ℝ) (d : ℕ) : IsOpenMap (torusCover L d) :=
+ IsOpenMap.piMap (fun _ => QuotientAddGroup.isOpenMap_coe)
+ (Filter.Eventually.of_forall fun _ => QuotientAddGroup.mk_surjective)
+
+/-- **The cap on the torus.** Let `φ` be any coordinate frame (a homeomorphism onto `ℝ^d`), and
+suppose the periodic lift `f ∘ torusCover L d ∘ φ` satisfies the cap hypotheses on a compact cap
+`C`. Then `f` satisfies them on the image of `C` in the torus `(ℝ / Lℤ)^d`, with the same `b` and
+`s`. No embedding radius is used. -/
+theorem CapHyp.toTorus {Y : Type*} [TopologicalSpace Y] {L : ℝ} {d : ℕ}
+ (φ : Y ≃ₜ (Fin d → ℝ)) {f : (Fin d → AddCircle L) → ℝ} {C : Set Y} (hC : IsCompact C)
+ {M z : Y} {b s : ℝ} (H : CapHyp (f ∘ (torusCover L d ∘ φ)) C M z b s) :
+ CapHyp f ((torusCover L d ∘ φ) '' C) (torusCover L d (φ M)) (torusCover L d (φ z)) b s :=
+ H.map ((torusCover_continuous L d).comp φ.continuous)
+ ((torusCover_isOpenMap L d).comp φ.isOpenMap) hC
+
+/-! ### From the ridge to the cap hypotheses (L13, L16, L17, L19, L20)
+
+SP §2 normalizes the pins to `x = a = -r/2` and `x = c = r/2`, on the cap
+`C = [-2r, r/2] × B̄(0, 2r)` in coordinates `(x, y) ∈ ℝ × E`. The multi-variable analytic steps
+enter as hypotheses, each the output of a named step of SP:
+- `hT` (L7): on the cap, `f (x, y) ≤ f (x, h x)`, with `h` the transverse maximizer;
+- `hg` (L11): the ridge function `g x = f (x, h x)` has derivative `F x`;
+- `hFa`, `hFc` (L13): `F a = F c = 0`, because the pins are critical;
+- `hconv` (L12): `F - q` is convex, where `q x = (x - a)(x - c)/8`; this is SP's `F'' ≥ 1/4`;
+- `hside` (L18): on the curved side, `f ≤ g c`;
+- `hgap`: `g a - g c < 9r³/32`. SP's normalization `g a - g c = r³/6` satisfies it.
+
+From these inputs Lean derives the rest:
+- L13: the sign pattern of `F`;
+- L16: the ceiling `g ≤ g a` on `[-2r, c]`;
+- L17: both exact face integrals `9r³/32`, by comparing `g` with the cubic
+ `Q x = x³/24 - r²x/32`;
+- L19: the face assembly;
+- L20: the ridge path. -/
+
+section Ridge
+
+/-- A convex function that vanishes at `a ≤ c` is `≤ 0` between them. -/
+theorem convex_zeros_between {φ : ℝ → ℝ} {D : Set ℝ} (hφ : ConvexOn ℝ D φ) {a c : ℝ}
+ (haD : a ∈ D) (hcD : c ∈ D) (hac : a ≤ c) (ha : φ a = 0) (hc : φ c = 0) {x : ℝ}
+ (hx : x ∈ Icc a c) : φ x ≤ 0 := by
+ have h := hφ.le_on_segment haD hcD (by rw [segment_eq_Icc hac]; exact hx)
+ rwa [ha, hc, max_self] at h
+
+/-- A convex function that vanishes at `a < c` is `≥ 0` to the right of `c`. -/
+theorem convex_zeros_right {φ : ℝ → ℝ} {D : Set ℝ} (hφ : ConvexOn ℝ D φ) {a c : ℝ}
+ (haD : a ∈ D) (hac : a < c) (ha : φ a = 0) (hc : φ c = 0) {x : ℝ} (hxD : x ∈ D)
+ (hx : c ≤ x) : 0 ≤ φ x := by
+ rcases eq_or_lt_of_le hx with rfl | hlt
+ · rw [hc]
+ · have h := hφ.slope_mono_adjacent haD hxD hac hlt
+ rw [ha, hc, sub_self, zero_div, sub_zero] at h
+ rw [le_div_iff₀ (sub_pos.mpr hlt), zero_mul] at h
+ exact h
+
+/-- A convex function that vanishes at `a < c` is `≥ 0` to the left of `a`. -/
+theorem convex_zeros_left {φ : ℝ → ℝ} {D : Set ℝ} (hφ : ConvexOn ℝ D φ) {a c : ℝ}
+ (hcD : c ∈ D) (hac : a < c) (ha : φ a = 0) (hc : φ c = 0) {x : ℝ} (hxD : x ∈ D)
+ (hx : x ≤ a) : 0 ≤ φ x := by
+ rcases eq_or_lt_of_le hx with rfl | hlt
+ · rw [ha]
+ · have h := hφ.slope_mono_adjacent hxD hcD hlt hac
+ rw [ha, hc, sub_self, zero_div, zero_sub] at h
+ rw [div_le_iff₀ (sub_pos.mpr hlt), zero_mul] at h
+ linarith
+
+/-- **The ridge profile (L13, L16, L17, L20).** On `D = [-2r, 2r]`, let `g' = F`, with `F`
+vanishing at the pins `∓r/2` and `F - (x + r/2)(x - r/2)/8` convex. Then:
+- `g ≤ g(-r/2)` on `[-2r, r/2]`;
+- `g ≥ g(r/2)` on `[-r/2, 2r]`;
+- `g(-2r) ≤ g(-r/2) - 9r³/32`;
+- `g(2r) ≥ g(r/2) + 9r³/32`. -/
+theorem ridge_profile {g F : ℝ → ℝ} {r : ℝ} (hr : 0 < r)
+ (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt g (F x) x)
+ (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)
+ (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8)) :
+ (∀ x ∈ Icc (-2 * r) (r / 2), g x ≤ g (-r / 2)) ∧
+ (∀ x ∈ Icc (-r / 2) (2 * r), g (r / 2) ≤ g x) ∧
+ g (-2 * r) ≤ g (-r / 2) - 9 * r ^ 3 / 32 ∧ g (r / 2) + 9 * r ^ 3 / 32 ≤ g (2 * r) := by
+ have hac : -r / 2 < r / 2 := by linarith
+ have haD : -r / 2 ∈ Icc (-2 * r) (2 * r) := ⟨by linarith, by linarith⟩
+ have hcD : r / 2 ∈ Icc (-2 * r) (2 * r) := ⟨by linarith, by linarith⟩
+ have hLD : Icc (-2 * r) (-r / 2) ⊆ Icc (-2 * r) (2 * r) := Icc_subset_Icc le_rfl (by linarith)
+ have hMD : Icc (-r / 2) (r / 2) ⊆ Icc (-2 * r) (2 * r) :=
+ Icc_subset_Icc (by linarith) (by linarith)
+ have hRD : Icc (r / 2) (2 * r) ⊆ Icc (-2 * r) (2 * r) := Icc_subset_Icc (by linarith) le_rfl
+ set φ : ℝ → ℝ := fun x => F x - (x + r / 2) * (x - r / 2) / 8 with hφdef
+ have hφa : φ (-r / 2) = 0 := by simp only [hφdef, hFa]; ring
+ have hφc : φ (r / 2) = 0 := by simp only [hφdef, hFc]; ring
+ have hgc : ContinuousOn g (Icc (-2 * r) (2 * r)) :=
+ fun x hx => (hg x hx).continuousAt.continuousWithinAt
+ -- L13: the sign pattern of `F`
+ have hFl : ∀ x ∈ Icc (-2 * r) (-r / 2), 0 ≤ F x := by
+ intro x hx
+ have h1 := convex_zeros_left hconv hcD hac hφa hφc (hLD hx) hx.2
+ have h2 : 0 ≤ (x + r / 2) * (x - r / 2) / 8 := by
+ have : 0 ≤ (x + r / 2) * (x - r / 2) :=
+ mul_nonneg_of_nonpos_of_nonpos (by linarith [hx.2]) (by linarith [hx.2])
+ positivity
+ simp only [hφdef] at h1
+ linarith
+ have hFm : ∀ x ∈ Icc (-r / 2) (r / 2), F x ≤ 0 := by
+ intro x hx
+ have h1 := convex_zeros_between hconv haD hcD hac.le hφa hφc hx
+ have h2 : (x + r / 2) * (x - r / 2) ≤ 0 :=
+ mul_nonpos_of_nonneg_of_nonpos (by linarith [hx.1]) (by linarith [hx.2])
+ simp only [hφdef] at h1
+ linarith
+ have hFr : ∀ x ∈ Icc (r / 2) (2 * r), 0 ≤ F x := by
+ intro x hx
+ have h1 := convex_zeros_right hconv haD hac hφa hφc (hRD hx) hx.1
+ have h2 : 0 ≤ (x + r / 2) * (x - r / 2) := mul_nonneg (by linarith [hx.1]) (by linarith [hx.1])
+ simp only [hφdef] at h1
+ linarith
+ -- monotonicity of `g` on the three pieces
+ have hmonoL : MonotoneOn g (Icc (-2 * r) (-r / 2)) :=
+ monotoneOn_of_hasDerivWithinAt_nonneg (convex_Icc _ _) (hgc.mono hLD)
+ (fun x hx => (hg x (hLD (interior_subset hx))).hasDerivWithinAt)
+ (fun x hx => hFl x (interior_subset hx))
+ have hantiM : AntitoneOn g (Icc (-r / 2) (r / 2)) :=
+ antitoneOn_of_hasDerivWithinAt_nonpos (convex_Icc _ _) (hgc.mono hMD)
+ (fun x hx => (hg x (hMD (interior_subset hx))).hasDerivWithinAt)
+ (fun x hx => hFm x (interior_subset hx))
+ have hmonoR : MonotoneOn g (Icc (r / 2) (2 * r)) :=
+ monotoneOn_of_hasDerivWithinAt_nonneg (convex_Icc _ _) (hgc.mono hRD)
+ (fun x hx => (hg x (hRD (interior_subset hx))).hasDerivWithinAt)
+ (fun x hx => hFr x (interior_subset hx))
+ -- L17: compare `g` with the cubic `Q`, whose derivative is `(x + r/2)(x - r/2)/8`
+ set Q : ℝ → ℝ := fun x => x ^ 3 / 24 - r ^ 2 * x / 32 with hQdef
+ have hQ : ∀ x, HasDerivAt Q ((x + r / 2) * (x - r / 2) / 8) x := by
+ intro x
+ have h1 := ((hasDerivAt_pow 3 x).div_const 24).sub ((hasDerivAt_id x).const_mul (r ^ 2 / 32))
+ convert h1 using 1
+ · funext y
+ simp only [hQdef, id, Pi.sub_apply]
+ ring
+ · push_cast
+ ring
+ have hG : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => g x - Q x) (φ x) x :=
+ fun x hx => (hg x hx).sub (hQ x)
+ have hGc : ContinuousOn (fun x => g x - Q x) (Icc (-2 * r) (2 * r)) :=
+ fun x hx => (hG x hx).continuousAt.continuousWithinAt
+ have hGL : MonotoneOn (fun x => g x - Q x) (Icc (-2 * r) (-r / 2)) :=
+ monotoneOn_of_hasDerivWithinAt_nonneg (convex_Icc _ _) (hGc.mono hLD)
+ (fun x hx => (hG x (hLD (interior_subset hx))).hasDerivWithinAt)
+ (fun x hx => convex_zeros_left hconv hcD hac hφa hφc (hLD (interior_subset hx))
+ (interior_subset hx).2)
+ have hGR : MonotoneOn (fun x => g x - Q x) (Icc (r / 2) (2 * r)) :=
+ monotoneOn_of_hasDerivWithinAt_nonneg (convex_Icc _ _) (hGc.mono hRD)
+ (fun x hx => (hG x (hRD (interior_subset hx))).hasDerivWithinAt)
+ (fun x hx => convex_zeros_right hconv haD hac hφa hφc (hRD (interior_subset hx))
+ (interior_subset hx).1)
+ have hLa : (-r / 2 : ℝ) ∈ Icc (-2 * r) (-r / 2) := ⟨by linarith, le_rfl⟩
+ have hL2 : (-2 * r : ℝ) ∈ Icc (-2 * r) (-r / 2) := ⟨le_rfl, by linarith⟩
+ have hRc : (r / 2 : ℝ) ∈ Icc (r / 2) (2 * r) := ⟨le_rfl, by linarith⟩
+ have hR2 : (2 * r : ℝ) ∈ Icc (r / 2) (2 * r) := ⟨by linarith, le_rfl⟩
+ refine ⟨?_, ?_, ?_, ?_⟩
+ · intro x hx
+ rcases le_or_gt x (-r / 2) with h | h
+ · exact hmonoL ⟨hx.1, h⟩ hLa h
+ · exact hantiM ⟨le_rfl, hac.le⟩ ⟨h.le, hx.2⟩ h.le
+ · intro x hx
+ rcases le_or_gt x (r / 2) with h | h
+ · exact hantiM ⟨hx.1, h⟩ ⟨hac.le, le_rfl⟩ h
+ · exact hmonoR hRc ⟨h.le, hx.2⟩ h.le
+ · have h := hGL hL2 hLa (by linarith)
+ simp only [hQdef] at h
+ nlinarith [h]
+ · have h := hGR hRc hR2 (by linarith)
+ simp only [hQdef] at h
+ nlinarith [h]
+
+variable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
+
+/-- **The cap hypotheses from the ridge (L16, L17, L19, L20).** Under the analytic inputs listed
+above, `f` satisfies (C1)–(C3) on `C = [-2r, r/2] × B̄(0, 2r)`, with `M = (-r/2, h(-r/2))`,
+`z = (2r, h(2r))`, `b = g(-r/2)` and `s = g(r/2)`. Every input is local: `g' = F` and the convexity
+hold on `[-2r, 2r]`, and `h` is continuous on `[-r/2, 2r]`. -/
+theorem ridge_capHyp {f : ℝ × E → ℝ} {h : ℝ → E} {F : ℝ → ℝ} {r : ℝ} (hr : 0 < r)
+ (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))
+ (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)
+ (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)
+ (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))
+ (hT : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), f p ≤ f (p.1, h p.1))
+ (hside : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.sphere (0 : E) (2 * r),
+ f p ≤ f (r / 2, h (r / 2)))
+ (hM : ‖h (-r / 2)‖ ≤ 2 * r)
+ (hgap : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) < 9 * r ^ 3 / 32) :
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, h (-r / 2))
+ (2 * r, h (2 * r)) (f (-r / 2, h (-r / 2))) (f (r / 2, h (r / 2))) := by
+ obtain ⟨hceil, hfloor, hleft, hright⟩ := ridge_profile hr hg hFa hFc hconv
+ have hcyl : frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) =
+ ({-2 * r, r / 2} : Set ℝ) ×ˢ Metric.closedBall (0 : E) (2 * r) ∪
+ Icc (-2 * r) (r / 2) ×ˢ Metric.sphere (0 : E) (2 * r) :=
+ frontier_cylinder (by linarith) (by positivity)
+ set xt : I → ℝ := fun t => -r / 2 + (t : ℝ) * (2 * r - -r / 2) with hxt
+ have hxc : Continuous xt := continuous_const.add (continuous_subtype_val.mul continuous_const)
+ have hx0 : xt 0 = -r / 2 := by simp [hxt]
+ have hx1 : xt 1 = 2 * r := by simp [hxt]
+ have hxmem : ∀ t, xt t ∈ Icc (-r / 2) (2 * r) := by
+ intro t
+ have h0 := t.2.1
+ have h1 := t.2.2
+ simp only [hxt]
+ constructor <;> nlinarith
+ let γ : Path ((-r / 2 : ℝ), h (-r / 2)) (2 * r, h (2 * r)) :=
+ { toFun := fun t => (xt t, h (xt t))
+ continuous_toFun := hxc.prodMk (hh.comp_continuous hxc hxmem)
+ source' := by simp only [hx0]
+ target' := by simp only [hx1] }
+ refine ⟨⟨⟨by linarith, by linarith⟩, mem_closedBall_zero_iff.mpr hM⟩, ?_, ?_, ?_, ⟨γ, ?_⟩⟩
+ · intro p hp
+ exact (hT p hp).trans (hceil p.1 hp.1)
+ · intro p hp
+ rw [hcyl] at hp
+ rcases hp with ⟨hp1, hp2⟩ | hp
+ · have hpC : p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r) := by
+ refine ⟨?_, hp2⟩
+ rcases hp1 with h1 | h1
+ · rw [h1]; exact ⟨le_refl _, by linarith⟩
+ · rw [h1]; exact ⟨by linarith, le_refl _⟩
+ have h0 := hT p hpC
+ rcases hp1 with h1 | h1
+ · rw [h1] at h0
+ linarith
+ · rw [h1] at h0
+ exact h0
+ · exact hside p hp
+ · linarith
+ · intro t
+ exact hfloor (xt t) (hxmem t)
+
+/-- **(C2⁺) from the ridge.** If, in addition, `h x` is the unique transverse maximizer on the
+cap and the curved side is strictly below `g c` (L7, L18), then `S = (r/2, h(r/2))` is the only
+frontier point at height `s`. -/
+theorem ridge_saddle_strict {f : ℝ × E → ℝ} {h : ℝ → E} {F : ℝ → ℝ} {r : ℝ} (hr : 0 < r)
+ (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)
+ (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)
+ (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))
+ (hT : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), f p ≤ f (p.1, h p.1))
+ (hTs : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), p.2 ≠ h p.1 →
+ f p < f (p.1, h p.1))
+ (hside : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.sphere (0 : E) (2 * r),
+ f p < f (r / 2, h (r / 2)))
+ (hgap : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) < 9 * r ^ 3 / 32) :
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, h (r / 2)) → f x < f (r / 2, h (r / 2)) := by
+ obtain ⟨-, -, hleft, -⟩ := ridge_profile hr hg hFa hFc hconv
+ intro p hp hne
+ rw [frontier_cylinder (by linarith) (by positivity)] at hp
+ rcases hp with ⟨hp1, hp2⟩ | hp
+ · rcases hp1 with h1 | h1
+ · have hpC : p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r) :=
+ ⟨by rw [h1]; exact ⟨le_refl _, by linarith⟩, hp2⟩
+ have h0 := hT p hpC
+ rw [h1] at h0
+ linarith
+ · have hpC : p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r) :=
+ ⟨by rw [h1]; exact ⟨by linarith, le_refl _⟩, hp2⟩
+ have hy : p.2 ≠ h p.1 := by
+ intro hy
+ apply hne
+ rw [h1] at hy
+ exact Prod.ext h1 hy
+ have h0 := hTs p hpC hy
+ rw [h1] at h0
+ exact h0
+ · exact hside p hp
+
+end Ridge
+
+/-! ### The transverse slices (L7, L8, L11, L18)
+
+`ridge_capHyp` takes the transverse maximum (`hT`), its uniqueness (`hTs`), the curved side
+(`hside`) and the ridge equation `g' = F` as inputs. SP derives them deterministically from L4
+(each slice `y ↦ f (x, y)` is `δ`-strongly concave on `B̄(0, 2r)`), L5 (the transverse derivative
+`w x` at `y = 0` has norm at most `ω`) and the ridge equation `∂_y f (x, h x) = 0`. This section
+proves those derivations. -/
+
+section Slice
+
+open Filter Topology
+
+variable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
+
+/-- **Strong concavity about a point with a derivative (the engine of L7, L8, L18).** If `φ` is
+`δ`-strongly concave on `K`, `p ∈ K`, and `φ` has derivative `L` at `p`, then
+`φ y ≤ φ p + L (y - p) - (δ/2)‖y - p‖²` for every `y ∈ K`. `p` need not be interior: only the
+segment from `p` to `y`, which lies in `K`, is used. -/
+theorem strongConcave_le_of_hasFDerivAt {K : Set E} {φ : E → ℝ} {δ : ℝ} {p : E}
+ {L : E →L[ℝ] ℝ} (hφ : StrongConcaveOn K δ φ) (hp : p ∈ K) (hd : HasFDerivAt φ L p) {y : E}
+ (hy : y ∈ K) : φ y ≤ φ p + L (y - p) - δ / 2 * ‖y - p‖ ^ 2 := by
+ set v := y - p with hv
+ have h1 : HasDerivAt (fun t : ℝ => p + t • v) v 0 := by
+ simpa using ((hasDerivAt_id (0 : ℝ)).smul_const v).const_add p
+ have h2 : HasFDerivAt φ L (p + (0 : ℝ) • v) := by simpa using hd
+ have hline : HasDerivAt (fun t : ℝ => φ (p + t • v)) (L v) 0 := h2.comp_hasDerivAt (0 : ℝ) h1
+ have hslope := hline.tendsto_slope_zero_right
+ have hbound : ∀ᶠ t in 𝓝[>] (0 : ℝ),
+ φ y - φ p + (1 - t) * (δ / 2 * ‖v‖ ^ 2) ≤
+ t⁻¹ • (φ (p + (0 + t) • v) - φ (p + (0 : ℝ) • v)) := by
+ have hlt : ∀ᶠ t in 𝓝[>] (0 : ℝ), t < 1 :=
+ nhdsWithin_le_nhds (Iio_mem_nhds one_pos)
+ filter_upwards [self_mem_nhdsWithin, hlt] with t (ht0 : 0 < t) ht1
+ have key := hφ.2 hp hy (by linarith : (0 : ℝ) ≤ 1 - t) ht0.le (by ring : 1 - t + t = 1)
+ have hpt : (1 - t) • p + t • y = p + t • v := by
+ simp only [hv, smul_sub, sub_smul, one_smul]; abel
+ have hnorm : ‖p - y‖ = ‖v‖ := by rw [hv, norm_sub_rev]
+ rw [hpt, hnorm, smul_eq_mul, smul_eq_mul] at key
+ simp only [zero_smul, add_zero, zero_add, smul_eq_mul]
+ rw [le_inv_mul_iff₀ ht0]
+ nlinarith [key]
+ have hlim : Tendsto (fun t : ℝ => φ y - φ p + (1 - t) * (δ / 2 * ‖v‖ ^ 2)) (𝓝[>] 0)
+ (𝓝 (φ y - φ p + (1 - 0) * (δ / 2 * ‖v‖ ^ 2))) :=
+ ((continuous_const.add ((continuous_const.sub continuous_id).mul continuous_const)).tendsto
+ 0).mono_left nhdsWithin_le_nhds
+ have := le_of_tendsto_of_tendsto hlim hslope hbound
+ simp only [sub_zero, one_mul] at this
+ linarith
+
+/-- **L7 (the transverse maximum).** At a critical point `p` of a `δ`-strongly concave slice,
+`φ y ≤ φ p - (δ/2)‖y - p‖²` on `K`. With `δ > 0` the maximizer is unique. -/
+theorem slice_le {K : Set E} {φ : E → ℝ} {δ : ℝ} {p : E}
+ (hφ : StrongConcaveOn K δ φ) (hp : p ∈ K) (hd : HasFDerivAt φ (0 : E →L[ℝ] ℝ) p)
+ {y : E} (hy : y ∈ K) : φ y ≤ φ p - δ / 2 * ‖y - p‖ ^ 2 := by
+ simpa using strongConcave_le_of_hasFDerivAt hφ hp hd hy
+
+/-- **L8 (the ridge bound).** If `0, p ∈ K`, `p` is critical and `w` is the derivative at `0`,
+then `δ ‖p‖ ≤ ‖w‖`, i.e. `‖h(x)‖ ≤ ‖w(x)‖/δ`. -/
+theorem slice_ridge_bound {K : Set E} {φ : E → ℝ} {δ : ℝ} {p : E} {w : E →L[ℝ] ℝ}
+ (hφ : StrongConcaveOn K δ φ) (h0 : (0 : E) ∈ K) (hp : p ∈ K)
+ (hd : HasFDerivAt φ (0 : E →L[ℝ] ℝ) p) (hw : HasFDerivAt φ w 0) : δ * ‖p‖ ≤ ‖w‖ := by
+ have h1 := slice_le hφ hp hd h0
+ have h2 := strongConcave_le_of_hasFDerivAt hφ h0 hw hp
+ simp only [zero_sub, norm_neg, sub_zero] at h1 h2
+ have h3 : w p ≤ ‖w‖ * ‖p‖ :=
+ (le_abs_self _).trans (by simpa [Real.norm_eq_abs] using w.le_opNorm p)
+ have h4 : δ * ‖p‖ * ‖p‖ ≤ ‖w‖ * ‖p‖ := by nlinarith
+ rcases (norm_nonneg p).eq_or_lt with h | h
+ · rw [← h, mul_zero]; exact norm_nonneg w
+ · exact le_of_mul_le_mul_right h4 h
+
+/-- **L18 (the curved side).** On the sphere of radius `R`, the slice is strictly below `s`
+once `φ p ≤ b`, `‖w‖ ≤ ω ≤ Rδ` and `2δ(b - s) < (Rδ - ω)²`. -/
+theorem slice_curved {φ : E → ℝ} {δ ω R b s : ℝ} {p : E} {w : E →L[ℝ] ℝ}
+ (hφ : StrongConcaveOn (Metric.closedBall (0 : E) R) δ φ) (hδ : 0 < δ)
+ (hp : p ∈ Metric.closedBall (0 : E) R) (hd : HasFDerivAt φ (0 : E →L[ℝ] ℝ) p)
+ (hw : HasFDerivAt φ w 0) (hω : ‖w‖ ≤ ω) (hωR : ω ≤ R * δ) (hb : φ p ≤ b)
+ (hcurv : 2 * δ * (b - s) < (R * δ - ω) ^ 2) {y : E} (hy : y ∈ Metric.sphere (0 : E) R) :
+ φ y < s := by
+ have hyn : ‖y‖ = R := mem_sphere_zero_iff_norm.mp hy
+ have hR : 0 ≤ R := hyn ▸ norm_nonneg y
+ have h0 : (0 : E) ∈ Metric.closedBall (0 : E) R := Metric.mem_closedBall_self hR
+ have hL8 := slice_ridge_bound hφ h0 hp hd hw
+ have hL7 := slice_le hφ hp hd (Metric.sphere_subset_closedBall hy)
+ have htri : R - ‖p‖ ≤ ‖y - p‖ := by have := norm_sub_norm_le y p; linarith
+ have hρ : R * δ - ω ≤ δ * ‖y - p‖ := by nlinarith
+ have hsq : (R * δ - ω) ^ 2 ≤ (δ * ‖y - p‖) ^ 2 := pow_le_pow_left₀ (by linarith) hρ 2
+ have h5 : δ * (2 * (b - s)) < δ * (δ * ‖y - p‖ ^ 2) := by nlinarith
+ have h6 : 2 * (b - s) < δ * ‖y - p‖ ^ 2 := lt_of_mul_lt_mul_left h5 hδ.le
+ linarith
+
+/-- The derivative of a slice `y ↦ f (x, y)` is the joint derivative restricted to the
+transverse directions. -/
+theorem slice_hasFDerivAt {f : ℝ × E → ℝ} {x : ℝ} {y : E} {D : ℝ × E →L[ℝ] ℝ}
+ (hf : HasFDerivAt f D (x, y)) :
+ HasFDerivAt (fun y' => f (x, y')) (D.comp (ContinuousLinearMap.inr ℝ ℝ E)) y :=
+ hf.comp y (hasFDerivAt_prodMk_right x y)
+
+/-- **L11 (the ridge function's derivative).** If `f` has joint derivative `D` at `(x, h x)`,
+`h` has derivative `h'` at `x`, and the transverse part of `D` vanishes (the ridge equation
+`∂_y f = 0`), then `g = f (·, h ·)` has derivative `F x = D (1, 0) = ∂_x f (x, h x)`: the
+`∂_y f · h'` term drops out. -/
+theorem ridge_hasDerivAt {f : ℝ × E → ℝ} {h : ℝ → E} {x : ℝ} {D : ℝ × E →L[ℝ] ℝ} {h' : E}
+ (hf : HasFDerivAt f D (x, h x)) (hh : HasDerivAt h h' x)
+ (hy : D.comp (ContinuousLinearMap.inr ℝ ℝ E) = 0) :
+ HasDerivAt (fun t => f (t, h t)) (D (1, 0)) x := by
+ have hp : HasDerivAt (fun t => (t, h t)) ((1 : ℝ), h') x := (hasDerivAt_id x).prodMk hh
+ have hc := hf.comp_hasDerivAt x hp
+ have h0 : D (0, h') = 0 := by
+ simpa using congrArg (fun L : E →L[ℝ] ℝ => L h') hy
+ have hD : D (1, h') = D (1, 0) := by
+ calc D (1, h') = D ((1, 0) + (0, h')) := by simp
+ _ = D (1, 0) + D (0, h') := map_add _ _ _
+ _ = D (1, 0) := by rw [h0, add_zero]
+ rw [← hD]
+ exact hc
+
+/-- **(C1)–(C3) and (C2⁺) from the slices.** `ridge_capHyp` and `ridge_saddle_strict` with
+`hT`, `hTs`, `hside` and `hM` derived (L7, L8, L18) from L4 (`hconc`), the critical points
+`h x ∈ B̄(0, 2r)` (`hball`, `hcrit`; L7's existence part), L5 (`hw`, `hω`) and the curvature
+condition `2δ(b - s) < (2rδ - ω)²`, which SP's constants satisfy (`sp_curved_side_constants`). -/
+theorem ridge_capHyp_of_slices {f : ℝ × E → ℝ} {h : ℝ → E} {F : ℝ → ℝ} {w : ℝ → E →L[ℝ] ℝ}
+ {r δ ω : ℝ} (hr : 0 < r) (hδ : 0 < δ)
+ (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))
+ (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)
+ (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)
+ (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))
+ (hconc : ∀ x ∈ Icc (-2 * r) (r / 2),
+ StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))
+ (hball : ∀ x ∈ Icc (-2 * r) (r / 2), h x ∈ Metric.closedBall (0 : E) (2 * r))
+ (hcrit : ∀ x ∈ Icc (-2 * r) (r / 2),
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))
+ (hw : ∀ x ∈ Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))
+ (hω : ∀ x ∈ Icc (-2 * r) (r / 2), ‖w x‖ ≤ ω) (hωr : ω ≤ 2 * r * δ)
+ (hcurv : 2 * δ * (f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2))) < (2 * r * δ - ω) ^ 2)
+ (hgap : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) < 9 * r ^ 3 / 32) :
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, h (-r / 2))
+ (2 * r, h (2 * r)) (f (-r / 2, h (-r / 2))) (f (r / 2, h (r / 2))) ∧
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, h (r / 2)) → f x < f (r / 2, h (r / 2)) := by
+ obtain ⟨hceil, -, -, -⟩ := ridge_profile hr hg hFa hFc hconv
+ have hT : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ f p ≤ f (p.1, h p.1) := by
+ rintro ⟨x, y⟩ ⟨hx, hy⟩
+ have h1 := slice_le (hconc x hx) (hball x hx) (hcrit x hx) hy
+ have h2 : 0 ≤ δ / 2 * ‖y - h x‖ ^ 2 := by positivity
+ simp only at h1 ⊢
+ linarith
+ have hTs : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), p.2 ≠ h p.1 →
+ f p < f (p.1, h p.1) := by
+ rintro ⟨x, y⟩ ⟨hx, hy⟩ hne
+ have h1 := slice_le (hconc x hx) (hball x hx) (hcrit x hx) hy
+ have h2 : 0 < ‖y - h x‖ := norm_pos_iff.mpr (sub_ne_zero.mpr hne)
+ have h3 : 0 < δ / 2 * ‖y - h x‖ ^ 2 := mul_pos (by linarith) (pow_pos h2 2)
+ simp only at h1 ⊢
+ linarith
+ have hside : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.sphere (0 : E) (2 * r),
+ f p < f (r / 2, h (r / 2)) := by
+ rintro ⟨x, y⟩ ⟨hx, hy⟩
+ exact slice_curved (hconc x hx) hδ (hball x hx) (hcrit x hx) (hw x hx) (hω x hx) hωr
+ (hceil x hx) hcurv hy
+ have hM : ‖h (-r / 2)‖ ≤ 2 * r := by
+ simpa using hball (-r / 2) ⟨by linarith, by linarith⟩
+ exact ⟨ridge_capHyp hr hh hg hFa hFc hconv hT (fun p hp => (hside p hp).le) hM hgap,
+ ridge_saddle_strict hr hg hFa hFc hconv hT hTs hside hgap⟩
+
+/-- **The joint form (L7, L11).** From a joint derivative `D x` of `f` along the ridge, a
+differentiable `h` and the ridge equation `(D x) ∘ inr = 0`, the inputs `hh`, `hg` (with
+`F x = D x (1, 0)`) and `hcrit` of `ridge_capHyp_of_slices` follow. -/
+theorem ridge_inputs_of_joint {f : ℝ × E → ℝ} {h h' : ℝ → E} {D : ℝ → ℝ × E →L[ℝ] ℝ} {r : ℝ}
+ (hr : 0 < r) (hD : ∀ x ∈ Icc (-2 * r) (2 * r), HasFDerivAt f (D x) (x, h x))
+ (hh' : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt h (h' x) x)
+ (hridge : ∀ x ∈ Icc (-2 * r) (2 * r), (D x).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0) :
+ ContinuousOn h (Icc (-r / 2) (2 * r)) ∧
+ (∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (D x (1, 0)) x) ∧
+ ∀ x ∈ Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x) := by
+ refine ⟨fun x hx => ?_, fun x hx => ridge_hasDerivAt (hD x hx) (hh' x hx) (hridge x hx),
+ fun x hx => ?_⟩
+ · exact (hh' x ⟨by linarith [hx.1], hx.2⟩).continuousAt.continuousWithinAt
+ · have hx' : x ∈ Icc (-2 * r) (2 * r) := ⟨hx.1, by linarith [hx.2]⟩
+ simpa [hridge x hx'] using slice_hasFDerivAt (hD x hx')
+
+/-- **SP's constants satisfy the curvature condition (L4, L5, L18).** With `m ≥ 2`,
+`δ > r m (8m - 5)` (L4, `k = 8m - 5`), `0 ≤ ω ≤ 2 m r²` (L5) and SP's gap `b - s = r³/6`:
+`ω ≤ 2rδ` and `2δ · r³/6 < (2rδ - ω)²`. -/
+theorem sp_curved_side_constants {r m δ ω : ℝ} (hr : 0 < r) (hm : 2 ≤ m)
+ (hδ : r * m * (8 * m - 5) < δ) (hω0 : 0 ≤ ω) (hω : ω ≤ 2 * m * r ^ 2) :
+ ω ≤ 2 * r * δ ∧ 2 * δ * (r ^ 3 / 6) < (2 * r * δ - ω) ^ 2 := by
+ have hk : 11 ≤ 8 * m - 5 := by linarith
+ have hrm : 0 < r * m := by positivity
+ have h11 : 11 * (r * m) < δ := by nlinarith
+ have h22 : 22 * r < δ := by nlinarith
+ have hωδ : 11 * ω < 2 * r * δ := by nlinarith
+ have hpos : 20 * r * δ < 11 * (2 * r * δ - ω) := by nlinarith
+ refine ⟨by linarith, ?_⟩
+ have hsq : (20 * r * δ) ^ 2 < (11 * (2 * r * δ - ω)) ^ 2 :=
+ pow_lt_pow_left₀ hpos (by have hδ0 : 0 < δ := by linarith
+ positivity) two_ne_zero
+ nlinarith [hsq]
+
+/-- Adding the affine function `(m/2)((t - a)(t - c) - t²)` preserves convexity. -/
+theorem convexOn_add_node {u : ℝ → ℝ} {D : Set ℝ} {a c m : ℝ}
+ (hcv : ConvexOn ℝ D (fun t => u t + m / 2 * t ^ 2)) :
+ ConvexOn ℝ D (fun t => u t + m / 2 * ((t - a) * (t - c))) := by
+ refine ⟨hcv.1, fun x hx y hy p q hp hq hpq => ?_⟩
+ have h := hcv.2 hx hy hp hq hpq
+ simp only [smul_eq_mul] at h ⊢
+ have key : (u (p * x + q * y) + m / 2 * ((p * x + q * y - a) * (p * x + q * y - c))) -
+ (p * (u x + m / 2 * ((x - a) * (x - c))) + q * (u y + m / 2 * ((y - a) * (y - c)))) =
+ (u (p * x + q * y) + m / 2 * (p * x + q * y) ^ 2) -
+ (p * (u x + m / 2 * x ^ 2) + q * (u y + m / 2 * y ^ 2)) := by
+ have hq' : q = 1 - p := by linarith
+ subst hq'
+ ring
+ linarith
+
+/-- **L5 (two-node interpolation), scalar form.** If `u + (m/2) t²` is convex and `u - (m/2) t²` is
+concave on `D` (the weak form of `|u''| ≤ m`) and `u` vanishes at `a < c` in `D`, then
+`|u x| ≤ (m/2) |(x - a)(x - c)|` for every `x ∈ D`, inside or outside `[a, c]`. -/
+theorem two_node_bound {u : ℝ → ℝ} {D : Set ℝ} {a c m : ℝ}
+ (hcv : ConvexOn ℝ D (fun t => u t + m / 2 * t ^ 2))
+ (hcc : ConcaveOn ℝ D (fun t => u t - m / 2 * t ^ 2))
+ (haD : a ∈ D) (hcD : c ∈ D) (hac : a < c) (ha : u a = 0) (hc : u c = 0) {x : ℝ}
+ (hx : x ∈ D) : |u x| ≤ m / 2 * |(x - a) * (x - c)| := by
+ have hψ := convexOn_add_node (a := a) (c := c) hcv
+ have hcv' : ConvexOn ℝ D (fun t => -u t + m / 2 * t ^ 2) :=
+ hcc.neg.congr fun t _ => by simp only [Pi.neg_apply]; ring
+ have hχ := convexOn_add_node (a := a) (c := c) hcv'
+ have hψa : u a + m / 2 * ((a - a) * (a - c)) = 0 := by rw [ha]; ring
+ have hψc : u c + m / 2 * ((c - a) * (c - c)) = 0 := by rw [hc]; ring
+ have hχa : -u a + m / 2 * ((a - a) * (a - c)) = 0 := by rw [ha]; ring
+ have hχc : -u c + m / 2 * ((c - a) * (c - c)) = 0 := by rw [hc]; ring
+ rcases le_or_gt x a with hxa | hxa
+ · have h1 := convex_zeros_left hψ hcD hac hψa hψc hx hxa
+ have h2 := convex_zeros_left hχ hcD hac hχa hχc hx hxa
+ have hP : 0 ≤ (x - a) * (x - c) := mul_nonneg_of_nonpos_of_nonpos (by linarith) (by linarith)
+ rw [abs_of_nonneg hP, abs_le]
+ constructor <;> linarith
+ rcases le_or_gt c x with hcx | hcx
+ · have h1 := convex_zeros_right hψ haD hac hψa hψc hx hcx
+ have h2 := convex_zeros_right hχ haD hac hχa hχc hx hcx
+ have hP : 0 ≤ (x - a) * (x - c) := mul_nonneg (by linarith) (by linarith)
+ rw [abs_of_nonneg hP, abs_le]
+ constructor <;> linarith
+ · have h1 := convex_zeros_between hψ haD hcD hac.le hψa hψc ⟨hxa.le, hcx.le⟩
+ have h2 := convex_zeros_between hχ haD hcD hac.le hχa hχc ⟨hxa.le, hcx.le⟩
+ have hP : (x - a) * (x - c) ≤ 0 := mul_nonpos_of_nonneg_of_nonpos (by linarith) (by linarith)
+ rw [abs_of_nonpos hP, abs_le]
+ constructor <;> linarith
+
+/-- **L5 (the transverse gradient at `y = 0`).** If the slice derivatives `w t` at `y = 0` vanish at
+the pins `a < c` and, for every direction `v`, `t ↦ w t v` has second derivative bounded by
+`m ‖v‖` in the weak form below, then `‖w x‖ ≤ (m/2) |(x - a)(x - c)|` on `D`. -/
+theorem slice_gradient_bound {w : ℝ → E →L[ℝ] ℝ} {D : Set ℝ} {a c m : ℝ} (hm : 0 ≤ m)
+ (hcv : ∀ v : E, ConvexOn ℝ D (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))
+ (hcc : ∀ v : E, ConcaveOn ℝ D (fun t => w t v - m * ‖v‖ / 2 * t ^ 2))
+ (haD : a ∈ D) (hcD : c ∈ D) (hac : a < c) (ha : w a = 0) (hc : w c = 0) {x : ℝ}
+ (hx : x ∈ D) : ‖w x‖ ≤ m / 2 * |(x - a) * (x - c)| := by
+ refine ContinuousLinearMap.opNorm_le_bound _ (by positivity) fun v => ?_
+ have h := two_node_bound (u := fun t => w t v) (m := m * ‖v‖) (hcv v) (hcc v) haD hcD hac
+ (by simp [ha]) (by simp [hc]) hx
+ rw [Real.norm_eq_abs]
+ calc |w x v| ≤ m * ‖v‖ / 2 * |(x - a) * (x - c)| := h
+ _ = m / 2 * |(x - a) * (x - c)| * ‖v‖ := by ring
+
+/-- **The cap from SP's normalized hypotheses (L2, L4, L5, L7, L11, L12).** With `m ≥ 2` (L2),
+slices `δ`-strongly concave for some `δ > r m (8m - 5)` (L4), slice derivatives at `y = 0` with
+second `x`-derivative bounded by `m` in the weak form (L5), critical points `h x` with
+`h(∓r/2) = 0` (L7) and the gap `b - s ≤ r³/6`, the conclusions of `ridge_capHyp_of_slices` hold.
+`hω`, `hωr` and `hcurv` are derived: `‖w‖ ≤ 2 m r²` (`slice_gradient_bound`) and
+`sp_curved_side_constants`. -/
+theorem ridge_capHyp_sp {f : ℝ × E → ℝ} {h : ℝ → E} {F : ℝ → ℝ} {w : ℝ → E →L[ℝ] ℝ}
+ {r m δ : ℝ} (hr : 0 < r) (hm : 2 ≤ m) (hδ : r * m * (8 * m - 5) < δ)
+ (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))
+ (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)
+ (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)
+ (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))
+ (hconc : ∀ x ∈ Icc (-2 * r) (r / 2),
+ StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))
+ (hball : ∀ x ∈ Icc (-2 * r) (r / 2), h x ∈ Metric.closedBall (0 : E) (2 * r))
+ (hcrit : ∀ x ∈ Icc (-2 * r) (r / 2),
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))
+ (hha : h (-r / 2) = 0) (hhc : h (r / 2) = 0)
+ (hw : ∀ x ∈ Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))
+ (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))
+ (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v - m * ‖v‖ / 2 * t ^ 2))
+ (hgap : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) ≤ r ^ 3 / 6) :
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, h (-r / 2))
+ (2 * r, h (2 * r)) (f (-r / 2, h (-r / 2))) (f (r / 2, h (r / 2))) ∧
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, h (r / 2)) → f x < f (r / 2, h (r / 2)) := by
+ have hm0 : 0 ≤ m := by linarith
+ have hδ0 : 0 < δ := by
+ have : 0 < r * m * (8 * m - 5) := by
+ have : 0 < 8 * m - 5 := by linarith
+ positivity
+ linarith
+ have ha : -r / 2 ∈ Icc (-2 * r) (r / 2) := ⟨by linarith, by linarith⟩
+ have hc : r / 2 ∈ Icc (-2 * r) (r / 2) := ⟨by linarith, le_rfl⟩
+ have hwa : w (-r / 2) = 0 := (hw _ ha).unique (by simpa [hha] using hcrit _ ha)
+ have hwc : w (r / 2) = 0 := (hw _ hc).unique (by simpa [hhc] using hcrit _ hc)
+ have hω : ∀ x ∈ Icc (-2 * r) (r / 2), ‖w x‖ ≤ 2 * m * r ^ 2 := by
+ intro x hx
+ have h1 := slice_gradient_bound hm0 hwcv hwcc ha hc (by linarith) hwa hwc hx
+ have h2 : |(x - -r / 2) * (x - r / 2)| ≤ 4 * r ^ 2 := by
+ rw [abs_le]
+ constructor <;> nlinarith [hx.1, hx.2]
+ calc ‖w x‖ ≤ m / 2 * |(x - -r / 2) * (x - r / 2)| := h1
+ _ ≤ m / 2 * (4 * r ^ 2) := by gcongr
+ _ = 2 * m * r ^ 2 := by ring
+ obtain ⟨hωr, hcurv⟩ := sp_curved_side_constants hr hm hδ (by positivity) le_rfl
+ refine ridge_capHyp_of_slices hr hδ0 hh hg hFa hFc hconv hconc hball hcrit hw hω hωr ?_ ?_
+ · calc 2 * δ * (f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2))) ≤ 2 * δ * (r ^ 3 / 6) := by
+ gcongr
+ _ < _ := hcurv
+ · have : r ^ 3 / 6 < 9 * r ^ 3 / 32 := by
+ have : 0 < r ^ 3 := by positivity
+ linarith
+ linarith
+
+/-- **L1 (the Hermite identity, as a bound).** If `g' = G` on `[a, c]`, `G` vanishes at both ends
+(the pins are critical) and `|G''| ≤ m` in the weak form, then `g(a) - g(c) ≤ m (c - a)³/12`.
+SP's identity `g(c) - g(a) = -(1/2)∫ φ g'''` with `∫ φ = (c - a)³/6` gives the same bound; here it
+comes from `two_node_bound` and monotonicity of `g + (m/2)Φ`, `Φ' = (t - a)(c - t)`. -/
+theorem hermite_gap_le {g G : ℝ → ℝ} {a c m : ℝ} (hac : a < c)
+ (hg : ∀ x ∈ Icc a c, HasDerivAt g (G x) x)
+ (hcv : ConvexOn ℝ (Icc a c) (fun t => G t + m / 2 * t ^ 2))
+ (hcc : ConcaveOn ℝ (Icc a c) (fun t => G t - m / 2 * t ^ 2))
+ (hGa : G a = 0) (hGc : G c = 0) :
+ g a - g c ≤ m * (c - a) ^ 3 / 12 := by
+ have hpoly : ∀ x, HasDerivAt (fun t => (c - a) * (t - a) ^ 2 / 2 - (t - a) ^ 3 / 3)
+ ((x - a) * (c - x)) x := by
+ intro x
+ have h1 : HasDerivAt (fun t => t - a) 1 x := (hasDerivAt_id x).sub_const a
+ have h2 := ((h1.pow 2).const_mul (c - a)).div_const 2
+ have h3 := (h1.pow 3).div_const 3
+ convert h2.sub h3 using 1
+ push_cast
+ ring
+ set k : ℝ → ℝ := fun t => g t + m / 2 * ((c - a) * (t - a) ^ 2 / 2 - (t - a) ^ 3 / 3)
+ with hk
+ have hkd : ∀ x ∈ Icc a c, HasDerivAt k (G x + m / 2 * ((x - a) * (c - x))) x :=
+ fun x hx => (hg x hx).add ((hpoly x).const_mul (m / 2))
+ have hmono : MonotoneOn k (Icc a c) := by
+ refine monotoneOn_of_hasDerivWithinAt_nonneg (convex_Icc a c)
+ (fun x hx => (hkd x hx).continuousAt.continuousWithinAt)
+ (fun x hx => (hkd x (interior_subset hx)).hasDerivWithinAt) (fun x hx => ?_)
+ have hx := interior_subset hx
+ have hb := two_node_bound hcv hcc (left_mem_Icc.mpr hac.le) (right_mem_Icc.mpr hac.le) hac
+ hGa hGc hx
+ have hP : (x - a) * (x - c) ≤ 0 :=
+ mul_nonpos_of_nonneg_of_nonpos (by linarith [hx.1]) (by linarith [hx.2])
+ rw [abs_of_nonpos hP] at hb
+ have := (abs_le.mp hb).1
+ nlinarith
+ have hkac := hmono (left_mem_Icc.mpr hac.le) (right_mem_Icc.mpr hac.le) hac.le
+ simp only [hk] at hkac
+ have e0 : m / 2 * ((c - a) * (a - a) ^ 2 / 2 - (a - a) ^ 3 / 3) = 0 := by ring
+ have e1 : m / 2 * ((c - a) * (c - a) ^ 2 / 2 - (c - a) ^ 3 / 3) = m * (c - a) ^ 3 / 12 := by
+ ring
+ linarith
+
+/-- **L2 (`m ≥ 2`).** Under SP's normalization `g(-r/2) - g(r/2) = r³/6` on the pin interval, the
+weak bound `|g'''| ≤ m` forces `m ≥ 2`. -/
+theorem hermite_m_ge_two {g G : ℝ → ℝ} {r m : ℝ} (hr : 0 < r)
+ (hg : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt g (G x) x)
+ (hcv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G t + m / 2 * t ^ 2))
+ (hcc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G t - m / 2 * t ^ 2))
+ (hGa : G (-r / 2) = 0) (hGc : G (r / 2) = 0) (hgap : g (-r / 2) - g (r / 2) = r ^ 3 / 6) :
+ 2 ≤ m := by
+ have h := hermite_gap_le (by linarith) hg hcv hcc hGa hGc
+ have hcr : r / 2 - -r / 2 = r := by ring
+ rw [hgap, hcr] at h
+ have hr3 : 0 < r ^ 3 := by positivity
+ nlinarith
+
+/-- **The cap from SP's normalization (L1, L2 and the rest of `ridge_capHyp_sp`).** As
+`ridge_capHyp_sp`, with `m ≥ 2` derived instead of assumed: `g0 = f(·, 0)` has derivative `G0`
+vanishing at the pins with `|G0''| ≤ m` (weak form), and the gap is exactly `r³/6`. -/
+theorem ridge_capHyp_normalized {f : ℝ × E → ℝ} {h : ℝ → E} {F G0 : ℝ → ℝ}
+ {w : ℝ → E →L[ℝ] ℝ} {r m δ : ℝ} (hr : 0 < r)
+ (hg0 : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt (fun x => f (x, 0)) (G0 x) x)
+ (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G0 t + m / 2 * t ^ 2))
+ (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G0 t - m / 2 * t ^ 2))
+ (hG0a : G0 (-r / 2) = 0) (hG0c : G0 (r / 2) = 0)
+ (hδ : r * m * (8 * m - 5) < δ)
+ (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))
+ (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)
+ (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)
+ (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))
+ (hconc : ∀ x ∈ Icc (-2 * r) (r / 2),
+ StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))
+ (hball : ∀ x ∈ Icc (-2 * r) (r / 2), h x ∈ Metric.closedBall (0 : E) (2 * r))
+ (hcrit : ∀ x ∈ Icc (-2 * r) (r / 2),
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))
+ (hha : h (-r / 2) = 0) (hhc : h (r / 2) = 0)
+ (hw : ∀ x ∈ Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))
+ (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))
+ (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v - m * ‖v‖ / 2 * t ^ 2))
+ (hnorm : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) = r ^ 3 / 6) :
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, h (-r / 2))
+ (2 * r, h (2 * r)) (f (-r / 2, h (-r / 2))) (f (r / 2, h (r / 2))) ∧
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, h (r / 2)) → f x < f (r / 2, h (r / 2)) := by
+ have hm : 2 ≤ m := hermite_m_ge_two hr hg0 hG0cv hG0cc hG0a hG0c (by simpa [hha, hhc] using hnorm)
+ exact ridge_capHyp_sp hr hm hδ hh hg hFa hFc hconv hconc hball hcrit hha hhc hw hwcv hwcc
+ hnorm.le
+
+/-- **Second-order condition for strong concavity.** If `φ` has derivative `Dφ` and `Dφ` has
+derivative `H` at every point of the convex set `K`, and `H y v v ≤ -δ ‖v‖²` there, then `φ` is
+`δ`-strongly concave on `K`. Along each segment, `φ(x + t v) + (δ/2)‖v‖² t²` has a nonpositive
+second derivative, so it is concave on `[0, 1]`. -/
+theorem strongConcaveOn_of_hessian {K : Set E} {φ : E → ℝ} {Dφ : E → E →L[ℝ] ℝ}
+ {H : E → E →L[ℝ] E →L[ℝ] ℝ} {δ : ℝ} (hK : Convex ℝ K)
+ (hD : ∀ y ∈ K, HasFDerivAt φ (Dφ y) y) (hH : ∀ y ∈ K, HasFDerivAt Dφ (H y) y)
+ (hneg : ∀ y ∈ K, ∀ v : E, H y v v ≤ -δ * ‖v‖ ^ 2) : StrongConcaveOn K δ φ := by
+ refine ⟨hK, fun x hx y hy a b ha hb hab => ?_⟩
+ set v := y - x with hv
+ have hmem : ∀ t ∈ Icc (0 : ℝ) 1, x + t • v ∈ K := fun t ht => hK.add_smul_sub_mem hx hy ht
+ set ψ : ℝ → ℝ := fun t => φ (x + t • v) + δ / 2 * ‖v‖ ^ 2 * t ^ 2 with hψ
+ set ψ' : ℝ → ℝ := fun t => Dφ (x + t • v) v + δ * ‖v‖ ^ 2 * t with hψ'
+ set ψ'' : ℝ → ℝ := fun t => H (x + t • v) v v + δ * ‖v‖ ^ 2 with hψ''
+ have hline : ∀ t : ℝ, HasDerivAt (fun s : ℝ => x + s • v) v t := fun t => by
+ simpa using ((hasDerivAt_id t).smul_const v).const_add x
+ have hd1 : ∀ t ∈ Icc (0 : ℝ) 1, HasDerivAt ψ (ψ' t) t := by
+ intro t ht
+ have h1 : HasDerivAt (fun s => φ (x + s • v)) (Dφ (x + t • v) v) t :=
+ (hD _ (hmem t ht)).comp_hasDerivAt t (hline t)
+ have h2 : HasDerivAt (fun s : ℝ => δ / 2 * ‖v‖ ^ 2 * s ^ 2) (δ * ‖v‖ ^ 2 * t) t := by
+ convert (hasDerivAt_pow 2 t).const_mul (δ / 2 * ‖v‖ ^ 2) using 1
+ push_cast
+ ring
+ exact h1.add h2
+ have hd2 : ∀ t ∈ Icc (0 : ℝ) 1, HasDerivAt ψ' (ψ'' t) t := by
+ intro t ht
+ have h1 : HasDerivAt (fun s => Dφ (x + s • v)) (H (x + t • v) v) t :=
+ (hH _ (hmem t ht)).comp_hasDerivAt t (hline t)
+ have h1' : HasDerivAt (fun s => Dφ (x + s • v) v) (H (x + t • v) v v) t := by
+ simpa using h1.clm_apply (hasDerivAt_const t v)
+ have h2 : HasDerivAt (fun s : ℝ => δ * ‖v‖ ^ 2 * s) (δ * ‖v‖ ^ 2) t := by
+ simpa using (hasDerivAt_id t).const_mul (δ * ‖v‖ ^ 2)
+ exact h1'.add h2
+ have hcc : ConcaveOn ℝ (Icc (0 : ℝ) 1) ψ := by
+ refine concaveOn_of_hasDerivWithinAt2_nonpos (convex_Icc 0 1)
+ (fun t ht => (hd1 t ht).continuousAt.continuousWithinAt)
+ (fun t ht => (hd1 t (interior_subset ht)).hasDerivWithinAt)
+ (fun t ht => (hd2 t (interior_subset ht)).hasDerivWithinAt) (fun t ht => ?_)
+ have := hneg _ (hmem t (interior_subset ht)) v
+ simp only [hψ'']
+ linarith
+ have key := hcc.2 (left_mem_Icc.mpr zero_le_one) (right_mem_Icc.mpr zero_le_one) ha hb hab
+ simp only [hψ, smul_eq_mul, mul_zero, zero_smul, add_zero, mul_one, one_smul, zero_add] at key
+ have hab' : a = 1 - b := by linarith
+ have hpt : a • x + b • y = x + b • v := by
+ rw [hab', hv, smul_sub, sub_smul, one_smul]; abel
+ have hn : ‖x - y‖ = ‖v‖ := by rw [hv, norm_sub_rev]
+ rw [hpt, hn, smul_eq_mul, smul_eq_mul]
+ have hxv : x + v = y := by rw [hv]; abel
+ rw [hxv] at key
+ show a * φ x + b * φ y + a * b * (δ / 2 * ‖v‖ ^ 2) ≤ φ (x + b • v)
+ rw [hab'] at key ⊢
+ linear_combination key
+
+/-- **L3–L4 (the transverse Hessian bound).** If the transverse Hessian `H` satisfies
+`H(M) ≤ -λ` (SP's `λ = λ_min(-D_y² f(M))`) and its increments from `M = (-r/2, 0)` are bounded by
+`m (|Δx| + ‖Δy‖)` (L3, with `m` bounding the third-derivative blocks), then `H(p) ≤ -(λ - 5rm)`
+on the cap. The increment is at most `3r/2 + 2r ≤ 5r` there; SP bounds it on all of `D` by
+`9r/2 < 5r`. -/
+theorem transverse_hessian_le {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {r m lam : ℝ} (hr : 0 < r)
+ (hm : 0 ≤ m)
+ (hlip : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖))
+ (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) :
+ ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,
+ H p v v ≤ -(lam - 5 * r * m) * ‖v‖ ^ 2 := by
+ rintro ⟨x, y⟩ ⟨hx, hy⟩ v
+ have hy' : ‖y‖ ≤ 2 * r := by simpa using hy
+ have hdx : |x - -r / 2| ≤ 3 * r / 2 := by
+ rw [abs_le]; constructor <;> linarith [hx.1, hx.2]
+ have hinc : ‖H (x, y) - H (-r / 2, 0)‖ ≤ 5 * r * m := by
+ have := hlip (x, y) ⟨hx, hy⟩
+ calc ‖H (x, y) - H (-r / 2, 0)‖ ≤ m * (|x - -r / 2| + ‖y‖) := this
+ _ ≤ m * (3 * r / 2 + 2 * r) := by gcongr
+ _ ≤ 5 * r * m := by nlinarith
+ have hsplit : H (x, y) v v = H (-r / 2, 0) v v + (H (x, y) - H (-r / 2, 0)) v v := by
+ simp
+ have hb := (H (x, y) - H (-r / 2, 0)).le_opNorm₂ v v
+ have hb' : (H (x, y) - H (-r / 2, 0)) v v ≤ 5 * r * m * ‖v‖ ^ 2 := by
+ have h1 := (le_abs_self _).trans (by simpa [Real.norm_eq_abs] using hb)
+ calc (H (x, y) - H (-r / 2, 0)) v v ≤ ‖H (x, y) - H (-r / 2, 0)‖ * ‖v‖ * ‖v‖ := h1
+ _ ≤ 5 * r * m * ‖v‖ * ‖v‖ := by gcongr
+ _ = 5 * r * m * ‖v‖ ^ 2 := by ring
+ rw [hsplit]
+ have := hlam v
+ nlinarith
+
+/-- **L3 (increments of the transverse Hessian).** If `x ↦ H (x, 0)` has derivative `Hx x` with
+`‖Hx x‖ ≤ m` on `[-2r, r/2]` (the block `∂_x D_y² f`), and along each ray `s ↦ H (x, s • y)`,
+`s ∈ [0, 1]`, the derivative `Hr p s` has `‖Hr p s‖ ≤ m ‖y‖` (the block `D_y³ f` applied to `y`),
+then moving first in `x` along `y = 0` and then along the ray gives `‖H p - H M‖ ≤ m (|Δx| + ‖Δy‖)`
+from `M = (-r/2, 0)`, by the mean value inequality. -/
+theorem hessian_increment {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}
+ {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m : ℝ} (hr : 0 < r)
+ (hHx : ∀ x ∈ Icc (-2 * r) (r / 2), HasDerivAt (fun t => H (t, 0)) (Hx x) x)
+ (hHxb : ∀ x ∈ Icc (-2 * r) (r / 2), ‖Hx x‖ ≤ m)
+ (hHr : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ s ∈ Icc (0 : ℝ) 1,
+ HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)
+ (hHrb : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ s ∈ Icc (0 : ℝ) 1,
+ ‖Hr p s‖ ≤ m * ‖p.2‖) :
+ ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖) := by
+ rintro ⟨x, y⟩ hp
+ have hx := hp.1
+ have h1 : ‖H (x, (1 : ℝ) • y) - H (x, (0 : ℝ) • y)‖ ≤ m * ‖y‖ * ‖(1 : ℝ) - 0‖ :=
+ (convex_Icc (0 : ℝ) 1).norm_image_sub_le_of_norm_hasDerivWithin_le
+ (f := fun s : ℝ => H (x, s • y)) (fun s hs => (hHr (x, y) hp s hs).hasDerivWithinAt)
+ (fun s hs => hHrb (x, y) hp s hs) (left_mem_Icc.mpr zero_le_one)
+ (right_mem_Icc.mpr zero_le_one)
+ have ha : -r / 2 ∈ Icc (-2 * r) (r / 2) := ⟨by linarith, by linarith⟩
+ have h2 : ‖H (x, 0) - H (-r / 2, 0)‖ ≤ m * ‖x - -r / 2‖ :=
+ (convex_Icc (-2 * r) (r / 2)).norm_image_sub_le_of_norm_hasDerivWithin_le
+ (f := fun t => H (t, 0)) (fun t ht => (hHx t ht).hasDerivWithinAt) hHxb ha hx
+ simp only [one_smul, zero_smul, sub_zero, norm_one, mul_one] at h1
+ rw [Real.norm_eq_abs] at h2
+ calc ‖H (x, y) - H (-r / 2, 0)‖ ≤ ‖H (x, y) - H (x, 0)‖ + ‖H (x, 0) - H (-r / 2, 0)‖ :=
+ norm_sub_le_norm_sub_add_norm_sub (H (x, y)) (H (x, 0)) (H (-r / 2, 0))
+ _ ≤ m * ‖y‖ + m * |x - -r / 2| := add_le_add h1 h2
+ _ = m * (|(x, y).1 - -r / 2| + ‖(x, y).2‖) := by simp only; ring
+
+/-- **L4 (strong concavity of the slices).** Under `transverse_hessian_le`'s hypotheses, with the
+slice derivatives `Dφ` and Hessians `H` given on the cap, every slice `y ↦ f (x, y)`,
+`x ∈ [-2r, r/2]`, is `(λ - 5rm)`-strongly concave on `B̄(0, 2r)`. -/
+theorem slices_strongConcave {f : ℝ × E → ℝ} {Dφ : ℝ × E → E →L[ℝ] ℝ}
+ {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {r m lam : ℝ} (hr : 0 < r) (hm : 0 ≤ m)
+ (hD : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => f (p.1, y)) (Dφ p) p.2)
+ (hH : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => Dφ (p.1, y)) (H p) p.2)
+ (hlip : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖))
+ (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) :
+ ∀ x ∈ Icc (-2 * r) (r / 2),
+ StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) (lam - 5 * r * m) (fun y => f (x, y)) := by
+ intro x hx
+ have hbd := transverse_hessian_le hr hm hlip hlam
+ exact strongConcaveOn_of_hessian (Dφ := fun y => Dφ (x, y)) (H := fun y => H (x, y))
+ (convex_closedBall _ _) (fun y hy => hD (x, y) ⟨hx, hy⟩) (fun y hy => hH (x, y) ⟨hx, hy⟩)
+ (fun y hy v => hbd (x, y) ⟨hx, hy⟩ v)
+
+/-- **The cap from SP's hypothesis (H1) (L1–L5, L7, L8, L11, L18).** As `ridge_capHyp_normalized`,
+with the slice strong concavity and `δ > rm(8m - 5)` derived from Hessian data: the slice
+derivatives and Hessians on the cap, the increment bound of `H` from `M` with constant `m`,
+`H(M) ≤ -λ`, and (H1) `8 r m² < λ`. Then `δ = λ - 5rm > rm(8m - 5)`. -/
+theorem ridge_capHyp_H1 {f : ℝ × E → ℝ} {h : ℝ → E} {F G0 : ℝ → ℝ}
+ {w : ℝ → E →L[ℝ] ℝ} {Dφ : ℝ × E → E →L[ℝ] ℝ} {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ}
+ {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ} {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam : ℝ} (hr : 0 < r)
+ (hg0 : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt (fun x => f (x, 0)) (G0 x) x)
+ (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G0 t + m / 2 * t ^ 2))
+ (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G0 t - m / 2 * t ^ 2))
+ (hG0a : G0 (-r / 2) = 0) (hG0c : G0 (r / 2) = 0)
+ (hD : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => f (p.1, y)) (Dφ p) p.2)
+ (hH : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => Dφ (p.1, y)) (H p) p.2)
+ (hHx : ∀ x ∈ Icc (-2 * r) (r / 2), HasDerivAt (fun t => H (t, 0)) (Hx x) x)
+ (hHxb : ∀ x ∈ Icc (-2 * r) (r / 2), ‖Hx x‖ ≤ m)
+ (hHr : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ s ∈ Icc (0 : ℝ) 1,
+ HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)
+ (hHrb : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ s ∈ Icc (0 : ℝ) 1,
+ ‖Hr p s‖ ≤ m * ‖p.2‖)
+ (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)
+ (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))
+ (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)
+ (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)
+ (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))
+ (hball : ∀ x ∈ Icc (-2 * r) (r / 2), h x ∈ Metric.closedBall (0 : E) (2 * r))
+ (hcrit : ∀ x ∈ Icc (-2 * r) (r / 2),
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))
+ (hha : h (-r / 2) = 0) (hhc : h (r / 2) = 0)
+ (hw : ∀ x ∈ Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))
+ (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))
+ (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v - m * ‖v‖ / 2 * t ^ 2))
+ (hnorm : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) = r ^ 3 / 6) :
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, h (-r / 2))
+ (2 * r, h (2 * r)) (f (-r / 2, h (-r / 2))) (f (r / 2, h (r / 2))) ∧
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, h (r / 2)) → f x < f (r / 2, h (r / 2)) := by
+ have hm : 2 ≤ m :=
+ hermite_m_ge_two hr hg0 hG0cv hG0cc hG0a hG0c (by simpa [hha, hhc] using hnorm)
+ have hlip := hessian_increment hr hHx hHxb hHr hHrb
+ have hconc := slices_strongConcave hr (by linarith) hD hH hlip hlam
+ have hδ : r * m * (8 * m - 5) < lam - 5 * r * m := by nlinarith
+ exact ridge_capHyp_normalized hr hg0 hG0cv hG0cc hG0a hG0c hδ hh hg hFa hFc hconv hconc hball
+ hcrit hha hhc hw hwcv hwcc hnorm
+
+/-- **L7 (uniqueness of the transverse critical point).** A `δ`-strongly concave slice, `δ > 0`,
+has at most one critical point in `K`. -/
+theorem slice_critical_unique {K : Set E} {φ : E → ℝ} {δ : ℝ} (hφ : StrongConcaveOn K δ φ)
+ (hδ : 0 < δ) {p q : E} (hp : p ∈ K) (hq : q ∈ K) (hdp : HasFDerivAt φ (0 : E →L[ℝ] ℝ) p)
+ (hdq : HasFDerivAt φ (0 : E →L[ℝ] ℝ) q) : p = q := by
+ have h1 := slice_le hφ hp hdp hq
+ have h2 := slice_le hφ hq hdq hp
+ rw [norm_sub_rev] at h2
+ have h3 : δ * ‖q - p‖ ^ 2 ≤ 0 := by linarith
+ have h4 : ‖q - p‖ ^ 2 ≤ 0 := by
+ have : δ * ‖q - p‖ ^ 2 ≤ δ * 0 := by rw [mul_zero]; exact h3
+ exact le_of_mul_le_mul_left this hδ
+ have h5 : ‖q - p‖ = 0 := by nlinarith [norm_nonneg (q - p)]
+ exact (sub_eq_zero.mp (norm_eq_zero.mp h5)).symm
+
+/-- **L7 (existence of the transverse critical point).** If the slice is `δ`-strongly concave and
+differentiable on `B̄(0, R)` and its derivative at `0` has norm `< δR` (SP: `‖w‖ < δ · 2r`), the
+maximum over the compact ball is attained in the open ball, so it is a critical point. On the
+sphere the radial derivative is `≤ w(p) - δR² < 0` (SP's L7 computation, here from the strong
+concavity engine), which contradicts maximality. -/
+theorem slice_critical_exists [ProperSpace E] {φ : E → ℝ} {Dφ : E → E →L[ℝ] ℝ} {δ R : ℝ}
+ (hR : 0 < R) (hφ : StrongConcaveOn (Metric.closedBall (0 : E) R) δ φ)
+ (hD : ∀ y ∈ Metric.closedBall (0 : E) R, HasFDerivAt φ (Dφ y) y) (hw : ‖Dφ 0‖ < δ * R) :
+ ∃ p ∈ Metric.ball (0 : E) R, HasFDerivAt φ (0 : E →L[ℝ] ℝ) p := by
+ have h0 : (0 : E) ∈ Metric.closedBall (0 : E) R := Metric.mem_closedBall_self hR.le
+ have hcont : ContinuousOn φ (Metric.closedBall (0 : E) R) :=
+ fun y hy => (hD y hy).continuousAt.continuousWithinAt
+ obtain ⟨p, hp, hmax⟩ := (isCompact_closedBall (0 : E) R).exists_isMaxOn ⟨0, h0⟩ hcont
+ have hpR : ‖p‖ ≤ R := by simpa using hp
+ have hlt : ‖p‖ < R := by
+ by_contra hc
+ have hpn : ‖p‖ = R := le_antisymm hpR (not_lt.mp hc)
+ have hseg : segment ℝ p (p + -p) ⊆ Metric.closedBall (0 : E) R := by
+ rw [add_neg_cancel]
+ exact (convex_closedBall (0 : E) R).segment_subset hp h0
+ have hcone := mem_posTangentConeAt_of_segment_subset hseg
+ have hnp := hmax.isLocalMaxOn.hasFDerivWithinAt_nonpos (hD p hp).hasFDerivWithinAt hcone
+ have e1 := strongConcave_le_of_hasFDerivAt hφ hp (hD p hp) h0
+ have e2 := strongConcave_le_of_hasFDerivAt hφ h0 (hD 0 h0) hp
+ simp only [zero_sub, sub_zero, norm_neg, map_neg] at e1 e2 hnp
+ have hb : Dφ 0 p ≤ ‖Dφ 0‖ * ‖p‖ :=
+ (le_abs_self _).trans (by simpa [Real.norm_eq_abs] using (Dφ 0).le_opNorm p)
+ rw [hpn] at e1 e2 hb
+ have : ‖Dφ 0‖ * R < δ * R * R := by nlinarith
+ nlinarith
+ have hpb : p ∈ Metric.ball (0 : E) R := by simpa using hlt
+ have hloc : IsLocalMax φ p :=
+ hmax.isLocalMax (Metric.closedBall_mem_nhds_of_mem hpb)
+ refine ⟨p, hpb, ?_⟩
+ have hz := hloc.hasFDerivAt_eq_zero (hD p hp)
+ rw [← hz]
+ exact hD p hp
+
+/-- In finite dimension, a bilinear form `A : E →L E →L ℝ` with `A v v ≤ -δ‖v‖²`, `δ > 0`, is
+invertible as a map `E → E*` (SP L7: "`D_y² f` invertible"). -/
+theorem isInvertible_of_negDef [FiniteDimensional ℝ E] {A : E →L[ℝ] E →L[ℝ] ℝ} {δ : ℝ}
+ (hδ : 0 < δ) (hA : ∀ v : E, A v v ≤ -δ * ‖v‖ ^ 2) : A.IsInvertible := by
+ have hinj : Function.Injective A := by
+ intro v w hvw
+ have h1 : A (v - w) = 0 := by rw [map_sub, hvw, sub_self]
+ have h2 := hA (v - w)
+ rw [h1, zero_apply] at h2
+ have h3 : ‖v - w‖ ^ 2 ≤ 0 := by nlinarith [sq_nonneg ‖v - w‖]
+ have h4 : ‖v - w‖ = 0 := by nlinarith [norm_nonneg (v - w)]
+ exact sub_eq_zero.mp (norm_eq_zero.mp h4)
+ have hrank : Module.finrank ℝ E = Module.finrank ℝ (E →L[ℝ] ℝ) := by
+ rw [← (LinearMap.toContinuousLinearMap : (E →ₗ[ℝ] ℝ) ≃ₗ[ℝ] E →L[ℝ] ℝ).finrank_eq]
+ exact (Subspace.dual_finrank_eq).symm
+ have hsurj : Function.Surjective A :=
+ (LinearMap.injective_iff_surjective_of_finrank_eq_finrank hrank (f := (A : E →ₗ[ℝ] E →L[ℝ] ℝ))).mp hinj
+ refine ⟨(LinearEquiv.ofBijective (A : E →ₗ[ℝ] E →L[ℝ] ℝ) ⟨hinj, hsurj⟩).toContinuousLinearEquiv, ?_⟩
+ ext v w
+ rfl
+
+/-- **L7 (regularity of the ridge, pointwise).** If the transverse gradient `G` is strictly
+differentiable at `(x0, h x0)` with invertible transverse part, `h x0` is a critical point, and
+near `x0` the critical point of each slice in a neighbourhood `K` of `h x0` is unique and equal to
+`h x`, then `h` agrees near `x0` with the implicit function of `G = 0` (Mathlib's
+`implicitFunctionOfProdDomain`), so `h` is strictly differentiable at `x0` with
+`h' = -(∂_y G)⁻¹ ∂_x G` (SP L9's formula). -/
+theorem ridge_hasStrictFDerivAt [CompleteSpace E] {f : ℝ × E → ℝ} {G : ℝ × E → E →L[ℝ] ℝ}
+ {DG : ℝ × E →L[ℝ] E →L[ℝ] ℝ} {h : ℝ → E} {K : Set E} {x0 : ℝ}
+ (hGs : HasStrictFDerivAt G DG (x0, h x0))
+ (hinv : (DG ∘L ContinuousLinearMap.inr ℝ ℝ E).IsInvertible)
+ (hG : ∀ᶠ v in 𝓝 (x0, h x0), HasFDerivAt (fun y => f (v.1, y)) (G v) v.2)
+ (hcrit0 : HasFDerivAt (fun y => f (x0, y)) (0 : E →L[ℝ] ℝ) (h x0)) (hK : K ∈ 𝓝 (h x0))
+ (huniq : ∀ᶠ x in 𝓝 x0, ∀ y ∈ K, HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) y → y = h x) :
+ HasStrictFDerivAt h (-(DG ∘L ContinuousLinearMap.inr ℝ ℝ E).inverse ∘L
+ (DG ∘L ContinuousLinearMap.inl ℝ ℝ E)) x0 := by
+ have hGu : G (x0, h x0) = 0 := (hG.self_of_nhds).unique hcrit0
+ have hψ := hGs.hasStrictFDerivAt_implicitFunctionOfProdDomain hinv
+ have hev := hGs.eventually_apply_implicitFunctionOfProdDomain hinv
+ have htend := hGs.tendsto_implicitFunctionOfProdDomain hinv
+ set ψ := hGs.implicitFunctionOfProdDomain hinv with hψdef
+ have hpair : Tendsto (fun x => (x, ψ x)) (𝓝 x0) (𝓝 (x0, h x0)) :=
+ (tendsto_id.prodMk_nhds htend)
+ have hGψ := hpair.eventually hG
+ have hKψ := htend.eventually hK
+ have heq : ψ =ᶠ[𝓝 x0] h := by
+ filter_upwards [hev, hGψ, hKψ, huniq] with x h1 h2 h3 h4
+ rw [h1, hGu] at h2
+ exact h4 (ψ x) h3 h2
+ exact hψ.congr_of_eventuallyEq heq
+
+
+/-- **L7 (regularity of the ridge on `[-2r, 2r]`).** With the slices `δ`-strongly concave and `h x` a
+critical point in `B̄(0, 2r)` for `x` in an open set `U ⊇ [-2r, 2r]` (SP: `f ∈ C⁴` near `D`), `h x`
+in the open ball on `[-2r, 2r]`, and the transverse gradient strictly differentiable along the
+ridge with negative definite transverse part, `h` is strictly differentiable at every
+`x ∈ [-2r, 2r]`. Composed with `ridge_inputs_of_joint`, as `ridge_capHyp_source` does, this supplies
+its `hh'`. -/
+theorem ridge_differentiable [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {G : ℝ × E → E →L[ℝ] ℝ}
+ {DG : ℝ → ℝ × E →L[ℝ] E →L[ℝ] ℝ} {h : ℝ → E} {U : Set ℝ} {r δ : ℝ} (hδ : 0 < δ)
+ (hU : IsOpen U) (hIU : Icc (-2 * r) (2 * r) ⊆ U)
+ (hconc : ∀ x ∈ U,
+ StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))
+ (hball : ∀ x ∈ U, h x ∈ Metric.closedBall (0 : E) (2 * r))
+ (hcrit : ∀ x ∈ U, HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))
+ (hint : ∀ x ∈ Icc (-2 * r) (2 * r), h x ∈ Metric.ball (0 : E) (2 * r))
+ (hG : ∀ x ∈ Icc (-2 * r) (2 * r),
+ ∀ᶠ v in 𝓝 (x, h x), HasFDerivAt (fun y => f (v.1, y)) (G v) v.2)
+ (hGs : ∀ x ∈ Icc (-2 * r) (2 * r), HasStrictFDerivAt G (DG x) (x, h x))
+ (hneg : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ v : E,
+ (DG x ∘L ContinuousLinearMap.inr ℝ ℝ E) v v ≤ -δ * ‖v‖ ^ 2) :
+ ∀ x ∈ Icc (-2 * r) (2 * r), HasStrictFDerivAt h
+ (-(DG x ∘L ContinuousLinearMap.inr ℝ ℝ E).inverse ∘L (DG x ∘L ContinuousLinearMap.inl ℝ ℝ E)) x := by
+ intro x hx
+ have hK : Metric.closedBall (0 : E) (2 * r) ∈ 𝓝 (h x) :=
+ Metric.closedBall_mem_nhds_of_mem (hint x hx)
+ have huniq : ∀ᶠ x' in 𝓝 x, ∀ y ∈ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => f (x', y)) (0 : E →L[ℝ] ℝ) y → y = h x' := by
+ filter_upwards [hU.mem_nhds (hIU hx)] with x' hx' y hy hdy
+ exact slice_critical_unique (hconc x' hx') hδ hy (hball x' hx') hdy (hcrit x' hx')
+ exact ridge_hasStrictFDerivAt (hGs x hx) (isInvertible_of_negDef hδ (hneg x hx)) (hG x hx)
+ (hcrit x (hIU hx)) hK huniq
+
+
+/-- **L7 (existence of the ridge).** If on an open set `U` of `x`-values the slices are
+`δ`-strongly concave and differentiable on `B̄(0, 2r)` with `‖∂_y f(x, 0)‖ < δ · 2r`, a map `h`
+with `h x` a critical point in the open ball exists on `U` (by choice; unique by
+`slice_critical_unique`). -/
+theorem ridge_exists [ProperSpace E] {f : ℝ × E → ℝ} {Dφ : ℝ → E → E →L[ℝ] ℝ} {U : Set ℝ}
+ {r δ : ℝ} (hr : 0 < r)
+ (hconc : ∀ x ∈ U,
+ StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))
+ (hD : ∀ x ∈ U, ∀ y ∈ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => f (x, y)) (Dφ x y) y)
+ (hw : ∀ x ∈ U, ‖Dφ x 0‖ < δ * (2 * r)) :
+ ∃ h : ℝ → E, ∀ x ∈ U, h x ∈ Metric.ball (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x) := by
+ have hex : ∀ x : ℝ, ∃ p : E, x ∈ U → p ∈ Metric.ball (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) p := by
+ intro x
+ by_cases hx : x ∈ U
+ · obtain ⟨p, hp, hdp⟩ := slice_critical_exists (by positivity) (hconc x hx) (hD x hx) (hw x hx)
+ exact ⟨p, fun _ => ⟨hp, hdp⟩⟩
+ · exact ⟨0, fun h => absurd h hx⟩
+ choose h hh using hex
+ exact ⟨h, fun x hx => hh x hx⟩
+
+/-! ### The full domain (v1.8)
+
+SP proves L4 on all of `D`, where the increment from `M` is at most `9r/2 < 5r`, and assumes
+`f ∈ C⁴` near `D`. The lemmas below take the source data on a collar `x ∈ [-2r - ε, 2r + ε]`,
+`0 < ε ≤ r/2`, where `|x + r/2| ≤ 3r` keeps the increment at most `5r`. So every slice over the open
+set `(-2r - ε, 2r + ε) ⊇ [-2r, 2r]` is `(λ - 5rm)`-strongly concave, which is what the L7 lemmas
+need, and `ridge_capHyp_source` composes L7 with the cap. -/
+
+/-- **L3 on the full domain.** As `hessian_increment`, with the `x`-range `[-2r - ε, 2r + ε]`. -/
+theorem hessian_increment_D {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}
+ {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m ε : ℝ} (hr : 0 < r) (hε : 0 < ε)
+ (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)
+ (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)
+ (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)
+ (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖) :
+ ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖) := by
+ rintro ⟨x, y⟩ hp
+ have hx := hp.1
+ have h1 : ‖H (x, (1 : ℝ) • y) - H (x, (0 : ℝ) • y)‖ ≤ m * ‖y‖ * ‖(1 : ℝ) - 0‖ :=
+ (convex_Icc (0 : ℝ) 1).norm_image_sub_le_of_norm_hasDerivWithin_le
+ (f := fun s : ℝ => H (x, s • y)) (fun s hs => (hHr (x, y) hp s hs).hasDerivWithinAt)
+ (fun s hs => hHrb (x, y) hp s hs) (left_mem_Icc.mpr zero_le_one)
+ (right_mem_Icc.mpr zero_le_one)
+ have ha : -r / 2 ∈ Icc (-2 * r - ε) (2 * r + ε) := ⟨by linarith, by linarith⟩
+ have h2 : ‖H (x, 0) - H (-r / 2, 0)‖ ≤ m * ‖x - -r / 2‖ :=
+ (convex_Icc (-2 * r - ε) (2 * r + ε)).norm_image_sub_le_of_norm_hasDerivWithin_le
+ (f := fun t => H (t, 0)) (fun t ht => (hHx t ht).hasDerivWithinAt) hHxb ha hx
+ simp only [one_smul, zero_smul, sub_zero, norm_one, mul_one] at h1
+ rw [Real.norm_eq_abs] at h2
+ calc ‖H (x, y) - H (-r / 2, 0)‖ ≤ ‖H (x, y) - H (x, 0)‖ + ‖H (x, 0) - H (-r / 2, 0)‖ :=
+ norm_sub_le_norm_sub_add_norm_sub (H (x, y)) (H (x, 0)) (H (-r / 2, 0))
+ _ ≤ m * ‖y‖ + m * |x - -r / 2| := add_le_add h1 h2
+ _ = m * (|(x, y).1 - -r / 2| + ‖(x, y).2‖) := by simp only; ring
+
+/-- **L4's Hessian bound on the full domain.** As `transverse_hessian_le`, for
+`x ∈ [-2r - ε, 2r + ε]` with `0 < ε ≤ r/2`: there `|x + r/2| ≤ 3r`, so the increment is still at
+most `5r`. -/
+theorem transverse_hessian_le_D {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ}
+ (hm : 0 ≤ m) (hε : 0 < ε) (hεr : ε ≤ r / 2)
+ (hlip : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖))
+ (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) :
+ ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,
+ H p v v ≤ -(lam - 5 * r * m) * ‖v‖ ^ 2 := by
+ rintro ⟨x, y⟩ ⟨hx, hy⟩ v
+ have hy' : ‖y‖ ≤ 2 * r := by simpa using hy
+ have hdx : |x - -r / 2| ≤ 3 * r := by
+ rw [abs_le]; constructor <;> linarith [hx.1, hx.2]
+ have hinc : ‖H (x, y) - H (-r / 2, 0)‖ ≤ 5 * r * m := by
+ have := hlip (x, y) ⟨hx, hy⟩
+ calc ‖H (x, y) - H (-r / 2, 0)‖ ≤ m * (|x - -r / 2| + ‖y‖) := this
+ _ ≤ m * (3 * r + 2 * r) := by gcongr
+ _ = 5 * r * m := by ring
+ have hsplit : H (x, y) v v = H (-r / 2, 0) v v + (H (x, y) - H (-r / 2, 0)) v v := by
+ simp
+ have hb := (H (x, y) - H (-r / 2, 0)).le_opNorm₂ v v
+ have hb' : (H (x, y) - H (-r / 2, 0)) v v ≤ 5 * r * m * ‖v‖ ^ 2 := by
+ have h1 := (le_abs_self _).trans (by simpa [Real.norm_eq_abs] using hb)
+ calc (H (x, y) - H (-r / 2, 0)) v v ≤ ‖H (x, y) - H (-r / 2, 0)‖ * ‖v‖ * ‖v‖ := h1
+ _ ≤ 5 * r * m * ‖v‖ * ‖v‖ := by gcongr
+ _ = 5 * r * m * ‖v‖ ^ 2 := by ring
+ rw [hsplit]
+ have := hlam v
+ nlinarith
+
+/-- **L4 on the full domain.** Every slice `y ↦ f (x, y)`, `x ∈ [-2r - ε, 2r + ε]`, is
+`(λ - 5rm)`-strongly concave on `B̄(0, 2r)`. -/
+theorem slices_strongConcave_D {f : ℝ × E → ℝ} {Dφ : ℝ × E → E →L[ℝ] ℝ}
+ {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hm : 0 ≤ m) (hε : 0 < ε)
+ (hεr : ε ≤ r / 2)
+ (hD : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => f (p.1, y)) (Dφ p) p.2)
+ (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => Dφ (p.1, y)) (H p) p.2)
+ (hlip : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖))
+ (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) :
+ ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε),
+ StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) (lam - 5 * r * m) (fun y => f (x, y)) := by
+ intro x hx
+ have hbd := transverse_hessian_le_D hm hε hεr hlip hlam
+ exact strongConcaveOn_of_hessian (Dφ := fun y => Dφ (x, y)) (H := fun y => H (x, y))
+ (convex_closedBall _ _) (fun y hy => hD (x, y) ⟨hx, hy⟩) (fun y hy => hH (x, y) ⟨hx, hy⟩)
+ (fun y hy v => hbd (x, y) ⟨hx, hy⟩ v)
+
+/-- **The cap from SP's source data (L1–L5, L7, L8, L11, L18 composed).** Fix a collar
+`0 < ε ≤ r/2` and assume, for `x ∈ [-2r - ε, 2r + ε]` and `y ∈ B̄(0, 2r)`: a joint derivative `Df` of `f`, strictly differentiable in
+its transverse part `∂_y f = Df ∘ inr` with derivative `DG`; the transverse Hessian `H` with the
+third-derivative bounds `m` of L3; (H1) `8rm² < λ` with `H(M) ≤ -λ`; the critical pins
+`Df(∓r/2, 0) = 0`; the weak bounds `|∂_x³ f(·, 0)| ≤ m` on `[-r/2, r/2]` (L1) and
+`|∂_x² ∂_y f(·, 0)| ≤ m` on the collar (L5); and the gap `f(M) - f(S) = r³/6`. Then:
+- a ridge `h` exists: on `(-2r - ε, 2r + ε)`, `h x` is a critical point of its slice in the open
+ ball;
+- for any such ridge (unique by `slice_critical_unique`) with L12's `hconv` for
+ `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)`,
+ `S = (r/2, 0)`, `b = f(M)` and `s = f(S)`.
+
+L8 puts `h` in the open ball on `[-2r, 2r]` (`‖w‖ ≤ 3mr² < 2rδ`); the implicit function theorem
+(`ridge_differentiable`) makes `h` differentiable there, with negative definite `DG ∘ inr = H`;
+`ridge_inputs_of_joint` gives L11; `ridge_capHyp_H1` gives the cap. Only L12 (`hconv`) remains an
+input, with L6 and L9–L11's quantitative bounds that SP uses to prove it. -/
+theorem ridge_capHyp_source [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}
+ {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}
+ {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}
+ {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)
+ (hεr : ε ≤ r / 2)
+ (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt f (Df p) p)
+ (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)
+ (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)
+ (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)
+ (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)
+ (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)
+ (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖)
+ (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)
+ (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)
+ (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))
+ (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))
+ (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => Df (t, 0) (0, v) + m * ‖v‖ / 2 * t ^ 2))
+ (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => Df (t, 0) (0, v) - m * ‖v‖ / 2 * t ^ 2))
+ (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :
+ (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧
+ ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),
+ h x ∈ Metric.closedBall (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →
+ ConvexOn ℝ (Icc (-2 * r) (2 * r))
+ (fun x => Df (x, h x) (1, 0) - (x + r / 2) * (x - r / 2) / 8) →
+ h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0)
+ (2 * r, h (2 * r)) (f (-r / 2, 0)) (f (r / 2, 0)) ∧
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, 0) → f x < f (r / 2, 0) := by
+ have hUX : Ioo (-2 * r - ε) (2 * r + ε) ⊆ Icc (-2 * r - ε) (2 * r + ε) := Ioo_subset_Icc_self
+ have hcapX : Icc (-2 * r) (r / 2) ⊆ Icc (-2 * r - ε) (2 * r + ε) :=
+ Icc_subset_Icc (by linarith) (by linarith)
+ have hIU : Icc (-2 * r) (2 * r) ⊆ Ioo (-2 * r - ε) (2 * r + ε) :=
+ fun t ht => ⟨by linarith [ht.1], by linarith [ht.2]⟩
+ have h0Y : (0 : E) ∈ Metric.closedBall (0 : E) (2 * r) := Metric.mem_closedBall_self (by positivity)
+ -- the slice derivatives are the transverse parts of `Df`
+ have hD : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => f (p.1, y)) ((Df p).comp (ContinuousLinearMap.inr ℝ ℝ E)) p.2 := by
+ rintro ⟨x, y⟩ hp
+ exact slice_hasFDerivAt (hDf (x, y) hp)
+ -- L1–L2: `m ≥ 2`
+ have hg0 : ∀ x ∈ Icc (-r / 2) (r / 2),
+ HasDerivAt (fun x => f (x, 0)) (Df (x, 0) (1, 0)) x := by
+ intro x hx
+ have hx' : (x, (0 : E)) ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r) :=
+ ⟨⟨by linarith [hx.1], by linarith [hx.2]⟩, h0Y⟩
+ have hp : HasDerivAt (fun t : ℝ => (t, (0 : E))) ((1 : ℝ), (0 : E)) x :=
+ (hasDerivAt_id x).prodMk (hasDerivAt_const x (0 : E))
+ exact (hDf _ hx').comp_hasDerivAt x hp
+ have hG0a : Df (-r / 2, 0) (1, 0) = 0 := by simp [hM]
+ have hG0c : Df (r / 2, 0) (1, 0) = 0 := by simp [hS]
+ have hm : 2 ≤ m := hermite_m_ge_two (g := fun x => f (x, 0)) hr hg0 hG0cv hG0cc hG0a hG0c hnorm
+ have hm0 : 0 ≤ m := by linarith
+ -- L3–L4 on the full domain
+ have hlip := hessian_increment_D hr hε hHx hHxb hHr hHrb
+ have hneg := transverse_hessian_le_D hm0 hε hεr hlip hlam
+ have hconcX := slices_strongConcave_D hm0 hε hεr hD hH hlip hlam
+ have h11 : 11 * (r * m) < lam - 5 * r * m := by
+ nlinarith [mul_nonneg (mul_nonneg hr.le hm0) (sub_nonneg.2 hm)]
+ have hrm : 0 < r * m := mul_pos hr (by linarith)
+ have hδ0 : 0 < lam - 5 * r * m := by linarith
+ -- L5 on the full domain: `‖w x‖ ≤ 3mr² < 2rδ`
+ have hwv : ∀ (t : ℝ) (v : E),
+ ((Df (t, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)) v = Df (t, 0) (0, v) := fun t v => by simp
+ have hwcv' : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => ((Df (t, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)) v + m * ‖v‖ / 2 * t ^ 2) :=
+ fun v => (hwcv v).congr fun t _ => by simp only [hwv]
+ have hwcc' : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => ((Df (t, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)) v - m * ‖v‖ / 2 * t ^ 2) :=
+ fun v => (hwcc v).congr fun t _ => by simp only [hwv]
+ have hwa : (Df (-r / 2, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0 := by simp [hM]
+ have hwc : (Df (r / 2, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0 := by simp [hS]
+ have hwlt : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε),
+ ‖(Df (x, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ < (lam - 5 * r * m) * (2 * r) := by
+ intro x hx
+ have h1 := slice_gradient_bound (w := fun t => (Df (t, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E))
+ hm0 hwcv' hwcc' (show -r / 2 ∈ Icc (-2 * r - ε) (2 * r + ε) from ⟨by linarith, by linarith⟩)
+ (show r / 2 ∈ Icc (-2 * r - ε) (2 * r + ε) from ⟨by linarith, by linarith⟩) (by linarith)
+ hwa hwc hx
+ have h2 : |(x - -r / 2) * (x - r / 2)| ≤ 6 * r ^ 2 := by
+ have hxx : 0 ≤ (x - (-2 * r - ε)) * (2 * r + ε - x) :=
+ mul_nonneg (by linarith [hx.1]) (by linarith [hx.2])
+ have hee : 0 ≤ (r / 2 - ε) * (9 * r / 2 + ε) :=
+ mul_nonneg (by linarith) (by linarith)
+ rw [abs_le]; constructor <;> nlinarith [sq_nonneg x, sq_nonneg r]
+ have h3 : ‖(Df (x, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ 3 * m * r ^ 2 :=
+ calc ‖(Df (x, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖
+ ≤ m / 2 * |(x - -r / 2) * (x - r / 2)| := h1
+ _ ≤ m / 2 * (6 * r ^ 2) := by gcongr
+ _ = 3 * m * r ^ 2 := by ring
+ have h4 : 22 * r * (r * m) < (lam - 5 * r * m) * (2 * r) := by nlinarith
+ nlinarith
+ have hslice0 : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε),
+ HasFDerivAt (fun y => f (x, y)) ((Df (x, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)) 0 :=
+ fun x hx => hD (x, 0) ⟨hx, h0Y⟩
+ refine ⟨ridge_exists (Dφ := fun x y => (Df (x, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) hr
+ (fun x hx => hconcX x (hUX hx)) (fun x hx y hy => hD (x, y) ⟨hUX hx, hy⟩)
+ (fun x hx => hwlt x (hUX hx)), ?_⟩
+ intro h hhU hconv
+ have hball : ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.closedBall (0 : E) (2 * r) :=
+ fun x hx => (hhU x hx).1
+ have hcrit : ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x) := fun x hx => (hhU x hx).2
+ -- L7 uniqueness: the pins are on the ridge
+ have hMU : -r / 2 ∈ Ioo (-2 * r - ε) (2 * r + ε) := ⟨by linarith, by linarith⟩
+ have hSU : r / 2 ∈ Ioo (-2 * r - ε) (2 * r + ε) := ⟨by linarith, by linarith⟩
+ have hha : h (-r / 2) = 0 :=
+ slice_critical_unique (hconcX _ (hUX hMU)) hδ0 (hball _ hMU) h0Y (hcrit _ hMU)
+ (by simpa [hwa] using hslice0 _ (hUX hMU))
+ have hhc : h (r / 2) = 0 :=
+ slice_critical_unique (hconcX _ (hUX hSU)) hδ0 (hball _ hSU) h0Y (hcrit _ hSU)
+ (by simpa [hwc] using hslice0 _ (hUX hSU))
+ -- L8: the ridge is in the open ball on `[-2r, 2r]`
+ have hint : ∀ x ∈ Icc (-2 * r) (2 * r), h x ∈ Metric.ball (0 : E) (2 * r) := by
+ intro x hx
+ have hxU := hIU hx
+ have h8 := slice_ridge_bound (hconcX x (hUX hxU)) h0Y (hball x hxU) (hcrit x hxU)
+ (hslice0 x (hUX hxU))
+ have h9 := hwlt x (hUX hxU)
+ rw [Metric.mem_ball, dist_zero_right]
+ have : (lam - 5 * r * m) * ‖h x‖ < (lam - 5 * r * m) * (2 * r) := by linarith
+ exact lt_of_mul_lt_mul_left this hδ0.le
+ have hridgeX : ∀ x ∈ Icc (-2 * r) (2 * r),
+ (x, h x) ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r) :=
+ fun x hx => ⟨hUX (hIU hx), hball x (hIU hx)⟩
+ -- L7 regularity: the transverse part of `DG` is `H`, negative definite
+ have hDGH : ∀ x ∈ Icc (-2 * r) (2 * r),
+ DG (x, h x) ∘L ContinuousLinearMap.inr ℝ ℝ E = H (x, h x) := by
+ intro x hx
+ have h1 : HasFDerivAt (fun y => (Df (x, y)).comp (ContinuousLinearMap.inr ℝ ℝ E))
+ ((DG (x, h x)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (h x) :=
+ (hGs _ (hridgeX x hx)).hasFDerivAt.comp (h x) (hasFDerivAt_prodMk_right x (h x))
+ exact h1.unique (hH _ (hridgeX x hx))
+ have hnegR : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ v : E,
+ (DG (x, h x) ∘L ContinuousLinearMap.inr ℝ ℝ E) v v ≤ -(lam - 5 * r * m) * ‖v‖ ^ 2 := by
+ intro x hx v
+ rw [hDGH x hx]
+ exact hneg _ (hridgeX x hx) v
+ have hG : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ᶠ v in 𝓝 (x, h x),
+ HasFDerivAt (fun y => f (v.1, y)) ((Df v).comp (ContinuousLinearMap.inr ℝ ℝ E)) v.2 := by
+ intro x hx
+ have hopen : IsOpen (Ioo (-2 * r - ε) (2 * r + ε) ×ˢ Metric.ball (0 : E) (2 * r)) :=
+ isOpen_Ioo.prod Metric.isOpen_ball
+ filter_upwards [hopen.mem_nhds ⟨hIU hx, hint x hx⟩] with v hv
+ exact hD v ⟨hUX hv.1, Metric.ball_subset_closedBall hv.2⟩
+ have hstrict := ridge_differentiable (f := f)
+ (G := fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG := fun x => DG (x, h x))
+ (h := h) (U := Ioo (-2 * r - ε) (2 * r + ε)) hδ0 isOpen_Ioo hIU
+ (fun x hx => hconcX x (hUX hx)) hball hcrit hint hG
+ (fun x hx => hGs _ (hridgeX x hx)) hnegR
+ -- L11
+ have hDr : ∀ x ∈ Icc (-2 * r) (2 * r), HasFDerivAt f (Df (x, h x)) (x, h x) :=
+ fun x hx => hDf _ (hridgeX x hx)
+ have hridge : ∀ x ∈ Icc (-2 * r) (2 * r),
+ (Df (x, h x)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0 :=
+ fun x hx => (slice_hasFDerivAt (hDr x hx)).unique (hcrit x (hIU hx))
+ obtain ⟨hh, hg, -⟩ := ridge_inputs_of_joint hr hDr
+ (fun x hx => (hstrict x hx).hasFDerivAt.hasDerivAt) hridge
+ have hFa : Df (-r / 2, h (-r / 2)) (1, 0) = 0 := by simp [hha, hM]
+ have hFc : Df (r / 2, h (r / 2)) (1, 0) = 0 := by simp [hhc, hS]
+ have hcap : ∀ x ∈ Icc (-2 * r) (r / 2), x ∈ Ioo (-2 * r - ε) (2 * r + ε) :=
+ fun x hx => ⟨by linarith [hx.1], by linarith [hx.2]⟩
+ have key := ridge_capHyp_H1 (w := fun t => (Df (t, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E))
+ hr hg0 hG0cv hG0cc hG0a hG0c
+ (fun p hp => hD p ⟨hcapX hp.1, hp.2⟩) (fun p hp => hH p ⟨hcapX hp.1, hp.2⟩)
+ (fun x hx => hHx x (hcapX hx)) (fun x hx => hHxb x (hcapX hx))
+ (fun p hp => hHr p ⟨hcapX hp.1, hp.2⟩) (fun p hp => hHrb p ⟨hcapX hp.1, hp.2⟩) hlam hH1
+ hh hg hFa hFc hconv (fun x hx => hball x (hcap x hx)) (fun x hx => hcrit x (hcap x hx))
+ hha hhc (fun x hx => hslice0 x (hcapX hx))
+ (fun v => (hwcv' v).subset hcapX (convex_Icc _ _))
+ (fun v => (hwcc' v).subset hcapX (convex_Icc _ _)) (by rw [hha, hhc]; exact hnorm)
+ rw [hha, hhc] at key
+ exact ⟨hha, hhc, key⟩
+
+
+/-! ### L6, L9 and L12 (v1.9)
+
+The last analytic input of the cap, L12's convexity `hconv`, is derived here. L6 bounds `w'` by
+chord slopes of L5's convexity pair (no integral), L9 bounds `h'` through the differentiated ridge
+equation, and L12 uses that `F' = D²f[(1, h'), (1, 0)]` is the maximum of `ζ ↦ D²f[(1, ζ), (1, ζ)]`,
+so that no second derivative of `h` is needed. `ridge_capHyp_C3` composes them with
+`ridge_capHyp_source`. -/
+
+/-- A convex function with equal values at `a < c` has derivative `≥ 0` to the right of `c` and
+`≤ 0` to the left of `a`. -/
+theorem convex_deriv_sign {φ : ℝ → ℝ} {D : Set ℝ} {a c x d : ℝ} (hφ : ConvexOn ℝ D φ)
+ (haD : a ∈ D) (hcD : c ∈ D) (hac : a < c) (heq : φ a = φ c) (hx : x ∈ D)
+ (hd : HasDerivAt φ d x) : (c ≤ x → 0 ≤ d) ∧ (x ≤ a → d ≤ 0) := by
+ have h0 : (φ c - φ a) / (c - a) = 0 := by rw [heq, sub_self, zero_div]
+ constructor
+ · intro hcx
+ have hax : a < x := hac.trans_le hcx
+ have h1 : (φ c - φ a) / (c - a) ≤ (φ x - φ a) / (x - a) :=
+ hφ.secant_mono haD hcD hx hac.ne' hax.ne' hcx
+ have h2 := hφ.slope_le_of_hasDerivAt haD hx hax hd
+ rw [slope_def_field] at h2
+ linarith
+ · intro hxa
+ rcases hxa.eq_or_lt with h | h
+ · subst h
+ have h2 := hφ.le_slope_of_hasDerivAt hx hcD hac hd
+ rw [slope_def_field] at h2
+ linarith
+ · have h1 : (φ a - φ x) / (a - x) ≤ (φ c - φ a) / (c - a) :=
+ hφ.slope_mono_adjacent hx hcD h hac
+ have h2 := hφ.le_slope_of_hasDerivAt hx haD h hd
+ rw [slope_def_field] at h2
+ linarith
+
+/-- **L6 (scalar).** If `u + (m/2)t²` is convex and `u - (m/2)t²` concave on `D` (weakly
+`|u''| ≤ m`), `u(∓r/2) = 0` and `u` has derivative `d` at `x ∈ D`, then `|d| ≤ m · max(|x|, r/2)`.
+Outside the pins the chord through them has slope `0`; between them the chord to the nearer pin and
+L5's bound on `u(x)` give `mr/2`. -/
+theorem two_node_deriv_bound {u : ℝ → ℝ} {D : Set ℝ} {r m x d : ℝ} (hr : 0 < r) (hm : 0 ≤ m)
+ (hcv : ConvexOn ℝ D (fun t => u t + m / 2 * t ^ 2))
+ (hcc : ConcaveOn ℝ D (fun t => u t - m / 2 * t ^ 2))
+ (haD : -r / 2 ∈ D) (hcD : r / 2 ∈ D) (ha : u (-r / 2) = 0) (hc : u (r / 2) = 0)
+ (hx : x ∈ D) (hd : HasDerivAt u d x) : |d| ≤ m * max |x| (r / 2) := by
+ have hac : -r / 2 < r / 2 := by linarith
+ have hq : HasDerivAt (fun t : ℝ => m / 2 * t ^ 2) (m * x) x := by
+ convert (hasDerivAt_pow 2 x).const_mul (m / 2) using 1
+ push_cast
+ ring
+ have hg : HasDerivAt (fun t => u t + m / 2 * t ^ 2) (d + m * x) x := hd.add hq
+ have hcv' : ConvexOn ℝ D (fun t => -u t + m / 2 * t ^ 2) :=
+ hcc.neg.congr fun t _ => by simp only [Pi.neg_apply]; ring
+ have hk : HasDerivAt (fun t => -u t + m / 2 * t ^ 2) (-d + m * x) x := hd.neg.add hq
+ have hgeq : (fun t => u t + m / 2 * t ^ 2) (-r / 2) = (fun t => u t + m / 2 * t ^ 2) (r / 2) := by
+ simp only [ha, hc]; ring
+ have hkeq : (fun t => -u t + m / 2 * t ^ 2) (-r / 2) =
+ (fun t => -u t + m / 2 * t ^ 2) (r / 2) := by
+ simp only [ha, hc]; ring
+ obtain ⟨g1, g2⟩ := convex_deriv_sign hcv haD hcD hac hgeq hx hg
+ obtain ⟨k1, k2⟩ := convex_deriv_sign hcv' haD hcD hac hkeq hx hk
+ rcases le_or_gt (r / 2) x with hcx | hxc
+ · have h1 := g1 hcx
+ have h2 := k1 hcx
+ have hxpos : 0 ≤ x := by linarith
+ rw [abs_of_nonneg hxpos]
+ calc |d| ≤ m * x := abs_le.mpr ⟨by linarith, by linarith⟩
+ _ ≤ m * max x (r / 2) := mul_le_mul_of_nonneg_left (le_max_left _ _) hm
+ rcases le_or_gt x (-r / 2) with hxa | hax
+ · have h1 := g2 hxa
+ have h2 := k2 hxa
+ have hxneg : x ≤ 0 := by linarith
+ rw [abs_of_nonpos hxneg]
+ calc |d| ≤ m * -x := abs_le.mpr ⟨by linarith, by linarith⟩
+ _ ≤ m * max (-x) (r / 2) := mul_le_mul_of_nonneg_left (le_max_left _ _) hm
+ · -- between the pins
+ have hu := two_node_bound hcv hcc haD hcD hac ha hc hx
+ have hP : (x - -r / 2) * (x - r / 2) ≤ 0 :=
+ mul_nonpos_of_nonneg_of_nonpos (by linarith) (by linarith)
+ rw [abs_of_nonpos hP] at hu
+ have hcx : 0 < r / 2 - x := by linarith
+ have hs1 := hcv.le_slope_of_hasDerivAt hx hcD hxc hg
+ have hs2 := hcv'.le_slope_of_hasDerivAt hx hcD hxc hk
+ rw [slope_def_field, le_div_iff₀ hcx] at hs1 hs2
+ simp only [hc] at hs1 hs2
+ have hu1 := (abs_le.mp hu).1
+ have hu2 := (abs_le.mp hu).2
+ have key1 : d * (r / 2 - x) ≤ m / 2 * r * (r / 2 - x) := by nlinarith
+ have key2 : -d * (r / 2 - x) ≤ m / 2 * r * (r / 2 - x) := by nlinarith
+ have hd1 := le_of_mul_le_mul_right key1 hcx
+ have hd2 := le_of_mul_le_mul_right key2 hcx
+ calc |d| ≤ m / 2 * r := abs_le.mpr ⟨by linarith, hd1⟩
+ _ = m * (r / 2) := by ring
+ _ ≤ m * max |x| (r / 2) := mul_le_mul_of_nonneg_left (le_max_right _ _) hm
+
+
+/-- **L6 (CAP (7)).** For the slice derivatives `w t` at `y = 0` with derivative `w' x` at `x`, under
+L5's hypotheses: `‖w' x‖ ≤ m · max(|x|, r/2)`; on `[-2r, 2r]` this is SP's `‖w'‖ ≤ 2mr`. -/
+theorem slice_gradient_deriv_bound {w : ℝ → E →L[ℝ] ℝ} {w' : E →L[ℝ] ℝ} {D : Set ℝ} {r m x : ℝ}
+ (hr : 0 < r) (hm : 0 ≤ m)
+ (hcv : ∀ v : E, ConvexOn ℝ D (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))
+ (hcc : ∀ v : E, ConcaveOn ℝ D (fun t => w t v - m * ‖v‖ / 2 * t ^ 2))
+ (haD : -r / 2 ∈ D) (hcD : r / 2 ∈ D) (ha : w (-r / 2) = 0) (hc : w (r / 2) = 0)
+ (hx : x ∈ D) (hd : HasDerivAt w w' x) : ‖w'‖ ≤ m * max |x| (r / 2) := by
+ refine ContinuousLinearMap.opNorm_le_bound _ (by positivity) fun v => ?_
+ have hdv : HasDerivAt (fun t => w t v) (w' v) x := by
+ simpa using hd.clm_apply (hasDerivAt_const x v)
+ have h := two_node_deriv_bound (u := fun t => w t v) (m := m * ‖v‖) hr (by positivity) (hcv v)
+ (hcc v) haD hcD (by simp [ha]) (by simp [hc]) hx hdv
+ rw [Real.norm_eq_abs]
+ calc |w' v| ≤ m * ‖v‖ * max |x| (r / 2) := h
+ _ = m * max |x| (r / 2) * ‖v‖ := by ring
+
+/-- **L9 and the Schur maximum.** Let `Q` be a bilinear form on `ℝ × E` with `δ`-negative definite
+transverse part, and let `η` satisfy the differentiated ridge equation `Q (1, η) (0, ·) = 0`. Then
+`δ ‖η‖ ≤ ‖Q (1, 0) (0, ·)‖` (L9: `‖h'‖ ≤ ‖∂_x ∇_y f‖ / δ`), `Q (1, η) (1, η) = Q (1, η) (1, 0)`, and,
+if `Q` is symmetric, `Q (1, ζ) (1, ζ) ≤ Q (1, η) (1, η)` for every `ζ`: the Schur complement
+`F' = f_xx + f_xy[h']` is the maximum of `ζ ↦ D²f[(1, ζ), (1, ζ)]`. -/
+theorem schur_max {Q : ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ} {δ : ℝ} {η : E} (hδ : 0 < δ)
+ (hneg : ∀ v : E, Q (0, v) (0, v) ≤ -δ * ‖v‖ ^ 2)
+ (hridge : (Q (1, η)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0) :
+ δ * ‖η‖ ≤ ‖(Q (1, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ∧
+ Q (1, η) (1, η) = Q (1, η) (1, 0) ∧
+ ((∀ v w, Q v w = Q w v) → ∀ ζ : E, Q (1, ζ) (1, ζ) ≤ Q (1, η) (1, η)) := by
+ have h0 : ∀ v : E, Q (1, η) (0, v) = 0 := fun v => by
+ simpa using congrArg (fun L : E →L[ℝ] ℝ => L v) hridge
+ have hsplit : ∀ ζ : E, ((1 : ℝ), ζ) = ((1 : ℝ), (0 : E)) + ((0 : ℝ), ζ) := fun ζ => by simp
+ refine ⟨?_, ?_, ?_⟩
+ · have h1 : Q (1, 0) (0, η) + Q (0, η) (0, η) = 0 := by
+ have := h0 η
+ rw [hsplit η, map_add, add_apply] at this
+ exact this
+ have h2 : Q (1, 0) (0, η) ≤ ‖(Q (1, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ * ‖η‖ := by
+ have := ((Q (1, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)).le_opNorm η
+ have h3 : ((Q (1, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)) η = Q (1, 0) (0, η) := by simp
+ rw [h3] at this
+ exact (le_abs_self _).trans (by simpa [Real.norm_eq_abs] using this)
+ have h4 := hneg η
+ have h5 : δ * ‖η‖ * ‖η‖ ≤ ‖(Q (1, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ * ‖η‖ := by
+ nlinarith
+ rcases (norm_nonneg η).eq_or_lt with h | h
+ · rw [← h, mul_zero]; exact norm_nonneg _
+ · exact le_of_mul_le_mul_right h5 h
+ · have e : Q (1, η) (1, η) = Q (1, η) ((1, 0) + (0, η)) := by rw [← hsplit η]
+ rw [e, map_add, h0 η, add_zero]
+ · intro hsym ζ
+ have hz : ((1 : ℝ), ζ) = ((1 : ℝ), η) + ((0 : ℝ), ζ - η) := by simp
+ have h1 := h0 (ζ - η)
+ have h2 : Q (0, ζ - η) (1, η) = 0 := by rw [hsym]; exact h1
+ have h3 := hneg (ζ - η)
+ rw [hz, map_add, map_add, add_apply, add_apply, h1, h2]
+ nlinarith [sq_nonneg ‖ζ - η‖]
+
+/-- **The correction terms of L12.** Let `T a b v` be the third derivative of `f` (the derivative of
+`D²f[a, b]` in direction `v`). If every block other than `f_xxx` has norm at most `m`, in the combined
+form below, then `T (1, b) (1, b) (1, a) ≥ f_xxx - m((1 + ‖b‖)²(1 + ‖a‖) - 1)`. With `‖a‖, ‖b‖ ≤ u`
+this is SP's adverse bound `m u (3 + 3u + u²)`. -/
+theorem trilinear_lower {T : ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {m : ℝ}
+ (hT : ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),
+ |T (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T (1, 0) (1, 0) (1, 0)| ≤
+ m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))
+ (a b : E) :
+ T (1, 0) (1, 0) (1, 0) - m * ((1 + ‖b‖) * (1 + ‖b‖) * (1 + ‖a‖) - 1) ≤ T (1, b) (1, b) (1, a) := by
+ have h := (abs_le.mp (hT 1 1 1 b b a)).1
+ simp only [abs_one, one_mul, mul_one] at h
+ linarith
+
+/-- **SP's constants close L12.** With `m ≥ 2`, `δ > rm(8m - 5)` and `u = 2s + 2s²`, `s = mr/δ`
+(L9's bound on `‖h'‖`): `7/4 - m((1 + u)³ - 1) ≥ 1/4`. SP's exact value at `k = 11` is
+`7/4 - 2554128/1771561 = 0.308… > 1/4`. -/
+theorem l12_constants {r m δ : ℝ} (hr : 0 < r) (hm : 2 ≤ m) (hδ : r * m * (8 * m - 5) < δ) :
+ 1 / 4 ≤ 7 / 4 - m * ((1 + (2 * (m * r / δ) + 2 * (m * r / δ) ^ 2)) ^ 3 - 1) := by
+ have hrm : 0 < r * m := mul_pos hr (by linarith)
+ have h11 : 11 * (r * m) ≤ r * m * (8 * m - 5) := by nlinarith
+ have hδ0 : 0 < δ := by linarith
+ set s := m * r / δ with hs
+ have hs0 : 0 ≤ s := by positivity
+ have hs1 : s ≤ 1 / 11 := by
+ rw [hs, div_le_iff₀ hδ0]; nlinarith
+ have hms : m * s ≤ 2 / 11 := by
+ have : m * s = m * m * r / δ := by rw [hs]; ring
+ rw [this, div_le_iff₀ hδ0]
+ nlinarith [mul_nonneg (mul_nonneg hr.le (by linarith : (0 : ℝ) ≤ m)) (by linarith : (0 : ℝ) ≤ m - 2)]
+ set u := 2 * s + 2 * s ^ 2 with hu
+ have hu0 : 0 ≤ u := by positivity
+ have hu1 : u ≤ 24 / 121 := by rw [hu]; nlinarith
+ have hmu : m * u ≤ 48 / 121 := by
+ have : m * u = 2 * (m * s) * (1 + s) := by rw [hu]; ring
+ rw [this]
+ have h1 : 1 + s ≤ 12 / 11 := by linarith
+ have h2 : 0 ≤ m * s := by positivity
+ nlinarith
+ have hexp : m * ((1 + u) ^ 3 - 1) = (m * u) * (3 + 3 * u + u ^ 2) := by ring
+ rw [hexp]
+ have h3 : 3 + 3 * u + u ^ 2 ≤ 3 + 3 * (24 / 121) + (24 / 121) ^ 2 := by nlinarith
+ have h4 : (m * u) * (3 + 3 * u + u ^ 2) ≤ (48 / 121) * (3 + 3 * (24 / 121) + (24 / 121) ^ 2) :=
+ mul_le_mul hmu h3 (by positivity) (by norm_num)
+ norm_num at h4 ⊢
+ linarith
+
+/-- **The transverse Hessian is the transverse block of `D²f`.** If `y ↦ ∂_y f (x, y)` has
+derivative `H` at `y₀` and `Df` has derivative `D2f` at `(x, y₀)`, then
+`H v w = D²f (x, y₀) [(0, v), (0, w)]`. -/
+theorem transverse_hessian_eq {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}
+ {H : E →L[ℝ] E →L[ℝ] ℝ} {x : ℝ} {y₀ : E}
+ (hH : HasFDerivAt (fun y => (Df (x, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) H y₀)
+ (hD2 : HasFDerivAt Df D2f (x, y₀)) (v w : E) : H v w = D2f (0, v) (0, w) := by
+ have h1 := hH.clm_apply (hasFDerivAt_const w y₀)
+ have h2 := (hD2.comp y₀ (hasFDerivAt_prodMk_right x y₀)).clm_apply
+ (hasFDerivAt_const ((0 : ℝ), w) y₀)
+ have h3 := h1.unique h2
+ have := congrArg (fun L : E →L[ℝ] ℝ => L v) h3
+ simpa using this
+
+/-- **The differentiated ridge equation.** If `∂_y f (t, h t) = 0` for `t` near `x`, `h` has
+derivative `h'` at `x` and `Df` has derivative `D2f` at `(x, h x)`, then
+`D²f (x, h x) [(1, h'), (0, ·)] = 0`, i.e. `∂_x ∇_y f + D_y² f · h' = 0` (L11's first identity). -/
+theorem ridge_second_identity {Df : ℝ × E → ℝ × E →L[ℝ] ℝ}
+ {D2f : ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ} {h : ℝ → E} {h' : E} {x : ℝ}
+ (hridge : ∀ᶠ t in 𝓝 x, (Df (t, h t)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0)
+ (hh : HasDerivAt h h' x) (hD2 : HasFDerivAt Df D2f (x, h x)) :
+ (D2f (1, h')).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0 := by
+ have hp : HasDerivAt (fun t => (t, h t)) ((1 : ℝ), h') x := (hasDerivAt_id x).prodMk hh
+ have h1 : HasDerivAt (fun t => Df (t, h t)) (D2f (1, h')) x := hD2.comp_hasDerivAt x hp
+ have h2 : HasDerivAt (fun t => (Df (t, h t)).comp (ContinuousLinearMap.inr ℝ ℝ E))
+ ((D2f (1, h')).comp (ContinuousLinearMap.inr ℝ ℝ E)) x := by
+ have := h1.clm_comp (hasDerivAt_const x (ContinuousLinearMap.inr ℝ ℝ E))
+ simpa using this
+ have h3 : HasDerivAt (fun t => (Df (t, h t)).comp (ContinuousLinearMap.inr ℝ ℝ E)) 0 x :=
+ (hasDerivAt_const x (0 : E →L[ℝ] ℝ)).congr_of_eventuallyEq hridge
+ exact h2.unique h3
+
+/-- **L12 (CAP (11)–(12)): the convexity input `hconv`.** Along the ridge, let `Df`, `D2f` be the
+first two derivatives of `f`, with `D2f` symmetric and its transverse part `δ`-negative definite,
+`‖h'‖ ≤ u`, and for every `‖b‖ ≤ u` let `s ↦ D²f(s, h s)[(1, b), (1, b)]` have derivative `≥ 1/4`
+(SP: `f_xxx ≥ 7/4` minus the adverse part `m u (3 + 3u + u²)`; see `trilinear_lower`). Then
+`F - (x + r/2)(x - r/2)/8`, `F x = ∂_x f (x, h x)`, is convex on `[-2r, 2r]`. No second derivative of
+`h` is used: `F' = D²f[(1, h'), (1, 0)]` is the maximum of `ζ ↦ D²f[(1, ζ), (1, ζ)]` (`schur_max`),
+so `F'(x₂) - F'(x₁) ≥ D²f(x₂)[(1, η), (1, η)] - D²f(x₁)[(1, η), (1, η)] ≥ (x₂ - x₁)/4` with
+`η = h'(x₁)`. -/
+theorem ridge_hconv {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}
+ {Φ : ℝ → E → ℝ} {h h' : ℝ → E} {U : Set ℝ} {r δ u : ℝ} (hδ : 0 < δ) (hU : IsOpen U)
+ (hIU : Icc (-2 * r) (2 * r) ⊆ U)
+ (hridge : ∀ x ∈ U, (Df (x, h x)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0)
+ (hh : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt h (h' x) x)
+ (hD2 : ∀ x ∈ Icc (-2 * r) (2 * r), HasFDerivAt Df (D2f (x, h x)) (x, h x))
+ (hsym : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ v w, D2f (x, h x) v w = D2f (x, h x) w v)
+ (hneg : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ v : E, D2f (x, h x) (0, v) (0, v) ≤ -δ * ‖v‖ ^ 2)
+ (hu : ∀ x ∈ Icc (-2 * r) (2 * r), ‖h' x‖ ≤ u)
+ (hΦ : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ b : E,
+ HasDerivAt (fun s => D2f (s, h s) (1, b) (1, b)) (Φ x b) x)
+ (hΦb : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ b : E, ‖b‖ ≤ u → 1 / 4 ≤ Φ x b) :
+ ConvexOn ℝ (Icc (-2 * r) (2 * r))
+ (fun x => Df (x, h x) (1, 0) - (x + r / 2) * (x - r / 2) / 8) := by
+ have hid : ∀ x ∈ Icc (-2 * r) (2 * r),
+ (D2f (x, h x) (1, h' x)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0 := fun x hx =>
+ ridge_second_identity (Filter.eventually_of_mem (hU.mem_nhds (hIU hx)) hridge) (hh x hx)
+ (hD2 x hx)
+ have hF : ∀ x ∈ Icc (-2 * r) (2 * r),
+ HasDerivAt (fun t => Df (t, h t) (1, 0) - (t + r / 2) * (t - r / 2) / 8)
+ (D2f (x, h x) (1, h' x) (1, 0) - x / 4) x := by
+ intro x hx
+ have hp : HasDerivAt (fun t => (t, h t)) ((1 : ℝ), h' x) x := (hasDerivAt_id x).prodMk (hh x hx)
+ have h1 : HasDerivAt (fun t => Df (t, h t)) (D2f (x, h x) (1, h' x)) x :=
+ (hD2 x hx).comp_hasDerivAt x hp
+ have h2 : HasDerivAt (fun t => Df (t, h t) (1, 0)) (D2f (x, h x) (1, h' x) (1, 0)) x := by
+ simpa using h1.clm_apply (hasDerivAt_const x ((1 : ℝ), (0 : E)))
+ have h3 : HasDerivAt (fun t : ℝ => (t + r / 2) * (t - r / 2) / 8) (x / 4) x := by
+ have := ((hasDerivAt_pow 2 x).div_const 8).sub_const (r ^ 2 / 32)
+ convert this using 1
+ · funext t
+ ring
+ · push_cast
+ ring
+ exact h2.sub h3
+ have hmono : MonotoneOn (fun x => D2f (x, h x) (1, h' x) (1, 0) - x / 4)
+ (Icc (-2 * r) (2 * r)) := by
+ intro x1 hx1 x2 hx2 hle
+ have hφ : ∀ t ∈ Icc (-2 * r) (2 * r),
+ HasDerivAt (fun s => D2f (s, h s) (1, h' x1) (1, h' x1) - s / 4)
+ (Φ t (h' x1) - 1 / 4) t := fun t ht =>
+ (hΦ t ht (h' x1)).sub ((hasDerivAt_id t).div_const 4)
+ have hφmono : MonotoneOn (fun s => D2f (s, h s) (1, h' x1) (1, h' x1) - s / 4)
+ (Icc (-2 * r) (2 * r)) := by
+ refine monotoneOn_of_deriv_nonneg (convex_Icc _ _)
+ (fun t ht => (hφ t ht).continuousAt.continuousWithinAt)
+ (fun t ht => (hφ t (interior_subset ht)).differentiableAt.differentiableWithinAt) ?_
+ intro t ht
+ rw [(hφ t (interior_subset ht)).deriv]
+ have := hΦb t (interior_subset ht) (h' x1) (hu x1 hx1)
+ linarith
+ have h12 := hφmono hx1 hx2 hle
+ obtain ⟨-, he1, -⟩ := schur_max hδ (hneg x1 hx1) (hid x1 hx1)
+ obtain ⟨-, he2, hmax2⟩ := schur_max hδ (hneg x2 hx2) (hid x2 hx2)
+ have hm2 := hmax2 (hsym x2 hx2) (h' x1)
+ simp only at h12 ⊢
+ rw [← he1, ← he2]
+ linarith
+ refine MonotoneOn.convexOn_of_deriv (convex_Icc _ _)
+ (fun x hx => (hF x hx).continuousAt.continuousWithinAt)
+ (fun x hx => (hF x (interior_subset hx)).differentiableAt.differentiableWithinAt) ?_
+ intro x1 hx1 x2 hx2 hle
+ rw [(hF x1 (interior_subset hx1)).deriv, (hF x2 (interior_subset hx2)).deriv]
+ exact hmono (interior_subset hx1) (interior_subset hx2) hle
+
+
+/-- **L3 in `y` for `∂_x ∇_y f`.** If along the segment `s ↦ (x, s • y)` the third derivatives
+satisfy `|T (1, 0) (0, v) (0, y)| ≤ m ‖v‖ ‖y‖` (the block `f_xyy`), then
+`‖∂_x ∇_y f (x, y) - ∂_x ∇_y f (x, 0)‖ ≤ m ‖y‖`. -/
+theorem dx_grad_increment {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}
+ {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {x m : ℝ} {y : E} (hm : 0 ≤ m)
+ (hD3 : ∀ s ∈ Icc (0 : ℝ) 1, ∀ a b : ℝ × E,
+ HasFDerivAt (fun q => D2f q a b) (T3 (x, s • y) a b) (x, s • y))
+ (hT : ∀ s ∈ Icc (0 : ℝ) 1, ∀ v : E, |T3 (x, s • y) (1, 0) (0, v) (0, y)| ≤ m * ‖v‖ * ‖y‖) :
+ ‖(D2f (x, y) (1, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E) -
+ (D2f (x, 0) (1, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ m * ‖y‖ := by
+ refine ContinuousLinearMap.opNorm_le_bound _ (by positivity) fun v => ?_
+ have hφ : ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => D2f (x, s • y) (1, 0) (0, v))
+ (T3 (x, s • y) (1, 0) (0, v) (0, y)) s := by
+ intro s hs
+ have hp : HasDerivAt (fun s : ℝ => (x, s • y)) ((0 : ℝ), y) s := by
+ simpa using (hasDerivAt_const s x).prodMk ((hasDerivAt_id s).smul_const y)
+ exact (hD3 s hs (1, 0) (0, v)).comp_hasDerivAt s hp
+ have hφb : ∀ s ∈ Icc (0 : ℝ) 1, ‖T3 (x, s • y) (1, 0) (0, v) (0, y)‖ ≤ m * ‖v‖ * ‖y‖ :=
+ fun s hs => by rw [Real.norm_eq_abs]; exact hT s hs v
+ have := (convex_Icc (0 : ℝ) 1).norm_image_sub_le_of_norm_hasDerivWithin_le
+ (fun s hs => (hφ s hs).hasDerivWithinAt) hφb (left_mem_Icc.mpr zero_le_one)
+ (right_mem_Icc.mpr zero_le_one)
+ simp only [one_smul, zero_smul, sub_zero, norm_one, mul_one] at this
+ simp only [sub_apply, ContinuousLinearMap.comp_apply,
+ ContinuousLinearMap.inr_apply]
+ calc ‖(D2f (x, y)) (1, 0) (0, v) - (D2f (x, 0)) (1, 0) (0, v)‖ ≤ m * ‖v‖ * ‖y‖ := this
+ _ = m * ‖y‖ * ‖v‖ := by ring
+
+/-- **L9's arithmetic.** From `δ ‖h'‖ ≤ ‖∂_x∇_y f(x, h)‖ ≤ 2mr + m‖h‖` and `δ ‖h‖ ≤ 2mr²`:
+`‖h'‖ ≤ 2s + 2s²` with `s = mr/δ` (SP: `u = 2/k + 2/k²`). -/
+theorem l9_arith {δ m r a b c : ℝ} (hδ : 0 < δ) (hm : 0 ≤ m) (ha : δ * a ≤ c)
+ (hc : c ≤ 2 * m * r + m * b) (hb : δ * b ≤ 2 * m * r ^ 2) :
+ a ≤ 2 * (m * r / δ) + 2 * (m * r / δ) ^ 2 := by
+ have key : δ * δ * a ≤ 2 * m * r * δ + 2 * m * m * r ^ 2 := by nlinarith
+ have hrhs : 2 * (m * r / δ) + 2 * (m * r / δ) ^ 2 =
+ (2 * m * r * δ + 2 * m * m * r ^ 2) / (δ * δ) := by
+ field_simp
+ rw [hrhs, le_div_iff₀ (by positivity)]
+ linarith
+
+/-- **L12's bound at one point.** With the combined block bound, `f_xxx ≥ 7/4`, `‖a‖, ‖b‖ ≤ u`
+and `7/4 - m((1 + u)³ - 1) ≥ 1/4` (`l12_constants`): `T (1, b) (1, b) (1, a) ≥ 1/4`. -/
+theorem l12_lower {T : ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {m u : ℝ} {a b : E} (hm : 0 ≤ m)
+ (hT : ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),
+ |T (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T (1, 0) (1, 0) (1, 0)| ≤
+ m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))
+ (hxxx : 7 / 4 ≤ T (1, 0) (1, 0) (1, 0)) (hc : 1 / 4 ≤ 7 / 4 - m * ((1 + u) ^ 3 - 1))
+ (ha : ‖a‖ ≤ u) (hb : ‖b‖ ≤ u) : 1 / 4 ≤ T (1, b) (1, b) (1, a) := by
+ have h1 := trilinear_lower hT a b
+ have hnb := norm_nonneg b
+ have hna := norm_nonneg a
+ have hb1 : 1 + ‖b‖ ≤ 1 + u := by linarith
+ have ha1 : 1 + ‖a‖ ≤ 1 + u := by linarith
+ have h4 : (1 + ‖b‖) * (1 + ‖b‖) * (1 + ‖a‖) ≤ (1 + u) ^ 3 := by
+ have e : (1 + u) ^ 3 = (1 + u) * (1 + u) * (1 + u) := by ring
+ rw [e]
+ exact mul_le_mul (mul_le_mul hb1 hb1 (by linarith) (by linarith)) ha1 (by linarith)
+ (mul_nonneg (by linarith) (by linarith))
+ have h5 := mul_le_mul_of_nonneg_left (sub_le_sub_right h4 1) hm
+ linarith
+
+/-- **The ridge facts from SP's source data.** Under the hypotheses of `ridge_capHyp_source`, for a
+ridge `h` on the collar: `m ≥ 2`, `δ = λ - 5rm > rm(8m - 5)`, `h x` lies in the open ball and
+`δ ‖h x‖ ≤ 2mr²` on `[-2r, 2r]` (L5 and L8), `h` is differentiable there (L7), and the transverse
+Hessian along the ridge is `δ`-negative definite (L4). -/
+theorem ridge_source_facts [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}
+ {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}
+ {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}
+ {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)
+ (hεr : ε ≤ r / 2)
+ (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)
+ (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)
+ (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)
+ (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)
+ (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)
+ (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)
+ (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖)
+ (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)
+ (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)
+ (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))
+ (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))
+ (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => Df (t, 0) (0, v) + m * ‖v‖ / 2 * t ^ 2))
+ (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => Df (t, 0) (0, v) - m * ‖v‖ / 2 * t ^ 2))
+ (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) {h : ℝ → E}
+ (hhU : ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.closedBall (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) :
+ 2 ≤ m ∧ r * m * (8 * m - 5) < lam - 5 * r * m ∧
+ (∀ x ∈ Icc (-2 * r) (2 * r), h x ∈ Metric.ball (0 : E) (2 * r)) ∧
+ (∀ x ∈ Icc (-2 * r) (2 * r), (lam - 5 * r * m) * ‖h x‖ ≤ 2 * m * r ^ 2) ∧
+ (∃ h' : ℝ → E, ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt h (h' x) x) ∧
+ (∀ x ∈ Icc (-2 * r) (2 * r), ∀ v : E, H (x, h x) v v ≤ -(lam - 5 * r * m) * ‖v‖ ^ 2) := by
+ have hUX : Ioo (-2 * r - ε) (2 * r + ε) ⊆ Icc (-2 * r - ε) (2 * r + ε) := Ioo_subset_Icc_self
+ have hcapX : Icc (-2 * r) (r / 2) ⊆ Icc (-2 * r - ε) (2 * r + ε) :=
+ Icc_subset_Icc (by linarith) (by linarith)
+ have hIU : Icc (-2 * r) (2 * r) ⊆ Ioo (-2 * r - ε) (2 * r + ε) :=
+ fun t ht => ⟨by linarith [ht.1], by linarith [ht.2]⟩
+ have h0Y : (0 : E) ∈ Metric.closedBall (0 : E) (2 * r) := Metric.mem_closedBall_self (by positivity)
+ -- the slice derivatives are the transverse parts of `Df`
+ have hD : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => f (p.1, y)) ((Df p).comp (ContinuousLinearMap.inr ℝ ℝ E)) p.2 := by
+ rintro ⟨x, y⟩ hp
+ exact slice_hasFDerivAt (hDf (x, y) hp)
+ -- L1–L2: `m ≥ 2`
+ have hg0 : ∀ x ∈ Icc (-r / 2) (r / 2),
+ HasDerivAt (fun x => f (x, 0)) (Df (x, 0) (1, 0)) x := by
+ intro x hx
+ have hx' : (x, (0 : E)) ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r) :=
+ ⟨⟨by linarith [hx.1], by linarith [hx.2]⟩, h0Y⟩
+ have hp : HasDerivAt (fun t : ℝ => (t, (0 : E))) ((1 : ℝ), (0 : E)) x :=
+ (hasDerivAt_id x).prodMk (hasDerivAt_const x (0 : E))
+ exact (hDf _ hx').comp_hasDerivAt x hp
+ have hG0a : Df (-r / 2, 0) (1, 0) = 0 := by simp [hM]
+ have hG0c : Df (r / 2, 0) (1, 0) = 0 := by simp [hS]
+ have hm : 2 ≤ m := hermite_m_ge_two (g := fun x => f (x, 0)) hr hg0 hG0cv hG0cc hG0a hG0c hnorm
+ have hm0 : 0 ≤ m := by linarith
+ -- L3–L4 on the full domain
+ have hlip := hessian_increment_D hr hε hHx hHxb hHr hHrb
+ have hneg := transverse_hessian_le_D hm0 hε hεr hlip hlam
+ have hconcX := slices_strongConcave_D hm0 hε hεr hD hH hlip hlam
+ have h11 : 11 * (r * m) < lam - 5 * r * m := by
+ nlinarith [mul_nonneg (mul_nonneg hr.le hm0) (sub_nonneg.2 hm)]
+ have hrm : 0 < r * m := mul_pos hr (by linarith)
+ have hδ0 : 0 < lam - 5 * r * m := by linarith
+ -- L5 on the full domain: `‖w x‖ ≤ 3mr² < 2rδ`
+ have hwv : ∀ (t : ℝ) (v : E),
+ ((Df (t, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)) v = Df (t, 0) (0, v) := fun t v => by simp
+ have hwcv' : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => ((Df (t, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)) v + m * ‖v‖ / 2 * t ^ 2) :=
+ fun v => (hwcv v).congr fun t _ => by simp only [hwv]
+ have hwcc' : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => ((Df (t, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)) v - m * ‖v‖ / 2 * t ^ 2) :=
+ fun v => (hwcc v).congr fun t _ => by simp only [hwv]
+ have hwa : (Df (-r / 2, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0 := by simp [hM]
+ have hwc : (Df (r / 2, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0 := by simp [hS]
+ have hwlt : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε),
+ ‖(Df (x, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ < (lam - 5 * r * m) * (2 * r) := by
+ intro x hx
+ have h1 := slice_gradient_bound (w := fun t => (Df (t, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E))
+ hm0 hwcv' hwcc' (show -r / 2 ∈ Icc (-2 * r - ε) (2 * r + ε) from ⟨by linarith, by linarith⟩)
+ (show r / 2 ∈ Icc (-2 * r - ε) (2 * r + ε) from ⟨by linarith, by linarith⟩) (by linarith)
+ hwa hwc hx
+ have h2 : |(x - -r / 2) * (x - r / 2)| ≤ 6 * r ^ 2 := by
+ have hxx : 0 ≤ (x - (-2 * r - ε)) * (2 * r + ε - x) :=
+ mul_nonneg (by linarith [hx.1]) (by linarith [hx.2])
+ have hee : 0 ≤ (r / 2 - ε) * (9 * r / 2 + ε) :=
+ mul_nonneg (by linarith) (by linarith)
+ rw [abs_le]; constructor <;> nlinarith [sq_nonneg x, sq_nonneg r]
+ have h3 : ‖(Df (x, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ 3 * m * r ^ 2 :=
+ calc ‖(Df (x, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖
+ ≤ m / 2 * |(x - -r / 2) * (x - r / 2)| := h1
+ _ ≤ m / 2 * (6 * r ^ 2) := by gcongr
+ _ = 3 * m * r ^ 2 := by ring
+ have h4 : 22 * r * (r * m) < (lam - 5 * r * m) * (2 * r) := by nlinarith
+ nlinarith
+ have hslice0 : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε),
+ HasFDerivAt (fun y => f (x, y)) ((Df (x, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)) 0 :=
+ fun x hx => hD (x, 0) ⟨hx, h0Y⟩
+ have hball : ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.closedBall (0 : E) (2 * r) :=
+ fun x hx => (hhU x hx).1
+ have hcrit : ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x) := fun x hx => (hhU x hx).2
+ -- L8: the ridge is in the open ball on `[-2r, 2r]`
+ have hint : ∀ x ∈ Icc (-2 * r) (2 * r), h x ∈ Metric.ball (0 : E) (2 * r) := by
+ intro x hx
+ have hxU := hIU hx
+ have h8 := slice_ridge_bound (hconcX x (hUX hxU)) h0Y (hball x hxU) (hcrit x hxU)
+ (hslice0 x (hUX hxU))
+ have h9 := hwlt x (hUX hxU)
+ rw [Metric.mem_ball, dist_zero_right]
+ have : (lam - 5 * r * m) * ‖h x‖ < (lam - 5 * r * m) * (2 * r) := by linarith
+ exact lt_of_mul_lt_mul_left this hδ0.le
+ have hridgeX : ∀ x ∈ Icc (-2 * r) (2 * r),
+ (x, h x) ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r) :=
+ fun x hx => ⟨hUX (hIU hx), hball x (hIU hx)⟩
+ -- L7 regularity: the transverse part of `DG` is `H`, negative definite
+ have hDGH : ∀ x ∈ Icc (-2 * r) (2 * r),
+ DG (x, h x) ∘L ContinuousLinearMap.inr ℝ ℝ E = H (x, h x) := by
+ intro x hx
+ have h1 : HasFDerivAt (fun y => (Df (x, y)).comp (ContinuousLinearMap.inr ℝ ℝ E))
+ ((DG (x, h x)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (h x) :=
+ (hGs _ (hridgeX x hx)).hasFDerivAt.comp (h x) (hasFDerivAt_prodMk_right x (h x))
+ exact h1.unique (hH _ (hridgeX x hx))
+ have hnegR : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ v : E,
+ (DG (x, h x) ∘L ContinuousLinearMap.inr ℝ ℝ E) v v ≤ -(lam - 5 * r * m) * ‖v‖ ^ 2 := by
+ intro x hx v
+ rw [hDGH x hx]
+ exact hneg _ (hridgeX x hx) v
+ have hG : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ᶠ v in 𝓝 (x, h x),
+ HasFDerivAt (fun y => f (v.1, y)) ((Df v).comp (ContinuousLinearMap.inr ℝ ℝ E)) v.2 := by
+ intro x hx
+ have hopen : IsOpen (Ioo (-2 * r - ε) (2 * r + ε) ×ˢ Metric.ball (0 : E) (2 * r)) :=
+ isOpen_Ioo.prod Metric.isOpen_ball
+ filter_upwards [hopen.mem_nhds ⟨hIU hx, hint x hx⟩] with v hv
+ exact hD v ⟨hUX hv.1, Metric.ball_subset_closedBall hv.2⟩
+ have hstrict := ridge_differentiable (f := f)
+ (G := fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG := fun x => DG (x, h x))
+ (h := h) (U := Ioo (-2 * r - ε) (2 * r + ε)) hδ0 isOpen_Ioo hIU
+ (fun x hx => hconcX x (hUX hx)) hball hcrit hint hG
+ (fun x hx => hGs _ (hridgeX x hx)) hnegR
+ have hmemA : -r / 2 ∈ Icc (-2 * r - ε) (2 * r + ε) := ⟨by linarith, by linarith⟩
+ have hmemC : r / 2 ∈ Icc (-2 * r - ε) (2 * r + ε) := ⟨by linarith, by linarith⟩
+ have hw2 : ∀ x ∈ Icc (-2 * r) (2 * r),
+ ‖(Df (x, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ 2 * m * r ^ 2 := by
+ intro x hx
+ have h1 := slice_gradient_bound
+ (w := fun t => (Df (t, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)) hm0 hwcv' hwcc' hmemA hmemC
+ (by linarith) hwa hwc (hUX (hIU hx))
+ have h2 : |(x - -r / 2) * (x - r / 2)| ≤ 4 * r ^ 2 := by
+ have hxx : 0 ≤ (x - -2 * r) * (2 * r - x) :=
+ mul_nonneg (by linarith [hx.1]) (by linarith [hx.2])
+ rw [abs_le]; constructor <;> nlinarith [sq_nonneg x, sq_nonneg r]
+ calc ‖(Df (x, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖
+ ≤ m / 2 * |(x - -r / 2) * (x - r / 2)| := h1
+ _ ≤ m / 2 * (4 * r ^ 2) := by gcongr
+ _ = 2 * m * r ^ 2 := by ring
+ refine ⟨hm, by nlinarith, hint, fun x hx =>
+ (slice_ridge_bound (hconcX x (hUX (hIU hx))) h0Y (hball x (hIU hx)) (hcrit x (hIU hx))
+ (hslice0 x (hUX (hIU hx)))).trans (hw2 x hx),
+ ⟨_, fun x hx => (hstrict x hx).hasFDerivAt.hasDerivAt⟩,
+ fun x hx v => hneg _ (hridgeX x hx) v⟩
+
+
+/-- **The cap from SP's `C³` source data (L1–L20 composed; L12 proved).** As
+`ridge_capHyp_source`, with L12's `hconv` derived instead of assumed. Additionally assume, on the
+collar: a second derivative `D2f` of `f`, third derivatives `T3 p a b` of `p ↦ D²f p [a, b]`, every
+third-derivative block other than `f_xxx` of norm at most `m` (combined form), and `f_xxx ≥ 7/4` on
+`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
+(C1)–(C3) and (C2⁺) on the cap. Inside: L5 gives `‖w‖ ≤ 2mr²` on `[-2r, 2r]`, L8 `‖h‖ ≤ 2mr²/δ`, L6
+`‖w'‖ ≤ 2mr`, L3 in `y` `‖∂_x∇_y f(x, h)‖ ≤ ‖w'‖ + m‖h‖`, L9 `‖h'‖ ≤ 2s + 2s²` with `s = mr/δ`,
+`trilinear_lower` and `l12_constants` give `F'' ≥ 1/4` in the form of `ridge_hconv`. -/
+theorem ridge_capHyp_C3 [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}
+ {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}
+ {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ}
+ {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}
+ {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}
+ {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)
+ (hεr : ε ≤ r / 2)
+ (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)
+ (hD2 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)
+ (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)
+ (hT : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),
+ |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤
+ m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))
+ (hxxx : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ 7 / 4 ≤ T3 p (1, 0) (1, 0) (1, 0))
+ (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)
+ (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)
+ (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)
+ (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)
+ (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)
+ (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖)
+ (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)
+ (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)
+ (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))
+ (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))
+ (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => Df (t, 0) (0, v) + m * ‖v‖ / 2 * t ^ 2))
+ (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => Df (t, 0) (0, v) - m * ‖v‖ / 2 * t ^ 2))
+ (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :
+ (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧
+ ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),
+ h x ∈ Metric.closedBall (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →
+ h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0)
+ (2 * r, h (2 * r)) (f (-r / 2, 0)) (f (r / 2, 0)) ∧
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, 0) → f x < f (r / 2, 0) := by
+ obtain ⟨hex, hcapS⟩ := ridge_capHyp_source hr hε hεr hDf hGs hH hHx hHxb hHr hHrb hlam hH1 hM hS
+ hG0cv hG0cc hwcv hwcc hnorm
+ refine ⟨hex, fun h hhU => hcapS h hhU ?_⟩
+ obtain ⟨hm, hδ, hint, hh8, ⟨h', hhd⟩, hnegH⟩ := ridge_source_facts hr hε hεr hDf hGs hH hHx hHxb
+ hHr hHrb hlam hH1 hM hS hG0cv hG0cc hwcv hwcc hnorm hhU
+ have hm0 : 0 ≤ m := by linarith
+ have hδ0 : 0 < lam - 5 * r * m := by
+ have : 0 < r * m * (8 * m - 5) := mul_pos (mul_pos hr (by linarith)) (by linarith)
+ linarith
+ have hUX : Ioo (-2 * r - ε) (2 * r + ε) ⊆ Icc (-2 * r - ε) (2 * r + ε) := Ioo_subset_Icc_self
+ have hIU : Icc (-2 * r) (2 * r) ⊆ Ioo (-2 * r - ε) (2 * r + ε) :=
+ fun t ht => ⟨by linarith [ht.1], by linarith [ht.2]⟩
+ have h0Y : (0 : E) ∈ Metric.closedBall (0 : E) (2 * r) := Metric.mem_closedBall_self (by positivity)
+ have hball : ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.closedBall (0 : E) (2 * r) :=
+ fun x hx => (hhU x hx).1
+ have hridgeX : ∀ x ∈ Icc (-2 * r) (2 * r),
+ (x, h x) ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r) :=
+ fun x hx => ⟨hUX (hIU hx), hball x (hIU hx)⟩
+ have hridgeU : ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),
+ (Df (x, h x)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0 := fun x hx =>
+ (slice_hasFDerivAt (hDf _ ⟨hUX hx, hball x hx⟩)).unique (hhU x hx).2
+ have hD2r : ∀ x ∈ Icc (-2 * r) (2 * r), HasFDerivAt Df (D2f (x, h x)) (x, h x) :=
+ fun x hx => hD2 _ (hridgeX x hx)
+ have hsym : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ v w, D2f (x, h x) v w = D2f (x, h x) w v := by
+ intro x hx v w
+ have hopen : IsOpen (Ioo (-2 * r - ε) (2 * r + ε) ×ˢ Metric.ball (0 : E) (2 * r)) :=
+ isOpen_Ioo.prod Metric.isOpen_ball
+ have hev : ∀ᶠ q in 𝓝 (x, h x), HasFDerivAt f (Df q) q := by
+ filter_upwards [hopen.mem_nhds ⟨hIU hx, hint x hx⟩] with q hq
+ exact hDf q ⟨hUX hq.1, Metric.ball_subset_closedBall hq.2⟩
+ exact second_derivative_symmetric_of_eventually hev (hD2r x hx) v w
+ have hnegD : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ v : E,
+ D2f (x, h x) (0, v) (0, v) ≤ -(lam - 5 * r * m) * ‖v‖ ^ 2 := by
+ intro x hx v
+ rw [← transverse_hessian_eq (hH _ (hridgeX x hx)) (hD2r x hx) v v]
+ exact hnegH x hx v
+ -- L6: `‖w' x‖ ≤ 2mr`
+ have hwcv' : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => ((Df (t, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)) v + m * ‖v‖ / 2 * t ^ 2) :=
+ fun v => (hwcv v).congr fun t _ => by simp
+ have hwcc' : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => ((Df (t, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)) v - m * ‖v‖ / 2 * t ^ 2) :=
+ fun v => (hwcc v).congr fun t _ => by simp
+ have hw6 : ∀ x ∈ Icc (-2 * r) (2 * r),
+ ‖(D2f (x, 0) (1, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ 2 * m * r := by
+ intro x hx
+ have hp : HasDerivAt (fun t : ℝ => (t, (0 : E))) ((1 : ℝ), (0 : E)) x :=
+ (hasDerivAt_id x).prodMk (hasDerivAt_const x (0 : E))
+ have h1 : HasDerivAt (fun t => Df (t, 0)) (D2f (x, 0) (1, 0)) x :=
+ (hD2 _ ⟨hUX (hIU hx), h0Y⟩).comp_hasDerivAt x hp
+ have hd : HasDerivAt (fun t => (Df (t, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E))
+ ((D2f (x, 0) (1, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)) x := by
+ simpa using h1.clm_comp (hasDerivAt_const x (ContinuousLinearMap.inr ℝ ℝ E))
+ have h2 := slice_gradient_deriv_bound hr hm0 hwcv' hwcc'
+ (show -r / 2 ∈ Icc (-2 * r - ε) (2 * r + ε) from ⟨by linarith, by linarith⟩)
+ (show r / 2 ∈ Icc (-2 * r - ε) (2 * r + ε) from ⟨by linarith, by linarith⟩)
+ (by simp [hM]) (by simp [hS]) (hUX (hIU hx)) hd
+ have h3 : max |x| (r / 2) ≤ 2 * r :=
+ max_le (abs_le.mpr ⟨by linarith [hx.1], by linarith [hx.2]⟩) (by linarith)
+ calc ‖(D2f (x, 0) (1, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ m * max |x| (r / 2) := h2
+ _ ≤ m * (2 * r) := mul_le_mul_of_nonneg_left h3 hm0
+ _ = 2 * m * r := by ring
+ -- L3 in `y`, then L9
+ have hu : ∀ x ∈ Icc (-2 * r) (2 * r), ‖h' x‖ ≤
+ 2 * (m * r / (lam - 5 * r * m)) + 2 * (m * r / (lam - 5 * r * m)) ^ 2 := by
+ intro x hx
+ have hseg : ∀ s ∈ Icc (0 : ℝ) 1,
+ (x, s • h x) ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r) := by
+ intro s hs
+ have hhY : ‖h x‖ ≤ 2 * r := by
+ simpa [Metric.mem_closedBall, dist_zero_right] using hball x (hIU hx)
+ refine ⟨hUX (hIU hx), ?_⟩
+ rw [Metric.mem_closedBall, dist_zero_right, norm_smul, Real.norm_eq_abs, abs_of_nonneg hs.1]
+ nlinarith [hs.2, norm_nonneg (h x)]
+ have hinc := dx_grad_increment (D2f := D2f) (T3 := T3) (x := x) (y := h x) hm0
+ (fun s hs => hD3 _ (hseg s hs))
+ (fun s hs v => by
+ have := hT _ (hseg s hs) 1 0 0 0 v (h x)
+ simpa [mul_assoc] using this)
+ have hBn : ‖(D2f (x, h x) (1, 0)).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤
+ 2 * m * r + m * ‖h x‖ :=
+ (norm_le_norm_add_norm_sub' _ _).trans (add_le_add (hw6 x hx) hinc)
+ have hid := ridge_second_identity
+ (Filter.eventually_of_mem (isOpen_Ioo.mem_nhds (hIU hx)) hridgeU) (hhd x hx) (hD2r x hx)
+ obtain ⟨h9, -, -⟩ := schur_max hδ0 (hnegD x hx) hid
+ exact l9_arith hδ0 hm0 h9 hBn (hh8 x hx)
+ -- L12
+ have hc := l12_constants hr hm hδ
+ have hΦ : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ b : E,
+ HasDerivAt (fun s => D2f (s, h s) (1, b) (1, b)) (T3 (x, h x) (1, b) (1, b) (1, h' x)) x := by
+ intro x hx b
+ have hp : HasDerivAt (fun s => (s, h s)) ((1 : ℝ), h' x) x := (hasDerivAt_id x).prodMk (hhd x hx)
+ exact (hD3 _ (hridgeX x hx) (1, b) (1, b)).comp_hasDerivAt x hp
+ exact ridge_hconv (Φ := fun x b => T3 (x, h x) (1, b) (1, b) (1, h' x)) hδ0 isOpen_Ioo hIU
+ hridgeU hhd hD2r hsym hnegD hu hΦ
+ (fun x hx b hb => l12_lower hm0 (hT _ (hridgeX x hx)) (hxxx _ ⟨hx, hball x (hIU hx)⟩) hc
+ (hu x hx) hb)
+
+
+/-! ### L2's second statement and (H2) (v2.0)
+
+SP's L4 lower bound `f_xxx ≥ 7/4` was the last analytic hypothesis of `ridge_capHyp_C3`. It follows
+from the normalization (some point of the pin interval has `f_xxx ≥ 2`, by a one-sided Hermite bound)
+and (H2) `rn ≤ 1/20` with a bound `n` on the derivative of `f_xxx`. `ridge_capHyp_C4` takes SP's
+hypotheses only. -/
+
+/-- **L1, one-sided.** As `hermite_gap_le`, from the concave half alone (`G'' ≤ m` weakly):
+`g(a) - g(c) ≤ m (c - a)³/12`. -/
+theorem hermite_gap_le_concave {g G : ℝ → ℝ} {a c m : ℝ} (hac : a < c)
+ (hg : ∀ x ∈ Icc a c, HasDerivAt g (G x) x)
+ (hcc : ConcaveOn ℝ (Icc a c) (fun t => G t - m / 2 * t ^ 2))
+ (hGa : G a = 0) (hGc : G c = 0) :
+ g a - g c ≤ m * (c - a) ^ 3 / 12 := by
+ have hpoly : ∀ x, HasDerivAt (fun t => (c - a) * (t - a) ^ 2 / 2 - (t - a) ^ 3 / 3)
+ ((x - a) * (c - x)) x := by
+ intro x
+ have h1 : HasDerivAt (fun t => t - a) 1 x := (hasDerivAt_id x).sub_const a
+ have h2 := ((h1.pow 2).const_mul (c - a)).div_const 2
+ have h3 := (h1.pow 3).div_const 3
+ convert h2.sub h3 using 1
+ push_cast
+ ring
+ set k : ℝ → ℝ := fun t => g t + m / 2 * ((c - a) * (t - a) ^ 2 / 2 - (t - a) ^ 3 / 3)
+ with hk
+ have hkd : ∀ x ∈ Icc a c, HasDerivAt k (G x + m / 2 * ((x - a) * (c - x))) x :=
+ fun x hx => (hg x hx).add ((hpoly x).const_mul (m / 2))
+ have hcv' : ConvexOn ℝ (Icc a c) (fun t => -G t + m / 2 * t ^ 2) :=
+ hcc.neg.congr fun t _ => by simp only [Pi.neg_apply]; ring
+ have hχ := convexOn_add_node (a := a) (c := c) hcv'
+ have hmono : MonotoneOn k (Icc a c) := by
+ refine monotoneOn_of_hasDerivWithinAt_nonneg (convex_Icc a c)
+ (fun x hx => (hkd x hx).continuousAt.continuousWithinAt)
+ (fun x hx => (hkd x (interior_subset hx)).hasDerivWithinAt) (fun x hx => ?_)
+ have hx := interior_subset hx
+ have h0 := convex_zeros_between hχ (left_mem_Icc.mpr hac.le) (right_mem_Icc.mpr hac.le) hac.le
+ (by rw [hGa]; ring) (by rw [hGc]; ring) hx
+ nlinarith
+ have hkac := hmono (left_mem_Icc.mpr hac.le) (right_mem_Icc.mpr hac.le) hac.le
+ simp only [hk] at hkac
+ have e0 : m / 2 * ((c - a) * (a - a) ^ 2 / 2 - (a - a) ^ 3 / 3) = 0 := by ring
+ have e1 : m / 2 * ((c - a) * (c - a) ^ 2 / 2 - (c - a) ^ 3 / 3) = m * (c - a) ^ 3 / 12 := by
+ ring
+ linarith
+
+/-- **L2, second statement.** Under SP's normalization `g(-r/2) - g(r/2) = r³/6` with critical pins,
+if `g''' = φ` is continuous on the pin interval, then `φ(x₀) ≥ 2` for some `x₀` there (SP: the
+`φ`-weighted average of `f_xxx` is `2`). -/
+theorem third_deriv_exists_two {g G G' φ : ℝ → ℝ} {r : ℝ} (hr : 0 < r)
+ (hg : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt g (G x) x)
+ (hG : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt G (G' x) x)
+ (hG' : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt G' (φ x) x)
+ (hφ : ContinuousOn φ (Icc (-r / 2) (r / 2)))
+ (hGa : G (-r / 2) = 0) (hGc : G (r / 2) = 0) (hgap : g (-r / 2) - g (r / 2) = r ^ 3 / 6) :
+ ∃ x₀ ∈ Icc (-r / 2) (r / 2), 2 ≤ φ x₀ := by
+ by_contra hcon
+ simp only [not_exists, not_and, not_le] at hcon
+ have hne : (Icc (-r / 2) (r / 2)).Nonempty := ⟨-r / 2, left_mem_Icc.mpr (by linarith)⟩
+ obtain ⟨x₁, hx₁, hmax⟩ := isCompact_Icc.exists_isMaxOn hne hφ
+ set M := φ x₁ with hM
+ have hcc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G t - M / 2 * t ^ 2) := by
+ refine concaveOn_of_hasDerivWithinAt2_nonpos (convex_Icc _ _) (f' := fun t => G' t - M * t)
+ (f'' := fun t => φ t - M)
+ (fun t ht => ((hG t ht).sub ((hasDerivAt_pow 2 t).const_mul (M / 2))).continuousAt.continuousWithinAt)
+ (fun t ht => ?_) (fun t ht => ?_) (fun t ht => ?_)
+ · have := (hG t (interior_subset ht)).sub ((hasDerivAt_pow 2 t).const_mul (M / 2))
+ convert this.hasDerivWithinAt using 1
+ push_cast
+ ring
+ · have := (hG' t (interior_subset ht)).sub ((hasDerivAt_id' t).const_mul M)
+ convert this.hasDerivWithinAt using 1
+ ring
+ · have h' : φ t ≤ φ x₁ := hmax (interior_subset ht)
+ show φ t - M ≤ 0
+ linarith
+ have h1 := hermite_gap_le_concave (by linarith) hg hcc hGa hGc
+ have hcr : r / 2 - -r / 2 = r := by ring
+ rw [hgap, hcr] at h1
+ have h2 := hcon x₁ hx₁
+ have hr3 : 0 < r ^ 3 := by positivity
+ nlinarith
+
+/-- **L4 (`f_xxx ≥ 7/4`).** Let `ψ = f_xxx` have derivative `Dψ` on SP's domain
+`D = [-2r, 2r] × B̄(0, 2r)`, with the two fourth-order blocks bounded by `n = M_4` there:
+`|∂_x ψ| = |Dψ (1, 0)| ≤ n` and `‖D_y ψ‖ = ‖Dψ ∘ inr‖ ≤ n`. If `ψ(x₀, 0) ≥ 2` at a point of the pin
+interval and (H2) `rn ≤ 1/20`, then `ψ ≥ 7/4` on `D` (the proof bounds `ψ ≥ 2 - 9rn/2`; the
+statement exports `7/4`). As in SP's L3, move first in `x`
+along `y = 0` (`|Δx| ≤ 5r/2`), then along the ray to `y` (`‖Δy‖ ≤ 2r`); SP rounds `9r/2` up to `5r`. -/
+theorem fxxx_lower {ψ : ℝ × E → ℝ} {Dψ : ℝ × E → ℝ × E →L[ℝ] ℝ} {r n x₀ : ℝ} (hr : 0 < r)
+ (hψ : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt ψ (Dψ p) p)
+ (hnx : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), |Dψ p (1, 0)| ≤ n)
+ (hny : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ‖(Dψ p).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ n)
+ (hx₀ : x₀ ∈ Icc (-r / 2) (r / 2)) (h2 : 2 ≤ ψ (x₀, 0)) (hH2 : r * n ≤ 1 / 20) :
+ ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), 7 / 4 ≤ ψ p := by
+ rintro ⟨x, y⟩ ⟨hx, hy⟩
+ have h0Y : (0 : E) ∈ Metric.closedBall (0 : E) (2 * r) := Metric.mem_closedBall_self (by positivity)
+ have hyn : ‖y‖ ≤ 2 * r := by simpa [Metric.mem_closedBall, dist_zero_right] using hy
+ have hn0 : 0 ≤ n := (abs_nonneg _).trans (hnx (x, y) ⟨hx, hy⟩)
+ -- along `y = 0`
+ have hx₀D : x₀ ∈ Icc (-2 * r) (2 * r) := ⟨by linarith [hx₀.1], by linarith [hx₀.2]⟩
+ have hd1 : ∀ t ∈ Icc (-2 * r) (2 * r),
+ HasDerivAt (fun t : ℝ => ψ (t, 0)) (Dψ (t, 0) (1, 0)) t := by
+ intro t ht
+ have hp : HasDerivAt (fun s : ℝ => (s, (0 : E))) ((1 : ℝ), (0 : E)) t :=
+ (hasDerivAt_id t).prodMk (hasDerivAt_const t (0 : E))
+ exact (hψ (t, 0) ⟨ht, h0Y⟩).comp_hasDerivAt t hp
+ have h1 := (convex_Icc (-2 * r) (2 * r)).norm_image_sub_le_of_norm_hasDerivWithin_le
+ (f := fun t : ℝ => ψ (t, 0)) (fun t ht => (hd1 t ht).hasDerivWithinAt)
+ (fun t ht => by rw [Real.norm_eq_abs]; exact hnx (t, 0) ⟨ht, h0Y⟩) hx₀D hx
+ -- along the ray to `y`
+ have hseg : ∀ s ∈ Icc (0 : ℝ) 1, (x, s • y) ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) := by
+ intro s hs
+ refine ⟨hx, ?_⟩
+ rw [Metric.mem_closedBall, dist_zero_right, norm_smul, Real.norm_eq_abs, abs_of_nonneg hs.1]
+ nlinarith [hs.2, norm_nonneg y]
+ have hd2 : ∀ s ∈ Icc (0 : ℝ) 1,
+ HasDerivAt (fun s : ℝ => ψ (x, s • y)) (Dψ (x, s • y) (0, y)) s := by
+ intro s hs
+ have hp : HasDerivAt (fun s : ℝ => (x, s • y)) ((0 : ℝ), y) s := by
+ simpa using (hasDerivAt_const s x).prodMk ((hasDerivAt_id s).smul_const y)
+ exact (hψ _ (hseg s hs)).comp_hasDerivAt s hp
+ have hb2 : ∀ s ∈ Icc (0 : ℝ) 1, ‖Dψ (x, s • y) (0, y)‖ ≤ n * ‖y‖ := by
+ intro s hs
+ have := ((Dψ (x, s • y)).comp (ContinuousLinearMap.inr ℝ ℝ E)).le_opNorm y
+ simp only [ContinuousLinearMap.comp_apply, ContinuousLinearMap.inr_apply] at this
+ exact this.trans (mul_le_mul_of_nonneg_right (hny _ (hseg s hs)) (norm_nonneg y))
+ have h2' := (convex_Icc (0 : ℝ) 1).norm_image_sub_le_of_norm_hasDerivWithin_le
+ (f := fun s : ℝ => ψ (x, s • y)) (fun s hs => (hd2 s hs).hasDerivWithinAt) hb2
+ (left_mem_Icc.mpr zero_le_one) (right_mem_Icc.mpr zero_le_one)
+ simp only [one_smul, zero_smul, sub_zero, norm_one, mul_one] at h2'
+ have h1' : |ψ (x, 0) - ψ (x₀, 0)| ≤ n * |x - x₀| := by simpa [Real.norm_eq_abs] using h1
+ rw [Real.norm_eq_abs] at h2'
+ have hdx : |x - x₀| ≤ 5 * r / 2 := by
+ rw [abs_le]; constructor <;> linarith [hx.1, hx.2, hx₀.1, hx₀.2]
+ have e1 := (abs_le.mp h1').1
+ have e2 := (abs_le.mp h2').1
+ have h5 : n * |x - x₀| ≤ n * (5 * r / 2) := mul_le_mul_of_nonneg_left hdx hn0
+ have h6 : n * ‖y‖ ≤ n * (2 * r) := mul_le_mul_of_nonneg_left hyn hn0
+ nlinarith
+
+/-- **The cap from SP's hypotheses (H1), (H2) and the derivative bounds (L1–L20 composed).** As
+`ridge_capHyp_C3`, with `f_xxx ≥ 7/4` derived instead of assumed: from a derivative `Φ4` of `f_xxx`
+on `D = [-2r, 2r] × B̄(0, 2r)` whose two blocks `∂_x f_xxx` and `D_y f_xxx` are bounded by
+`n = M_4` there, as in SP, and (H2) `rn ≤ 1/20`. L2's second statement gives `f_xxx(x₀, 0) ≥ 2` on
+the pin interval (`third_deriv_exists_two`), and `fxxx_lower` gives `f_xxx ≥ 7/4` on `D`. -/
+theorem ridge_capHyp_C4 [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}
+ {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}
+ {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {Φ4 : ℝ × E → ℝ × E →L[ℝ] ℝ} {n : ℝ}
+ {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}
+ {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}
+ {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)
+ (hεr : ε ≤ r / 2)
+ (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)
+ (hD2 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)
+ (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)
+ (hT : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),
+ |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤
+ m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))
+ (hD4 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun q => T3 q (1, 0) (1, 0) (1, 0)) (Φ4 p) p)
+ (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), |Φ4 p (1, 0)| ≤ n)
+ (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ‖(Φ4 p).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ n)
+ (hH2 : r * n ≤ 1 / 20)
+ (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)
+ (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)
+ (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)
+ (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)
+ (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)
+ (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖)
+ (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)
+ (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)
+ (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))
+ (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))
+ (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => Df (t, 0) (0, v) + m * ‖v‖ / 2 * t ^ 2))
+ (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => Df (t, 0) (0, v) - m * ‖v‖ / 2 * t ^ 2))
+ (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :
+ (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧
+ ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),
+ h x ∈ Metric.closedBall (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →
+ h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0)
+ (2 * r, h (2 * r)) (f (-r / 2, 0)) (f (r / 2, 0)) ∧
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, 0) → f x < f (r / 2, 0) := by
+ have hmem : ∀ t ∈ Icc (-r / 2) (r / 2), (t, (0 : E)) ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r) := fun t ht =>
+ ⟨⟨by linarith [ht.1], by linarith [ht.2]⟩, Metric.mem_closedBall_self (by positivity)⟩
+ have hp : ∀ t : ℝ, HasDerivAt (fun s : ℝ => (s, (0 : E))) ((1 : ℝ), (0 : E)) t := fun t =>
+ (hasDerivAt_id t).prodMk (hasDerivAt_const t (0 : E))
+ have hg : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt (fun x => f (x, 0)) (Df (x, 0) (1, 0)) x := by
+ intro x hx
+ exact (hDf _ (hmem x hx)).comp_hasDerivAt x (hp x)
+ have hG : ∀ x ∈ Icc (-r / 2) (r / 2),
+ HasDerivAt (fun t => Df (t, 0) (1, 0)) (D2f (x, 0) (1, 0) (1, 0)) x := by
+ intro x hx
+ have h1 : HasDerivAt (fun t => Df (t, 0)) (D2f (x, 0) (1, 0)) x :=
+ (hD2 _ (hmem x hx)).comp_hasDerivAt x (hp x)
+ simpa using h1.clm_apply (hasDerivAt_const x ((1 : ℝ), (0 : E)))
+ have hG' : ∀ x ∈ Icc (-r / 2) (r / 2),
+ HasDerivAt (fun t => D2f (t, 0) (1, 0) (1, 0)) (T3 (x, 0) (1, 0) (1, 0) (1, 0)) x := by
+ intro x hx
+ exact (hD3 _ (hmem x hx) (1, 0) (1, 0)).comp_hasDerivAt x (hp x)
+ have hc : Continuous (fun s : ℝ => (s, (0 : E))) := continuous_id.prodMk continuous_const
+ have hmemD : ∀ t ∈ Icc (-r / 2) (r / 2), (t, (0 : E)) ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) := fun t ht =>
+ ⟨⟨by linarith [ht.1], by linarith [ht.2]⟩, Metric.mem_closedBall_self (by positivity)⟩
+ have hφc : ContinuousOn (fun t => T3 (t, 0) (1, 0) (1, 0) (1, 0)) (Icc (-r / 2) (r / 2)) := by
+ intro t ht
+ have h1 : ContinuousAt (fun q => T3 q (1, 0) (1, 0) (1, 0)) (t, (0 : E)) :=
+ (hD4 _ (hmemD t ht)).continuousAt
+ have h2 : ContinuousAt (fun s : ℝ => T3 (s, 0) (1, 0) (1, 0) (1, 0)) t :=
+ ContinuousAt.comp (g := fun q => T3 q (1, 0) (1, 0) (1, 0)) (f := fun s : ℝ => (s, (0 : E)))
+ h1 hc.continuousAt
+ exact h2.continuousWithinAt
+ have hGa : Df (-r / 2, 0) (1, 0) = 0 := by simp [hM]
+ have hGc : Df (r / 2, 0) (1, 0) = 0 := by simp [hS]
+ have hxxx : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), 7 / 4 ≤ T3 p (1, 0) (1, 0) (1, 0) := by
+ obtain ⟨x₀, hx₀, h2⟩ := third_deriv_exists_two hr hg hG hG' hφc hGa hGc hnorm
+ exact fxxx_lower (ψ := fun q => T3 q (1, 0) (1, 0) (1, 0)) hr hD4 hn4x hn4y hx₀ h2 hH2
+ exact ridge_capHyp_C3 hr hε hεr hDf hD2 hD3 hT hxxx hGs hH hHx hHxb hHr hHrb hlam hH1 hM hS
+ hG0cv hG0cc hwcv hwcc hnorm
+
+
+/-! ### The derivative bounds from the block bound, and SP's bounds on `D` (v2.1)
+
+Up to v2.0 the capstones took six derivative bounds besides the block bound `hT`:
+- `hHxb` and `hHrb`, the inputs of L3;
+- `hwcv` and `hwcc`, the envelope inputs of L5–L6;
+- `hG0cv` and `hG0cc`, the envelope inputs of L1–L2.
+
+All six follow from `hT` and from `|f_xxx| ≤ m` on the pin segment, and `ridge_capHyp_C5` derives
+them. Up to v2.0 the bounds `m` were also assumed on a collar `[−2r − ε, 2r + ε]` of SP's `D`.
+`ridge_capHyp_D` assumes them on `D` only, through the continuity step `block_bound_collar` (I3). -/
+
+/-- **L3's `x`-input from the block bound.** Let `y ↦ ∂_y f (t, y)` have derivative `H (t, 0)` at `0`
+and `Df` have derivative `D2f (t, 0)` at `(t, 0)` for every `t ∈ J`, where `J` is uniquely
+differentiable at `x ∈ J`. If `t ↦ H (t, 0)` has derivative `Hx'` at `x`, then
+`Hx' v w = T3 (x, 0) [(0, v), (0, w), (1, 0)]`, so `‖Hx'‖ ≤ m` when that block is at most
+`m ‖v‖ ‖w‖`. This derives v1.6's hypothesis `hHxb`. -/
+theorem hessian_x_bound {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}
+ {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ}
+ {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx' : E →L[ℝ] E →L[ℝ] ℝ} {J : Set ℝ} {m x : ℝ}
+ (hJ : UniqueDiffWithinAt ℝ J x) (hxJ : x ∈ J) (hm : 0 ≤ m)
+ (hH : ∀ t ∈ J, HasFDerivAt (fun y => (Df (t, y)).comp (ContinuousLinearMap.inr ℝ ℝ E))
+ (H (t, 0)) 0)
+ (hD2 : ∀ t ∈ J, HasFDerivAt Df (D2f (t, 0)) (t, 0))
+ (hD3 : ∀ a b : ℝ × E, HasFDerivAt (fun q => D2f q a b) (T3 (x, 0) a b) (x, 0))
+ (hT : ∀ v w : E, |T3 (x, 0) (0, v) (0, w) (1, 0)| ≤ m * (‖v‖ * ‖w‖))
+ (hHx : HasDerivAt (fun t => H (t, 0)) Hx' x) : ‖Hx'‖ ≤ m := by
+ have hp : HasDerivAt (fun t : ℝ => (t, (0 : E))) ((1 : ℝ), (0 : E)) x :=
+ (hasDerivAt_id x).prodMk (hasDerivAt_const x (0 : E))
+ have key : ∀ v w : E, Hx' v w = T3 (x, 0) (0, v) (0, w) (1, 0) := by
+ intro v w
+ have h1 : HasDerivAt (fun t => H (t, 0) v w) (Hx' v w) x := by
+ have := (hHx.clm_apply (hasDerivAt_const x v)).clm_apply (hasDerivAt_const x w)
+ simpa using this
+ have h2 : HasDerivAt (fun t => D2f (t, 0) (0, v) (0, w)) (T3 (x, 0) (0, v) (0, w) (1, 0)) x :=
+ HasFDerivAt.comp_hasDerivAt (l := fun q => D2f q (0, v) (0, w)) x (hD3 (0, v) (0, w)) hp
+ have h3 : HasDerivWithinAt (fun t => D2f (t, 0) (0, v) (0, w)) (Hx' v w) J x :=
+ h1.hasDerivWithinAt.congr_of_mem (fun t ht => (transverse_hessian_eq (hH t ht) (hD2 t ht) v w).symm) hxJ
+ exact hJ.eq_deriv _ h3 h2.hasDerivWithinAt
+ refine ContinuousLinearMap.opNorm_le_bound _ hm fun v => ?_
+ refine ContinuousLinearMap.opNorm_le_bound _ (mul_nonneg hm (norm_nonneg v)) fun w => ?_
+ rw [key, Real.norm_eq_abs, mul_assoc]
+ exact hT v w
+
+/-- **L3's radial input from the block bound.** Along the radius `τ ↦ (x, τ y)`, `τ ∈ [0, 1]`, if
+`τ ↦ H (x, τ y)` has derivative `Hr'` at `s`, then `Hr' v w = T3 (x, s y) [(0, v), (0, w), (0, y)]`,
+so `‖Hr'‖ ≤ m ‖y‖` when that block is at most `m ‖v‖ ‖w‖ ‖y‖`. The identification uses derivatives
+within `[0, 1]`, so the endpoint `τ = 1` may lie on the sphere `‖y‖ = 2r`. This derives v1.6's
+hypothesis `hHrb`. -/
+theorem hessian_r_bound {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}
+ {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ}
+ {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hr' : E →L[ℝ] E →L[ℝ] ℝ} {x m s : ℝ} {y : E}
+ (hm : 0 ≤ m) (hs : s ∈ Icc (0 : ℝ) 1)
+ (hH : ∀ τ ∈ Icc (0 : ℝ) 1, HasFDerivAt (fun z => (Df (x, z)).comp (ContinuousLinearMap.inr ℝ ℝ E))
+ (H (x, τ • y)) (τ • y))
+ (hD2 : ∀ τ ∈ Icc (0 : ℝ) 1, HasFDerivAt Df (D2f (x, τ • y)) (x, τ • y))
+ (hD3 : ∀ a b : ℝ × E, HasFDerivAt (fun q => D2f q a b) (T3 (x, s • y) a b) (x, s • y))
+ (hT : ∀ v w : E, |T3 (x, s • y) (0, v) (0, w) (0, y)| ≤ m * (‖v‖ * ‖w‖ * ‖y‖))
+ (hHr : HasDerivAt (fun τ : ℝ => H (x, τ • y)) Hr' s) : ‖Hr'‖ ≤ m * ‖y‖ := by
+ have hp : HasDerivAt (fun τ : ℝ => (x, τ • y)) ((0 : ℝ), y) s := by
+ have := (hasDerivAt_const s x).prodMk ((hasDerivAt_id s).smul_const y)
+ simpa using this
+ have key : ∀ v w : E, Hr' v w = T3 (x, s • y) (0, v) (0, w) (0, y) := by
+ intro v w
+ have h1 : HasDerivAt (fun τ => H (x, τ • y) v w) (Hr' v w) s := by
+ have := (hHr.clm_apply (hasDerivAt_const s v)).clm_apply (hasDerivAt_const s w)
+ simpa using this
+ have h2 : HasDerivAt (fun τ : ℝ => D2f (x, τ • y) (0, v) (0, w))
+ (T3 (x, s • y) (0, v) (0, w) (0, y)) s :=
+ HasFDerivAt.comp_hasDerivAt (l := fun q => D2f q (0, v) (0, w)) s (hD3 (0, v) (0, w)) hp
+ have h3 : HasDerivWithinAt (fun τ : ℝ => D2f (x, τ • y) (0, v) (0, w)) (Hr' v w) (Icc 0 1) s :=
+ h1.hasDerivWithinAt.congr_of_mem
+ (fun τ hτ => (transverse_hessian_eq (hH τ hτ) (hD2 τ hτ) v w).symm) hs
+ exact (uniqueDiffOn_Icc zero_lt_one s hs).eq_deriv _ h3 h2.hasDerivWithinAt
+ have hmy : 0 ≤ m * ‖y‖ := mul_nonneg hm (norm_nonneg y)
+ refine ContinuousLinearMap.opNorm_le_bound _ hmy fun v => ?_
+ refine ContinuousLinearMap.opNorm_le_bound _ (mul_nonneg hmy (norm_nonneg v)) fun w => ?_
+ rw [key, Real.norm_eq_abs]
+ calc |T3 (x, s • y) (0, v) (0, w) (0, y)| ≤ m * (‖v‖ * ‖w‖ * ‖y‖) := hT v w
+ _ = m * ‖y‖ * ‖v‖ * ‖w‖ := by ring
+
+/-- **The envelope inputs of L1 and L5–L6 from a second-derivative bound.** If the second derivative
+`T3 (t, 0) [(1, 0), u, (1, 0)]` of `t ↦ Df (t, 0) u` has absolute value at most `B` on `[a, c]`, then
+`Df (·, 0) u + (B/2) t²` is convex and `Df (·, 0) u − (B/2) t²` is concave there. With `u = (0, v)`
+and `B = m‖v‖` (from the block bound) this gives `hwcv` and `hwcc`. With `u = (1, 0)` and `B = m`
+(SP: `|f_xxx| ≤ M₃`) it gives `hG0cv` and `hG0cc`. -/
+theorem axis_convexConcave {Df : ℝ × E → ℝ × E →L[ℝ] ℝ}
+ {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}
+ {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {a c B : ℝ} {u : ℝ × E}
+ (hD2 : ∀ t ∈ Icc a c, HasFDerivAt Df (D2f (t, 0)) (t, 0))
+ (hD3 : ∀ t ∈ Icc a c, HasFDerivAt (fun q => D2f q (1, 0) u) (T3 (t, 0) (1, 0) u) (t, 0))
+ (hB : ∀ t ∈ Icc a c, |T3 (t, 0) (1, 0) u (1, 0)| ≤ B) :
+ ConvexOn ℝ (Icc a c) (fun t => Df (t, 0) u + B / 2 * t ^ 2) ∧
+ ConcaveOn ℝ (Icc a c) (fun t => Df (t, 0) u - B / 2 * t ^ 2) := by
+ have hp : ∀ t : ℝ, HasDerivAt (fun s : ℝ => (s, (0 : E))) ((1 : ℝ), (0 : E)) t := fun t =>
+ (hasDerivAt_id t).prodMk (hasDerivAt_const t (0 : E))
+ have hg : ∀ t ∈ Icc a c, HasDerivAt (fun s => Df (s, 0) u) (D2f (t, 0) (1, 0) u) t := by
+ intro t ht
+ have h1 : HasDerivAt (fun s => Df (s, 0)) (D2f (t, 0) (1, 0)) t :=
+ (hD2 t ht).comp_hasDerivAt t (hp t)
+ simpa using h1.clm_apply (hasDerivAt_const t u)
+ have hg' : ∀ t ∈ Icc a c, HasDerivAt (fun s => D2f (s, 0) (1, 0) u) (T3 (t, 0) (1, 0) u (1, 0)) t :=
+ fun t ht => HasFDerivAt.comp_hasDerivAt (l := fun q => D2f q (1, 0) u) t (hD3 t ht) (hp t)
+ have hcont : ContinuousOn (fun s => Df (s, 0) u) (Icc a c) :=
+ fun t ht => (hg t ht).continuousAt.continuousWithinAt
+ have hsq : ∀ t : ℝ, HasDerivAt (fun s : ℝ => B / 2 * s ^ 2) (B * t) t := by
+ intro t
+ have := (hasDerivAt_pow 2 t).const_mul (B / 2)
+ convert this using 1
+ ring
+ have hlin : ∀ t : ℝ, HasDerivAt (fun s : ℝ => B * s) B t := by
+ intro t
+ simpa using (hasDerivAt_id t).const_mul B
+ have hIo : ∀ t ∈ interior (Icc a c), t ∈ Icc a c := fun t ht => interior_subset ht
+ constructor
+ · refine convexOn_of_hasDerivWithinAt2_nonneg (convex_Icc a c)
+ (f' := fun t => D2f (t, 0) (1, 0) u + B * t) (f'' := fun t => T3 (t, 0) (1, 0) u (1, 0) + B)
+ (hcont.add (continuousOn_const.mul (continuousOn_id.pow 2))) ?_ ?_ ?_
+ · intro t ht
+ exact ((hg t (hIo t ht)).add (hsq t)).hasDerivWithinAt
+ · intro t ht
+ exact ((hg' t (hIo t ht)).add (hlin t)).hasDerivWithinAt
+ · intro t ht
+ have := hB t (hIo t ht)
+ have := neg_abs_le (T3 (t, 0) (1, 0) u (1, 0))
+ show 0 ≤ T3 (t, 0) (1, 0) u (1, 0) + B
+ linarith
+ · refine concaveOn_of_hasDerivWithinAt2_nonpos (convex_Icc a c)
+ (f' := fun t => D2f (t, 0) (1, 0) u - B * t) (f'' := fun t => T3 (t, 0) (1, 0) u (1, 0) - B)
+ (hcont.sub (continuousOn_const.mul (continuousOn_id.pow 2))) ?_ ?_ ?_
+ · intro t ht
+ exact ((hg t (hIo t ht)).sub (hsq t)).hasDerivWithinAt
+ · intro t ht
+ exact ((hg' t (hIo t ht)).sub (hlin t)).hasDerivWithinAt
+ · intro t ht
+ have := hB t (hIo t ht)
+ have := le_abs_self (T3 (t, 0) (1, 0) u (1, 0))
+ show T3 (t, 0) (1, 0) u (1, 0) - B ≤ 0
+ linarith
+
+/-- The block weight `∏ (|sᵢ| + ‖yᵢ‖) − ∏ |sᵢ|` is nonnegative. -/
+theorem block_nonneg {F : Type*} [SeminormedAddCommGroup F] (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : F) :
+ 0 ≤ (|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃| := by
+ have a1 : |s₁| ≤ |s₁| + ‖y₁‖ := le_add_of_nonneg_right (norm_nonneg _)
+ have a2 : |s₂| ≤ |s₂| + ‖y₂‖ := le_add_of_nonneg_right (norm_nonneg _)
+ have a3 : |s₃| ≤ |s₃| + ‖y₃‖ := le_add_of_nonneg_right (norm_nonneg _)
+ have := mul_le_mul (mul_le_mul a1 a2 (abs_nonneg _) (by positivity)) a3 (abs_nonneg _)
+ (by positivity)
+ linarith
+
+/-- **The continuity step of I3: the block bound from `D` to a collar.** Assume the block bound holds
+with `m` on SP's `D = [−2r, 2r] × B̄(0, 2r)`. Assume also that on the collar
+`[−2r − ε₀, 2r + ε₀] × B̄(0, 2r)` the `x`-derivative `T4` of `T3` exists and satisfies the same block
+bound with some `K ≥ 0` (SP: `f ∈ C⁴` near `D`, so `‖D⁴ f‖` is bounded on a compact collar). Then the
+block bound holds with `m + Kε` on the collar of width `ε ≤ ε₀`. Each collar point `(x, y)` is
+within `ε` of a point `(x₀, y) ∈ D`, and the mean value inequality along `x` gives the rest. -/
+theorem block_bound_collar {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ}
+ {T4 : ℝ × E → ℝ × E → ℝ × E → ℝ × E → ℝ} {r m K ε₀ ε : ℝ} (hr : 0 < r) (hK : 0 ≤ K)
+ (hε : 0 ≤ ε) (hεε : ε ≤ ε₀)
+ (hT : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),
+ |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤
+ m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))
+ (hD4x : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ a b c : ℝ × E, HasDerivAt (fun t => T3 (t, p.2) a b c) (T4 p a b c) p.1)
+ (hT4 : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),
+ |T4 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T4 p (1, 0) (1, 0) (1, 0)| ≤
+ K * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|)) :
+ ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),
+ |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤
+ (m + K * ε) * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|) := by
+ rintro ⟨x, y⟩ ⟨hx, hy⟩ s₁ s₂ s₃ y₁ y₂ y₃
+ have hX := block_nonneg s₁ s₂ s₃ y₁ y₂ y₃
+ set X := (|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃| with hXdef
+ obtain ⟨x₀, hx₀, hxx₀⟩ : ∃ x₀ ∈ Icc (-2 * r) (2 * r), |x - x₀| ≤ ε := by
+ by_cases h1 : x ≤ -2 * r
+ · refine ⟨-2 * r, ⟨le_rfl, ?_⟩, ?_⟩
+ · linarith [hx.1]
+ · rw [abs_le]; constructor <;> linarith [hx.1]
+ · by_cases h2 : 2 * r ≤ x
+ · refine ⟨2 * r, ⟨?_, le_rfl⟩, ?_⟩
+ · linarith
+ · rw [abs_le]; constructor <;> linarith [hx.2]
+ · exact ⟨x, ⟨by linarith, by linarith⟩, by simp [hε]⟩
+ set g : ℝ → ℝ := fun t => T3 (t, y) (s₁, y₁) (s₂, y₂) (s₃, y₃) -
+ s₁ * s₂ * s₃ * T3 (t, y) (1, 0) (1, 0) (1, 0) with hg
+ have hderiv : ∀ t ∈ Icc (-2 * r - ε₀) (2 * r + ε₀), HasDerivWithinAt g
+ (T4 (t, y) (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T4 (t, y) (1, 0) (1, 0) (1, 0))
+ (Icc (-2 * r - ε₀) (2 * r + ε₀)) t := by
+ intro t ht
+ have hp : (t, y) ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r) := ⟨ht, hy⟩
+ have h1 : HasDerivAt (fun t => T3 (t, y) (s₁, y₁) (s₂, y₂) (s₃, y₃))
+ (T4 (t, y) (s₁, y₁) (s₂, y₂) (s₃, y₃)) t := hD4x _ hp _ _ _
+ have h2 : HasDerivAt (fun t => T3 (t, y) (1, 0) (1, 0) (1, 0)) (T4 (t, y) (1, 0) (1, 0) (1, 0)) t :=
+ hD4x _ hp _ _ _
+ exact (h1.sub (h2.const_mul (s₁ * s₂ * s₃))).hasDerivWithinAt
+ have hbound : ∀ t ∈ Icc (-2 * r - ε₀) (2 * r + ε₀),
+ ‖T4 (t, y) (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T4 (t, y) (1, 0) (1, 0) (1, 0)‖ ≤ K * X :=
+ fun t ht => by rw [Real.norm_eq_abs]; exact hT4 (t, y) ⟨ht, hy⟩ _ _ _ _ _ _
+ have hxS : x ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) := ⟨by linarith [hx.1], by linarith [hx.2]⟩
+ have hx₀S : x₀ ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) :=
+ ⟨by linarith [hx₀.1, hε, hεε], by linarith [hx₀.2, hε, hεε]⟩
+ have hmvt := (convex_Icc (-2 * r - ε₀) (2 * r + ε₀)).norm_image_sub_le_of_norm_hasDerivWithin_le
+ hderiv hbound hx₀S hxS
+ rw [Real.norm_eq_abs, Real.norm_eq_abs] at hmvt
+ have h0 : |g x₀| ≤ m * X := hT (x₀, y) ⟨hx₀, hy⟩ s₁ s₂ s₃ y₁ y₂ y₃
+ have hKX : 0 ≤ K * X := mul_nonneg hK hX
+ have h3 : K * X * |x - x₀| ≤ K * X * ε := mul_le_mul_of_nonneg_left hxx₀ hKX
+ have h4 := abs_sub_abs_le_abs_sub (g x) (g x₀)
+ show |g x| ≤ (m + K * ε) * X
+ nlinarith
+
+/-- **The cap from the block bound alone.** `ridge_capHyp_C4` with its six derivative-bound
+hypotheses derived. `hHxb`, `hHrb`, `hwcv` and `hwcc` come from the block bound `hT`
+(`hessian_x_bound`, `hessian_r_bound`, `axis_convexConcave`). `hG0cv` and `hG0cc` come from
+`|f_xxx| ≤ m` on the pin segment (`hTe`, SP: `|f_xxx| ≤ M₃`). The conclusion is unchanged. -/
+theorem ridge_capHyp_C5 [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}
+ {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}
+ {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {Φ4 : ℝ × E → ℝ × E →L[ℝ] ℝ} {n : ℝ}
+ {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}
+ {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}
+ {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)
+ (hεr : ε ≤ r / 2)
+ (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)
+ (hD2 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)
+ (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)
+ (hT : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),
+ |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤
+ m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))
+ (hTe : ∀ x ∈ Icc (-r / 2) (r / 2), |T3 (x, 0) (1, 0) (1, 0) (1, 0)| ≤ m)
+ (hD4 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun q => T3 q (1, 0) (1, 0) (1, 0)) (Φ4 p) p)
+ (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), |Φ4 p (1, 0)| ≤ n)
+ (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ‖(Φ4 p).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ n)
+ (hH2 : r * n ≤ 1 / 20)
+ (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)
+ (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)
+ (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)
+ (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)
+ (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)
+ (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)
+ (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :
+ (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧
+ ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),
+ h x ∈ Metric.closedBall (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →
+ h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0)
+ (2 * r, h (2 * r)) (f (-r / 2, 0)) (f (r / 2, 0)) ∧
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, 0) → f x < f (r / 2, 0) := by
+ have hm0 : 0 ≤ m := (abs_nonneg _).trans (hTe 0 ⟨by linarith, by linarith⟩)
+ have h0Y : (0 : E) ∈ Metric.closedBall (0 : E) (2 * r) := Metric.mem_closedBall_self (by positivity)
+ have hax : ∀ t ∈ Icc (-2 * r - ε) (2 * r + ε),
+ (t, (0 : E)) ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r) :=
+ fun t ht => ⟨ht, h0Y⟩
+ have hpin : ∀ t ∈ Icc (-r / 2) (r / 2),
+ (t, (0 : E)) ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r) :=
+ fun t ht => hax t ⟨by linarith [ht.1], by linarith [ht.2]⟩
+ -- `∂_x D_y² f`
+ have hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m := by
+ intro x hx
+ refine hessian_x_bound (J := Icc (-2 * r - ε) (2 * r + ε))
+ (uniqueDiffOn_Icc (by linarith) x hx) hx hm0 (fun t ht => hH _ (hax t ht))
+ (fun t ht => hD2 _ (hax t ht)) (hD3 _ (hax x hx)) (fun v w => ?_) (hHx x hx)
+ have := hT _ (hax x hx) 0 0 1 v w 0
+ simpa using this
+ -- `∂_ρ D_y² f`
+ have hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖ := by
+ rintro ⟨x, y⟩ hp s hs
+ have hyb : ‖y‖ ≤ 2 * r := by simpa [Metric.mem_closedBall, dist_zero_right] using hp.2
+ have hseg : ∀ τ ∈ Icc (0 : ℝ) 1,
+ (x, τ • y) ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r) := by
+ intro τ hτ
+ refine ⟨hp.1, ?_⟩
+ rw [Metric.mem_closedBall, dist_zero_right, norm_smul, Real.norm_eq_abs, abs_of_nonneg hτ.1]
+ nlinarith [hτ.2, norm_nonneg y]
+ refine hessian_r_bound hm0 hs (fun τ hτ => hH _ (hseg τ hτ)) (fun τ hτ => hD2 _ (hseg τ hτ))
+ (hD3 _ (hseg s hs)) (fun v w => ?_) (hHr _ hp s hs)
+ have := hT _ (hseg s hs) 0 0 0 v w y
+ simpa using this
+ -- `w = ∂_y f (·, 0)` and `G0 = ∂_x f (·, 0)`
+ have hw : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))
+ (fun t => Df (t, 0) (0, v) + m * ‖v‖ / 2 * t ^ 2) ∧
+ ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε)) (fun t => Df (t, 0) (0, v) - m * ‖v‖ / 2 * t ^ 2) :=
+ fun v => axis_convexConcave (fun t ht => hD2 _ (hax t ht))
+ (fun t ht => hD3 _ (hax t ht) (1, 0) (0, v))
+ (fun t ht => by have := hT _ (hax t ht) 1 0 1 0 v 0; simpa using this)
+ have hG0 := axis_convexConcave (u := ((1 : ℝ), (0 : E))) (fun t ht => hD2 _ (hpin t ht))
+ (fun t ht => hD3 _ (hpin t ht) (1, 0) (1, 0)) hTe
+ exact ridge_capHyp_C4 hr hε hεr hDf hD2 hD3 hT hD4 hn4x hn4y hH2 hGs hH hHx hHxb hHr hHrb hlam
+ hH1 hM hS hG0.1 hG0.2 (fun v => (hw v).1) (fun v => (hw v).2) hnorm
+
+/-- **The cap from SP's bounds on `D` (the continuity step of I3).** The quantitative hypotheses are
+assumed on SP's `D` only:
+- the block bound `m` and `|f_xxx| ≤ m` on the pin segment;
+- SP's `M₄` blocks `n`;
+- (H1) and (H2).
+
+On a collar of some width `ε₀ > 0`, only qualitative data are assumed: the derivatives, the strict
+derivative of `∂_y f`, and some bound `K ≥ 0` on the `x`-derivative of `T3` in block form (SP:
+`f ∈ C⁴` near `D`). Because (H1) is strict, some `ε ∈ (0, ε₀]` keeps `8r(m + Kε)² < λ`.
+`ridge_capHyp_C5` then applies with `m + Kε` (`block_bound_collar`). -/
+theorem ridge_capHyp_D [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}
+ {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}
+ {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {T4 : ℝ × E → ℝ × E → ℝ × E → ℝ × E → ℝ}
+ {Φ4 : ℝ × E → ℝ × E →L[ℝ] ℝ} {n : ℝ}
+ {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}
+ {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}
+ {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m K lam ε₀ : ℝ} (hr : 0 < r) (hε₀ : 0 < ε₀)
+ (hK : 0 ≤ K)
+ (hDf : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)
+ (hD2 : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)
+ (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)
+ (hD4x : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ a b c : ℝ × E, HasDerivAt (fun t => T3 (t, p.2) a b c) (T4 p a b c) p.1)
+ (hT4 : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),
+ |T4 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T4 p (1, 0) (1, 0) (1, 0)| ≤
+ K * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))
+ (hT : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),
+ |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤
+ m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))
+ (hTe : ∀ x ∈ Icc (-r / 2) (r / 2), |T3 (x, 0) (1, 0) (1, 0) (1, 0)| ≤ m)
+ (hD4 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun q => T3 q (1, 0) (1, 0) (1, 0)) (Φ4 p) p)
+ (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), |Φ4 p (1, 0)| ≤ n)
+ (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ‖(Φ4 p).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ n)
+ (hH2 : r * n ≤ 1 / 20)
+ (hGs : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)
+ (hH : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)
+ (hHx : ∀ x ∈ Icc (-2 * r - ε₀) (2 * r + ε₀), HasDerivAt (fun t => H (t, 0)) (Hx x) x)
+ (hHr : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)
+ (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)
+ (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)
+ (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :
+ ∃ ε, 0 < ε ∧ ε ≤ ε₀ ∧
+ (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧
+ ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),
+ h x ∈ Metric.closedBall (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →
+ h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0)
+ (2 * r, h (2 * r)) (f (-r / 2, 0)) (f (r / 2, 0)) ∧
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, 0) → f x < f (r / 2, 0) := by
+ have hev : ∀ᶠ ε in 𝓝[>] (0 : ℝ), 0 < ε ∧ ε ≤ ε₀ ∧ ε ≤ r / 2 ∧ 8 * r * (m + K * ε) ^ 2 < lam := by
+ have hc : ContinuousAt (fun ε : ℝ => 8 * r * (m + K * ε) ^ 2) 0 := by fun_prop
+ have h1 : ∀ᶠ ε in 𝓝 (0 : ℝ), 8 * r * (m + K * ε) ^ 2 < lam :=
+ hc.eventually_lt continuousAt_const (by simpa using hH1)
+ have h2 : ∀ᶠ ε in 𝓝 (0 : ℝ), ε < ε₀ := eventually_lt_nhds hε₀
+ have h3 : ∀ᶠ ε in 𝓝 (0 : ℝ), ε < r / 2 := eventually_lt_nhds (by linarith)
+ filter_upwards [self_mem_nhdsWithin, nhdsWithin_le_nhds h1, nhdsWithin_le_nhds h2,
+ nhdsWithin_le_nhds h3] with ε hε h1 h2 h3
+ exact ⟨hε, h2.le, h3.le, h1⟩
+ obtain ⟨ε, hε, hεε, hεr, hH1'⟩ := hev.exists
+ have hsub : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r) :=
+ fun p hp => ⟨⟨by linarith [hp.1.1], by linarith [hp.1.2]⟩, hp.2⟩
+ have hsubI : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), x ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) :=
+ fun x hx => ⟨by linarith [hx.1], by linarith [hx.2]⟩
+ have hmm : m ≤ m + K * ε := le_add_of_nonneg_right (mul_nonneg hK hε.le)
+ exact ⟨ε, hε, hεε, ridge_capHyp_C5 (m := m + K * ε) hr hε hεr (fun p hp => hDf p (hsub p hp))
+ (fun p hp => hD2 p (hsub p hp)) (fun p hp => hD3 p (hsub p hp))
+ (block_bound_collar hr hK hε.le hεε hT hD4x hT4) (fun x hx => (hTe x hx).trans hmm)
+ hD4 hn4x hn4y hH2 (fun p hp => hGs p (hsub p hp)) (fun p hp => hH p (hsub p hp))
+ (fun x hx => hHx x (hsubI x hx)) (fun p hp => hHr p (hsub p hp)) hlam hH1' hM hS hnorm⟩
+
+
+/-! ### SP's `f ∈ C⁴` near `D` supplies the collar data (v2.2)
+
+`block_of_norm` turns a bound on the norm of a trilinear form into the block bound, and
+`collar_subset_open` finds a closed collar inside an open neighbourhood of `D`. `ridge_capHyp_E`
+takes `f ∈ C⁴` on an open `U ⊇ D` and SP's quantitative bounds on `D`, written with the iterated
+derivatives `iteratedFDeriv ℝ k f`. It builds every derivative datum of `ridge_capHyp_D` from `f`,
+and it takes the collar width from `collar_subset_open` and `K` from the continuity of `D⁴f` on the
+compact collar. -/
+
+/-- **The block bound from the norm.** A trilinear form `B` on `ℝ × E` with `‖B‖ ≤ K` satisfies
+the block bound with constant `K`. For `a = (s₁, y₁)`, `b = (s₂, y₂)`, `c = (s₃, y₃)` and
+`e = (1, 0)`:
+`|B(a, b, c) - s₁s₂s₃ B(e, e, e)| ≤ K((|s₁| + ‖y₁‖)(|s₂| + ‖y₂‖)(|s₃| + ‖y₃‖) - |s₁||s₂||s₃|)`.
+Replacing one slot at a time by `sᵢ e` leaves three terms, and each has a transverse argument
+`(0, yᵢ)`. -/
+theorem block_of_norm {B : ContinuousMultilinearMap ℝ (fun _ : Fin 3 => ℝ × E) ℝ} {K : ℝ}
+ (hB : ‖B‖ ≤ K) (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E) :
+ |B ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] - s₁ * s₂ * s₃ * B ![(1, 0), (1, 0), (1, 0)]| ≤
+ K * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|) := by
+ have hK : 0 ≤ K := (norm_nonneg _).trans hB
+ have hb : ∀ a b c : ℝ × E, |B ![a, b, c]| ≤ K * ‖a‖ * ‖b‖ * ‖c‖ := by
+ intro a b c
+ have h := B.le_opNorm ![a, b, c]
+ simp only [Fin.prod_univ_three, Matrix.cons_val_zero, Matrix.cons_val_one,
+ Matrix.cons_val_two, Matrix.tail_cons, Matrix.head_cons] at h
+ rw [← Real.norm_eq_abs]
+ calc ‖B ![a, b, c]‖ ≤ ‖B‖ * (‖a‖ * ‖b‖ * ‖c‖) := h
+ _ ≤ K * (‖a‖ * ‖b‖ * ‖c‖) := by gcongr
+ _ = K * ‖a‖ * ‖b‖ * ‖c‖ := by ring
+ have h1 : ∀ x x' b c : ℝ × E, B ![x, b, c] - B ![x', b, c] = B ![x - x', b, c] := by
+ intro x x' b c
+ have hu : ∀ z, Function.update ![x, b, c] 0 z = ![z, b, c] := fun z => by
+ funext i; fin_cases i <;> simp
+ have := B.map_update_sub ![x, b, c] 0 x x'
+ rw [hu, hu, hu] at this
+ exact this.symm
+ have h2 : ∀ a x x' c : ℝ × E, B ![a, x, c] - B ![a, x', c] = B ![a, x - x', c] := by
+ intro a x x' c
+ have hu : ∀ z, Function.update ![a, x, c] 1 z = ![a, z, c] := fun z => by
+ funext i; fin_cases i <;> simp
+ have := B.map_update_sub ![a, x, c] 1 x x'
+ rw [hu, hu, hu] at this
+ exact this.symm
+ have h3 : ∀ a b x x' : ℝ × E, B ![a, b, x] - B ![a, b, x'] = B ![a, b, x - x'] := by
+ intro a b x x'
+ have hu : ∀ z, Function.update ![a, b, x] 2 z = ![a, b, z] := fun z => by
+ funext i; fin_cases i <;> simp
+ have := B.map_update_sub ![a, b, x] 2 x x'
+ rw [hu, hu, hu] at this
+ exact this.symm
+ set e : ℝ × E := ((1 : ℝ), (0 : E)) with he_def
+ have hsm : B ![s₁ • e, s₂ • e, s₃ • e] = s₁ * s₂ * s₃ * B ![e, e, e] := by
+ have := B.map_smul_univ ![s₁, s₂, s₃] ![e, e, e]
+ have hv : (fun i => (![s₁, s₂, s₃] : Fin 3 → ℝ) i • (![e, e, e] : Fin 3 → ℝ × E) i) =
+ ![s₁ • e, s₂ • e, s₃ • e] := by
+ funext i; fin_cases i <;> simp
+ rw [hv, Fin.prod_univ_three] at this
+ simpa [smul_eq_mul, mul_assoc] using this
+ have hd : ∀ (s : ℝ) (y : E), ((s, y) : ℝ × E) - s • e = ((0 : ℝ), y) := by
+ intro s y; ext <;> simp [he_def]
+ have hn : ∀ (s : ℝ) (y : E), ‖((s, y) : ℝ × E)‖ ≤ |s| + ‖y‖ := by
+ intro s y
+ rw [Prod.norm_def, Real.norm_eq_abs]
+ exact max_le_add_of_nonneg (abs_nonneg _) (norm_nonneg _)
+ have hn0 : ∀ y : E, ‖((0 : ℝ), y)‖ = ‖y‖ := by intro y; simp [Prod.norm_def]
+ have hne : ∀ s : ℝ, ‖s • e‖ = |s| := by
+ intro s; rw [norm_smul, Real.norm_eq_abs]; simp [he_def, Prod.norm_def]
+ have tel : B ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] - s₁ * s₂ * s₃ * B ![e, e, e] =
+ B ![((0 : ℝ), y₁), (s₂, y₂), (s₃, y₃)] + B ![s₁ • e, ((0 : ℝ), y₂), (s₃, y₃)] +
+ B ![s₁ • e, s₂ • e, ((0 : ℝ), y₃)] := by
+ rw [← hsm, ← hd s₁ y₁, ← hd s₂ y₂, ← hd s₃ y₃, ← h1, ← h2, ← h3]
+ ring
+ rw [tel]
+ have k1 : |B ![((0 : ℝ), y₁), (s₂, y₂), (s₃, y₃)]| ≤
+ K * ‖y₁‖ * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) := by
+ refine (hb _ _ _).trans ?_
+ rw [hn0]
+ gcongr
+ · exact hn _ _
+ · exact hn _ _
+ have k2 : |B ![s₁ • e, ((0 : ℝ), y₂), (s₃, y₃)]| ≤ K * |s₁| * ‖y₂‖ * (|s₃| + ‖y₃‖) := by
+ refine (hb _ _ _).trans ?_
+ rw [hn0, hne]
+ gcongr
+ exact hn _ _
+ have k3 : |B ![s₁ • e, s₂ • e, ((0 : ℝ), y₃)]| ≤ K * |s₁| * |s₂| * ‖y₃‖ := by
+ refine (hb _ _ _).trans ?_
+ rw [hn0, hne, hne]
+ calc _ ≤ _ := abs_add_three _ _ _
+ _ ≤ K * ‖y₁‖ * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) + K * |s₁| * ‖y₂‖ * (|s₃| + ‖y₃‖) +
+ K * |s₁| * |s₂| * ‖y₃‖ := by gcongr
+ _ = _ := by ring
+
+omit [NormedSpace ℝ E] in
+/-- **A collar inside a neighbourhood of `D`.** If an open `U` contains
+`D = [-2r, 2r] × B̄(0, 2r)` and `E` is proper, then some closed collar
+`[-2r - ε₀, 2r + ε₀] × B̄(0, 2r)` with `ε₀ > 0` lies in `U`: `D` is compact, so a closed
+thickening of `D` lies in `U`. -/
+theorem collar_subset_open [ProperSpace E] {U : Set (ℝ × E)} {r : ℝ} (hr : 0 < r) (hU : IsOpen U)
+ (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U) :
+ ∃ ε₀ > 0, Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U := by
+ obtain ⟨δ, hδ, hsub⟩ :=
+ (isCompact_Icc.prod (isCompact_closedBall (0 : E) (2 * r))).exists_cthickening_subset_open hU hDU
+ refine ⟨δ, hδ, ?_⟩
+ rintro ⟨x, y⟩ ⟨hx, hy⟩
+ apply hsub
+ obtain ⟨x₀, hx₀, hxx₀⟩ : ∃ x₀ ∈ Icc (-2 * r) (2 * r), |x - x₀| ≤ δ := by
+ by_cases h1 : x ≤ -2 * r
+ · refine ⟨-2 * r, ⟨le_rfl, ?_⟩, ?_⟩
+ · linarith [hx.1]
+ · rw [abs_le]; constructor <;> linarith [hx.1]
+ · by_cases h2 : 2 * r ≤ x
+ · refine ⟨2 * r, ⟨?_, le_rfl⟩, ?_⟩
+ · linarith
+ · rw [abs_le]; constructor <;> linarith [hx.2]
+ · exact ⟨x, ⟨by linarith, by linarith⟩, by simp [hδ.le]⟩
+ refine Metric.mem_cthickening_of_dist_le (x, y) (x₀, y) δ _ ⟨hx₀, hy⟩ ?_
+ rw [Prod.dist_eq, dist_self, Real.dist_eq]
+ exact max_le hxx₀ hδ.le
+
+/-- **The cap from `f ∈ C⁴` near `D` and SP's bounds on `D` (I3's qualitative part).** Assume
+that `f` is `C⁴` on an open `U ⊇ D` (SP: `f ∈ C⁴` near `D`). Assume also SP's quantitative
+hypotheses on `D`, written with `D^k f(p)[v₁, …, v_k] = iteratedFDeriv ℝ k f p ![v₁, …, v_k]` and
+`e = (1, 0)`:
+- the block bound `m` on `D³f`, and `|f_xxx| ≤ m` on the pin segment;
+- SP's `M₄` blocks `n`: `|D⁴f[e, e, e, e]| ≤ n` and `|D⁴f[(0, v), e, e, e]| ≤ n‖v‖`;
+- (H1): `D²f(M)[(0, v), (0, v)] ≤ -λ‖v‖²` with `8rm² < λ`; and (H2);
+- `M = (-r/2, 0)` and `S = (r/2, 0)` are critical, and `f(M) - f(S) = r³/6`.
+
+Then `ridge_capHyp_D` applies. Its collar width comes from `collar_subset_open`, and its derivative
+data are the Fréchet derivatives of `f` (`T3`, `T4` and `Φ4` are slices of `D³f` and `D⁴f`). Its
+`K` bounds `‖D⁴f‖` on the compact collar. No derivative datum and no bound off `D` is assumed. -/
+theorem ridge_capHyp_E [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {U : Set (ℝ × E)}
+ {r m n lam : ℝ} (hr : 0 < r) (hU : IsOpen U)
+ (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)
+ (hf : ContDiffOn ℝ 4 f U)
+ (hT : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),
+ |iteratedFDeriv ℝ 3 f p ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] -
+ s₁ * s₂ * s₃ * iteratedFDeriv ℝ 3 f p ![(1, 0), (1, 0), (1, 0)]| ≤
+ m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))
+ (hTe : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 f (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ m)
+ (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ |iteratedFDeriv ℝ 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ n)
+ (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,
+ |iteratedFDeriv ℝ 4 f p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ n * ‖v‖)
+ (hH2 : r * n ≤ 1 / 20)
+ (hlam : ∀ v : E, iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)
+ (hH1 : 8 * r * m ^ 2 < lam)
+ (hM : fderiv ℝ f (-r / 2, 0) = 0) (hS : fderiv ℝ f (r / 2, 0) = 0)
+ (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :
+ ∃ ε, 0 < ε ∧
+ (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧
+ ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),
+ h x ∈ Metric.closedBall (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →
+ h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0)
+ (2 * r, h (2 * r)) (f (-r / 2, 0)) (f (r / 2, 0)) ∧
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, 0) → f x < f (r / 2, 0) := by
+ obtain ⟨ε₀, hε₀, hcU⟩ := collar_subset_open hr hU hDU
+ have hcpt : IsCompact (Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r)) :=
+ isCompact_Icc.prod (isCompact_closedBall _ _)
+ -- regularity of the derivatives on `U`
+ have hf1 : ContDiffOn ℝ 3 (fderiv ℝ f) U := hf.fderiv_of_isOpen hU (by norm_num)
+ have hf2 : ContDiffOn ℝ 2 (fderiv ℝ (fderiv ℝ f)) U := hf1.fderiv_of_isOpen hU (by norm_num)
+ have dDf : ∀ p ∈ U, HasFDerivAt f (fderiv ℝ f p) p := fun p hp =>
+ ((hf.differentiableOn (by norm_num)).differentiableAt (hU.mem_nhds hp)).hasFDerivAt
+ have dD2 : ∀ p ∈ U, HasFDerivAt (fderiv ℝ f) (fderiv ℝ (fderiv ℝ f) p) p := fun p hp =>
+ ((hf1.differentiableOn (by norm_num)).differentiableAt (hU.mem_nhds hp)).hasFDerivAt
+ have dD3 : ∀ p ∈ U, HasFDerivAt (fderiv ℝ (fderiv ℝ f)) (fderiv ℝ (fderiv ℝ (fderiv ℝ f)) p) p :=
+ fun p hp => ((hf2.differentiableOn (by norm_num)).differentiableAt (hU.mem_nhds hp)).hasFDerivAt
+ have sD2 : ∀ p ∈ U, HasStrictFDerivAt (fderiv ℝ f) (fderiv ℝ (fderiv ℝ f) p) p := fun p hp =>
+ (hf1.contDiffAt (hU.mem_nhds hp)).hasStrictFDerivAt (by norm_num)
+ have dI2 : ∀ p ∈ U, HasFDerivAt (iteratedFDeriv ℝ 2 f) (fderiv ℝ (iteratedFDeriv ℝ 2 f) p) p :=
+ fun p hp => ((hf.contDiffAt (hU.mem_nhds hp)).differentiableAt_iteratedFDeriv
+ (by norm_num)).hasFDerivAt
+ have dI3 : ∀ p ∈ U, HasFDerivAt (iteratedFDeriv ℝ 3 f) (fderiv ℝ (iteratedFDeriv ℝ 3 f) p) p :=
+ fun p hp => ((hf.contDiffAt (hU.mem_nhds hp)).differentiableAt_iteratedFDeriv
+ (by norm_num)).hasFDerivAt
+ have hc4 : ContinuousOn (iteratedFDeriv ℝ 4 f) U :=
+ (hf.continuousOn_iteratedFDerivWithin le_rfl hU.uniqueDiffOn).congr
+ (fun x hx => (iteratedFDerivWithin_of_isOpen 4 hU hx).symm)
+ -- the bound `K` on `D⁴f` over the compact collar
+ obtain ⟨C, hC⟩ := hcpt.exists_bound_of_continuousOn (hc4.mono hcU)
+ have hD2 : ∀ (p : ℝ × E) (a b : ℝ × E),
+ fderiv ℝ (fderiv ℝ f) p a b = iteratedFDeriv ℝ 2 f p ![a, b] := by
+ intro p a b; rw [iteratedFDeriv_two_apply]; rfl
+ have he : ‖((1 : ℝ), (0 : E))‖ = 1 := by simp [Prod.norm_def]
+ have hpath : ∀ (x : ℝ) (y : E), HasDerivAt (fun t : ℝ => ((t, y) : ℝ × E)) ((1 : ℝ), (0 : E)) x :=
+ fun x y => (hasDerivAt_id x).prodMk (hasDerivAt_const x y)
+ set Ψ : ((ℝ × E) →L[ℝ] ℝ) →L[ℝ] (E →L[ℝ] ℝ) :=
+ ContinuousLinearMap.precomp ℝ (ContinuousLinearMap.inr ℝ ℝ E) with hΨ
+ set Ξ : ((ℝ × E) →L[ℝ] (ℝ × E) →L[ℝ] ℝ) →L[ℝ] (E →L[ℝ] E →L[ℝ] ℝ) :=
+ (ContinuousLinearMap.postcomp E Ψ).comp
+ (ContinuousLinearMap.precomp ((ℝ × E) →L[ℝ] ℝ) (ContinuousLinearMap.inr ℝ ℝ E)) with hΞ
+ have hn0 : 0 ≤ n := (abs_nonneg _).trans (hn4x (0, 0) ⟨⟨by linarith, by linarith⟩, by
+ simp only [Metric.mem_closedBall, dist_self]; linarith⟩)
+ have key := ridge_capHyp_D (E := E) (f := f) (Df := fderiv ℝ f) (D2f := fderiv ℝ (fderiv ℝ f))
+ (T3 := fun p a b => (ContinuousMultilinearMap.apply ℝ (fun _ : Fin 2 => ℝ × E) ℝ ![a, b]).comp
+ (fderiv ℝ (iteratedFDeriv ℝ 2 f) p))
+ (T4 := fun p a b c => iteratedFDeriv ℝ 4 f p ![(1, 0), c, a, b])
+ (Φ4 := fun p => (ContinuousMultilinearMap.apply ℝ (fun _ : Fin 3 => ℝ × E) ℝ
+ ![(1, 0), (1, 0), (1, 0)]).comp (fderiv ℝ (iteratedFDeriv ℝ 3 f) p)) (n := n)
+ (DG := fun p => Ψ.comp (fderiv ℝ (fderiv ℝ f) p))
+ (H := fun p => Ξ (fderiv ℝ (fderiv ℝ f) p))
+ (Hx := fun x => Ξ (fderiv ℝ (fderiv ℝ (fderiv ℝ f)) (x, 0) (1, 0)))
+ (Hr := fun p s => Ξ (fderiv ℝ (fderiv ℝ (fderiv ℝ f)) (p.1, s • p.2) (0, p.2)))
+ (r := r) (m := m) (K := max C 0) (lam := lam) (ε₀ := ε₀) hr hε₀ (le_max_right _ _)
+ (fun p hp => dDf p (hcU hp)) (fun p hp => dD2 p (hcU hp))
+ (fun p hp a b => by
+ have h := (ContinuousMultilinearMap.apply ℝ (fun _ : Fin 2 => ℝ × E) ℝ ![a, b]).hasFDerivAt.comp
+ p (dI2 p (hcU hp))
+ have hfun : (fun q => fderiv ℝ (fderiv ℝ f) q a b) =
+ (ContinuousMultilinearMap.apply ℝ (fun _ : Fin 2 => ℝ × E) ℝ ![a, b]) ∘
+ iteratedFDeriv ℝ 2 f := funext fun q => hD2 q a b
+ rw [hfun]; exact h)
+ (fun p hp a b c => by
+ have h := (ContinuousMultilinearMap.apply ℝ (fun _ : Fin 3 => ℝ × E) ℝ ![c, a, b]).hasFDerivAt.comp_hasDerivAt
+ p.1 ((dI3 (p.1, p.2) (hcU hp)).comp_hasDerivAt p.1 (hpath p.1 p.2))
+ exact h)
+ (fun p hp s₁ s₂ s₃ y₁ y₂ y₃ => by
+ have hB : ‖(iteratedFDeriv ℝ 4 f p).curryLeft ((1 : ℝ), (0 : E))‖ ≤ max C 0 := by
+ refine ((iteratedFDeriv ℝ 4 f p).curryLeft.le_opNorm _).trans ?_
+ rw [ContinuousMultilinearMap.curryLeft_norm, he, mul_one]
+ exact (hC p hp).trans (le_max_left _ _)
+ have h := block_of_norm hB s₃ s₁ s₂ y₃ y₁ y₂
+ show |iteratedFDeriv ℝ 4 f p ![(1, 0), (s₃, y₃), (s₁, y₁), (s₂, y₂)] -
+ s₁ * s₂ * s₃ * iteratedFDeriv ℝ 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ _
+ rw [show s₁ * s₂ * s₃ = s₃ * s₁ * s₂ by ring]
+ refine h.trans (le_of_eq ?_)
+ ring)
+ (fun p hp s₁ s₂ s₃ y₁ y₂ y₃ => by
+ have h := hT p hp s₃ s₁ s₂ y₃ y₁ y₂
+ show |iteratedFDeriv ℝ 3 f p ![(s₃, y₃), (s₁, y₁), (s₂, y₂)] -
+ s₁ * s₂ * s₃ * iteratedFDeriv ℝ 3 f p ![(1, 0), (1, 0), (1, 0)]| ≤ _
+ rw [show s₁ * s₂ * s₃ = s₃ * s₁ * s₂ by ring]
+ refine h.trans (le_of_eq ?_)
+ ring)
+ (fun x hx => hTe x hx)
+ (fun p hp => (ContinuousMultilinearMap.apply ℝ (fun _ : Fin 3 => ℝ × E) ℝ
+ ![(1, 0), (1, 0), (1, 0)]).hasFDerivAt.comp p (dI3 p (hDU hp)))
+ (fun p hp => hn4x p hp)
+ (fun p hp => ContinuousLinearMap.opNorm_le_bound _ hn0 fun v => by
+ rw [Real.norm_eq_abs]; exact hn4y p hp v)
+ hH2
+ (fun p hp => Ψ.hasStrictFDerivAt.comp p (sD2 p (hcU hp)))
+ (fun p hp => Ψ.hasFDerivAt.comp p.2 ((dD2 (p.1, p.2) (hcU hp)).comp p.2
+ (hasFDerivAt_prodMk_right p.1 p.2)))
+ (fun x hx => by
+ have hx' : ((x, 0) : ℝ × E) ∈ U := hcU ⟨hx, by
+ simp only [Metric.mem_closedBall, dist_self]; linarith⟩
+ have hΞ : HasFDerivAt Ξ Ξ (fderiv ℝ (fderiv ℝ f) (x, 0)) :=
+ ContinuousLinearMap.hasFDerivAt (E := (ℝ × E) →L[ℝ] (ℝ × E) →L[ℝ] ℝ)
+ (F := E →L[ℝ] E →L[ℝ] ℝ) _
+ exact HasFDerivAt.comp_hasDerivAt (l := Ξ)
+ (f := fun t => fderiv ℝ (fderiv ℝ f) (t, 0)) x hΞ (HasFDerivAt.comp_hasDerivAt
+ (l := fderiv ℝ (fderiv ℝ f)) (f := fun t : ℝ => ((t, (0 : E)) : ℝ × E)) x (dD3 (x, 0) hx')
+ (hpath x 0)))
+ (fun p hp s hs => by
+ have hmem : ((p.1, s • p.2) : ℝ × E) ∈ U := hcU ⟨hp.1, by
+ have := hp.2
+ rw [Metric.mem_closedBall, dist_zero_right] at this ⊢
+ rw [norm_smul, Real.norm_eq_abs, abs_of_nonneg hs.1]
+ nlinarith [hs.2, norm_nonneg p.2]⟩
+ have hp' : HasDerivAt (fun s : ℝ => ((p.1, s • p.2) : ℝ × E)) ((0 : ℝ), p.2) s := by
+ have := (hasDerivAt_const s p.1).prodMk ((hasDerivAt_id s).smul_const p.2)
+ simpa using this
+ have hΞ : HasFDerivAt Ξ Ξ (fderiv ℝ (fderiv ℝ f) (p.1, s • p.2)) :=
+ ContinuousLinearMap.hasFDerivAt (E := (ℝ × E) →L[ℝ] (ℝ × E) →L[ℝ] ℝ)
+ (F := E →L[ℝ] E →L[ℝ] ℝ) _
+ exact HasFDerivAt.comp_hasDerivAt (l := Ξ)
+ (f := fun s => fderiv ℝ (fderiv ℝ f) (p.1, s • p.2)) s hΞ (HasFDerivAt.comp_hasDerivAt
+ (l := fderiv ℝ (fderiv ℝ f)) (f := fun s : ℝ => ((p.1, s • p.2) : ℝ × E)) s (dD3 _ hmem) hp'))
+ (fun v => by
+ have h := hlam v
+ rw [← hD2] at h
+ exact h)
+ hH1 hM hS hnorm
+ obtain ⟨ε, hε, -, hrest⟩ := key
+ exact ⟨ε, hε, hrest⟩
+
+end Slice
+
+/-! ### A concrete instance and the necessity of each hypothesis
+
+On `ℝ`, `toyF x = max (-|x|) (x - 2)` has a local maximum `M = 0` at height `b = 0`, a
+separating local minimum `S = 1` at height `s = -1`, and an older point `z = 3` at height `1`.
+The cap is `[-2, 1]`. The instance shows that `CapHyp` is satisfiable (the theorems are not
+vacuous), and the three counterexamples show that dropping (C1), (C2) or (C3) breaks the
+maximin conclusion. -/
+
+/-- The toy height function. -/
+noncomputable def toyF (x : ℝ) : ℝ := max (-|x|) (x - 2)
+
+/-- The toy ridge, `t ↦ 3t` from `0` to `3`. -/
+def toyRidge : Path (0 : ℝ) 3 where
+ toFun t := 3 * (t : ℝ)
+ continuous_toFun := continuous_const.mul continuous_subtype_val
+ source' := by simp
+ target' := by simp
+
+theorem toy_ridge_ge (t : I) : (-1 : ℝ) ≤ toyF (toyRidge t) := by
+ have ht0 : (0 : ℝ) ≤ t := t.2.1
+ show -1 ≤ max (-|3 * (t : ℝ)|) (3 * (t : ℝ) - 2)
+ rcases le_or_gt (3 * (t : ℝ)) 1 with h | h
+ · refine le_max_of_le_left ?_
+ rw [abs_of_nonneg (by linarith)]
+ linarith
+ · exact le_max_of_le_right (by linarith)
+
+theorem toy_frontier : frontier (Icc (-2 : ℝ) 1) = {-2, 1} := frontier_Icc (by norm_num)
+
+/-- The toy satisfies (C1)–(C3) with `C = [-2, 1]`, `M = 0`, `z = 3`, `b = 0`, `s = -1`. -/
+theorem toy_capHyp : CapHyp toyF (Icc (-2 : ℝ) 1) 0 3 0 (-1) where
+ mem := ⟨by norm_num, by norm_num⟩
+ ceiling x hx := by
+ obtain ⟨_, hx2⟩ := hx
+ show max (-|x|) (x - 2) ≤ 0
+ exact max_le (by linarith [abs_nonneg x]) (by linarith)
+ frontier_le x hx := by
+ rw [toy_frontier] at hx
+ rcases hx with rfl | rfl
+ · show max (-|(-2 : ℝ)|) ((-2 : ℝ) - 2) ≤ -1
+ norm_num [abs_of_neg]
+ · show max (-|(1 : ℝ)|) ((1 : ℝ) - 2) ≤ -1
+ norm_num
+ older := by
+ show (0 : ℝ) < max (-|(3 : ℝ)|) ((3 : ℝ) - 2)
+ norm_num
+ ridge := ⟨toyRidge, toy_ridge_ge⟩
+
+/-- In the toy, `S = 1` is the only frontier point at height `-1` (C2⁺). -/
+theorem toy_saddle_strict : ∀ x ∈ frontier (Icc (-2 : ℝ) 1), x ≠ 1 → toyF x < -1 := by
+ intro x hx hne
+ rw [toy_frontier] at hx
+ rcases hx with rfl | h
+ · show max (-|(-2 : ℝ)|) ((-2 : ℝ) - 2) < -1
+ norm_num [abs_of_neg]
+ · exact absurd h hne
+
+/-- In the toy, removing `S = 1` from `{f ≥ -1}` disconnects `M = 0` from every older point. The
+cut is not vacuous: `M` lies in its own component. -/
+theorem toy_saddle_cut :
+ (0 : ℝ) ∈ connectedComponentIn ({x | (-1 : ℝ) ≤ toyF x} \ {1}) 0 ∧
+ ∀ w ∈ connectedComponentIn ({x | (-1 : ℝ) ≤ toyF x} \ {1}) 0, toyF w ≤ 0 :=
+ toy_capHyp.saddle_cut toy_saddle_strict (by norm_num)
+
+/-- The toy's elder death level is `-1`. -/
+theorem toy_death_level : IsGreatest (CapHyp.joinedLevels toyF 0 0) (-1) :=
+ toy_capHyp.elder_death_level
+
+theorem toy_f_M : toyF 0 = 0 := by
+ show max (-|(0 : ℝ)|) ((0 : ℝ) - 2) = 0
+ norm_num
+
+theorem toy_f_S : toyF 1 = -1 := by
+ show max (-|(1 : ℝ)|) ((1 : ℝ) - 2) = -1
+ norm_num
+
+/-- Necessity of (C2). At the level `s = -3/2`, (C1) and (C3) hold, (C2) fails (the frontier point
+`1` has height `-1 > -3/2`), and the maximin level is not `-3/2`. -/
+theorem toy_needs_C2 :
+ (∀ x ∈ Icc (-2 : ℝ) 1, toyF x ≤ 0) ∧ (0 : ℝ) < toyF 3 ∧
+ (∃ γ : Path (0 : ℝ) 3, ∀ t, (-3 / 2 : ℝ) ≤ toyF (γ t)) ∧
+ ¬ (∀ x ∈ frontier (Icc (-2 : ℝ) 1), toyF x ≤ -3 / 2) ∧
+ ¬ IsGreatest (connectionLevels toyF 0 0) (-3 / 2) := by
+ refine ⟨toy_capHyp.ceiling, toy_capHyp.older,
+ ⟨toyRidge, fun t => le_trans (by norm_num) (toy_ridge_ge t)⟩, fun h => ?_, ?_⟩
+ · have h1 := h 1 (by rw [toy_frontier]; simp)
+ rw [toy_f_S] at h1
+ norm_num at h1
+ · rintro ⟨-, hub⟩
+ have hmem : (-1 : ℝ) ∈ connectionLevels toyF 0 0 :=
+ ⟨3, toyRidge, toy_capHyp.older, toy_ridge_ge⟩
+ have := hub hmem
+ norm_num at this
+
+/-- Necessity of (C1). At the ceiling `b = -1/2`, (C2) and (C3) hold, (C1) fails (`f M = 0 > -1/2`),
+and the constant path at `M` shows that the maximin level is not `-1`. -/
+theorem toy_needs_C1 :
+ ¬ (∀ x ∈ Icc (-2 : ℝ) 1, toyF x ≤ -1 / 2) ∧
+ (∀ x ∈ frontier (Icc (-2 : ℝ) 1), toyF x ≤ -1) ∧ (-1 / 2 : ℝ) < toyF 3 ∧
+ (∃ γ : Path (0 : ℝ) 3, ∀ t, (-1 : ℝ) ≤ toyF (γ t)) ∧
+ ¬ IsGreatest (connectionLevels toyF 0 (-1 / 2)) (-1) := by
+ refine ⟨fun h => ?_, toy_capHyp.frontier_le, lt_trans (by norm_num) toy_capHyp.older,
+ toy_capHyp.ridge, ?_⟩
+ · have h1 := h 0 ⟨by norm_num, by norm_num⟩
+ rw [toy_f_M] at h1
+ norm_num at h1
+ · rintro ⟨-, hub⟩
+ have hmem : (0 : ℝ) ∈ connectionLevels toyF 0 (-1 / 2) :=
+ ⟨0, Path.refl 0, by rw [toy_f_M]; norm_num, fun t => by simp [toy_f_M]⟩
+ have := hub hmem
+ norm_num at this
+
+/-- Necessity of (C3). At the level `s = 5`, (C1) and (C2) hold and `z` is older, but no ridge stays
+at height `≥ 5` (it starts at `f M = 0`), and the maximin level is not `5`: the barrier at the true
+level `-1` excludes it. -/
+theorem toy_needs_C3 :
+ (∀ x ∈ Icc (-2 : ℝ) 1, toyF x ≤ 0) ∧
+ (∀ x ∈ frontier (Icc (-2 : ℝ) 1), toyF x ≤ 5) ∧ (0 : ℝ) < toyF 3 ∧
+ ¬ (∃ γ : Path (0 : ℝ) 3, ∀ t, (5 : ℝ) ≤ toyF (γ t)) ∧
+ ¬ IsGreatest (connectionLevels toyF 0 0) 5 := by
+ refine ⟨toy_capHyp.ceiling, fun x hx => le_trans (toy_capHyp.frontier_le x hx) (by norm_num),
+ toy_capHyp.older, ?_, ?_⟩
+ · rintro ⟨γ, hγ⟩
+ have h0 := hγ 0
+ rw [Path.source, toy_f_M] at h0
+ norm_num at h0
+ · rintro ⟨hmem, -⟩
+ have h1 := toy_capHyp.maximin_isGreatest.2 hmem
+ norm_num at h1
+
+/-- The ridge toy: SP's normalization at `r = 1` with one transverse coordinate,
+`f (x, y) = x³/3 - x/4 - y²`, ridge `h = 0`, ridge derivative `F x = x² - 1/4`. -/
+noncomputable def ridgeToyF (p : ℝ × ℝ) : ℝ := p.1 ^ 3 / 3 - p.1 / 4 - p.2 ^ 2
+
+/-- The ridge hypotheses of `ridge_capHyp` are jointly satisfiable. Here the gap is
+`g(-1/2) - g(1/2) = 1/6`, which is SP's normalization `r³/6`. -/
+theorem ridgeToy_capHyp :
+ CapHyp ridgeToyF (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)) (-1 / 2, 0)
+ (2 * 1, 0) (ridgeToyF (-1 / 2, 0)) (ridgeToyF (1 / 2, 0)) := by
+ refine ridge_capHyp (E := ℝ) (f := ridgeToyF) (h := fun _ => (0 : ℝ))
+ (F := fun x => x ^ 2 - 1 / 4) (r := 1) one_pos continuousOn_const ?_ ?_ ?_ ?_ ?_ ?_ ?_ ?_
+ · intro x _
+ have h1 := ((hasDerivAt_pow 3 x).div_const 3).sub ((hasDerivAt_id x).div_const 4)
+ convert h1 using 1
+ · funext y
+ simp only [ridgeToyF, id, Pi.sub_apply]
+ ring
+ · push_cast
+ ring
+ · norm_num
+ · norm_num
+ · have hc : ConvexOn ℝ univ (fun x : ℝ => (7 / 8 : ℝ) • x ^ 2 + (-7 / 32 : ℝ)) :=
+ ((even_two.convexOn_pow).smul (by norm_num)).add (convexOn_const _ convex_univ)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp only [smul_eq_mul]
+ ring
+ · rintro ⟨x, y⟩ -
+ simp only [ridgeToyF]
+ nlinarith [sq_nonneg y]
+ · rintro ⟨x, y⟩ ⟨⟨hx1, hx2⟩, hy⟩
+ rw [mem_sphere_zero_iff_norm, Real.norm_eq_abs] at hy
+ have hy2 : y ^ 2 = 4 := by rw [← sq_abs, hy]; norm_num
+ simp only [ridgeToyF, hy2]
+ nlinarith [mul_nonneg (sub_nonneg.mpr hx2) (sq_nonneg x),
+ mul_nonneg (by linarith : (0 : ℝ) ≤ x + 2) (by linarith : (0 : ℝ) ≤ 2 - x)]
+ · simp
+ · simp only [ridgeToyF]
+ norm_num
+
+/-- In the ridge toy, `S = (1/2, 0)` is the only frontier point at height `s` (C2⁺). -/
+theorem ridgeToy_saddle_strict :
+ ∀ x ∈ frontier (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)),
+ x ≠ (1 / 2, 0) → ridgeToyF x < ridgeToyF (1 / 2, 0) := by
+ refine ridge_saddle_strict (E := ℝ) (f := ridgeToyF) (h := fun _ => (0 : ℝ))
+ (F := fun x => x ^ 2 - 1 / 4) (r := 1) one_pos ?_ ?_ ?_ ?_ ?_ ?_ ?_ ?_
+ · intro x _
+ have h1 := ((hasDerivAt_pow 3 x).div_const 3).sub ((hasDerivAt_id x).div_const 4)
+ convert h1 using 1
+ · funext y
+ simp only [ridgeToyF, id, Pi.sub_apply]
+ ring
+ · push_cast
+ ring
+ · norm_num
+ · norm_num
+ · have hc : ConvexOn ℝ univ (fun x : ℝ => (7 / 8 : ℝ) • x ^ 2 + (-7 / 32 : ℝ)) :=
+ ((even_two.convexOn_pow).smul (by norm_num)).add (convexOn_const _ convex_univ)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp only [smul_eq_mul]
+ ring
+ · rintro ⟨x, y⟩ -
+ simp only [ridgeToyF]
+ nlinarith [sq_nonneg y]
+ · rintro ⟨x, y⟩ - hy
+ have hy' : y ≠ 0 := hy
+ simp only [ridgeToyF]
+ nlinarith [sq_pos_of_ne_zero hy']
+ · rintro ⟨x, y⟩ ⟨⟨hx1, hx2⟩, hy⟩
+ rw [mem_sphere_zero_iff_norm, Real.norm_eq_abs] at hy
+ have hy2 : y ^ 2 = 4 := by rw [← sq_abs, hy]; norm_num
+ simp only [ridgeToyF, hy2]
+ nlinarith [mul_nonneg (sub_nonneg.mpr hx2) (sq_nonneg x),
+ mul_nonneg (by linarith : (0 : ℝ) ≤ x + 2) (by linarith : (0 : ℝ) ≤ 2 - x)]
+ · simp only [ridgeToyF]
+ norm_num
+
+/-! ### The ridge toy through the slice route -/
+
+/-- The ridge toy's joint derivative along the ridge `y = 0` is `D x = (x² - 1/4) · dx`. Its
+transverse part vanishes (the ridge equation), and `D x (1, 0) = x² - 1/4 = F x`. -/
+theorem ridgeToy_joint (x : ℝ) :
+ HasFDerivAt ridgeToyF ((x ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ) (x, 0) ∧
+ ((x ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ).comp (ContinuousLinearMap.inr ℝ ℝ ℝ) =
+ 0 ∧
+ ((x ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ) (1, 0) = x ^ 2 - 1 / 4 := by
+ refine ⟨?_, by ext; simp, by simp⟩
+ have hu : HasDerivAt (fun t : ℝ => t ^ 3 / 3 - t / 4) (x ^ 2 - 1 / 4) x := by
+ have h1 := ((hasDerivAt_pow 3 x).div_const 3).sub ((hasDerivAt_id x).div_const 4)
+ convert h1 using 1
+ · funext t; simp
+ · push_cast; ring
+ have hv : HasDerivAt (fun t : ℝ => t ^ 2) 0 (0 : ℝ) := by
+ simpa using hasDerivAt_pow 2 (0 : ℝ)
+ have h1 := hu.comp_hasFDerivAt ((x, (0 : ℝ)) : ℝ × ℝ) (hasFDerivAt_fst (𝕜 := ℝ))
+ have h2 := hv.comp_hasFDerivAt ((x, (0 : ℝ)) : ℝ × ℝ) (hasFDerivAt_snd (𝕜 := ℝ))
+ convert h1.sub h2 using 1
+ · funext p; simp [ridgeToyF]
+ · simp
+
+/-- **The slice route is jointly satisfiable.** The ridge toy (`r = 1`, `h = 0`) meets every
+input of `ridge_inputs_of_joint` and `ridge_capHyp_of_slices`, with `δ = 2` (each slice is
+`-y²` plus a constant), `w = 0`, `ω = 0`, and the curvature condition
+`2δ(b - s) = 2/3 < 16 = (2rδ - ω)²`. The combined theorems re-derive (C1)–(C3) and (C2⁺). -/
+theorem ridgeToy_slices :
+ CapHyp ridgeToyF (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)) (-1 / 2, 0)
+ (2 * 1, 0) (ridgeToyF (-1 / 2, 0)) (ridgeToyF (1 / 2, 0)) ∧
+ ∀ x ∈ frontier (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)),
+ x ≠ (1 / 2, 0) → ridgeToyF x < ridgeToyF (1 / 2, 0) := by
+ obtain ⟨hh, hg, hcrit⟩ := ridge_inputs_of_joint (E := ℝ) (f := ridgeToyF)
+ (h := fun _ => (0 : ℝ)) (h' := fun _ => (0 : ℝ))
+ (D := fun x => (x ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ) (r := 1) one_pos
+ (fun x _ => (ridgeToy_joint x).1) (fun x _ => hasDerivAt_const x (0 : ℝ))
+ (fun x _ => (ridgeToy_joint x).2.1)
+ refine ridge_capHyp_of_slices (E := ℝ) (f := ridgeToyF) (h := fun _ => (0 : ℝ))
+ (w := fun _ => 0) (r := 1) (δ := 2) (ω := 0) one_pos two_pos hh hg ?_ ?_ ?_ ?_ ?_
+ hcrit (fun x hx => hcrit x hx) ?_ ?_ ?_ ?_
+ · simp only [(ridgeToy_joint _).2.2]
+ norm_num
+ · simp only [(ridgeToy_joint _).2.2]
+ norm_num
+ · have hc : ConvexOn ℝ univ (fun x : ℝ => (7 / 8 : ℝ) • x ^ 2 + (-7 / 32 : ℝ)) :=
+ ((even_two.convexOn_pow).smul (by norm_num)).add (convexOn_const _ convex_univ)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp only [(ridgeToy_joint _).2.2, smul_eq_mul]
+ ring
+ · intro x _
+ rw [strongConcaveOn_iff_convex]
+ refine (concaveOn_const (x ^ 3 / 3 - x / 4) (convex_closedBall (0 : ℝ) (2 * 1))).congr ?_
+ intro y _
+ simp only [ridgeToyF, Real.norm_eq_abs, sq_abs]
+ ring
+ · intro x _
+ simp
+ · intro x _
+ simp
+ · norm_num
+ · simp only [ridgeToyF]
+ norm_num
+ · simp only [ridgeToyF]
+ norm_num
+
+
+/-- A field that meets SP's normalized hypotheses: `f (x, y) = x³/3 - x/4 - 12 y²`, so `m = 2`
+(`f_xxx = 2`), `δ = 24 > r m (8m - 5) = 22` at `r = 1`, and gap exactly `r³/6`. -/
+noncomputable def spToyF (p : ℝ × ℝ) : ℝ := p.1 ^ 3 / 3 - p.1 / 4 - 12 * p.2 ^ 2
+
+/-- **`ridge_capHyp_sp` is not vacuous.** `spToyF` meets every hypothesis, with `h = 0`, `w = 0`,
+`F = x² - 1/4`, `m = 2` and `δ = 24`. -/
+theorem spToy_capHyp :
+ CapHyp spToyF (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)) (-1 / 2, 0)
+ (2 * 1, 0) (spToyF (-1 / 2, 0)) (spToyF (1 / 2, 0)) ∧
+ ∀ x ∈ frontier (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)),
+ x ≠ (1 / 2, 0) → spToyF x < spToyF (1 / 2, 0) := by
+ have hslice : ∀ x : ℝ, HasFDerivAt (fun y : ℝ => spToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by
+ intro x
+ rw [hasFDerivAt_iff_hasDerivAt]
+ have h1 := ((hasDerivAt_pow 2 (0 : ℝ)).const_mul 12).const_sub (x ^ 3 / 3 - x / 4)
+ convert h1 using 1
+ · funext y
+ simp only [spToyF]
+ · simp
+ refine ridge_capHyp_sp (E := ℝ) (f := spToyF) (h := fun _ => (0 : ℝ))
+ (F := fun x => x ^ 2 - 1 / 4) (w := fun _ => 0) (r := 1) (m := 2) (δ := 24) one_pos le_rfl
+ (by norm_num) continuousOn_const ?_ ?_ ?_ ?_ ?_ ?_ (fun x _ => hslice x) rfl rfl
+ (fun x _ => hslice x) ?_ ?_ ?_
+ · intro x _
+ have h1 := ((hasDerivAt_pow 3 x).div_const 3).sub ((hasDerivAt_id x).div_const 4)
+ convert h1 using 1
+ · funext y
+ simp only [spToyF, id, Pi.sub_apply]
+ ring
+ · push_cast
+ ring
+ · norm_num
+ · norm_num
+ · have hc : ConvexOn ℝ univ (fun x : ℝ => (7 / 8 : ℝ) • x ^ 2 + (-7 / 32 : ℝ)) :=
+ ((even_two.convexOn_pow).smul (by norm_num)).add (convexOn_const _ convex_univ)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp only [smul_eq_mul]
+ ring
+ · intro x _
+ rw [strongConcaveOn_iff_convex]
+ refine (concaveOn_const (x ^ 3 / 3 - x / 4) (convex_closedBall (0 : ℝ) (2 * 1))).congr ?_
+ intro y _
+ simp only [spToyF, Real.norm_eq_abs, sq_abs]
+ ring
+ · intro x _
+ simp
+ · intro v
+ have hc : ConvexOn ℝ univ (fun t : ℝ => ‖v‖ • t ^ 2) :=
+ (even_two.convexOn_pow).smul (norm_nonneg v)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro t _
+ simp only [smul_eq_mul, zero_apply]
+ ring
+ · intro v
+ have hc : ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=
+ ((even_two.convexOn_pow).smul (norm_nonneg v)).neg
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro t _
+ simp only [smul_eq_mul, zero_apply]
+ ring
+ · simp only [spToyF]
+ norm_num
+
+
+/-- **`ridge_capHyp_normalized` is not vacuous.** `spToyF` meets every hypothesis, with
+`G0 = x² - 1/4` (so `|G0''| = 2 = m`) and gap exactly `1/6`. -/
+theorem spToy_normalized :
+ CapHyp spToyF (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)) (-1 / 2, 0)
+ (2 * 1, 0) (spToyF (-1 / 2, 0)) (spToyF (1 / 2, 0)) ∧
+ ∀ x ∈ frontier (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)),
+ x ≠ (1 / 2, 0) → spToyF x < spToyF (1 / 2, 0) := by
+ have hslice : ∀ x : ℝ, HasFDerivAt (fun y : ℝ => spToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by
+ intro x
+ rw [hasFDerivAt_iff_hasDerivAt]
+ have h1 := ((hasDerivAt_pow 2 (0 : ℝ)).const_mul 12).const_sub (x ^ 3 / 3 - x / 4)
+ convert h1 using 1
+ · funext y
+ simp only [spToyF]
+ · simp
+ have hgx : ∀ x : ℝ, HasDerivAt (fun x => spToyF (x, 0)) (x ^ 2 - 1 / 4) x := by
+ intro x
+ have h1 := ((hasDerivAt_pow 3 x).div_const 3).sub ((hasDerivAt_id x).div_const 4)
+ convert h1 using 1
+ · funext y
+ simp only [spToyF, id, Pi.sub_apply]
+ ring
+ · push_cast
+ ring
+ have hq : ConvexOn ℝ univ (fun x : ℝ => (7 / 8 : ℝ) • x ^ 2 + (-7 / 32 : ℝ)) :=
+ ((even_two.convexOn_pow).smul (by norm_num)).add (convexOn_const _ convex_univ)
+ refine ridge_capHyp_normalized (E := ℝ) (f := spToyF) (h := fun _ => (0 : ℝ))
+ (F := fun x => x ^ 2 - 1 / 4) (G0 := fun x => x ^ 2 - 1 / 4) (w := fun _ => 0) (r := 1)
+ (m := 2) (δ := 24) one_pos (fun x _ => hgx x) ?_ ?_ (by norm_num) (by norm_num)
+ (by norm_num) continuousOn_const (fun x _ => hgx x) (by norm_num) (by norm_num) ?_ ?_
+ (fun x _ => by simp) (fun x _ => hslice x) rfl rfl (fun x _ => hslice x) ?_ ?_ ?_
+ · have hc : ConvexOn ℝ univ (fun x : ℝ => (2 : ℝ) • x ^ 2 + (-1 / 4 : ℝ)) :=
+ ((even_two.convexOn_pow).smul (by norm_num)).add (convexOn_const _ convex_univ)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp only [smul_eq_mul]
+ ring
+ · refine (concaveOn_const (-1 / 4 : ℝ) (convex_Icc _ _)).congr ?_
+ intro x _
+ ring
+ · refine (hq.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp only [smul_eq_mul]
+ ring
+ · intro x _
+ rw [strongConcaveOn_iff_convex]
+ refine (concaveOn_const (x ^ 3 / 3 - x / 4) (convex_closedBall (0 : ℝ) (2 * 1))).congr ?_
+ intro y _
+ simp only [spToyF, Real.norm_eq_abs, sq_abs]
+ ring
+ · intro v
+ have hc : ConvexOn ℝ univ (fun t : ℝ => ‖v‖ • t ^ 2) :=
+ (even_two.convexOn_pow).smul (norm_nonneg v)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro t _
+ simp only [smul_eq_mul, zero_apply]
+ ring
+ · intro v
+ have hc : ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=
+ ((even_two.convexOn_pow).smul (norm_nonneg v)).neg
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro t _
+ simp only [smul_eq_mul, zero_apply]
+ ring
+ · simp only [spToyF]
+ norm_num
+
+
+/-- A field meeting (H1): `f (x, y) = x³/3 - x/4 - 20 y²`, so `λ = 40 > 8 r m² = 32` at `r = 1`,
+`m = 2`, and gap exactly `r³/6`. -/
+noncomputable def h1ToyF (p : ℝ × ℝ) : ℝ := p.1 ^ 3 / 3 - p.1 / 4 - 20 * p.2 ^ 2
+
+/-- **`ridge_capHyp_H1` is not vacuous.** `h1ToyF` meets every hypothesis, with a constant
+transverse Hessian `-40`, `h = 0`, `w = 0`, `G0 = F = x² - 1/4`, `m = 2` and `λ = 40`. -/
+theorem h1Toy_capHyp :
+ CapHyp h1ToyF (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)) (-1 / 2, 0)
+ (2 * 1, 0) (h1ToyF (-1 / 2, 0)) (h1ToyF (1 / 2, 0)) ∧
+ ∀ x ∈ frontier (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)),
+ x ≠ (1 / 2, 0) → h1ToyF x < h1ToyF (1 / 2, 0) := by
+ have hslope : ∀ x y : ℝ, HasFDerivAt (fun y : ℝ => h1ToyF (x, y))
+ (ContinuousLinearMap.mul ℝ ℝ (-40 * y)) y := by
+ intro x y
+ rw [hasFDerivAt_iff_hasDerivAt]
+ have h1 := ((hasDerivAt_pow 2 y).const_mul 20).const_sub (x ^ 3 / 3 - x / 4)
+ convert h1 using 1
+ · funext t
+ simp only [h1ToyF]
+ · simp
+ ring
+ have hslice : ∀ x : ℝ, HasFDerivAt (fun y : ℝ => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by
+ intro x
+ simpa using hslope x 0
+ have hhess : ∀ y : ℝ, HasFDerivAt (fun y : ℝ => ContinuousLinearMap.mul ℝ ℝ (-40 * y))
+ ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) y := by
+ intro y
+ convert ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ).hasFDerivAt (x := y) using 1
+ funext t
+ ext
+ simp
+ have hgx : ∀ x : ℝ, HasDerivAt (fun x => h1ToyF (x, 0)) (x ^ 2 - 1 / 4) x := by
+ intro x
+ have h1 := ((hasDerivAt_pow 3 x).div_const 3).sub ((hasDerivAt_id x).div_const 4)
+ convert h1 using 1
+ · funext y
+ simp only [h1ToyF, id, Pi.sub_apply]
+ ring
+ · push_cast
+ ring
+ have hq : ConvexOn ℝ univ (fun x : ℝ => (7 / 8 : ℝ) • x ^ 2 + (-7 / 32 : ℝ)) :=
+ ((even_two.convexOn_pow).smul (by norm_num)).add (convexOn_const _ convex_univ)
+ refine ridge_capHyp_H1 (E := ℝ) (f := h1ToyF) (h := fun _ => (0 : ℝ))
+ (F := fun x => x ^ 2 - 1 / 4) (G0 := fun x => x ^ 2 - 1 / 4) (w := fun _ => 0)
+ (Dφ := fun p => ContinuousLinearMap.mul ℝ ℝ (-40 * p.2))
+ (H := fun _ => (-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) (Hx := fun _ => 0) (Hr := fun _ _ => 0)
+ (r := 1) (m := 2) (lam := 40)
+ one_pos (fun x _ => hgx x) ?_ ?_ (by norm_num) (by norm_num)
+ (fun p _ => hslope p.1 p.2) (fun p _ => hhess p.2)
+ (fun x _ => hasDerivAt_const x ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ))
+ (fun x _ => by simp only [ContinuousLinearMap.opNorm_zero]; norm_num)
+ (fun p _ s _ => hasDerivAt_const s ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ))
+ (fun p _ s _ => by simp only [ContinuousLinearMap.opNorm_zero]; positivity) ?_ (by norm_num)
+ continuousOn_const (fun x _ => hgx x) (by norm_num) (by norm_num) ?_
+ (fun x _ => by simp) (fun x _ => hslice x) rfl rfl (fun x _ => hslice x) ?_ ?_ ?_
+ · have hc : ConvexOn ℝ univ (fun x : ℝ => (2 : ℝ) • x ^ 2 + (-1 / 4 : ℝ)) :=
+ ((even_two.convexOn_pow).smul (by norm_num)).add (convexOn_const _ convex_univ)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp only [smul_eq_mul]
+ ring
+ · refine (concaveOn_const (-1 / 4 : ℝ) (convex_Icc _ _)).congr ?_
+ intro x _
+ ring
+ · intro v
+ simp only [smul_apply, ContinuousLinearMap.mul_apply', smul_eq_mul,
+ Real.norm_eq_abs, sq_abs]
+ nlinarith [sq_nonneg v]
+ · refine (hq.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp only [smul_eq_mul]
+ ring
+ · intro v
+ have hc : ConvexOn ℝ univ (fun t : ℝ => ‖v‖ • t ^ 2) :=
+ (even_two.convexOn_pow).smul (norm_nonneg v)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro t _
+ simp only [smul_eq_mul, zero_apply]
+ ring
+ · intro v
+ have hc : ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=
+ ((even_two.convexOn_pow).smul (norm_nonneg v)).neg
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro t _
+ simp only [smul_eq_mul, zero_apply]
+ ring
+ · simp only [h1ToyF]
+ norm_num
+
+
+/-- **`ridge_differentiable` is not vacuous.** For `h1ToyF`, with `h = 0`, transverse gradient
+`G (x, y) = -40 y`, its constant derivative `DG = -40 · snd`, `δ = 40` and `U = (-3, 3)`, the
+statement lists every hypothesis of `ridge_differentiable` at this instance, and its last
+conjunct is that theorem's conclusion, obtained by applying it. -/
+theorem h1Toy_ridge_differentiable :
+ IsOpen (Ioo (-3 : ℝ) 3) ∧ Icc (-2 * (1 : ℝ)) (2 * 1) ⊆ Ioo (-3) 3 ∧
+ (∀ x ∈ Ioo (-3 : ℝ) 3,
+ StrongConcaveOn (Metric.closedBall (0 : ℝ) (2 * 1)) 40 (fun y => h1ToyF (x, y))) ∧
+ (∀ x ∈ Ioo (-3 : ℝ) 3, (0 : ℝ) ∈ Metric.closedBall (0 : ℝ) (2 * 1)) ∧
+ (∀ x ∈ Ioo (-3 : ℝ) 3, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0) ∧
+ (∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1), (0 : ℝ) ∈ Metric.ball (0 : ℝ) (2 * 1)) ∧
+ (∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1), ∀ᶠ v in nhds (x, (0 : ℝ)),
+ HasFDerivAt (fun y => h1ToyF (v.1, y)) (ContinuousLinearMap.mul ℝ ℝ (-40 * v.2)) v.2) ∧
+ (∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1),
+ HasStrictFDerivAt (fun p : ℝ × ℝ => ContinuousLinearMap.mul ℝ ℝ (-40 * p.2))
+ (((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ) (x, 0)) ∧
+ (∀ v : ℝ, ((((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ) ∘L
+ ContinuousLinearMap.inr ℝ ℝ ℝ) v v ≤ -40 * ‖v‖ ^ 2) ∧
+ ∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1), HasStrictFDerivAt (fun _ : ℝ => (0 : ℝ))
+ (-((((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ) ∘L
+ ContinuousLinearMap.inr ℝ ℝ ℝ).inverse ∘L
+ ((((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ) ∘L
+ ContinuousLinearMap.inl ℝ ℝ ℝ)) x := by
+ have hslope : ∀ x y : ℝ, HasFDerivAt (fun y : ℝ => h1ToyF (x, y))
+ (ContinuousLinearMap.mul ℝ ℝ (-40 * y)) y := by
+ intro x y
+ rw [hasFDerivAt_iff_hasDerivAt]
+ have h1 := ((hasDerivAt_pow 2 y).const_mul 20).const_sub (x ^ 3 / 3 - x / 4)
+ convert h1 using 1
+ · funext t
+ simp only [h1ToyF]
+ · simp
+ ring
+ have hGs : ∀ p : ℝ × ℝ, HasStrictFDerivAt (fun p : ℝ × ℝ => ContinuousLinearMap.mul ℝ ℝ (-40 * p.2))
+ (((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ intro p
+ convert (((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L
+ ContinuousLinearMap.snd ℝ ℝ ℝ).hasStrictFDerivAt (x := p) using 1
+ funext q
+ ext
+ simp
+ have hIU : Icc (-2 * (1 : ℝ)) (2 * 1) ⊆ Ioo (-3) 3 :=
+ fun t ht => ⟨by linarith [ht.1], by linarith [ht.2]⟩
+ have hconc : ∀ x ∈ Ioo (-3 : ℝ) 3,
+ StrongConcaveOn (Metric.closedBall (0 : ℝ) (2 * 1)) 40 (fun y => h1ToyF (x, y)) := by
+ intro t _
+ rw [strongConcaveOn_iff_convex]
+ refine (concaveOn_const (t ^ 3 / 3 - t / 4) (convex_closedBall (0 : ℝ) (2 * 1))).congr ?_
+ intro y _
+ simp only [h1ToyF, Real.norm_eq_abs, sq_abs]
+ ring
+ have hball : ∀ x ∈ Ioo (-3 : ℝ) 3, (0 : ℝ) ∈ Metric.closedBall (0 : ℝ) (2 * 1) :=
+ fun t _ => by simp
+ have hcrit : ∀ x ∈ Ioo (-3 : ℝ) 3, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 :=
+ fun t _ => by simpa using hslope t 0
+ have hint : ∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1), (0 : ℝ) ∈ Metric.ball (0 : ℝ) (2 * 1) :=
+ fun t _ => by simp
+ have hG : ∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1), ∀ᶠ v in nhds (x, (0 : ℝ)),
+ HasFDerivAt (fun y => h1ToyF (v.1, y)) (ContinuousLinearMap.mul ℝ ℝ (-40 * v.2)) v.2 :=
+ fun t _ => Filter.Eventually.of_forall (fun v => hslope v.1 v.2)
+ have hneg : ∀ v : ℝ, ((((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L
+ ContinuousLinearMap.snd ℝ ℝ ℝ) ∘L ContinuousLinearMap.inr ℝ ℝ ℝ) v v ≤ -40 * ‖v‖ ^ 2 := by
+ intro v
+ simp only [ContinuousLinearMap.comp_apply, ContinuousLinearMap.inr_apply,
+ ContinuousLinearMap.coe_snd', smul_apply, ContinuousLinearMap.mul_apply', smul_eq_mul,
+ Real.norm_eq_abs, sq_abs]
+ nlinarith [sq_nonneg v]
+ refine ⟨isOpen_Ioo, hIU, hconc, hball, hcrit, hint, hG, fun x _ => hGs (x, 0), hneg, ?_⟩
+ exact ridge_differentiable (E := ℝ) (f := h1ToyF)
+ (G := fun p => ContinuousLinearMap.mul ℝ ℝ (-40 * p.2))
+ (DG := fun _ => ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (h := fun _ => (0 : ℝ)) (U := Ioo (-3) 3) (r := 1) (δ := 40) (by norm_num) isOpen_Ioo hIU
+ hconc hball hcrit hint hG (fun x _ => hGs (x, 0)) (fun _ _ => hneg)
+
+/-- **`ridge_capHyp_source` is not vacuous.** `h1ToyF` meets every source hypothesis on the full
+collar `[-5/2, 5/2] × B̄(0, 2)` (`ε = 1/2`): joint derivative `(x² - 1/4, -40y)`, transverse gradient `-40y`
+with derivative `-40 · snd`, constant transverse Hessian `-40`, `m = 2`, `λ = 40 > 32`, pins
+`(∓1/2, 0)` and gap `1/6`. The theorem then gives the ridge, and for `h = 0`, which meets L12
+(`F = x² - 1/4`), the cap with `M = (-1/2, 0)`. -/
+theorem h1Toy_source :
+ (∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - 1 / 2 : ℝ) (2 * 1 + 1 / 2), h x ∈ Metric.ball (0 : ℝ) (2 * 1) ∧
+ HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) (h x)) ∧
+ CapHyp h1ToyF (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)) (-1 / 2, 0)
+ (2 * 1, 0) (h1ToyF (-1 / 2, 0)) (h1ToyF (1 / 2, 0)) := by
+ have hDf : ∀ p : ℝ × ℝ, HasFDerivAt h1ToyF ((p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ intro p
+ have hf : HasFDerivAt (fun q : ℝ × ℝ => q.1) (ContinuousLinearMap.fst ℝ ℝ ℝ) p :=
+ hasFDerivAt_fst
+ have hs : HasFDerivAt (fun q : ℝ × ℝ => q.2) (ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ hasFDerivAt_snd
+ have h1 := HasFDerivAt.sub (HasFDerivAt.sub
+ (HasFDerivAt.const_mul (HasFDerivAt.pow hf 3) (1 / 3)) (HasFDerivAt.const_mul hf (1 / 4)))
+ (HasFDerivAt.const_mul (HasFDerivAt.pow hs 2) 20)
+ convert h1 using 1
+ · funext q
+ simp only [h1ToyF, Pi.sub_apply]
+ ring
+ · ext <;> simp; ring
+ have hGs : ∀ p : ℝ × ℝ, HasStrictFDerivAt (fun q : ℝ × ℝ => ((q.1 ^ 2 - 1 / 4) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * q.2) • ContinuousLinearMap.snd ℝ ℝ ℝ).comp
+ (ContinuousLinearMap.inr ℝ ℝ ℝ))
+ (((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ intro p
+ convert (((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L
+ ContinuousLinearMap.snd ℝ ℝ ℝ).hasStrictFDerivAt (x := p) using 1
+ funext q
+ ext
+ simp
+ have hH : ∀ p : ℝ × ℝ, HasFDerivAt (fun y => ((p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * y) • ContinuousLinearMap.snd ℝ ℝ ℝ).comp (ContinuousLinearMap.inr ℝ ℝ ℝ))
+ ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) p.2 := by
+ intro p
+ convert ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ).hasFDerivAt (x := p.2) using 1
+ funext y
+ ext
+ simp
+ have hsrc := ridge_capHyp_source (E := ℝ) (f := h1ToyF)
+ (Df := fun p => (p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (DG := fun _ => ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (H := fun _ => (-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) (Hx := fun _ => 0)
+ (Hr := fun _ _ => 0) (r := 1) (m := 2) (lam := 40) (ε := 1 / 2) one_pos (by norm_num)
+ (by norm_num)
+ (fun p _ => hDf p) (fun p _ => hGs p) (fun p _ => hH p)
+ (fun x _ => hasDerivAt_const x ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ))
+ (fun x _ => by simp only [ContinuousLinearMap.opNorm_zero]; norm_num)
+ (fun p _ s _ => hasDerivAt_const s ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ))
+ (fun p _ s _ => by simp only [ContinuousLinearMap.opNorm_zero]; positivity)
+ (fun v => by
+ simp only [smul_apply, ContinuousLinearMap.mul_apply', smul_eq_mul, Real.norm_eq_abs, sq_abs]
+ nlinarith [sq_nonneg v])
+ (by norm_num) (by ext <;> norm_num) (by ext <;> norm_num) ?_ ?_ ?_ ?_ (by simp only [h1ToyF]; norm_num)
+ · obtain ⟨hex, hcap⟩ := hsrc
+ have hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by
+ intro x
+ have := slice_hasFDerivAt (hDf (x, 0))
+ convert this using 1
+ ext
+ simp
+ have hq : ConvexOn ℝ univ (fun x : ℝ => (7 / 8 : ℝ) • x ^ 2 + (-7 / 32 : ℝ)) :=
+ ((even_two.convexOn_pow).smul (by norm_num)).add (convexOn_const _ convex_univ)
+ obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩)
+ ((hq.subset (subset_univ _) (convex_Icc _ _)).congr fun x _ => by
+ simp only [smul_eq_mul]
+ simp
+ ring)
+ exact ⟨hex, hC⟩
+ · have hc : ConvexOn ℝ univ (fun x : ℝ => (2 : ℝ) • x ^ 2 + (-1 / 4 : ℝ)) :=
+ ((even_two.convexOn_pow).smul (by norm_num)).add (convexOn_const _ convex_univ)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp only [smul_eq_mul]
+ simp
+ ring
+ · refine (concaveOn_const (-1 / 4 : ℝ) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp
+ ring
+ · intro v
+ have hc : ConvexOn ℝ univ (fun t : ℝ => ‖v‖ • t ^ 2) :=
+ (even_two.convexOn_pow).smul (norm_nonneg v)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro t _
+ simp only [smul_eq_mul]
+ simp
+ · intro v
+ have hc : ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=
+ ((even_two.convexOn_pow).smul (norm_nonneg v)).neg
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro t _
+ simp only [smul_eq_mul]
+ simp
+
+/-- **`ridge_capHyp_C3` is not vacuous.** `h1ToyF` meets every hypothesis of `ridge_capHyp_C3`
+on the collar `ε = 1/2`: besides the data of `h1Toy_source`, second derivative
+`D²f = diag(2x, -40)`, third derivatives `T a b = 2 a₁ b₁ · fst` (only `f_xxx = 2 ≥ 7/4` is nonzero,
+so every other block vanishes). The theorem then gives the ridge and the cap with `M = (-1/2, 0)`,
+with L12 derived rather than supplied. -/
+theorem h1Toy_C3 :
+ (∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - 1 / 2 : ℝ) (2 * 1 + 1 / 2), h x ∈ Metric.ball (0 : ℝ) (2 * 1) ∧
+ HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) (h x)) ∧
+ CapHyp h1ToyF (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)) (-1 / 2, 0)
+ (2 * 1, 0) (h1ToyF (-1 / 2, 0)) (h1ToyF (1 / 2, 0)) := by
+ have hDf : ∀ p : ℝ × ℝ, HasFDerivAt h1ToyF ((p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ intro p
+ have hf : HasFDerivAt (fun q : ℝ × ℝ => q.1) (ContinuousLinearMap.fst ℝ ℝ ℝ) p :=
+ hasFDerivAt_fst
+ have hs : HasFDerivAt (fun q : ℝ × ℝ => q.2) (ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ hasFDerivAt_snd
+ have h1 := HasFDerivAt.sub (HasFDerivAt.sub
+ (HasFDerivAt.const_mul (HasFDerivAt.pow hf 3) (1 / 3)) (HasFDerivAt.const_mul hf (1 / 4)))
+ (HasFDerivAt.const_mul (HasFDerivAt.pow hs 2) 20)
+ convert h1 using 1
+ · funext q
+ simp only [h1ToyF, Pi.sub_apply]
+ ring
+ · ext <;> simp; ring
+ have hGs : ∀ p : ℝ × ℝ, HasStrictFDerivAt (fun q : ℝ × ℝ => ((q.1 ^ 2 - 1 / 4) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * q.2) • ContinuousLinearMap.snd ℝ ℝ ℝ).comp
+ (ContinuousLinearMap.inr ℝ ℝ ℝ))
+ (((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ intro p
+ convert (((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L
+ ContinuousLinearMap.snd ℝ ℝ ℝ).hasStrictFDerivAt (x := p) using 1
+ funext q
+ ext
+ simp
+ have hH : ∀ p : ℝ × ℝ, HasFDerivAt (fun y => ((p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * y) • ContinuousLinearMap.snd ℝ ℝ ℝ).comp (ContinuousLinearMap.inr ℝ ℝ ℝ))
+ ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) p.2 := by
+ intro p
+ convert ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ).hasFDerivAt (x := p.2) using 1
+ funext y
+ ext
+ simp
+ have hf : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.1) (ContinuousLinearMap.fst ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_fst
+ have hs : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.2) (ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_snd
+ have hD2 : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => (q.1 ^ 2 - 1 / 4) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * q.2) • ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ).smulRight (ContinuousLinearMap.fst ℝ ℝ ℝ) +
+ ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight (ContinuousLinearMap.snd ℝ ℝ ℝ)) p := by
+ intro p
+ have h1 : HasFDerivAt (fun q : ℝ × ℝ => q.1 ^ 2 - 1 / 4) ((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ)
+ p := by
+ have := (HasFDerivAt.pow (hf p) 2).sub_const (1 / 4)
+ convert this using 1
+ ext <;> simp
+ have h2 : HasFDerivAt (fun q : ℝ × ℝ => -40 * q.2) ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ HasFDerivAt.const_mul (hs p) (-40)
+ exact (h1.smul_const (ContinuousLinearMap.fst ℝ ℝ ℝ)).add
+ (h2.smul_const (ContinuousLinearMap.snd ℝ ℝ ℝ))
+ have hD3 : ∀ p : ℝ × ℝ, ∀ a b : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ =>
+ ((((2 * q.1) • ContinuousLinearMap.fst ℝ ℝ ℝ).smulRight (ContinuousLinearMap.fst ℝ ℝ ℝ) +
+ ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight (ContinuousLinearMap.snd ℝ ℝ ℝ)) a) b)
+ ((2 * a.1 * b.1) • ContinuousLinearMap.fst ℝ ℝ ℝ) p := by
+ intro p a b
+ have := (HasFDerivAt.const_mul (hf p) (2 * a.1 * b.1)).add_const (-40 * a.2 * b.2)
+ convert this using 1
+ funext q
+ simp
+ ring
+ have hT : ∀ p : ℝ × ℝ, ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : ℝ),
+ |((2 * (s₁, y₁).1 * (s₂, y₂).1) • ContinuousLinearMap.fst ℝ ℝ ℝ) (s₃, y₃) -
+ s₁ * s₂ * s₃ * ((2 * ((1 : ℝ), (0 : ℝ)).1 * ((1 : ℝ), (0 : ℝ)).1) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ) (1, 0)| ≤
+ 2 * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|) := by
+ intro p s₁ s₂ s₃ y₁ y₂ y₃
+ have h0 : ((2 * (s₁, y₁).1 * (s₂, y₂).1) • ContinuousLinearMap.fst ℝ ℝ ℝ) (s₃, y₃) -
+ s₁ * s₂ * s₃ * ((2 * ((1 : ℝ), (0 : ℝ)).1 * ((1 : ℝ), (0 : ℝ)).1) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ) (1, 0) = 0 := by
+ simp
+ ring
+ rw [h0, abs_zero]
+ have a1 : |s₁| ≤ |s₁| + ‖y₁‖ := le_add_of_nonneg_right (norm_nonneg _)
+ have a2 : |s₂| ≤ |s₂| + ‖y₂‖ := le_add_of_nonneg_right (norm_nonneg _)
+ have a3 : |s₃| ≤ |s₃| + ‖y₃‖ := le_add_of_nonneg_right (norm_nonneg _)
+ have := mul_le_mul (mul_le_mul a1 a2 (abs_nonneg _) (by positivity)) a3 (abs_nonneg _)
+ (by positivity)
+ linarith
+ have hsrc := ridge_capHyp_C3 (E := ℝ) (f := h1ToyF)
+ (Df := fun p => (p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (D2f := fun p => ((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ).smulRight
+ (ContinuousLinearMap.fst ℝ ℝ ℝ) +
+ ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight (ContinuousLinearMap.snd ℝ ℝ ℝ))
+ (T3 := fun _ a b => (2 * a.1 * b.1) • ContinuousLinearMap.fst ℝ ℝ ℝ)
+ (DG := fun _ => ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (H := fun _ => (-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) (Hx := fun _ => 0)
+ (Hr := fun _ _ => 0) (r := 1) (m := 2) (lam := 40) (ε := 1 / 2) one_pos (by norm_num)
+ (by norm_num) (fun p _ => hDf p) (fun p _ => hD2 p) (fun p _ a b => hD3 p a b)
+ (fun p _ => hT p) (fun p _ => by norm_num) (fun p _ => hGs p) (fun p _ => hH p)
+ (fun x _ => hasDerivAt_const x ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ))
+ (fun x _ => by simp only [ContinuousLinearMap.opNorm_zero]; norm_num)
+ (fun p _ s _ => hasDerivAt_const s ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ))
+ (fun p _ s _ => by simp only [ContinuousLinearMap.opNorm_zero]; positivity)
+ (fun v => by
+ simp only [smul_apply, ContinuousLinearMap.mul_apply', smul_eq_mul, Real.norm_eq_abs, sq_abs]
+ nlinarith [sq_nonneg v])
+ (by norm_num) (by ext <;> norm_num) (by ext <;> norm_num) ?_ ?_ ?_ ?_
+ (by simp only [h1ToyF]; norm_num)
+ · obtain ⟨hex, hcap⟩ := hsrc
+ have hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by
+ intro x
+ have := slice_hasFDerivAt (hDf (x, 0))
+ convert this using 1
+ ext
+ simp
+ obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩)
+ exact ⟨hex, hC⟩
+ · have hc : ConvexOn ℝ univ (fun x : ℝ => (2 : ℝ) • x ^ 2 + (-1 / 4 : ℝ)) :=
+ ((even_two.convexOn_pow).smul (by norm_num)).add (convexOn_const _ convex_univ)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp only [smul_eq_mul]
+ simp
+ ring
+ · refine (concaveOn_const (-1 / 4 : ℝ) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp
+ ring
+ · intro v
+ have hc : ConvexOn ℝ univ (fun t : ℝ => ‖v‖ • t ^ 2) :=
+ (even_two.convexOn_pow).smul (norm_nonneg v)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro t _
+ simp only [smul_eq_mul]
+ simp
+ · intro v
+ have hc : ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=
+ ((even_two.convexOn_pow).smul (norm_nonneg v)).neg
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro t _
+ simp only [smul_eq_mul]
+ simp
+
+/-- **`ridge_capHyp_C4` is not vacuous.** `h1ToyF` meets every hypothesis of `ridge_capHyp_C4`
+on the collar `ε = 1/2`: the data of `h1Toy_C3`, with `f_xxx = 2` constant, so its derivative is `0`,
+both fourth-order blocks vanish and (H2) holds with `n = 0`. The theorem gives the ridge and the cap with `M = (-1/2, 0)`, with
+neither L12 nor `f_xxx ≥ 7/4` supplied. -/
+theorem h1Toy_C4 :
+ (∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - 1 / 2 : ℝ) (2 * 1 + 1 / 2), h x ∈ Metric.ball (0 : ℝ) (2 * 1) ∧
+ HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) (h x)) ∧
+ CapHyp h1ToyF (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)) (-1 / 2, 0)
+ (2 * 1, 0) (h1ToyF (-1 / 2, 0)) (h1ToyF (1 / 2, 0)) := by
+ have hDf : ∀ p : ℝ × ℝ, HasFDerivAt h1ToyF ((p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ intro p
+ have hf : HasFDerivAt (fun q : ℝ × ℝ => q.1) (ContinuousLinearMap.fst ℝ ℝ ℝ) p :=
+ hasFDerivAt_fst
+ have hs : HasFDerivAt (fun q : ℝ × ℝ => q.2) (ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ hasFDerivAt_snd
+ have h1 := HasFDerivAt.sub (HasFDerivAt.sub
+ (HasFDerivAt.const_mul (HasFDerivAt.pow hf 3) (1 / 3)) (HasFDerivAt.const_mul hf (1 / 4)))
+ (HasFDerivAt.const_mul (HasFDerivAt.pow hs 2) 20)
+ convert h1 using 1
+ · funext q
+ simp only [h1ToyF, Pi.sub_apply]
+ ring
+ · ext <;> simp; ring
+ have hGs : ∀ p : ℝ × ℝ, HasStrictFDerivAt (fun q : ℝ × ℝ => ((q.1 ^ 2 - 1 / 4) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * q.2) • ContinuousLinearMap.snd ℝ ℝ ℝ).comp
+ (ContinuousLinearMap.inr ℝ ℝ ℝ))
+ (((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ intro p
+ convert (((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L
+ ContinuousLinearMap.snd ℝ ℝ ℝ).hasStrictFDerivAt (x := p) using 1
+ funext q
+ ext
+ simp
+ have hH : ∀ p : ℝ × ℝ, HasFDerivAt (fun y => ((p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * y) • ContinuousLinearMap.snd ℝ ℝ ℝ).comp (ContinuousLinearMap.inr ℝ ℝ ℝ))
+ ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) p.2 := by
+ intro p
+ convert ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ).hasFDerivAt (x := p.2) using 1
+ funext y
+ ext
+ simp
+ have hf : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.1) (ContinuousLinearMap.fst ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_fst
+ have hs : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.2) (ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_snd
+ have hD2 : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => (q.1 ^ 2 - 1 / 4) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * q.2) • ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ).smulRight (ContinuousLinearMap.fst ℝ ℝ ℝ) +
+ ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight (ContinuousLinearMap.snd ℝ ℝ ℝ)) p := by
+ intro p
+ have h1 : HasFDerivAt (fun q : ℝ × ℝ => q.1 ^ 2 - 1 / 4) ((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ)
+ p := by
+ have := (HasFDerivAt.pow (hf p) 2).sub_const (1 / 4)
+ convert this using 1
+ ext <;> simp
+ have h2 : HasFDerivAt (fun q : ℝ × ℝ => -40 * q.2) ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ HasFDerivAt.const_mul (hs p) (-40)
+ exact (h1.smul_const (ContinuousLinearMap.fst ℝ ℝ ℝ)).add
+ (h2.smul_const (ContinuousLinearMap.snd ℝ ℝ ℝ))
+ have hD3 : ∀ p : ℝ × ℝ, ∀ a b : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ =>
+ ((((2 * q.1) • ContinuousLinearMap.fst ℝ ℝ ℝ).smulRight (ContinuousLinearMap.fst ℝ ℝ ℝ) +
+ ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight (ContinuousLinearMap.snd ℝ ℝ ℝ)) a) b)
+ ((2 * a.1 * b.1) • ContinuousLinearMap.fst ℝ ℝ ℝ) p := by
+ intro p a b
+ have := (HasFDerivAt.const_mul (hf p) (2 * a.1 * b.1)).add_const (-40 * a.2 * b.2)
+ convert this using 1
+ funext q
+ simp
+ ring
+ have hT : ∀ p : ℝ × ℝ, ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : ℝ),
+ |((2 * (s₁, y₁).1 * (s₂, y₂).1) • ContinuousLinearMap.fst ℝ ℝ ℝ) (s₃, y₃) -
+ s₁ * s₂ * s₃ * ((2 * ((1 : ℝ), (0 : ℝ)).1 * ((1 : ℝ), (0 : ℝ)).1) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ) (1, 0)| ≤
+ 2 * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|) := by
+ intro p s₁ s₂ s₃ y₁ y₂ y₃
+ have h0 : ((2 * (s₁, y₁).1 * (s₂, y₂).1) • ContinuousLinearMap.fst ℝ ℝ ℝ) (s₃, y₃) -
+ s₁ * s₂ * s₃ * ((2 * ((1 : ℝ), (0 : ℝ)).1 * ((1 : ℝ), (0 : ℝ)).1) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ) (1, 0) = 0 := by
+ simp
+ ring
+ rw [h0, abs_zero]
+ have a1 : |s₁| ≤ |s₁| + ‖y₁‖ := le_add_of_nonneg_right (norm_nonneg _)
+ have a2 : |s₂| ≤ |s₂| + ‖y₂‖ := le_add_of_nonneg_right (norm_nonneg _)
+ have a3 : |s₃| ≤ |s₃| + ‖y₃‖ := le_add_of_nonneg_right (norm_nonneg _)
+ have := mul_le_mul (mul_le_mul a1 a2 (abs_nonneg _) (by positivity)) a3 (abs_nonneg _)
+ (by positivity)
+ linarith
+ have hsrc := ridge_capHyp_C4 (E := ℝ) (f := h1ToyF)
+ (Df := fun p => (p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (D2f := fun p => ((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ).smulRight
+ (ContinuousLinearMap.fst ℝ ℝ ℝ) +
+ ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight (ContinuousLinearMap.snd ℝ ℝ ℝ))
+ (T3 := fun _ a b => (2 * a.1 * b.1) • ContinuousLinearMap.fst ℝ ℝ ℝ) (Φ4 := fun _ => 0) (n := 0)
+ (DG := fun _ => ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (H := fun _ => (-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) (Hx := fun _ => 0)
+ (Hr := fun _ _ => 0) (r := 1) (m := 2) (lam := 40) (ε := 1 / 2) one_pos (by norm_num)
+ (by norm_num) (fun p _ => hDf p) (fun p _ => hD2 p) (fun p _ a b => hD3 p a b)
+ (fun p _ => hT p) (fun p _ => hasFDerivAt_const _ p) (fun p _ => by simp) (fun p _ => by simp)
+ (by norm_num)
+ (fun p _ => hGs p) (fun p _ => hH p)
+ (fun x _ => hasDerivAt_const x ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ))
+ (fun x _ => by simp only [ContinuousLinearMap.opNorm_zero]; norm_num)
+ (fun p _ s _ => hasDerivAt_const s ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ))
+ (fun p _ s _ => by simp only [ContinuousLinearMap.opNorm_zero]; positivity)
+ (fun v => by
+ simp only [smul_apply, ContinuousLinearMap.mul_apply', smul_eq_mul, Real.norm_eq_abs, sq_abs]
+ nlinarith [sq_nonneg v])
+ (by norm_num) (by ext <;> norm_num) (by ext <;> norm_num) ?_ ?_ ?_ ?_
+ (by simp only [h1ToyF]; norm_num)
+ · obtain ⟨hex, hcap⟩ := hsrc
+ have hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by
+ intro x
+ have := slice_hasFDerivAt (hDf (x, 0))
+ convert this using 1
+ ext
+ simp
+ obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩)
+ exact ⟨hex, hC⟩
+ · have hc : ConvexOn ℝ univ (fun x : ℝ => (2 : ℝ) • x ^ 2 + (-1 / 4 : ℝ)) :=
+ ((even_two.convexOn_pow).smul (by norm_num)).add (convexOn_const _ convex_univ)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp only [smul_eq_mul]
+ simp
+ ring
+ · refine (concaveOn_const (-1 / 4 : ℝ) (convex_Icc _ _)).congr ?_
+ intro x _
+ simp
+ ring
+ · intro v
+ have hc : ConvexOn ℝ univ (fun t : ℝ => ‖v‖ • t ^ 2) :=
+ (even_two.convexOn_pow).smul (norm_nonneg v)
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro t _
+ simp only [smul_eq_mul]
+ simp
+ · intro v
+ have hc : ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=
+ ((even_two.convexOn_pow).smul (norm_nonneg v)).neg
+ refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_
+ intro t _
+ simp only [smul_eq_mul]
+ simp
+
+/-- **`ridge_capHyp_D` is not vacuous.** `h1ToyF` meets every hypothesis of `ridge_capHyp_D` with
+`ε₀ = 1/2`. `T3` is constant, so `T4 = 0` and `K = 0`, and `|f_xxx| = 2 = m` on the pin segment.
+The theorem chooses the collar width itself. It gives the ridge on `(−2 − ε, 2 + ε)` for some
+`ε > 0` and the cap with `M = (−1/2, 0)`, from hypotheses on `D` and qualitative collar data only. -/
+theorem h1Toy_D :
+ (∃ ε > 0, ∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - ε : ℝ) (2 * 1 + ε), h x ∈ Metric.ball (0 : ℝ) (2 * 1) ∧
+ HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) (h x)) ∧
+ CapHyp h1ToyF (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)) (-1 / 2, 0)
+ (2 * 1, 0) (h1ToyF (-1 / 2, 0)) (h1ToyF (1 / 2, 0)) := by
+ have hDf : ∀ p : ℝ × ℝ, HasFDerivAt h1ToyF ((p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ intro p
+ have hf : HasFDerivAt (fun q : ℝ × ℝ => q.1) (ContinuousLinearMap.fst ℝ ℝ ℝ) p :=
+ hasFDerivAt_fst
+ have hs : HasFDerivAt (fun q : ℝ × ℝ => q.2) (ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ hasFDerivAt_snd
+ have h1 := HasFDerivAt.sub (HasFDerivAt.sub
+ (HasFDerivAt.const_mul (HasFDerivAt.pow hf 3) (1 / 3)) (HasFDerivAt.const_mul hf (1 / 4)))
+ (HasFDerivAt.const_mul (HasFDerivAt.pow hs 2) 20)
+ convert h1 using 1
+ · funext q
+ simp only [h1ToyF, Pi.sub_apply]
+ ring
+ · ext <;> simp; ring
+ have hGs : ∀ p : ℝ × ℝ, HasStrictFDerivAt (fun q : ℝ × ℝ => ((q.1 ^ 2 - 1 / 4) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * q.2) • ContinuousLinearMap.snd ℝ ℝ ℝ).comp
+ (ContinuousLinearMap.inr ℝ ℝ ℝ))
+ (((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ intro p
+ convert (((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L
+ ContinuousLinearMap.snd ℝ ℝ ℝ).hasStrictFDerivAt (x := p) using 1
+ funext q
+ ext
+ simp
+ have hH : ∀ p : ℝ × ℝ, HasFDerivAt (fun y => ((p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * y) • ContinuousLinearMap.snd ℝ ℝ ℝ).comp (ContinuousLinearMap.inr ℝ ℝ ℝ))
+ ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) p.2 := by
+ intro p
+ convert ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ).hasFDerivAt (x := p.2) using 1
+ funext y
+ ext
+ simp
+ have hf : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.1) (ContinuousLinearMap.fst ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_fst
+ have hs : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.2) (ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_snd
+ have hD2 : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => (q.1 ^ 2 - 1 / 4) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * q.2) • ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ).smulRight (ContinuousLinearMap.fst ℝ ℝ ℝ) +
+ ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight (ContinuousLinearMap.snd ℝ ℝ ℝ)) p := by
+ intro p
+ have h1 : HasFDerivAt (fun q : ℝ × ℝ => q.1 ^ 2 - 1 / 4) ((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ)
+ p := by
+ have := (HasFDerivAt.pow (hf p) 2).sub_const (1 / 4)
+ convert this using 1
+ ext <;> simp
+ have h2 : HasFDerivAt (fun q : ℝ × ℝ => -40 * q.2) ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ HasFDerivAt.const_mul (hs p) (-40)
+ exact (h1.smul_const (ContinuousLinearMap.fst ℝ ℝ ℝ)).add
+ (h2.smul_const (ContinuousLinearMap.snd ℝ ℝ ℝ))
+ have hD3 : ∀ p : ℝ × ℝ, ∀ a b : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ =>
+ ((((2 * q.1) • ContinuousLinearMap.fst ℝ ℝ ℝ).smulRight (ContinuousLinearMap.fst ℝ ℝ ℝ) +
+ ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight (ContinuousLinearMap.snd ℝ ℝ ℝ)) a) b)
+ ((2 * a.1 * b.1) • ContinuousLinearMap.fst ℝ ℝ ℝ) p := by
+ intro p a b
+ have := (HasFDerivAt.const_mul (hf p) (2 * a.1 * b.1)).add_const (-40 * a.2 * b.2)
+ convert this using 1
+ funext q
+ simp
+ ring
+ have hT : ∀ p : ℝ × ℝ, ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : ℝ),
+ |((2 * (s₁, y₁).1 * (s₂, y₂).1) • ContinuousLinearMap.fst ℝ ℝ ℝ) (s₃, y₃) -
+ s₁ * s₂ * s₃ * ((2 * ((1 : ℝ), (0 : ℝ)).1 * ((1 : ℝ), (0 : ℝ)).1) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ) (1, 0)| ≤
+ 2 * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|) := by
+ intro p s₁ s₂ s₃ y₁ y₂ y₃
+ have h0 : ((2 * (s₁, y₁).1 * (s₂, y₂).1) • ContinuousLinearMap.fst ℝ ℝ ℝ) (s₃, y₃) -
+ s₁ * s₂ * s₃ * ((2 * ((1 : ℝ), (0 : ℝ)).1 * ((1 : ℝ), (0 : ℝ)).1) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ) (1, 0) = 0 := by
+ simp
+ ring
+ rw [h0, abs_zero]
+ have a1 : |s₁| ≤ |s₁| + ‖y₁‖ := le_add_of_nonneg_right (norm_nonneg _)
+ have a2 : |s₂| ≤ |s₂| + ‖y₂‖ := le_add_of_nonneg_right (norm_nonneg _)
+ have a3 : |s₃| ≤ |s₃| + ‖y₃‖ := le_add_of_nonneg_right (norm_nonneg _)
+ have := mul_le_mul (mul_le_mul a1 a2 (abs_nonneg _) (by positivity)) a3 (abs_nonneg _)
+ (by positivity)
+ linarith
+ have hsrc := ridge_capHyp_D (E := ℝ) (f := h1ToyF)
+ (Df := fun p => (p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (D2f := fun p => ((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ).smulRight
+ (ContinuousLinearMap.fst ℝ ℝ ℝ) +
+ ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight (ContinuousLinearMap.snd ℝ ℝ ℝ))
+ (T3 := fun _ a b => (2 * a.1 * b.1) • ContinuousLinearMap.fst ℝ ℝ ℝ)
+ (T4 := fun _ _ _ _ => 0) (Φ4 := fun _ => 0) (n := 0)
+ (DG := fun _ => ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (H := fun _ => (-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) (Hx := fun _ => 0)
+ (Hr := fun _ _ => 0) (r := 1) (m := 2) (K := 0) (lam := 40) (ε₀ := 1 / 2) one_pos
+ (by norm_num) le_rfl
+ (fun p _ => hDf p) (fun p _ => hD2 p) (fun p _ a b => hD3 p a b)
+ (fun p _ a b c => hasDerivAt_const p.1 _) (fun p _ s₁ s₂ s₃ y₁ y₂ y₃ => by simp)
+ (fun p _ => hT p) (fun x _ => by simp) (fun p _ => hasFDerivAt_const _ p) (fun p _ => by simp)
+ (fun p _ => by simp) (by norm_num)
+ (fun p _ => hGs p) (fun p _ => hH p)
+ (fun x _ => hasDerivAt_const x ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ))
+ (fun p _ s _ => hasDerivAt_const s ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ))
+ (fun v => by
+ simp only [smul_apply, ContinuousLinearMap.mul_apply', smul_eq_mul, Real.norm_eq_abs, sq_abs]
+ nlinarith [sq_nonneg v])
+ (by norm_num) (by ext <;> norm_num) (by ext <;> norm_num)
+ (by simp only [h1ToyF]; norm_num)
+ obtain ⟨ε, hε, -, hex, hcap⟩ := hsrc
+ have hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by
+ intro x
+ have := slice_hasFDerivAt (hDf (x, 0))
+ convert this using 1
+ ext
+ simp
+ obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩)
+ exact ⟨⟨ε, hε, hex⟩, hC⟩
+
+
+/-- **`ridge_capHyp_E` is not vacuous.** `h1ToyF` is a polynomial, so it is `C⁴` on `U = ℝ²`.
+Its third derivative is `D³f[a, b, c] = 2 a.1 b.1 c.1` and its fourth derivative vanishes, so
+`m = 2` and `n = 0`; `D²f[(0, v), (0, v)] = -40 v²` gives `λ = 40`. From these hypotheses on `D`
+alone, the theorem gives the ridge on `(-2 - ε, 2 + ε)` for some `ε > 0` and the cap with
+`M = (-1/2, 0)`. -/
+theorem h1Toy_E :
+ (∃ ε > 0, ∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - ε : ℝ) (2 * 1 + ε), h x ∈ Metric.ball (0 : ℝ) (2 * 1) ∧
+ HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) (h x)) ∧
+ CapHyp h1ToyF (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)) (-1 / 2, 0)
+ (2 * 1, 0) (h1ToyF (-1 / 2, 0)) (h1ToyF (1 / 2, 0)) := by
+ have hf : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.1) (ContinuousLinearMap.fst ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_fst
+ have hs : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.2) (ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_snd
+ have hDf : ∀ p : ℝ × ℝ, HasFDerivAt h1ToyF ((p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ intro p
+ have h1 := HasFDerivAt.sub (HasFDerivAt.sub
+ (HasFDerivAt.const_mul (HasFDerivAt.pow (hf p) 3) (1 / 3))
+ (HasFDerivAt.const_mul (hf p) (1 / 4)))
+ (HasFDerivAt.const_mul (HasFDerivAt.pow (hs p) 2) 20)
+ convert h1 using 1
+ · funext q
+ simp only [h1ToyF, Pi.sub_apply]
+ ring
+ · ext <;> simp; ring
+ have hD2 : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => (q.1 ^ 2 - 1 / 4) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * q.2) • ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ).smulRight (ContinuousLinearMap.fst ℝ ℝ ℝ) +
+ ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight (ContinuousLinearMap.snd ℝ ℝ ℝ)) p := by
+ intro p
+ have h1 : HasFDerivAt (fun q : ℝ × ℝ => q.1 ^ 2 - 1 / 4) ((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ)
+ p := by
+ have := (HasFDerivAt.pow (hf p) 2).sub_const (1 / 4)
+ convert this using 1
+ ext <;> simp
+ have h2 : HasFDerivAt (fun q : ℝ × ℝ => -40 * q.2) ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ HasFDerivAt.const_mul (hs p) (-40)
+ exact (h1.smul_const (ContinuousLinearMap.fst ℝ ℝ ℝ)).add
+ (h2.smul_const (ContinuousLinearMap.snd ℝ ℝ ℝ))
+ have hcd : ContDiff ℝ 4 h1ToyF := by unfold h1ToyF; fun_prop
+ have hfd : fderiv ℝ h1ToyF = fun p => (p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ := funext fun p => (hDf p).fderiv
+ have h2 : ∀ (y : ℝ × ℝ) (m : Fin 2 → ℝ × ℝ),
+ iteratedFDeriv ℝ 2 h1ToyF y m = 2 * y.1 * (m 0).1 * (m 1).1 - 40 * (m 0).2 * (m 1).2 := by
+ intro y m
+ rw [iteratedFDeriv_two_apply, hfd, (hD2 y).fderiv]
+ simp
+ ring
+ have h3 : ∀ (x : ℝ × ℝ) (m : Fin 3 → ℝ × ℝ),
+ iteratedFDeriv ℝ 3 h1ToyF x m = 2 * (m 0).1 * (m 1).1 * (m 2).1 := by
+ intro x m
+ rw [DifferentiableAt.iteratedFDeriv_succ_apply_left'
+ (hcd.contDiffAt.differentiableAt_iteratedFDeriv (by norm_num))]
+ have hg : HasFDerivAt (fun y => iteratedFDeriv ℝ 2 h1ToyF y (Fin.tail m))
+ ((2 * (m 1).1 * (m 2).1) • ContinuousLinearMap.fst ℝ ℝ ℝ) x := by
+ have := ((hf x).const_mul (2 * (m 1).1 * (m 2).1)).sub_const (40 * (m 1).2 * (m 2).2)
+ convert this using 1
+ funext y; rw [h2]; simp [Fin.tail]; ring
+ rw [hg.fderiv]
+ simp
+ ring
+ have h4 : ∀ (x : ℝ × ℝ) (m : Fin 4 → ℝ × ℝ), iteratedFDeriv ℝ 4 h1ToyF x m = 0 := by
+ intro x m
+ rw [DifferentiableAt.iteratedFDeriv_succ_apply_left'
+ (hcd.contDiffAt.differentiableAt_iteratedFDeriv (by norm_num))]
+ have hg : (fun y => iteratedFDeriv ℝ 3 h1ToyF y (Fin.tail m)) =
+ fun _ => 2 * (m 1).1 * (m 2).1 * (m 3).1 := by
+ funext y; rw [h3]; simp [Fin.tail]
+ rw [hg]
+ simp
+ have hsrc := ridge_capHyp_E (E := ℝ) (f := h1ToyF) (U := univ) (r := 1) (m := 2) (n := 0)
+ (lam := 40) one_pos isOpen_univ (subset_univ _) hcd.contDiffOn
+ (fun p _ s₁ s₂ s₃ y₁ y₂ y₃ => by
+ rw [h3, h3]
+ simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Matrix.cons_val_two, Matrix.tail_cons,
+ Matrix.head_cons]
+ have h0 : 2 * s₁ * s₂ * s₃ - s₁ * s₂ * s₃ * (2 * 1 * 1 * 1) = 0 := by ring
+ rw [h0, abs_zero]
+ exact mul_nonneg (by norm_num) (block_nonneg s₁ s₂ s₃ y₁ y₂ y₃))
+ (fun x _ => by rw [h3]; simp)
+ (fun p _ => by rw [h4]; simp)
+ (fun p _ v => by rw [h4]; simp)
+ (by norm_num)
+ (fun v => by
+ rw [h2]
+ simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Real.norm_eq_abs, sq_abs]
+ nlinarith [sq_nonneg v])
+ (by norm_num)
+ (by rw [(hDf _).fderiv]; ext <;> norm_num)
+ (by rw [(hDf _).fderiv]; ext <;> norm_num)
+ (by simp only [h1ToyF]; norm_num)
+ obtain ⟨ε, hε, hex, hcap⟩ := hsrc
+ have hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by
+ intro x
+ have := slice_hasFDerivAt (hDf (x, 0))
+ convert this using 1
+ ext
+ simp
+ obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩)
+ exact ⟨⟨ε, hε, hex⟩, hC⟩
+
+
+/-- A pin-preserving quartic perturbation of `h1ToyF`: `q(x) = (x² - 1/4)²/480` vanishes to second
+order at both pins, so they stay critical and the gap stays `1/6`, while `f_xxx = 2 + x/20` varies
+and `D⁴f = 1/20 ≠ 0`. -/
+noncomputable def quarticToyF (p : ℝ × ℝ) : ℝ :=
+ p.1 ^ 3 / 3 - p.1 / 4 - 20 * p.2 ^ 2 + (p.1 ^ 2 - 1 / 4) ^ 2 / 480
+
+/-- **`ridge_capHyp_E` away from the degenerate face.** On `quarticToyF` the third derivative
+`f_xxx = 2 + x/20` varies, the fourth derivative `D⁴f = 1/20` is nonzero, and (H2) holds with
+equality, `rn = 1/20` (`r = 1`, `n = 1/20`); `|f_xxx| ≤ 81/40 = m` on the pin segment, and (H1) holds
+as `8m² = 32.805 < 40 = λ`. So `fxxx_lower`'s estimate is used with `n > 0` and the collar bound
+`K` is positive, unlike `h1Toy_E` (where `D⁴f = 0`). The theorem gives the ridge on
+`(-2 - ε, 2 + ε)` for some `ε > 0` and the cap with `M = (-1/2, 0)`. -/
+theorem quarticToy_E :
+ (∃ ε > 0, ∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - ε : ℝ) (2 * 1 + ε), h x ∈ Metric.ball (0 : ℝ) (2 * 1) ∧
+ HasFDerivAt (fun y => quarticToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) (h x)) ∧
+ CapHyp quarticToyF (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)) (-1 / 2, 0)
+ (2 * 1, 0) (quarticToyF (-1 / 2, 0)) (quarticToyF (1 / 2, 0)) := by
+ have hf : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.1) (ContinuousLinearMap.fst ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_fst
+ have hs : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.2) (ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_snd
+ have hDf : ∀ p : ℝ × ℝ, HasFDerivAt quarticToyF
+ ((p.1 ^ 2 - 1 / 4 + (4 * p.1 ^ 3 - p.1) / 480) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ intro p
+ have h1 := HasFDerivAt.add (HasFDerivAt.sub (HasFDerivAt.sub
+ (HasFDerivAt.const_mul (HasFDerivAt.pow (hf p) 3) (1 / 3))
+ (HasFDerivAt.const_mul (hf p) (1 / 4)))
+ (HasFDerivAt.const_mul (HasFDerivAt.pow (hs p) 2) 20))
+ (HasFDerivAt.const_mul (HasFDerivAt.pow ((HasFDerivAt.pow (hf p) 2).sub_const (1 / 4)) 2)
+ (1 / 480))
+ convert h1 using 1
+ · funext q
+ simp only [quarticToyF, Pi.sub_apply, Pi.add_apply]
+ ring
+ · ext <;> simp <;> ring
+ have hD2 : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => (q.1 ^ 2 - 1 / 4 + (4 * q.1 ^ 3 - q.1) / 480) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * q.2) • ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (((2 * p.1 + (12 * p.1 ^ 2 - 1) / 480) • ContinuousLinearMap.fst ℝ ℝ ℝ).smulRight
+ (ContinuousLinearMap.fst ℝ ℝ ℝ) +
+ ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight (ContinuousLinearMap.snd ℝ ℝ ℝ)) p := by
+ intro p
+ have h1 : HasFDerivAt (fun q : ℝ × ℝ => q.1 ^ 2 - 1 / 4 + (4 * q.1 ^ 3 - q.1) / 480)
+ ((2 * p.1 + (12 * p.1 ^ 2 - 1) / 480) • ContinuousLinearMap.fst ℝ ℝ ℝ) p := by
+ have := ((HasFDerivAt.pow (hf p) 2).sub_const (1 / 4)).add
+ (HasFDerivAt.const_mul ((HasFDerivAt.const_mul (HasFDerivAt.pow (hf p) 3) 4).sub (hf p))
+ (1 / 480))
+ convert this using 1 <;> first | (funext q; simp; ring) | (ext <;> simp; ring)
+ have h2 : HasFDerivAt (fun q : ℝ × ℝ => -40 * q.2) ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ HasFDerivAt.const_mul (hs p) (-40)
+ exact (h1.smul_const (ContinuousLinearMap.fst ℝ ℝ ℝ)).add
+ (h2.smul_const (ContinuousLinearMap.snd ℝ ℝ ℝ))
+ have hcd : ContDiff ℝ 4 quarticToyF := by unfold quarticToyF; fun_prop
+ have hfd : fderiv ℝ quarticToyF = fun p => (p.1 ^ 2 - 1 / 4 + (4 * p.1 ^ 3 - p.1) / 480) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ :=
+ funext fun p => (hDf p).fderiv
+ have h2 : ∀ (y : ℝ × ℝ) (m : Fin 2 → ℝ × ℝ), iteratedFDeriv ℝ 2 quarticToyF y m =
+ (2 * y.1 + (12 * y.1 ^ 2 - 1) / 480) * (m 0).1 * (m 1).1 - 40 * (m 0).2 * (m 1).2 := by
+ intro y m
+ rw [iteratedFDeriv_two_apply, hfd, (hD2 y).fderiv]
+ simp
+ ring
+ have h3 : ∀ (x : ℝ × ℝ) (m : Fin 3 → ℝ × ℝ),
+ iteratedFDeriv ℝ 3 quarticToyF x m = (2 + x.1 / 20) * (m 0).1 * (m 1).1 * (m 2).1 := by
+ intro x m
+ rw [DifferentiableAt.iteratedFDeriv_succ_apply_left'
+ (hcd.contDiffAt.differentiableAt_iteratedFDeriv (by norm_num))]
+ have hg : HasFDerivAt (fun y => iteratedFDeriv ℝ 2 quarticToyF y (Fin.tail m))
+ (((2 + x.1 / 20) * (m 1).1 * (m 2).1) • ContinuousLinearMap.fst ℝ ℝ ℝ) x := by
+ have hp : HasFDerivAt (fun y : ℝ × ℝ => 2 * y.1 + (12 * y.1 ^ 2 - 1) / 480)
+ ((2 + x.1 / 20) • ContinuousLinearMap.fst ℝ ℝ ℝ) x := by
+ have := (HasFDerivAt.const_mul (hf x) 2).add
+ (HasFDerivAt.const_mul ((HasFDerivAt.const_mul (HasFDerivAt.pow (hf x) 2) 12).sub_const 1)
+ (1 / 480))
+ convert this using 1 <;> first | (funext q; simp; ring) | (ext <;> simp; ring)
+ have := (hp.mul_const ((m 1).1 * (m 2).1)).sub_const (40 * (m 1).2 * (m 2).2)
+ convert this using 1
+ · funext y; rw [h2]; simp [Fin.tail]; ring
+ · (ext <;> simp); ring
+ rw [hg.fderiv]
+ simp
+ ring
+ have h4 : ∀ (x : ℝ × ℝ) (m : Fin 4 → ℝ × ℝ),
+ iteratedFDeriv ℝ 4 quarticToyF x m = (1 / 20) * (m 0).1 * (m 1).1 * (m 2).1 * (m 3).1 := by
+ intro x m
+ rw [DifferentiableAt.iteratedFDeriv_succ_apply_left'
+ (hcd.contDiffAt.differentiableAt_iteratedFDeriv (by norm_num))]
+ have hg : HasFDerivAt (fun y => iteratedFDeriv ℝ 3 quarticToyF y (Fin.tail m))
+ ((1 / 20 * (m 1).1 * (m 2).1 * (m 3).1) • ContinuousLinearMap.fst ℝ ℝ ℝ) x := by
+ have := (((hf x).const_mul (1 / 20)).const_add 2).mul_const ((m 1).1 * (m 2).1 * (m 3).1)
+ convert this using 1
+ · funext y; rw [h3]; simp [Fin.tail]; ring
+ · (ext <;> simp); ring
+ rw [hg.fderiv]
+ simp
+ ring
+ have hsrc := ridge_capHyp_E (E := ℝ) (f := quarticToyF) (U := univ) (r := 1) (m := 81 / 40)
+ (n := 1 / 20) (lam := 40) one_pos isOpen_univ (subset_univ _) hcd.contDiffOn
+ (fun p _ s₁ s₂ s₃ y₁ y₂ y₃ => by
+ rw [h3, h3]
+ simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Matrix.cons_val_two, Matrix.tail_cons,
+ Matrix.head_cons]
+ have h0 : (2 + p.1 / 20) * s₁ * s₂ * s₃ - s₁ * s₂ * s₃ * ((2 + p.1 / 20) * 1 * 1 * 1) = 0 := by
+ ring
+ rw [h0, abs_zero]
+ exact mul_nonneg (by norm_num) (block_nonneg s₁ s₂ s₃ y₁ y₂ y₃))
+ (fun x hx => by
+ rw [h3]
+ simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Matrix.cons_val_two, Matrix.tail_cons,
+ Matrix.head_cons, mul_one]
+ rw [abs_le]
+ constructor <;> linarith [hx.1, hx.2])
+ (fun p _ => by rw [h4]; simp)
+ (fun p _ v => by rw [h4]; simp)
+ (by norm_num)
+ (fun v => by
+ rw [h2]
+ simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Real.norm_eq_abs, sq_abs]
+ nlinarith [sq_nonneg v])
+ (by norm_num)
+ (by rw [(hDf _).fderiv]; ext <;> norm_num)
+ (by rw [(hDf _).fderiv]; ext <;> norm_num)
+ (by simp only [quarticToyF]; norm_num)
+ obtain ⟨ε, hε, hex, hcap⟩ := hsrc
+ have hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => quarticToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by
+ intro x
+ have := slice_hasFDerivAt (hDf (x, 0))
+ convert this using 1
+ ext
+ simp
+ obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩)
+ exact ⟨⟨ε, hε, hex⟩, hC⟩
+
+/-! ### v2.4: the cap on P §7's event `G_r`, for every pin gap `k > 0`
+
+P §7 (`imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md`) uses the deterministic
+cap on `G_r = {λ_min(−A_M) > [4/(3k)] r M3², r M4 ≤ 3k/10}` with the pin gap `f(M) − f(S) = k r³`.
+`ridge_capHyp_E` is the case `k = 1/6`. A positive factor `f ↦ c f` multiplies every derivative
+bound and the transverse curvature by `c`, and changes neither the critical points nor the cap. -/
+
+namespace CapHyp
+
+variable {f : X → ℝ} {C : Set X} {M z : X} {b s : ℝ}
+
+/-- A positive factor. A cap for `c f` at the levels `c b`, `c s` is a cap for `f` at `b`, `s`. -/
+theorem of_const_mul {c : ℝ} (hc : 0 < c)
+ (H : CapHyp (fun x => c * f x) C M z (c * b) (c * s)) : CapHyp f C M z b s where
+ mem := H.mem
+ ceiling x hx := le_of_mul_le_mul_left (H.ceiling x hx) hc
+ frontier_le x hx := le_of_mul_le_mul_left (H.frontier_le x hx) hc
+ older := lt_of_mul_lt_mul_left H.older hc.le
+ ridge := by
+ obtain ⟨γ, hγ⟩ := H.ridge
+ exact ⟨γ, fun t => le_of_mul_le_mul_left (hγ t) hc⟩
+
+end CapHyp
+
+section GapK
+
+variable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
+
+/-- A nonzero factor does not move the points where the derivative vanishes. -/
+theorem hasFDerivAt_zero_const_mul_iff {φ : E → ℝ} {c : ℝ} (hc : c ≠ 0) {y : E} :
+ HasFDerivAt (fun y => c * φ y) (0 : E →L[ℝ] ℝ) y ↔ HasFDerivAt φ (0 : E →L[ℝ] ℝ) y := by
+ constructor
+ · intro h
+ have h' := h.const_mul c⁻¹
+ rw [smul_zero] at h'
+ exact h'.congr_of_eventuallyEq
+ (Filter.Eventually.of_forall fun y => (inv_mul_cancel_left₀ hc (φ y)).symm)
+ · intro h
+ have h' := h.const_mul c
+ rwa [smul_zero] at h'
+
+/-- On an open set where `f ∈ C⁴`, the derivatives of order `≤ 4` of `c f` are `c` times those of
+`f`. -/
+theorem iteratedFDeriv_const_mul_of_isOpen {f : ℝ × E → ℝ} {U : Set (ℝ × E)} (hU : IsOpen U)
+ (hf : ContDiffOn ℝ 4 f U) (c : ℝ) {i : ℕ} (hi : i ≤ 4) {p : ℝ × E} (hp : p ∈ U) :
+ iteratedFDeriv ℝ i (fun q => c * f q) p = c • iteratedFDeriv ℝ i f p := by
+ have hfa : ContDiffAt ℝ i f p :=
+ (hf.contDiffAt (hU.mem_nhds hp)).of_le (by exact_mod_cast hi)
+ exact iteratedFDeriv_const_smul_apply' (a := c) hfa
+
+/-- **The cap for every gap `k > 0`** (P §7's event `G_r`). With the pin gap
+`f(M) − f(S) = k r³`, the hypotheses `(4/(3k)) r m² < λ` and `r n ≤ 3k/10` give the conclusion of
+`ridge_capHyp_E`. That theorem is the case `k = 1/6`; the proof applies it to `f / (6k)`. -/
+theorem ridge_capHyp_K [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {U : Set (ℝ × E)}
+ {r k m n lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)
+ (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)
+ (hf : ContDiffOn ℝ 4 f U)
+ (hT : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),
+ |iteratedFDeriv ℝ 3 f p ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] -
+ s₁ * s₂ * s₃ * iteratedFDeriv ℝ 3 f p ![(1, 0), (1, 0), (1, 0)]| ≤
+ m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))
+ (hTe : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 f (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ m)
+ (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ |iteratedFDeriv ℝ 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ n)
+ (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,
+ |iteratedFDeriv ℝ 4 f p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ n * ‖v‖)
+ (hH2 : r * n ≤ 3 * k / 10)
+ (hlam : ∀ v : E, iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)
+ (hH1 : 4 / (3 * k) * r * m ^ 2 < lam)
+ (hM : fderiv ℝ f (-r / 2, 0) = 0) (hS : fderiv ℝ f (r / 2, 0) = 0)
+ (hnorm : f (-r / 2, 0) - f (r / 2, 0) = k * r ^ 3) :
+ ∃ ε, 0 < ε ∧
+ (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧
+ ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),
+ h x ∈ Metric.closedBall (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →
+ h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0)
+ (2 * r, h (2 * r)) (f (-r / 2, 0)) (f (r / 2, 0)) ∧
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, 0) → f x < f (r / 2, 0) := by
+ obtain ⟨c, hc_def⟩ : ∃ c : ℝ, c = 1 / (6 * k) := ⟨_, rfl⟩
+ have hk0 : k ≠ 0 := hk.ne'
+ have hc : 0 < c := by rw [hc_def]; positivity
+ have hD : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), p ∈ U :=
+ fun p hp => hDU hp
+ have hseg : ∀ x ∈ Icc (-r / 2) (r / 2), ((x, 0) : ℝ × E) ∈ U := by
+ intro x hx
+ apply hDU
+ refine ⟨⟨by linarith [hx.1], by linarith [hx.2]⟩, ?_⟩
+ simp only [Metric.mem_closedBall, dist_self]
+ linarith
+ have hsc : ∀ {i : ℕ}, i ≤ 4 → ∀ p ∈ U,
+ iteratedFDeriv ℝ i (fun q => c * f q) p = c • iteratedFDeriv ℝ i f p :=
+ fun hi p hp => iteratedFDeriv_const_mul_of_isOpen hU hf c hi hp
+ have hdiff : ∀ p ∈ U, DifferentiableAt ℝ f p := fun p hp =>
+ (hf.contDiffAt (hU.mem_nhds hp)).differentiableAt (by norm_num)
+ have hMU : ((-r / 2, 0) : ℝ × E) ∈ U := hseg _ ⟨le_refl _, by linarith⟩
+ have hSU : ((r / 2, 0) : ℝ × E) ∈ U := hseg _ ⟨by linarith, le_refl _⟩
+ have key := ridge_capHyp_E (E := E) (f := fun q => c * f q) (U := U) (m := c * m)
+ (n := c * n) (lam := c * lam) hr hU hDU (contDiffOn_const.mul hf)
+ (fun p hp s₁ s₂ s₃ y₁ y₂ y₃ => by
+ rw [hsc (by norm_num) p (hD p hp)]
+ simp only [smul_apply, smul_eq_mul]
+ have h := hT p hp s₁ s₂ s₃ y₁ y₂ y₃
+ generalize iteratedFDeriv ℝ 3 f p ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] = A at h ⊢
+ generalize iteratedFDeriv ℝ 3 f p ![(1, 0), (1, 0), (1, 0)] = B at h ⊢
+ rw [show c * A - s₁ * s₂ * s₃ * (c * B) = c * (A - s₁ * s₂ * s₃ * B) by ring, abs_mul,
+ abs_of_pos hc, mul_assoc c m]
+ exact mul_le_mul_of_nonneg_left h hc.le)
+ (fun x hx => by
+ rw [hsc (by norm_num) _ (hseg x hx)]
+ simp only [smul_apply, smul_eq_mul]
+ rw [abs_mul, abs_of_pos hc]
+ exact mul_le_mul_of_nonneg_left (hTe x hx) hc.le)
+ (fun p hp => by
+ rw [hsc (by norm_num) p (hD p hp)]
+ simp only [smul_apply, smul_eq_mul]
+ rw [abs_mul, abs_of_pos hc]
+ exact mul_le_mul_of_nonneg_left (hn4x p hp) hc.le)
+ (fun p hp v => by
+ rw [hsc (by norm_num) p (hD p hp)]
+ simp only [smul_apply, smul_eq_mul]
+ rw [abs_mul, abs_of_pos hc, mul_assoc]
+ exact mul_le_mul_of_nonneg_left (hn4y p hp v) hc.le)
+ (by
+ rw [hc_def, show r * (1 / (6 * k) * n) = r * n / (6 * k) by ring,
+ div_le_iff₀ (by positivity)]
+ linarith)
+ (fun v => by
+ rw [hsc (by norm_num) _ hMU]
+ simp only [smul_apply, smul_eq_mul]
+ calc c * iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)]
+ ≤ c * (-lam * ‖v‖ ^ 2) := mul_le_mul_of_nonneg_left (hlam v) hc.le
+ _ = -(c * lam) * ‖v‖ ^ 2 := by ring)
+ (by
+ have h8 : 8 * r * (c * m) ^ 2 = c * (4 / (3 * k) * r * m ^ 2) := by
+ rw [hc_def]; field_simp; ring
+ rw [h8]
+ exact mul_lt_mul_of_pos_left hH1 hc)
+ (by rw [fderiv_const_mul (hdiff _ hMU) c, hM, smul_zero])
+ (by rw [fderiv_const_mul (hdiff _ hSU) c, hS, smul_zero])
+ (by
+ show c * f (-r / 2, 0) - c * f (r / 2, 0) = r ^ 3 / 6
+ rw [← mul_sub, hnorm, hc_def]
+ field_simp)
+ obtain ⟨ε, hε, hex, hcap⟩ := key
+ refine ⟨ε, hε, ?_, ?_⟩
+ · obtain ⟨h, hh⟩ := hex
+ exact ⟨h, fun x hx => ⟨(hh x hx).1, (hasFDerivAt_zero_const_mul_iff hc.ne').1 (hh x hx).2⟩⟩
+ · intro h hh
+ obtain ⟨h1, h2, hC, hfr⟩ := hcap h fun x hx =>
+ ⟨(hh x hx).1, (hasFDerivAt_zero_const_mul_iff hc.ne').2 (hh x hx).2⟩
+ exact ⟨h1, h2, hC.of_const_mul hc, fun x hx hne => lt_of_mul_lt_mul_left (hfr x hx hne) hc.le⟩
+
+/-- **P §7's `G_r` with operator norms.** If `‖D³f‖ ≤ M3` and `‖D⁴f‖ ≤ M4` on
+`D = [−2r, 2r] × B̄(0, 2r)`, then `(4/(3k)) r M3² < λ` and `r M4 ≤ 3k/10` give the cap. Each
+partial-block bound used by `ridge_capHyp_K` is at most the operator norm (`block_of_norm`). -/
+theorem ridge_capHyp_norm_K [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {U : Set (ℝ × E)}
+ {r k M3 M4 lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)
+ (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)
+ (hf : ContDiffOn ℝ 4 f U)
+ (h3 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ‖iteratedFDeriv ℝ 3 f p‖ ≤ M3)
+ (h4 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ ‖iteratedFDeriv ℝ 4 f p‖ ≤ M4)
+ (hH2 : r * M4 ≤ 3 * k / 10)
+ (hlam : ∀ v : E, iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)
+ (hH1 : 4 / (3 * k) * r * M3 ^ 2 < lam)
+ (hM : fderiv ℝ f (-r / 2, 0) = 0) (hS : fderiv ℝ f (r / 2, 0) = 0)
+ (hnorm : f (-r / 2, 0) - f (r / 2, 0) = k * r ^ 3) :
+ ∃ ε, 0 < ε ∧
+ (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧
+ ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),
+ h x ∈ Metric.closedBall (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →
+ h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0)
+ (2 * r, h (2 * r)) (f (-r / 2, 0)) (f (r / 2, 0)) ∧
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, 0) → f x < f (r / 2, 0) := by
+ have he : ‖((1 : ℝ), (0 : E))‖ = 1 := by simp [Prod.norm_def]
+ have hv : ∀ v : E, ‖((0 : ℝ), v)‖ = ‖v‖ := fun v => by simp [Prod.norm_def]
+ refine ridge_capHyp_K hr hk hU hDU hf
+ (fun p hp s₁ s₂ s₃ y₁ y₂ y₃ => block_of_norm (h3 p hp) s₁ s₂ s₃ y₁ y₂ y₃)
+ (fun x hx => ?_) (fun p hp => ?_) (fun p hp v => ?_) hH2 hlam hH1 hM hS hnorm
+ · have hp : ((x, 0) : ℝ × E) ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) := by
+ refine ⟨⟨by linarith [hx.1], by linarith [hx.2]⟩, ?_⟩
+ simp only [Metric.mem_closedBall, dist_self]
+ linarith
+ have h := (iteratedFDeriv ℝ 3 f (x, 0)).le_opNorm ![(1, 0), (1, 0), (1, 0)]
+ simp only [Fin.prod_univ_three, Matrix.cons_val_zero, Matrix.cons_val_one,
+ Matrix.cons_val_two, Matrix.tail_cons, Matrix.head_cons, he, mul_one] at h
+ rw [← Real.norm_eq_abs]
+ exact h.trans (h3 _ hp)
+ · have h := (iteratedFDeriv ℝ 4 f p).le_opNorm ![(1, 0), (1, 0), (1, 0), (1, 0)]
+ simp only [Fin.prod_univ_four, Matrix.cons_val_zero, Matrix.cons_val_one,
+ Matrix.cons_val_two, Matrix.cons_val_three, Matrix.tail_cons, Matrix.head_cons, he,
+ mul_one] at h
+ rw [← Real.norm_eq_abs]
+ exact h.trans (h4 p hp)
+ · have h := (iteratedFDeriv ℝ 4 f p).le_opNorm ![(0, v), (1, 0), (1, 0), (1, 0)]
+ simp only [Fin.prod_univ_four, Matrix.cons_val_zero, Matrix.cons_val_one,
+ Matrix.cons_val_two, Matrix.cons_val_three, Matrix.tail_cons, Matrix.head_cons, he, hv,
+ mul_one] at h
+ rw [← Real.norm_eq_abs]
+ exact h.trans (mul_le_mul_of_nonneg_right (h4 p hp) (norm_nonneg v))
+
+end GapK
+
+/-! ### v2.5: CAP (1) in its own partial-block norms
+
+CAP §1 (`imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md`) states the deterministic
+theorem with `M_j = max_{a+c=j} sup_D ‖∂_x^a D_y^c f‖_op` (`c` transverse Euclidean unit vectors,
+chosen independently) and `λ = λ_min(−D_y² f(M))`, under (1): `λ > (4/(3κ)) r M_3²`,
+`r M_4 ≤ 3κ/10`. `ridge_capHyp_K` takes the third derivative as one block inequality `hT`.
+`block_of_partial` derives `hT` from CAP's partial blocks with `c = 1, 2, 3`, using the symmetry of
+`D³f`, which holds for `f ∈ C³` (`iteratedFDeriv_three_swap₁₂`, `iteratedFDeriv_three_swap₂₃`).
+`ridge_capHyp_blocks` then states the cap under CAP's hypotheses as written. -/
+
+section PartialBlock
+
+open Filter Topology
+
+variable {F : Type*} [NormedAddCommGroup F] [NormedSpace ℝ F]
+
+/-- The third derivative of a `C³` function is symmetric in its first two slots: here
+`D³f[a, b, c] = D²(Df)[a, b] c`, and `Df` has a symmetric second derivative. -/
+theorem iteratedFDeriv_three_swap₁₂ {f : F → ℝ} {p : F} (hf : ContDiffAt ℝ 3 f p) (a b c : F) :
+ iteratedFDeriv ℝ 3 f p ![a, b, c] = iteratedFDeriv ℝ 3 f p ![b, a, c] := by
+ have h2 : ContDiffAt ℝ 2 (fderiv ℝ f) p := hf.fderiv_right (by norm_num)
+ have hs : IsSymmSndFDerivAt ℝ (fderiv ℝ f) p := h2.isSymmSndFDerivAt (by simp)
+ have hr : ∀ x y : F, iteratedFDeriv ℝ 3 f p ![x, y, c] =
+ iteratedFDeriv ℝ 2 (fderiv ℝ f) p ![x, y] c := by
+ intro x y
+ rw [iteratedFDeriv_succ_apply_right]
+ have e : Fin.init ![x, y, c] = ![x, y] := by ext i; fin_cases i <;> rfl
+ rw [e]
+ rfl
+ rw [hr, hr, IsSymmSndFDerivAt.iteratedFDeriv_cons (hf := hs)]
+
+/-- The third derivative of a `C³` function is symmetric in its last two slots: here
+`D³f[a, b, c] = (D(D²f)[a])[b, c]`, and `D²f` is symmetric on a neighbourhood of `p`, so its
+derivative at `p` is symmetric too. -/
+theorem iteratedFDeriv_three_swap₂₃ {f : F → ℝ} {p : F} (hf : ContDiffAt ℝ 3 f p) (a b c : F) :
+ iteratedFDeriv ℝ 3 f p ![a, b, c] = iteratedFDeriv ℝ 3 f p ![a, c, b] := by
+ have hev : (fun q => iteratedFDeriv ℝ 2 f q ![b, c]) =ᶠ[𝓝 p]
+ (fun q => iteratedFDeriv ℝ 2 f q ![c, b]) := by
+ filter_upwards [hf.eventually (by simp)] with q hq
+ have hq2 : ContDiffAt ℝ 2 f q := hq.of_le (by norm_num)
+ exact IsSymmSndFDerivAt.iteratedFDeriv_cons (hf := hq2.isSymmSndFDerivAt (by simp))
+ have hd : DifferentiableAt ℝ (iteratedFDeriv ℝ 2 f) p :=
+ (hf.iteratedFDeriv_right (i := 2) (m := 1) (by norm_num)).differentiableAt (by norm_num)
+ have key : ∀ v : Fin 2 → F, fderiv ℝ (fun q => iteratedFDeriv ℝ 2 f q v) p a =
+ fderiv ℝ (iteratedFDeriv ℝ 2 f) p a v := by
+ intro v
+ have := ((ContinuousMultilinearMap.apply ℝ (fun _ : Fin 2 => F) ℝ v).hasFDerivAt.comp p
+ hd.hasFDerivAt).fderiv
+ rw [show (fun q => iteratedFDeriv ℝ 2 f q v) =
+ (ContinuousMultilinearMap.apply ℝ (fun _ : Fin 2 => F) ℝ v) ∘ iteratedFDeriv ℝ 2 f from rfl,
+ this]
+ rfl
+ rw [iteratedFDeriv_succ_apply_left, iteratedFDeriv_succ_apply_left]
+ have t1 : Fin.tail ![a, b, c] = ![b, c] := by ext i; fin_cases i <;> rfl
+ have t2 : Fin.tail ![a, c, b] = ![c, b] := by ext i; fin_cases i <;> rfl
+ simp only [Matrix.cons_val_zero, t1, t2]
+ rw [← key, ← key, hev.fderiv_eq]
+
+variable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
+
+/-- **CAP's partial blocks give the block inequality.** For a symmetric trilinear form `B` on
+`ℝ × E`, bounds by `m` on the three partial blocks with `c = 1, 2, 3` transverse slots, namely
+`|B[(0, y), e, e]| ≤ m‖y‖`, `|B[(0, y₁), (0, y₂), e]| ≤ m‖y₁‖‖y₂‖` and
+`|B[(0, y₁), (0, y₂), (0, y₃)]| ≤ m‖y₁‖‖y₂‖‖y₃‖` with `e = (1, 0)`, give the block inequality `hT` of
+`ridge_capHyp_E` and `ridge_capHyp_K`. The proof expands `B[(s₁, y₁), (s₂, y₂), (s₃, y₃)]`
+multilinearly: the seven mixed terms are partial blocks in some slot order, symmetry brings each to
+the canonical order, and their bounds add up to `m(Π(|sᵢ| + ‖yᵢ‖) − Π|sᵢ|)`. No sign of `m` is
+assumed. -/
+theorem block_of_partial {B : ContinuousMultilinearMap ℝ (fun _ : Fin 3 => ℝ × E) ℝ} {m : ℝ}
+ (hs₁₂ : ∀ a b c : ℝ × E, B ![a, b, c] = B ![b, a, c])
+ (hs₂₃ : ∀ a b c : ℝ × E, B ![a, b, c] = B ![a, c, b])
+ (k₁ : ∀ y : E, |B ![((0 : ℝ), y), (1, 0), (1, 0)]| ≤ m * ‖y‖)
+ (k₂ : ∀ y₁ y₂ : E, |B ![((0 : ℝ), y₁), (0, y₂), (1, 0)]| ≤ m * ‖y₁‖ * ‖y₂‖)
+ (k₃ : ∀ y₁ y₂ y₃ : E, |B ![((0 : ℝ), y₁), (0, y₂), (0, y₃)]| ≤ m * ‖y₁‖ * ‖y₂‖ * ‖y₃‖)
+ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E) :
+ |B ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] - s₁ * s₂ * s₃ * B ![(1, 0), (1, 0), (1, 0)]| ≤
+ m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|) := by
+ have hu0 : ∀ x b c z : ℝ × E, Function.update ![x, b, c] 0 z = ![z, b, c] := fun _ _ _ _ => by
+ funext i; fin_cases i <;> simp
+ have hu1 : ∀ a x c z : ℝ × E, Function.update ![a, x, c] 1 z = ![a, z, c] := fun _ _ _ _ => by
+ funext i; fin_cases i <;> simp
+ have hu2 : ∀ a b x z : ℝ × E, Function.update ![a, b, x] 2 z = ![a, b, z] := fun _ _ _ _ => by
+ funext i; fin_cases i <;> simp
+ have a₁ : ∀ x x' b c : ℝ × E, B ![x + x', b, c] = B ![x, b, c] + B ![x', b, c] := by
+ intro x x' b c
+ have := B.map_update_add ![x, b, c] 0 x x'
+ rwa [hu0, hu0, hu0] at this
+ have a₂ : ∀ a x x' c : ℝ × E, B ![a, x + x', c] = B ![a, x, c] + B ![a, x', c] := by
+ intro a x x' c
+ have := B.map_update_add ![a, x, c] 1 x x'
+ rwa [hu1, hu1, hu1] at this
+ have a₃ : ∀ a b x x' : ℝ × E, B ![a, b, x + x'] = B ![a, b, x] + B ![a, b, x'] := by
+ intro a b x x'
+ have := B.map_update_add ![a, b, x] 2 x x'
+ rwa [hu2, hu2, hu2] at this
+ have m₁ : ∀ (t : ℝ) (x b c : ℝ × E), B ![t • x, b, c] = t * B ![x, b, c] := by
+ intro t x b c
+ have := B.map_update_smul ![x, b, c] 0 t x
+ rwa [hu0, hu0, smul_eq_mul] at this
+ have m₂ : ∀ (t : ℝ) (a x c : ℝ × E), B ![a, t • x, c] = t * B ![a, x, c] := by
+ intro t a x c
+ have := B.map_update_smul ![a, x, c] 1 t x
+ rwa [hu1, hu1, smul_eq_mul] at this
+ have m₃ : ∀ (t : ℝ) (a b x : ℝ × E), B ![a, b, t • x] = t * B ![a, b, x] := by
+ intro t a b x
+ have := B.map_update_smul ![a, b, x] 2 t x
+ rwa [hu2, hu2, smul_eq_mul] at this
+ set e : ℝ × E := ((1 : ℝ), (0 : E)) with he_def
+ have hsp : ∀ (s : ℝ) (y : E), ((s, y) : ℝ × E) = s • e + ((0 : ℝ), y) := by
+ intro s y; ext <;> simp [he_def]
+ set P₁ := |s₁| + ‖y₁‖
+ set P₂ := |s₂| + ‖y₂‖
+ set P₃ := |s₃| + ‖y₃‖
+ -- the multilinear expansion
+ have expand : B ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] - s₁ * s₂ * s₃ * B ![e, e, e] =
+ (s₂ * s₃ * B ![((0 : ℝ), y₁), e, e] + s₂ * B ![((0 : ℝ), y₁), e, (0, y₃)] +
+ s₃ * B ![((0 : ℝ), y₁), (0, y₂), e] + B ![((0 : ℝ), y₁), (0, y₂), (0, y₃)]) +
+ (s₁ * s₃ * B ![e, ((0 : ℝ), y₂), e] + s₁ * B ![e, ((0 : ℝ), y₂), (0, y₃)]) +
+ s₁ * s₂ * B ![e, e, ((0 : ℝ), y₃)] := by
+ rw [hsp s₁ y₁, hsp s₂ y₂, hsp s₃ y₃]
+ simp only [a₁, a₂, a₃, m₁, m₂, m₃]
+ ring
+ rw [he_def] at expand ⊢
+ rw [expand]
+ -- the seven partial blocks, brought to the canonical order by symmetry
+ have b₁ := k₁ y₁
+ have b₂ : |B ![((0 : ℝ), y₁), (1, 0), (0, y₃)]| ≤ m * ‖y₁‖ * ‖y₃‖ := by
+ rw [hs₂₃]; exact k₂ y₁ y₃
+ have b₃ := k₂ y₁ y₂
+ have b₄ := k₃ y₁ y₂ y₃
+ have b₅ : |B ![(1, 0), ((0 : ℝ), y₂), (1, 0)]| ≤ m * ‖y₂‖ := by
+ rw [hs₁₂]; exact k₁ y₂
+ have b₆ : |B ![(1, 0), ((0 : ℝ), y₂), (0, y₃)]| ≤ m * ‖y₂‖ * ‖y₃‖ := by
+ rw [hs₁₂, hs₂₃]; exact k₂ y₂ y₃
+ have b₇ : |B ![(1, 0), (1, 0), ((0 : ℝ), y₃)]| ≤ m * ‖y₃‖ := by
+ rw [hs₂₃, hs₁₂]; exact k₁ y₃
+ have hP : m * (P₁ * P₂ * P₃ - |s₁| * |s₂| * |s₃|) =
+ (|s₂| * |s₃| * (m * ‖y₁‖) + |s₂| * (m * ‖y₁‖ * ‖y₃‖) + |s₃| * (m * ‖y₁‖ * ‖y₂‖) +
+ m * ‖y₁‖ * ‖y₂‖ * ‖y₃‖) +
+ (|s₁| * |s₃| * (m * ‖y₂‖) + |s₁| * (m * ‖y₂‖ * ‖y₃‖)) + |s₁| * |s₂| * (m * ‖y₃‖) := by
+ simp only [P₁, P₂, P₃]; ring
+ rw [hP]
+ refine (abs_add_le _ _).trans (add_le_add ((abs_add_le _ _).trans (add_le_add
+ ((abs_add_le _ _).trans (add_le_add ((abs_add_le _ _).trans (add_le_add
+ ((abs_add_le _ _).trans (add_le_add ?_ ?_)) ?_)) ?_)) ((abs_add_le _ _).trans
+ (add_le_add ?_ ?_)))) ?_)
+ · rw [abs_mul, abs_mul]; exact mul_le_mul_of_nonneg_left b₁ (by positivity)
+ · rw [abs_mul]; exact mul_le_mul_of_nonneg_left b₂ (abs_nonneg _)
+ · rw [abs_mul]; exact mul_le_mul_of_nonneg_left b₃ (abs_nonneg _)
+ · exact b₄
+ · rw [abs_mul, abs_mul]; exact mul_le_mul_of_nonneg_left b₅ (by positivity)
+ · rw [abs_mul]; exact mul_le_mul_of_nonneg_left b₆ (abs_nonneg _)
+ · rw [abs_mul, abs_mul]; exact mul_le_mul_of_nonneg_left b₇ (by positivity)
+
+/-- **The cap under CAP (1) as written.** `f ∈ C⁴` on an open `U ⊇ D`; CAP's partial-block bounds
+on `D` with `M3` for `c = 1, 2, 3` transverse slots, and for `c = 0` on the pin segment only (CAP
+bounds it on all of `D`); the two partial blocks of the fourth derivative that the proof uses,
+`c = 0` and `c = 1`, with `M4`; the transverse curvature `λ` at `M`; and (1),
+`(4/(3k)) r M3² < λ` and `r M4 ≤ 3k/10`, for the pin gap `k r³`. The conclusion is that of
+`ridge_capHyp_K`. -/
+theorem ridge_capHyp_blocks [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {U : Set (ℝ × E)}
+ {r k M3 M4 lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)
+ (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)
+ (hf : ContDiffOn ℝ 4 f U)
+ (h30 : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 f (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ M3)
+ (h31 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y : E,
+ |iteratedFDeriv ℝ 3 f p ![(0, y), (1, 0), (1, 0)]| ≤ M3 * ‖y‖)
+ (h32 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ : E,
+ |iteratedFDeriv ℝ 3 f p ![(0, y₁), (0, y₂), (1, 0)]| ≤ M3 * ‖y₁‖ * ‖y₂‖)
+ (h33 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ y₃ : E,
+ |iteratedFDeriv ℝ 3 f p ![(0, y₁), (0, y₂), (0, y₃)]| ≤ M3 * ‖y₁‖ * ‖y₂‖ * ‖y₃‖)
+ (h40 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ |iteratedFDeriv ℝ 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ M4)
+ (h41 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,
+ |iteratedFDeriv ℝ 4 f p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ M4 * ‖v‖)
+ (hlam : ∀ v : E, iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)
+ (hH1 : 4 / (3 * k) * r * M3 ^ 2 < lam) (hH2 : r * M4 ≤ 3 * k / 10)
+ (hM : fderiv ℝ f (-r / 2, 0) = 0) (hS : fderiv ℝ f (r / 2, 0) = 0)
+ (hnorm : f (-r / 2, 0) - f (r / 2, 0) = k * r ^ 3) :
+ ∃ ε, 0 < ε ∧
+ (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧
+ ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),
+ h x ∈ Metric.closedBall (0 : E) (2 * r) ∧
+ HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →
+ h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧
+ CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0)
+ (2 * r, h (2 * r)) (f (-r / 2, 0)) (f (r / 2, 0)) ∧
+ ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)),
+ x ≠ (r / 2, 0) → f x < f (r / 2, 0) := by
+ refine ridge_capHyp_K hr hk hU hDU hf (fun p hp s₁ s₂ s₃ y₁ y₂ y₃ => ?_) h30 h40 h41 hH2 hlam
+ hH1 hM hS hnorm
+ have hp3 : ContDiffAt ℝ 3 f p := (hf.contDiffAt (hU.mem_nhds (hDU hp))).of_le (by norm_num)
+ exact block_of_partial (iteratedFDeriv_three_swap₁₂ hp3) (iteratedFDeriv_three_swap₂₃ hp3)
+ (h31 p hp) (h32 p hp) (h33 p hp) s₁ s₂ s₃ y₁ y₂ y₃
+
+end PartialBlock
+
+/-- A toy with a nonzero mixed block. `x³/3 − x/4 − 20y²` plus `xy²`: the pins and the gap `1/6` are
+unchanged, and `∂_x D_y² f = 2`. -/
+noncomputable def mixedToyF (p : ℝ × ℝ) : ℝ :=
+ p.1 ^ 3 / 3 - p.1 / 4 - 20 * p.2 ^ 2 + p.1 * p.2 ^ 2
+
+/-- **`ridge_capHyp_blocks` with a nonzero mixed block.** On `mixedToyF` the partial blocks of
+`D³f` are `2` (`c = 0`), `0` (`c = 1`), `2` (`c = 2`, the mixed block `∂_x D_y² f`) and `0`
+(`c = 3`), so `M3 = 2`; `D⁴f = 0`, so `M4 = 0`; and `λ = 41`. CAP (1) holds with `k = 1/6`, `r = 1`:
+`8 M3² = 32 < 41` and `r M4 = 0 ≤ 1/20`. Unlike `h1Toy_E` and `quarticToy_E`, the block inequality
+`hT` is not trivial here, since the mixed terms of `D³f` do not vanish. -/
+theorem mixedToy_blocks :
+ (∃ ε > 0, ∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - ε : ℝ) (2 * 1 + ε), h x ∈ Metric.ball (0 : ℝ) (2 * 1) ∧
+ HasFDerivAt (fun y => mixedToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) (h x)) ∧
+ CapHyp mixedToyF (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)) (-1 / 2, 0)
+ (2 * 1, 0) (mixedToyF (-1 / 2, 0)) (mixedToyF (1 / 2, 0)) := by
+ have hf : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.1) (ContinuousLinearMap.fst ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_fst
+ have hs : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.2) (ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_snd
+ have hDf : ∀ p : ℝ × ℝ, HasFDerivAt mixedToyF
+ ((p.1 ^ 2 - 1 / 4 + p.2 ^ 2) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * p.2 + 2 * p.1 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ intro p
+ have h1 := HasFDerivAt.add (HasFDerivAt.sub (HasFDerivAt.sub
+ (HasFDerivAt.const_mul (HasFDerivAt.pow (hf p) 3) (1 / 3))
+ (HasFDerivAt.const_mul (hf p) (1 / 4)))
+ (HasFDerivAt.const_mul (HasFDerivAt.pow (hs p) 2) 20))
+ (HasFDerivAt.mul (hf p) (HasFDerivAt.pow (hs p) 2))
+ convert h1 using 1
+ · funext q
+ simp only [mixedToyF, Pi.sub_apply, Pi.add_apply, Pi.mul_apply]
+ ring
+ · ext <;> simp
+ ring
+ have hD2 : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => (q.1 ^ 2 - 1 / 4 + q.2 ^ 2) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * q.2 + 2 * q.1 * q.2) • ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ + (2 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight
+ (ContinuousLinearMap.fst ℝ ℝ ℝ) +
+ ((2 * p.2) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 + 2 * p.1) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight
+ (ContinuousLinearMap.snd ℝ ℝ ℝ)) p := by
+ intro p
+ have h1 : HasFDerivAt (fun q : ℝ × ℝ => q.1 ^ 2 - 1 / 4 + q.2 ^ 2)
+ ((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ + (2 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ have := ((HasFDerivAt.pow (hf p) 2).sub_const (1 / 4)).add (HasFDerivAt.pow (hs p) 2)
+ convert this using 1
+ ext <;> simp
+ have h2 : HasFDerivAt (fun q : ℝ × ℝ => -40 * q.2 + 2 * q.1 * q.2)
+ ((2 * p.2) • ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 + 2 * p.1) • ContinuousLinearMap.snd ℝ ℝ ℝ)
+ p := by
+ have := (HasFDerivAt.const_mul (hs p) (-40)).add
+ ((HasFDerivAt.const_mul (hf p) 2).mul (hs p))
+ convert this using 1
+ ext <;> simp
+ ring
+ exact (h1.smul_const (ContinuousLinearMap.fst ℝ ℝ ℝ)).add
+ (h2.smul_const (ContinuousLinearMap.snd ℝ ℝ ℝ))
+ have hcd : ContDiff ℝ 4 mixedToyF := by unfold mixedToyF; fun_prop
+ have hfd : fderiv ℝ mixedToyF = fun p => (p.1 ^ 2 - 1 / 4 + p.2 ^ 2) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * p.2 + 2 * p.1 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ :=
+ funext fun p => (hDf p).fderiv
+ have h2 : ∀ (y : ℝ × ℝ) (m : Fin 2 → ℝ × ℝ), iteratedFDeriv ℝ 2 mixedToyF y m =
+ 2 * y.1 * (m 0).1 * (m 1).1 + 2 * y.2 * ((m 0).1 * (m 1).2 + (m 0).2 * (m 1).1) +
+ (-40 + 2 * y.1) * (m 0).2 * (m 1).2 := by
+ intro y m
+ rw [iteratedFDeriv_two_apply, hfd, (hD2 y).fderiv]
+ simp
+ ring
+ have h3 : ∀ (x : ℝ × ℝ) (m : Fin 3 → ℝ × ℝ), iteratedFDeriv ℝ 3 mixedToyF x m =
+ 2 * (m 0).1 * (m 1).1 * (m 2).1 + 2 * (m 0).2 * ((m 1).1 * (m 2).2 + (m 1).2 * (m 2).1) +
+ 2 * (m 0).1 * (m 1).2 * (m 2).2 := by
+ intro x m
+ rw [DifferentiableAt.iteratedFDeriv_succ_apply_left'
+ (hcd.contDiffAt.differentiableAt_iteratedFDeriv (by norm_num))]
+ have hg : HasFDerivAt (fun y => iteratedFDeriv ℝ 2 mixedToyF y (Fin.tail m))
+ ((2 * (m 1).1 * (m 2).1 + 2 * (m 1).2 * (m 2).2) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (2 * ((m 1).1 * (m 2).2 + (m 1).2 * (m 2).1)) • ContinuousLinearMap.snd ℝ ℝ ℝ) x := by
+ have := (((2 * (m 1).1 * (m 2).1 + 2 * (m 1).2 * (m 2).2) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (2 * ((m 1).1 * (m 2).2 + (m 1).2 * (m 2).1)) •
+ ContinuousLinearMap.snd ℝ ℝ ℝ).hasFDerivAt (x := x)).add_const (-40 * (m 1).2 * (m 2).2)
+ convert this using 1
+ funext y; rw [h2]; simp [Fin.tail]; ring
+ rw [hg.fderiv]
+ simp
+ ring
+ have h4 : ∀ (x : ℝ × ℝ) (m : Fin 4 → ℝ × ℝ), iteratedFDeriv ℝ 4 mixedToyF x m = 0 := by
+ intro x m
+ rw [DifferentiableAt.iteratedFDeriv_succ_apply_left'
+ (hcd.contDiffAt.differentiableAt_iteratedFDeriv (by norm_num))]
+ have hc : (fun y => iteratedFDeriv ℝ 3 mixedToyF y (Fin.tail m)) =
+ fun _ => iteratedFDeriv ℝ 3 mixedToyF x (Fin.tail m) := by
+ funext y; rw [h3, h3]
+ have hg : HasFDerivAt (fun y => iteratedFDeriv ℝ 3 mixedToyF y (Fin.tail m))
+ (0 : ℝ × ℝ →L[ℝ] ℝ) x := by
+ rw [hc]; exact hasFDerivAt_const _ _
+ rw [hg.fderiv]
+ simp
+ have hsrc := ridge_capHyp_blocks (E := ℝ) (f := mixedToyF) (U := univ) (r := 1) (k := 1 / 6)
+ (M3 := 2) (M4 := 0) (lam := 41) one_pos (by norm_num) isOpen_univ (subset_univ _)
+ hcd.contDiffOn
+ (fun x _ => by rw [h3]; simp)
+ (fun p _ y => by rw [h3]; simp)
+ (fun p _ y₁ y₂ => by
+ rw [h3]
+ simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Matrix.cons_val_two, Matrix.tail_cons,
+ Matrix.head_cons, Real.norm_eq_abs]
+ rw [show (2 * (0 : ℝ) * 0 * 1 + 2 * y₁ * (0 * 0 + y₂ * 1) + 2 * 0 * y₂ * 0) = 2 * (y₁ * y₂) by
+ ring, abs_mul, abs_mul]
+ norm_num [mul_assoc])
+ (fun p _ y₁ y₂ y₃ => by
+ rw [h3]
+ simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Matrix.cons_val_two, Matrix.tail_cons,
+ Matrix.head_cons, Real.norm_eq_abs]
+ rw [show (2 * (0 : ℝ) * 0 * 0 + 2 * y₁ * (0 * y₃ + y₂ * 0) + 2 * 0 * y₂ * y₃) = 0 by ring,
+ abs_zero]
+ positivity)
+ (fun p _ => by rw [h4]; simp)
+ (fun p _ v => by rw [h4]; simp)
+ (fun v => by
+ rw [h2]
+ simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Real.norm_eq_abs, sq_abs]
+ nlinarith [sq_nonneg v])
+ (by norm_num) (by norm_num)
+ (by rw [(hDf _).fderiv]; ext <;> norm_num)
+ (by rw [(hDf _).fderiv]; ext <;> norm_num)
+ (by simp only [mixedToyF]; norm_num)
+ obtain ⟨ε, hε, hex, hcap⟩ := hsrc
+ have hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => mixedToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by
+ intro x
+ have := slice_hasFDerivAt (hDf (x, 0))
+ convert this using 1
+ ext
+ simp
+ obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩)
+ exact ⟨⟨ε, hε, hex⟩, hC⟩
+
+/-! ### v2.6: the cap and the elder death level on the torus, under CAP (1)
+
+P §7 applies the cap theorem to the periodic lift of the field on `(ℝ/Lℤ)^d`, in a contact frame
+whose first axis joins the pins. `torus_capHyp_blocks` composes `ridge_capHyp_blocks` (v2.5) with
+`CapHyp.toTorus` and `CapHyp.map_saddle` for any frame `φ : ℝ × E ≃ₜ ℝ^d`. Then
+`torus_elder_death_level_blocks` adds `elder_death_level_peak` on the torus, which is compact
+(`L > 0`) and locally connected (`torus_locallyConnectedSpace`). `torusToy_elder` instantiates it
+on `(ℝ/16ℤ)²`. -/
+
+/-- The circle `ℝ/Lℤ` is locally connected: its topology is coinduced by the covering map from
+`ℝ`, and local connectedness passes to coinduced topologies. -/
+theorem addCircle_locallyConnectedSpace (L : ℝ) : LocallyConnectedSpace (AddCircle L) :=
+ (QuotientAddGroup.isQuotientMap_mk (AddSubgroup.zmultiples L)).isCoinducing.locallyConnectedSpace
+
+/-- The torus `(ℝ/Lℤ)^d` is locally connected: a finite product of locally connected spaces. -/
+theorem torus_locallyConnectedSpace (L : ℝ) (d : ℕ) :
+ LocallyConnectedSpace (Fin d → AddCircle L) :=
+ haveI := addCircle_locallyConnectedSpace L
+ Pi.locallyConnectedSpace_of_finite_not_preconnectedSpace (Set.toFinite _)
+
+section Torus
+
+variable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
+
+/-- **The cap on the torus under CAP (1).** Let `φ : ℝ × E ≃ₜ ℝ^d` be any frame and let
+`g = f ∘ torusCover L d ∘ φ` be the lift of a function `f` on the torus `(ℝ/Lℤ)^d`. If `g` meets
+the hypotheses of `ridge_capHyp_blocks` (CAP §1's (1) with its partial-block norms, in the frame
+`φ`), then `f` satisfies (C1)–(C3) on the image of the cap in the torus, with `M` and `S` the images
+of the pins, and (C2⁺): every other frontier point of the image is strictly below `f(S)`. -/
+theorem torus_capHyp_blocks [FiniteDimensional ℝ E] {L : ℝ} {d : ℕ}
+ (φ : ℝ × E ≃ₜ (Fin d → ℝ)) {f : (Fin d → AddCircle L) → ℝ} {g : ℝ × E → ℝ}
+ (hg : ∀ p, g p = f (torusCover L d (φ p))) {U : Set (ℝ × E)}
+ {r k M3 M4 lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)
+ (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)
+ (hf : ContDiffOn ℝ 4 g U)
+ (h30 : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 g (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ M3)
+ (h31 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y : E,
+ |iteratedFDeriv ℝ 3 g p ![(0, y), (1, 0), (1, 0)]| ≤ M3 * ‖y‖)
+ (h32 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ : E,
+ |iteratedFDeriv ℝ 3 g p ![(0, y₁), (0, y₂), (1, 0)]| ≤ M3 * ‖y₁‖ * ‖y₂‖)
+ (h33 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ y₃ : E,
+ |iteratedFDeriv ℝ 3 g p ![(0, y₁), (0, y₂), (0, y₃)]| ≤ M3 * ‖y₁‖ * ‖y₂‖ * ‖y₃‖)
+ (h40 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ |iteratedFDeriv ℝ 4 g p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ M4)
+ (h41 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,
+ |iteratedFDeriv ℝ 4 g p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ M4 * ‖v‖)
+ (hlam : ∀ v : E, iteratedFDeriv ℝ 2 g (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)
+ (hH1 : 4 / (3 * k) * r * M3 ^ 2 < lam) (hH2 : r * M4 ≤ 3 * k / 10)
+ (hM : fderiv ℝ g (-r / 2, 0) = 0) (hS : fderiv ℝ g (r / 2, 0) = 0)
+ (hnorm : g (-r / 2, 0) - g (r / 2, 0) = k * r ^ 3) :
+ ∃ z, CapHyp f ((torusCover L d ∘ φ) '' (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)))
+ (torusCover L d (φ (-r / 2, 0))) z (f (torusCover L d (φ (-r / 2, 0))))
+ (f (torusCover L d (φ (r / 2, 0)))) ∧
+ ∀ x ∈ frontier ((torusCover L d ∘ φ) ''
+ (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r))),
+ x ≠ torusCover L d (φ (r / 2, 0)) → f x < f (torusCover L d (φ (r / 2, 0))) := by
+ obtain ⟨ε, -, ⟨h0, hh0⟩, hall⟩ := ridge_capHyp_blocks hr hk hU hDU hf h30 h31 h32 h33 h40 h41
+ hlam hH1 hH2 hM hS hnorm
+ obtain ⟨-, -, hC, hSf⟩ := hall h0 fun x hx => ⟨Metric.ball_subset_closedBall (hh0 x hx).1,
+ (hh0 x hx).2⟩
+ have hgf : g = f ∘ (torusCover L d ∘ φ) := funext hg
+ subst hgf
+ have hK : IsCompact (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) :=
+ isCompact_Icc.prod (isCompact_closedBall 0 (2 * r))
+ exact ⟨_, hC.toTorus φ hK, CapHyp.map_saddle ((torusCover_continuous L d).comp φ.continuous)
+ ((torusCover_isOpenMap L d).comp φ.isOpenMap) hK hSf⟩
+
+/-- **The elder death level on the torus under CAP (1).** For `L > 0` and a continuous `f` on
+`(ℝ/Lℤ)^d` whose lift in the frame `φ` meets CAP §1's (1), the largest level at which the
+component of the image of `M` contains a strictly higher local maximum is `f` at the image of `S`.
+This is `elder_death_level_peak` on the torus, which is compact and locally connected. -/
+theorem torus_elder_death_level_blocks [FiniteDimensional ℝ E] {L : ℝ} [Fact (0 < L)] {d : ℕ}
+ (φ : ℝ × E ≃ₜ (Fin d → ℝ)) {f : (Fin d → AddCircle L) → ℝ} (hfc : Continuous f)
+ {g : ℝ × E → ℝ} (hg : ∀ p, g p = f (torusCover L d (φ p))) {U : Set (ℝ × E)}
+ {r k M3 M4 lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)
+ (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)
+ (hf : ContDiffOn ℝ 4 g U)
+ (h30 : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 g (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ M3)
+ (h31 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y : E,
+ |iteratedFDeriv ℝ 3 g p ![(0, y), (1, 0), (1, 0)]| ≤ M3 * ‖y‖)
+ (h32 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ : E,
+ |iteratedFDeriv ℝ 3 g p ![(0, y₁), (0, y₂), (1, 0)]| ≤ M3 * ‖y₁‖ * ‖y₂‖)
+ (h33 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ y₃ : E,
+ |iteratedFDeriv ℝ 3 g p ![(0, y₁), (0, y₂), (0, y₃)]| ≤ M3 * ‖y₁‖ * ‖y₂‖ * ‖y₃‖)
+ (h40 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),
+ |iteratedFDeriv ℝ 4 g p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ M4)
+ (h41 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,
+ |iteratedFDeriv ℝ 4 g p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ M4 * ‖v‖)
+ (hlam : ∀ v : E, iteratedFDeriv ℝ 2 g (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)
+ (hH1 : 4 / (3 * k) * r * M3 ^ 2 < lam) (hH2 : r * M4 ≤ 3 * k / 10)
+ (hM : fderiv ℝ g (-r / 2, 0) = 0) (hS : fderiv ℝ g (r / 2, 0) = 0)
+ (hnorm : g (-r / 2, 0) - g (r / 2, 0) = k * r ^ 3) :
+ IsGreatest (CapHyp.olderPeakLevels f (torusCover L d (φ (-r / 2, 0))))
+ (f (torusCover L d (φ (r / 2, 0)))) := by
+ obtain ⟨z, H, -⟩ := torus_capHyp_blocks φ hg hr hk hU hDU hf h30 h31 h32 h33 h40 h41 hlam hH1
+ hH2 hM hS hnorm
+ have := torus_locallyConnectedSpace L d
+ exact H.elder_death_level_peak hfc rfl
+
+end Torus
+
+/-- A continuous chart of the circle near `0`: `circleChart L θ = ‖θ + L/4‖ − L/4`, which equals
+`x` at the image of every `x` with `|x| ≤ L/4` (`circleChart_coe`). -/
+noncomputable def circleChart (L : ℝ) (θ : AddCircle L) : ℝ :=
+ ‖θ + ((L / 4 : ℝ) : AddCircle L)‖ - L / 4
+
+/-- `circleChart` is continuous. -/
+theorem circleChart_continuous (L : ℝ) : Continuous (circleChart L) :=
+ (continuous_norm.comp (continuous_id.add continuous_const)).sub continuous_const
+
+/-- `circleChart L` inverts the covering map on `[−L/4, L/4]`. -/
+theorem circleChart_coe {L : ℝ} (hL : 0 < L) {x : ℝ} (hx : |x| ≤ L / 4) :
+ circleChart L (x : AddCircle L) = x := by
+ have h1 := (abs_le.mp hx).1
+ have h2 := (abs_le.mp hx).2
+ have hn : ‖((x + L / 4 : ℝ) : AddCircle L)‖ = |x + L / 4| :=
+ (AddCircle.norm_coe_eq_abs_iff L hL.ne').mpr (by
+ rw [abs_of_nonneg (by linarith), abs_of_pos hL]; linarith)
+ unfold circleChart
+ rw [← AddCircle.coe_add, hn, abs_of_nonneg (by linarith)]
+ ring
+
+/-- The derivative of `mixedToyF` (v2.5's toy), stated as a lemma for reuse. -/
+theorem mixedToy_hasFDerivAt (p : ℝ × ℝ) : HasFDerivAt mixedToyF
+ ((p.1 ^ 2 - 1 / 4 + p.2 ^ 2) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 * p.2 + 2 * p.1 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ) p := by
+ have hf : HasFDerivAt (fun q : ℝ × ℝ => q.1) (ContinuousLinearMap.fst ℝ ℝ ℝ) p := hasFDerivAt_fst
+ have hs : HasFDerivAt (fun q : ℝ × ℝ => q.2) (ContinuousLinearMap.snd ℝ ℝ ℝ) p := hasFDerivAt_snd
+ have h1 := HasFDerivAt.add (HasFDerivAt.sub (HasFDerivAt.sub
+ (HasFDerivAt.const_mul (HasFDerivAt.pow hf 3) (1 / 3))
+ (HasFDerivAt.const_mul hf (1 / 4)))
+ (HasFDerivAt.const_mul (HasFDerivAt.pow hs 2) 20))
+ (HasFDerivAt.mul hf (HasFDerivAt.pow hs 2))
+ convert h1 using 1
+ · funext q
+ simp only [mixedToyF, Pi.sub_apply, Pi.add_apply, Pi.mul_apply]
+ ring
+ · ext <;> simp
+ ring
+
+/-- `mixedToyF` is `C⁴`. -/
+theorem mixedToy_contDiff : ContDiff ℝ 4 mixedToyF := by unfold mixedToyF; fun_prop
+
+/-- The second derivative of `mixedToyF`. -/
+theorem mixedToy_iteratedFDeriv_two (y : ℝ × ℝ) (m : Fin 2 → ℝ × ℝ) :
+ iteratedFDeriv ℝ 2 mixedToyF y m =
+ 2 * y.1 * (m 0).1 * (m 1).1 + 2 * y.2 * ((m 0).1 * (m 1).2 + (m 0).2 * (m 1).1) +
+ (-40 + 2 * y.1) * (m 0).2 * (m 1).2 := by
+ have hf : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.1) (ContinuousLinearMap.fst ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_fst
+ have hs : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.2) (ContinuousLinearMap.snd ℝ ℝ ℝ) p :=
+ fun p => hasFDerivAt_snd
+ have hD2 : HasFDerivAt (fun q : ℝ × ℝ => (q.1 ^ 2 - 1 / 4 + q.2 ^ 2) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * q.2 + 2 * q.1 * q.2) • ContinuousLinearMap.snd ℝ ℝ ℝ)
+ (((2 * y.1) • ContinuousLinearMap.fst ℝ ℝ ℝ + (2 * y.2) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight
+ (ContinuousLinearMap.fst ℝ ℝ ℝ) +
+ ((2 * y.2) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (-40 + 2 * y.1) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight
+ (ContinuousLinearMap.snd ℝ ℝ ℝ)) y := by
+ have h1 : HasFDerivAt (fun q : ℝ × ℝ => q.1 ^ 2 - 1 / 4 + q.2 ^ 2)
+ ((2 * y.1) • ContinuousLinearMap.fst ℝ ℝ ℝ + (2 * y.2) • ContinuousLinearMap.snd ℝ ℝ ℝ) y := by
+ have := ((HasFDerivAt.pow (hf y) 2).sub_const (1 / 4)).add (HasFDerivAt.pow (hs y) 2)
+ convert this using 1
+ ext <;> simp
+ have h2 : HasFDerivAt (fun q : ℝ × ℝ => -40 * q.2 + 2 * q.1 * q.2)
+ ((2 * y.2) • ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 + 2 * y.1) • ContinuousLinearMap.snd ℝ ℝ ℝ)
+ y := by
+ have := (HasFDerivAt.const_mul (hs y) (-40)).add
+ ((HasFDerivAt.const_mul (hf y) 2).mul (hs y))
+ convert this using 1
+ ext <;> simp
+ ring
+ exact (h1.smul_const (ContinuousLinearMap.fst ℝ ℝ ℝ)).add
+ (h2.smul_const (ContinuousLinearMap.snd ℝ ℝ ℝ))
+ have hfd : fderiv ℝ mixedToyF = fun p => (p.1 ^ 2 - 1 / 4 + p.2 ^ 2) •
+ ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * p.2 + 2 * p.1 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ :=
+ funext fun p => (mixedToy_hasFDerivAt p).fderiv
+ rw [iteratedFDeriv_two_apply, hfd, hD2.fderiv]
+ simp
+ ring
+
+/-- The third derivative of `mixedToyF`: `2a₁b₁c₁ + 2a₂(b₁c₂ + b₂c₁) + 2a₁b₂c₂`. -/
+theorem mixedToy_iteratedFDeriv_three (x : ℝ × ℝ) (m : Fin 3 → ℝ × ℝ) :
+ iteratedFDeriv ℝ 3 mixedToyF x m =
+ 2 * (m 0).1 * (m 1).1 * (m 2).1 + 2 * (m 0).2 * ((m 1).1 * (m 2).2 + (m 1).2 * (m 2).1) +
+ 2 * (m 0).1 * (m 1).2 * (m 2).2 := by
+ rw [DifferentiableAt.iteratedFDeriv_succ_apply_left'
+ (mixedToy_contDiff.contDiffAt.differentiableAt_iteratedFDeriv (by norm_num))]
+ have hg : HasFDerivAt (fun y => iteratedFDeriv ℝ 2 mixedToyF y (Fin.tail m))
+ ((2 * (m 1).1 * (m 2).1 + 2 * (m 1).2 * (m 2).2) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (2 * ((m 1).1 * (m 2).2 + (m 1).2 * (m 2).1)) • ContinuousLinearMap.snd ℝ ℝ ℝ) x := by
+ have := (((2 * (m 1).1 * (m 2).1 + 2 * (m 1).2 * (m 2).2) • ContinuousLinearMap.fst ℝ ℝ ℝ +
+ (2 * ((m 1).1 * (m 2).2 + (m 1).2 * (m 2).1)) •
+ ContinuousLinearMap.snd ℝ ℝ ℝ).hasFDerivAt (x := x)).add_const (-40 * (m 1).2 * (m 2).2)
+ convert this using 1
+ funext y; rw [mixedToy_iteratedFDeriv_two]; simp [Fin.tail]; ring
+ rw [hg.fderiv]
+ simp
+ ring
+
+/-- The fourth derivative of `mixedToyF` vanishes. -/
+theorem mixedToy_iteratedFDeriv_four (x : ℝ × ℝ) (m : Fin 4 → ℝ × ℝ) :
+ iteratedFDeriv ℝ 4 mixedToyF x m = 0 := by
+ rw [DifferentiableAt.iteratedFDeriv_succ_apply_left'
+ (mixedToy_contDiff.contDiffAt.differentiableAt_iteratedFDeriv (by norm_num))]
+ have hc : (fun y => iteratedFDeriv ℝ 3 mixedToyF y (Fin.tail m)) =
+ fun _ => iteratedFDeriv ℝ 3 mixedToyF x (Fin.tail m) := by
+ funext y; rw [mixedToy_iteratedFDeriv_three, mixedToy_iteratedFDeriv_three]
+ have hg : HasFDerivAt (fun y => iteratedFDeriv ℝ 3 mixedToyF y (Fin.tail m))
+ (0 : ℝ × ℝ →L[ℝ] ℝ) x := by
+ rw [hc]; exact hasFDerivAt_const _ _
+ rw [hg.fderiv]
+ simp
+
+/-- A function on the torus `(ℝ/16ℤ)²` whose lift equals `mixedToyF` on `(−4, 4)²`:
+`mixedToyF` read through `circleChart` in each coordinate. It is continuous. -/
+noncomputable def torusToyF (θ : Fin 2 → AddCircle (16 : ℝ)) : ℝ :=
+ mixedToyF (circleChart 16 (θ 0), circleChart 16 (θ 1))
+
+/-- **A concrete instance of the elder death level on the torus.** On `(ℝ/16ℤ)²`, with the standard
+frame `ℝ × ℝ ≃ₜ ℝ²`, the lift of `torusToyF` agrees with `mixedToyF` near the cap, so it meets
+CAP (1) with `r = 1`, `k = 1/6`, `M3 = 2`, `M4 = 0` and `λ = 41`. `torus_elder_death_level_blocks`
+then gives the death level of the class born at the image of `M = (−1/2, 0)`: it is the value at
+the image of `S = (1/2, 0)`. This is the first concrete instance of the older-peak theorems
+(`older_peak`, `elder_death_level_peak`), whose compactness hypothesis fails on the earlier toys'
+domain `ℝ`. -/
+theorem torusToy_elder :
+ IsGreatest (CapHyp.olderPeakLevels torusToyF
+ (torusCover 16 2 ((Homeomorph.finTwoArrow (X := ℝ)).symm (-1 / 2, 0))))
+ (torusToyF (torusCover 16 2 ((Homeomorph.finTwoArrow (X := ℝ)).symm (1 / 2, 0)))) := by
+ have : Fact ((0 : ℝ) < 16) := ⟨by norm_num⟩
+ set φ : ℝ × ℝ ≃ₜ (Fin 2 → ℝ) := (Homeomorph.finTwoArrow (X := ℝ)).symm with hφ
+ set U : Set (ℝ × ℝ) := Ioo (-4) 4 ×ˢ Ioo (-4) 4 with hU_def
+ have hU : IsOpen U := isOpen_Ioo.prod isOpen_Ioo
+ have hGU : ∀ p ∈ U, torusToyF (torusCover 16 2 (φ p)) = mixedToyF p := by
+ rintro ⟨a, b⟩ ⟨ha, hb⟩
+ have ha' : |a| ≤ 16 / 4 := by rw [abs_le]; constructor <;> linarith [ha.1, ha.2]
+ have hb' : |b| ≤ 16 / 4 := by rw [abs_le]; constructor <;> linarith [hb.1, hb.2]
+ simp only [torusToyF, torusCover, hφ, Homeomorph.finTwoArrow_symm_apply, Pi.map_apply]
+ simp [circleChart_coe (by norm_num : (0 : ℝ) < 16) ha',
+ circleChart_coe (by norm_num : (0 : ℝ) < 16) hb']
+ have hev : ∀ p ∈ U, (fun q => torusToyF (torusCover 16 2 (φ q))) =ᶠ[nhds p] mixedToyF :=
+ fun p hp => Filter.eventuallyEq_of_mem (hU.mem_nhds hp) hGU
+ have hD : ∀ n p, p ∈ U → iteratedFDeriv ℝ n (fun q => torusToyF (torusCover 16 2 (φ q))) p =
+ iteratedFDeriv ℝ n mixedToyF p :=
+ fun n p hp => ((hev p hp).iteratedFDeriv ℝ n).eq_of_nhds
+ have hDU : Icc (-2 * 1) (2 * 1) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1) ⊆ U := by
+ rintro ⟨a, b⟩ ⟨ha, hb⟩
+ rw [Metric.mem_closedBall, Real.dist_eq, sub_zero, abs_le] at hb
+ exact ⟨⟨by linarith [ha.1], by linarith [ha.2]⟩, ⟨by linarith [hb.1], by linarith [hb.2]⟩⟩
+ have hseg : ∀ x ∈ Icc (-1 / 2 : ℝ) (1 / 2), ((x, 0) : ℝ × ℝ) ∈ U := fun x hx =>
+ ⟨⟨by linarith [hx.1], by linarith [hx.2]⟩, ⟨by norm_num, by norm_num⟩⟩
+ have hM : ((-1 / 2, 0) : ℝ × ℝ) ∈ U := hseg _ ⟨by norm_num, by norm_num⟩
+ have hS : ((1 / 2, 0) : ℝ × ℝ) ∈ U := hseg _ ⟨by norm_num, by norm_num⟩
+ refine torus_elder_death_level_blocks (E := ℝ) (L := 16) (d := 2) φ
+ (mixedToy_contDiff.continuous.comp ((circleChart_continuous 16).comp (continuous_apply 0) |>.prodMk
+ ((circleChart_continuous 16).comp (continuous_apply 1))))
+ (g := fun q => torusToyF (torusCover 16 2 (φ q))) (fun p => rfl) (U := U)
+ (r := 1) (k := 1 / 6) (M3 := 2) (M4 := 0) (lam := 41) one_pos (by norm_num) hU hDU
+ (mixedToy_contDiff.contDiffOn.congr fun p hp => hGU p hp)
+ (fun x hx => ?_) (fun p hp y => ?_) (fun p hp y₁ y₂ => ?_) (fun p hp y₁ y₂ y₃ => ?_)
+ (fun p hp => ?_) (fun p hp v => ?_) (fun v => ?_) (by norm_num) (by norm_num) ?_ ?_ ?_
+ · rw [hD 3 _ (hseg _ (by simpa using hx)), mixedToy_iteratedFDeriv_three]; simp
+ · rw [hD 3 _ (hDU hp), mixedToy_iteratedFDeriv_three]; simp
+ · rw [hD 3 _ (hDU hp), mixedToy_iteratedFDeriv_three]
+ simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Matrix.cons_val_two, Matrix.tail_cons,
+ Matrix.head_cons, Real.norm_eq_abs]
+ rw [show (2 * (0 : ℝ) * 0 * 1 + 2 * y₁ * (0 * 0 + y₂ * 1) + 2 * 0 * y₂ * 0) = 2 * (y₁ * y₂) by
+ ring, abs_mul, abs_mul]
+ norm_num [mul_assoc]
+ · rw [hD 3 _ (hDU hp), mixedToy_iteratedFDeriv_three]
+ simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Matrix.cons_val_two, Matrix.tail_cons,
+ Matrix.head_cons, Real.norm_eq_abs]
+ rw [show (2 * (0 : ℝ) * 0 * 0 + 2 * y₁ * (0 * y₃ + y₂ * 0) + 2 * 0 * y₂ * y₃) = 0 by ring,
+ abs_zero]
+ positivity
+ · rw [hD 4 _ (hDU hp), mixedToy_iteratedFDeriv_four]; simp
+ · rw [hD 4 _ (hDU hp), mixedToy_iteratedFDeriv_four]; simp
+ · rw [hD 2 _ (by simpa using hM), mixedToy_iteratedFDeriv_two]
+ simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Real.norm_eq_abs, sq_abs]
+ nlinarith [sq_nonneg v]
+ · rw [(hev _ (by simpa using hM)).fderiv_eq, (mixedToy_hasFDerivAt _).fderiv]
+ ext <;> norm_num
+ · rw [(hev _ (by simpa using hS)).fderiv_eq, (mixedToy_hasFDerivAt _).fderiv]
+ ext <;> norm_num
+ · rw [hGU _ (by simpa using hM), hGU _ (by simpa using hS)]
+ simp only [mixedToyF]; norm_num
+
+end CapFirstExit
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeField.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeField.lean
new file mode 100644
index 000000000..a07036a15
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeField.lean
@@ -0,0 +1,92 @@
+import SourceLifetimeGeometry
+import SourceThetaBridge
+
+/-! The actual smooth source fills the unchanged Lifetime Gaussian field interface.
+The only final parameter hypothesis is `0 < L`; theta, Gaussian, covariance and
+smoothness properties are proved from the frozen literal source.
+-/
+
+noncomputable section
+open MeasureTheory ProbabilityTheory
+open UniversalLaw.Spec.Lifetime I4SmoothCarrier I4ThetaBridge
+open scoped BigOperators ENNReal NNReal
+
+namespace I4LifetimeField
+
+theorem actualField_covariance (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (x y : E d) :
+ cov[fun ω => actualField d L ω x, fun ω => actualField d L ω y; smoothLaw d L] =
+ periodicCovariance d L (x - y) := by
+ rw [actualField_covariance_spectral d hL]
+ exact sourceSpectralKernel_eq_periodicCovariance d hL (x - y)
+
+theorem actualField_raw_second_moment (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (x y : E d) :
+ ∫ ω, actualField d L ω x * actualField d L ω y ∂smoothLaw d L =
+ periodicCovariance d L (x - y) := by
+ simpa only [ProbabilityTheory.covariance, actualField_integral_zero d hL, sub_zero]
+ using actualField_covariance d hL x y
+
+theorem actualField_linearCombination_variance (d : ℕ) {L : ℝ} (hL : 0 < L)
+ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :
+ Var[fun ω => ∑ i, a i * actualField d L ω (x i); smoothLaw d L] =
+ covQuadForm d L x a := by
+ let : IsProbabilityMeasure (smoothLaw d L) := smoothLaw_isProbabilityMeasure d hL.ne'
+ rw [variance_fun_sum (fun i =>
+ (actualField_eval_hasGaussianLaw d hL (x i)).memLp_two.const_mul (a i))]
+ simp only [covariance_const_mul_left, covariance_const_mul_right,
+ actualField_covariance d hL, covQuadForm]
+ apply Finset.sum_congr rfl
+ intro i _
+ apply Finset.sum_congr rfl
+ intro j _
+ ring
+
+theorem covQuadForm_nonneg (d : ℕ) {L : ℝ} (hL : 0 < L)
+ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :
+ 0 ≤ covQuadForm d L x a := by
+ rw [← actualField_linearCombination_variance d hL x a]
+ exact variance_nonneg _ _
+
+theorem actualField_linearCombination_map (d : ℕ) {L : ℝ} (hL : 0 < L)
+ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :
+ (smoothLaw d L).map (fun ω => ∑ i, a i * actualField d L ω (x i)) =
+ gaussianReal 0 ⟨covQuadForm d L x a, covQuadForm_nonneg d hL x a⟩ := by
+ rw [(actualField_linearCombination_hasGaussianLaw d hL x a).map_eq_gaussianReal,
+ actualField_linearCombination_integral_zero d hL,
+ actualField_linearCombination_variance d hL]
+ congr 1
+ apply Subtype.ext
+ exact Real.coe_toNNReal _ (covQuadForm_nonneg d hL x a)
+
+/-- The original target on the unchanged coefficient carrier and preserved source law. -/
+def actualGaussianFieldInterface (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ GaussianFieldInterface d L where
+ Ω := SmoothSample d L
+ mΩ := inferInstance
+ P := smoothLaw d L
+ isProb := smoothLaw_isProbabilityMeasure d hL.ne'
+ F := actualField d L
+ smooth := actualField_smooth d hL
+ periodic := actualField_periodic d hL
+ summable := theta_summable d hL
+ quad_nonneg := covQuadForm_nonneg d hL
+ gaussian := actualField_linearCombination_map d hL
+ covariance := actualField_raw_second_moment d hL
+
+theorem actualGaussianFieldInterface_exists (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ Nonempty (GaussianFieldInterface d L) :=
+ ⟨actualGaussianFieldInterface d L hL⟩
+
+@[simp] theorem actualGaussianFieldInterface_carrier (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ (actualGaussianFieldInterface d L hL).Ω = SmoothSample d L := rfl
+
+@[simp] theorem actualGaussianFieldInterface_law (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ (actualGaussianFieldInterface d L hL).P = smoothLaw d L := rfl
+
+@[simp] theorem actualGaussianFieldInterface_field (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (ω : SmoothSample d L) (x : E d) :
+ (actualGaussianFieldInterface d L hL).F ω x =
+ smoothSourceField d L ω (coordinates d x) := rfl
+
+end I4LifetimeField
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeGeometry.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeGeometry.lean
new file mode 100644
index 000000000..e83eb8e13
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeGeometry.lean
@@ -0,0 +1,98 @@
+import Lifetime
+import SourceSmoothCarrier
+
+/-! Coordinate and probability transport for the literal smooth Fourier source.
+No theta identity or target field-law premise is introduced in this module.
+-/
+
+noncomputable section
+open MeasureTheory ProbabilityTheory
+open UniversalLaw.Spec.Lifetime I4SmoothCarrier
+open scoped BigOperators ENNReal NNReal
+
+namespace I4LifetimeField
+
+def coordinates (d : ℕ) : E d ≃L[ℝ] (Fin d → ℝ) :=
+ EuclideanSpace.equiv (Fin d) ℝ
+
+@[simp] theorem coordinates_apply (d : ℕ) (x : E d) (i : Fin d) :
+ coordinates d x i = x i := rfl
+
+theorem coordinates_latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) :
+ coordinates d (latticeVec d L n) = fun i => L * (n i : ℝ) := by
+ ext i
+ simp [coordinates, latticeVec]
+
+/-- The same carrier, same law, and same literal source; only spatial coordinates change. -/
+def actualField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : E d) : ℝ :=
+ smoothSourceField d L ω (coordinates d x)
+
+theorem actualField_smooth (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (ω : SmoothSample d L) : IsSmooth d (actualField d L ω) := by
+ intro n
+ exact (smoothSourceField_contDiff d hL.ne' ω n).comp
+ (coordinates d).contDiff
+
+theorem actualField_periodic (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (ω : SmoothSample d L) : IsLPeriodic d L (actualField d L ω) := by
+ intro x n
+ unfold actualField smoothSourceField
+ rw [map_add, coordinates_latticeVec]
+ exact I4Lattice.sourceField_lattice_shift d hL.ne' (sampleInclusion d L ω) n
+ (coordinates d x)
+
+theorem actualField_eval_measurable (d : ℕ) (L : ℝ) (x : E d) :
+ Measurable (fun ω => actualField d L ω x) :=
+ (I4Source.sourceField_eval_measurable d L (coordinates d x)).comp
+ (sampleInclusion_measurable d L)
+
+theorem actualField_eval_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (x : E d) : HasGaussianLaw (fun ω => actualField d L ω x) (smoothLaw d L) := by
+ exact (smoothSourceField_finiteVector_hasGaussianLaw d hL.ne' 1
+ (fun _ => coordinates d x)).eval 0
+
+theorem actualField_linearCombination_measurable (d : ℕ) (L : ℝ) {m : ℕ}
+ (x : Fin m → E d) (a : Fin m → ℝ) :
+ Measurable (fun ω => ∑ i, a i * actualField d L ω (x i)) := by
+ exact Finset.measurable_sum _ (fun i _ =>
+ measurable_const.mul (actualField_eval_measurable d L (x i)))
+
+theorem actualField_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ}
+ (hL : 0 < L) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :
+ HasGaussianLaw (fun ω => ∑ i, a i * actualField d L ω (x i)) (smoothLaw d L) := by
+ have hX : Measurable (fun η : I4Source.SourceMode d → ℝ =>
+ ∑ i, a i * I4Source.sourceField d L η (coordinates d (x i))) :=
+ Finset.measurable_sum _ (fun i _ => measurable_const.mul
+ (I4Source.sourceField_eval_measurable d L (coordinates d (x i))))
+ refine ⟨(actualField_linearCombination_measurable d L x a).aemeasurable, ?_⟩
+ change IsGaussian ((smoothLaw d L).map (fun ω =>
+ ∑ i, a i * I4Source.sourceField d L (sampleInclusion d L ω) (coordinates d (x i))))
+ rw [observation_map_eq d hL.ne' _ hX]
+ exact (I4SourceGaussian.source_linearCombination_hasGaussianLaw d hL.ne' m
+ (fun i => coordinates d (x i)) a).isGaussian_map
+
+theorem actualField_integral_zero (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :
+ ∫ ω, actualField d L ω x ∂smoothLaw d L = 0 := by
+ change (∫ ω, I4Source.sourceField d L (sampleInclusion d L ω) (coordinates d x)
+ ∂smoothLaw d L) = 0
+ rw [(sampleInclusion_measurePreserving d hL.ne').integral_comp
+ (MeasurableEmbedding.subtype_coe (goodSet_measurable d L))
+ (fun η => I4Source.sourceField d L η (coordinates d x))]
+ exact I4SourceCovariance.sourceField_integral_zero d hL.ne' (coordinates d x)
+
+theorem actualField_linearCombination_integral_zero (d : ℕ) {L : ℝ}
+ (hL : 0 < L) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :
+ ∫ ω, (∑ i, a i * actualField d L ω (x i)) ∂smoothLaw d L = 0 := by
+ rw [integral_finsetSum _ (fun i _ =>
+ (actualField_eval_hasGaussianLaw d hL (x i)).integrable.const_mul (a i))]
+ simp only [integral_const_mul, actualField_integral_zero d hL, mul_zero,
+ Finset.sum_const_zero]
+
+theorem actualField_covariance_spectral (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (x y : E d) :
+ cov[fun ω => actualField d L ω x, fun ω => actualField d L ω y; smoothLaw d L] =
+ I4Kernel.sourceSpectralKernel d L (coordinates d (x - y)) := by
+ simpa only [actualField, map_sub] using
+ smoothSourceField_covariance d hL.ne' (coordinates d x) (coordinates d y)
+
+end I4LifetimeField
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/inputs/Lifetime.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/inputs/Lifetime.lean
new file mode 100644
index 000000000..f2508f7f2
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/inputs/Lifetime.lean
@@ -0,0 +1,634 @@
+import Mathlib
+
+/-!
+# Lifetime-track statements: parent Theorems A, B, C, the bounded remainder R and the
+# planar elder lower bound / density gap (statements only)
+
+Scientific effect: NONE. Formal progress of every declaration here: `specified`.
+Organizational-independence credit of this transcription: 0 (Anthropic / Claude).
+
+This module states, as `Prop`-valued definitions, the shapes of the parent lifetime
+results (1.1), (1.2), (1.3) of UNIFORM_MATRIX_CAP_AND_LIFETIME.md, of the bounded
+remainder (R1) of LIFETIME_REMAINDER.md, and of the planar lower bound (E2), the
+two-sided rate (E4) and the compact-window density gap (E11) of
+ELDER_LOWER_AND_DENSITY_GAP.md. Every statement is parametrised by interface objects
+(the Gaussian field, the superlevel-bar / elder-partner relation, and the typed pair law
+probability `p_r(b,k,R)`); it is a statement about whatever objects satisfy those
+interfaces, and the identification of those objects with the objects of the source texts
+is not part of the statement.
+
+This module is self-contained: it imports only Mathlib and re-declares, verbatim up to
+the namespace, the shared objects of `Specifications/Field.lean` (covariance, field
+interface, critical points, Hessian inertia, pairs, superlevel bars, density versions).
+The duplication is deliberate at this layer and is recorded as such.
+
+What this module does not establish. It consists only of definitions and structures;
+it states nothing as a result and proves nothing: none of the parent results, the
+remainder bound or the planar bounds is shown here, and no kernel receipt about them
+exists. It does not transcribe the explicit Gaussian/angular integral (15.2) for the
+leading coefficient `c_{d,L}` (the coefficient is characterised only through the
+leading-term asymptotics of (1.3)); it does not transcribe the regression law
+`Q_{r,b,k,R}`, the typed weight `W_r`, the full normalizer `Z_r` or the marked Kac-Rice
+representation (all informal in the source and taken as the interface field `p`); it
+does not transcribe the reading-rule amendments bound to the parent (congruence erratum,
+Section 9 replacement v1.1, wording W1, embedding radius `r < L/(4 sqrt 2)`), nor the
+marked-cylinder cap support; it asserts no numerical `C`, `r_*`, `z_*`, `ell_*` or
+coefficient value; it does not state Theorem A as consumed by Theorem R; and it does
+not state the compact-window `O(ell^(2/3))` difference for the unrestricted densities.
+The planar statements (E4) and (E11) carry the parent upper bound (1.1), for the same
+typed pair law at `d = 2`, as an explicit hypothesis, as the source does ("If the precise
+Theorem A upper bound in [LP] is consumed"; its Section 4 says the upper half of (E11)
+consumes the parent upper bound already identified there); the direct lower bound (E2) is
+unconditional, as in the source.
+Nothing here promotes, reclassifies or discharges any claim, premise or obligation of
+the registers; the landing disposition `REVIEWED_SCOPED` (lifetime-remainder) and the
+graph classification and review disposition recorded for
+`math.uniform-matrix-cap-lifetime` are transcribed from the registers by the statement
+register, never re-derived here; alignment of these statements with the sources is
+PENDING_INDEPENDENT_REVIEW.
+
+Sources (Layer 0, byte-pinned, `d6g8k5htny-coder/Math-`):
+* `lifetime-parent`: commit `c39164254ad1529ed49543743598d5dcb24bab98`, path
+ `imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md`,
+ sha256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`.
+* `lifetime-remainder`: commit `760340e921ac4ceda296b8118da936f1133e956e`, path
+ `frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md`,
+ sha256 `380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a`.
+* `elder-lower-density-gap`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md`,
+ sha256 `8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c`.
+-/
+
+namespace UniversalLaw.Spec.Lifetime
+
+open MeasureTheory
+
+/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same text, this
+namespace). The duplication is deliberate: modules of this packet import only Mathlib. -/
+
+/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised
+by `L`-periodic functions.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.
+Does not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/
+abbrev E (d : ℕ) : Type := EuclideanSpace ℝ (Fin d)
+
+/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: none.
+Does not claim: anything beyond the definition of the vector `L n`. -/
+noncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : E d :=
+ ∑ i, EuclideanSpace.single i (L * (n i : ℝ))
+
+/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,
+written as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;
+summability is a hypothesis field of `GaussianFieldInterface`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.
+Does not claim: convergence of the sum. -/
+noncomputable def thetaSum (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ ∑' n : Fin d → ℤ, Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2)
+
+/-- The periodized Gaussian covariance
+`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta
+sum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the
+summability field is meant to provide this; not shown here).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of both theta sums is the field `GaussianFieldInterface.summable`.
+Does not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/
+noncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ thetaSum d L z / thetaSum d L 0
+
+/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear
+combination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred
+stationary field with covariance `K_L`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.
+Does not claim: positive definiteness (Section 2 of the source). -/
+noncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) : ℝ :=
+ ∑ i, ∑ j, a i * a j * periodicCovariance d L (x i - x j)
+
+/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the defining predicate of a function on the torus.
+Does not claim: anything about the field. -/
+def IsLPeriodic (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ ∀ (x : E d) (n : Fin d → ℤ), g (x + latticeVec d L n) = g x
+
+/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "In particular the field has a smooth version and all finite moments of its global derivative suprema exist."
+Interface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.
+Does not claim: existence of a smooth version, or moment bounds on derivative suprema. -/
+def IsSmooth (d : ℕ) (g : E d → ℝ) : Prop :=
+ ∀ n : ℕ, ContDiff ℝ n g
+
+/-- Interface for the centred stationary Gaussian field of variance one on the torus
+`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample
+paths, their smoothness and periodicity, the Gaussian law of every finite real linear
+combination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic
+form) and the covariance identity are hypothesis fields, as is summability of the theta
+sums. Existence of such an object is not asserted.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: every field of this structure is a given property of the field, never derived.
+Does 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. -/
+structure GaussianFieldInterface (d : ℕ) (L : ℝ) where
+ /-- The underlying probability space (sample space). -/
+ Ω : Type
+ -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not
+ -- registered for typeclass resolution after this declaration; consumers bring it into
+ -- scope with `haveI := G.mΩ`.
+ [mΩ : MeasurableSpace Ω]
+ /-- The probability measure `P`. -/
+ P : Measure Ω
+ -- `P` is a probability measure (square-bracket field).
+ [isProb : IsProbabilityMeasure P]
+ /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/
+ F : Ω → E d → ℝ
+ /-- Section 2 clause: "the field has a smooth version"; every sample path is smooth. -/
+ smooth : ∀ ω, IsSmooth d (F ω)
+ /-- Section 1 clause: the field lives "On the flat torus X = R^d/(L Z^d)"; every sample path
+ is `L`-periodic. -/
+ periodic : ∀ ω, IsLPeriodic d L (F ω)
+ /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/
+ summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))
+ /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/
+ quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a
+ /-- Section 1 clause: "the centered stationary Gaussian field of variance one with covariance"
+ `K_L`; every finite real linear combination of point evaluations has the centred Gaussian
+ law whose variance is the `K_L`-quadratic form. -/
+ gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),
+ Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =
+ ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩
+ /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/
+ covariance : ∀ x y : E d, ∫ ω, F ω x * F ω y ∂P = periodicCovariance d L (x - y)
+
+/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet
+derivative: `hessian d g x v w = D^2 g(x)[v, w]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: symmetry of the form (true for `C^2` functions, not stated here). -/
+noncomputable def hessian (d : ℕ) (g : E d → ℝ) (x v w : E d) : ℝ :=
+ iteratedFDeriv ℝ 2 g x ![v, w]
+
+/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "grad f(M)=grad f(S)=0."
+Interface: none.
+Does not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/
+def IsCriticalPoint (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ fderiv ℝ g x = 0
+
+/-- Sylvester-inertia encoding of "the Hessian at `x` is nondegenerate with exactly `j`
+negative and `d - j` positive eigenvalues": there are complementary subspaces `V`, `W` of
+dimensions `j` and `d - j` on which the Hessian form is negative definite, respectively
+positive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)
+Hessians; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "The index counts negative eigenvalues."
+Interface: none.
+Does not claim: equivalence with an eigenvalue count for a non-symmetric form. -/
+def HessianHasInertia (d : ℕ) (g : E d → ℝ) (x : E d) (j : ℕ) : Prop :=
+ ∃ V W : Submodule ℝ (E d), IsCompl V W ∧
+ Module.finrank ℝ V = j ∧ Module.finrank ℝ W = d - j ∧
+ (∀ v ∈ V, v ≠ 0 → hessian d g x v v < 0) ∧
+ (∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)
+
+/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative
+eigenvalues (negative definite).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/
+def IsNondegMax (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x d
+
+/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one
+positive eigenvalue.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that such a saddle is a merging saddle of any superlevel bar. -/
+def IsIndexSaddle (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x (d - 1)
+
+/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinM (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ -((r / 2) • u)
+
+/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinS (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ (r / 2) • u
+
+/-- Torus distance between two points of `R^d`: the infimum over the lattice of
+`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the
+same torus point; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: that the height gap of an elder pair is the persistence of a bar in any persistence module. -/
+def heightGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=
+ g M - g S
+
+/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: positivity of the height gap (added separately where the source requires it). -/
+def IsCandidatePair (d : ℕ) (L : ℝ) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S
+
+/-- Morse genericity with distinct critical values on the torus: every critical point is
+nondegenerate (has some inertia) and critical points at distinct torus positions have
+distinct critical values.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Countable exhaustion now proves that Q is almost surely Morse with distinct critical values."
+Interface: none; used only as a hypothesis of the elder-partner interface clause.
+Does not claim: that sample paths are almost surely Morse (Section 8 of the source). -/
+def IsMorseDistinct (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ (∀ x : E d, IsCriticalPoint d g x → ∃ j : ℕ, HessianHasInertia d g x j) ∧
+ (∀ x y : E d, IsCriticalPoint d g x → IsCriticalPoint d g y →
+ 0 < torusDist d L x y → g x ≠ g y)
+
+/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:
+the maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary
+elder death partner relation. These are GIVEN relations; the fields transcribe the source
+clauses that characterise them on smooth periodic functions, and the elder relation is
+pinned only on the Morse distinct-value locus, exactly as the source does.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint."
+Interface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.
+Does 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. -/
+structure SuperlevelBarInterface (d : ℕ) (L : ℝ) where
+ /-- Section 8 clause: the maximin connection level
+ `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/
+ deathHeight : (E d → ℝ) → E d → ℝ
+ /-- The essential class: the global maximum, which "has no older endpoint" and whose
+ superlevel H0 bar is not finite. -/
+ IsEssential : (E d → ℝ) → E d → Prop
+ /-- Section 1 clause: "the global ordinary superlevel elder death partner of M is S". -/
+ ElderPartner : (E d → ℝ) → E d → E d → Prop
+ /-- `M` is essential exactly when no point is strictly higher (so the supremum in the
+ maximin is over an empty set, "equal to -infinity"). -/
+ essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M
+ /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly
+ higher point stays strictly above `h`. -/
+ deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,
+ h < deathHeight g M ↔
+ ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)
+ /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, "equality
+ d_f(M)=f(S)" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle "expresses
+ ordinary elder death at S". -/
+ elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →
+ ∀ M S : E d, ElderPartner g M S ↔
+ (IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)
+
+/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`
+(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus
+distance. The essential global-maximum class is excluded because `ElderPartner` requires
+`¬ IsEssential` on the Morse locus.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death."
+Interface: `I : SuperlevelBarInterface d L` is given.
+Does 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. -/
+def IsFiniteBar (d : ℕ) (L : ℝ) (I : SuperlevelBarInterface d L) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S
+
+/-- The set of pairs of a population `Pair` with both points in the fundamental domain and
+lifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of this set (a field of the density-version predicate). -/
+def pairSet (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop) (g : E d → ℝ) (A : Set ℝ) :
+ Set (E d × E d) :=
+ {p | p.1 ∈ FundDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}
+
+/-- Number of pairs of the population with lifetime in `A` and base points in the
+fundamental domain (`Set.ncard`, which is `0` for an infinite set).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of the counted set. -/
+noncomputable def pairCount (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop)
+ (g : E d → ℝ) (A : Set ℝ) : ℕ :=
+ Set.ncard (pairSet d L Pair g A)
+
+/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population
+`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost
+surely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and
+`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.
+The source's densities are only defined up to such versions. The sigma-algebra of the sample
+space is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket
+field of a bundled record is not registered for typeclass resolution after the declaration).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "These densities admit versions with"
+Interface: 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.
+Does 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. -/
+def IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (Pair : (E d → ℝ) → E d → E d → Prop) (ν : ℝ → ℝ) : Prop :=
+ haveI := G.mΩ
+ (∀ ℓ : ℝ, 0 ≤ ν ℓ) ∧ Measurable ν ∧
+ (∀ A : Set ℝ, MeasurableSet A → A ⊆ Set.Ioi 0 →
+ (∀ᵐ ω ∂G.P, (pairSet d L Pair (G.F ω) A).Finite) ∧
+ Integrable (fun ω => ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ)) G.P ∧
+ IntegrableOn ν A ∧
+ ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)
+
+/-! ### Populations of pairs -/
+
+/-- Compact-window population of Theorem B: ordered maximum / index-(d-1)-saddle pairs with
+`0 < distance <= ρ`, birth `f(M)` in `B = [bLo, bHi]` and scaled gap in `K = [kLo, kHi]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none beyond the shared predicates.
+Does not claim: anything about the off-diagonal (far) population separately (Section 14 of the source). -/
+def IsUnrestrictedPair (d : ℕ) (L : ℝ) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsCandidatePair d L g M S ∧ 0 < heightGap d g M S
+
+/-! ### The typed pair law as an interface -/
+
+/-- Interface for the weighted regression (typed pair) law: the only object consumed by the
+statements is the probability `p_r(b,k,R)` that the global ordinary superlevel elder death
+partner of the pinned maximum `M = -(r/2)u` is the pinned saddle `S = (r/2)u`, under the
+law `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}`.
+That law, its weight, its normalizer and the regression construction are informal in the
+source and are NOT transcribed; `p` is a GIVEN function of radius `r`, birth `b`, gap mark
+`k` and orthonormal frame `R` with values in `[0, 1]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S."
+Interface: `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.
+Does 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). -/
+structure PairLawInterface (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) where
+ /-- Section 1 clause: "Let p_r(b,k,R) be the Q^W probability that the global ordinary
+ superlevel elder death partner of M is S." -/
+ p : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → ℝ
+ /-- `p` is a probability: nonnegative. -/
+ p_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 ≤ p r b k R
+ /-- `p` is a probability: at most one. -/
+ p_le_one : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), p r b k R ≤ 1
+
+/-! ### The parent statements (1.1), (1.2), (1.3) -/
+
+/-- Shape of Theorem A (1.1), uniform selection candidate: for fixed `d ≥ 2`, `L > 0`,
+compact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo ≤ kHi`, there exist `r_* > 0`
+and `C` (quantified OUTSIDE the universal quantifiers over `r`, `b`, `k` and the frame)
+such that `0 <= 1 - p_r(b,k,R) <= C r^3` for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K` and all
+orthonormal frames `R`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "There exist r_*>0 and C 0` and
+windows `B`, `K` of positive length with `kLo > 0`, there are a distance cutoff `r_* > 0`, a
+constant `c_{B,K} > 0` and a constant `C_{B,K}` such that the compact-window candidate and
+elder lifetime densities admit versions `νc`, `νe` with `νc(ℓ) ~ c_{B,K} ℓ^(-1/3)`,
+`νe(ℓ) ~ c_{B,K} ℓ^(-1/3)` as `ℓ ↓ 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and
+`0 ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all sufficiently small `ℓ > 0`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),"
+Interface: `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).
+Does 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. -/
+def ParentCompactWindowDensityB (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo < bHi → 0 < kLo → kLo < kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ c : ℝ, 0 < c ∧ ∃ C : ℝ, ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsWindowPair d L rStar bLo bHi kLo kHi) νc ∧
+ IsLifetimeDensityVersion d L G (IsWindowElderPair d L rStar bLo bHi kLo kHi I) νe ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νc
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ ∃ ℓStar : ℝ, 0 < ℓStar ∧ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3)
+
+/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and
+versions `νc`, `νe` of the unrestricted candidate density and of the finite ordinary
+superlevel H0 bar density satisfy `νc(ℓ) ~ c ℓ^(-1/3)` and `νe(ℓ) ~ c ℓ^(-1/3)` as `ℓ ↓ 0`.
+The essential global-maximum class is excluded from `νe` through `IsFiniteBar`. This is the
+conclusion of (1.3) for a given `c`; it characterises `c_{d,L}` by its leading-term role,
+not by the integral (13.6)/(15.2).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "There is a positive finite constant c_{d,L} such that"
+Interface: `G` and `I` are given; versions are characterised by the integral identity only.
+Does 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. -/
+def IsUnrestrictedLeadingCoefficient (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) (c : ℝ) : Prop :=
+ 0 < c ∧ ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsUnrestrictedPair d L) νc ∧
+ IsLifetimeDensityVersion d L G (IsFiniteBar d L I) νe ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νc
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3))
+
+/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for
+fixed `d ≥ 2` and `L > 0` there is a positive finite constant `c_{d,L}` such that the
+unrestricted candidate density and the finite ordinary superlevel H0 bar density (all birth
+heights, all positive gap marks, all separations; essential global maximum excluded) admit
+versions with `ν(ℓ) ~ c_{d,L} ℓ^(-1/3)` as `ℓ ↓ 0`. Leading term only.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),"
+Interface: `G` and `I` are given; versions are characterised by the integral identity only.
+Does 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. -/
+def ParentUnrestrictedLeadingDensityC (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) : Prop :=
+ 2 ≤ d → 0 < L → ∃ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c
+
+/-! ### The bounded remainder (R1) -/
+
+/-- Shape of Theorem R (R1), bounded unrestricted short-lifetime remainder: for fixed
+`d ≥ 2`, `L > 0` and with `c = c_{d,L}` the parent leading coefficient (characterised here
+by `IsUnrestrictedLeadingCoefficient`), there are `ell_* > 0` and `C` such that versions of
+the unrestricted candidate and finite-bar densities satisfy, for `0 < ℓ ≤ ell_*`,
+`|νc(ℓ) - c ℓ^(-1/3)| ≤ C`, `0 ≤ νc(ℓ) - νe(ℓ) ≤ C` and `|νe(ℓ) - c ℓ^(-1/3)| ≤ C`.
+The `O(1)` remainder is stated with an explicit absolute-value bound.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md sha256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a
+Anchor: "|nu_cand(ell)-c ell^(-1/3)| <= C,"
+Interface: `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).
+Does 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. -/
+def RemainderBoundedR1 (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) : Prop :=
+ 2 ≤ d → 0 < L → ∀ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c →
+ ∃ ℓStar : ℝ, 0 < ℓStar ∧ ∃ C : ℝ, ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsUnrestrictedPair d L) νc ∧
+ IsLifetimeDensityVersion d L G (IsFiniteBar d L I) νe ∧
+ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ |νc ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C ∧
+ 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C ∧
+ |νe ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C
+
+/-! ### Planar elder lower bound and density gap (d = 2) -/
+
+/-- Shape of the planar direct lower bound (E2): on the fixed planar torus (`d = 2`), with
+birth `b` in a fixed compact interval, `k ∈ [kLo, kHi]` with `kLo > 0` and frames ranging
+over `O(2)`, there are `c > 0` and `r_* > 0` such that `1 - p_r(b,k,R) ≥ c r^3` for all
+`0 < r ≤ r_*`, uniformly in `b`, `k` and the frame.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c
+Anchor: "1-p_r(b,k,R) >= c r^3, 0 0` there are a distance cutoff
+`r_* > 0`, constants `c_{B,K} > 0`, `C_{B,K}` and `ell_* > 0` such that versions of the
+compact-window candidate and ordinary elder densities satisfy
+`c_{B,K} ℓ^(2/3) ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all `0 < ℓ ≤ ell_*`. The parent upper
+input is an explicit hypothesis, not folded into the conclusion. The lower half, which the
+source derives from (E2) alone, is stated under the same hypothesis because the source displays
+(E11) as one two-sided inequality; that is a hypothesis the source does not need for the lower
+half, recorded here as such.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c
+Anchor: " <= C_{B,K} ell^(2/3). (E11)"
+Interface: `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.
+Does 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. -/
+def PlanarDensityGapE11 (L : ℝ) (G : GaussianFieldInterface 2 L) (I : SuperlevelBarInterface 2 L)
+ (PL : PairLawInterface 2 L G I) (bLo bHi kLo kHi : ℝ) : Prop :=
+ ParentUniformSelectionA 2 L G I PL bLo bHi kLo kHi →
+ (0 < L → bLo < bHi → 0 < kLo → kLo < kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ c : ℝ, 0 < c ∧ ∃ C : ℝ, ∃ ℓStar : ℝ, 0 < ℓStar ∧
+ ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion 2 L G (IsWindowPair 2 L rStar bLo bHi kLo kHi) νc ∧
+ IsLifetimeDensityVersion 2 L G (IsWindowElderPair 2 L rStar bLo bHi kLo kHi I) νe ∧
+ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ c * ℓ ^ ((2 : ℝ) / 3) ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3))
+
+end UniversalLaw.Spec.Lifetime
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean
new file mode 100644
index 000000000..7bc5f8002
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean
@@ -0,0 +1,339 @@
+import Mathlib
+import ClosedSuperlevel
+
+/-!
+# Actual ordinary singular H0 and path components, naturally
+
+C264 isolated source candidate. Compilation and kernel audit: NOT_RUN.
+The homology objects and maps below are Mathlib's singular homology functor.
+The comparison is its existing objectwise `TopCat.singularHomology₀Iso`;
+its naturality is proved here from actual zero-cycle generators.
+
+The coefficient object belongs to an arbitrary preadditive category with
+the required coproducts and homology. Nonzero/distinction controls explicitly
+require `𝟙 R ≠ 0`; no nonzero claim is made for a zero coefficient object.
+
+This supplies the component/H0 comparison for the existing closed-superlevel
+filtration. It supplies no Morse chart, critical-level attainment theorem,
+interval decomposition, elder correspondence, Field adapter, count identity,
+stochastic law, or scientific-status promotion.
+
+Owner repairs at the pin (Anthropic/Claude lane, companion owner, recorded as the
+actual repair author; handoff bytes SHA-256
+261dd0526d42890d8a4ac1225fcf47228eb3c9799af4106cb643a528bcbf968e did not elaborate
+with `-DwarningAsError=true`, Math- #428 comments 6113300903 and 6113372506): the
+homology instances `[Preadditive C] [CategoryWithHomology C]` enter the `variable`
+scope only after `ordinaryH0_componentCoproductMap_iota`, `ordinaryH0_componentFiltration`
+and `ordinaryH0_componentFiltration_map_iota`, which do not use them (the two filtration
+declarations therefore precede the homology ones; no statement changed);
+`ordinaryH0_iso_naturality` is proved by explicit `rw`/`erw` reassociation of both sides
+(the source author's five-step `calc` elaborated with an unresolved `Trans` instance
+at the pin) instead of a `simp only` that left the right side unreassociated; `isoWhiskerLeft` is referred to as `Functor.isoWhiskerLeft`; the
+three declaration names ending in `ι` are spelled `…_iota` / `…Iota…` for the
+companion's ASCII identifier rule. No statement changed.
+-/
+
+noncomputable section
+
+open CategoryTheory Limits AlgebraicTopology
+open scoped Simplicial
+
+universe w v u
+
+namespace TorusFiltration
+
+/-- Proves: actual path-component quotients form a functor on topological spaces.
+Method: use the existing continuous-map quotient map and its identity/composition laws.
+Does not establish: equality of connected and path-connected components. -/
+def ordinaryH0_componentFunctor : TopCat.{w} ⥤ Type w where
+ obj X := ZerothHomotopy X
+ map f := TypeCat.ofHom (superlevel_componentMap f.hom)
+ map_id X := by
+ apply ConcreteCategory.hom_ext
+ intro q
+ exact congrFun superlevel_componentMap_id q
+ map_comp f g := by
+ apply ConcreteCategory.hom_ext
+ intro q
+ exact congrFun (superlevel_componentMap_comp f.hom g.hom) q
+
+variable {C : Type u} [Category.{v} C] [HasCoproducts.{w} C]
+
+/-- Proves: the component-indexed coproduct construction is a functor.
+Method: compose the actual component functor with the categorical coproduct functor.
+Does not establish: an identification with homology until naturality is proved below. -/
+def ordinaryH0_componentCoproductFunctor (R : C) : TopCat.{w} ⥤ C :=
+ ordinaryH0_componentFunctor ⋙ sigmaConst.obj R
+
+/-- Proves: a coproduct generator maps to the component of its continuous image.
+Method: the universal coproduct map sends each inclusion to its indexed image.
+Does not establish: that distinct source components stay distinct. -/
+theorem ordinaryH0_componentCoproductMap_iota (R : C) {X Y : TopCat.{w}}
+ (f : X ⟶ Y) (q : ZerothHomotopy X) :
+ Sigma.ι (fun _ : ZerothHomotopy X => R) q ≫
+ (ordinaryH0_componentCoproductFunctor R).map f =
+ Sigma.ι (fun _ : ZerothHomotopy Y => R) (superlevel_componentMap f.hom q) := by
+ simp [ordinaryH0_componentCoproductFunctor, ordinaryH0_componentFunctor, sigmaConst]
+
+/-- Proves: the existing closed-superlevel family has a component-indexed coproduct filtration.
+Method: compose its actual continuous inclusions with the proved component coproduct functor.
+Does not establish: regularity, finite dimensionality, or Morse hypotheses for the height function. -/
+def ordinaryH0_componentFiltration {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (R : C) : ℝ ⥤ C :=
+ superlevel_filtration g ⋙ ordinaryH0_componentCoproductFunctor R
+
+/-- Proves: a filtration component generator maps by the existing actual component inclusion.
+Method: specialize the coproduct generator map formula to a closed-superlevel inclusion.
+Does not establish: a reverse inclusion or endpoint deletion. -/
+theorem ordinaryH0_componentFiltration_map_iota {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (R : C) {s t : ℝ} (hst : s ≤ t)
+ (q : ZerothHomotopy (superlevel_set g s)) :
+ Sigma.ι (fun _ : ZerothHomotopy (superlevel_set g s) => R) q ≫
+ (ordinaryH0_componentFiltration g R).map (homOfLE hst) =
+ Sigma.ι (fun _ : ZerothHomotopy (superlevel_set g t) => R)
+ (superlevel_componentInclusion g hst q) := by
+ exact ordinaryH0_componentCoproductMap_iota R
+ (TopCat.ofHom (superlevel_inclusion g hst)) q
+
+variable [Preadditive C] [CategoryWithHomology C]
+
+/-- Proves: a zero-simplex defines a morphism into actual simplicial homology.
+Method: include its chain generator, lift through the zero differential, then take its class.
+Does not establish: a replacement definition of homology or any naturality premise. -/
+def ordinaryH0_simplicialPointClass (S : SSet.{w}) (R : C) (x : S _⦋0⦌) :
+ R ⟶ S.homology R 0 :=
+ (S.chainComplex R).liftCycles (S.ιChainComplex x) 0 (by simp) (by simp) ≫
+ (S.chainComplex R).homologyπ 0
+
+/-- Proves: the existing simplicial H0 isomorphism sends a point class to its component.
+Method: apply Mathlib's zero-cycle generator formula.
+Does not establish: naturality merely from the existence of the objectwise isomorphism. -/
+theorem ordinaryH0_simplicialPointClass_iso (S : SSet.{w}) (R : C)
+ (x : S _⦋0⦌) :
+ ordinaryH0_simplicialPointClass S R x ≫ (S.homology₀Iso R).hom =
+ Sigma.ι (fun _ : S.π₀ => R) (SSet.π₀.mk x) := by
+ simpa only [ordinaryH0_simplicialPointClass, Category.assoc] using
+ SSet.liftCycles_ιChainComplex_homologyπ_homology₀Iso_hom S R x
+
+/-- Proves: the actual simplicial homology map carries a point class to its image class.
+Method: homology projection naturality, cycle-lift naturality, and the chain generator formula.
+Does not establish: a transported or postulated substitute for the actual homology map. -/
+theorem ordinaryH0_simplicialPointClass_map (R : C) {S T : SSet.{w}}
+ (f : S ⟶ T) (x : S _⦋0⦌) :
+ ordinaryH0_simplicialPointClass S R x ≫ SSet.homologyMap f R 0 =
+ ordinaryH0_simplicialPointClass T R (f.app _ x) := by
+ simp only [ordinaryH0_simplicialPointClass, SSet.homologyMap, Category.assoc,
+ HomologicalComplex.homologyπ_naturality,
+ HomologicalComplex.liftCycles_comp_cyclesMap_assoc, SSet.ι_chainComplexMap_f]
+
+/-- Proves: the singular zero-simplex of a point maps to that of its continuous image.
+Method: unfold the point/simplex correspondence and the singular-set map.
+Does not establish: a chain or homology identification by itself. -/
+theorem ordinaryH0_toSSet_pointMap {X Y : TopCat.{w}} (f : X ⟶ Y) (x : X) :
+ (TopCat.toSSet.map f).app _ (TopCat.toSSetObj₀Equiv.symm x) =
+ TopCat.toSSetObj₀Equiv.symm (f x) := by
+ rfl
+
+/-- Proves: each point has its actual ordinary singular zero-homology class morphism.
+Method: use the actual singular zero-simplex and the cycle/projection construction above.
+Does not establish: a free-module definition standing in for singular H0. -/
+def ordinaryH0_pointClass (X : TopCat.{w}) (R : C) (x : X) :
+ R ⟶ ((singularHomologyFunctor C 0).obj R).obj X :=
+ ordinaryH0_simplicialPointClass (TopCat.toSSet.obj X) R
+ (TopCat.toSSetObj₀Equiv.symm x)
+
+/-- Proves: actual continuous-map-induced singular H0 maps transport point classes.
+Method: specialize the proved simplicial generator naturality to the singular-set functor.
+Does not establish: injectivity of the induced map. -/
+theorem ordinaryH0_pointClass_map (R : C) {X Y : TopCat.{w}}
+ (f : X ⟶ Y) (x : X) :
+ ordinaryH0_pointClass X R x ≫ ((singularHomologyFunctor C 0).obj R).map f =
+ ordinaryH0_pointClass Y R (f x) := by
+ change ordinaryH0_simplicialPointClass (TopCat.toSSet.obj X) R
+ (TopCat.toSSetObj₀Equiv.symm x) ≫
+ SSet.homologyMap (TopCat.toSSet.map f) R 0 =
+ ordinaryH0_simplicialPointClass (TopCat.toSSet.obj Y) R
+ (TopCat.toSSetObj₀Equiv.symm (f x))
+ rw [ordinaryH0_simplicialPointClass_map, ordinaryH0_toSSet_pointMap]
+
+/-- Proves: Mathlib's existing topological comparison sends actual point classes to components.
+Method: combine the simplicial generator formula with the actual path-component equivalence.
+Does not establish: any connected-component substitution. -/
+theorem ordinaryH0_pointClass_iso (X : TopCat.{w}) (R : C) (x : X) :
+ ordinaryH0_pointClass X R x ≫ (TopCat.singularHomology₀Iso X R).hom =
+ Sigma.ι (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk x) := by
+ change ordinaryH0_simplicialPointClass (TopCat.toSSet.obj X) R
+ (TopCat.toSSetObj₀Equiv.symm x) ≫
+ ((SSet.homology₀Iso (TopCat.toSSet.obj X) R).hom ≫
+ (sigmaConst.obj R).map TopCat.zerothHomotopyEquiv.toIso.inv) = _
+ rw [← Category.assoc, ordinaryH0_simplicialPointClass_iso]
+ simp [sigmaConst]
+
+/-- Proves: inverse comparison takes each component generator to any representing point class.
+Method: cancel the comparison isomorphism and use the point-class formula.
+Does not establish: a choice of distinguished geometric representative. -/
+theorem ordinaryH0_componentIota_isoInv (X : TopCat.{w}) (R : C) (x : X) :
+ Sigma.ι (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk x) ≫
+ (TopCat.singularHomology₀Iso X R).inv = ordinaryH0_pointClass X R x := by
+ apply (cancel_mono (TopCat.singularHomology₀Iso X R).hom).1
+ simp only [Category.assoc, Iso.inv_hom_id, Category.comp_id, ordinaryH0_pointClass_iso]
+
+/-- Proves: morphisms out of actual singular H0 agree if they agree on all point classes.
+Method: cancel the inverse comparison, use coproduct extensionality and quotient surjectivity.
+Does not establish: a basis of geometric maxima or finiteness of components. -/
+theorem ordinaryH0_hom_ext (X : TopCat.{w}) (R : C) {A : C}
+ {f g : ((singularHomologyFunctor C 0).obj R).obj X ⟶ A}
+ (h : ∀ x : X, ordinaryH0_pointClass X R x ≫ f = ordinaryH0_pointClass X R x ≫ g) :
+ f = g := by
+ apply (cancel_epi (TopCat.singularHomology₀Iso X R).inv).1
+ apply Sigma.hom_ext
+ intro q
+ obtain ⟨x, rfl⟩ := ZerothHomotopy.mk_surjective q
+ simpa only [← Category.assoc, ordinaryH0_componentIota_isoInv] using h x
+
+/-- Proves: the existing actual singular H0 comparison commutes with every continuous map.
+Method: test both composites on actual point classes, transport them, and compare component images.
+Does not establish: naturality by adding an assumption or a compatibility record. -/
+theorem ordinaryH0_iso_naturality (R : C) {X Y : TopCat.{w}} (f : X ⟶ Y) :
+ ((singularHomologyFunctor C 0).obj R).map f ≫
+ (TopCat.singularHomology₀Iso Y R).hom =
+ (TopCat.singularHomology₀Iso X R).hom ≫
+ (ordinaryH0_componentCoproductFunctor R).map f := by
+ apply ordinaryH0_hom_ext X R
+ intro x
+ rw [← Category.assoc, ordinaryH0_pointClass_map, ordinaryH0_pointClass_iso]
+ -- the right side composes through `(ordinaryH0_componentCoproductFunctor R).obj X`, which is
+ -- `∐ fun _ => R` only after unfolding, so its reassociation is rewritten at default transparency
+ erw [← Category.assoc, ordinaryH0_pointClass_iso, ordinaryH0_componentCoproductMap_iota]
+ rfl
+
+/-- Proves: actual ordinary singular H0 is naturally isomorphic to component-indexed coproducts.
+Method: assemble the existing objectwise isomorphisms using the commuting square proved above.
+Does not establish: an interval decomposition or persistence-bar classification. -/
+def ordinaryH0_naturalIso (R : C) :
+ (singularHomologyFunctor C 0).obj R ≅ ordinaryH0_componentCoproductFunctor R :=
+ NatIso.ofComponents (fun X => TopCat.singularHomology₀Iso X R)
+ (fun f => ordinaryH0_iso_naturality R f)
+
+/-- Proves: ordinary augmentation sends every actual point-class morphism to the coefficient identity.
+Method: use the comparison's augmentation formula and the coproduct universal property.
+Does not establish: reduced-H0 vanishing; this retains the ordinary point class. -/
+theorem ordinaryH0_pointClass_augmentation (X : TopCat.{w}) (R : C) (x : X) :
+ ordinaryH0_pointClass X R x ≫ TopCat.singularHomology₀ε X R = 𝟙 R := by
+ rw [← TopCat.singularHomology₀Iso_sigma_desc_id X R, ← Category.assoc,
+ ordinaryH0_pointClass_iso]
+ simp
+
+/-- Proves: an actual point class is nonzero for a coefficient object with nonzero identity.
+Method: compose a proposed zero class with ordinary augmentation.
+Does not establish: nonzero classes for a zero coefficient object. -/
+theorem ordinaryH0_pointClass_ne_zero (X : TopCat.{w}) (R : C)
+ (hR : (𝟙 R : R ⟶ R) ≠ 0) (x : X) : ordinaryH0_pointClass X R x ≠ 0 := by
+ intro h
+ have hε := ordinaryH0_pointClass_augmentation X R x
+ rw [h, zero_comp] at hε
+ exact hR hε.symm
+
+/-- Proves: points in the same actual path component give equal ordinary H0 class morphisms.
+Method: cancel the objectwise comparison and compare their component indices.
+Does not establish: a converse for zero coefficients. -/
+theorem ordinaryH0_pointClass_eq_of_component_eq (X : TopCat.{w}) (R : C)
+ (x y : X) (h : ZerothHomotopy.mk x = ZerothHomotopy.mk y) :
+ ordinaryH0_pointClass X R x = ordinaryH0_pointClass X R y := by
+ apply (cancel_mono (TopCat.singularHomology₀Iso X R).hom).1
+ rw [ordinaryH0_pointClass_iso, ordinaryH0_pointClass_iso, h]
+
+/-- Proves: the difference of same-component point classes is zero for arbitrary coefficients.
+Method: subtract the equality proved from actual path-component equality.
+Does not establish: that either individual point class dies. -/
+theorem ordinaryH0_sameComponent_difference_zero (X : TopCat.{w}) (R : C)
+ (x y : X) (h : ZerothHomotopy.mk x = ZerothHomotopy.mk y) :
+ ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y = 0 := by
+ rw [ordinaryH0_pointClass_eq_of_component_eq X R x y h, sub_self]
+
+/-- Proves: distinct actual path components have distinct ordinary H0 class morphisms if coefficients are nonzero.
+Method: separate the two coproduct injections by an identity/zero component projection.
+Does not establish: distinction with zero coefficients or distinction of points within one component. -/
+theorem ordinaryH0_pointClass_ne_of_component_ne (X : TopCat.{w}) (R : C)
+ (hR : (𝟙 R : R ⟶ R) ≠ 0) (x y : X)
+ (hxy : ZerothHomotopy.mk x ≠ ZerothHomotopy.mk y) :
+ ordinaryH0_pointClass X R x ≠ ordinaryH0_pointClass X R y := by
+ classical
+ intro h
+ have hc : Sigma.ι (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk x) =
+ Sigma.ι (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk y) := by
+ simpa only [ordinaryH0_pointClass_iso] using
+ congrArg (fun k => k ≫ (TopCat.singularHomology₀Iso X R).hom) h
+ let p : (∐ fun _ : ZerothHomotopy X => R) ⟶ R :=
+ Sigma.desc (fun q => if q = ZerothHomotopy.mk x then 𝟙 R else 0)
+ apply hR
+ simpa [p, Ne.symm hxy] using congrArg (fun k => k ≫ p) hc
+
+/-- Proves: with nonzero coefficients, actual point-class equality is exactly path-component equality.
+Method: combine the same-component formula with the separating projection control.
+Does not establish: equality of geometric points or connected components. -/
+theorem ordinaryH0_pointClass_eq_iff (X : TopCat.{w}) (R : C)
+ (hR : (𝟙 R : R ⟶ R) ≠ 0) (x y : X) :
+ ordinaryH0_pointClass X R x = ordinaryH0_pointClass X R y ↔
+ ZerothHomotopy.mk x = ZerothHomotopy.mk y := by
+ constructor
+ · intro h
+ by_contra hn
+ exact ordinaryH0_pointClass_ne_of_component_ne X R hR x y hn h
+ · exact ordinaryH0_pointClass_eq_of_component_eq X R x y
+
+/-- Proves: the actual H0 map sends a difference of point classes to the difference of image classes.
+Method: distribute composition over subtraction and use proved actual point-class transport.
+Does not establish: death of the individual ordinary point classes. -/
+theorem ordinaryH0_difference_map (R : C) {X Y : TopCat.{w}} (f : X ⟶ Y) (x y : X) :
+ (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) ≫
+ ((singularHomologyFunctor C 0).obj R).map f =
+ ordinaryH0_pointClass Y R (f x) - ordinaryH0_pointClass Y R (f y) := by
+ rw [Preadditive.sub_comp, ordinaryH0_pointClass_map, ordinaryH0_pointClass_map]
+
+/-- Proves: with nonzero coefficients, a mapped difference vanishes exactly when the image points merge in path components.
+Method: actual homology-map transport, subtraction cancellation, and the component equality criterion.
+Does not establish: a Morse merger event, elder selection, death height, or barcode. -/
+theorem ordinaryH0_difference_map_eq_zero_iff (R : C) (hR : (𝟙 R : R ⟶ R) ≠ 0)
+ {X Y : TopCat.{w}} (f : X ⟶ Y) (x y : X) :
+ (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) ≫
+ ((singularHomologyFunctor C 0).obj R).map f = 0 ↔
+ ZerothHomotopy.mk (f x) = ZerothHomotopy.mk (f y) := by
+ rw [ordinaryH0_difference_map, sub_eq_zero, ordinaryH0_pointClass_eq_iff Y R hR]
+
+/-- Proves: the existing actual singular H0 filtration is naturally isomorphic to its component coproduct filtration.
+Method: restrict the proved natural comparison along the existing topological filtration.
+Does not establish: the later interval, elder, maximum/saddle, count, Field, or stochastic bridges. -/
+def ordinaryH0_filtrationIso {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (R : C) :
+ superlevel_h0Filtration g R ≅ ordinaryH0_componentFiltration g R :=
+ Functor.isoWhiskerLeft (superlevel_filtration g) (ordinaryH0_naturalIso R)
+
+/-- Proves: all ordered closed-superlevel inclusion maps satisfy the actual H0/component square.
+Method: read the naturality of the proved filtration isomorphism at the preorder morphism.
+Does not establish: strict-level conventions or any unproved geometric persistence hypothesis. -/
+theorem ordinaryH0_filtration_naturality {X : Type w} [TopologicalSpace X]
+ (g : X → ℝ) (R : C) {s t : ℝ} (hst : s ≤ t) :
+ (superlevel_h0Filtration g R).map (homOfLE hst) ≫
+ (ordinaryH0_filtrationIso g R).hom.app t =
+ (ordinaryH0_filtrationIso g R).hom.app s ≫
+ (ordinaryH0_componentFiltration g R).map (homOfLE hst) :=
+ (ordinaryH0_filtrationIso g R).hom.naturality (homOfLE hst)
+
+/-- Proves: under a closed-superlevel inclusion, a difference vanishes exactly when the two included points are joined in the target closed superlevel.
+Method: apply the actual H0 difference control and the existing component/JoinedIn equivalence.
+Does not establish: attainment of a critical death threshold or an elder/barcode theorem. -/
+theorem ordinaryH0_filtration_difference_zero_iff_joinedIn
+ {X : Type w} [TopologicalSpace X] (g : X → ℝ) (R : C)
+ (hR : (𝟙 R : R ⟶ R) ≠ 0) {s t : ℝ} (hst : s ≤ t)
+ (x y : superlevel_set g s) :
+ (ordinaryH0_pointClass (TopCat.of (superlevel_set g s)) R x -
+ ordinaryH0_pointClass (TopCat.of (superlevel_set g s)) R y) ≫
+ (superlevel_h0Filtration g R).map (homOfLE hst) = 0 ↔
+ JoinedIn (superlevel_set g t) x.val y.val := by
+ exact (ordinaryH0_difference_map_eq_zero_iff R hR
+ (TopCat.ofHom (superlevel_inclusion g hst)) x y).trans
+ (superlevel_component_eq_iff_joinedIn g t
+ (superlevel_inclusion g hst x) (superlevel_inclusion g hst y))
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean
new file mode 100644
index 000000000..b047384e2
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean
@@ -0,0 +1,299 @@
+import Mathlib
+
+/-!
+# C263 total strict-clearance cut for continuous Euclidean heights
+
+Proves: total essentiality, strict-clearance set and real death value with an
+explicit empty-set value zero; an unconditional bound for clearance members;
+nonemptiness for continuous nonessential inputs; strict witness improvement;
+the exact strict supremum cut, guarded death bound and cut uniqueness.
+
+Method: the starting endpoint bounds every clearance; a straight path and the
+attained minimum on its compact unit-interval parameter supply a lower witness
+and a uniform strict margin; conditional real supremum laws identify the cut.
+
+Does not establish: an inhabitant of the separately owned Field or Lifetime
+record, an elder relation, Morse endpoint attainment, ordinary H0 bar pairing,
+finite-bar counts, a Gaussian field or weighted law, or scientific acceptance.
+The scalar zero on an empty set is a default, not an essential-bar death.
+
+Authored by OpenAI/Codex c262_lean_source_review, now acting as C263 implementer,
+delegated for Dylan Roy. Source/design-exposed; organizational independence 0;
+no human review. Consumes C260 prose SHA-256
+d2462639df32364e6fc8b0fea0703106c668cedb0aa7bb00e139aa81561bd845.
+Target pin: Lean 4.34.1 / Mathlib d13f23b723b8a846827a245b89c10fc7d3f11612.
+Elaboration, kernel audit and executed controls are recorded in separate
+source-bound receipts; this text makes no execution claim.
+
+Compile fix at the pin (Anthropic/Claude lane, companion owner; handoff bytes
+SHA-256 d74dc8b2c25eff5b90ce7133e51a0888c7885cae24ca6d5e648bc514089637a8 did not
+elaborate with `-DwarningAsError=true`): in `superlevelBar_death_eq_sSup_of_nonempty`
+the simp lemma `if_pos` (deprecated in Lean core since 2026-07-21) is replaced by
+its successor `ite_eq_left`, the same statement; no other byte changes.
+-/
+
+noncomputable section
+
+namespace TorusFiltration
+
+/-- Proves: the ambient type is real Euclidean space in the stated dimension.
+Method: a type abbreviation. Does not establish: a positive-dimensional or
+periodic quotient-space hypothesis. -/
+abbrev superlevelBar_E (d : ℕ) := EuclideanSpace ℝ (Fin d)
+
+/-- Proves: the essentiality datum is total. Method: global order comparison.
+Does not establish: an actual persistence interpretation off the guarded locus. -/
+def superlevelBar_isEssential {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) : Prop :=
+ ∀ y, g y ≤ g M
+
+/-- Proves: a total strict-clearance set with the source's existential endpoint.
+Method: quantify over actual paths and every parameter, including endpoints.
+Does not establish: a path attaining the supremum with closed inequalities. -/
+def superlevelBar_clearanceSet {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) : Set ℝ :=
+ {h | ∃ y, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)}
+
+/-- Proves: the death datum is a total real number with explicit empty default.
+Method: nonempty conditional supremum; boundedness is proved below.
+Does not establish: a finite death for an essential class. -/
+def superlevelBar_deathHeight {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) : ℝ := by
+ classical
+ exact if (superlevelBar_clearanceSet g M).Nonempty then
+ sSup (superlevelBar_clearanceSet g M) else 0
+
+/-- Proves: essentiality is exactly global maximality for these total data.
+Method: unfold the defining proposition. Does not establish: agreement with
+an independently defined essential persistence class. -/
+theorem superlevelBar_essential_iff {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) :
+ superlevelBar_isEssential g M ↔ ∀ y, g y ≤ g M := Iff.rfl
+
+/-- Proves: an unconditional strict bound on each clearance member.
+Method: evaluate its path at zero. Does not establish: an unconditional bound
+on the default death value when the clearance set is empty. -/
+theorem superlevelBar_mem_lt_start {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) {h : ℝ} (hh : h ∈ superlevelBar_clearanceSet g M) :
+ h < g M := by
+ obtain ⟨y, hy, γ, hγ⟩ := hh
+ have hzero := hγ (0 : unitInterval)
+ simpa only [γ.source] using hzero
+
+/-- Proves: the clearance set is bounded above, including when empty.
+Method: the initial height bounds each member. Does not establish: that the
+empty-set default death value obeys the same bound. -/
+theorem superlevelBar_clearance_bddAbove {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) : BddAbove (superlevelBar_clearanceSet g M) := by
+ exact ⟨g M, fun h hh => (superlevelBar_mem_lt_start g M hh).le⟩
+
+/-- Proves: essentiality forces the clearance set to be empty.
+Method: contradict the required strictly higher endpoint.
+Does not establish: a converse for arbitrary discontinuous heights. -/
+theorem superlevelBar_clearance_empty_of_essential {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)
+ (hM : superlevelBar_isEssential g M) : superlevelBar_clearanceSet g M = ∅ := by
+ ext h
+ constructor
+ · rintro ⟨y, hy, γ, hγ⟩
+ exact False.elim ((not_lt_of_ge (hM y)) hy)
+ · intro hh
+ exact False.elim hh
+
+/-- Proves: an empty clearance set selects the declared real value zero.
+Method: simplify the conditional definition. Does not establish: a geometric
+death event or finite persistence interval at that zero. -/
+theorem superlevelBar_death_eq_zero_of_empty {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)
+ (he : superlevelBar_clearanceSet g M = ∅) : superlevelBar_deathHeight g M = 0 := by
+ classical
+ simp [superlevelBar_deathHeight, he]
+
+/-- Proves: essential inputs have the declared zero default.
+Method: essentiality implies empty clearance, then use the empty branch.
+Does not establish: an essential-bar death height. -/
+theorem superlevelBar_death_eq_zero_of_essential {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)
+ (hM : superlevelBar_isEssential g M) : superlevelBar_deathHeight g M = 0 := by
+ exact superlevelBar_death_eq_zero_of_empty g M
+ (superlevelBar_clearance_empty_of_essential g M hM)
+
+/-- Proves: nonempty clearance selects its real supremum in the total data.
+Method: simplify the nonempty conditional branch. Does not establish:
+nonemptiness without a witness or a regularity hypothesis. -/
+theorem superlevelBar_death_eq_sSup_of_nonempty {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)
+ (hne : (superlevelBar_clearanceSet g M).Nonempty) :
+ superlevelBar_deathHeight g M = sSup (superlevelBar_clearanceSet g M) := by
+ classical
+ simp only [superlevelBar_deathHeight, ite_eq_left hne]
+
+/-- Proves: a continuous height attains a minimum along each actual path.
+Method: compact unit interval and the extreme-value theorem.
+Does not establish: a minimum over all paths or an optimal path. -/
+theorem superlevelBar_path_minimum {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) {M y : superlevelBar_E d} (γ : Path M y) :
+ ∃ t₀ : unitInterval, ∀ t : unitInterval, g (γ t₀) ≤ g (γ t) := by
+ obtain ⟨t₀, ht₀, hmin⟩ :=
+ (isCompact_univ : IsCompact (Set.univ : Set unitInterval)).exists_isMinOn
+ (show (Set.univ : Set unitInterval).Nonempty from ⟨0, Set.mem_univ _⟩)
+ (hg.comp γ.continuous).continuousOn
+ exact ⟨t₀, fun t => hmin (Set.mem_univ t)⟩
+
+/-- Proves: nonessential continuous inputs have a nonempty clearance set.
+Method: a higher endpoint, Path.segment, and minimum minus one.
+Does not establish: compactness of the whole Euclidean domain. -/
+theorem superlevelBar_clearance_nonempty {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) (M : superlevelBar_E d)
+ (hM : ¬ superlevelBar_isEssential g M) :
+ (superlevelBar_clearanceSet g M).Nonempty := by
+ classical
+ have hhigh : ∃ y, g M < g y := by
+ by_contra hn
+ apply hM
+ intro y
+ exact le_of_not_gt (fun hy => hn ⟨y, hy⟩)
+ obtain ⟨y, hy⟩ := hhigh
+ let γ : Path M y := Path.segment M y
+ obtain ⟨t₀, hmin⟩ := superlevelBar_path_minimum g hg γ
+ refine ⟨g (γ t₀) - 1, y, hy, γ, ?_⟩
+ intro t
+ have ht := hmin t
+ linarith
+
+/-- Proves: for continuous heights, clearance is nonempty exactly off the
+essential locus. Method: the higher witness endpoint and the straight-path
+construction. Does not establish: this equivalence without continuity. -/
+theorem superlevelBar_clearance_nonempty_iff {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (hg : Continuous g) (M : superlevelBar_E d) :
+ (superlevelBar_clearanceSet g M).Nonempty ↔ ¬ superlevelBar_isEssential g M := by
+ constructor
+ · rintro ⟨h, y, hy, γ, hγ⟩ hM
+ exact (not_lt_of_ge (hM y)) hy
+ · exact superlevelBar_clearance_nonempty g hg M
+
+/-- Proves: any smaller threshold than an existing clearance is a clearance.
+Method: reuse the same endpoint and path and compose strict inequalities.
+Does not establish: strict improvement to a larger threshold. -/
+theorem superlevelBar_clearance_downward {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (M : superlevelBar_E d) {h c : ℝ} (hhc : h < c)
+ (hc : c ∈ superlevelBar_clearanceSet g M) : h ∈ superlevelBar_clearanceSet g M := by
+ obtain ⟨y, hy, γ, hγ⟩ := hc
+ exact ⟨y, hy, γ, fun t => hhc.trans (hγ t)⟩
+
+/-- Proves: each strict witness has a larger strict witness on its same path.
+Method: attained minimum and a midpoint below it.
+Does not establish: a witness with clearance strictly above the supremum. -/
+theorem superlevelBar_clearance_improve {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) (M : superlevelBar_E d) {h : ℝ}
+ (hh : h ∈ superlevelBar_clearanceSet g M) :
+ ∃ c : ℝ, h < c ∧ c ∈ superlevelBar_clearanceSet g M := by
+ obtain ⟨y, hy, γ, hγ⟩ := hh
+ obtain ⟨t₀, hmin⟩ := superlevelBar_path_minimum g hg γ
+ have hmargin := hγ t₀
+ refine ⟨(h + g (γ t₀)) / 2, ?_, y, hy, γ, ?_⟩
+ · linarith
+ · intro t
+ have ht := hmin t
+ linarith
+
+/-- Proves: the exact strict cut for continuous nonessential inputs.
+Method: least-upper-bound property, downward closure and strict improvement.
+Does not establish: closed-threshold attainment at the death height. -/
+theorem superlevelBar_strict_cut {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) (M : superlevelBar_E d)
+ (hM : ¬ superlevelBar_isEssential g M) (h : ℝ) :
+ h < superlevelBar_deathHeight g M ↔ h ∈ superlevelBar_clearanceSet g M := by
+ classical
+ have hne := superlevelBar_clearance_nonempty g hg M hM
+ rw [superlevelBar_death_eq_sSup_of_nonempty g M hne]
+ constructor
+ · intro hlt
+ have hex : ∃ c ∈ superlevelBar_clearanceSet g M, h < c := by
+ by_contra hn
+ have hub : ∀ c ∈ superlevelBar_clearanceSet g M, c ≤ h := by
+ intro c hc
+ exact le_of_not_gt (fun hhc => hn ⟨c, hc, hhc⟩)
+ exact (not_le_of_gt hlt) (csSup_le hne hub)
+ obtain ⟨c, hc, hhc⟩ := hex
+ exact superlevelBar_clearance_downward g M hhc hc
+ · intro hh
+ obtain ⟨c, hhc, hc⟩ := superlevelBar_clearance_improve g hg M hh
+ exact hhc.trans_le (le_csSup (superlevelBar_clearance_bddAbove g M) hc)
+
+/-- Proves: the death value is at most the initial height when clearance is
+nonempty. Method: the supremum is at most this upper bound.
+Does not establish: the bound on the empty default branch. -/
+theorem superlevelBar_death_le_start_of_nonempty {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)
+ (hne : (superlevelBar_clearanceSet g M).Nonempty) :
+ superlevelBar_deathHeight g M ≤ g M := by
+ rw [superlevelBar_death_eq_sSup_of_nonempty g M hne]
+ exact csSup_le hne (fun h hh => (superlevelBar_mem_lt_start g M hh).le)
+
+/-- Proves: the death upper bound for continuous nonessential inputs.
+Method: establish nonempty clearance and apply its guarded supremum bound.
+Does not establish: a strict inequality or an attained optimal path. -/
+theorem superlevelBar_death_le_start {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) (M : superlevelBar_E d)
+ (hM : ¬ superlevelBar_isEssential g M) : superlevelBar_deathHeight g M ≤ g M := by
+ exact superlevelBar_death_le_start_of_nonempty g M
+ (superlevelBar_clearance_nonempty g hg M hM)
+
+/-- Proves: the clearance set is the open lower interval below death on the
+continuous nonessential locus. Method: extensionality and the strict cut.
+Does not establish: a closed-threshold path at the excluded endpoint. -/
+theorem superlevelBar_clearance_eq_Iio {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) (M : superlevelBar_E d)
+ (hM : ¬ superlevelBar_isEssential g M) :
+ superlevelBar_clearanceSet g M = Set.Iio (superlevelBar_deathHeight g M) := by
+ ext h
+ exact (superlevelBar_strict_cut g hg M hM h).symm
+
+/-- Proves: death is not a strict clearance for continuous nonessential inputs.
+Method: the cut would otherwise imply that death is strictly below itself.
+Does not establish: failure or success of closed-threshold attainment. -/
+theorem superlevelBar_death_not_mem_clearance {d : ℕ}
+ (g : superlevelBar_E d → ℝ) (hg : Continuous g) (M : superlevelBar_E d)
+ (hM : ¬ superlevelBar_isEssential g M) :
+ superlevelBar_deathHeight g M ∉ superlevelBar_clearanceSet g M := by
+ intro hh
+ have hlt := (superlevelBar_strict_cut g hg M hM (superlevelBar_deathHeight g M)).2 hh
+ exact (lt_irrefl _) hlt
+
+/-- Proves: uniqueness of a real number with this strict cut on the valid locus.
+Method: evaluate either cut at the competing endpoint.
+Does not establish: equality of arbitrary total interface records off that locus. -/
+theorem superlevelBar_cut_unique {d : ℕ} (g : superlevelBar_E d → ℝ)
+ (hg : Continuous g) (M : superlevelBar_E d)
+ (hM : ¬ superlevelBar_isEssential g M) (a : ℝ)
+ (ha : ∀ h : ℝ, h < a ↔ h ∈ superlevelBar_clearanceSet g M) :
+ a = superlevelBar_deathHeight g M := by
+ apply le_antisymm
+ · by_contra hn
+ have hlt : superlevelBar_deathHeight g M < a := lt_of_not_ge hn
+ exact superlevelBar_death_not_mem_clearance g hg M hM ((ha _).1 hlt)
+ · by_contra hn
+ have hlt : a < superlevelBar_deathHeight g M := lt_of_not_ge hn
+ have hc := (superlevelBar_strict_cut g hg M hM a).1 hlt
+ exact (lt_irrefl a) ((ha a).2 hc)
+
+/-- Proves: any constant height selects the zero default at every point.
+Method: every point is globally maximal, hence essential in these data.
+Does not establish: any finite ordinary bar for that constant height. -/
+theorem superlevelBar_death_const (d : ℕ) (b : ℝ) (M : superlevelBar_E d) :
+ superlevelBar_deathHeight (fun _ : superlevelBar_E d => b) M = 0 := by
+ apply superlevelBar_death_eq_zero_of_essential
+ intro y
+ exact le_rfl
+
+/-- Proves: the essential default forbids an unconditional death/start bound.
+Method: constant height minus one has empty clearance and death zero.
+Does not establish: any finite ordinary bar on a constant field. -/
+theorem superlevelBar_control_negative_essential (d : ℕ) (M : superlevelBar_E d) :
+ superlevelBar_deathHeight (fun _ : superlevelBar_E d => (-1 : ℝ)) M = 0 ∧
+ ¬ superlevelBar_deathHeight (fun _ : superlevelBar_E d => (-1 : ℝ)) M ≤ (-1 : ℝ) := by
+ rw [superlevelBar_death_const d (-1) M]
+ norm_num
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean
new file mode 100644
index 000000000..f0300a6b4
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean
@@ -0,0 +1,205 @@
+import Mathlib
+import SuperlevelBar
+import Specifications.Field
+
+/-!
+# C263 adapter: an inhabitant of the Field superlevel-bar interface
+
+Proves: the C263 strict-clearance data (`superlevelBar_deathHeight`,
+`superlevelBar_isEssential`) together with the elder clause's own right-hand side
+inhabit `UniversalLaw.Spec.Field.SuperlevelBarInterface d L` for every `d` and `L`;
+on smooth `L`-periodic heights every inhabitant agrees with this one on essentiality,
+on the death height at nonessential points and, on the Morse distinct-value locus, on
+the elder relation; and the interface leaves the death height at essential points free
+(two inhabitants differ there).
+
+Method: `IsSmooth` at `n = 0` gives continuity, so `superlevelBar_strict_cut` is the
+maximin clause and `superlevelBar_cut_unique` forces agreement of any other death
+height; `essential_iff` is `superlevelBar_essential_iff`; `ElderPartner` is defined as
+the right-hand side of `elderPartner_iff`, so that clause holds by `Iff.rfl`.
+
+Does not establish: an identification of `ElderPartner` with a persistence-module elder
+rule, the source's elder event or its Borel measurability (the clause holds by
+definition, not as a theorem about persistence); any use of periodicity or of `L` in the
+construction (the uniqueness theorems take the periodicity hypothesis only to apply an
+arbitrary inhabitant's clauses, and are false without it); a torus quotient; Morse
+genericity; any meaning of the value `0` that the C263 default
+gives at essential points; anything about the separate
+`UniversalLaw.Spec.Lifetime.SuperlevelBarInterface` (not inhabited here) or about any
+Lifetime statement; scientific acceptance. The statement packet's own text "no
+inhabitant is constructed" is about that packet and stays true of it; nothing in it
+changes. No claim-level label moves; alignment stays PENDING_INDEPENDENT_REVIEW.
+
+Authored by the Anthropic/Claude lane (owner of this companion's gate), delegated AI
+work for Dylan Roy, under the adapter route of Math- #428 comments 6112932068 and
+6124097060; organizational-independence credit 0; no human review. It consumes the
+C263 definitions, whose FORMAL HOLD extends to this module. The interface is
+`specifications/lean_statements_20261010/Specifications/Field.lean`, blob
+cc40e9d19446b8a150401c574d3cfd56177f195f, compiled in the same replay.
+Target pin: Lean 4.34.1 / Mathlib d13f23b723b8a846827a245b89c10fc7d3f11612.
+Elaboration, kernel audit and executed controls are recorded in separate source-bound
+receipts; this text makes no execution claim.
+-/
+
+noncomputable section
+
+open UniversalLaw.Spec.Field
+
+namespace TorusFiltration
+
+/-- Proves: a smooth height in the Field sense is continuous.
+Method: the `n = 0` instance of `IsSmooth` and `ContDiff.continuous`.
+Does not establish: any regularity beyond continuity. -/
+theorem superlevelBarField_continuous {d : ℕ} {g : E d → ℝ} (hg : IsSmooth d g) :
+ Continuous g :=
+ (hg 0).continuous
+
+/-- Proves: the C263 data inhabit the Field interface for every dimension and period.
+Method: death height and essentiality are the C263 definitions, the maximin clause is
+`superlevelBar_strict_cut`, and the elder relation is the right-hand side of its clause.
+Does not establish: a persistence-module elder rule; `elderPartner_iff` holds by
+definition, and periodicity and `L` are not used. -/
+def superlevelBarField_interface (d : ℕ) (L : ℝ) : SuperlevelBarInterface d L where
+ deathHeight := superlevelBar_deathHeight
+ IsEssential := superlevelBar_isEssential
+ ElderPartner := fun g M S =>
+ IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ superlevelBar_isEssential g M ∧
+ superlevelBar_deathHeight g M = g S
+ essential_iff := fun g _ _ M => superlevelBar_essential_iff g M
+ deathHeight_maximin := fun g hs _ M hM h =>
+ superlevelBar_strict_cut g (superlevelBarField_continuous hs) M hM h
+ elderPartner_iff := fun _ _ _ _ _ _ => Iff.rfl
+
+/-- Proves: the Field superlevel-bar interface is inhabited for every `d` and `L`.
+Method: the record above. Does not establish: that any inhabitant is the source's
+superlevel H0 object. -/
+theorem superlevelBarField_nonempty (d : ℕ) (L : ℝ) :
+ Nonempty (SuperlevelBarInterface d L) :=
+ ⟨superlevelBarField_interface d L⟩
+
+/-- Proves: the death height of the record is the C263 death height.
+Method: `rfl`. Does not establish: a finite death for an essential point. -/
+theorem superlevelBarField_deathHeight_eq {d : ℕ} {L : ℝ} (g : E d → ℝ) (M : E d) :
+ (superlevelBarField_interface d L).deathHeight g M = superlevelBar_deathHeight g M :=
+ rfl
+
+/-- Proves: essentiality in the record is global maximality.
+Method: `Iff.rfl`. Does not establish: agreement with a persistence essential class. -/
+theorem superlevelBarField_isEssential_iff {d : ℕ} {L : ℝ} (g : E d → ℝ) (M : E d) :
+ (superlevelBarField_interface d L).IsEssential g M ↔ ∀ y, g y ≤ g M :=
+ Iff.rfl
+
+/-- Proves: the elder relation of the record is, for every height, the right-hand side
+of the interface clause. Method: `Iff.rfl`, since it is defined that way.
+Does not establish: that this relation is ordinary elder death in any persistence sense. -/
+theorem superlevelBarField_elderPartner_iff {d : ℕ} {L : ℝ} (g : E d → ℝ) (M S : E d) :
+ (superlevelBarField_interface d L).ElderPartner g M S ↔
+ (IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ superlevelBar_isEssential g M ∧
+ superlevelBar_deathHeight g M = g S) :=
+ Iff.rfl
+
+/-- Proves: on smooth periodic heights every inhabitant's essentiality is global maximality.
+Method: its own `essential_iff` clause. Does not establish: anything off that locus. -/
+theorem superlevelBarField_essential_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)
+ (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d) :
+ I.IsEssential g M ↔ superlevelBar_isEssential g M :=
+ I.essential_iff g hs hp M
+
+/-- Proves: on smooth periodic heights every inhabitant's death height at a nonessential
+point is the C263 death height. Method: its maximin clause is a strict cut for the
+clearance set, and `superlevelBar_cut_unique` leaves one such number.
+Does not establish: agreement at essential points (see the control below). -/
+theorem superlevelBarField_deathHeight_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)
+ (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d)
+ (hM : ¬ I.IsEssential g M) :
+ I.deathHeight g M = superlevelBar_deathHeight g M := by
+ have hM' : ¬ superlevelBar_isEssential g M :=
+ fun h => hM ((superlevelBarField_essential_unique I g hs hp M).2 h)
+ exact superlevelBar_cut_unique g (superlevelBarField_continuous hs) M hM' _
+ (fun h => I.deathHeight_maximin g hs hp M hM h)
+
+/-- Proves: on the Morse distinct-value locus of smooth periodic heights every inhabitant's
+elder relation is the record's. Method: both are their clause's right-hand side, whose
+essentiality and death-height terms agree by the two uniqueness theorems above.
+Does not establish: agreement off the Morse distinct-value locus, where the interface
+constrains no elder relation. -/
+theorem superlevelBarField_elderPartner_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)
+ (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (hm : IsMorseDistinct d L g)
+ (M S : E d) :
+ I.ElderPartner g M S ↔ (superlevelBarField_interface d L).ElderPartner g M S := by
+ rw [I.elderPartner_iff g hs hp hm M S]
+ constructor
+ · rintro ⟨hmax, hsad, hne, hdeath⟩
+ exact ⟨hmax, hsad, fun h => hne ((superlevelBarField_essential_unique I g hs hp M).2 h),
+ (superlevelBarField_deathHeight_unique I g hs hp M hne).symm.trans hdeath⟩
+ · rintro ⟨hmax, hsad, hne, hdeath⟩
+ have hne' : ¬ I.IsEssential g M :=
+ fun h => hne ((superlevelBarField_essential_unique I g hs hp M).1 h)
+ exact ⟨hmax, hsad, hne', (superlevelBarField_deathHeight_unique I g hs hp M hne').trans hdeath⟩
+
+/-- Proves: a second record, equal to the first except that its death height is the
+constant `c` at essential points, also inhabits the interface. Method: off the essential
+points it is the C263 death height, so the same strict cut applies; its elder relation is
+again its clause's right-hand side. Does not establish: any preferred value at essential
+points. -/
+def superlevelBarField_shift (d : ℕ) (L c : ℝ) : SuperlevelBarInterface d L where
+ deathHeight := fun g M => by
+ classical
+ exact if superlevelBar_isEssential g M then c else superlevelBar_deathHeight g M
+ IsEssential := superlevelBar_isEssential
+ ElderPartner := fun g M S =>
+ IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ superlevelBar_isEssential g M ∧
+ (by classical
+ exact if superlevelBar_isEssential g M then c else superlevelBar_deathHeight g M) = g S
+ essential_iff := fun g _ _ M => superlevelBar_essential_iff g M
+ deathHeight_maximin := fun g hs _ M hM h => by
+ classical
+ rw [ite_eq_right hM]
+ exact superlevelBar_strict_cut g (superlevelBarField_continuous hs) M hM h
+ elderPartner_iff := fun _ _ _ _ _ _ => Iff.rfl
+
+/-- Proves: at a constant height the shifted record's death height is `c`.
+Method: every point of a constant height is essential. Does not establish: a finite bar
+for a constant height. -/
+theorem superlevelBarField_shift_deathHeight_const (d : ℕ) (L c b : ℝ) (M : E d) :
+ (superlevelBarField_shift d L c).deathHeight (fun _ => b) M = c := by
+ classical
+ show (if superlevelBar_isEssential (fun _ : E d => b) M then c
+ else superlevelBar_deathHeight (fun _ : E d => b) M) = c
+ have hM : superlevelBar_isEssential (fun _ : E d => b) M := fun _ => le_rfl
+ rw [ite_eq_left hM]
+
+/-- Proves: constant heights are smooth. Method: `contDiff_const`.
+Does not establish: anything about nonconstant heights. -/
+theorem superlevelBarField_const_smooth (d : ℕ) (b : ℝ) : IsSmooth d (fun _ : E d => b) :=
+ fun _ => contDiff_const
+
+/-- Proves: constant heights are `L`-periodic. Method: both sides are the constant.
+Does not establish: anything about the lattice. -/
+theorem superlevelBarField_const_periodic (d : ℕ) (L b : ℝ) :
+ IsLPeriodic d L (fun _ : E d => b) :=
+ fun _ _ => rfl
+
+/-- Proves: the nonessential hypothesis of `superlevelBarField_deathHeight_unique` cannot
+be dropped: at the smooth periodic constant height `0` every point is essential for both
+records, the record's death height there is `0`, its shift by `1` has death height `1`,
+and the two differ. Method: `superlevelBar_death_const` and the shifted value.
+Does not establish: anything about nonessential points, where all inhabitants agree. -/
+theorem superlevelBarField_control_essential_free (d : ℕ) (L : ℝ) (M : E d) :
+ IsSmooth d (fun _ : E d => (0 : ℝ)) ∧ IsLPeriodic d L (fun _ : E d => (0 : ℝ)) ∧
+ (superlevelBarField_interface d L).IsEssential (fun _ => (0 : ℝ)) M ∧
+ (superlevelBarField_shift d L 1).IsEssential (fun _ => (0 : ℝ)) M ∧
+ (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M = 0 ∧
+ (superlevelBarField_shift d L 1).deathHeight (fun _ => (0 : ℝ)) M = 1 ∧
+ (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M ≠
+ (superlevelBarField_shift d L 1).deathHeight (fun _ => (0 : ℝ)) M := by
+ have h0 : (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M = 0 := by
+ rw [superlevelBarField_deathHeight_eq, superlevelBar_death_const]
+ have h1 : (superlevelBarField_shift d L 1).deathHeight (fun _ => (0 : ℝ)) M = 1 :=
+ superlevelBarField_shift_deathHeight_const d L 1 0 M
+ refine ⟨superlevelBarField_const_smooth d 0, superlevelBarField_const_periodic d L 0,
+ fun _ => le_rfl, fun _ => le_rfl, h0, h1, ?_⟩
+ rw [h0, h1]
+ norm_num
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/TorusTopology.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/TorusTopology.lean
new file mode 100644
index 000000000..ed678ea32
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/TorusTopology.lean
@@ -0,0 +1,247 @@
+import Mathlib
+
+/-!
+# The actual period-lattice quotient and specified-start path compatibility
+
+C254 proposed source. Compilation and kernel audit: NOT_RUN.
+The ambient space and lattice-vector formula below are exactly those in the
+source-bound Field.lean; this module does not import or alter that owner's file.
+All quotient, compactness, covering and descent properties are constructed.
+The final lift endpoint is existential. No critical-level attainment is claimed.
+Compile fixes at the pin (Lean v4.34.1, Mathlib d13f23b7), no statement altered: `Basis` → `Module.Basis`, `Basis.unitsSMul_apply` → `Module.Basis.unitsSMul_apply`, lattice discreteness passed via `SetLike.isDiscrete_iff_discreteTopology.mpr` instead of `DiscreteTopology.isDiscrete`, quotient path-connectedness via `inferInstanceAs (PathConnectedSpace (Quotient _))` instead of `infer_instance`.
+Three unused simp arguments (`PiLp.single_apply` twice, `hij`) removed from `torus_basis_sum_eq_latticeVec` so the
+file elaborates with warnings as errors; namespace `TorusFiltration` in this companion (handoff: `ResearchFormalCoreR1`).
+-/
+
+noncomputable section
+
+open Topology
+
+namespace TorusFiltration
+abbrev torus_E (d : ℕ) := EuclideanSpace ℝ (Fin d)
+
+/-- The exact `Field.latticeVec` formula, retained without any coordinate rescaling. -/
+def torus_latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : torus_E d :=
+ ∑ i, EuclideanSpace.single i (L * (n i : ℝ))
+
+theorem torus_field_latticeVec_formula (d : ℕ) (L : ℝ) (n : Fin d → ℤ) :
+ torus_latticeVec d L n = ∑ i, EuclideanSpace.single i (L * (n i : ℝ)) := rfl
+
+def torus_periodBasis (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ Module.Basis (Fin d) ℝ (torus_E d) :=
+ (EuclideanSpace.basisFun (Fin d) ℝ).toBasis.unitsSMul
+ (fun _ => Units.mk0 L hL.ne')
+
+def torus_periodLattice (d : ℕ) (L : ℝ) (hL : 0 < L) : Submodule ℤ (torus_E d) :=
+ Submodule.span ℤ (Set.range (torus_periodBasis d L hL))
+
+abbrev torus_quotient (d : ℕ) (L : ℝ) (hL : 0 < L) :=
+ torus_E d ⧸ (torus_periodLattice d L hL).toAddSubgroup
+
+def torus_proj (d : ℕ) (L : ℝ) (hL : 0 < L) : torus_E d → torus_quotient d L hL :=
+ QuotientAddGroup.mk
+
+/-- Concrete adapter from integer basis coefficients to Field's exact vector formula. -/
+theorem torus_basis_sum_eq_latticeVec (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (n : Fin d → ℤ) :
+ ∑ i, n i • torus_periodBasis d L hL i = torus_latticeVec d L n := by
+ classical
+ unfold torus_latticeVec
+ apply Finset.sum_congr rfl
+ intro i hi
+ ext j
+ by_cases hij : i = j
+ · subst j
+ simp [torus_periodBasis, Module.Basis.unitsSMul_apply, OrthonormalBasis.coe_toBasis,
+ EuclideanSpace.basisFun_apply, Units.smul_def, PiLp.smul_apply,
+ zsmul_eq_mul, mul_comm]
+ · simp [torus_periodBasis, Module.Basis.unitsSMul_apply, OrthonormalBasis.coe_toBasis,
+ EuclideanSpace.basisFun_apply, Units.smul_def, PiLp.smul_apply,
+ Ne.symm hij]
+
+theorem torus_lattice_mem_iff (d : ℕ) (L : ℝ) (hL : 0 < L) (x : torus_E d) :
+ x ∈ torus_periodLattice d L hL ↔ ∃ n : Fin d → ℤ, torus_latticeVec d L n = x := by
+ classical
+ change x ∈ Submodule.span ℤ (Set.range (torus_periodBasis d L hL)) ↔ _
+ rw [Submodule.mem_span_range_iff_exists_fun]
+ simp only [torus_basis_sum_eq_latticeVec]
+
+instance torus_lattice_discrete (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ DiscreteTopology (torus_periodLattice d L hL) := by
+ unfold torus_periodLattice
+ infer_instance
+
+instance torus_lattice_addSubgroup_discrete (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ DiscreteTopology (torus_periodLattice d L hL).toAddSubgroup := by
+ unfold torus_periodLattice
+ infer_instance
+
+instance torus_lattice_isZLattice (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ IsZLattice ℝ (torus_periodLattice d L hL) := by
+ unfold torus_periodLattice
+ infer_instance
+
+theorem torus_proj_surjective (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ Function.Surjective (torus_proj d L hL) := QuotientAddGroup.mk_surjective
+
+theorem torus_proj_continuous (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ Continuous (torus_proj d L hL) := continuous_quotient_mk'
+
+theorem torus_proj_eq_iff (d : ℕ) (L : ℝ) (hL : 0 < L) (x y : torus_E d) :
+ torus_proj d L hL x = torus_proj d L hL y ↔
+ ∃ n : Fin d → ℤ, y = x + torus_latticeVec d L n := by
+ change (QuotientAddGroup.mk x : torus_quotient d L hL) = QuotientAddGroup.mk y ↔ _
+ rw [QuotientAddGroup.eq]
+ change -x + y ∈ torus_periodLattice d L hL ↔ _
+ rw [torus_lattice_mem_iff]
+ constructor
+ · rintro ⟨n, hn⟩
+ exact ⟨n, by rw [hn]; abel⟩
+ · rintro ⟨n, rfl⟩
+ exact ⟨n, by abel⟩
+
+/-- Duplicate representatives have exactly the same quotient image. -/
+theorem torus_control_lattice_translate (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (x : torus_E d) (n : Fin d → ℤ) :
+ torus_proj d L hL (x + torus_latticeVec d L n) = torus_proj d L hL x :=
+ ((torus_proj_eq_iff d L hL x _).2 ⟨n, rfl⟩).symm
+
+theorem torus_proj_isCoveringMap (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ IsCoveringMap (torus_proj d L hL) :=
+ ((torus_periodLattice d L hL).toAddSubgroup.isAddQuotientCoveringMap_of_comm
+ (SetLike.isDiscrete_iff_discreteTopology.mpr
+ (torus_lattice_addSubgroup_discrete d L hL))).isCoveringMap
+
+theorem torus_compact (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ IsCompact (Set.univ : Set (torus_quotient d L hL)) := by
+ have hc := IsZLattice.isCompact_range_of_periodic (torus_periodLattice d L hL)
+ (torus_proj d L hL) (torus_proj_continuous d L hL)
+ (fun z w hw => QuotientAddGroup.mk_add_of_mem z hw)
+ rwa [Set.range_eq_univ.mpr (torus_proj_surjective d L hL)] at hc
+
+theorem torus_pathConnectedSpace (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ PathConnectedSpace (torus_quotient d L hL) := by
+ exact inferInstanceAs <| PathConnectedSpace (Quotient _)
+
+/-- Exact Field periodicity predicate with the literal lattice-vector adapter above. -/
+def torus_isPeriodic (d : ℕ) (L : ℝ) (g : torus_E d → ℝ) : Prop :=
+ ∀ (x : torus_E d) (n : Fin d → ℤ), g (x + torus_latticeVec d L n) = g x
+
+theorem torus_field_periodic_formula (d : ℕ) (L : ℝ) (g : torus_E d → ℝ) :
+ torus_isPeriodic d L g ↔
+ ∀ (x : EuclideanSpace ℝ (Fin d)) (n : Fin d → ℤ),
+ g (x + ∑ i, EuclideanSpace.single i (L * (n i : ℝ))) = g x := Iff.rfl
+
+theorem torus_periodic_respects (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (x y : torus_E d)
+ (hxy : QuotientAddGroup.leftRel (torus_periodLattice d L hL).toAddSubgroup x y) :
+ g x = g y := by
+ have hq : torus_proj d L hL x = torus_proj d L hL y := Quotient.sound hxy
+ obtain ⟨n, rfl⟩ := (torus_proj_eq_iff d L hL x y).1 hq
+ exact (hg x n).symm
+
+def torus_descend (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) : torus_quotient d L hL → ℝ :=
+ Quotient.lift g (torus_periodic_respects d L hL g hg)
+
+theorem torus_descend_proj (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (x : torus_E d) :
+ torus_descend d L hL g hg (torus_proj d L hL x) = g x := rfl
+
+theorem torus_descend_continuous (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (hgc : Continuous g) :
+ Continuous (torus_descend d L hL g hg) :=
+ hgc.quotient_lift (torus_periodic_respects d L hL g hg)
+
+/-- Lift from a prescribed representative; the endpoint is determined existentially. -/
+theorem torus_path_lift_from (d : ℕ) (L : ℝ) (hL : 0 < L)
+ {M : torus_E d} {y : torus_quotient d L hL}
+ (γ : Path (torus_proj d L hL M) y) :
+ ∃ z : torus_E d, ∃ Γ : Path M z,
+ torus_proj d L hL z = y ∧
+ ∀ t : unitInterval, torus_proj d L hL (Γ t) = γ t := by
+ let cov := torus_proj_isCoveringMap d L hL
+ let Γ := cov.liftPath γ M γ.source
+ refine ⟨Γ 1, ⟨Γ, cov.liftPath_zero γ M γ.source, rfl⟩, ?_, ?_⟩
+ · exact (congrFun (cov.liftPath_lifts γ M γ.source) 1).trans γ.target
+ · intro t
+ exact congrFun (cov.liftPath_lifts γ M γ.source) t
+
+/-- Control: a constant projected path cannot be lifted from M to a different lift.
+This refutes replacing the existential endpoint by an arbitrary chosen representative. -/
+theorem torus_control_constant_path_endpoint (d : ℕ) (L : ℝ) (hL : 0 < L)
+ {M z : torus_E d} (Γ : Path M z)
+ (hΓ : ∀ t : unitInterval, torus_proj d L hL (Γ t) = torus_proj d L hL M) : z = M := by
+ have heq : (Γ : unitInterval → torus_E d) = fun _ => M :=
+ (torus_proj_isCoveringMap d L hL).eq_of_comp_eq Γ.continuous continuous_const
+ (funext hΓ) 0 Γ.source
+ exact Γ.target.symm.trans (congrFun heq 1)
+
+/-- Combining the duplicate-image and uniqueness controls gives a direct rejection
+of any different preselected endpoint for a constant quotient path. -/
+theorem torus_control_no_arbitrary_endpoint (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (M : torus_E d) (n : Fin d → ℤ) (hn : torus_latticeVec d L n ≠ 0) :
+ torus_proj d L hL (M + torus_latticeVec d L n) = torus_proj d L hL M ∧
+ ¬ ∃ Γ : Path M (M + torus_latticeVec d L n),
+ ∀ t : unitInterval, torus_proj d L hL (Γ t) = torus_proj d L hL M := by
+ refine ⟨torus_control_lattice_translate d L hL M n, ?_⟩
+ rintro ⟨Γ, hΓ⟩
+ have heq := torus_control_constant_path_endpoint d L hL Γ hΓ
+ apply hn
+ exact add_left_cancel (show M + torus_latticeVec d L n = M + 0 by simpa using heq)
+
+/-- Higher-endpoint compatibility for any scalar path predicate, including strict
+and closed thresholds. No conclusion here asserts critical-level attainment. -/
+theorem torus_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (P : ℝ → Prop) :
+ (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, P (g (γ t))) ↔
+ (∃ y : torus_quotient d L hL,
+ torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧
+ ∃ γ : Path (torus_proj d L hL M) y,
+ ∀ t : unitInterval, P (torus_descend d L hL g hg (γ t))) := by
+ constructor
+ · rintro ⟨y, hy, γ, hγ⟩
+ exact ⟨torus_proj d L hL y, hy, γ.map (torus_proj_continuous d L hL), hγ⟩
+ · rintro ⟨y, hy, γ, hγ⟩
+ obtain ⟨z, Γ, hz, hΓ⟩ := torus_path_lift_from d L hL γ
+ refine ⟨z, ?_, Γ, ?_⟩
+ · have hz' := congrArg (torus_descend d L hL g hg) hz
+ change g z = torus_descend d L hL g hg y at hz'
+ change g M < torus_descend d L hL g hg y at hy
+ rwa [← hz'] at hy
+ · intro t
+ have ht := hγ t
+ rw [← hΓ t] at ht
+ exact ht
+
+theorem torus_strict_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : ℝ) :
+ (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)) ↔
+ (∃ y : torus_quotient d L hL,
+ torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧
+ ∃ γ : Path (torus_proj d L hL M) y,
+ ∀ t : unitInterval, h < torus_descend d L hL g hg (γ t)) :=
+ torus_higher_path_iff d L hL g hg M (fun a => h < a)
+
+theorem torus_closed_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : ℝ) :
+ (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h ≤ g (γ t)) ↔
+ (∃ y : torus_quotient d L hL,
+ torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧
+ ∃ γ : Path (torus_proj d L hL M) y,
+ ∀ t : unitInterval, h ≤ torus_descend d L hL g hg (γ t)) :=
+ torus_higher_path_iff d L hL g hg M (fun a => h ≤ a)
+
+theorem torus_global_max_iff (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) :
+ (∀ y : torus_E d, g y ≤ g M) ↔
+ ∀ y : torus_quotient d L hL,
+ torus_descend d L hL g hg y ≤ torus_descend d L hL g hg (torus_proj d L hL M) := by
+ constructor
+ · intro h y
+ obtain ⟨z, rfl⟩ := torus_proj_surjective d L hL y
+ exact h z
+ · intro h y
+ exact h (torus_proj d L hL y)
+
+end TorusFiltration
\ No newline at end of file
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean
new file mode 100644
index 000000000..a59ee9daa
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean
@@ -0,0 +1,83 @@
+import ElderClearance
+import ElderInterval
+
+/-!
+Geometric input join for the actual ordinary-H0 interval construction.
+Root01a11cbf, local author candidate, 17 October 2026.
+No analytic fold, Morse uniqueness or torus theorem is assumed proved here.
+-/
+
+noncomputable section
+open CategoryTheory Limits
+
+namespace TorusFiltration
+universe u
+
+/-- Every active closed level includes continuously into the strict level
+above d. Pulling back the proved strict separation gives closed-level separation. -/
+theorem elderTrap_closedTrace_isClopen {X : Type u} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (d t : ℝ)
+ (htrace : IsClopen (elderTrap_strictTrace g D d)) (ht : t < -d) :
+ IsClopen {x : superlevel_set g t | x.val ∈ D} := by
+ have hdt : d < -t := by linarith
+ let i : superlevel_set g t → {x : X // d < g x} :=
+ fun x => ⟨x.val, lt_of_lt_of_le hdt x.property⟩
+ have hi : Continuous i := continuous_subtype_val.subtype_mk _
+ exact htrace.preimage hi
+
+/-- Actual geometric boundary, ceiling and closed path data inhabit the interval
+trap. There is no H0 equation, interval split, clearance or death among inputs. -/
+theorem elderTrap_of_boundary {X : Type u} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (m d : ℝ) (M P : X)
+ (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)
+ (hdm : d < m) (hMheight : g M = m) (hM : M ∈ D)
+ (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)
+ (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :
+ ElderTrap g M P m d D where
+ death_lt_birth := hdm
+ maximum_height := hMheight
+ older_height := hP
+ maximum_inside := hM
+ older_outside := by
+ intro hPD
+ exact (not_lt_of_ge (hheight P hPD)) hP
+ height_ceiling := hheight
+ active_clopen := fun t ht => elderTrap_closedTrace_isClopen g D d t
+ (elderTrap_strictTrace_isClopen g D d hD hboundary) ht.2
+ closed_path := by
+ refine ⟨γ, ?_⟩
+ intro t
+ change -(-d) ≤ g (γ t)
+ simpa only [neg_neg] using hγ t
+
+/-- The constructed singular-H0 direct summand, instantiated from geometric
+inputs, rather than a premise asserting that a persistence summand exists. -/
+def elderBoundaryDirectSummand (k : Type u) [Field k]
+ {X : Type u} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (m d : ℝ) (M P : X)
+ (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)
+ (hdm : d < m) (hMheight : g M = m) (hM : M ∈ D)
+ (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)
+ (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :
+ superlevel_h0Filtration g (ModuleCat.of k k) ≅
+ elderInterval k m d ⊞ kernel (elderRetraction (k := k)
+ (elderTrap_of_boundary g D m d M P hD hboundary hdm hMheight hM hheight hP γ hγ)) :=
+ elderDirectSummand (k := k)
+ (elderTrap_of_boundary g D m d M P hD hboundary hdm hMheight hM hheight hP γ hγ)
+
+/-- On Euclidean heights the same geometric inputs also give the literal C263
+death. This is a proved join, not identification of an abstract death field. -/
+theorem elderBoundary_death_eq {n : ℕ}
+ (g : superlevelBar_E n → ℝ) (hg : Continuous g)
+ (D : Set (superlevelBar_E n)) (m d : ℝ) (M P : superlevelBar_E n)
+ (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)
+ (hMheight : g M = m) (hM : M ∈ D)
+ (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)
+ (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :
+ superlevelBar_deathHeight g M = d := by
+ apply elderTrap_death_eq g hg D d
+ (elderTrap_strictTrace_isClopen g D d hD hboundary) M hM
+ (fun x hx => (hheight x hx).trans_eq hMheight.symm) P
+ (hMheight.trans_lt hP) γ hγ
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean
new file mode 100644
index 000000000..bc6136ee5
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean
@@ -0,0 +1,129 @@
+import SuperlevelBar
+
+/-!
+# From a geometric exit trap to the literal strict-clearance death
+
+Author: OpenAI/Codex ROOT01a11cbf. Local candidate, 17 October 2026.
+This proves a topological interface used by the reviewed asymmetric fold trap.
+It does not assume the desired elder relation, clearance cut or death value.
+The hypotheses are an actual closed domain with boundary below the threshold,
+a bound on all heights inside, and an actual higher-endpoint path at the closed
+threshold. The analytic fold construction of these hypotheses, the torus lift,
+Morse saddle uniqueness and the H0 interval split are separate obligations.
+Compilation, kernel checking and alignment are recorded separately.
+-/
+
+noncomputable section
+
+namespace TorusFiltration
+
+/-- The trace of a geometric domain in the strict superlevel above d. -/
+def elderTrap_strictTrace {X : Type*} (g : X → ℝ) (D : Set X) (d : ℝ) :
+ Set {x : X // d < g x} := {x | x.val ∈ D}
+
+/-- A boundary height bound makes the trace clopen in the strict superlevel.
+This derives separation from a geometric domain; it does not assume a path cut. -/
+theorem elderTrap_strictTrace_isClopen {X : Type*} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (d : ℝ) (hD : IsClosed D)
+ (hboundary : ∀ x ∈ frontier D, g x ≤ d) :
+ IsClopen (elderTrap_strictTrace g D d) := by
+ have heq : elderTrap_strictTrace g D d =
+ (Subtype.val : {x : X // d < g x} → X) ⁻¹' interior D := by
+ ext x
+ constructor
+ · intro hx
+ change x.val ∈ D at hx
+ change x.val ∈ interior D
+ apply (mem_interior_iff_notMem_frontier hx).2
+ intro hfrontier
+ exact (not_lt_of_ge (hboundary x.val hfrontier)) x.property
+ · intro hx
+ change x.val ∈ interior D at hx
+ change x.val ∈ D
+ exact interior_subset hx
+ refine ⟨hD.preimage continuous_subtype_val, ?_⟩
+ rw [heq]
+ exact isOpen_interior.preimage continuous_subtype_val
+
+/-- A path strictly above the exit threshold cannot leave the geometric trap. -/
+theorem elderTrap_path_stays {X : Type*} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (d : ℝ)
+ (htrace : IsClopen (elderTrap_strictTrace g D d))
+ {M y : X} (hM : M ∈ D) (γ : Path M y)
+ (hγ : ∀ t : unitInterval, d < g (γ t)) : y ∈ D := by
+ let δ : unitInterval → {x : X // d < g x} := fun t => ⟨γ t, hγ t⟩
+ have hδ : Continuous δ := γ.continuous.subtype_mk _
+ have hpre := htrace.preimage hδ
+ have hzero : (0 : unitInterval) ∈ δ ⁻¹' elderTrap_strictTrace g D d := by
+ change γ 0 ∈ D
+ simpa only [γ.source] using hM
+ have hall := hpre.eq_univ ⟨0, hzero⟩
+ have hone : (1 : unitInterval) ∈ δ ⁻¹' elderTrap_strictTrace g D d := by
+ rw [hall]
+ exact Set.mem_univ _
+ change γ 1 ∈ D at hone
+ simpa only [γ.target] using hone
+
+/-- Every higher-endpoint path must meet or fall below the exit threshold.
+The conclusion quantifies over all ambient paths, including remote detours. -/
+theorem elderTrap_higher_path_meets_threshold {X : Type*} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (d : ℝ)
+ (htrace : IsClopen (elderTrap_strictTrace g D d))
+ (M : X) (hM : M ∈ D) (hheight : ∀ x ∈ D, g x ≤ g M)
+ {y : X} (hy : g M < g y) (γ : Path M y) :
+ ∃ t : unitInterval, g (γ t) ≤ d := by
+ by_contra hnone
+ push Not at hnone
+ have hyD := elderTrap_path_stays g D d htrace hM γ hnone
+ exact (not_lt_of_ge (hheight y hyD)) hy
+
+/-- The literal C263 clearance is exactly the strict interval below d.
+The closed path is supplied by the geometric construction, rather than inferred
+from a supremum over paths or from a compactness assertion about path space. -/
+theorem elderTrap_clearance_eq_Iio {n : ℕ}
+ (g : superlevelBar_E n → ℝ) (D : Set (superlevelBar_E n)) (d : ℝ)
+ (htrace : IsClopen (elderTrap_strictTrace g D d))
+ (M : superlevelBar_E n) (hM : M ∈ D)
+ (hheight : ∀ x ∈ D, g x ≤ g M)
+ (P : superlevelBar_E n) (hP : g M < g P) (γ : Path M P)
+ (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :
+ superlevelBar_clearanceSet g M = Set.Iio d := by
+ ext h
+ constructor
+ · rintro ⟨y, hy, η, hη⟩
+ obtain ⟨t, ht⟩ := elderTrap_higher_path_meets_threshold g D d htrace M hM hheight hy η
+ exact lt_of_lt_of_le (hη t) ht
+ · intro hh
+ exact ⟨P, hP, γ, fun t => lt_of_lt_of_le hh (hγ t)⟩
+
+/-- With continuity, the new geometric cut identifies the existing C263 death.
+Nonessentiality is derived from the actual higher point P. -/
+theorem elderTrap_death_eq {n : ℕ}
+ (g : superlevelBar_E n → ℝ) (hg : Continuous g)
+ (D : Set (superlevelBar_E n)) (d : ℝ)
+ (htrace : IsClopen (elderTrap_strictTrace g D d))
+ (M : superlevelBar_E n) (hM : M ∈ D)
+ (hheight : ∀ x ∈ D, g x ≤ g M)
+ (P : superlevelBar_E n) (hP : g M < g P) (γ : Path M P)
+ (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :
+ superlevelBar_deathHeight g M = d := by
+ have hne : ¬ superlevelBar_isEssential g M := fun hess =>
+ (not_lt_of_ge (hess P)) hP
+ apply (superlevelBar_cut_unique g hg M hne d ?_).symm
+ intro h
+ rw [elderTrap_clearance_eq_Iio g D d htrace M hM hheight P hP γ hγ]
+ rfl
+
+/-- The displayed closed path actually attains d. This does not replace strict
+clearance by a closed inequality or infer an optimal path from a supremum. -/
+theorem elderTrap_closed_path_attains {X : Type*} [TopologicalSpace X]
+ (g : X → ℝ) (D : Set X) (d : ℝ)
+ (htrace : IsClopen (elderTrap_strictTrace g D d))
+ (M : X) (hM : M ∈ D) (hheight : ∀ x ∈ D, g x ≤ g M)
+ {P : X} (hP : g M < g P) (γ : Path M P)
+ (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :
+ ∃ t : unitInterval, g (γ t) = d := by
+ obtain ⟨t, ht⟩ := elderTrap_higher_path_meets_threshold g D d htrace M hM hheight hP γ
+ exact ⟨t, le_antisymm ht (hγ t)⟩
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean
new file mode 100644
index 000000000..108f880b3
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean
@@ -0,0 +1,392 @@
+import OrdinaryH0
+
+/-!+# One actual ordinary-H0 interval summand from an asymmetric trap
+
+Author implementation. The geometric premises remain visible; this file does not
+prove the analytic ridge estimates, Morse labeling, or an exhaustive barcode.
+The coefficient object is the field itself, and H0 is the existing singular
+homology functor, compared with components by the proved C264 isomorphism.
+-/
+
+noncomputable section
+
+open CategoryTheory Limits AlgebraicTopology
+open scoped Classical
+
+namespace TorusFiltration
+
+universe u
+
+/-- Increasing parameter `t=-height`: closed birth and open death. -/
+def elderActive (m d t : ℝ) : Prop := -m ≤ t ∧ t < -d
+
+variable (k : Type u) [Field k]
+
+/-- The fiber is k on the interval and the zero submodule elsewhere. -/
+def elderFiber (m d t : ℝ) : Submodule k k where
+ carrier := {a | ¬ elderActive m d t → a = 0}
+ zero_mem' := by simp
+ add_mem' := by intro a b ha hb h; simp [ha h, hb h]
+ smul_mem' := by intro a b hb h; simp [hb h]
+
+theorem elderFiber_eq_zero {m d t : ℝ} (ht : ¬ elderActive m d t)
+ (x : elderFiber k m d t) : x = 0 := by
+ apply Subtype.ext
+ exact x.property ht
+
+def elderFiberMap (m d : ℝ) {s t : ℝ} (hst : s ≤ t) :
+ elderFiber k m d s →ₗ[k] elderFiber k m d t where
+ toFun x := ⟨if t < -d then x.val else 0, by
+ intro ht
+ by_cases htd : t < -d
+ · have hsa : ¬ elderActive m d s := by
+ intro hs
+ exact ht ⟨hs.1.trans hst, htd⟩
+ simp [htd, x.property hsa]
+ · simp [htd]⟩
+ map_add' := by intro x y; apply Subtype.ext; dsimp; split_ifs <;> simp
+ map_smul' := by intro a x; apply Subtype.ext; dsimp; split_ifs <;> simp
+
+@[simp] theorem elderFiberMap_val (m d : ℝ) {s t : ℝ} (hst : s ≤ t)
+ (x : elderFiber k m d s) :
+ (elderFiberMap k m d hst x).val = if t < -d then x.val else 0 := rfl
+
+/-- The actual interval persistence functor; no maps are assumed. -/
+def elderInterval (m d : ℝ) : ℝ ⥤ ModuleCat k where
+ obj t := ModuleCat.of k (elderFiber k m d t)
+ map f := ModuleCat.ofHom (elderFiberMap k m d (leOfHom f))
+ map_id t := by
+ apply ModuleCat.hom_ext
+ apply LinearMap.ext
+ intro x
+ apply Subtype.ext
+ change (if t < -d then x.val else 0) = x.val
+ by_cases ht : t < -d
+ · simp [ht]
+ · have hn : ¬ elderActive m d t := fun h => ht h.2
+ simp [ht, x.property hn]
+ map_comp {r s t} f g := by
+ apply ModuleCat.hom_ext
+ apply LinearMap.ext
+ intro x
+ apply Subtype.ext
+ change (if t < -d then x.val else 0) =
+ if t < -d then (if s < -d then x.val else 0) else 0
+ by_cases ht : t < -d
+ · have hs : s < -d := (leOfHom g).trans_lt ht
+ simp [ht, hs]
+ · simp [ht]
+
+/-- A canonical lift of a coefficient to any active interval fiber. -/
+def elderFiberLift {m d t : ℝ} (ht : elderActive m d t) :
+ k →ₗ[k] elderFiber k m d t where
+ toFun a := ⟨a, fun hn => (hn ht).elim⟩
+ map_add' := by intros; rfl
+ map_smul' := by intros; rfl
+
+@[simp] theorem elderFiberLift_val {m d t : ℝ} (ht : elderActive m d t) (a : k) :
+ (elderFiberLift k ht a).val = a := rfl
+
+/-- Endpoint control: birth is included. -/
+theorem elder_control_birth {m d : ℝ} (hdm : d < m) : elderActive m d (-m) := by
+ constructor <;> linarith
+
+/-- Endpoint control: death is excluded, despite closed superlevels. -/
+theorem elder_control_death (m d : ℝ) : ¬ elderActive m d (-d) := by
+ intro h
+ exact (lt_irrefl _) h.2
+
+variable {X : Type u} [TopologicalSpace X] (g : X → ℝ) (M P : X) (m d : ℝ)
+
+/-- The topological consequences of the asymmetric ridge trap. No H0 maps or
+splitting conclusions occur among the premises. The path at d is actual closed
+superlevel connectivity, while active cuts are clopen. -/
+structure ElderTrap (D : Set X) : Prop where
+ death_lt_birth : d < m
+ maximum_height : g M = m
+ older_height : m < g P
+ maximum_inside : M ∈ D
+ older_outside : P ∉ D
+ height_ceiling : ∀ x ∈ D, g x ≤ m
+ active_clopen : ∀ t, elderActive m d t →
+ IsClopen {x : superlevel_set g t | x.val ∈ D}
+ closed_path : JoinedIn (superlevel_set g (-d)) M P
+
+variable {g M P m d} {D : Set X}
+
+theorem ElderTrap.maximum_mem (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) : M ∈ superlevel_set g t := by
+ change -t ≤ g M
+ erw [T.maximum_height]
+ linarith [ht.1]
+
+theorem ElderTrap.older_mem (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) : P ∈ superlevel_set g t := by
+ change -t ≤ g P
+ linarith [ht.1, T.older_height]
+
+/-- Clopen cuts are constant on actual path components, with no local path
+connectivity assumption on the ambient space. -/
+theorem elder_clopen_path_iff {Y : Type u} [TopologicalSpace Y] {U : Set Y}
+ (hU : IsClopen U) {x y : Y} (p : Path x y) : x ∈ U ↔ y ∈ U := by
+ have hxy : y ∈ connectedComponent x :=
+ pathComponent_subset_component x (show y ∈ pathComponent x from ⟨p⟩)
+ have hyx : x ∈ connectedComponent y :=
+ pathComponent_subset_component y (show x ∈ pathComponent y from ⟨p.symm⟩)
+ exact ⟨fun hx => hU.connectedComponent_subset hx hxy,
+ fun hy => hU.connectedComponent_subset hy hyx⟩
+
+/-- The D indicator is genuinely descended to the path-component quotient. -/
+def ElderTrap.componentInside (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) : ZerothHomotopy (superlevel_set g t) → Prop :=
+ ZerothHomotopy.lift (fun x => x.val ∈ D) (fun _ _ p =>
+ propext (elder_clopen_path_iff (T.active_clopen t ht) p))
+
+@[simp] theorem ElderTrap.componentInside_mk (T : ElderTrap g M P m d D)
+ {t : ℝ} (ht : elderActive m d t) (x : superlevel_set g t) :
+ T.componentInside ht (ZerothHomotopy.mk x) ↔ x.val ∈ D := Iff.rfl
+
+variable {k}
+
+/-- The actual singular-H0 point-class difference on an active level. -/
+def elderDifference (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) :
+ ModuleCat.of k k ⟶ (superlevel_h0Filtration g (ModuleCat.of k k)).obj t :=
+ ordinaryH0_pointClass (TopCat.of (superlevel_set g t)) (ModuleCat.of k k)
+ ⟨M, T.maximum_mem ht⟩ -
+ ordinaryH0_pointClass (TopCat.of (superlevel_set g t)) (ModuleCat.of k k)
+ ⟨P, T.older_mem ht⟩
+
+theorem elderDifference_map (T : ElderTrap g M P m d D) {s t : ℝ}
+ (hs : elderActive m d s) (ht : elderActive m d t) (hst : s ≤ t) :
+ elderDifference (k := k) T hs ≫
+ (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) =
+ elderDifference T ht := by
+ exact ordinaryH0_difference_map (ModuleCat.of k k)
+ (TopCat.ofHom (superlevel_inclusion g hst))
+ ⟨M, T.maximum_mem hs⟩ ⟨P, T.older_mem hs⟩
+
+theorem elderDifference_map_dead (T : ElderTrap g M P m d D) {s t : ℝ}
+ (hs : elderActive m d s) (ht : -d ≤ t) (hst : s ≤ t) :
+ elderDifference (k := k) T hs ≫
+ (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) = 0 := by
+ unfold elderDifference
+ erw [ordinaryH0_difference_map]
+ apply ordinaryH0_sameComponent_difference_zero
+ apply (superlevel_component_eq_iff_joinedIn g t _ _).2
+ exact T.closed_path.mono (superlevel_mono g ht)
+
+/-- The component indicator transported by the existing actual H0 comparison. -/
+def elderProjection (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) :
+ (superlevel_h0Filtration g (ModuleCat.of k k)).obj t ⟶ ModuleCat.of k k := by
+ classical
+ exact (ordinaryH0_filtrationIso g (ModuleCat.of k k)).hom.app t ≫
+ Sigma.desc (fun q => if T.componentInside ht q then 𝟙 _ else 0)
+
+theorem elderProjection_point (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) (x : superlevel_set g t) :
+ ordinaryH0_pointClass (TopCat.of (superlevel_set g t)) (ModuleCat.of k k) x ≫
+ elderProjection (k := k) T ht =
+ if x.val ∈ D then 𝟙 _ else 0 := by
+ classical
+ unfold elderProjection
+ erw [← Category.assoc]
+ erw [ordinaryH0_pointClass_iso]
+ erw [Sigma.ι_comp_desc]
+ rfl
+
+theorem elderDifference_projection (T : ElderTrap g M P m d D) {t : ℝ}
+ (ht : elderActive m d t) :
+ elderDifference (k := k) T ht ≫ elderProjection T ht = 𝟙 _ := by
+ classical
+ unfold elderDifference
+ erw [Preadditive.sub_comp,
+ elderProjection_point, elderProjection_point]
+ simp [T.maximum_inside, T.older_outside]
+
+def elderSectionApp (T : ElderTrap g M P m d D) (t : ℝ) :
+ (elderInterval k m d).obj t ⟶
+ (superlevel_h0Filtration g (ModuleCat.of k k)).obj t := by
+ classical
+ exact if ht : elderActive m d t then
+ ModuleCat.ofHom (elderFiber k m d t).subtype ≫ elderDifference T ht else 0
+
+def elderRetractionApp (T : ElderTrap g M P m d D) (t : ℝ) :
+ (superlevel_h0Filtration g (ModuleCat.of k k)).obj t ⟶
+ (elderInterval k m d).obj t := by
+ classical
+ exact if ht : elderActive m d t then
+ elderProjection T ht ≫ ModuleCat.ofHom (elderFiberLift k ht) else 0
+
+theorem elderSectionApp_naturality (T : ElderTrap g M P m d D) {s t : ℝ}
+ (hst : s ≤ t) :
+ (elderInterval k m d).map (homOfLE hst) ≫ elderSectionApp T t =
+ elderSectionApp T s ≫
+ (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) := by
+ classical
+ by_cases hs : elderActive m d s
+ · by_cases ht : elderActive m d t
+ · simp only [elderSectionApp, dite_eq_left hs, dite_eq_left ht]
+ erw [Category.assoc, elderDifference_map T hs ht hst, ← Category.assoc]
+ congr 1
+ ext x
+ change (if t < -d then x.val else 0) = x.val
+ simp [ht.2]
+ · have htd : -d ≤ t := by
+ by_contra h
+ exact ht ⟨hs.1.trans hst, lt_of_not_ge h⟩
+ simp only [elderSectionApp, dite_eq_left hs, dite_eq_right ht, comp_zero]
+ erw [Category.assoc, elderDifference_map_dead T hs htd hst, comp_zero]
+ · apply ModuleCat.hom_ext
+ apply LinearMap.ext
+ intro x
+ have hx : x = 0 := elderFiber_eq_zero k hs x
+ simp [hx]
+
+/-- Section from the interval to actual singular H0. -/
+def elderSection (T : ElderTrap g M P m d D) :
+ elderInterval k m d ⟶ superlevel_h0Filtration g (ModuleCat.of k k) where
+ app := elderSectionApp T
+ naturality := by
+ intro s t f
+ exact elderSectionApp_naturality T (leOfHom f)
+
+theorem elderProjection_naturality_active (T : ElderTrap g M P m d D) {s t : ℝ}
+ (hs : elderActive m d s) (ht : elderActive m d t) (hst : s ≤ t) :
+ (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫
+ elderProjection (k := k) T ht = elderProjection T hs := by
+ classical
+ apply ordinaryH0_hom_ext (TopCat.of (superlevel_set g s)) (ModuleCat.of k k)
+ intro x
+ erw [← Category.assoc]
+ erw [ordinaryH0_pointClass_map]
+ erw [elderProjection_point, elderProjection_point]
+ rfl
+
+/-- The birth-crossing square follows from the geometric height ceiling:
+there is no source point in D above m. It is not an assumed naturality field. -/
+theorem elderProjection_prebirth (T : ElderTrap g M P m d D) {s t : ℝ}
+ (hs : s < -m) (ht : elderActive m d t) (hst : s ≤ t) :
+ (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫
+ elderProjection (k := k) T ht = 0 := by
+ classical
+ apply ordinaryH0_hom_ext (TopCat.of (superlevel_set g s)) (ModuleCat.of k k)
+ intro x
+ erw [← Category.assoc]
+ erw [ordinaryH0_pointClass_map]
+ erw [elderProjection_point]
+ change (if x.val ∈ D then 𝟙 _ else 0) = _
+ have hx : x.val ∉ D := by
+ intro hx
+ have hceil := T.height_ceiling x.val hx
+ have hlevel : -s ≤ g x.val := x.property
+ linarith
+ simp only [ite_eq_right hx]
+ erw [comp_zero]
+
+theorem elderRetractionApp_naturality (T : ElderTrap g M P m d D) {s t : ℝ}
+ (hst : s ≤ t) :
+ (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫
+ elderRetractionApp T t =
+ elderRetractionApp T s ≫ (elderInterval k m d).map (homOfLE hst) := by
+ classical
+ by_cases ht : elderActive m d t
+ · by_cases hs : elderActive m d s
+ · simp only [elderRetractionApp, dite_eq_left hs, dite_eq_left ht]
+ apply ModuleCat.hom_ext
+ apply LinearMap.ext
+ intro x
+ apply Subtype.ext
+ change elderProjection T ht
+ ((superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) x) =
+ if t < -d then elderProjection T hs x else 0
+ rw [ite_eq_left ht.2]
+ have he := congrArg
+ (fun f : (superlevel_h0Filtration g (ModuleCat.of k k)).obj s ⟶
+ ModuleCat.of k k => f x)
+ (elderProjection_naturality_active (k := k) T hs ht hst)
+ exact he
+ · have hsm : s < -m := by
+ by_contra h
+ exact hs ⟨le_of_not_gt h, hst.trans_lt ht.2⟩
+ simp only [elderRetractionApp, dite_eq_right hs, dite_eq_left ht, zero_comp]
+ erw [← Category.assoc, elderProjection_prebirth T hsm ht hst, zero_comp]
+ · simp only [elderRetractionApp, dite_eq_right ht, comp_zero]
+ by_cases hs : elderActive m d s
+ · simp only [dite_eq_left hs]
+ have htd : ¬ t < -d := by
+ intro h
+ exact ht ⟨hs.1.trans hst, h⟩
+ apply ModuleCat.hom_ext
+ apply LinearMap.ext
+ intro x
+ apply Subtype.ext
+ change 0 = if t < -d then _ else 0
+ simp [htd]
+ · simp [hs]
+
+/-- Retraction from actual singular H0 to the interval, using component descent. -/
+def elderRetraction (T : ElderTrap g M P m d D) :
+ superlevel_h0Filtration g (ModuleCat.of k k) ⟶ elderInterval k m d where
+ app := elderRetractionApp T
+ naturality := by
+ intro s t f
+ exact elderRetractionApp_naturality T (leOfHom f)
+
+/-- The constructed section and retraction split the actual interval functor. -/
+@[reassoc (attr := simp)]
+theorem elderSection_retraction (T : ElderTrap g M P m d D) :
+ elderSection (k := k) T ≫ elderRetraction T = 𝟙 (elderInterval k m d) := by
+ classical
+ apply NatTrans.ext
+ funext t
+ change elderSectionApp (k := k) T t ≫ elderRetractionApp (k := k) T t = 𝟙 _
+ by_cases ht : elderActive m d t
+ · simp only [elderSectionApp, elderRetractionApp, dite_eq_left ht]
+ erw [Category.assoc, ← Category.assoc (elderDifference T ht),
+ elderDifference_projection, Category.id_comp]
+ ext x
+ rfl
+ · ext x
+ have hx : x = 0 := elderFiber_eq_zero k ht x
+ simp [hx]
+
+def elderKernelProjection (T : ElderTrap g M P m d D) :
+ superlevel_h0Filtration g (ModuleCat.of k k) ⟶ kernel (elderRetraction (k := k) T) :=
+ kernel.lift (elderRetraction T)
+ (𝟙 _ - elderRetraction T ≫ elderSection T) (by
+ erw [Preadditive.sub_comp, Category.id_comp, Category.assoc,
+ elderSection_retraction, Category.comp_id, sub_self])
+
+/-- An actual natural direct-sum isomorphism, not a postulated decomposition.
+Its maps are v ↦ (qv,v-jqv) and (c,w) ↦ jc+w. -/
+def elderDirectSummand (T : ElderTrap g M P m d D) :
+ superlevel_h0Filtration g (ModuleCat.of k k) ≅
+ elderInterval k m d ⊞ kernel (elderRetraction (k := k) T) where
+ hom := biprod.lift (elderRetraction T) (elderKernelProjection T)
+ inv := biprod.desc (elderSection T) (kernel.ι (elderRetraction T))
+ hom_inv_id := by
+ erw [biprod.lift_desc]
+ simp only [elderKernelProjection, kernel.lift_ι]
+ abel
+ inv_hom_id := by
+ apply biprod.hom_ext' <;> apply biprod.hom_ext
+ · simp [Category.assoc, elderSection_retraction]
+ · apply (cancel_mono (kernel.ι (elderRetraction T))).1
+ simp [Category.assoc, elderKernelProjection, Preadditive.comp_sub]
+ · simp
+ · apply (cancel_mono (kernel.ι (elderRetraction T))).1
+ simp [elderKernelProjection, Category.assoc, Preadditive.comp_sub]
+
+/-- Ordinary individual point classes remain nonzero; the dying section uses
+their difference. This is valid independently of characteristic. -/
+theorem elder_control_ordinary_point_survives (t : ℝ) (x : superlevel_set g t) :
+ ordinaryH0_pointClass (TopCat.of (superlevel_set g t)) (ModuleCat.of k k) x ≠ 0 := by
+ apply ordinaryH0_pointClass_ne_zero
+ intro h
+ have hl := congrArg ModuleCat.Hom.hom h
+ change (LinearMap.id : k →ₗ[k] k) = 0 at hl
+ exact one_ne_zero (LinearMap.congr_fun hl 1)
+
+end TorusFiltration
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/specifications/lean_statements_20261010/Specifications/Field.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/specifications/lean_statements_20261010/Specifications/Field.lean
new file mode 100644
index 000000000..cc40e9d19
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/specifications/lean_statements_20261010/Specifications/Field.lean
@@ -0,0 +1,380 @@
+import Mathlib
+
+/-!
+# Shared objects of the periodized Gaussian lifetime track (statements only)
+
+Scientific effect: NONE. Formal progress of every declaration here: `specified`.
+Organizational-independence credit of this transcription: 0 (Anthropic / Claude).
+
+This module declares, as definitions and interface structures, the objects that the
+Layer 0 texts of the lifetime track share: the periodized Gaussian covariance `K_L`
+(as a quotient of theta sums written with `tsum`), the centred stationary Gaussian field
+on the torus `R^d/(L Z^d)` (an interface: probability space, smooth `L`-periodic sample
+paths, Gaussian law of every finite real linear combination of point evaluations, and the
+covariance identity), critical points, the Hessian form through `iteratedFDeriv`, the
+inertia predicates for nondegenerate maxima and index-(d-1) saddles, ordered
+maximum/saddle pairs with their height gap and scaled gap, the superlevel H0 bar and
+elder-partner interface, and the per-unit-volume expected lifetime density "versions".
+
+What this module does not establish. It consists only of definitions and structures;
+it states nothing as a result and proves nothing. It does not construct the Gaussian
+field (the existence of a process with these finite-dimensional laws and smooth periodic
+sample paths is a hypothesis field), does not prove summability of the theta sums (a
+hypothesis field), does not identify the elder-partner relation with any Kac-Rice or
+persistence-module construction, does not show that lifetime density versions exist,
+does not assert almost-sure Morse genericity, and does not assert that an object
+satisfying an interface here coincides with the object of the source texts. Nothing here
+promotes, reclassifies or discharges any claim, premise or obligation of the registers;
+alignment of these statements with the sources is PENDING_INDEPENDENT_REVIEW.
+
+Primary source (Layer 0, byte-pinned): `d6g8k5htny-coder/Math-` commit
+`c39164254ad1529ed49543743598d5dcb24bab98`, path
+`imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md`,
+sha256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`
+(source id `lifetime-parent`).
+-/
+
+namespace UniversalLaw.Spec.Field
+
+open MeasureTheory
+
+/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised
+by `L`-periodic functions.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.
+Does not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/
+abbrev E (d : ℕ) : Type := EuclideanSpace ℝ (Fin d)
+
+/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: none.
+Does not claim: anything beyond the definition of the vector `L n`. -/
+noncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : E d :=
+ ∑ i, EuclideanSpace.single i (L * (n i : ℝ))
+
+/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,
+written as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;
+summability is a hypothesis field of `GaussianFieldInterface`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.
+Does not claim: convergence of the sum. -/
+noncomputable def thetaSum (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ ∑' n : Fin d → ℤ, Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2)
+
+/-- The periodized Gaussian covariance
+`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta
+sum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the
+summability field is meant to provide this; not shown here).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of both theta sums is the field `GaussianFieldInterface.summable`.
+Does not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/
+noncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ thetaSum d L z / thetaSum d L 0
+
+/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear
+combination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred
+stationary field with covariance `K_L`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.
+Does not claim: positive definiteness (Section 2 of the source). -/
+noncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) : ℝ :=
+ ∑ i, ∑ j, a i * a j * periodicCovariance d L (x i - x j)
+
+/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the defining predicate of a function on the torus.
+Does not claim: anything about the field. -/
+def IsLPeriodic (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ ∀ (x : E d) (n : Fin d → ℤ), g (x + latticeVec d L n) = g x
+
+/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "In particular the field has a smooth version and all finite moments of its global derivative suprema exist."
+Interface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.
+Does not claim: existence of a smooth version, or moment bounds on derivative suprema. -/
+def IsSmooth (d : ℕ) (g : E d → ℝ) : Prop :=
+ ∀ n : ℕ, ContDiff ℝ n g
+
+/-- Interface for the centred stationary Gaussian field of variance one on the torus
+`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample
+paths, their smoothness and periodicity, the Gaussian law of every finite real linear
+combination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic
+form) and the covariance identity are hypothesis fields, as is summability of the theta
+sums. Existence of such an object is not asserted.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: every field of this structure is a given property of the field, never derived.
+Does 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. -/
+structure GaussianFieldInterface (d : ℕ) (L : ℝ) where
+ /-- The underlying probability space (sample space). -/
+ Ω : Type
+ -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not
+ -- registered for typeclass resolution after this declaration; consumers bring it into
+ -- scope with `haveI := G.mΩ`.
+ [mΩ : MeasurableSpace Ω]
+ /-- The probability measure `P`. -/
+ P : Measure Ω
+ -- `P` is a probability measure (square-bracket field).
+ [isProb : IsProbabilityMeasure P]
+ /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/
+ F : Ω → E d → ℝ
+ /-- Section 2 clause: "the field has a smooth version"; every sample path is smooth. -/
+ smooth : ∀ ω, IsSmooth d (F ω)
+ /-- Section 1 clause: the field lives "On the flat torus X = R^d/(L Z^d)"; every sample path
+ is `L`-periodic. -/
+ periodic : ∀ ω, IsLPeriodic d L (F ω)
+ /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/
+ summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))
+ /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/
+ quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a
+ /-- Section 1 clause: "the centered stationary Gaussian field of variance one with covariance"
+ `K_L`; every finite real linear combination of point evaluations has the centred Gaussian
+ law whose variance is the `K_L`-quadratic form. -/
+ gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),
+ Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =
+ ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩
+ /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/
+ covariance : ∀ x y : E d, ∫ ω, F ω x * F ω y ∂P = periodicCovariance d L (x - y)
+
+/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet
+derivative: `hessian d g x v w = D^2 g(x)[v, w]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: symmetry of the form (true for `C^2` functions, not stated here). -/
+noncomputable def hessian (d : ℕ) (g : E d → ℝ) (x v w : E d) : ℝ :=
+ iteratedFDeriv ℝ 2 g x ![v, w]
+
+/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "grad f(M)=grad f(S)=0."
+Interface: none.
+Does not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/
+def IsCriticalPoint (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ fderiv ℝ g x = 0
+
+/-- Sylvester-inertia encoding of "the Hessian at `x` is nondegenerate with exactly `j`
+negative and `d - j` positive eigenvalues": there are complementary subspaces `V`, `W` of
+dimensions `j` and `d - j` on which the Hessian form is negative definite, respectively
+positive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)
+Hessians; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "The index counts negative eigenvalues."
+Interface: none.
+Does not claim: equivalence with an eigenvalue count for a non-symmetric form. -/
+def HessianHasInertia (d : ℕ) (g : E d → ℝ) (x : E d) (j : ℕ) : Prop :=
+ ∃ V W : Submodule ℝ (E d), IsCompl V W ∧
+ Module.finrank ℝ V = j ∧ Module.finrank ℝ W = d - j ∧
+ (∀ v ∈ V, v ≠ 0 → hessian d g x v v < 0) ∧
+ (∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)
+
+/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative
+eigenvalues (negative definite).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/
+def IsNondegMax (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x d
+
+/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one
+positive eigenvalue.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that such a saddle is a merging saddle of any superlevel bar. -/
+def IsIndexSaddle (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x (d - 1)
+
+/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinM (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ -((r / 2) • u)
+
+/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinS (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ (r / 2) • u
+
+/-- Torus distance between two points of `R^d`: the infimum over the lattice of
+`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the
+same torus point; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: that the height gap of an elder pair is the persistence of a bar in any persistence module. -/
+def heightGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=
+ g M - g S
+
+/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: positivity of the height gap (added separately where the source requires it). -/
+def IsCandidatePair (d : ℕ) (L : ℝ) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S
+
+/-- Morse genericity with distinct critical values on the torus: every critical point is
+nondegenerate (has some inertia) and critical points at distinct torus positions have
+distinct critical values.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Countable exhaustion now proves that Q is almost surely Morse with distinct critical values."
+Interface: none; used only as a hypothesis of the elder-partner interface clause.
+Does not claim: that sample paths are almost surely Morse (Section 8 of the source). -/
+def IsMorseDistinct (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ (∀ x : E d, IsCriticalPoint d g x → ∃ j : ℕ, HessianHasInertia d g x j) ∧
+ (∀ x y : E d, IsCriticalPoint d g x → IsCriticalPoint d g y →
+ 0 < torusDist d L x y → g x ≠ g y)
+
+/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:
+the maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary
+elder death partner relation. These are GIVEN relations; the fields transcribe the source
+clauses that characterise them on smooth periodic functions, and the elder relation is
+pinned only on the Morse distinct-value locus, exactly as the source does.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint."
+Interface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.
+Does 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. -/
+structure SuperlevelBarInterface (d : ℕ) (L : ℝ) where
+ /-- Section 8 clause: the maximin connection level
+ `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/
+ deathHeight : (E d → ℝ) → E d → ℝ
+ /-- The essential class: the global maximum, which "has no older endpoint" and whose
+ superlevel H0 bar is not finite. -/
+ IsEssential : (E d → ℝ) → E d → Prop
+ /-- Section 1 clause: "the global ordinary superlevel elder death partner of M is S". -/
+ ElderPartner : (E d → ℝ) → E d → E d → Prop
+ /-- `M` is essential exactly when no point is strictly higher (so the supremum in the
+ maximin is over an empty set, "equal to -infinity"). -/
+ essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M
+ /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly
+ higher point stays strictly above `h`. -/
+ deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,
+ h < deathHeight g M ↔
+ ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)
+ /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, "equality
+ d_f(M)=f(S)" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle "expresses
+ ordinary elder death at S". -/
+ elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →
+ ∀ M S : E d, ElderPartner g M S ↔
+ (IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)
+
+/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`
+(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus
+distance. The essential global-maximum class is excluded because `ElderPartner` requires
+`¬ IsEssential` on the Morse locus.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death."
+Interface: `I : SuperlevelBarInterface d L` is given.
+Does 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. -/
+def IsFiniteBar (d : ℕ) (L : ℝ) (I : SuperlevelBarInterface d L) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S
+
+/-- The set of pairs of a population `Pair` with both points in the fundamental domain and
+lifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of this set (a field of the density-version predicate). -/
+def pairSet (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop) (g : E d → ℝ) (A : Set ℝ) :
+ Set (E d × E d) :=
+ {p | p.1 ∈ FundDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}
+
+/-- Number of pairs of the population with lifetime in `A` and base points in the
+fundamental domain (`Set.ncard`, which is `0` for an infinite set).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of the counted set. -/
+noncomputable def pairCount (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop)
+ (g : E d → ℝ) (A : Set ℝ) : ℕ :=
+ Set.ncard (pairSet d L Pair g A)
+
+/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population
+`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost
+surely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and
+`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.
+The source's densities are only defined up to such versions. The sigma-algebra of the sample
+space is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket
+field of a bundled record is not registered for typeclass resolution after the declaration).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "These densities admit versions with"
+Interface: 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.
+Does 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. -/
+def IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (Pair : (E d → ℝ) → E d → E d → Prop) (ν : ℝ → ℝ) : Prop :=
+ haveI := G.mΩ
+ (∀ ℓ : ℝ, 0 ≤ ν ℓ) ∧ Measurable ν ∧
+ (∀ A : Set ℝ, MeasurableSet A → A ⊆ Set.Ioi 0 →
+ (∀ᵐ ω ∂G.P, (pairSet d L Pair (G.F ω) A).Finite) ∧
+ Integrable (fun ω => ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ)) G.P ∧
+ IntegrableOn ν A ∧
+ ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)
+
+end UniversalLaw.Spec.Field
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1.lean
new file mode 100644
index 000000000..770dec720
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1.lean
@@ -0,0 +1,13 @@
+import ResearchFormalCoreR1.AlgebraV2
+import ResearchFormalCoreR1.ProbabilityCompanionsV2
+import ResearchFormalCoreR1.DeterminantMoment
+import ResearchFormalCoreR1.GaussianScalarMoments
+import ResearchFormalCoreR1.GaussianJetMoments
+import ResearchFormalCoreR1.GaussianNormalizer
+import ResearchFormalCoreR1.GaussianRegressionKernel
+import ResearchFormalCoreR1.EndpointGaussianMoments
+import ResearchFormalCoreR1.NormalizerFloor
+import ResearchFormalCoreR1.EndpointNormalizerBridge
+import ResearchFormalCoreR1.GaussianCoupling
+import ResearchFormalCoreR1.GaussianNormalizerLimit
+import ResearchFormalCoreR1.PalmReweighting
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/AlgebraV2.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/AlgebraV2.lean
new file mode 100644
index 000000000..768d0bab9
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/AlgebraV2.lean
@@ -0,0 +1,53 @@
+import Mathlib.Basic.Real.Basic
+import Mathlib.Tactic.FieldSimp
+import Mathlib.Tactic.Ring
+import Mathlib.Tactic.NormNum
+
+namespace ResearchFormalCoreR1
+
+set_option autoImplicit false
+
+/-- Canonical A₂ normal-form potential, parameterized by `s` with λ = s². -/
+noncomputable def foldPotential (s x : ℝ) : ℝ := -(x ^ 3) / 3 + (s ^ 2) * x
+
+/-- EC-005: exact canonical fold-gap identity in the normalized coordinate. -/
+theorem ec005_fold_gap (s : ℝ) :
+ foldPotential s s - foldPotential s (-s) = (2 * s) ^ 3 / 6 := by
+ unfold foldPotential
+ ring
+
+/-- EC-008: scalar polynomial companion for the planar collision-Gram determinant.
+ This is not the matrix-construction theorem. -/
+theorem ec008_factor_expansion (c s : ℝ) :
+ 2 * s ^ 2 *
+ ((s ^ 2 * (3 * c ^ 4 + 3 * c ^ 2 * s ^ 2 + s ^ 4) / 24) *
+ (s ^ 2 * (4 * c ^ 2 + s ^ 2) / 2) -
+ (-c * s ^ 2 * (2 * c ^ 2 + s ^ 2) / 4) ^ 2) =
+ s ^ 8 * (c ^ 2 + s ^ 2) * (3 * c ^ 2 + s ^ 2) / 24 := by
+ ring
+
+/-- EC-010, generic chart: declared convex-combination polynomial identity. -/
+theorem ec010_generic (α K c η : ℝ) :
+ (K + 8 * α * c * η) ^ 2 + 64 * α * (1 - α) * c ^ 2 * η ^ 2 =
+ (1 - α) * K ^ 2 + α * (K + 8 * c * η) ^ 2 := by
+ ring
+
+/-- EC-010, transverse chart: declared convex-combination polynomial identity. -/
+theorem ec010_transverse (α a η : ℝ) :
+ (a + (1 - 2 * α) * η) ^ 2 + 4 * α * (1 - α) * η ^ 2 =
+ (1 - α) * (a + η) ^ 2 + α * (a - η) ^ 2 := by
+ ring
+
+/-- EC-011: scalar cancellation companion to the adjoint-orbit calculation.
+ It does not formalize the ODE, Hessian symmetry, or section normalization. -/
+theorem ec011_scalar_cancellation (h w g : ℝ) :
+ (-h * w) * g + w * (h * g) = 0 := by
+ ring
+
+/-- EC-014: exact contact-power scalar identity for nonzero separation.
+ It does not formalize the six-pin matrix determinant or density transform. -/
+theorem ec014_contact_power (r : ℝ) (hr : r ≠ 0) :
+ (r ^ 3 / 6) * (1 / r ^ 5) * r ^ 2 = (1 / 6 : ℝ) := by
+ field_simp [hr]
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/DeterminantMoment.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/DeterminantMoment.lean
new file mode 100644
index 000000000..93e296ca1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/DeterminantMoment.lean
@@ -0,0 +1,218 @@
+import Mathlib.MeasureTheory.Integral.Bochner.Basic
+import Mathlib.LinearAlgebra.Matrix.Determinant.Basic
+import Mathlib.Topology.Instances.Matrix
+import Mathlib.MeasureTheory.Order.Group.Lattice
+import Mathlib.Tactic.FieldSimp
+import Mathlib.Tactic.Ring
+import Mathlib.Tactic.NormNum
+import Mathlib.Tactic.Positivity
+import Mathlib.Tactic.Linarith
+import Mathlib.Tactic.FinCases
+import Mathlib.Tactic.FunProp
+import Mathlib.Tactic.Push
+
+namespace ResearchFormalCoreR1
+
+set_option autoImplicit false
+
+open MeasureTheory
+open scoped BigOperators
+
+abbrev DM2Jet := Fin 9 → ℝ
+
+def dm2Radius (j : DM2Jet) : ℝ := 1 + ∑ i, |j i|
+
+noncomputable def dm2HM (r : ℝ) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) ℝ :=
+ !![-r + r^2*j 4/12, -j 1*r/2 + r^2*j 5/12;
+ -j 1*r/2 + r^2*j 5/12, j 0-r*j 2/2+r^2*j 6/8]
+
+noncomputable def dm2HS (r : ℝ) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) ℝ :=
+ !![r + r^2*j 4/12, j 1*r/2 + r^2*j 5/12;
+ j 1*r/2 + r^2*j 5/12, j 0+r*j 2/2+r^2*j 6/8]
+
+/-- The source's negative-definite condition, stated as the quadratic form. -/
+def dm2Negative (H : Matrix (Fin 2) (Fin 2) ℝ) : Prop :=
+ ∀ v : Fin 2 → ℝ, v ≠ 0 → ∑ i, ∑ k, v i * H i k * v k < 0
+
+noncomputable def dm2Weight (r : ℝ) (j : DM2Jet) : ℝ := by
+ classical
+ exact if dm2Negative (dm2HM r j) ∧ (dm2HS r j).det < 0 then
+ |(dm2HM r j).det * (dm2HS r j).det| else 0
+
+private lemma dm2_scale (r x : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1) :
+ |r*x| ≤ |x| := by
+ rw [abs_mul, abs_of_nonneg hr]
+ nlinarith [abs_nonneg x]
+
+private lemma dm2_factors (r A B C R : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1)
+ (hR : 0 ≤ R) (hA : |A| ≤ R) (hB : |B| ≤ R) (hC : |C| ≤ R) :
+ |A*C-r*B^2| ≤ 2*R^2 := by
+ have hAC : |A*C| ≤ R^2 := by
+ rw [abs_mul, pow_two]
+ exact mul_le_mul hA hC (abs_nonneg _) hR
+ have hBB : B^2 ≤ R^2 := by nlinarith [sq_abs B, abs_nonneg B]
+ have hrBB : |r*B^2| ≤ R^2 := by
+ rw [abs_of_nonneg (mul_nonneg hr (sq_nonneg B))]
+ nlinarith [sq_nonneg B]
+ exact (abs_sub _ _).trans (by linarith)
+
+/-- Exact untyped determinant domination; no jet-coordinate or type assumptions. -/
+theorem dm2_untyped (r : ℝ) (j : DM2Jet) (hr : 0 < r) (hr1 : r ≤ 1) :
+ ((dm2HM r j).det * (dm2HS r j).det)^2 ≤ 16*r^4*dm2Radius j^8 := by
+ let R := dm2Radius j
+ have hR : 0 ≤ R := by dsimp [R, dm2Radius]; positivity
+ have hsum : (∑ i, |j i|) = |j 0|+|j 1|+|j 2|+|j 3|+|j 4|+|j 5|+|j 6|+|j 7|+|j 8| := by
+ simp [Fin.sum_univ_succ]; ring
+ have hbudget : 1+|j 0|+|j 1|+|j 2|+|j 4|+|j 5|+|j 6| ≤ R := by
+ dsimp [R, dm2Radius]; rw [hsum]
+ linarith [abs_nonneg (j 3), abs_nonneg (j 7), abs_nonneg (j 8)]
+ have hscale (i : Fin 9) : r*|j i| ≤ |j i| := by nlinarith [abs_nonneg (j i)]
+ have hscale2 (i : Fin 9) : r^2*|j i| ≤ |j i| := by
+ exact mul_le_of_le_one_left (abs_nonneg _) (by nlinarith)
+ have haM : |-1+r*j 4/12| ≤ R := by
+ calc
+ _ ≤ 1+|j 4| := by
+ have := abs_add_le (-1 : ℝ) (r*j 4/12)
+ rw [abs_div] at this
+ norm_num [abs_of_pos hr] at this
+ linarith [hscale 4, abs_nonneg (j 4)]
+ _ ≤ R := by linarith [abs_nonneg (j 0), abs_nonneg (j 1), abs_nonneg (j 2), abs_nonneg (j 5), abs_nonneg (j 6)]
+ have haS : |1+r*j 4/12| ≤ R := by
+ have := abs_add_le (1 : ℝ) (r*j 4/12)
+ rw [abs_div] at this
+ norm_num [abs_of_pos hr] at this
+ linarith [hscale 4, abs_nonneg (j 0), abs_nonneg (j 1), abs_nonneg (j 2), abs_nonneg (j 4), abs_nonneg (j 5), abs_nonneg (j 6)]
+ have hbM : |-j 1/2+r*j 5/12| ≤ R := by
+ have := abs_add_le (-j 1/2) (r*j 5/12)
+ simp only [abs_div, abs_neg] at this
+ norm_num [abs_of_pos hr] at this
+ linarith [hscale 5, abs_nonneg (j 0), abs_nonneg (j 1), abs_nonneg (j 2), abs_nonneg (j 4), abs_nonneg (j 5), abs_nonneg (j 6)]
+ have hbS : |j 1/2+r*j 5/12| ≤ R := by
+ have := abs_add_le (j 1/2) (r*j 5/12)
+ simp only [abs_div] at this
+ norm_num [abs_of_pos hr] at this
+ linarith [hscale 5, abs_nonneg (j 0), abs_nonneg (j 1), abs_nonneg (j 2), abs_nonneg (j 4), abs_nonneg (j 5), abs_nonneg (j 6)]
+ have hcM : |j 0-r*j 2/2+r^2*j 6/8| ≤ R := by
+ have h1 := abs_sub (j 0) (r*j 2/2)
+ have h2 := abs_add_le (j 0-r*j 2/2) (r^2*j 6/8)
+ simp only [abs_div] at h1 h2
+ norm_num [abs_of_pos hr] at h1 h2
+ linarith [hscale 2, hscale2 6, abs_nonneg (j 1), abs_nonneg (j 2), abs_nonneg (j 4), abs_nonneg (j 5), abs_nonneg (j 6)]
+ have hcS : |j 0+r*j 2/2+r^2*j 6/8| ≤ R := by
+ have h1 := abs_add_le (j 0) (r*j 2/2)
+ have h2 := abs_add_le (j 0+r*j 2/2) (r^2*j 6/8)
+ simp only [abs_div] at h1 h2
+ norm_num [abs_of_pos hr] at h1 h2
+ linarith [hscale 2, hscale2 6, abs_nonneg (j 1), abs_nonneg (j 2), abs_nonneg (j 4), abs_nonneg (j 5), abs_nonneg (j 6)]
+ have hM := dm2_factors r _ _ _ R hr.le hr1 hR haM hbM hcM
+ have hS := dm2_factors r _ _ _ R hr.le hr1 hR haS hbS hcS
+ have hprod : |((-1+r*j 4/12)*(j 0-r*j 2/2+r^2*j 6/8)-r*(-j 1/2+r*j 5/12)^2) *
+ ((1+r*j 4/12)*(j 0+r*j 2/2+r^2*j 6/8)-r*(j 1/2+r*j 5/12)^2)| ≤ (2*R^2)^2 := by
+ rw [abs_mul]
+ calc
+ _ ≤ (2*R^2)*(2*R^2) := mul_le_mul hM hS (abs_nonneg _) (by positivity)
+ _ = (2*R^2)^2 := (pow_two _).symm
+ have hsquare : (((-1+r*j 4/12)*(j 0-r*j 2/2+r^2*j 6/8)-r*(-j 1/2+r*j 5/12)^2) *
+ ((1+r*j 4/12)*(j 0+r*j 2/2+r^2*j 6/8)-r*(j 1/2+r*j 5/12)^2))^2 ≤ ((2*R^2)^2)^2 := by
+ simpa only [sq_abs] using
+ (sq_le_sq₀ (abs_nonneg _) (sq_nonneg (2*R^2))).2 hprod
+ have hid : ((dm2HM r j).det*(dm2HS r j).det)^2 = r^4 *
+ (((-1+r*j 4/12)*(j 0-r*j 2/2+r^2*j 6/8)-r*(-j 1/2+r*j 5/12)^2) *
+ ((1+r*j 4/12)*(j 0+r*j 2/2+r^2*j 6/8)-r*(j 1/2+r*j 5/12)^2))^2 := by
+ simp [dm2HM, dm2HS, Matrix.det_fin_two]; ring
+ rw [hid]
+ calc
+ _ ≤ r^4*((2*R^2)^2)^2 := mul_le_mul_of_nonneg_left hsquare (by positivity)
+ _ = 16*r^4*dm2Radius j^8 := by dsimp [R]; ring
+
+/-- P02-LM-002 section 2, with the literal quadratic-form type indicator. -/
+theorem dm2_pointwise (r : ℝ) (j : DM2Jet) (hr : 0 < r) (hr1 : r ≤ 1) :
+ dm2Weight r j ^ 2 ≤ 16*r^4*dm2Radius j^8 := by
+ classical
+ unfold dm2Weight
+ split_ifs
+ · simpa only [sq_abs] using dm2_untyped r j hr hr1
+ · simpa only [zero_pow (by decide : (2 : ℕ) ≠ 0)] using
+ (show 0 ≤ 16*r^4*dm2Radius j^8 by positivity)
+
+/-- Two-dimensional Sylvester criterion for the literal quadratic-form definition. -/
+theorem dm2_negative_iff (a b c : ℝ) :
+ dm2Negative !![a,b;b,c] ↔ a < 0 ∧ 0 < a*c-b^2 := by
+ constructor
+ · intro h
+ have ha := h ![1,0] (by simp)
+ simp [Fin.sum_univ_two] at ha
+ have hv : (![(-b),a] : Fin 2 → ℝ) ≠ 0 := by
+ intro heq
+ have := congrFun heq 1
+ simp at this
+ linarith
+ have hd := h ![-b,a] hv
+ simp [Fin.sum_univ_two] at hd
+ refine ⟨ha, ?_⟩
+ by_contra hn
+ have hh : 0 ≤ a*(a*c-b^2) := mul_nonneg_of_nonpos_of_nonpos ha.le (le_of_not_gt hn)
+ nlinarith
+ · rintro ⟨ha,hd⟩ v hv
+ have hvxy : v 0 ≠ 0 ∨ v 1 ≠ 0 := by
+ by_contra hn
+ push Not at hn
+ apply hv
+ ext i
+ fin_cases i <;> simp_all
+ have hq : 0 < (a*v 0+b*v 1)^2+(a*c-b^2)*(v 1)^2 := by
+ rcases eq_or_ne (v 1) 0 with hy|hy
+ · have hx : v 0 ≠ 0 := hvxy.resolve_right (not_ne_iff.mpr hy)
+ simpa [hy] using sq_pos_of_ne_zero (mul_ne_zero ha.ne hx)
+ · exact add_pos_of_nonneg_of_pos (sq_nonneg _) (mul_pos hd (sq_pos_of_ne_zero hy))
+ simp [Fin.sum_univ_two]
+ nlinarith
+
+/-- Measurability of the exact typed weight, with no assumed type-null boundary. -/
+theorem dm2_weight_measurable (r : ℝ) : Measurable (dm2Weight r) := by
+ classical
+ have hm : Continuous (fun j : DM2Jet => (dm2HM r j).det) := by
+ simp only [dm2HM, Matrix.det_fin_two]
+ fun_prop
+ have hs : Continuous (fun j : DM2Jet => (dm2HS r j).det) := by
+ simp only [dm2HS, Matrix.det_fin_two]
+ fun_prop
+ have htype : MeasurableSet {j : DM2Jet | dm2Negative (dm2HM r j) ∧ (dm2HS r j).det < 0} := by
+ simp only [dm2HM, dm2_negative_iff]
+ apply MeasurableSet.inter
+ · apply MeasurableSet.inter
+ · have h : Continuous (fun j : DM2Jet => -r+r^2*j 4/12) := by fun_prop
+ exact (isOpen_lt h continuous_const).measurableSet
+ · have h : Continuous (fun j : DM2Jet => (-r+r^2*j 4/12)*(j 0-r*j 2/2+r^2*j 6/8)-(-j 1*r/2+r^2*j 5/12)^2) := by fun_prop
+ exact (isOpen_lt continuous_const h).measurableSet
+ · exact (isOpen_lt hs continuous_const).measurableSet
+ change Measurable (fun j : DM2Jet => if dm2Negative (dm2HM r j) ∧ (dm2HS r j).det < 0 then |(dm2HM r j).det*(dm2HS r j).det| else 0)
+ exact Measurable.ite htype (hm.measurable.mul hs.measurable).abs measurable_const
+
+/-- P02-LM-002's expectation step: eighth-moment control supplies integrability
+and the second moment, rather than presupposing that second moment. -/
+theorem dm2_moment {Ω : Type*} [MeasurableSpace Ω] (μ : MeasureTheory.Measure Ω)
+ (J : Ω → DM2Jet) (hJ : Measurable J) (r M8 : ℝ) (hr : 0 < r) (hr1 : r ≤ 1)
+ (h8 : MeasureTheory.Integrable (fun x => dm2Radius (J x)^8) μ)
+ (hM8 : (∫ x, dm2Radius (J x)^8 ∂μ) ≤ M8) :
+ MeasureTheory.Integrable (fun x => dm2Weight r (J x)^2) μ ∧
+ (∫ x, dm2Weight r (J x)^2 ∂μ) ≤ 16*M8*r^4 := by
+ have hmajor : MeasureTheory.Integrable (fun x => 16*r^4*dm2Radius (J x)^8) μ :=
+ h8.const_mul _
+ have hmeas : MeasureTheory.AEStronglyMeasurable (fun x => dm2Weight r (J x)^2) μ :=
+ (((dm2_weight_measurable r).comp hJ).pow_const 2).aestronglyMeasurable
+ have hi : MeasureTheory.Integrable (fun x => dm2Weight r (J x)^2) μ :=
+ hmajor.mono' hmeas (Filter.Eventually.of_forall (fun x => by
+ rw [Real.norm_eq_abs, abs_of_nonneg (sq_nonneg _)]
+ exact dm2_pointwise r (J x) hr hr1))
+ refine ⟨hi, ?_⟩
+ calc
+ _ ≤ ∫ x, 16*r^4*dm2Radius (J x)^8 ∂μ :=
+ MeasureTheory.integral_mono hi hmajor (fun x => dm2_pointwise r (J x) hr hr1)
+ _ = 16*r^4*(∫ x, dm2Radius (J x)^8 ∂μ) := MeasureTheory.integral_const_mul _ _
+ _ ≤ 16*r^4*M8 := mul_le_mul_of_nonneg_left hM8 (by positivity)
+ _ = 16*M8*r^4 := by ring
+
+end ResearchFormalCoreR1
+
+
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointGaussianMoments.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointGaussianMoments.lean
new file mode 100644
index 000000000..7683112b1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointGaussianMoments.lean
@@ -0,0 +1,139 @@
+import ResearchFormalCoreR1.GaussianJetMoments
+
+/-! Gaussian moments for the six actual normalized endpoint entries from
+GP-DER-047 section 13. Coordinates are (fxx(M)/r,fxy(M)/r,fyy(M),
+fxx(S)/r,fxy(S)/r,fyy(S)); no polynomial midpoint-jet identity is assumed. -/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory ProbabilityTheory
+open scoped BigOperators NNReal
+
+set_option autoImplicit false
+
+def egm_HM (r : ℝ) (j : Fin 6 → ℝ) : Matrix (Fin 2) (Fin 2) ℝ :=
+ !![r * j 0, r * j 1; r * j 1, j 2]
+
+def egm_HS (r : ℝ) (j : Fin 6 → ℝ) : Matrix (Fin 2) (Fin 2) ℝ :=
+ !![r * j 3, r * j 4; r * j 4, j 5]
+
+noncomputable def egm_weight (r : ℝ) (j : Fin 6 → ℝ) : ℝ := by
+ classical
+ exact if dm2Negative (egm_HM r j) ∧ (egm_HS r j).det < 0 then
+ |(egm_HM r j).det * (egm_HS r j).det| else 0
+
+/-- The maximum condition is the original strict quadratic-form condition;
+no null-boundary assumption is needed for measurable typing. -/
+theorem egm_weight_measurable (r : ℝ) : Measurable (egm_weight r) := by
+ classical
+ have hm : Continuous (fun j : Fin 6 → ℝ => (egm_HM r j).det) := by
+ simp only [egm_HM, Matrix.det_fin_two]
+ fun_prop
+ have hs : Continuous (fun j : Fin 6 → ℝ => (egm_HS r j).det) := by
+ simp only [egm_HS, Matrix.det_fin_two]
+ fun_prop
+ have htype : MeasurableSet {j : Fin 6 → ℝ |
+ dm2Negative (egm_HM r j) ∧ (egm_HS r j).det < 0} := by
+ simp only [egm_HM, dm2_negative_iff]
+ apply MeasurableSet.inter
+ · apply MeasurableSet.inter
+ · have h : Continuous (fun j : Fin 6 → ℝ => r * j 0) := by fun_prop
+ exact (isOpen_lt h continuous_const).measurableSet
+ · have h : Continuous (fun j : Fin 6 → ℝ =>
+ (r * j 0) * j 2 - (r * j 1) ^ 2) := by fun_prop
+ exact (isOpen_lt continuous_const h).measurableSet
+ · exact (isOpen_lt hs continuous_const).measurableSet
+ change Measurable (fun j => if dm2Negative (egm_HM r j) ∧ (egm_HS r j).det < 0
+ then |(egm_HM r j).det * (egm_HS r j).det| else 0)
+ exact Measurable.ite htype (hm.measurable.mul hs.measurable).abs measurable_const
+
+private theorem egm_coordinate_bound (j : Fin 6 → ℝ) (i : Fin 6) :
+ |j i| ≤ gm8Radius j := by
+ have hsum : |j i| ≤ ∑ k, |j k| :=
+ Finset.single_le_sum (fun k _ => abs_nonneg (j k)) (Finset.mem_univ i)
+ unfold gm8Radius
+ linarith
+
+private theorem egm_factor_bound (r a b c R : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1)
+ (hR : 0 ≤ R) (ha : |a| ≤ R) (hb : |b| ≤ R) (hc : |c| ≤ R) :
+ |a * c - r * b ^ 2| ≤ 2 * R ^ 2 := by
+ have hac : |a * c| ≤ R ^ 2 := by
+ rw [abs_mul, pow_two]
+ exact mul_le_mul ha hc (abs_nonneg c) hR
+ have hbb : b ^ 2 ≤ R ^ 2 := by nlinarith [sq_abs b, abs_nonneg b]
+ have hrbb : |r * b ^ 2| ≤ R ^ 2 := by
+ rw [abs_of_nonneg (mul_nonneg hr (sq_nonneg b))]
+ exact (mul_le_of_le_one_left (sq_nonneg b) hr1).trans hbb
+ exact (abs_sub _ _).trans (by linarith)
+
+private theorem egm_untyped (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :
+ ((egm_HM r j).det * (egm_HS r j).det) ^ 2 ≤
+ 16 * r ^ 4 * gm8Radius j ^ 8 := by
+ let R := gm8Radius j
+ let dM := j 0 * j 2 - r * j 1 ^ 2
+ let dS := j 3 * j 5 - r * j 4 ^ 2
+ have hR : 0 ≤ R := by dsimp [R, gm8Radius]; positivity
+ have hM : |dM| ≤ 2 * R ^ 2 :=
+ egm_factor_bound r _ _ _ R hr.le hr1 hR
+ (egm_coordinate_bound j 0) (egm_coordinate_bound j 1) (egm_coordinate_bound j 2)
+ have hS : |dS| ≤ 2 * R ^ 2 :=
+ egm_factor_bound r _ _ _ R hr.le hr1 hR
+ (egm_coordinate_bound j 3) (egm_coordinate_bound j 4) (egm_coordinate_bound j 5)
+ have hprod : |dM * dS| ≤ (2 * R ^ 2) ^ 2 := by
+ rw [abs_mul, pow_two]
+ exact mul_le_mul hM hS (abs_nonneg _) (by positivity)
+ have hsq : (dM * dS) ^ 2 ≤ ((2 * R ^ 2) ^ 2) ^ 2 := by
+ simpa only [sq_abs] using
+ (sq_le_sq₀ (abs_nonneg (dM * dS)) (sq_nonneg (2 * R ^ 2))).2 hprod
+ have hdet : ((egm_HM r j).det * (egm_HS r j).det) ^ 2 =
+ r ^ 4 * (dM * dS) ^ 2 := by
+ simp [egm_HM, egm_HS, Matrix.det_fin_two, dM, dS]
+ ring
+ calc
+ _ = r ^ 4 * (dM * dS) ^ 2 := hdet
+ _ ≤ r ^ 4 * ((2 * R ^ 2) ^ 2) ^ 2 :=
+ mul_le_mul_of_nonneg_left hsq (by positivity)
+ _ = 16 * r ^ 4 * gm8Radius j ^ 8 := by dsimp [R]; ring
+
+/-- Exact endpoint determinant domination in the actual normalized six-vector.
+The type indicators can only reduce the nonnegative determinant product. -/
+theorem egm_pointwise (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :
+ egm_weight r j ^ 2 ≤ 16 * r ^ 4 * gm8Radius j ^ 8 := by
+ classical
+ unfold egm_weight
+ split_ifs
+ · simpa only [sq_abs] using egm_untyped r j hr hr1
+ · simpa only [zero_pow (by decide : (2 : ℕ) ≠ 0)] using
+ (show 0 ≤ 16 * r ^ 4 * gm8Radius j ^ 8 by positivity)
+
+/-- Genuine Gaussian marginal laws of the actual normalized endpoint vector
+supply both integrability and its determinant second moment. The derivative-map,
+conditioning law and uniform parameter bounds remain explicit model inputs. -/
+theorem egm_gaussian_moment {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → Fin 6 → ℝ)
+ (hJ : Measurable J) (m : Fin 6 → ℝ) (v : Fin 6 → ℝ≥0)
+ (B V r : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V) (hr : 0 < r) (hr1 : r ≤ 1)
+ (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)
+ (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :
+ Integrable (fun x => egm_weight r (J x) ^ 2) μ ∧
+ (∫ x, egm_weight r (J x) ^ 2 ∂μ) ≤ 16 * gm8FiniteM8 6 B V * r ^ 4 := by
+ obtain ⟨h8, hbound⟩ := gm8_finite_integrable_bound 6 μ J hJ m v B V hB hV
+ hmean hvar hlaw
+ have hmajor : Integrable (fun x => 16 * r ^ 4 * gm8Radius (J x) ^ 8) μ :=
+ h8.const_mul _
+ have hmeas : AEStronglyMeasurable (fun x => egm_weight r (J x) ^ 2) μ :=
+ (((egm_weight_measurable r).comp hJ).pow_const 2).aestronglyMeasurable
+ have hi : Integrable (fun x => egm_weight r (J x) ^ 2) μ :=
+ hmajor.mono' hmeas (Filter.Eventually.of_forall (fun x => by
+ rw [Real.norm_eq_abs, abs_of_nonneg (sq_nonneg _)]
+ exact egm_pointwise r (J x) hr hr1))
+ refine ⟨hi, ?_⟩
+ calc
+ _ ≤ ∫ x, 16 * r ^ 4 * gm8Radius (J x) ^ 8 ∂μ :=
+ integral_mono hi hmajor (fun x => egm_pointwise r (J x) hr hr1)
+ _ = 16 * r ^ 4 * (∫ x, gm8Radius (J x) ^ 8 ∂μ) := integral_const_mul _ _
+ _ ≤ 16 * r ^ 4 * gm8FiniteM8 6 B V :=
+ mul_le_mul_of_nonneg_left hbound (by positivity)
+ _ = 16 * gm8FiniteM8 6 B V * r ^ 4 := by ring
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointNormalizerBridge.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointNormalizerBridge.lean
new file mode 100644
index 000000000..73d861b7e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointNormalizerBridge.lean
@@ -0,0 +1,191 @@
+import ResearchFormalCoreR1.EndpointGaussianMoments
+import ResearchFormalCoreR1.NormalizerFloor
+
+/-!
+# Literal endpoint weight and continuous normalized weight
+
+The actual endpoint vector has order `(aM,bM,cM,aS,bS,cS)`, while the
+continuous normalizer uses `(aM,aS,bM,bS,cM,cS)`. The permutation below
+and the identity hold pointwise, including all determinant/type boundaries.
+See ../SOURCE_ENDPOINT_NORMALIZER_BRIDGE.md for the frozen source contract.
+-/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory ProbabilityTheory Filter
+open scoped Topology NNReal
+
+set_option autoImplicit false
+
+/-- Convert the actual six endpoint entries to the continuous weight's order. -/
+def enb_permutation (j : Fin 6 → ℝ) : Fin 6 → ℝ :=
+ ![j 0, j 3, j 1, j 4, j 2, j 5]
+
+theorem enb_permutation_continuous : Continuous enb_permutation := by
+ unfold enb_permutation
+ fun_prop
+
+private theorem enb_maximum_factor (r a b c : ℝ) (hr : 0 < r) :
+ max (max (-a) 0 * max (-c) 0 - r * b ^ 2) 0 =
+ if a < 0 ∧ 0 < a * c - r * b ^ 2 then a * c - r * b ^ 2 else 0 := by
+ by_cases h : a < 0 ∧ 0 < a * c - r * b ^ 2
+ · have hc : c < 0 := by
+ by_contra hn
+ have hac : a * c ≤ 0 := mul_nonpos_of_nonpos_of_nonneg h.1.le (le_of_not_gt hn)
+ have hrb : 0 ≤ r * b ^ 2 := mul_nonneg hr.le (sq_nonneg b)
+ linarith [h.2]
+ rw [ite_eq_left h, max_eq_left (neg_nonneg.mpr h.1.le),
+ max_eq_left (neg_nonneg.mpr hc.le)]
+ have heq : -a * -c - r * b ^ 2 = a * c - r * b ^ 2 := by ring
+ rw [heq, max_eq_left h.2.le]
+ · rw [ite_eq_right h]
+ by_cases ha : a < 0
+ · have hd : a * c - r * b ^ 2 ≤ 0 :=
+ le_of_not_gt (fun hp => h ⟨ha, hp⟩)
+ by_cases hc : c ≤ 0
+ · rw [max_eq_left (neg_nonneg.mpr ha.le), max_eq_left (neg_nonneg.mpr hc)]
+ have heq : -a * -c - r * b ^ 2 = a * c - r * b ^ 2 := by ring
+ rw [heq, max_eq_right hd]
+ · rw [max_eq_right (by linarith : -c ≤ 0)]
+ simpa using (max_eq_right (neg_nonpos.mpr (mul_nonneg hr.le (sq_nonneg b))))
+ · rw [max_eq_right (by linarith : -a ≤ 0)]
+ simpa using (max_eq_right (neg_nonpos.mpr (mul_nonneg hr.le (sq_nonneg b))))
+
+/-- Strict negative definiteness in actual endpoint coordinates, with no
+assumed sign of the other diagonal entry or omission of singular boundaries. -/
+theorem enb_maximum_iff (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :
+ dm2Negative (egm_HM r j) ↔ j 0 < 0 ∧ 0 < j 0 * j 2 - r * j 1 ^ 2 := by
+ rw [egm_HM, dm2_negative_iff]
+ have heq : r * j 0 * j 2 - (r * j 1) ^ 2 =
+ r * (j 0 * j 2 - r * j 1 ^ 2) := by ring
+ have hmul (x : ℝ) : r * x < 0 ↔ x < 0 := by
+ constructor <;> intro hx <;> nlinarith
+ rw [heq, hmul, mul_pos_iff_of_pos_left hr]
+
+/-- The literal strict saddle condition is the sign of its factored determinant. -/
+theorem enb_saddle_iff (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :
+ (egm_HS r j).det < 0 ↔ j 3 * j 5 - r * j 4 ^ 2 < 0 := by
+ have heq : (egm_HS r j).det = r * (j 3 * j 5 - r * j 4 ^ 2) := by
+ simp [egm_HS, Matrix.det_fin_two]
+ ring
+ rw [heq]
+ constructor <;> intro h <;> nlinarith
+
+/-- Exact bridge from the literal typed physical endpoint weight to the
+continuous expression. All excluded types and all zero boundaries give zero. -/
+theorem enb_weight_identity (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :
+ egm_weight r j = r ^ 2 * gn_normalizedWeight r (enb_permutation j) := by
+ classical
+ have hM := enb_maximum_iff r j hr
+ have hS := enb_saddle_iff r j hr
+ have hdetM : (egm_HM r j).det = r * (j 0 * j 2 - r * j 1 ^ 2) := by
+ simp [egm_HM, Matrix.det_fin_two]
+ ring
+ have hdetS : (egm_HS r j).det = r * (j 3 * j 5 - r * j 4 ^ 2) := by
+ simp [egm_HS, Matrix.det_fin_two]
+ ring
+ unfold egm_weight gn_normalizedWeight
+ change (if dm2Negative (egm_HM r j) ∧ (egm_HS r j).det < 0 then
+ |(egm_HM r j).det * (egm_HS r j).det| else 0) =
+ r ^ 2 * (max (max (-j 0) 0 * max (-j 2) 0 - r * j 1 ^ 2) 0 *
+ max (r * j 4 ^ 2 - j 3 * j 5) 0)
+ rw [enb_maximum_factor r (j 0) (j 1) (j 2) hr]
+ by_cases hmax : j 0 < 0 ∧ 0 < j 0 * j 2 - r * j 1 ^ 2
+ · rw [ite_eq_left hmax]
+ by_cases hsad : j 3 * j 5 - r * j 4 ^ 2 < 0
+ · rw [ite_eq_left ⟨hM.mpr hmax, hS.mpr hsad⟩, hdetM, hdetS]
+ rw [max_eq_left (by linarith : 0 ≤ r * j 4 ^ 2 - j 3 * j 5)]
+ have hp : r * (j 0 * j 2 - r * j 1 ^ 2) *
+ (r * (j 3 * j 5 - r * j 4 ^ 2)) ≤ 0 :=
+ mul_nonpos_of_nonneg_of_nonpos (mul_nonneg hr.le hmax.2.le)
+ (mul_nonpos_of_nonneg_of_nonpos hr.le hsad.le)
+ rw [abs_of_nonpos hp]
+ ring
+ · rw [ite_eq_right (fun h => hsad (hS.mp h.2)),
+ max_eq_right (by linarith : r * j 4 ^ 2 - j 3 * j 5 ≤ 0)]
+ ring
+ · rw [ite_eq_right hmax, ite_eq_right (fun h => hmax (hM.mp h.1))]
+ ring
+
+/-- The physical and continuous normalizers are the same integral up to the
+exact radius factor, for any common random six-vector and any measure. -/
+theorem enb_integral_identity {Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) (J : Ω → Fin 6 → ℝ) (r : ℝ) (hr : 0 < r) :
+ (∫ ω, egm_weight r (J ω) ∂P) =
+ r ^ 2 * ∫ ω, gn_normalizedWeight r (enb_permutation (J ω)) ∂P := by
+ calc
+ _ = ∫ ω, r ^ 2 * gn_normalizedWeight r (enb_permutation (J ω)) ∂P :=
+ integral_congr_ae (Eventually.of_forall (fun ω => enb_weight_identity r (J ω) hr))
+ _ = _ := integral_const_mul _ _
+
+/-- Positive radius makes the exact scaling nonzero, so either weight is
+integrable precisely when the other is. -/
+theorem enb_integrable_iff {Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) (J : Ω → Fin 6 → ℝ) (r : ℝ) (hr : 0 < r) :
+ Integrable (fun ω => egm_weight r (J ω)) P ↔
+ Integrable (fun ω => gn_normalizedWeight r (enb_permutation (J ω))) P := by
+ have heq : (fun ω => egm_weight r (J ω)) =
+ (fun ω => r ^ 2 * gn_normalizedWeight r (enb_permutation (J ω))) :=
+ funext (fun ω => enb_weight_identity r (J ω) hr)
+ rw [heq, integrable_const_mul_iff (isUnit_iff_ne_zero.mpr (pow_ne_zero 2 hr.ne'))]
+
+/-- On a finite measure, the actual endpoint second-moment theorem supplies
+the first-moment hypotheses needed by the normalizer join. -/
+theorem enb_integrable_of_integrable_sq {Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) [IsFiniteMeasure P]
+ (J : Ω → Fin 6 → ℝ) (hJ : Measurable J) (r : ℝ) (hr : 0 < r)
+ (hsq : Integrable (fun ω => egm_weight r (J ω) ^ 2) P) :
+ Integrable (fun ω => egm_weight r (J ω)) P ∧
+ Integrable (fun ω => gn_normalizedWeight r (enb_permutation (J ω))) P := by
+ have hmajor : Integrable (fun ω => 1 + egm_weight r (J ω) ^ 2) P :=
+ (integrable_const 1).add hsq
+ have hphysical : Integrable (fun ω => egm_weight r (J ω)) P := by
+ apply hmajor.mono' (((egm_weight_measurable r).comp hJ).aestronglyMeasurable)
+ filter_upwards [] with ω
+ rw [Real.norm_eq_abs]
+ change |egm_weight r (J ω)| ≤ 1 + egm_weight r (J ω) ^ 2
+ nlinarith [sq_nonneg (|egm_weight r (J ω)| - 1/2), sq_abs (egm_weight r (J ω))]
+ exact ⟨hphysical, (enb_integrable_iff P J r hr).mp hphysical⟩
+
+/-- The proved common-coupling normalizer floor transfers to the literal
+physical endpoint weight, with its own actual coordinate order. Current
+physical integrability and the conditioned-field convergence remain inputs. -/
+theorem enb_normalizer_floor_of_common_coupling
+ {Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) [IsProbabilityMeasure P]
+ (J : ℝ → Ω → Fin 6 → ℝ) (hJ : ∀ r, Measurable (J r))
+ (A Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)
+ (hQ : HasLaw Q (gaussianReal m v) P)
+ (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => J r ω) (𝓝[>] (0 : ℝ))
+ (𝓝 ![-1,-A ω/2,Q ω,1,A ω/2,Q ω]))
+ (hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),
+ Integrable (fun ω => egm_weight r (J r ω)) P) :
+ ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧
+ ∀ r : ℝ, 0 < r → r < δ →
+ c * r ^ 2 ≤ ∫ ω, egm_weight r (J r ω) ∂P := by
+ let X : ℝ → Ω → Fin 6 → ℝ := fun r ω => enb_permutation (J r ω)
+ have hX (r : ℝ) : Measurable (X r) :=
+ enb_permutation_continuous.measurable.comp (hJ r)
+ have hXconv : ∀ᵐ ω ∂P, Tendsto (fun r => X r ω) (𝓝[>] (0 : ℝ))
+ (𝓝 ![-1,1,-A ω/2,A ω/2,Q ω,Q ω]) := by
+ filter_upwards [hconv] with ω hω
+ have hp := (enb_permutation_continuous.tendsto
+ ![-1,-A ω/2,Q ω,1,A ω/2,Q ω]).comp hω
+ have hcontact : enb_permutation ![-1,-A ω/2,Q ω,1,A ω/2,Q ω] =
+ ![-1,1,-A ω/2,A ω/2,Q ω,Q ω] := rfl
+ simpa only [Function.comp_def, hcontact, X] using hp
+ have hXint : ∀ᶠ r in 𝓝[>] (0 : ℝ),
+ Integrable (fun ω => gn_normalizedWeight r (X r ω)) P := by
+ filter_upwards [hint, self_mem_nhdsWithin] with r hri hr
+ exact (enb_integrable_iff P (J r) r hr).mp hri
+ obtain ⟨c, hc, δ, hδ, hfloor⟩ :=
+ gn_normalizer_floor_of_common_coupling P X hX A Q m v hv hQ hXconv hXint
+ refine ⟨c, hc, δ, hδ, ?_⟩
+ intro r hr hrδ
+ have hbound := hfloor r hr hrδ
+ calc
+ c * r ^ 2 ≤ ∫ ω, r ^ 2 * gn_normalizedWeight r (X r ω) ∂P := hbound
+ _ = ∫ ω, egm_weight r (J r ω) ∂P :=
+ integral_congr_ae (Eventually.of_forall (fun ω => (enb_weight_identity r (J r ω) hr).symm))
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianCoupling.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianCoupling.lean
new file mode 100644
index 000000000..143c6253a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianCoupling.lean
@@ -0,0 +1,65 @@
+import Mathlib.Probability.Distributions.Gaussian.Multivariate
+import Mathlib.Probability.HasLaw
+import Mathlib.Analysis.SpecialFunctions.ContinuousFunctionalCalculus.Rpow.Isometric
+
+/-!
+# One continuous standard-Gaussian coupling of a finite Gaussian family
+
+PSD square-root continuity allows singular covariance and arbitrary varying
+means. The affine maps have the literal pinned multivariateGaussian laws.
+Actual source endpoint means/covariances and their limits remain application
+joins; see ../SOURCE_GAUSSIAN_COUPLING.md for the frozen source contract.
+-/
+
+namespace ResearchFormalCoreR1
+open MeasureTheory ProbabilityTheory Filter Matrix WithLp
+open scoped Topology ENNReal NNReal MatrixOrder Matrix.Norms.L2Operator
+set_option autoImplicit false
+
+private theorem gc_matrix_eval_tendsto {ι R : Type*} [Fintype ι] [DecidableEq ι]
+ {u : Filter R} {S : R → Matrix ι ι ℝ} {S0 : Matrix ι ι ℝ}
+ (hS : Tendsto S u (𝓝 S0)) (z : EuclideanSpace ℝ ι) :
+ Tendsto (fun r => Matrix.toEuclideanCLM (𝕜 := ℝ) (S r) z) u
+ (𝓝 (Matrix.toEuclideanCLM (𝕜 := ℝ) S0 z)) := by
+ have hcoord (i j : ι) : Tendsto (fun r => S r i j) u (𝓝 (S0 i j)) :=
+ ((continuous_apply j).tendsto (S0 i)).comp
+ (((continuous_apply i).tendsto S0).comp hS)
+ have hvec : Tendsto (fun r => (S r) *ᵥ ofLp z) u (𝓝 (S0 *ᵥ ofLp z)) := by
+ apply tendsto_pi_nhds.mpr
+ intro i
+ exact tendsto_finsetSum Finset.univ (fun j _ =>
+ (hcoord i j).mul tendsto_const_nhds)
+ change Tendsto (fun r => toLp 2 ((S r) *ᵥ ofLp z)) u
+ (𝓝 (toLp 2 (S0 *ᵥ ofLp z)))
+ exact ((PiLp.continuous_toLp 2 (fun _ : ι => ℝ)).tendsto _).comp hvec
+
+/-- The canonical affine vector on one common standard Gaussian space. -/
+noncomputable def gc_coupledVector {ι : Type*} [Fintype ι] [DecidableEq ι]
+ (m : EuclideanSpace ℝ ι) (S : Matrix ι ι ℝ) (z : EuclideanSpace ℝ ι) :
+ EuclideanSpace ℝ ι := m + Matrix.toEuclideanCLM (𝕜 := ℝ) (CFC.sqrt S) z
+
+/-- Exact marginal law; this is the pinned multivariateGaussian definition. -/
+theorem gc_coupledVector_hasLaw {ι : Type*} [Fintype ι] [DecidableEq ι]
+ (m : EuclideanSpace ℝ ι) (S : Matrix ι ι ℝ) :
+ HasLaw (gc_coupledVector m S) (multivariateGaussian m S)
+ (stdGaussian (EuclideanSpace ℝ ι)) where
+ aemeasurable := by unfold gc_coupledVector; fun_prop
+ map_eq := rfl
+
+/-- Every common Gaussian coordinate converges when means and PSD covariances
+converge. No invertibility, fixed rank, or square-root Lipschitz estimate. -/
+theorem gc_coupledVector_tendsto {ι κ : Type*} [Fintype ι] [DecidableEq ι]
+ (u : Filter κ) (m : κ → EuclideanSpace ℝ ι) (S : κ → Matrix ι ι ℝ)
+ (m0 : EuclideanSpace ℝ ι) (S0 : Matrix ι ι ℝ)
+ (hm : Tendsto m u (𝓝 m0)) (hS : Tendsto S u (𝓝 S0))
+ (hPSD : ∀ᶠ t in u, (S t).PosSemidef) (hPSD0 : S0.PosSemidef)
+ (z : EuclideanSpace ℝ ι) :
+ Tendsto (fun t => gc_coupledVector (m t) (S t) z) u
+ (𝓝 (gc_coupledVector m0 S0 z)) := by
+ have hwithin : Tendsto S u (𝓝[{B : Matrix ι ι ℝ | 0 ≤ B}] S0) :=
+ tendsto_nhdsWithin_iff.mpr ⟨hS, hPSD.mono (fun t ht => ht.nonneg)⟩
+ have hsqrt : Tendsto (fun t => CFC.sqrt (S t)) u (𝓝 (CFC.sqrt S0)) :=
+ (CFC.continuousOn_sqrt S0 hPSD0.nonneg).tendsto.comp hwithin
+ have heval := gc_matrix_eval_tendsto hsqrt z
+ exact hm.add heval
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianJetMoments.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianJetMoments.lean
new file mode 100644
index 000000000..52498daf0
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianJetMoments.lean
@@ -0,0 +1,124 @@
+import ResearchFormalCoreR1.DeterminantMoment
+import ResearchFormalCoreR1.GaussianScalarMoments
+import Mathlib.Probability.HasLaw
+import Mathlib.Algebra.Order.Chebyshev
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory ProbabilityTheory
+open scoped BigOperators NNReal
+
+set_option autoImplicit false
+
+/-- Radius for a finite vector, including its constant one. -/
+def gm8Radius {n : ℕ} (j : Fin n → ℝ) : ℝ := 1 + ∑ i, |j i|
+
+/-- One finite-dimensional Gaussian radius moment constant. -/
+noncomputable def gm8FiniteM8 (n : ℕ) (B V : ℝ) : ℝ :=
+ ((n+1 : ℕ) : ℝ)^7 * (1 + (n : ℝ)*128*(B^8 + V^4*gm8C8))
+
+theorem gm8FiniteM8_nonneg (n : ℕ) (B V : ℝ) : 0 ≤ gm8FiniteM8 n B V := by
+ unfold gm8FiniteM8
+ have hC := gm8_standard_nonneg
+ positivity
+
+/-- The source's exact fixed nine-coordinate constant. -/
+noncomputable def gm8M8 (B V : ℝ) : ℝ :=
+ (10 : ℝ)^7 * (1 + 9*128*(B^8 + V^4*gm8C8))
+
+theorem gm8M8_nonneg (B V : ℝ) : 0 ≤ gm8M8 B V := by
+ simpa [gm8M8, gm8FiniteM8] using gm8FiniteM8_nonneg 9 B V
+
+theorem gm8_finite_radius_power_bound (n : ℕ) (j : Fin n → ℝ) :
+ gm8Radius j ^ 8 ≤ ((n+1 : ℕ) : ℝ)^7 * (1 + ∑ i, |j i|^8) := by
+ let f : Fin (n+1) → ℝ := Fin.cases 1 (fun i : Fin n => |j i|)
+ have h := pow_sum_le_card_mul_sum_pow (s := Finset.univ) (f := f)
+ (fun i _ => by
+ refine Fin.cases ?_ (fun k => ?_) i
+ · norm_num [f]
+ · exact abs_nonneg (j k)) 7
+ simpa [f, gm8Radius, Fin.sum_univ_succ] using h
+
+theorem gm8_finite_integrable_bound (n : ℕ) {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → Fin n → ℝ)
+ (hJ : Measurable J) (m : Fin n → ℝ) (v : Fin n → ℝ≥0)
+ (B V : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V)
+ (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)
+ (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :
+ Integrable (fun x => gm8Radius (J x)^8) μ ∧
+ (∫ x, gm8Radius (J x)^8 ∂μ) ≤ gm8FiniteM8 n B V := by
+ have hi (i : Fin n) : Integrable (fun x => |J x i|^8) μ := by
+ exact (hlaw i).integrable_comp
+ (gm8_scalar_integrable_bound (m i) B V (v i) hB hV (hmean i) (hvar i)).1
+ have hsum : Integrable (fun x => ∑ i, |J x i|^8) μ :=
+ integrable_finsetSum _ (fun i _ => hi i)
+ have hmajor : Integrable (fun x => ((n+1 : ℕ) : ℝ)^7*(1+∑ i, |J x i|^8)) μ :=
+ ((integrable_const 1).add hsum).const_mul _
+ have hc : Continuous (gm8Radius (n := n)) := by unfold gm8Radius; fun_prop
+ have hmeas : AEStronglyMeasurable (fun x => gm8Radius (J x)^8) μ :=
+ ((hc.measurable.comp hJ).pow_const 8).aestronglyMeasurable
+ have hR : Integrable (fun x => gm8Radius (J x)^8) μ :=
+ hmajor.mono' hmeas (Filter.Eventually.of_forall (fun x => by
+ rw [Real.norm_eq_abs, abs_of_nonneg (pow_nonneg (by unfold gm8Radius; positivity) 8)]
+ exact gm8_finite_radius_power_bound n (J x)))
+ have hcoord (i : Fin n) :
+ (∫ x, |J x i|^8 ∂μ) ≤ 128*(B^8+V^4*gm8C8) := by
+ have heq := (hlaw i).integral_comp
+ (show AEStronglyMeasurable (fun y : ℝ => |y|^8) (gaussianReal (m i) (v i)) by fun_prop)
+ exact heq.trans_le (gm8_scalar_integrable_bound (m i) B V (v i) hB hV
+ (hmean i) (hvar i)).2
+ refine ⟨hR, ?_⟩
+ calc
+ _ ≤ ∫ x, ((n+1 : ℕ) : ℝ)^7*(1+∑ i, |J x i|^8) ∂μ :=
+ integral_mono hR hmajor (fun x => gm8_finite_radius_power_bound n (J x))
+ _ = ((n+1 : ℕ) : ℝ)^7*(1+∑ i, ∫ x, |J x i|^8 ∂μ) := by
+ rw [integral_const_mul, integral_add (integrable_const _) hsum,
+ integral_finsetSum _ (fun i _ => hi i)]
+ simp
+ _ ≤ ((n+1 : ℕ) : ℝ)^7*(1+∑ _i : Fin n, 128*(B^8+V^4*gm8C8)) := by
+ apply mul_le_mul_of_nonneg_left _ (by positivity)
+ exact add_le_add le_rfl (Finset.sum_le_sum (fun i _ => hcoord i))
+ _ = gm8FiniteM8 n B V := by simp [gm8FiniteM8, mul_assoc]
+
+/-- The exact DM2 radius is the nine-dimensional specialization. -/
+theorem gm8_radius_power_bound (j : DM2Jet) :
+ dm2Radius j ^ 8 ≤ (10 : ℝ)^7 * (1 + ∑ i, |j i|^8) := by
+ simpa [gm8Radius, dm2Radius] using gm8_finite_radius_power_bound 9 j
+
+/-- The nine-jet Gaussian marginal moment interface, with no independence or
+moment conclusion assumed. -/
+theorem gm8_jet_integrable_bound {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → DM2Jet)
+ (hJ : Measurable J) (m : Fin 9 → ℝ) (v : Fin 9 → ℝ≥0)
+ (B V : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V)
+ (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)
+ (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :
+ Integrable (fun x => dm2Radius (J x)^8) μ ∧
+ (∫ x, dm2Radius (J x)^8 ∂μ) ≤ gm8M8 B V := by
+ simpa [gm8Radius, dm2Radius, gm8M8, gm8FiniteM8] using
+ gm8_finite_integrable_bound 9 μ J hJ m v B V hB hV hmean hvar hlaw
+
+/-- The same B,V give one determinant second-moment coefficient throughout
+0 J r x i) (gaussianReal (m r i) (v r i)) (μ r)) :
+ 0 ≤ 16*gm8M8 B V ∧ ∀ r, 0 < r → r ≤ r0 →
+ Integrable (fun x => dm2Weight r (J r x)^2) (μ r) ∧
+ (∫ x, dm2Weight r (J r x)^2 ∂μ r) ≤ (16*gm8M8 B V)*r^4 := by
+ refine ⟨mul_nonneg (by norm_num) (gm8M8_nonneg B V), ?_⟩
+ intro r hr hr0
+ have : IsProbabilityMeasure (μ r) := hprob r hr hr0
+ obtain ⟨h8, hbound⟩ := gm8_jet_integrable_bound (μ r) (J r) (hJ r hr hr0)
+ (m r) (v r) B V hB hV (hmean r hr hr0) (hvar r hr hr0) (hlaw r hr hr0)
+ exact dm2_moment (μ r) (J r) (hJ r hr hr0) r (gm8M8 B V) hr (hr0.trans hr01)
+ h8 hbound
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizer.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizer.lean
new file mode 100644
index 000000000..a9657cfb8
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizer.lean
@@ -0,0 +1,110 @@
+import Mathlib.Probability.Distributions.Gaussian.Real
+import Mathlib.MeasureTheory.Integral.Bochner.Basic
+import Mathlib.MeasureTheory.Measure.Lebesgue.Basic
+import Mathlib.Tactic.Linarith
+import Mathlib.Tactic.NormNum
+import Mathlib.Tactic.FunProp
+import Mathlib.Tactic.Positivity
+
+/-!
+# Gaussian reference positivity and an endpoint-box weight floor
+
+The literal continuous normalized endpoint weight is from LM006 stability,
+sections 1–2. These components do not construct the conditioned field law,
+its endpoint convergence, a positive box mass, or the full normalizer floor.
+See ../SOURCE_GAUSSIAN_NORMALIZER.md for the frozen source contract.
+-/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory ProbabilityTheory
+open scoped ENNReal NNReal
+
+set_option autoImplicit false
+
+/-- The six coordinates are aM,aS,bM,bS,cM,cS. For physical positive radius,
+the source identifies this continuous expression with its typed W_r/r². -/
+noncomputable def gn_normalizedWeight (r : ℝ) (v : Fin 6 → ℝ) : ℝ :=
+ max (max (-v 0) 0 * max (-v 4) 0 - r * (v 2)^2) 0 *
+ max (r * (v 3)^2 - v 1 * v 5) 0
+
+/-- The contact negative-curvature reference has an integrable, strictly
+positive squared negative part, with arbitrary mean and nonzero variance. -/
+theorem gn_gaussian_reference_integrable_pos (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0) :
+ Integrable (fun q : ℝ => (max (-q) 0)^2) (gaussianReal m v) ∧
+ 0 < ∫ q : ℝ, (max (-q) 0)^2 ∂gaussianReal m v := by
+ have hsq : Integrable (fun q : ℝ => q^2) (gaussianReal m v) := by
+ simpa using (memLp_id_gaussianReal (μ := m) (v := v) 2).integrable_sq
+ have hint : Integrable (fun q : ℝ => (max (-q) 0)^2) (gaussianReal m v) := by
+ apply hsq.mono' (by fun_prop)
+ filter_upwards [] with q
+ rw [Real.norm_eq_abs, abs_of_nonneg (sq_nonneg _)]
+ rcases le_total 0 q with hq | hq
+ · rw [max_eq_right (neg_nonpos.mpr hq)]
+ simpa using sq_nonneg q
+ · rw [max_eq_left (neg_nonneg.mpr hq)]
+ nlinarith
+ have hsupp : Function.support (fun q : ℝ => (max (-q) 0)^2) = Set.Iio 0 := by
+ ext q
+ simp only [Function.mem_support, Set.mem_Iio]
+ constructor
+ · intro h
+ by_contra hn
+ have hq : 0 ≤ q := le_of_not_gt hn
+ apply h
+ simp [max_eq_right (neg_nonpos.mpr hq)]
+ · intro hq
+ have hp : 0 < (max (-q) 0)^2 := sq_pos_of_pos (lt_max_of_lt_left (neg_pos.mpr hq))
+ exact hp.ne'
+ have hmass : 0 < gaussianReal m v (Set.Iio 0) := by
+ apply pos_iff_ne_zero.mpr
+ intro hzero
+ have hvol := (gaussianReal_absolutelyContinuous' m hv) hzero
+ simp at hvol
+ refine ⟨hint, ?_⟩
+ apply (integral_pos_iff_support_of_nonneg (fun q => sq_nonneg _) hint).mpr
+ simpa only [hsupp] using hmass
+
+/-- An explicit open endpoint box has a uniform positive normalized weight.
+This is a pointwise component, with no claimed probability mass for the box. -/
+theorem gn_open_box_floor
+ (r K : ℝ) (v : Fin 6 → ℝ)
+ (hr : 0 ≤ r) (hK : 0 < K) (hsmall : r * K^2 ≤ 1/4)
+ (haM : v 0 ∈ Set.Ioo (-5/4) (-3/4))
+ (haS : v 1 ∈ Set.Ioo (3/4) (5/4))
+ (hbM : |v 2| < K) (_hbS : |v 3| < K)
+ (hcM : v 4 ∈ Set.Ioo (-2) (-1))
+ (hcS : v 5 ∈ Set.Ioo (-2) (-1)) :
+ (3 : ℝ)/8 ≤ gn_normalizedWeight r v := by
+ have ha0 : 3/4 ≤ -v 0 := by linarith [haM.2]
+ have hc4 : 1 ≤ -v 4 := by linarith [hcM.2]
+ have ha1 : 3/4 ≤ v 1 := haS.1.le
+ have hc5 : 1 ≤ -v 5 := by linarith [hcS.2]
+ have hAM : max (-v 0) 0 = -v 0 := max_eq_left (by linarith)
+ have hCM : max (-v 4) 0 = -v 4 := max_eq_left (by linarith)
+ have hb2 : (v 2)^2 ≤ K^2 := by
+ simpa only [sq_abs] using (sq_le_sq₀ (abs_nonneg (v 2)) hK.le).2 hbM.le
+ have hrb : r * (v 2)^2 ≤ 1/4 :=
+ (mul_le_mul_of_nonneg_left hb2 hr).trans hsmall
+ have hprodM : (3 : ℝ)/4 ≤ (-v 0) * (-v 4) := by
+ have h := mul_le_mul ha0 hc4 (by norm_num : (0 : ℝ) ≤ 1) (by linarith : 0 ≤ -v 0)
+ norm_num at h ⊢
+ exact h
+ have hprodS : (3 : ℝ)/4 ≤ -(v 1 * v 5) := by
+ have h := mul_le_mul ha1 hc5 (by norm_num : (0 : ℝ) ≤ 1) (by linarith : 0 ≤ v 1)
+ norm_num at h
+ nlinarith
+ have hF : (1 : ℝ)/2 ≤ max (max (-v 0) 0 * max (-v 4) 0 - r * (v 2)^2) 0 := by
+ rw [hAM, hCM]
+ exact (show (1 : ℝ)/2 ≤ (-v 0) * (-v 4) - r * (v 2)^2 by linarith).trans
+ (le_max_left _ _)
+ have hG : (3 : ℝ)/4 ≤ max (r * (v 3)^2 - v 1 * v 5) 0 := by
+ have hp : 0 ≤ r * (v 3)^2 := mul_nonneg hr (sq_nonneg _)
+ exact (show (3 : ℝ)/4 ≤ r * (v 3)^2 - v 1 * v 5 by linarith).trans
+ (le_max_left _ _)
+ have h := mul_le_mul hF hG (by norm_num : (0 : ℝ) ≤ 3/4)
+ (le_max_right _ _)
+ norm_num at h
+ exact h
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizerLimit.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizerLimit.lean
new file mode 100644
index 000000000..be08ef92c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizerLimit.lean
@@ -0,0 +1,210 @@
+import ResearchFormalCoreR1.GaussianCoupling
+import ResearchFormalCoreR1.NormalizerFloor
+import ResearchFormalCoreR1.EndpointNormalizerBridge
+import Mathlib.Probability.Moments.Variance
+import Mathlib.MeasureTheory.Function.LpSeminorm.CompareExp
+
+/-!
+# A full normalizer floor from finite Gaussian parameter limits
+
+Contact identities follow from the displayed zero variances. The common
+coupling, noncentered nondegenerate scalar reference and weight integrability
+are derived. No positive normalizer, coupling limit or moment bound is assumed.
+Actual torus conditional means/covariances remain a separate source join.
+See ../SOURCE_GAUSSIAN_NORMALIZER_LIMIT.md for the frozen source contract.
+-/
+
+namespace ResearchFormalCoreR1
+open MeasureTheory ProbabilityTheory Filter Matrix WithLp
+open scoped Topology ENNReal NNReal MatrixOrder Matrix.Norms.L2Operator
+set_option autoImplicit false
+
+private theorem gnl_contact_relations (m : EuclideanSpace ℝ (Fin 6)) (S : Matrix (Fin 6) (Fin 6) ℝ)
+ (hS : S.PosSemidef)
+ (hm0 : m 0 = -1) (hm1 : m 1 = 1)
+ (hm23 : m 2 + m 3 = 0) (hm45 : m 4 - m 5 = 0)
+ (hS0 : S 0 0 = 0) (hS1 : S 1 1 = 0)
+ (hS23 : S 2 2 + 2*S 2 3 + S 3 3 = 0)
+ (hS45 : S 4 4 - 2*S 4 5 + S 5 5 = 0) :
+ ∀ᵐ x ∂multivariateGaussian m S,
+ x 0 = -1 ∧ x 1 = 1 ∧ x 2 + x 3 = 0 ∧ x 4 - x 5 = 0 := by
+ let P := multivariateGaussian m S
+ have hLp (i : Fin 6) : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => x i) 2 P := by
+ exact (IsGaussian.memLp_two_id (μ := P)).continuousLinearMap_comp (EuclideanSpace.proj (𝕜 := ℝ) i)
+ have hi (i : Fin 6) : ∫ x : EuclideanSpace ℝ (Fin 6), x i ∂P = m i := by
+ change ∫ x, (EuclideanSpace.proj (𝕜 := ℝ) i) x ∂P = m i
+ rw [ContinuousLinearMap.integral_comp_id_comm]
+ · simp [P]
+ · exact IsGaussian.integrable_id
+ have hvar0 : Var[fun x : EuclideanSpace ℝ (Fin 6) => x 0; P] = 0 := by
+ exact (variance_eval_multivariateGaussian hS 0).trans hS0
+ have hvar1 : Var[fun x : EuclideanSpace ℝ (Fin 6) => x 1; P] = 0 := by
+ exact (variance_eval_multivariateGaussian hS 1).trans hS1
+ have hvar23 : Var[fun x : EuclideanSpace ℝ (Fin 6) => x 2 + x 3; P] = 0 := by
+ rw [variance_fun_add (hLp 2) (hLp 3)]
+ simpa [P, variance_eval_multivariateGaussian hS,
+ covariance_eval_multivariateGaussian hS] using hS23
+ have hvar45 : Var[fun x : EuclideanSpace ℝ (Fin 6) => x 4 - x 5; P] = 0 := by
+ rw [variance_fun_sub (hLp 4) (hLp 5)]
+ simpa [P, variance_eval_multivariateGaussian hS,
+ covariance_eval_multivariateGaussian hS] using hS45
+ have hi23 : ∫ x : EuclideanSpace ℝ (Fin 6), (x 2 + x 3) ∂P = 0 := by
+ rw [integral_add ((hLp 2).integrable (by norm_num)) ((hLp 3).integrable (by norm_num)), hi, hi]
+ exact hm23
+ have hi45 : ∫ x : EuclideanSpace ℝ (Fin 6), (x 4 - x 5) ∂P = 0 := by
+ rw [integral_sub ((hLp 4).integrable (by norm_num)) ((hLp 5).integrable (by norm_num)), hi, hi]
+ exact hm45
+ filter_upwards [ae_eq_integral_of_variance_eq_zero (hLp 0) hvar0,
+ ae_eq_integral_of_variance_eq_zero (hLp 1) hvar1,
+ ae_eq_integral_of_variance_eq_zero ((hLp 2).add (hLp 3)) hvar23,
+ ae_eq_integral_of_variance_eq_zero ((hLp 4).sub (hLp 5)) hvar45]
+ with x hx0 hx1 hx23 hx45
+ exact ⟨hx0.trans ((hi 0).trans hm0), hx1.trans ((hi 1).trans hm1),
+ hx23.trans hi23, hx45.trans hi45⟩
+
+private lemma gnl_positivePart_memLp {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} {f : Ω → ℝ} {p : ℝ≥0∞} (hf : MemLp f p P) :
+ MemLp (fun x => max (f x) 0) p P := by
+ apply hf.norm.mono' ((hf.aestronglyMeasurable.aemeasurable.sup_const 0).aestronglyMeasurable)
+ filter_upwards [] with x
+ rw [Real.norm_eq_abs, Real.norm_eq_abs, abs_of_nonneg (le_max_right _ _)]
+ exact max_le (le_abs_self _) (abs_nonneg _)
+
+private lemma gnl_gaussian_weight_integrable (r : ℝ) (m : EuclideanSpace ℝ (Fin 6))
+ (S : Matrix (Fin 6) (Fin 6) ℝ) (hS : S.PosSemidef) :
+ Integrable (fun x : EuclideanSpace ℝ (Fin 6) => gn_normalizedWeight r (ofLp x))
+ (multivariateGaussian m S) := by
+ have : ENNReal.HolderTriple 4 4 2 := ⟨by
+ rw [← two_mul, show (4 : ℝ≥0∞) = 2*2 by norm_num, ENNReal.mul_inv (by simp) (by simp),
+ ← mul_assoc, ENNReal.mul_inv_cancel two_ne_zero ENNReal.ofNat_ne_top, one_mul]⟩
+ let P := multivariateGaussian m S
+ have hc (i : Fin 6) : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => x i) 4 P := by
+ have hp := measurePreserving_eval_multivariateGaussian (μ := m) hS (i := i)
+ have hlaw : HasLaw (fun x : EuclideanSpace ℝ (Fin 6) => x i)
+ (gaussianReal (m i) (S i i).toNNReal) P := ⟨hp.measurable.aemeasurable, hp.map_eq⟩
+ exact hlaw.memLp (memLp_id_gaussianReal 4)
+ have hpos (i : Fin 6) : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => max (-x i) 0) 4 P :=
+ gnl_positivePart_memLp (hc i).neg
+ have hM : MemLp (fun x : EuclideanSpace ℝ (Fin 6) =>
+ max (-x 0) 0 * max (-x 4) 0 - r*(x 2)^2) 2 P := by
+ have h1 : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => max (-x 0) 0 * max (-x 4) 0) 2 P :=
+ (hpos 0).fun_mul (hpos 4)
+ have h2 : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => (x 2)^2) 2 P := by
+ simpa only [pow_two] using (hc 2).fun_mul (hc 2)
+ exact h1.sub (h2.const_mul r)
+ have hSadd : MemLp (fun x : EuclideanSpace ℝ (Fin 6) =>
+ r*(x 3)^2 - x 1*x 5) 2 P := by
+ have h1 : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => (x 3)^2) 2 P := by
+ simpa only [pow_two] using (hc 3).fun_mul (hc 3)
+ have h2 : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => x 1*x 5) 2 P :=
+ (hc 1).fun_mul (hc 5)
+ exact (h1.const_mul r).sub h2
+ have hT : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => gn_normalizedWeight r (ofLp x)) 1 P :=
+ (gnl_positivePart_memLp hM).fun_mul (gnl_positivePart_memLp hSadd)
+ exact memLp_one_iff_integrable.mp hT
+
+
+/-- Gaussian endpoint parameter convergence and concrete contact moments supply
+one positive physical normalizer coefficient at every sufficiently small radius.
+The covariance may be singular; the transverse reference mean is unrestricted. -/
+theorem gnl_normalizer_floor_of_parameter_limits
+ (m : ℝ → EuclideanSpace ℝ (Fin 6)) (S : ℝ → Matrix (Fin 6) (Fin 6) ℝ)
+ (m0 : EuclideanSpace ℝ (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) ℝ)
+ (hm : Tendsto m (𝓝[>] (0 : ℝ)) (𝓝 m0))
+ (hS : Tendsto S (𝓝[>] (0 : ℝ)) (𝓝 S0))
+ (hPSD : ∀ᶠ r in 𝓝[>] (0 : ℝ), (S r).PosSemidef) (hPSD0 : S0.PosSemidef)
+ (hm0 : m0 0 = -1) (hm1 : m0 1 = 1)
+ (hm23 : m0 2 + m0 3 = 0) (hm45 : m0 4 - m0 5 = 0)
+ (hS0 : S0 0 0 = 0) (hS1 : S0 1 1 = 0)
+ (hS23 : S0 2 2 + 2*S0 2 3 + S0 3 3 = 0)
+ (hS45 : S0 4 4 - 2*S0 4 5 + S0 5 5 = 0) (hQpos : 0 < S0 4 4) :
+ ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧
+ ∀ r : ℝ, 0 < r → r < δ → c*r^2 ≤
+ ∫ x : EuclideanSpace ℝ (Fin 6), r^2 * gn_normalizedWeight r (ofLp x)
+ ∂multivariateGaussian (m r) (S r) := by
+ let P := stdGaussian (EuclideanSpace ℝ (Fin 6))
+ let X : ℝ → EuclideanSpace ℝ (Fin 6) → Fin 6 → ℝ :=
+ fun r z => ofLp (gc_coupledVector (m r) (S r) z)
+ let A : EuclideanSpace ℝ (Fin 6) → ℝ := fun z => 2 * gc_coupledVector m0 S0 z 3
+ let Q : EuclideanSpace ℝ (Fin 6) → ℝ := fun z => gc_coupledVector m0 S0 z 4
+ have hX (r : ℝ) : Measurable (X r) := by
+ dsimp [X, gc_coupledVector]
+ fun_prop
+ have hLaw0 : HasLaw (gc_coupledVector m0 S0) (multivariateGaussian m0 S0) P :=
+ gc_coupledVector_hasLaw m0 S0
+ have hcontacts : ∀ᵐ z ∂P,
+ gc_coupledVector m0 S0 z 0 = -1 ∧ gc_coupledVector m0 S0 z 1 = 1 ∧
+ gc_coupledVector m0 S0 z 2 + gc_coupledVector m0 S0 z 3 = 0 ∧
+ gc_coupledVector m0 S0 z 4 - gc_coupledVector m0 S0 z 5 = 0 := by
+ have hb : ∀ᵐ x ∂P.map (gc_coupledVector m0 S0),
+ x 0 = -1 ∧ x 1 = 1 ∧ x 2 + x 3 = 0 ∧ x 4 - x 5 = 0 := by
+ rw [hLaw0.map_eq]
+ exact gnl_contact_relations m0 S0 hPSD0 hm0 hm1 hm23 hm45 hS0 hS1 hS23 hS45
+ exact ae_of_ae_map hLaw0.aemeasurable hb
+ have hconv : ∀ᵐ z ∂P, Tendsto (fun r => X r z) (𝓝[>] (0 : ℝ))
+ (𝓝 ![-1,1,-A z/2,A z/2,Q z,Q z]) := by
+ filter_upwards [hcontacts] with z hz
+ have hshape : ofLp (gc_coupledVector m0 S0 z) = ![-1,1,-A z/2,A z/2,Q z,Q z] := by
+ funext i
+ fin_cases i <;> simp [A, Q] <;> linarith [hz.1, hz.2.1, hz.2.2.1, hz.2.2.2]
+ have ht := ((PiLp.continuous_ofLp 2 (fun _ : Fin 6 => ℝ)).tendsto
+ (gc_coupledVector m0 S0 z)).comp
+ (gc_coupledVector_tendsto (𝓝[>] (0 : ℝ)) m S m0 S0 hm hS hPSD hPSD0 z)
+ simpa only [Function.comp_def, X, hshape] using ht
+ have hv : (S0 4 4).toNNReal ≠ 0 := ne_of_gt (Real.toNNReal_pos.mpr hQpos)
+ have hQ : HasLaw Q (gaussianReal (m0 4) (S0 4 4).toNNReal) P := by
+ exact (measurePreserving_eval_multivariateGaussian (μ := m0) hPSD0 (i := 4)).hasLaw.fun_comp hLaw0
+ have hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),
+ Integrable (fun z => gn_normalizedWeight r (X r z)) P := by
+ filter_upwards [hPSD] with r hr
+ exact (gc_coupledVector_hasLaw (m r) (S r)).integrable_comp
+ (gnl_gaussian_weight_integrable r (m r) (S r) hr)
+ obtain ⟨c, hc, δ, hδ, hfloor⟩ :=
+ gn_normalizer_floor_of_common_coupling P X hX A Q (m0 4) (S0 4 4).toNNReal hv hQ hconv hint
+ refine ⟨c, hc, δ, hδ, ?_⟩
+ intro r hr hrδ
+ calc
+ c*r^2 ≤ ∫ z, r^2 * gn_normalizedWeight r (X r z) ∂P := hfloor r hr hrδ
+ _ = ∫ x : EuclideanSpace ℝ (Fin 6), r^2 * gn_normalizedWeight r (ofLp x)
+ ∂multivariateGaussian (m r) (S r) := by
+ simpa only [Function.comp_def, X] using
+ (gc_coupledVector_hasLaw (m r) (S r)).integral_comp
+ (f := fun x : EuclideanSpace ℝ (Fin 6) => r^2 * gn_normalizedWeight r (ofLp x))
+ (by unfold gn_normalizedWeight; fun_prop)
+
+
+/-- The same Gaussian parameter limit gives the full literal typed endpoint
+normalizer, after the explicit permutation back to physical endpoint order. -/
+theorem gnl_physical_normalizer_floor_of_parameter_limits
+ (m : ℝ → EuclideanSpace ℝ (Fin 6)) (S : ℝ → Matrix (Fin 6) (Fin 6) ℝ)
+ (m0 : EuclideanSpace ℝ (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) ℝ)
+ (hm : Tendsto m (𝓝[>] (0 : ℝ)) (𝓝 m0))
+ (hS : Tendsto S (𝓝[>] (0 : ℝ)) (𝓝 S0))
+ (hPSD : ∀ᶠ r in 𝓝[>] (0 : ℝ), (S r).PosSemidef) (hPSD0 : S0.PosSemidef)
+ (hm0 : m0 0 = -1) (hm1 : m0 1 = 1)
+ (hm23 : m0 2 + m0 3 = 0) (hm45 : m0 4 - m0 5 = 0)
+ (hS0 : S0 0 0 = 0) (hS1 : S0 1 1 = 0)
+ (hS23 : S0 2 2 + 2*S0 2 3 + S0 3 3 = 0)
+ (hS45 : S0 4 4 - 2*S0 4 5 + S0 5 5 = 0) (hQpos : 0 < S0 4 4) :
+ ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧
+ ∀ r : ℝ, 0 < r → r < δ → c*r^2 ≤
+ ∫ x : EuclideanSpace ℝ (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]
+ ∂multivariateGaussian (m r) (S r) := by
+ obtain ⟨c, hc, δ, hδ, hfloor⟩ := gnl_normalizer_floor_of_parameter_limits
+ m S m0 S0 hm hS hPSD hPSD0 hm0 hm1 hm23 hm45 hS0 hS1 hS23 hS45 hQpos
+ refine ⟨c, hc, δ, hδ, ?_⟩
+ intro r hr hrδ
+ calc
+ c*r^2 ≤ ∫ x : EuclideanSpace ℝ (Fin 6), r^2 * gn_normalizedWeight r (ofLp x)
+ ∂multivariateGaussian (m r) (S r) := hfloor r hr hrδ
+ _ = ∫ x : EuclideanSpace ℝ (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]
+ ∂multivariateGaussian (m r) (S r) := by
+ apply integral_congr_ae
+ filter_upwards [] with x
+ have hp : enb_permutation ![x 0,x 2,x 4,x 1,x 3,x 5] = ofLp x := by
+ funext i
+ fin_cases i <;> rfl
+ simpa only [hp] using
+ (enb_weight_identity r ![x 0,x 2,x 4,x 1,x 3,x 5] hr).symm
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianRegressionKernel.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianRegressionKernel.lean
new file mode 100644
index 000000000..face5de81
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianRegressionKernel.lean
@@ -0,0 +1,270 @@
+import Mathlib.Probability.HasCondDistrib
+import Mathlib.Probability.Distributions.Gaussian.HasGaussianLaw.Independence
+
+/-!
+# Canonical Gaussian regression kernel
+
+For a residual law `ν`, `regressionKernel ν B mX mY x` is the literal affine pushforward
+`ν.map (fun r => r + mY + B (x - mX))` at every observation `x`. The kernel is constructed
+measurably from a deterministic observation and a constant residual kernel, so it has a
+specified value even where the observation has probability zero.
+
+The Gaussian theorem derives observation/residual independence from joint Gaussianity and
+zero coordinate cross-covariance. No nondegeneracy or residual covariance inverse is needed.
+The direct observed/target theorem derives those residual hypotheses from the coordinate
+normal equations for `B`. The construction does not identify concrete derivative observations,
+regression or Schur covariance blocks, a Palm weight, or a conditional law of a literal smooth field.
+
+Source contract: `SOURCE_REGRESSION_KERNEL.md` in this packet. Author-side Lean verification
+is separate from source alignment and the required review by another model family.
+-/
+
+open MeasureTheory ProbabilityTheory
+open scoped ProbabilityTheory BigOperators
+
+set_option autoImplicit false
+
+namespace ResearchFormalCoreR1
+
+/-- Copying the first coordinate and retaining an independent second coordinate. -/
+lemma regression_compProd_id_const {α β : Type*} [MeasurableSpace α] [MeasurableSpace β]
+ (μ : Measure α) (ν : Measure β) [SFinite μ] [SFinite ν] :
+ μ ⊗ₘ (Kernel.id ×ₖ Kernel.const α ν) =
+ (μ.prod ν).map (fun p : α × β => (p.1, p)) := by
+ ext s hs
+ rw [Measure.compProd_apply hs, Measure.map_apply (by fun_prop) hs,
+ Measure.prod_apply (s := (fun p : α × β => (p.1, p)) ⁻¹' s) (hs.preimage (by fun_prop))]
+ simp_rw [Kernel.prod_apply, Kernel.id_apply, Kernel.const_apply, Measure.dirac_prod]
+ congr with x
+ rw [Measure.map_apply (by fun_prop) (measurable_prodMk_left hs)]
+ rfl
+
+/-- An independent residual paired with the observation has the explicit product kernel. -/
+lemma regression_pair_hasCondDistrib {Ω α β : Type*} [MeasurableSpace Ω]
+ [MeasurableSpace α] [MeasurableSpace β] {P : Measure Ω} [IsProbabilityMeasure P]
+ {X : Ω → α} {R : Ω → β} (hX : AEMeasurable X P) (hR : AEMeasurable R P)
+ (hXR : IndepFun X R P) :
+ HasCondDistrib (fun ω => (X ω, R ω)) X
+ (Kernel.id ×ₖ Kernel.const α (P.map R)) P := by
+ refine ⟨hX.prodMk (hX.prodMk hR), ?_⟩
+ calc
+ P.map (fun ω => (X ω, (X ω, R ω))) =
+ (P.map (fun ω => (X ω, R ω))).map (fun p : α × β => (p.1, p)) := by
+ rw [AEMeasurable.map_map_of_aemeasurable (by fun_prop) (hX.prodMk hR)]
+ rfl
+ _ = ((P.map X).prod (P.map R)).map (fun p : α × β => (p.1, p)) := by
+ rw [hXR.map_prod_eq_prod_map_map hX hR]
+ _ = (P.map X) ⊗ₘ (Kernel.id ×ₖ Kernel.const α (P.map R)) :=
+ (regression_compProd_id_const (P.map X) (P.map R)).symm
+
+
+/-- Affine reconstruction of the target from the observation and the regression residual. -/
+def regressionReconstruction {n k : ℕ}
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)
+ (p : (Fin n → ℝ) × (Fin k → ℝ)) : Fin k → ℝ :=
+ p.2 + mY + B (p.1 - mX)
+
+lemma regressionReconstruction_measurable {n k : ℕ}
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ Measurable (regressionReconstruction B mX mY) := by
+ unfold regressionReconstruction
+ fun_prop
+
+/-- The canonical regression law is specified at every observation, including null pins. -/
+noncomputable def regressionKernel {n k : ℕ} (ν : Measure (Fin k → ℝ))
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ Kernel (Fin n → ℝ) (Fin k → ℝ) :=
+ ((Kernel.id : Kernel (Fin n → ℝ) (Fin n → ℝ)) ×ₖ
+ Kernel.const (Fin n → ℝ) ν).map (regressionReconstruction B mX mY)
+
+instance regressionKernel_isMarkov {n k : ℕ} (ν : Measure (Fin k → ℝ))
+ [IsProbabilityMeasure ν] (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ))
+ (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ IsMarkovKernel (regressionKernel ν B mX mY) := by
+ unfold regressionKernel
+ exact Kernel.IsMarkovKernel.map _ (regressionReconstruction_measurable B mX mY)
+
+lemma regressionKernel_apply {n k : ℕ} (ν : Measure (Fin k → ℝ)) [SFinite ν]
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)
+ (x : Fin n → ℝ) :
+ regressionKernel ν B mX mY x = ν.map (fun r => r + mY + B (x - mX)) := by
+ rw [regressionKernel, Kernel.map_apply _ (regressionReconstruction_measurable B mX mY),
+ Kernel.prod_apply, Kernel.id_apply, Kernel.const_apply, Measure.dirac_prod,
+ Measure.map_map (regressionReconstruction_measurable B mX mY) (by fun_prop)]
+ rfl
+
+/-- Affine reconstruction from an independent residual has the canonical conditional kernel. -/
+lemma independentResidual_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} [IsProbabilityMeasure P] {n k : ℕ}
+ {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}
+ (hX : AEMeasurable X P) (hR : AEMeasurable R P) (hXR : IndepFun X R P)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X
+ (regressionKernel (P.map R) B mX mY) P := by
+ exact (regression_pair_hasCondDistrib hX hR hXR).comp_left
+ (regressionReconstruction_measurable B mX mY)
+
+/-- Joint Gaussianity and vanishing observation/residual cross-covariance give the canonical
+conditional law, without choosing an almost-everywhere version at a prescribed observation. -/
+theorem gaussianRegression_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}
+ (hXR : HasGaussianLaw (fun ω => (X ω, R ω)) P)
+ (hzero : ∀ i j, covariance (fun ω => X ω i) (fun ω => R ω j) P = 0)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X
+ (regressionKernel (P.map R) B mX mY) P := by
+ have : IsProbabilityMeasure P := hXR.isProbabilityMeasure
+ exact independentResidual_hasCondDistrib hXR.fst.aemeasurable hXR.snd.aemeasurable
+ (hXR.indepFun_of_covariance_eval hzero) B mX mY
+
+/-- Kernel measurability is pointwise in the observation and does not require a Gaussian law. -/
+lemma regressionKernel_measurable {n k : ℕ} (ν : Measure (Fin k → ℝ))
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ Measurable (regressionKernel ν B mX mY) :=
+ Kernel.measurable _
+
+/-- All parts of the canonical Gaussian conditional-law construction, including the literal
+pushforward at every prescribed observation. Zero-dimensional and degenerate laws are allowed. -/
+theorem gaussianRegressionKernel_spec {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}
+ (hXR : HasGaussianLaw (fun ω => (X ω, R ω)) P)
+ (hzero : ∀ i j, covariance (fun ω => X ω i) (fun ω => R ω j) P = 0)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ IsMarkovKernel (regressionKernel (P.map R) B mX mY) ∧
+ Measurable (regressionKernel (P.map R) B mX mY) ∧
+ (∀ x, regressionKernel (P.map R) B mX mY x =
+ (P.map R).map (fun r => r + mY + B (x - mX))) ∧
+ HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X
+ (regressionKernel (P.map R) B mX mY) P := by
+ have : IsProbabilityMeasure P := hXR.isProbabilityMeasure
+ exact ⟨inferInstance, regressionKernel_measurable _ B mX mY,
+ regressionKernel_apply _ B mX mY, gaussianRegression_hasCondDistrib hXR hzero B mX mY⟩
+
+/-- Coordinates of a finite-vector continuous linear map in the standard basis. -/
+lemma regression_map_coordinate {n k : ℕ}
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (v : Fin n → ℝ) (j : Fin k) :
+ B v j = ∑ l, B (Pi.single l 1) j * v l := by
+ calc
+ B v j = B (∑ l, v l • (Pi.single l 1 : Fin n → ℝ)) j :=
+ congrArg (fun w => B w j) (pi_eq_sum_univ' v)
+ _ = ∑ l, B (Pi.single l 1) j * v l := by
+ simp [map_sum, mul_comm]
+
+/-- The covariance of a centered finite-vector linear predictor is its normal-equation sum. -/
+lemma regression_covariance_map {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} [IsProbabilityMeasure P] {n k : ℕ}
+ {X : Ω → Fin n → ℝ} (hX : HasGaussianLaw X P)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ)
+ (i : Fin n) (j : Fin k) :
+ covariance (fun ω => X ω i) (fun ω => B (X ω - mX) j) P =
+ ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P := by
+ have hcoord : (fun ω => B (X ω - mX) j) =
+ (fun ω => ∑ l, B (Pi.single l 1) j * (X ω l - mX l)) := by
+ funext ω
+ exact regression_map_coordinate B (X ω - mX) j
+ rw [hcoord, covariance_fun_sum_right]
+ · apply Finset.sum_congr rfl
+ intro l _
+ rw [covariance_const_mul_right, covariance_sub_const_right (hX.eval l).integrable]
+ · intro l
+ exact ((hX.eval l).memLp_two.sub (memLp_const _)).const_mul _
+ · exact (hX.eval i).memLp_two
+
+/-- The actual regression residual has zero observation cross-covariance by the normal equations. -/
+lemma regression_residual_zero_covariance {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}
+ (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)
+ (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =
+ ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :
+ ∀ i j, covariance (fun ω => X ω i)
+ (fun ω => (Y ω - mY - B (X ω - mX)) j) P = 0 := by
+ have : IsProbabilityMeasure P := hXY.isProbabilityMeasure
+ intro i j
+ have hXi := (hXY.fst.eval i).memLp_two
+ have hYj := (hXY.snd.eval j).memLp_two
+ have hBj : MemLp (fun ω => B (X ω - mX) j) 2 P := by
+ have hcoord : (fun ω => B (X ω - mX) j) =
+ (fun ω => ∑ l, B (Pi.single l 1) j * (X ω l - mX l)) := by
+ funext ω
+ exact regression_map_coordinate B (X ω - mX) j
+ rw [hcoord]
+ exact memLp_finsetSum _ (fun l _ =>
+ ((hXY.fst.eval l).memLp_two.sub (memLp_const _)).const_mul _)
+ simp only [Pi.sub_apply]
+ rw [covariance_fun_sub_right (Y := fun ω => Y ω j - mY j) hXi (hYj.sub (memLp_const _)) hBj,
+ covariance_sub_const_right (hXY.snd.eval j).integrable,
+ regression_covariance_map hXY.fst B mX i j, hnormal i j, sub_self]
+
+/-- The observation and the actual affine residual are jointly Gaussian. -/
+lemma regression_residual_jointGaussian {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} {n k : ℕ}
+ {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}
+ (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ HasGaussianLaw (fun ω => (X ω, Y ω - mY - B (X ω - mX))) P := by
+ let L : ((Fin n → ℝ) × (Fin k → ℝ)) →L[ℝ]
+ ((Fin n → ℝ) × (Fin k → ℝ)) :=
+ (ContinuousLinearMap.fst ℝ (Fin n → ℝ) (Fin k → ℝ)).prod
+ (ContinuousLinearMap.snd ℝ (Fin n → ℝ) (Fin k → ℝ) -
+ B.comp (ContinuousLinearMap.fst ℝ (Fin n → ℝ) (Fin k → ℝ)))
+ let c : (Fin n → ℝ) × (Fin k → ℝ) := (0, B mX - mY)
+ have hL : HasGaussianLaw (fun ω => L (X ω, Y ω)) P := hXY.map_fun L
+ have hshift : HasGaussianLaw (fun ω => L (X ω, Y ω) + c) P := {
+ aemeasurable := hL.aemeasurable.add aemeasurable_const
+ isGaussian_map := by
+ have : IsGaussian (P.map (fun ω => L (X ω, Y ω))) := hL.isGaussian_map
+ convert (inferInstance : IsGaussian
+ ((P.map (fun ω => L (X ω, Y ω))).map (fun p => p + c))) using 1
+ rw [AEMeasurable.map_map_of_aemeasurable (by fun_prop) hL.aemeasurable]
+ rfl }
+ apply hshift.congr
+ filter_upwards [] with ω
+ apply Prod.ext
+ · simp [L, c]
+ · change Y ω - B (X ω) + (B mX - mY) = Y ω - mY - B (X ω - mX)
+ rw [map_sub]
+ abel
+
+
+
+/-- The actual target has the explicit regression conditional law when the coefficient map
+satisfies the coordinate normal equations. The residual hypotheses are derived. -/
+theorem gaussianRegression_observed_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}
+ (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)
+ (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =
+ ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :
+ HasCondDistrib Y X
+ (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) P := by
+ have hXR := regression_residual_jointGaussian hXY B mX mY
+ have hzero := regression_residual_zero_covariance hXY B mX mY hnormal
+ have hcond := gaussianRegression_hasCondDistrib hXR hzero B mX mY
+ convert hcond using 1
+ funext ω
+ abel
+
+/-- The canonical conditional-law specification for the actual jointly Gaussian target.
+The residual Gaussianity and its zero cross-covariance are conclusions of the construction. -/
+theorem gaussianRegression_observed_spec {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}
+ (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)
+ (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =
+ ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :
+ IsMarkovKernel
+ (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) ∧
+ Measurable
+ (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) ∧
+ (∀ x, regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY x =
+ (P.map (fun ω => Y ω - mY - B (X ω - mX))).map
+ (fun r => r + mY + B (x - mX))) ∧
+ HasCondDistrib Y X
+ (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) P := by
+ have hXR := regression_residual_jointGaussian hXY B mX mY
+ have hzero := regression_residual_zero_covariance hXY B mX mY hnormal
+ have hspec := gaussianRegressionKernel_spec hXR hzero B mX mY
+ exact ⟨hspec.1, hspec.2.1, hspec.2.2.1,
+ gaussianRegression_observed_hasCondDistrib hXY B mX mY hnormal⟩
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianScalarMoments.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianScalarMoments.lean
new file mode 100644
index 000000000..ce432cb71
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianScalarMoments.lean
@@ -0,0 +1,99 @@
+import Mathlib.Probability.Distributions.Gaussian.Real
+import Mathlib.Algebra.Order.Ring.Basic
+import Mathlib.Tactic.FunProp
+import Mathlib.Tactic.NormNum
+import Mathlib.Tactic.Ring
+
+/-! Scalar eighth moments for noncentered Gaussian laws. The finite standard
+Gaussian moment is proved integrable; it is not an assumed model bound. -/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory ProbabilityTheory
+open scoped NNReal
+
+set_option autoImplicit false
+
+noncomputable def gm8C8 : ℝ := ∫ z : ℝ, |z| ^ 8 ∂gaussianReal 0 1
+
+theorem gm8_standard_integrable :
+ Integrable (fun z : ℝ => |z| ^ 8) (gaussianReal 0 1) := by
+ simpa only [id_eq, Real.norm_eq_abs] using
+ (memLp_id_gaussianReal' (μ := 0) (v := 1) 8 (by norm_num)).integrable_norm_pow
+ (by norm_num : (8 : ℕ) ≠ 0)
+
+theorem gm8_standard_nonneg : 0 ≤ gm8C8 := by
+ exact integral_nonneg (fun z => pow_nonneg (abs_nonneg z) 8)
+
+private theorem gm8_integrable (m : ℝ) (v : ℝ≥0) :
+ Integrable (fun x : ℝ => |x| ^ 8) (gaussianReal m v) := by
+ simpa only [id_eq, Real.norm_eq_abs] using
+ (memLp_id_gaussianReal' (μ := m) (v := v) 8 (by norm_num)).integrable_norm_pow
+ (by norm_num : (8 : ℕ) ≠ 0)
+
+private theorem gm8_sqrt_pow (V : ℝ) (hV : 0 ≤ V) :
+ (Real.sqrt V) ^ 8 = V ^ 4 := by
+ calc
+ _ = ((Real.sqrt V) ^ 2) ^ 4 := by ring
+ _ = V ^ 4 := by rw [Real.sq_sqrt hV]
+
+private theorem gm8_affine_map (m : ℝ) (v : ℝ≥0) :
+ (gaussianReal 0 1).map (fun z : ℝ => m + Real.sqrt (v : ℝ) * z) =
+ gaussianReal m v := by
+ calc
+ _ = ((gaussianReal 0 1).map (fun z : ℝ => Real.sqrt (v : ℝ) * z)).map
+ (fun z : ℝ => m + z) := by
+ rw [Measure.map_map (by fun_prop) (by fun_prop)]
+ rfl
+ _ = gaussianReal m v := by
+ rw [gaussianReal_map_const_mul, gaussianReal_map_const_add]
+ simp only [mul_zero, zero_add, mul_one]
+ congr 1
+ apply NNReal.eq
+ exact Real.sq_sqrt v.property
+
+private theorem gm8_affine_bound (m B V : ℝ) (v : ℝ≥0) (hB : 0 ≤ B) (hV : 0 ≤ V)
+ (hm : |m| ≤ B) (hv : (v : ℝ) ≤ V) (z : ℝ) :
+ |m + Real.sqrt (v : ℝ) * z| ^ 8 ≤ 128 * (B ^ 8 + V ^ 4 * |z| ^ 8) := by
+ have habs : |m + Real.sqrt (v : ℝ) * z| ≤ B + Real.sqrt V * |z| := by
+ calc
+ _ ≤ |m| + |Real.sqrt (v : ℝ) * z| := abs_add_le _ _
+ _ = |m| + Real.sqrt (v : ℝ) * |z| := by
+ rw [abs_mul, abs_of_nonneg (Real.sqrt_nonneg _)]
+ _ ≤ B + Real.sqrt V * |z| :=
+ add_le_add hm (mul_le_mul_of_nonneg_right (Real.sqrt_le_sqrt hv) (abs_nonneg z))
+ calc
+ _ ≤ (B + Real.sqrt V * |z|) ^ 8 := pow_le_pow_left₀ (abs_nonneg _) habs 8
+ _ ≤ 128 * (B ^ 8 + (Real.sqrt V * |z|) ^ 8) := by
+ convert add_pow_le hB (mul_nonneg (Real.sqrt_nonneg V) (abs_nonneg z)) 8 using 1
+ norm_num
+ _ = 128 * (B ^ 8 + V ^ 4 * |z| ^ 8) := by
+ rw [mul_pow, gm8_sqrt_pow V hV]
+
+/-- Bounded means and variances give a uniform eighth-moment bound, including
+zero variance and nonzero means. No eighth-moment hypothesis is assumed. -/
+theorem gm8_scalar_integrable_bound (m B V : ℝ) (v : ℝ≥0)
+ (hB : 0 ≤ B) (hV : 0 ≤ V) (hm : |m| ≤ B) (hv : (v : ℝ) ≤ V) :
+ Integrable (fun x : ℝ => |x| ^ 8) (gaussianReal m v) ∧
+ (∫ x : ℝ, |x| ^ 8 ∂gaussianReal m v) ≤
+ 128 * (B ^ 8 + V ^ 4 * gm8C8) := by
+ have hi := gm8_integrable m v
+ have hmajor : Integrable (fun z : ℝ => 128 * (B ^ 8 + V ^ 4 * |z| ^ 8))
+ (gaussianReal 0 1) :=
+ ((integrable_const (B ^ 8)).add (gm8_standard_integrable.const_mul (V ^ 4))).const_mul 128
+ have hiaff : Integrable (fun z : ℝ => |m + Real.sqrt (v : ℝ) * z| ^ 8)
+ (gaussianReal 0 1) := by
+ rw [← gm8_affine_map m v] at hi
+ exact (integrable_map_measure (by fun_prop) (by fun_prop)).mp hi
+ refine ⟨hi, ?_⟩
+ calc
+ _ = ∫ z : ℝ, |m + Real.sqrt (v : ℝ) * z| ^ 8 ∂gaussianReal 0 1 := by
+ rw [← gm8_affine_map m v, integral_map (by fun_prop) (by fun_prop)]
+ _ ≤ ∫ z : ℝ, 128 * (B ^ 8 + V ^ 4 * |z| ^ 8) ∂gaussianReal 0 1 :=
+ integral_mono hiaff hmajor (gm8_affine_bound m B V v hB hV hm hv)
+ _ = 128 * (B ^ 8 + V ^ 4 * gm8C8) := by
+ rw [integral_const_mul, integral_add (integrable_const _)
+ (gm8_standard_integrable.const_mul _), integral_const_mul]
+ simp only [integral_const, probReal_univ, smul_eq_mul, one_mul, gm8C8]
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/NormalizerFloor.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/NormalizerFloor.lean
new file mode 100644
index 000000000..3635695ef
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/NormalizerFloor.lean
@@ -0,0 +1,120 @@
+import ResearchFormalCoreR1.GaussianNormalizer
+import Mathlib.Probability.HasLaw
+import Mathlib.MeasureTheory.Integral.Lebesgue.Add
+import Mathlib.Topology.Instances.ENNReal.Lemmas
+import Mathlib.Topology.Order.LeftRightNhds
+
+/-!
+# A full small-radius lower normalizer from an explicit common coupling
+
+Nonnegative Fatou and the proved positive Gaussian reference give one lower
+constant for every sufficiently small positive radius. Neither uniform
+integrability nor convergence of normalizers is assumed. The literal
+conditioned-field construction of the coupling remains an application join.
+See ../SOURCE_GAUSSIAN_NORMALIZER.md for the frozen source contract.
+-/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory ProbabilityTheory Filter
+open scoped Topology ENNReal NNReal
+
+set_option autoImplicit false
+
+private theorem nfloor_eventually_lower_of_fatou {Ω ι : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) (u : Filter ι) [IsCountablyGenerated u] [NeBot u]
+ (f : ι → Ω → ℝ) (g : Ω → ℝ)
+ (hmeas : ∀ r, Measurable (f r))
+ (hnonneg : ∀ r ω, 0 ≤ f r ω)
+ (hg : Integrable g P) (hgpos : 0 < ∫ ω, g ω ∂P)
+ (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => f r ω) u (𝓝 (g ω)))
+ (hfint : ∀ᶠ r in u, Integrable (f r) P) :
+ ∀ᶠ r in u, (∫ ω, g ω ∂P)/2 ≤ ∫ ω, f r ω ∂P := by
+ have hg0 : 0 ≤ᵐ[P] g := hconv.mono (fun ω hω =>
+ ge_of_tendsto hω (Eventually.of_forall (fun r => hnonneg r ω)))
+ have hlim : (fun ω => liminf (fun r => ENNReal.ofReal (f r ω)) u) =ᵐ[P]
+ (fun ω => ENNReal.ofReal (g ω)) := by
+ filter_upwards [hconv] with ω hω
+ exact ((ENNReal.continuous_ofReal.tendsto (g ω)).comp hω).liminf_eq
+ have hfatou : ENNReal.ofReal (∫ ω, g ω ∂P) ≤
+ liminf (fun r => ∫⁻ ω, ENNReal.ofReal (f r ω) ∂P) u := by
+ rw [ofReal_integral_eq_lintegral_ofReal hg hg0]
+ rw [← lintegral_congr_ae hlim]
+ exact lintegral_liminf_le (fun r => (hmeas r).ennreal_ofReal)
+ have hhalf : ENNReal.ofReal ((∫ ω, g ω ∂P)/2) <
+ ENNReal.ofReal (∫ ω, g ω ∂P) := by
+ exact (ENNReal.ofReal_lt_ofReal_iff hgpos).mpr (by linarith)
+ have hevent := eventually_lt_of_lt_liminf (hhalf.trans_le hfatou)
+ filter_upwards [hevent, hfint] with r hr hri
+ rw [← ofReal_integral_eq_lintegral_ofReal hri
+ (Eventually.of_forall (fun ω => hnonneg r ω))] at hr
+ exact (ENNReal.ofReal_lt_ofReal_iff'.mp hr).1.le
+
+private theorem nfloor_weight_continuous :
+ Continuous (fun p : ℝ × (Fin 6 → ℝ) => gn_normalizedWeight p.1 p.2) := by
+ unfold gn_normalizedWeight
+ fun_prop
+private theorem nfloor_contact_value (a q : ℝ) :
+ gn_normalizedWeight 0 ![-1,1,-a/2,a/2,q,q] = (max (-q) 0)^2 := by
+ simp [gn_normalizedWeight, pow_two]
+private theorem nfloor_weight_limit (X : ℝ → Fin 6 → ℝ) (a q : ℝ)
+ (hX : Tendsto X (𝓝[>] (0:ℝ)) (𝓝 ![-1,1,-a/2,a/2,q,q])) :
+ Tendsto (fun r => gn_normalizedWeight r (X r)) (𝓝[>] (0:ℝ))
+ (𝓝 ((max (-q) 0)^2)) := by
+ have hr : Tendsto (fun r : ℝ => r) (𝓝[>] (0:ℝ)) (𝓝 0) :=
+ continuousWithinAt_id
+ simpa only [nfloor_contact_value, Function.comp_def] using
+ (nfloor_weight_continuous.tendsto (0, ![-1,1,-a/2,a/2,q,q])).comp (hr.prodMk_nhds hX)
+private theorem nfloor_reference {Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) (Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)
+ (hlaw : HasLaw Q (gaussianReal m v) P) :
+ Integrable (fun ω => (max (-Q ω) 0)^2) P ∧
+ 0 < ∫ ω, (max (-Q ω) 0)^2 ∂P := by
+ obtain ⟨hInt,hPos⟩ := gn_gaussian_reference_integrable_pos m v hv
+ refine ⟨hlaw.integrable_comp hInt, ?_⟩
+ have heq := hlaw.integral_comp
+ (show AEStronglyMeasurable (fun q : ℝ => (max (-q) 0)^2) (gaussianReal m v) by fun_prop)
+ exact heq.trans_gt hPos
+
+/-- The actual integral of the physical r²-scaled continuous endpoint weight
+has a positive lower constant at every sufficiently small positive radius.
+The common coupling and current integrability are explicit premises; its
+positive reference integral and the lower bound are proved, not premises. -/
+theorem gn_normalizer_floor_of_common_coupling
+ {Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) [IsProbabilityMeasure P]
+ (X : ℝ → Ω → Fin 6 → ℝ) (hX : ∀ r, Measurable (X r))
+ (A Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)
+ (hQ : HasLaw Q (gaussianReal m v) P)
+ (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => X r ω) (𝓝[>] (0 : ℝ))
+ (𝓝 ![-1,1,-A ω/2,A ω/2,Q ω,Q ω]))
+ (hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),
+ Integrable (fun ω => gn_normalizedWeight r (X r ω)) P) :
+ ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧
+ ∀ r : ℝ, 0 < r → r < δ →
+ c * r^2 ≤ ∫ ω, r^2 * gn_normalizedWeight r (X r ω) ∂P := by
+ let g : Ω → ℝ := fun ω => (max (-Q ω) 0)^2
+ obtain ⟨hg, hgpos⟩ := nfloor_reference P Q m v hv hQ
+ have hmeas (r : ℝ) : Measurable (fun ω => gn_normalizedWeight r (X r ω)) := by
+ have hc : Continuous (gn_normalizedWeight r) := by
+ unfold gn_normalizedWeight
+ fun_prop
+ exact hc.measurable.comp (hX r)
+ have hnonneg (r : ℝ) (ω : Ω) : 0 ≤ gn_normalizedWeight r (X r ω) :=
+ mul_nonneg (le_max_right _ _) (le_max_right _ _)
+ have hweightconv : ∀ᵐ ω ∂P,
+ Tendsto (fun r => gn_normalizedWeight r (X r ω)) (𝓝[>] (0 : ℝ)) (𝓝 (g ω)) := by
+ filter_upwards [hconv] with ω hω
+ exact nfloor_weight_limit (fun r => X r ω) (A ω) (Q ω) hω
+ have hfloor : ∀ᶠ r in 𝓝[>] (0 : ℝ),
+ (∫ ω, g ω ∂P)/2 ≤ ∫ ω, gn_normalizedWeight r (X r ω) ∂P :=
+ nfloor_eventually_lower_of_fatou P (𝓝[>] (0 : ℝ))
+ (fun r ω => gn_normalizedWeight r (X r ω)) g hmeas hnonneg hg hgpos hweightconv hint
+ obtain ⟨δ, hδ, hinterval⟩ := mem_nhdsGT_iff_exists_Ioo_subset.mp hfloor
+ refine ⟨(∫ ω, g ω ∂P)/2, by positivity, δ, hδ, ?_⟩
+ intro r hr hrδ
+ have hbound := hinterval ⟨hr, hrδ⟩
+ rw [integral_const_mul]
+ simpa only [mul_comm] using mul_le_mul_of_nonneg_left hbound (sq_nonneg r)
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/PalmReweighting.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/PalmReweighting.lean
new file mode 100644
index 000000000..f0d6abafc
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/PalmReweighting.lean
@@ -0,0 +1,139 @@
+import Mathlib.MeasureTheory.Function.L2Space
+import Mathlib.MeasureTheory.Measure.WithDensity
+import Mathlib.MeasureTheory.Integral.Bochner.Set
+import Mathlib.MeasureTheory.Measure.Real
+import Mathlib.Tactic.Linarith
+import Mathlib.Tactic.NormNum
+import Mathlib.Tactic.Positivity
+import Mathlib.Tactic.FieldSimp
+
+/-!
+# A canonical weighted probability and its square-root event bound
+
+This constructs the literal measure with density `W / integral W`, proves its
+event formula, and applies integral Cauchy–Schwarz. The determinant second
+moment and normalizer estimates cancel their exact radius powers. Identifying
+this measure with a geometric Kac–Rice Palm law remains an application join.
+See ../SOURCE_PALM_REWEIGHTING.md for the frozen source contract.
+-/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory
+open scoped ENNReal
+
+set_option autoImplicit false
+
+/-- The literal normalized nonnegative real density, defined for every input. -/
+noncomputable def prwMeasure {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) : Measure Ω :=
+ μ.withDensity (fun ω => ENNReal.ofReal (W ω / ∫ x, W x ∂μ))
+
+/-- On a finite measure, a measurable square-integrable real weight is integrable. -/
+theorem prw_integrable_of_integrable_sq {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) [IsFiniteMeasure μ] (W : Ω → ℝ) (hW : Measurable W)
+ (hsq : Integrable (fun ω => W ω ^ 2) μ) : Integrable W μ := by
+ have hmajor : Integrable (fun ω => 1 + W ω ^ 2) μ :=
+ (integrable_const 1).add hsq
+ apply hmajor.mono' hW.aestronglyMeasurable
+ filter_upwards [] with ω
+ rw [Real.norm_eq_abs]
+ nlinarith [sq_nonneg (|W ω| - 1 / 2), sq_abs (W ω)]
+
+/-- The actual event mass is the normalized set integral, in extended reals. -/
+theorem prw_measure_apply {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)
+ (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ)
+ (E : Set Ω) (hE : MeasurableSet E) :
+ prwMeasure μ W E = ENNReal.ofReal ((∫ x in E, W x ∂μ) / ∫ x, W x ∂μ) := by
+ unfold prwMeasure
+ rw [withDensity_apply _ hE]
+ rw [← ofReal_integral_eq_lintegral_ofReal
+ (hW.integrableOn.div_const _) (Filter.Eventually.of_forall (fun ω =>
+ div_nonneg (hW0 ω) hZ.le))]
+ rw [integral_div]
+
+/-- Positive finite normalizer makes the literal density a probability law. -/
+theorem prw_isProbabilityMeasure {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)
+ (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ) :
+ IsProbabilityMeasure (prwMeasure μ W) := by
+ constructor
+ rw [prw_measure_apply μ W hW hW0 hZ Set.univ MeasurableSet.univ]
+ simp [hZ.ne']
+
+/-- The event identity is proved for the constructed law, not assumed. -/
+theorem prw_measure_real {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)
+ (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ)
+ (E : Set Ω) (hE : MeasurableSet E) :
+ (prwMeasure μ W).real E = (∫ x in E, W x ∂μ) / ∫ x, W x ∂μ := by
+ rw [measureReal_def, prw_measure_apply μ W hW hW0 hZ E hE,
+ ENNReal.toReal_ofReal (div_nonneg (integral_nonneg hW0) hZ.le)]
+
+/-- Integral Cauchy–Schwarz against the event indicator, including null events. -/
+theorem prw_numerator_bound {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) [IsFiniteMeasure μ] (W : Ω → ℝ) (hW : Measurable W)
+ (hW0 : ∀ ω, 0 ≤ W ω) (hsq : Integrable (fun ω => W ω ^ 2) μ)
+ (E : Set Ω) (hE : MeasurableSet E) :
+ (∫ x in E, W x ∂μ) ≤
+ Real.sqrt (∫ x, W x ^ 2 ∂μ) * Real.sqrt (μ.real E) := by
+ classical
+ let I : Ω → ℝ := E.indicator (fun _ => 1)
+ have hI0 : ∀ ω, 0 ≤ I ω := by
+ intro ω
+ simp only [I, Set.indicator_apply]
+ split_ifs <;> norm_num
+ have hWLp : MemLp W (ENNReal.ofReal 2) μ := by
+ simpa using (memLp_two_iff_integrable_sq hW.aestronglyMeasurable).mpr hsq
+ have hILp : MemLp I (ENNReal.ofReal 2) μ :=
+ (memLp_const (1 : ℝ)).indicator hE
+ have hCS := integral_mul_le_Lp_mul_Lq_of_nonneg Real.HolderConjugate.two_two
+ (Filter.Eventually.of_forall hW0) (Filter.Eventually.of_forall hI0) hWLp hILp
+ have hleft : (fun ω => W ω * I ω) = E.indicator W := by
+ funext ω
+ by_cases hω : ω ∈ E <;> simp [I, hω]
+ have hright : (fun ω => I ω ^ (2 : ℝ)) = E.indicator (fun _ => (1 : ℝ)) := by
+ funext ω
+ by_cases hω : ω ∈ E <;> simp [I, hω]
+ have hIint : (∫ ω, I ω ^ (2 : ℝ) ∂μ) = μ.real E := by
+ rw [hright]
+ change (∫ ω, E.indicator (1 : Ω → ℝ) ω ∂μ) = μ.real E
+ exact integral_indicator_one hE
+ rw [hleft, integral_indicator hE, hIint] at hCS
+ simpa only [Real.rpow_two, ← Real.sqrt_eq_rpow] using hCS
+
+/-- The exact `r^4` second moment and `r^2` normalizer cancel in the literal
+weighted probability. No event probability is assumed positive. -/
+theorem prw_square_root_event_bound {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (hW : Measurable W)
+ (hW0 : ∀ ω, 0 ≤ W ω) (hsq : Integrable (fun ω => W ω ^ 2) μ)
+ (C c r : ℝ) (hC : 0 ≤ C) (hc : 0 < c) (hr : 0 < r)
+ (hmoment : (∫ x, W x ^ 2 ∂μ) ≤ C * r ^ 4)
+ (hfloor : c * r ^ 2 ≤ ∫ x, W x ∂μ)
+ (E : Set Ω) (hE : MeasurableSet E) :
+ IsProbabilityMeasure (prwMeasure μ W) ∧
+ (prwMeasure μ W).real E ≤ (Real.sqrt C / c) * Real.sqrt (μ.real E) := by
+ have hZ : 0 < ∫ x, W x ∂μ :=
+ (mul_pos hc (sq_pos_of_pos hr)).trans_le hfloor
+ have hW1 : Integrable W μ := prw_integrable_of_integrable_sq μ W hW hsq
+ refine ⟨prw_isProbabilityMeasure μ W hW1 hW0 hZ, ?_⟩
+ rw [prw_measure_real μ W hW1 hW0 hZ E hE]
+ have hnum := prw_numerator_bound μ W hW hW0 hsq E hE
+ have hsqrt : Real.sqrt (∫ x, W x ^ 2 ∂μ) ≤ Real.sqrt C * r ^ 2 := by
+ calc
+ _ ≤ Real.sqrt (C * r ^ 4) := Real.sqrt_le_sqrt hmoment
+ _ = Real.sqrt C * r ^ 2 := by
+ rw [Real.sqrt_mul hC]
+ congr 1
+ have heq : r ^ 4 = (r ^ 2) ^ 2 := by ring
+ rw [heq, Real.sqrt_sq (sq_nonneg r)]
+ calc
+ _ ≤ (Real.sqrt C * r ^ 2 * Real.sqrt (μ.real E)) / (c * r ^ 2) := by
+ apply div_le_div₀ (by positivity)
+ (hnum.trans (mul_le_mul_of_nonneg_right hsqrt (Real.sqrt_nonneg _)))
+ (mul_pos hc (sq_pos_of_pos hr)) hfloor
+ _ = (Real.sqrt C / c) * Real.sqrt (μ.real E) := by
+ field_simp [hr.ne']
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean
new file mode 100644
index 000000000..e4073dc21
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean
@@ -0,0 +1,93 @@
+import Mathlib.Analysis.Real.Sqrt
+import Mathlib.Tactic.FieldSimp
+import Mathlib.Tactic.Ring
+import Mathlib.Tactic.NormNum
+import Mathlib.Tactic.Positivity
+import Mathlib.Tactic.Linarith
+
+namespace ResearchFormalCoreR1
+
+set_option autoImplicit false
+
+/-- P02-LM-008 algebraic companion: exact cancellation of the `r²` factor
+ after the Cauchy–Schwarz numerator bound and the normalizer lower bound
+ have been established in the surrounding probability theorem. -/
+theorem p02_lm008_r2_cancel
+ (r cW cZ q : ℝ) (hr : r ≠ 0) (hcZ : cZ ≠ 0) :
+ (Real.sqrt cW * r ^ 2 * Real.sqrt q) / (cZ * r ^ 2) =
+ (Real.sqrt cW / cZ) * Real.sqrt q := by
+ field_simp [hr, hcZ]
+
+/-- P02-LM-008 cross-multiplied transfer companion. This theorem starts
+ from an already supplied Cauchy–Schwarz numerator estimate and an exact
+ normalizer lower bound. It does not formalize the measure-theoretic
+ Cauchy–Schwarz step itself. -/
+theorem p02_lm008_cross_multiplied
+ (n z r cW cZ q : ℝ)
+ (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hq : 0 ≤ q)
+ (hz : cZ * r ^ 2 ≤ z)
+ (hn : n ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q) :
+ n * (cZ * r ^ 2) ≤
+ (Real.sqrt cW * r ^ 2 * Real.sqrt q) * z := by
+ have hden : 0 ≤ cZ * r ^ 2 :=
+ mul_nonneg (le_of_lt hcZ) (sq_nonneg r)
+ have hnum : 0 ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q := by
+ positivity
+ calc
+ n * (cZ * r ^ 2) ≤
+ (Real.sqrt cW * r ^ 2 * Real.sqrt q) * (cZ * r ^ 2) := by
+ exact mul_le_mul_of_nonneg_right hn hden
+ _ ≤ (Real.sqrt cW * r ^ 2 * Real.sqrt q) * z := by
+ exact mul_le_mul_of_nonneg_left hz hnum
+
+/-- P02-LM-008 quotient companion. With positive denominators, the
+ cross-multiplied inequality and exact `r²` cancellation yield the Palm
+ square-root transfer coefficient. -/
+theorem p02_lm008_quotient_bound
+ (n z r cW cZ q : ℝ)
+ (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hq : 0 ≤ q)
+ (hzpos : 0 < z) (hz : cZ * r ^ 2 ≤ z)
+ (hn : n ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q) :
+ n / z ≤ (Real.sqrt cW / cZ) * Real.sqrt q := by
+ have hscaled : 0 < cZ * r ^ 2 :=
+ mul_pos hcZ (sq_pos_of_pos hr)
+ have hcross :=
+ p02_lm008_cross_multiplied n z r cW cZ q hr hcW hcZ hq hz hn
+ rw [← p02_lm008_r2_cancel r cW cZ q (ne_of_gt hr) (ne_of_gt hcZ)]
+ exact (div_le_div_iff₀ hzpos hscaled).2 hcross
+
+/-- P02-LM-009 deterministic threshold companion. Failure of
+ `r * R^5 ≤ ε` implies the fifth-power threshold used before Markov's
+ inequality. -/
+theorem p02_lm009_bad_event_threshold
+ (r R ε : ℝ) (hr : 0 < r) (hbad : ε < r * R ^ 5) :
+ ε / r < R ^ 5 := by
+ exact (div_lt_iff₀ hr).2 (by simpa [mul_comm] using hbad)
+
+/-- The fixed exponent identity used when the 40th moment is selected in
+ the P02-LM-009 application. -/
+theorem p02_lm009_power40_identity (R : ℝ) :
+ (R ^ 5) ^ 8 = R ^ 40 := by
+ ring
+
+/-- In the final P0.2 power ledger, an `O(r^4)` Palm tail is also `O(r^3)`
+ on `0 ≤ r ≤ 1`. -/
+theorem p02_lm009_r4_le_r3
+ (r : ℝ) (hr0 : 0 ≤ r) (hr1 : r ≤ 1) :
+ r ^ 4 ≤ r ^ 3 := by
+ have h : 0 ≤ r ^ 3 * (1 - r) :=
+ mul_nonneg (pow_nonneg hr0 3) (sub_nonneg.mpr hr1)
+ nlinarith
+
+/-- Conditional rate companion: once the Palm square-root transfer has
+ produced a uniform `C r^4` bound, the cubic target follows on `r ≤ 1`. -/
+theorem p02_lm009_palm_r4_to_r3
+ (p C r : ℝ) (hC : 0 ≤ C) (hr0 : 0 ≤ r) (hr1 : r ≤ 1)
+ (hp : p ≤ C * r ^ 4) :
+ p ≤ C * r ^ 3 := by
+ calc
+ p ≤ C * r ^ 4 := hp
+ _ ≤ C * r ^ 3 := by
+ exact mul_le_mul_of_nonneg_left (p02_lm009_r4_le_r3 r hr0 hr1) hC
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json
new file mode 100644
index 000000000..220b56867
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json
@@ -0,0 +1,1041 @@
+{
+ "schema_version": 1,
+ "object": "DOWNSTREAM-HARD-GATE-20260925-v1",
+ "campaign": {
+ "main_issues": [
+ 86,
+ 90
+ ],
+ "disposition": "research-integrity control; scientific effect NONE"
+ },
+ "terminal_classifications": [
+ "PROVED_REVIEWED",
+ "SUPERSEDED_NONBLOCKING",
+ "REFUTED",
+ "BLOCKED_ABSENT"
+ ],
+ "non_discharge_tokens": [
+ "GREEN_CI",
+ "HASH_MATCH",
+ "ARCHITECTURAL_ADMISSION",
+ "NUMERICAL_EXPERIMENT",
+ "SAME_AUTHOR_REVIEW",
+ "NAVIGATION_SUCCESS",
+ "AUTHOR_SELF_CHECK"
+ ],
+ "nodes": {
+ "hist.rnu_env.py": {
+ "layer": "D0",
+ "kind": "carrier",
+ "classification": "BLOCKED_ABSENT",
+ "controlling": false,
+ "fingerprint": "ABSENT",
+ "notes": "Historical D3 carrier; no successor claims byte identity"
+ },
+ "hist.CL_ANTHROPIC_BUNDLE_2026-09-17_v5.zip": {
+ "layer": "D0",
+ "kind": "carrier",
+ "classification": "BLOCKED_ABSENT",
+ "controlling": false,
+ "fingerprint": "ABSENT",
+ "notes": "Historical archive absent"
+ },
+ "hist.allcell_fdz_enclosures.json": {
+ "layer": "D0",
+ "kind": "carrier",
+ "classification": "BLOCKED_ABSENT",
+ "controlling": false,
+ "fingerprint": "ABSENT",
+ "notes": "Historical cell carrier absent"
+ },
+ "hist.ENV-RESCOV": {
+ "layer": "D0",
+ "kind": "predicate",
+ "classification": "OPEN_HISTORICAL",
+ "controlling": false,
+ "fingerprint": "status-rn-unif-ordered-wall-1",
+ "notes": "OPEN for historical D3; qualitatively rederived on newer routes where proved"
+ },
+ "hist.ALLCELL-FDZ-Q4": {
+ "layer": "D0",
+ "kind": "predicate",
+ "classification": "OPEN_HISTORICAL",
+ "controlling": false,
+ "fingerprint": "status-rn-unif-ordered-wall-2",
+ "notes": "Not a dependency of the fixed-remote theorem"
+ },
+ "hist.LOGQ-TAIL": {
+ "layer": "D0",
+ "kind": "predicate",
+ "classification": "OPEN_HISTORICAL",
+ "controlling": false,
+ "fingerprint": "status-rn-unif-ordered-wall-3",
+ "notes": "Replaced only inside named successors"
+ },
+ "hist.SYM-Fw-jet": {
+ "layer": "D0",
+ "kind": "predicate",
+ "classification": "OPEN_HISTORICAL",
+ "controlling": false,
+ "fingerprint": "status-rn-unif-ordered-wall-4",
+ "notes": "Analogous interface rederived; no historical certificate identity"
+ },
+ "hist.CH-LIFT": {
+ "layer": "D0",
+ "kind": "predicate",
+ "classification": "OPEN_ACTIVE",
+ "controlling": false,
+ "fingerprint": "status-rn-unif-ch-lift",
+ "notes": "Still mathematically relevant for shrinking charts"
+ },
+ "hist.Piece-2-annulus": {
+ "layer": "D0",
+ "kind": "predicate",
+ "classification": "OPEN_ACTIVE",
+ "controlling": false,
+ "fingerprint": "status-rn-unif-piece-2",
+ "notes": "Active mathematical blocker for shrinking/pin-collision regions"
+ },
+ "hist.OBL-H5-JETMOD": {
+ "layer": "D0",
+ "kind": "predicate",
+ "classification": "OPEN_HISTORICAL",
+ "controlling": false,
+ "fingerprint": "status-rn-unif-jetmod",
+ "notes": "No 2026-09-24 proof claims certified 24-jet enclosure"
+ },
+ "hist.lemma_closed": {
+ "layer": "D0",
+ "kind": "register",
+ "classification": "FALSE",
+ "controlling": false,
+ "fingerprint": "lemma_closed=false",
+ "notes": "Scientific effect NONE; this gate never flips the register"
+ },
+ "math.uniform-matrix-cap-lifetime": {
+ "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"
+ ]
+ },
+ "math.d1-component.congruence-erratum": {
+ "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"
+ },
+ "math.d1-component.section9-replacement-v1_1": {
+ "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"
+ },
+ "math.d1-component.marked-cylinder-cap": {
+ "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"
+ },
+ "math.d1-component.reconciliation-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"
+ },
+ "math.lifetime-remainder": {
+ "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"
+ },
+ "math.side24-coefficient": {
+ "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"
+ },
+ "math.rn-count-interface": {
+ "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"
+ },
+ "math.rn-fixed-remote-window": {
+ "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"
+ },
+ "math.rn-region.fixed-remote": {
+ "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"
+ },
+ "math.rn-region.mesoscopic-scaled-annulus": {
+ "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"
+ ]
+ },
+ "math.rn-region.pin-collision": {
+ "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"
+ ]
+ },
+ "math.rn-region.intermediate-r-to-rho": {
+ "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"
+ ]
+ },
+ "math.rn-region.witness-collision": {
+ "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"
+ ]
+ },
+ "math.rn-mesoscopic-reduction": {
+ "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."
+ },
+ "math.p15-full-price": {
+ "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."
+ },
+ "math.p15-price-boundary": {
+ "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"
+ },
+ "eng.hard-gate": {
+ "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"
+ },
+ "eng.main-pr87-crosswalk": {
+ "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"
+ },
+ "eng.d0-packet-allowlist-fix": {
+ "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"
+ },
+ "math.rn-selector-region-crosswalk": {
+ "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"
+ },
+ "math.rn-fixed-annulus-window": {
+ "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
+ },
+ "math.rn-region.fixed-annulus-window": {
+ "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"
+ },
+ "regional.fixed-annulus.high-jet-route": {
+ "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."
+ },
+ "math.d5-pin-neighborhood-first-moment": {
+ "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"
+ },
+ "math.d5-component.punctured-pin-proof": {
+ "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"
+ }
+ ]
+ },
+ "math.d5-component.punctured-pin-review-111": {
+ "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"
+ },
+ "math.d5-component.punctured-pin-continuum-review": {
+ "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"
+ },
+ "math.d5-component.punctured-pin-continuum-check": {
+ "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"
+ },
+ "math.d5-component.collar-proof": {
+ "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"
+ }
+ ]
+ },
+ "math.d5-component.collar-review": {
+ "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"
+ },
+ "math.d5-component.annulus-proof": {
+ "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"
+ }
+ ]
+ },
+ "math.d5-component.annulus-review": {
+ "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"
+ },
+ "math.d5-component.intermediate-window-proof": {
+ "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"
+ }
+ ]
+ },
+ "math.d5-component.i5-review-xai": {
+ "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"
+ },
+ "math.d5-component.i5-review-claude": {
+ "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"
+ },
+ "math.d5-component.remote-window-proof": {
+ "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"
+ }
+ ]
+ },
+ "math.d5-component.offpin-second-moment-review": {
+ "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"
+ }
+ },
+ "edges": [
+ {
+ "from": "math.lifetime-remainder",
+ "to": "math.uniform-matrix-cap-lifetime",
+ "required": true,
+ "relation": "imports_named_interfaces"
+ },
+ {
+ "from": "math.side24-coefficient",
+ "to": "math.uniform-matrix-cap-lifetime",
+ "required": true,
+ "relation": "evaluates_eq_15_2"
+ },
+ {
+ "from": "math.uniform-matrix-cap-lifetime",
+ "to": "math.d1-component.congruence-erratum",
+ "required": true,
+ "relation": "reads_with_congruence_erratum"
+ },
+ {
+ "from": "math.uniform-matrix-cap-lifetime",
+ "to": "math.d1-component.section9-replacement-v1_1",
+ "required": true,
+ "relation": "reads_section9_as_replaced_v1_1"
+ },
+ {
+ "from": "math.uniform-matrix-cap-lifetime",
+ "to": "math.d1-component.marked-cylinder-cap",
+ "required": true,
+ "relation": "consumes_cap_sections_1_5"
+ },
+ {
+ "from": "math.uniform-matrix-cap-lifetime",
+ "to": "math.d1-component.reconciliation-record",
+ "required": true,
+ "relation": "reads_with_reconciled_rule_W1_radius"
+ },
+ {
+ "from": "math.rn-fixed-remote-window",
+ "to": "math.rn-count-interface",
+ "required": true,
+ "relation": "supplies_numerator_on_restricted_region"
+ },
+ {
+ "from": "math.rn-fixed-remote-window",
+ "to": "math.rn-region.fixed-remote",
+ "required": false,
+ "relation": "covers_region"
+ },
+ {
+ "from": "math.rn-mesoscopic-reduction",
+ "to": "math.rn-fixed-remote-window",
+ "required": true,
+ "relation": "successor_scale_after_fixed_remote"
+ },
+ {
+ "from": "math.rn-mesoscopic-reduction",
+ "to": "math.rn-region.mesoscopic-scaled-annulus",
+ "required": false,
+ "relation": "targets_region"
+ },
+ {
+ "from": "math.rn-mesoscopic-reduction",
+ "to": "hist.CH-LIFT",
+ "required": false,
+ "relation": "reopens_scaled_chart_problem"
+ },
+ {
+ "from": "math.rn-mesoscopic-reduction",
+ "to": "hist.Piece-2-annulus",
+ "required": false,
+ "relation": "addresses_partial_piece"
+ },
+ {
+ "from": "math.p15-full-price",
+ "to": "math.p15-price-boundary",
+ "required": false,
+ "relation": "boundary_counterexample_not_required_premise"
+ },
+ {
+ "from": "hist.ENV-RESCOV",
+ "to": "hist.rnu_env.py",
+ "required": true,
+ "relation": "historical_certificate_carrier"
+ },
+ {
+ "from": "hist.ALLCELL-FDZ-Q4",
+ "to": "hist.allcell_fdz_enclosures.json",
+ "required": true,
+ "relation": "historical_certificate_carrier"
+ },
+ {
+ "from": "hist.SYM-Fw-jet",
+ "to": "hist.CL_ANTHROPIC_BUNDLE_2026-09-17_v5.zip",
+ "required": false,
+ "relation": "historical_bundle_identity"
+ },
+ {
+ "from": "eng.main-pr87-crosswalk",
+ "to": "eng.d0-packet-allowlist-fix",
+ "required": true,
+ "relation": "ci_unblock_depends_on_allowlist_patch"
+ },
+ {
+ "from": "math.rn-selector-region-crosswalk",
+ "to": "math.rn-fixed-remote-window",
+ "required": false,
+ "relation": "inventories_covered_region"
+ },
+ {
+ "from": "math.rn-selector-region-crosswalk",
+ "to": "math.rn-count-interface",
+ "required": false,
+ "relation": "inherits_no_markov_reversal"
+ },
+ {
+ "from": "math.rn-fixed-annulus-window",
+ "to": "math.rn-count-interface",
+ "required": true,
+ "relation": "supplies_expected_count_on_reviewed_scoped_region"
+ },
+ {
+ "from": "math.rn-fixed-annulus-window",
+ "to": "math.rn-region.fixed-annulus-window",
+ "required": false,
+ "relation": "covers_reviewed_subregion"
+ },
+ {
+ "from": "math.rn-fixed-annulus-window",
+ "to": "regional.fixed-annulus.high-jet-route",
+ "required": false,
+ "relation": "regionally_supersedes_historical_high_jet_route"
+ },
+ {
+ "from": "regional.fixed-annulus.high-jet-route",
+ "to": "hist.CH-LIFT",
+ "required": false,
+ "relation": "regional_bypass_only"
+ },
+ {
+ "from": "regional.fixed-annulus.high-jet-route",
+ "to": "hist.Piece-2-annulus",
+ "required": false,
+ "relation": "regional_bypass_only"
+ },
+ {
+ "from": "regional.fixed-annulus.high-jet-route",
+ "to": "hist.OBL-H5-JETMOD",
+ "required": false,
+ "relation": "regional_bypass_only"
+ },
+ {
+ "from": "math.d5-pin-neighborhood-first-moment",
+ "to": "math.d5-component.punctured-pin-proof",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.d5-pin-neighborhood-first-moment",
+ "to": "math.d5-component.punctured-pin-review-111",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.d5-pin-neighborhood-first-moment",
+ "to": "math.d5-component.punctured-pin-continuum-review",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.d5-pin-neighborhood-first-moment",
+ "to": "math.d5-component.punctured-pin-continuum-check",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.d5-pin-neighborhood-first-moment",
+ "to": "math.d5-component.collar-proof",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.d5-pin-neighborhood-first-moment",
+ "to": "math.d5-component.collar-review",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.d5-pin-neighborhood-first-moment",
+ "to": "math.d5-component.annulus-proof",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.d5-pin-neighborhood-first-moment",
+ "to": "math.d5-component.annulus-review",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.d5-pin-neighborhood-first-moment",
+ "to": "math.d5-component.intermediate-window-proof",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.d5-pin-neighborhood-first-moment",
+ "to": "math.d5-component.i5-review-xai",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.d5-pin-neighborhood-first-moment",
+ "to": "math.d5-component.i5-review-claude",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.d5-pin-neighborhood-first-moment",
+ "to": "math.d5-component.remote-window-proof",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.pin-collision",
+ "to": "math.d5-component.punctured-pin-proof",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.pin-collision",
+ "to": "math.d5-component.punctured-pin-review-111",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.pin-collision",
+ "to": "math.d5-component.punctured-pin-continuum-review",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.pin-collision",
+ "to": "math.d5-component.punctured-pin-continuum-check",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.pin-collision",
+ "to": "math.d5-component.collar-proof",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.pin-collision",
+ "to": "math.d5-component.collar-review",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.mesoscopic-scaled-annulus",
+ "to": "math.d5-component.punctured-pin-proof",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.mesoscopic-scaled-annulus",
+ "to": "math.d5-component.punctured-pin-review-111",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.mesoscopic-scaled-annulus",
+ "to": "math.d5-component.punctured-pin-continuum-review",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.mesoscopic-scaled-annulus",
+ "to": "math.d5-component.punctured-pin-continuum-check",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.mesoscopic-scaled-annulus",
+ "to": "math.d5-component.collar-proof",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.mesoscopic-scaled-annulus",
+ "to": "math.d5-component.collar-review",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.mesoscopic-scaled-annulus",
+ "to": "math.d5-component.annulus-proof",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.mesoscopic-scaled-annulus",
+ "to": "math.d5-component.annulus-review",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.intermediate-r-to-rho",
+ "to": "math.d5-component.intermediate-window-proof",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.intermediate-r-to-rho",
+ "to": "math.d5-component.i5-review-xai",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.intermediate-r-to-rho",
+ "to": "math.d5-component.i5-review-claude",
+ "required": true,
+ "relation": "requires_evidence"
+ },
+ {
+ "from": "math.rn-region.witness-collision",
+ "to": "math.d5-component.offpin-second-moment-review",
+ "required": true,
+ "relation": "requires_evidence"
+ }
+ ]
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/development/0758454e88cb02ad56483face96483d8a878afe5eaa72f1ea629f0ca5a29760f.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/development/0758454e88cb02ad56483face96483d8a878afe5eaa72f1ea629f0ca5a29760f.lean
new file mode 100644
index 000000000..2b528b9bc
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/development/0758454e88cb02ad56483face96483d8a878afe5eaa72f1ea629f0ca5a29760f.lean
@@ -0,0 +1,133 @@
+import Lifetime
+
+/-!
+Relative topology for closed scalar superlevels.
+
+The chart-input theorem below is a reusable topology adapter. It does not construct
+a chart from a nonzero derivative: that literal scalar-chart obligation is separately
+owned. No critical-point Morse chart or global closed-level LPC is asserted here.
+-/
+
+open Set Filter Topology
+open UniversalLaw.Spec.Lifetime
+
+namespace TorusRegularSuperlevel
+
+/-- An open embedding carries a path-connected neighborhood basis to its image point. -/
+theorem path_connected_basis_of_openEmbedding
+ {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]
+ [LocallyPathConnectedSpace X] {e : X → Y}
+ (he : IsOpenEmbedding e) (x : X) :
+ (𝓝 (e x)).HasBasis
+ (fun V : Set Y => V ∈ 𝓝 (e x) ∧ IsPathConnected V) id := by
+ rw [hasBasis_self]
+ intro U hU
+ have hpre : e ⁻¹' U ∈ 𝓝 x :=
+ he.continuous.continuousAt.preimage_mem_nhds hU
+ obtain ⟨V, ⟨hV, hpath⟩, hVU⟩ := (path_connected_basis x).mem_iff.mp hpre
+ refine ⟨e '' V, ⟨he.image_mem_nhds.mpr hV, hpath.image he.continuous⟩, ?_⟩
+ exact image_subset_iff.mpr hVU
+
+/-- An LPC open neighborhood supplies the required basis in the ambient space. -/
+theorem path_connected_basis_of_open
+ {X : Type*} [TopologicalSpace X] {U : Set X}
+ (hU : IsOpen U) [LocallyPathConnectedSpace U] {x : X} (hx : x ∈ U) :
+ (𝓝 x).HasBasis (fun V : Set X => V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ exact path_connected_basis_of_openEmbedding hU.isOpenEmbedding_subtypeVal ⟨x, hx⟩
+
+/-- Restrict a chart to two corresponding subsets, using their relative open
+source and target. Neither subset is required to be open in its original ambient space. -/
+def relative_chart_homeomorph
+ {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]
+ (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)
+ (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T) :
+ {y : S // y.val ∈ p.source} ≃ₜ {z : T // z.val ∈ p.target} where
+ toFun y := ⟨⟨p y.val.val, (hmem y.val.val y.property).mp y.val.property⟩,
+ p.map_source y.property⟩
+ invFun z := ⟨⟨p.symm z.val.val,
+ (hmem (p.symm z.val.val) (p.map_target z.property)).mpr
+ (by rw [p.right_inv z.property]; exact z.val.property)⟩,
+ p.map_target z.property⟩
+ left_inv y := by
+ apply Subtype.ext
+ apply Subtype.ext
+ exact p.left_inv y.property
+ right_inv z := by
+ apply Subtype.ext
+ apply Subtype.ext
+ exact p.right_inv z.property
+ continuous_toFun := by
+ apply Continuous.subtype_mk
+ apply Continuous.subtype_mk
+ exact p.continuousOn.comp_continuous
+ (continuous_subtype_val.comp continuous_subtype_val) (fun y => y.property)
+ continuous_invFun := by
+ apply Continuous.subtype_mk
+ apply Continuous.subtype_mk
+ exact p.continuousOn_symm.comp_continuous
+ (continuous_subtype_val.comp continuous_subtype_val) (fun z => z.property)
+
+/-- Relative chart transport derives a neighborhood basis in the source subset
+from LPC of the model subset. This helper is consumed with a proved convex halfspace. -/
+theorem path_connected_basis_of_relative_chart
+ {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]
+ (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)
+ [LocallyPathConnectedSpace T]
+ (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T)
+ (x : S) (hx : x.val ∈ p.source) :
+ (𝓝 x).HasBasis (fun V : Set S => V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ let U : Set S := {y | y.val ∈ p.source}
+ let V : Set T := {z | z.val ∈ p.target}
+ have hU : IsOpen U := p.open_source.preimage continuous_subtype_val
+ have hV : IsOpen V := p.open_target.preimage continuous_subtype_val
+ letI : LocallyPathConnectedSpace V := hV.locallyPathConnectedSpace
+ let h : U ≃ₜ V := relative_chart_homeomorph p S T hmem
+ letI : LocallyPathConnectedSpace U := h.symm.locallyPathConnectedSpace
+ exact path_connected_basis_of_open hU hx
+
+/-- A scalar chart supplies the actual closed-superlevel neighborhood basis.
+
+The coordinate identity is needed only on the chart source. This theorem proves
+the relative-topology step; the separately owned literal regular-point constructor
+must supply `p`, `hx`, and `hcoord` before a noncritical-point corollary is claimed. -/
+theorem closed_superlevel_basis_of_chart
+ {d : ℕ} {g : E d → ℝ} {F : Type*}
+ [NormedAddCommGroup F] [NormedSpace ℝ F]
+ (a : ℝ) (x : {y : E d // a ≤ g y})
+ (p : OpenPartialHomeomorph (E d) (ℝ × F))
+ (hx : x.val ∈ p.source)
+ (hcoord : ∀ y ∈ p.source, (p y).fst = g y) :
+ (𝓝 x).HasBasis
+ (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ let H : Set (ℝ × F) := {z | a ≤ z.fst}
+ have hconvex : Convex ℝ H := by
+ intro u hu v hv s t hs ht hst
+ change a ≤ s • u.fst + t • v.fst
+ calc
+ a = s • a + t • a := (Convex.combo_self hst a).symm
+ _ ≤ s • u.fst + t • v.fst :=
+ add_le_add (smul_le_smul_of_nonneg_left hu hs)
+ (smul_le_smul_of_nonneg_left hv ht)
+ letI : LocallyPathConnectedSpace H := hconvex.locallyPathConnectedSpace
+ apply path_connected_basis_of_relative_chart p {y | a ≤ g y} H _ x hx
+ intro y hy
+ change a ≤ g y ↔ a ≤ (p y).fst
+ rw [hcoord y hy]
+
+/-- A point strictly above the level has a path-connected neighborhood basis in
+the closed superlevel, with continuity alone and no regularity assumption. -/
+theorem closed_superlevel_interior_basis
+ {d : ℕ} {g : E d → ℝ} (hg : Continuous g)
+ (a : ℝ) (x : {y : E d // a ≤ g y}) (hx : a < g x.val) :
+ (𝓝 x).HasBasis
+ (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ let S : Set (E d) := {y | a ≤ g y}
+ let U : Set (E d) := {y | a < g y}
+ have hU : IsOpen U := isOpen_lt continuous_const hg
+ letI : LocallyPathConnectedSpace U := hU.locallyPathConnectedSpace
+ let e : U → S := fun y => ⟨y.val, le_of_lt y.property⟩
+ have he : IsOpenEmbedding e := by
+ exact IsOpenEmbedding.id.restrict (fun y hy => le_of_lt hy) hU
+ exact path_connected_basis_of_openEmbedding he ⟨x.val, hx⟩
+
+end TorusRegularSuperlevel
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/development/b5733777504470cc1a2edfff780d0d7b7f271fdfc3db377cdb093f7e356f946d.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/development/b5733777504470cc1a2edfff780d0d7b7f271fdfc3db377cdb093f7e356f946d.lean
new file mode 100644
index 000000000..c5fd520ad
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/development/b5733777504470cc1a2edfff780d0d7b7f271fdfc3db377cdb093f7e356f946d.lean
@@ -0,0 +1,135 @@
+import Lifetime
+
+/-!
+Relative topology for closed scalar superlevels.
+
+The chart-input theorem below is a reusable topology adapter. It does not construct
+a chart from a nonzero derivative: that literal scalar-chart obligation is separately
+owned. No critical-point Morse chart or global closed-level LPC is asserted here.
+-/
+
+open Set Filter Topology
+open UniversalLaw.Spec.Lifetime
+
+namespace TorusRegularSuperlevel
+
+/-- An open embedding carries a path-connected neighborhood basis to its image point. -/
+theorem path_connected_basis_of_openEmbedding
+ {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]
+ [LocallyPathConnectedSpace X] {e : X → Y}
+ (he : IsOpenEmbedding e) (x : X) :
+ (𝓝 (e x)).HasBasis
+ (fun V : Set Y => V ∈ 𝓝 (e x) ∧ IsPathConnected V) id := by
+ rw [hasBasis_self]
+ intro U hU
+ have hpre : e ⁻¹' U ∈ 𝓝 x :=
+ he.continuous.continuousAt.preimage_mem_nhds hU
+ obtain ⟨V, ⟨hV, hpath⟩, hVU⟩ := (path_connected_basis x).mem_iff.mp hpre
+ refine ⟨e '' V, he.image_mem_nhds.mpr hV, hpath.image he.continuous, ?_⟩
+ exact image_subset_iff.mpr hVU
+
+/-- An LPC open neighborhood supplies the required basis in the ambient space. -/
+theorem path_connected_basis_of_open
+ {X : Type*} [TopologicalSpace X] {U : Set X}
+ (hU : IsOpen U) [LocallyPathConnectedSpace U] {x : X} (hx : x ∈ U) :
+ (𝓝 x).HasBasis (fun V : Set X => V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ exact path_connected_basis_of_openEmbedding hU.isOpenEmbedding_subtypeVal ⟨x, hx⟩
+
+/-- Restrict a chart to two corresponding subsets, using their relative open
+source and target. Neither subset is required to be open in its original ambient space. -/
+def relative_chart_homeomorph
+ {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]
+ (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)
+ (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T) :
+ {y : S // y.val ∈ p.source} ≃ₜ {z : T // z.val ∈ p.target} where
+ toFun y := ⟨⟨p y.val.val, (hmem y.val.val y.property).mp y.val.property⟩,
+ p.map_source y.property⟩
+ invFun z := ⟨⟨p.symm z.val.val,
+ (hmem (p.symm z.val.val) (p.map_target z.property)).mpr
+ (by rw [p.right_inv z.property]; exact z.val.property)⟩,
+ p.map_target z.property⟩
+ left_inv y := by
+ apply Subtype.ext
+ apply Subtype.ext
+ exact p.left_inv y.property
+ right_inv z := by
+ apply Subtype.ext
+ apply Subtype.ext
+ exact p.right_inv z.property
+ continuous_toFun := by
+ apply Continuous.subtype_mk
+ apply Continuous.subtype_mk
+ exact p.continuousOn.comp_continuous
+ (continuous_subtype_val.comp continuous_subtype_val) (fun y => y.property)
+ continuous_invFun := by
+ apply Continuous.subtype_mk
+ apply Continuous.subtype_mk
+ exact p.continuousOn_symm.comp_continuous
+ (continuous_subtype_val.comp continuous_subtype_val) (fun z => z.property)
+
+/-- Relative chart transport derives a neighborhood basis in the source subset
+from LPC of the model subset. This helper is consumed with a proved convex halfspace. -/
+theorem path_connected_basis_of_relative_chart
+ {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]
+ (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)
+ [LocallyPathConnectedSpace T]
+ (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T)
+ (x : S) (hx : x.val ∈ p.source) :
+ (𝓝 x).HasBasis (fun V : Set S => V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ let U : Set S := {y | y.val ∈ p.source}
+ let V : Set T := {z | z.val ∈ p.target}
+ have hU : IsOpen U := p.open_source.preimage continuous_subtype_val
+ have hV : IsOpen V := p.open_target.preimage continuous_subtype_val
+ let : LocallyPathConnectedSpace V := hV.locallyPathConnectedSpace
+ let h : U ≃ₜ V := relative_chart_homeomorph p S T hmem
+ let : LocallyPathConnectedSpace U := h.symm.locallyPathConnectedSpace
+ exact path_connected_basis_of_open hU hx
+
+/-- A scalar chart supplies the actual closed-superlevel neighborhood basis.
+
+The coordinate identity is needed only on the chart source. This theorem proves
+the relative-topology step; the separately owned literal regular-point constructor
+must supply `p`, `hx`, and `hcoord` before a noncritical-point corollary is claimed. -/
+theorem closed_superlevel_basis_of_chart
+ {d : ℕ} {g : E d → ℝ} {F : Type*}
+ [NormedAddCommGroup F] [NormedSpace ℝ F]
+ (a : ℝ) (x : {y : E d // a ≤ g y})
+ (p : OpenPartialHomeomorph (E d) (ℝ × F))
+ (hx : x.val ∈ p.source)
+ (hcoord : ∀ y ∈ p.source, (p y).fst = g y) :
+ (𝓝 x).HasBasis
+ (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ let H : Set (ℝ × F) := {z | a ≤ z.fst}
+ have hconvex : Convex ℝ H := by
+ intro u hu v hv s t hs ht hst
+ change a ≤ s • u.fst + t • v.fst
+ calc
+ a = s • a + t • a := (Convex.combo_self hst a).symm
+ _ ≤ s • u.fst + t • v.fst :=
+ add_le_add (smul_le_smul_of_nonneg_left hu hs)
+ (smul_le_smul_of_nonneg_left hv ht)
+ let : LocallyPathConnectedSpace H := hconvex.locallyPathConnectedSpace
+ apply path_connected_basis_of_relative_chart p {y | a ≤ g y} H _ x hx
+ intro y hy
+ change a ≤ g y ↔ a ≤ (p y).fst
+ rw [hcoord y hy]
+
+/-- A point strictly above the level has a path-connected neighborhood basis in
+the closed superlevel, with continuity alone and no regularity assumption. -/
+theorem closed_superlevel_interior_basis
+ {d : ℕ} {g : E d → ℝ} (hg : Continuous g)
+ (a : ℝ) (x : {y : E d // a ≤ g y}) (hx : a < g x.val) :
+ (𝓝 x).HasBasis
+ (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ let S : Set (E d) := {y | a ≤ g y}
+ let U : Set (E d) := {y | a < g y}
+ have hU : IsOpen U := isOpen_lt continuous_const hg
+ let : LocallyPathConnectedSpace U := hU.locallyPathConnectedSpace
+ let e : U → S := fun y => ⟨y.val, by
+ change a ≤ g y.val
+ exact le_of_lt (show a < g y.val from y.property)⟩
+ have he : IsOpenEmbedding e := by
+ exact IsOpenEmbedding.id.restrict (fun y hy => le_of_lt hy) hU
+ exact path_connected_basis_of_openEmbedding he ⟨x.val, hx⟩
+
+end TorusRegularSuperlevel
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutCoordinateIdentity.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutCoordinateIdentity.lean
new file mode 100644
index 000000000..cb3575107
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutCoordinateIdentity.lean
@@ -0,0 +1,24 @@
+import RegularSuperlevel
+
+/-!
+Intentionally ill-typed interface control; not a theorem or a counterexample.
+
+After the actual imported module compiles, the invocation below must be rejected:
+it supplies the chart and source-membership proof but omits the final coordinate
+identity on the chart source. The resulting function cannot inhabit the requested
+neighborhood-basis proposition. Import or syntax failure does not satisfy this
+control. This draft has not been executed.
+-/
+
+open Set Filter Topology
+open UniversalLaw.Spec.Lifetime
+
+example {d : ℕ} {g : E d → ℝ} {F : Type*}
+ [NormedAddCommGroup F] [NormedSpace ℝ F]
+ (a : ℝ) (x : {y : E d // a ≤ g y})
+ (p : OpenPartialHomeomorph (E d) (ℝ × F))
+ (hx : x.val ∈ p.source) :
+ (𝓝 x).HasBasis
+ (fun V : Set {y : E d // a ≤ g y} =>
+ V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ exact TorusRegularSuperlevel.closed_superlevel_basis_of_chart a x p hx
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutRegularOrInterior.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutRegularOrInterior.lean
new file mode 100644
index 000000000..02028d249
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutRegularOrInterior.lean
@@ -0,0 +1,22 @@
+import RegularSuperlevelLiteral
+
+/-!
+Intentionally ill-typed interface control; not a theorem or a counterexample.
+
+After the actual imported modules compile, the invocation below must be rejected:
+it supplies all preceding arguments but omits the final regular-or-strict-interior
+premise. The resulting function cannot inhabit the requested neighborhood-basis
+proposition. Import or syntax failure does not satisfy this control.
+This draft has not been executed.
+-/
+
+open Set Filter Topology
+open UniversalLaw.Spec.Lifetime
+
+example {d : ℕ} {g : E d → ℝ}
+ (hsmooth : IsSmooth d g)
+ (a : ℝ) (x : {y : E d // a ≤ g y}) :
+ (𝓝 x).HasBasis
+ (fun V : Set {y : E d // a ≤ g y} =>
+ V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ exact TorusRegularSuperlevel.closed_superlevel_path_connected_basis hsmooth a x
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/Lifetime.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/Lifetime.lean
new file mode 100644
index 000000000..f2508f7f2
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/Lifetime.lean
@@ -0,0 +1,634 @@
+import Mathlib
+
+/-!
+# Lifetime-track statements: parent Theorems A, B, C, the bounded remainder R and the
+# planar elder lower bound / density gap (statements only)
+
+Scientific effect: NONE. Formal progress of every declaration here: `specified`.
+Organizational-independence credit of this transcription: 0 (Anthropic / Claude).
+
+This module states, as `Prop`-valued definitions, the shapes of the parent lifetime
+results (1.1), (1.2), (1.3) of UNIFORM_MATRIX_CAP_AND_LIFETIME.md, of the bounded
+remainder (R1) of LIFETIME_REMAINDER.md, and of the planar lower bound (E2), the
+two-sided rate (E4) and the compact-window density gap (E11) of
+ELDER_LOWER_AND_DENSITY_GAP.md. Every statement is parametrised by interface objects
+(the Gaussian field, the superlevel-bar / elder-partner relation, and the typed pair law
+probability `p_r(b,k,R)`); it is a statement about whatever objects satisfy those
+interfaces, and the identification of those objects with the objects of the source texts
+is not part of the statement.
+
+This module is self-contained: it imports only Mathlib and re-declares, verbatim up to
+the namespace, the shared objects of `Specifications/Field.lean` (covariance, field
+interface, critical points, Hessian inertia, pairs, superlevel bars, density versions).
+The duplication is deliberate at this layer and is recorded as such.
+
+What this module does not establish. It consists only of definitions and structures;
+it states nothing as a result and proves nothing: none of the parent results, the
+remainder bound or the planar bounds is shown here, and no kernel receipt about them
+exists. It does not transcribe the explicit Gaussian/angular integral (15.2) for the
+leading coefficient `c_{d,L}` (the coefficient is characterised only through the
+leading-term asymptotics of (1.3)); it does not transcribe the regression law
+`Q_{r,b,k,R}`, the typed weight `W_r`, the full normalizer `Z_r` or the marked Kac-Rice
+representation (all informal in the source and taken as the interface field `p`); it
+does not transcribe the reading-rule amendments bound to the parent (congruence erratum,
+Section 9 replacement v1.1, wording W1, embedding radius `r < L/(4 sqrt 2)`), nor the
+marked-cylinder cap support; it asserts no numerical `C`, `r_*`, `z_*`, `ell_*` or
+coefficient value; it does not state Theorem A as consumed by Theorem R; and it does
+not state the compact-window `O(ell^(2/3))` difference for the unrestricted densities.
+The planar statements (E4) and (E11) carry the parent upper bound (1.1), for the same
+typed pair law at `d = 2`, as an explicit hypothesis, as the source does ("If the precise
+Theorem A upper bound in [LP] is consumed"; its Section 4 says the upper half of (E11)
+consumes the parent upper bound already identified there); the direct lower bound (E2) is
+unconditional, as in the source.
+Nothing here promotes, reclassifies or discharges any claim, premise or obligation of
+the registers; the landing disposition `REVIEWED_SCOPED` (lifetime-remainder) and the
+graph classification and review disposition recorded for
+`math.uniform-matrix-cap-lifetime` are transcribed from the registers by the statement
+register, never re-derived here; alignment of these statements with the sources is
+PENDING_INDEPENDENT_REVIEW.
+
+Sources (Layer 0, byte-pinned, `d6g8k5htny-coder/Math-`):
+* `lifetime-parent`: commit `c39164254ad1529ed49543743598d5dcb24bab98`, path
+ `imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md`,
+ sha256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`.
+* `lifetime-remainder`: commit `760340e921ac4ceda296b8118da936f1133e956e`, path
+ `frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md`,
+ sha256 `380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a`.
+* `elder-lower-density-gap`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md`,
+ sha256 `8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c`.
+-/
+
+namespace UniversalLaw.Spec.Lifetime
+
+open MeasureTheory
+
+/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same text, this
+namespace). The duplication is deliberate: modules of this packet import only Mathlib. -/
+
+/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised
+by `L`-periodic functions.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.
+Does not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/
+abbrev E (d : ℕ) : Type := EuclideanSpace ℝ (Fin d)
+
+/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: none.
+Does not claim: anything beyond the definition of the vector `L n`. -/
+noncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : E d :=
+ ∑ i, EuclideanSpace.single i (L * (n i : ℝ))
+
+/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,
+written as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;
+summability is a hypothesis field of `GaussianFieldInterface`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.
+Does not claim: convergence of the sum. -/
+noncomputable def thetaSum (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ ∑' n : Fin d → ℤ, Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2)
+
+/-- The periodized Gaussian covariance
+`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta
+sum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the
+summability field is meant to provide this; not shown here).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of both theta sums is the field `GaussianFieldInterface.summable`.
+Does not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/
+noncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ thetaSum d L z / thetaSum d L 0
+
+/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear
+combination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred
+stationary field with covariance `K_L`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.
+Does not claim: positive definiteness (Section 2 of the source). -/
+noncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) : ℝ :=
+ ∑ i, ∑ j, a i * a j * periodicCovariance d L (x i - x j)
+
+/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the defining predicate of a function on the torus.
+Does not claim: anything about the field. -/
+def IsLPeriodic (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ ∀ (x : E d) (n : Fin d → ℤ), g (x + latticeVec d L n) = g x
+
+/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "In particular the field has a smooth version and all finite moments of its global derivative suprema exist."
+Interface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.
+Does not claim: existence of a smooth version, or moment bounds on derivative suprema. -/
+def IsSmooth (d : ℕ) (g : E d → ℝ) : Prop :=
+ ∀ n : ℕ, ContDiff ℝ n g
+
+/-- Interface for the centred stationary Gaussian field of variance one on the torus
+`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample
+paths, their smoothness and periodicity, the Gaussian law of every finite real linear
+combination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic
+form) and the covariance identity are hypothesis fields, as is summability of the theta
+sums. Existence of such an object is not asserted.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: every field of this structure is a given property of the field, never derived.
+Does 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. -/
+structure GaussianFieldInterface (d : ℕ) (L : ℝ) where
+ /-- The underlying probability space (sample space). -/
+ Ω : Type
+ -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not
+ -- registered for typeclass resolution after this declaration; consumers bring it into
+ -- scope with `haveI := G.mΩ`.
+ [mΩ : MeasurableSpace Ω]
+ /-- The probability measure `P`. -/
+ P : Measure Ω
+ -- `P` is a probability measure (square-bracket field).
+ [isProb : IsProbabilityMeasure P]
+ /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/
+ F : Ω → E d → ℝ
+ /-- Section 2 clause: "the field has a smooth version"; every sample path is smooth. -/
+ smooth : ∀ ω, IsSmooth d (F ω)
+ /-- Section 1 clause: the field lives "On the flat torus X = R^d/(L Z^d)"; every sample path
+ is `L`-periodic. -/
+ periodic : ∀ ω, IsLPeriodic d L (F ω)
+ /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/
+ summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))
+ /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/
+ quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a
+ /-- Section 1 clause: "the centered stationary Gaussian field of variance one with covariance"
+ `K_L`; every finite real linear combination of point evaluations has the centred Gaussian
+ law whose variance is the `K_L`-quadratic form. -/
+ gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),
+ Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =
+ ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩
+ /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/
+ covariance : ∀ x y : E d, ∫ ω, F ω x * F ω y ∂P = periodicCovariance d L (x - y)
+
+/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet
+derivative: `hessian d g x v w = D^2 g(x)[v, w]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: symmetry of the form (true for `C^2` functions, not stated here). -/
+noncomputable def hessian (d : ℕ) (g : E d → ℝ) (x v w : E d) : ℝ :=
+ iteratedFDeriv ℝ 2 g x ![v, w]
+
+/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "grad f(M)=grad f(S)=0."
+Interface: none.
+Does not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/
+def IsCriticalPoint (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ fderiv ℝ g x = 0
+
+/-- Sylvester-inertia encoding of "the Hessian at `x` is nondegenerate with exactly `j`
+negative and `d - j` positive eigenvalues": there are complementary subspaces `V`, `W` of
+dimensions `j` and `d - j` on which the Hessian form is negative definite, respectively
+positive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)
+Hessians; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "The index counts negative eigenvalues."
+Interface: none.
+Does not claim: equivalence with an eigenvalue count for a non-symmetric form. -/
+def HessianHasInertia (d : ℕ) (g : E d → ℝ) (x : E d) (j : ℕ) : Prop :=
+ ∃ V W : Submodule ℝ (E d), IsCompl V W ∧
+ Module.finrank ℝ V = j ∧ Module.finrank ℝ W = d - j ∧
+ (∀ v ∈ V, v ≠ 0 → hessian d g x v v < 0) ∧
+ (∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)
+
+/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative
+eigenvalues (negative definite).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/
+def IsNondegMax (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x d
+
+/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one
+positive eigenvalue.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that such a saddle is a merging saddle of any superlevel bar. -/
+def IsIndexSaddle (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x (d - 1)
+
+/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinM (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ -((r / 2) • u)
+
+/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinS (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ (r / 2) • u
+
+/-- Torus distance between two points of `R^d`: the infimum over the lattice of
+`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the
+same torus point; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: that the height gap of an elder pair is the persistence of a bar in any persistence module. -/
+def heightGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=
+ g M - g S
+
+/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: positivity of the height gap (added separately where the source requires it). -/
+def IsCandidatePair (d : ℕ) (L : ℝ) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S
+
+/-- Morse genericity with distinct critical values on the torus: every critical point is
+nondegenerate (has some inertia) and critical points at distinct torus positions have
+distinct critical values.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Countable exhaustion now proves that Q is almost surely Morse with distinct critical values."
+Interface: none; used only as a hypothesis of the elder-partner interface clause.
+Does not claim: that sample paths are almost surely Morse (Section 8 of the source). -/
+def IsMorseDistinct (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ (∀ x : E d, IsCriticalPoint d g x → ∃ j : ℕ, HessianHasInertia d g x j) ∧
+ (∀ x y : E d, IsCriticalPoint d g x → IsCriticalPoint d g y →
+ 0 < torusDist d L x y → g x ≠ g y)
+
+/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:
+the maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary
+elder death partner relation. These are GIVEN relations; the fields transcribe the source
+clauses that characterise them on smooth periodic functions, and the elder relation is
+pinned only on the Morse distinct-value locus, exactly as the source does.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint."
+Interface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.
+Does 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. -/
+structure SuperlevelBarInterface (d : ℕ) (L : ℝ) where
+ /-- Section 8 clause: the maximin connection level
+ `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/
+ deathHeight : (E d → ℝ) → E d → ℝ
+ /-- The essential class: the global maximum, which "has no older endpoint" and whose
+ superlevel H0 bar is not finite. -/
+ IsEssential : (E d → ℝ) → E d → Prop
+ /-- Section 1 clause: "the global ordinary superlevel elder death partner of M is S". -/
+ ElderPartner : (E d → ℝ) → E d → E d → Prop
+ /-- `M` is essential exactly when no point is strictly higher (so the supremum in the
+ maximin is over an empty set, "equal to -infinity"). -/
+ essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M
+ /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly
+ higher point stays strictly above `h`. -/
+ deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,
+ h < deathHeight g M ↔
+ ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)
+ /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, "equality
+ d_f(M)=f(S)" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle "expresses
+ ordinary elder death at S". -/
+ elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →
+ ∀ M S : E d, ElderPartner g M S ↔
+ (IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)
+
+/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`
+(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus
+distance. The essential global-maximum class is excluded because `ElderPartner` requires
+`¬ IsEssential` on the Morse locus.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death."
+Interface: `I : SuperlevelBarInterface d L` is given.
+Does 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. -/
+def IsFiniteBar (d : ℕ) (L : ℝ) (I : SuperlevelBarInterface d L) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S
+
+/-- The set of pairs of a population `Pair` with both points in the fundamental domain and
+lifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of this set (a field of the density-version predicate). -/
+def pairSet (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop) (g : E d → ℝ) (A : Set ℝ) :
+ Set (E d × E d) :=
+ {p | p.1 ∈ FundDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}
+
+/-- Number of pairs of the population with lifetime in `A` and base points in the
+fundamental domain (`Set.ncard`, which is `0` for an infinite set).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of the counted set. -/
+noncomputable def pairCount (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop)
+ (g : E d → ℝ) (A : Set ℝ) : ℕ :=
+ Set.ncard (pairSet d L Pair g A)
+
+/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population
+`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost
+surely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and
+`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.
+The source's densities are only defined up to such versions. The sigma-algebra of the sample
+space is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket
+field of a bundled record is not registered for typeclass resolution after the declaration).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "These densities admit versions with"
+Interface: 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.
+Does 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. -/
+def IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (Pair : (E d → ℝ) → E d → E d → Prop) (ν : ℝ → ℝ) : Prop :=
+ haveI := G.mΩ
+ (∀ ℓ : ℝ, 0 ≤ ν ℓ) ∧ Measurable ν ∧
+ (∀ A : Set ℝ, MeasurableSet A → A ⊆ Set.Ioi 0 →
+ (∀ᵐ ω ∂G.P, (pairSet d L Pair (G.F ω) A).Finite) ∧
+ Integrable (fun ω => ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ)) G.P ∧
+ IntegrableOn ν A ∧
+ ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)
+
+/-! ### Populations of pairs -/
+
+/-- Compact-window population of Theorem B: ordered maximum / index-(d-1)-saddle pairs with
+`0 < distance <= ρ`, birth `f(M)` in `B = [bLo, bHi]` and scaled gap in `K = [kLo, kHi]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none beyond the shared predicates.
+Does not claim: anything about the off-diagonal (far) population separately (Section 14 of the source). -/
+def IsUnrestrictedPair (d : ℕ) (L : ℝ) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsCandidatePair d L g M S ∧ 0 < heightGap d g M S
+
+/-! ### The typed pair law as an interface -/
+
+/-- Interface for the weighted regression (typed pair) law: the only object consumed by the
+statements is the probability `p_r(b,k,R)` that the global ordinary superlevel elder death
+partner of the pinned maximum `M = -(r/2)u` is the pinned saddle `S = (r/2)u`, under the
+law `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}`.
+That law, its weight, its normalizer and the regression construction are informal in the
+source and are NOT transcribed; `p` is a GIVEN function of radius `r`, birth `b`, gap mark
+`k` and orthonormal frame `R` with values in `[0, 1]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S."
+Interface: `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.
+Does 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). -/
+structure PairLawInterface (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) where
+ /-- Section 1 clause: "Let p_r(b,k,R) be the Q^W probability that the global ordinary
+ superlevel elder death partner of M is S." -/
+ p : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → ℝ
+ /-- `p` is a probability: nonnegative. -/
+ p_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 ≤ p r b k R
+ /-- `p` is a probability: at most one. -/
+ p_le_one : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), p r b k R ≤ 1
+
+/-! ### The parent statements (1.1), (1.2), (1.3) -/
+
+/-- Shape of Theorem A (1.1), uniform selection candidate: for fixed `d ≥ 2`, `L > 0`,
+compact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo ≤ kHi`, there exist `r_* > 0`
+and `C` (quantified OUTSIDE the universal quantifiers over `r`, `b`, `k` and the frame)
+such that `0 <= 1 - p_r(b,k,R) <= C r^3` for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K` and all
+orthonormal frames `R`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "There exist r_*>0 and C 0` and
+windows `B`, `K` of positive length with `kLo > 0`, there are a distance cutoff `r_* > 0`, a
+constant `c_{B,K} > 0` and a constant `C_{B,K}` such that the compact-window candidate and
+elder lifetime densities admit versions `νc`, `νe` with `νc(ℓ) ~ c_{B,K} ℓ^(-1/3)`,
+`νe(ℓ) ~ c_{B,K} ℓ^(-1/3)` as `ℓ ↓ 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and
+`0 ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all sufficiently small `ℓ > 0`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),"
+Interface: `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).
+Does 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. -/
+def ParentCompactWindowDensityB (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo < bHi → 0 < kLo → kLo < kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ c : ℝ, 0 < c ∧ ∃ C : ℝ, ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsWindowPair d L rStar bLo bHi kLo kHi) νc ∧
+ IsLifetimeDensityVersion d L G (IsWindowElderPair d L rStar bLo bHi kLo kHi I) νe ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νc
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ ∃ ℓStar : ℝ, 0 < ℓStar ∧ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3)
+
+/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and
+versions `νc`, `νe` of the unrestricted candidate density and of the finite ordinary
+superlevel H0 bar density satisfy `νc(ℓ) ~ c ℓ^(-1/3)` and `νe(ℓ) ~ c ℓ^(-1/3)` as `ℓ ↓ 0`.
+The essential global-maximum class is excluded from `νe` through `IsFiniteBar`. This is the
+conclusion of (1.3) for a given `c`; it characterises `c_{d,L}` by its leading-term role,
+not by the integral (13.6)/(15.2).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "There is a positive finite constant c_{d,L} such that"
+Interface: `G` and `I` are given; versions are characterised by the integral identity only.
+Does 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. -/
+def IsUnrestrictedLeadingCoefficient (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) (c : ℝ) : Prop :=
+ 0 < c ∧ ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsUnrestrictedPair d L) νc ∧
+ IsLifetimeDensityVersion d L G (IsFiniteBar d L I) νe ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νc
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3))
+
+/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for
+fixed `d ≥ 2` and `L > 0` there is a positive finite constant `c_{d,L}` such that the
+unrestricted candidate density and the finite ordinary superlevel H0 bar density (all birth
+heights, all positive gap marks, all separations; essential global maximum excluded) admit
+versions with `ν(ℓ) ~ c_{d,L} ℓ^(-1/3)` as `ℓ ↓ 0`. Leading term only.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),"
+Interface: `G` and `I` are given; versions are characterised by the integral identity only.
+Does 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. -/
+def ParentUnrestrictedLeadingDensityC (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) : Prop :=
+ 2 ≤ d → 0 < L → ∃ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c
+
+/-! ### The bounded remainder (R1) -/
+
+/-- Shape of Theorem R (R1), bounded unrestricted short-lifetime remainder: for fixed
+`d ≥ 2`, `L > 0` and with `c = c_{d,L}` the parent leading coefficient (characterised here
+by `IsUnrestrictedLeadingCoefficient`), there are `ell_* > 0` and `C` such that versions of
+the unrestricted candidate and finite-bar densities satisfy, for `0 < ℓ ≤ ell_*`,
+`|νc(ℓ) - c ℓ^(-1/3)| ≤ C`, `0 ≤ νc(ℓ) - νe(ℓ) ≤ C` and `|νe(ℓ) - c ℓ^(-1/3)| ≤ C`.
+The `O(1)` remainder is stated with an explicit absolute-value bound.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md sha256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a
+Anchor: "|nu_cand(ell)-c ell^(-1/3)| <= C,"
+Interface: `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).
+Does 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. -/
+def RemainderBoundedR1 (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) : Prop :=
+ 2 ≤ d → 0 < L → ∀ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c →
+ ∃ ℓStar : ℝ, 0 < ℓStar ∧ ∃ C : ℝ, ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsUnrestrictedPair d L) νc ∧
+ IsLifetimeDensityVersion d L G (IsFiniteBar d L I) νe ∧
+ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ |νc ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C ∧
+ 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C ∧
+ |νe ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C
+
+/-! ### Planar elder lower bound and density gap (d = 2) -/
+
+/-- Shape of the planar direct lower bound (E2): on the fixed planar torus (`d = 2`), with
+birth `b` in a fixed compact interval, `k ∈ [kLo, kHi]` with `kLo > 0` and frames ranging
+over `O(2)`, there are `c > 0` and `r_* > 0` such that `1 - p_r(b,k,R) ≥ c r^3` for all
+`0 < r ≤ r_*`, uniformly in `b`, `k` and the frame.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c
+Anchor: "1-p_r(b,k,R) >= c r^3, 0 0` there are a distance cutoff
+`r_* > 0`, constants `c_{B,K} > 0`, `C_{B,K}` and `ell_* > 0` such that versions of the
+compact-window candidate and ordinary elder densities satisfy
+`c_{B,K} ℓ^(2/3) ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all `0 < ℓ ≤ ell_*`. The parent upper
+input is an explicit hypothesis, not folded into the conclusion. The lower half, which the
+source derives from (E2) alone, is stated under the same hypothesis because the source displays
+(E11) as one two-sided inequality; that is a hypothesis the source does not need for the lower
+half, recorded here as such.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c
+Anchor: " <= C_{B,K} ell^(2/3). (E11)"
+Interface: `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.
+Does 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. -/
+def PlanarDensityGapE11 (L : ℝ) (G : GaussianFieldInterface 2 L) (I : SuperlevelBarInterface 2 L)
+ (PL : PairLawInterface 2 L G I) (bLo bHi kLo kHi : ℝ) : Prop :=
+ ParentUniformSelectionA 2 L G I PL bLo bHi kLo kHi →
+ (0 < L → bLo < bHi → 0 < kLo → kLo < kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ c : ℝ, 0 < c ∧ ∃ C : ℝ, ∃ ℓStar : ℝ, 0 < ℓStar ∧
+ ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion 2 L G (IsWindowPair 2 L rStar bLo bHi kLo kHi) νc ∧
+ IsLifetimeDensityVersion 2 L G (IsWindowElderPair 2 L rStar bLo bHi kLo kHi I) νe ∧
+ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ c * ℓ ^ ((2 : ℝ) / 3) ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3))
+
+end UniversalLaw.Spec.Lifetime
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularPointChart.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularPointChart.lean
new file mode 100644
index 000000000..77a75a461
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularPointChart.lean
@@ -0,0 +1,64 @@
+import Lifetime
+
+/-!
+# Regular scalar chart at a noncritical point
+
+The construction is the finite-dimensional scalar specialization of Mathlib's
+strict implicit-function chart. It uses noncriticality only to prove that the
+derivative has full range.
+-/
+
+namespace UniversalLaw.Spec.Lifetime
+
+variable {d : ℕ} {g : E d → ℝ} {x : E d}
+
+/-- At a noncritical point, the scalar derivative has full range. -/
+theorem regularPointDerivative_range_eq_top (hx : ¬ IsCriticalPoint d g x) :
+ (fderiv ℝ g x).range = ⊤ := by
+ have hne : (fderiv ℝ g x).toLinearMap ≠ 0 := by
+ intro hzero
+ apply hx
+ unfold IsCriticalPoint
+ ext y
+ have hy := LinearMap.congr_fun hzero y
+ simpa using hy
+ exact Module.Dual.range_eq_top_of_ne_zero hne
+
+/-- Smoothness supplies the strict derivative used by the chart. -/
+theorem regularPointHasStrictFDerivAt (hg : IsSmooth d g) :
+ HasStrictFDerivAt g (fderiv ℝ g x) x :=
+ (hg 1).hasStrictFDerivAt (by norm_num)
+
+/-- The literal local scalar chart at a noncritical point. -/
+noncomputable def regularPointChart (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) :
+ OpenPartialHomeomorph (E d) (ℝ × (fderiv ℝ g x).ker) :=
+ (regularPointHasStrictFDerivAt hg).implicitToOpenPartialHomeomorph
+ g (fderiv ℝ g x) (regularPointDerivative_range_eq_top hx)
+
+/-- The chart's first coordinate is exactly `g`, globally as a function equality. -/
+@[simp]
+theorem regularPointChart_fst (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) (y : E d) :
+ (regularPointChart hg hx y).1 = g y := by
+ exact HasStrictFDerivAt.implicitToOpenPartialHomeomorph_fst
+ (regularPointHasStrictFDerivAt hg) (regularPointDerivative_range_eq_top hx) y
+
+/-- The chart sends the base point to `(g x, 0)`. -/
+@[simp]
+theorem regularPointChart_self (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) :
+ regularPointChart hg hx x = (g x, 0) := by
+ exact HasStrictFDerivAt.implicitToOpenPartialHomeomorph_self
+ (regularPointHasStrictFDerivAt hg) (regularPointDerivative_range_eq_top hx)
+
+/-- The base point belongs to the chart source. -/
+theorem mem_regularPointChart_source (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) :
+ x ∈ (regularPointChart hg hx).source := by
+ exact HasStrictFDerivAt.mem_implicitToOpenPartialHomeomorph_source
+ (regularPointHasStrictFDerivAt hg) (regularPointDerivative_range_eq_top hx)
+
+/-- The image base point belongs to the chart target. -/
+theorem mem_regularPointChart_target (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) :
+ (g x, 0) ∈ (regularPointChart hg hx).target := by
+ exact HasStrictFDerivAt.mem_implicitToOpenPartialHomeomorph_target
+ (regularPointHasStrictFDerivAt hg) (regularPointDerivative_range_eq_top hx)
+
+end UniversalLaw.Spec.Lifetime
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevel.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevel.lean
new file mode 100644
index 000000000..03daef580
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevel.lean
@@ -0,0 +1,140 @@
+import Lifetime
+
+/-!
+Relative topology for closed scalar superlevels.
+
+The chart-input theorem below is a reusable topology adapter. It does not construct
+a chart from a nonzero derivative: that literal scalar-chart obligation is separately
+owned. No critical-point Morse chart or global closed-level LPC is asserted here.
+-/
+
+open Set Filter Topology
+open UniversalLaw.Spec.Lifetime
+
+namespace TorusRegularSuperlevel
+
+/-- An open embedding carries a path-connected neighborhood basis to its image point. -/
+theorem path_connected_basis_of_openEmbedding
+ {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]
+ [LocallyPathConnectedSpace X] {e : X → Y}
+ (he : IsOpenEmbedding e) (x : X) :
+ (𝓝 (e x)).HasBasis
+ (fun V : Set Y => V ∈ 𝓝 (e x) ∧ IsPathConnected V) id := by
+ rw [hasBasis_self]
+ intro U hU
+ have hpre : e ⁻¹' U ∈ 𝓝 x :=
+ he.continuous.continuousAt.preimage_mem_nhds hU
+ obtain ⟨V, ⟨hV, hpath⟩, hVU⟩ := (path_connected_basis x).mem_iff.mp hpre
+ refine ⟨e '' V, he.image_mem_nhds.mpr hV, hpath.image he.continuous, ?_⟩
+ exact image_subset_iff.mpr hVU
+
+/-- An LPC open neighborhood supplies the required basis in the ambient space. -/
+theorem path_connected_basis_of_open
+ {X : Type*} [TopologicalSpace X] {U : Set X}
+ (hU : IsOpen U) [LocallyPathConnectedSpace U] {x : X} (hx : x ∈ U) :
+ (𝓝 x).HasBasis (fun V : Set X => V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ exact path_connected_basis_of_openEmbedding hU.isOpenEmbedding_subtypeVal ⟨x, hx⟩
+
+/-- Restrict a chart to two corresponding subsets, using their relative open
+source and target. Neither subset is required to be open in its original ambient space. -/
+def relative_chart_homeomorph
+ {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]
+ (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)
+ (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T) :
+ {y : S // y.val ∈ p.source} ≃ₜ {z : T // z.val ∈ p.target} where
+ toFun y := ⟨⟨p y.val.val, (hmem y.val.val y.property).mp y.val.property⟩,
+ p.map_source y.property⟩
+ invFun z := ⟨⟨p.symm z.val.val,
+ (hmem (p.symm z.val.val) (p.map_target z.property)).mpr
+ (by rw [p.right_inv z.property]; exact z.val.property)⟩,
+ p.map_target z.property⟩
+ left_inv y := by
+ apply Subtype.ext
+ apply Subtype.ext
+ exact p.left_inv y.property
+ right_inv z := by
+ apply Subtype.ext
+ apply Subtype.ext
+ exact p.right_inv z.property
+ continuous_toFun := by
+ apply Continuous.subtype_mk
+ apply Continuous.subtype_mk
+ exact p.continuousOn.comp_continuous
+ (continuous_subtype_val.comp continuous_subtype_val) (fun y => y.property)
+ continuous_invFun := by
+ apply Continuous.subtype_mk
+ apply Continuous.subtype_mk
+ exact p.continuousOn_symm.comp_continuous
+ (continuous_subtype_val.comp continuous_subtype_val) (fun z => z.property)
+
+/-- Relative chart transport derives a neighborhood basis in the source subset
+from LPC of the model subset. This helper is consumed with a proved convex halfspace. -/
+theorem path_connected_basis_of_relative_chart
+ {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]
+ (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)
+ [LocallyPathConnectedSpace T]
+ (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T)
+ (x : S) (hx : x.val ∈ p.source) :
+ (𝓝 x).HasBasis (fun V : Set S => V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ let U : Set S := {y | y.val ∈ p.source}
+ let V : Set T := {z | z.val ∈ p.target}
+ have hU : IsOpen U := p.open_source.preimage continuous_subtype_val
+ have hV : IsOpen V := p.open_target.preimage continuous_subtype_val
+ let : LocallyPathConnectedSpace V := hV.locallyPathConnectedSpace
+ let h : U ≃ₜ V := relative_chart_homeomorph p S T hmem
+ let : LocallyPathConnectedSpace U := h.symm.locallyPathConnectedSpace
+ exact path_connected_basis_of_open hU hx
+
+/-- A scalar chart supplies the actual closed-superlevel neighborhood basis.
+
+The coordinate identity is needed only on the chart source. This theorem proves
+the relative-topology step; the separately owned literal regular-point constructor
+must supply `p`, `hx`, and `hcoord` before a noncritical-point corollary is claimed. -/
+theorem closed_superlevel_basis_of_chart
+ {d : ℕ} {g : E d → ℝ} {F : Type*}
+ [NormedAddCommGroup F] [NormedSpace ℝ F]
+ (a : ℝ) (x : {y : E d // a ≤ g y})
+ (p : OpenPartialHomeomorph (E d) (ℝ × F))
+ (hx : x.val ∈ p.source)
+ (hcoord : ∀ y ∈ p.source, (p y).fst = g y) :
+ (𝓝 x).HasBasis
+ (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ let H : Set (ℝ × F) := {z | a ≤ z.fst}
+ have hconvex : Convex ℝ H := by
+ intro u hu v hv s t hs ht hst
+ change a ≤ s • u.fst + t • v.fst
+ calc
+ a = s • a + t • a := (Convex.combo_self hst a).symm
+ _ ≤ s • u.fst + t • v.fst :=
+ add_le_add (smul_le_smul_of_nonneg_left hu hs)
+ (smul_le_smul_of_nonneg_left hv ht)
+ let : LocallyPathConnectedSpace H := hconvex.locallyPathConnectedSpace
+ apply path_connected_basis_of_relative_chart p {y | a ≤ g y} H _ x hx
+ intro y hy
+ change a ≤ g y ↔ a ≤ (p y).fst
+ rw [hcoord y hy]
+
+/-- A point strictly above the level has a path-connected neighborhood basis in
+the closed superlevel, with continuity alone and no regularity assumption. -/
+theorem closed_superlevel_interior_basis
+ {d : ℕ} {g : E d → ℝ} (hg : Continuous g)
+ (a : ℝ) (x : {y : E d // a ≤ g y}) (hx : a < g x.val) :
+ (𝓝 x).HasBasis
+ (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ let S : Set (E d) := {y | a ≤ g y}
+ let U : Set (E d) := {y | a < g y}
+ have hU : IsOpen U := isOpen_lt continuous_const hg
+ let : LocallyPathConnectedSpace U := hU.locallyPathConnectedSpace
+ let e : U → S := fun y => ⟨y.val, by
+ change a ≤ g y.val
+ exact le_of_lt (show a < g y.val from y.property)⟩
+ have he : IsOpenEmbedding e := by
+ have hmaps : MapsTo (id : E d → E d) U S := by
+ intro y hy
+ change a ≤ g y
+ exact le_of_lt (show a < g y from hy)
+ exact (IsOpenEmbedding.id : IsOpenEmbedding (id : E d → E d)).restrict
+ (s := U) (t := S) hmaps hU
+ exact path_connected_basis_of_openEmbedding he ⟨x.val, hx⟩
+
+end TorusRegularSuperlevel
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelAxiomAudit.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelAxiomAudit.lean
new file mode 100644
index 000000000..40e334d0e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelAxiomAudit.lean
@@ -0,0 +1,62 @@
+import RegularSuperlevelLiteral
+import Lean.Elab.Command
+import Lean.Util.CollectAxioms
+
+/-! Complete module-origin census for C297 and its exact Lifetime/peer-chart inputs.
+Includes generated and private declarations. Only the standard axioms are allowed.
+Command success is scoped execution evidence, not scientific promotion. -/
+
+#print axioms TorusRegularSuperlevel.closed_superlevel_regular_basis
+#print axioms TorusRegularSuperlevel.closed_superlevel_path_connected_basis
+#print axioms TorusRegularSuperlevel.closed_superlevel_interior_basis
+#check @TorusRegularSuperlevel.closed_superlevel_regular_basis
+#check @TorusRegularSuperlevel.closed_superlevel_path_connected_basis
+#check @TorusRegularSuperlevel.closed_superlevel_interior_basis
+
+open Lean Elab Command in
+run_cmd do
+ let env := (← getEnv).setExporting false
+ let allowed : Array Name := #[`propext, `Classical.choice, `Quot.sound]
+ let modules : Array Name := #[`Lifetime, `RegularPointChart,
+ `RegularSuperlevel, `RegularSuperlevelLiteral]
+ let constants := env.constants.toList
+ let mut allNames : Array Name := #[]
+ for modName in modules do
+ let some idx := env.getModuleIdx? modName
+ | throwError "missing audited module: {modName}"
+ let names := (constants.filterMap fun (name, _) =>
+ if env.getModuleIdxFor? name == some idx then some name else none).toArray.qsort Name.lt
+ if names.isEmpty then throwError "empty declaration inventory: {modName}"
+ liftIO <| IO.eprintln s!"SUPERLEVEL_AUDIT_PROGRESS {modName} COUNT {names.size}"
+ logInfo m!"SUPERLEVEL_AUDIT_MODULE {modName} COUNT {names.size}"
+ for name in names do
+ if (env.checked.get.find? name).isNone then
+ throwError "missing kernel declaration: {name}"
+ let axs ← Lean.collectAxioms name
+ logInfo m!"SUPERLEVEL_AUDIT_DECL {name} AXIOMS {axs}"
+ for ax in axs do
+ unless allowed.contains ax do
+ throwError "forbidden transitive axiom {ax} in {name}"
+ allNames := allNames.push name
+ let required : Array Name := #[
+ `UniversalLaw.Spec.Lifetime.IsSmooth,
+ `UniversalLaw.Spec.Lifetime.IsCriticalPoint,
+ `UniversalLaw.Spec.Lifetime.regularPointDerivative_range_eq_top,
+ `UniversalLaw.Spec.Lifetime.regularPointHasStrictFDerivAt,
+ `UniversalLaw.Spec.Lifetime.regularPointChart,
+ `UniversalLaw.Spec.Lifetime.regularPointChart_fst,
+ `UniversalLaw.Spec.Lifetime.regularPointChart_self,
+ `UniversalLaw.Spec.Lifetime.mem_regularPointChart_source,
+ `UniversalLaw.Spec.Lifetime.mem_regularPointChart_target,
+ `TorusRegularSuperlevel.path_connected_basis_of_openEmbedding,
+ `TorusRegularSuperlevel.path_connected_basis_of_open,
+ `TorusRegularSuperlevel.relative_chart_homeomorph,
+ `TorusRegularSuperlevel.path_connected_basis_of_relative_chart,
+ `TorusRegularSuperlevel.closed_superlevel_basis_of_chart,
+ `TorusRegularSuperlevel.closed_superlevel_interior_basis,
+ `TorusRegularSuperlevel.closed_superlevel_regular_basis,
+ `TorusRegularSuperlevel.closed_superlevel_path_connected_basis]
+ for name in required do
+ unless allNames.contains name do
+ throwError "required declaration omitted from audit: {name}"
+ logInfo m!"SUPERLEVEL_AUDIT_STANDARD_ONLY_PASS COUNT {allNames.size}"
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelLiteral.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelLiteral.lean
new file mode 100644
index 000000000..a7a803960
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelLiteral.lean
@@ -0,0 +1,55 @@
+import RegularSuperlevel
+import RegularPointChart
+
+/-!
+Draft literal regular-point consumers of the separately owned scalar chart.
+
+Released dependency: Research Task Watch's RegularPointChart.lean at Math-
+commit 72edcf5b93be45c29f2d10a26f7d8e861a48f528, 2,767 bytes, SHA-256
+5568c8d6e03f7064cd5924ebe2814ae746100505ae31789d5c975902528f9fa2.
+That source was frozen and released by its owner. This C297 consumer has not
+yet been compiled or kernel-checked.
+It neither reimplements the chart nor modifies the topology candidate under replay.
+
+The public conclusions are actual path-connected neighborhood bases in the
+closed-superlevel subtype. The critical-boundary case and quotient transport
+remain outside these statements.
+-/
+
+open Set Filter Topology
+open UniversalLaw.Spec.Lifetime
+
+namespace TorusRegularSuperlevel
+
+/-- At a literal noncritical point, the closed superlevel has a neighborhood
+basis of path-connected sets. The supplied smoothness and noncriticality
+construct the chart through the separately owned regular-point module. -/
+theorem closed_superlevel_regular_basis
+ {d : ℕ} {g : E d → ℝ}
+ (hsmooth : IsSmooth d g)
+ (a : ℝ) (x : {y : E d // a ≤ g y})
+ (hregular : ¬ IsCriticalPoint d g x.val) :
+ (𝓝 x).HasBasis
+ (fun V : Set {y : E d // a ≤ g y} =>
+ V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ exact closed_superlevel_basis_of_chart a x
+ (regularPointChart hsmooth hregular)
+ (mem_regularPointChart_source hsmooth hregular)
+ (fun y _ => regularPointChart_fst hsmooth hregular y)
+
+/-- The pointwise basis required for eventual global LPC holds at every
+strict-interior or literal regular point of the closed superlevel.
+No chart or LPC hypothesis appears in this public interface. -/
+theorem closed_superlevel_path_connected_basis
+ {d : ℕ} {g : E d → ℝ}
+ (hsmooth : IsSmooth d g)
+ (a : ℝ) (x : {y : E d // a ≤ g y})
+ (hx : a < g x.val ∨ ¬ IsCriticalPoint d g x.val) :
+ (𝓝 x).HasBasis
+ (fun V : Set {y : E d // a ≤ g y} =>
+ V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ rcases hx with hinterior | hregular
+ · exact closed_superlevel_interior_basis (hsmooth 0).continuous a x hinterior
+ · exact closed_superlevel_regular_basis hsmooth a x hregular
+
+end TorusRegularSuperlevel
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/ConfluentIntegralIdentities.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/ConfluentIntegralIdentities.lean
new file mode 100644
index 000000000..eafb41ab0
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/ConfluentIntegralIdentities.lean
@@ -0,0 +1,204 @@
+import Mathlib.Analysis.Calculus.IteratedDeriv.Defs
+import Mathlib.Analysis.Calculus.Deriv.Pow
+import Mathlib.MeasureTheory.Integral.IntervalIntegral.IntegrationByParts
+import Mathlib.Tactic.FieldSimp
+import Mathlib.Tactic.Linarith
+import Mathlib.Tactic.Ring
+
+/-!
+# Exact integral formulas for confluent pins and adjusted endpoints
+
+All integrals use the ordinary oriented interval `[-1/2,1/2]`. The physical
+radius can have either sign. These deterministic scalar formulas use only C3
+regularity of F and C2 regularity of H; no integral identity is a premise.
+See SOURCE_CONFLUENT_INTEGRALS.md for the frozen source contract.
+-/
+
+noncomputable section
+
+open MeasureTheory Set
+open scoped Interval
+
+namespace I4ConfluentIntegralIdentities
+
+def pin3 (F : ℝ → ℝ) (r : ℝ) : ℝ :=
+ (deriv F (r / 2) - deriv F (-r / 2)) / r
+
+def pin4 (H : ℝ → ℝ) (r : ℝ) : ℝ :=
+ (H (r / 2) - H (-r / 2)) / r
+
+def pin5 (F : ℝ → ℝ) (r : ℝ) : ℝ :=
+ (12 / r ^ 2) * ((deriv F (r / 2) + deriv F (-r / 2)) / 2 -
+ (F (r / 2) - F (-r / 2)) / r)
+
+private theorem scaled_hasDerivAt (g g' : ℝ → ℝ)
+ (hg : ∀ x, HasDerivAt g (g' x) x) (r u : ℝ) :
+ HasDerivAt (fun u => g (r * u)) (r * g' (r * u)) u := by
+ have hru : HasDerivAt (fun u : ℝ => r*u) r u := by
+ simpa [id] using (hasDerivAt_id u).const_mul r
+ convert (hg (r*u)).comp u hru using 1 <;> simp [Function.comp_def, mul_comm]
+
+private theorem average_identity (g g' : ℝ → ℝ)
+ (hg : ∀ x, HasDerivAt g (g' x) x) (hc : Continuous g') (r : ℝ) (hr : r ≠ 0) :
+ (g (r / 2) - g (-r / 2)) / r =
+ ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), g' (r * u) := by
+ have hc' : Continuous (fun u => r * g' (r * u)) :=
+ continuous_const.mul (hc.comp (continuous_const.mul continuous_id))
+ have h := intervalIntegral.integral_eq_sub_of_hasDerivAt
+ (a := (-1/2 : ℝ)) (b := (1/2 : ℝ))
+ (fun u _ => scaled_hasDerivAt g g' hg r u) (hc'.intervalIntegrable _ _)
+ rw [intervalIntegral.integral_const_mul] at h
+ have hleft : r * (-1/2) = -r / 2 := by ring
+ have hright : r * (1/2) = r / 2 := by ring
+ rw [hleft, hright] at h
+ apply (div_eq_iff hr).2
+ nlinarith [h]
+
+private theorem left_endpoint_identity (g g' : ℝ → ℝ)
+ (hg : ∀ x, HasDerivAt g (g' x) x) (hc : Continuous g') (r : ℝ) (hr : r ≠ 0) :
+ (g (-r/2) - ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), g (r*u)) / r =
+ -(∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (1/2-u) * g' (r*u)) := by
+ have hgc : Continuous g :=
+ (show Differentiable ℝ g from fun x => (hg x).differentiableAt).continuous
+ have hc' : Continuous (fun u => r * g' (r*u)) :=
+ continuous_const.mul (hc.comp (continuous_const.mul continuous_id))
+ have h := intervalIntegral.integral_mul_deriv_eq_deriv_mul_of_hasDerivAt
+ (a := (-1/2 : ℝ)) (b := (1/2 : ℝ))
+ (u := fun u : ℝ => 1/2-u) (u' := fun _ : ℝ => -1)
+ (v := fun u => g (r*u)) (v' := fun u => r * g' (r*u))
+ (by fun_prop) (hgc.comp (continuous_const.mul continuous_id)).continuousOn
+ (fun u _ => by
+ convert (hasDerivAt_id u).const_sub (1/2 : ℝ) using 1 <;> simp [id])
+ (fun u _ => scaled_hasDerivAt g g' hg r u)
+ (continuous_const.intervalIntegrable _ _) (hc'.intervalIntegrable _ _)
+ have hfun : (fun u : ℝ => (1/2-u) * (r * g' (r*u))) =
+ (fun u => r * ((1/2-u) * g' (r*u))) := by funext u; ring
+ rw [hfun, intervalIntegral.integral_const_mul, intervalIntegral.integral_const_mul] at h
+ norm_num [mul_div_assoc, mul_neg] at h
+ apply (div_eq_iff hr).2
+ norm_num at h ⊢
+ rw [show -(r * (1/2 : ℝ)) = -r/2 by ring] at h
+ nlinarith [h]
+
+private theorem right_endpoint_identity (g g' : ℝ → ℝ)
+ (hg : ∀ x, HasDerivAt g (g' x) x) (hc : Continuous g') (r : ℝ) (hr : r ≠ 0) :
+ (g (r/2) - ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), g (r*u)) / r =
+ ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (u+1/2) * g' (r*u) := by
+ have hgc : Continuous g :=
+ (show Differentiable ℝ g from fun x => (hg x).differentiableAt).continuous
+ have hc' : Continuous (fun u => r * g' (r*u)) :=
+ continuous_const.mul (hc.comp (continuous_const.mul continuous_id))
+ have h := intervalIntegral.integral_mul_deriv_eq_deriv_mul_of_hasDerivAt
+ (a := (-1/2 : ℝ)) (b := (1/2 : ℝ))
+ (u := fun u : ℝ => u+1/2) (u' := fun _ : ℝ => 1)
+ (v := fun u => g (r*u)) (v' := fun u => r * g' (r*u))
+ (by fun_prop) (hgc.comp (continuous_const.mul continuous_id)).continuousOn
+ (fun u _ => by simpa [id] using (hasDerivAt_id u).add_const (1/2 : ℝ))
+ (fun u _ => scaled_hasDerivAt g g' hg r u)
+ (continuous_const.intervalIntegrable _ _) (hc'.intervalIntegrable _ _)
+ have hfun : (fun u : ℝ => (u+1/2) * (r * g' (r*u))) =
+ (fun u => r * ((u+1/2) * g' (r*u))) := by funext u; ring
+ rw [hfun, intervalIntegral.integral_const_mul] at h
+ norm_num [mul_div_assoc, mul_neg] at h
+ apply (div_eq_iff hr).2
+ norm_num at h ⊢
+ rw [show r * (1/2 : ℝ) = r/2 by ring] at h
+ nlinarith [h]
+
+private theorem peano_identity (f f1 f2 f3 : ℝ → ℝ)
+ (h0 : ∀ x, HasDerivAt f (f1 x) x)
+ (h1 : ∀ x, HasDerivAt f1 (f2 x) x)
+ (h2 : ∀ x, HasDerivAt f2 (f3 x) x) (hc3 : Continuous f3)
+ (r : ℝ) (hr : r ≠ 0) :
+ (12 / r ^ 2) * ((f1 (r/2) + f1 (-r/2))/2 - (f (r/2) - f (-r/2))/r) =
+ 6 * ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (1/4-u^2) * f3 (r*u) := by
+ let A : ℝ → ℝ := fun u =>
+ (1/4-u^2)*f2 (r*u) + (2/r)*u*f1 (r*u) - (2/r^2)*f (r*u)
+ have hA (u : ℝ) : HasDerivAt A (r*((1/4-u^2)*f3 (r*u))) u := by
+ have hru : HasDerivAt (fun u : ℝ => r*u) r u := by
+ simpa [id] using (hasDerivAt_id u).const_mul r
+ have hK : HasDerivAt (fun u : ℝ => 1/4-u^2) (-2*u) u := by
+ convert ((hasDerivAt_id u).pow 2).const_sub (1/4 : ℝ) using 1 <;> simp [id]
+ have hU : HasDerivAt (fun u : ℝ => (2/r)*u) (2/r) u := by
+ simpa [id] using (hasDerivAt_id u).const_mul (2/r)
+ have h := ((hK.mul ((h2 (r*u)).comp u hru)).add
+ (hU.mul ((h1 (r*u)).comp u hru))).sub (((h0 (r*u)).comp u hru).const_mul (2/r^2))
+ convert h using 1
+ · rfl
+ · dsimp [Function.comp_def]
+ field_simp [hr]
+ ring
+ have hcont : Continuous (fun u : ℝ => r*((1/4-u^2)*f3 (r*u))) :=
+ (continuous_const.sub (continuous_id.pow 2)).mul
+ (hc3.comp (continuous_const.mul continuous_id)) |>.const_mul r
+ have hft := intervalIntegral.integral_eq_sub_of_hasDerivAt
+ (fun u _ => hA u) (hcont.intervalIntegrable (-1/2 : ℝ) (1/2 : ℝ))
+ rw [intervalIntegral.integral_const_mul] at hft
+ norm_num [A, mul_div_assoc, mul_neg] at hft
+ field_simp [hr] at hft ⊢
+ nlinarith [hft]
+
+private theorem iterated_hasDerivAt {F : ℝ → ℝ} {n : ℕ}
+ (hF : ContDiff ℝ n F) (k : ℕ) (hk : k < n) (x : ℝ) :
+ HasDerivAt (iteratedDeriv k F) (iteratedDeriv (k+1) F x) x := by
+ rw [iteratedDeriv_succ]
+ exact (hF.differentiable_iteratedDeriv k (by exact_mod_cast hk) x).hasDerivAt
+
+/-- The x-derivative divided difference is the exact average second derivative. -/
+theorem pin3_integral (F : ℝ → ℝ) (hF : ContDiff ℝ 3 F) (r : ℝ) (hr : r ≠ 0) :
+ pin3 F r = ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), iteratedDeriv 2 F (r*u) := by
+ simpa [pin3, iteratedDeriv_one] using average_identity (iteratedDeriv 1 F)
+ (iteratedDeriv 2 F) (iterated_hasDerivAt hF 1 (by norm_num))
+ (hF.continuous_iteratedDeriv 2 (by norm_num)) r hr
+
+/-- H is the y-derivative curve: the pin uses H itself, not its derivative. -/
+theorem pin4_integral (H : ℝ → ℝ) (hH : ContDiff ℝ 2 H) (r : ℝ) (hr : r ≠ 0) :
+ pin4 H r = ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), deriv H (r*u) := by
+ simpa [pin4, iteratedDeriv_one] using average_identity (iteratedDeriv 0 H)
+ (iteratedDeriv 1 H) (iterated_hasDerivAt hH 0 (by norm_num))
+ (hH.continuous_iteratedDeriv 1 (by norm_num)) r hr
+
+/-- The exact cubic confluent pin is its normalized Peano-kernel integral. -/
+theorem pin5_integral (F : ℝ → ℝ) (hF : ContDiff ℝ 3 F) (r : ℝ) (hr : r ≠ 0) :
+ pin5 F r = 6 * ∫ u in (-1/2 : ℝ)..(1/2 : ℝ),
+ (1/4-u^2) * iteratedDeriv 3 F (r*u) := by
+ simpa [pin5, iteratedDeriv_one] using peano_identity (iteratedDeriv 0 F)
+ (iteratedDeriv 1 F) (iteratedDeriv 2 F) (iteratedDeriv 3 F)
+ (iterated_hasDerivAt hF 0 (by norm_num))
+ (iterated_hasDerivAt hF 1 (by norm_num))
+ (iterated_hasDerivAt hF 2 (by norm_num))
+ (hF.continuous_iteratedDeriv 3 (by norm_num)) r hr
+
+theorem adjusted_second_left (F : ℝ → ℝ) (hF : ContDiff ℝ 3 F) (r : ℝ) (hr : r ≠ 0) :
+ (iteratedDeriv 2 F (-r/2) - pin3 F r) / r =
+ -(∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (1/2-u) * iteratedDeriv 3 F (r*u)) := by
+ rw [pin3_integral F hF r hr]
+ exact left_endpoint_identity (iteratedDeriv 2 F) (iteratedDeriv 3 F)
+ (iterated_hasDerivAt hF 2 (by norm_num))
+ (hF.continuous_iteratedDeriv 3 (by norm_num)) r hr
+
+theorem adjusted_second_right (F : ℝ → ℝ) (hF : ContDiff ℝ 3 F) (r : ℝ) (hr : r ≠ 0) :
+ (iteratedDeriv 2 F (r/2) - pin3 F r) / r =
+ ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (u+1/2) * iteratedDeriv 3 F (r*u) := by
+ rw [pin3_integral F hF r hr]
+ exact right_endpoint_identity (iteratedDeriv 2 F) (iteratedDeriv 3 F)
+ (iterated_hasDerivAt hF 2 (by norm_num))
+ (hF.continuous_iteratedDeriv 3 (by norm_num)) r hr
+
+theorem adjusted_transverse_left (H : ℝ → ℝ) (hH : ContDiff ℝ 2 H) (r : ℝ) (hr : r ≠ 0) :
+ (deriv H (-r/2) - pin4 H r) / r =
+ -(∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (1/2-u) * iteratedDeriv 2 H (r*u)) := by
+ rw [pin4_integral H hH r hr]
+ simpa [iteratedDeriv_one] using left_endpoint_identity (iteratedDeriv 1 H)
+ (iteratedDeriv 2 H) (iterated_hasDerivAt hH 1 (by norm_num))
+ (hH.continuous_iteratedDeriv 2 (by norm_num)) r hr
+
+theorem adjusted_transverse_right (H : ℝ → ℝ) (hH : ContDiff ℝ 2 H) (r : ℝ) (hr : r ≠ 0) :
+ (deriv H (r/2) - pin4 H r) / r =
+ ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (u+1/2) * iteratedDeriv 2 H (r*u) := by
+ rw [pin4_integral H hH r hr]
+ simpa [iteratedDeriv_one] using right_endpoint_identity (iteratedDeriv 1 H)
+ (iteratedDeriv 2 H) (iterated_hasDerivAt hH 1 (by norm_num))
+ (hH.continuous_iteratedDeriv 2 (by norm_num)) r hr
+
+end I4ConfluentIntegralIdentities
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/ContactJetCovariance.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/ContactJetCovariance.lean
new file mode 100644
index 000000000..a6614b817
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/ContactJetCovariance.lean
@@ -0,0 +1,169 @@
+import Mathlib.LinearAlgebra.Matrix.PosDef
+import Mathlib.LinearAlgebra.Matrix.Notation
+import Mathlib.Analysis.Normed.Ring.InfiniteSum
+import Mathlib.Analysis.Normed.Module.FiniteDimension
+import Mathlib.Tactic.FinCases
+import Mathlib.Tactic.Linarith
+
+/-!
+# Seven-mode certificate for contact-jet covariance
+
+The row order is `(f, fx, fy, fxx, fxy, fxxx, fyy)`, with selected columns
+`(DC, cos(1,0), cos(0,1), cos(1,1), sin(1,0), sin(2,0), sin(0,1))`.
+Nonzero mode amplitudes are retained. The witness forces strict positivity of an
+infinite coefficient Gram matrix by its sum-of-squares quadratic identity.
+
+This is a coefficient certificate. Applying it to the literal smooth source requires
+the exact derivative-coefficient identities and physical covariance identification;
+these are not premises that may be silently omitted. See `SOURCE_CONTACT_GRAM.md`.
+-/
+
+open Matrix
+open scoped BigOperators Matrix
+set_option autoImplicit false
+
+namespace I4ContactGram
+
+def contactWitness (c : ℝ) : Matrix (Fin 7) (Fin 7) ℝ :=
+ !![1,1,1,1,0,0,0;
+ 0,0,0,0,c,2*c,0;
+ 0,0,0,0,0,0,c;
+ 0,-c^2,0,-c^2,0,0,0;
+ 0,0,0,-c^2,0,0,0;
+ 0,0,0,0,-c^3,-8*c^3,0;
+ 0,0,-c^2,-c^2,0,0,0]
+
+lemma contactWitness_transpose_mulVec_eq_zero {c : ℝ} (hc : c ≠ 0)
+ (z : Fin 7 → ℝ) (h : (contactWitness c)ᵀ *ᵥ z = 0) : z = 0 := by
+ have hs (s : Fin 7) := congrFun h s
+ have h0 : z 0 = 0 := by
+ simpa [contactWitness, Matrix.mulVec, dotProduct, Fin.sum_univ_succ] using hs 0
+ have h1 := hs 1
+ have h2 := hs 2
+ have h3 := hs 3
+ have h4 := hs 4
+ have h5 := hs 5
+ have h6 := hs 6
+ simp [contactWitness, Matrix.mulVec, dotProduct, Fin.sum_univ_succ, h0] at h1 h2 h3 h4 h5 h6
+ have hc2 : c^2 ≠ 0 := pow_ne_zero _ hc
+ have hc3 : c^3 ≠ 0 := pow_ne_zero _ hc
+ have hz3 : z 3 = 0 := h1.resolve_left hc
+ have hz6 : z 6 = 0 := h2.resolve_left hc
+ have hz4 : z 4 = 0 := (mul_eq_zero.mp (show c^2 * z 4 = 0 by nlinarith [h3])).resolve_left hc2
+ have hz5 : z 5 = 0 := (mul_eq_zero.mp (show c^3 * z 5 = 0 by nlinarith [h4, h5])).resolve_left hc3
+ have hz1 : z 1 = 0 := (mul_eq_zero.mp (show c * z 1 = 0 by nlinarith [h4])).resolve_left hc
+ have hz2 : z 2 = 0 := h6.resolve_left hc
+ funext i
+ fin_cases i <;> assumption
+
+lemma contactWitness_transpose_injective {c : ℝ} (hc : c ≠ 0) :
+ Function.Injective ((contactWitness c)ᵀ).mulVec := by
+ intro x y h
+ apply sub_eq_zero.mp
+ apply contactWitness_transpose_mulVec_eq_zero hc
+ simp [Matrix.mulVec_sub, h]
+
+lemma contactWitness_amplitude_transpose_injective {c : ℝ} (hc : c ≠ 0)
+ (a : Fin 7 → ℝ) (ha : ∀ s, a s ≠ 0) :
+ Function.Injective ((contactWitness c * diagonal a)ᵀ).mulVec := by
+ intro x y h
+ apply contactWitness_transpose_injective hc
+ funext s
+ have hs := congrFun h s
+ simp only [Matrix.transpose_mul, Matrix.diagonal_transpose, ← Matrix.mulVec_mulVec,
+ Matrix.mulVec_diagonal] at hs
+ exact mul_left_cancel₀ (ha s) hs
+
+noncomputable def coefficientGram {ι : Type*} {n : ℕ} (coeff : Fin n → ι → ℝ) :
+ Matrix (Fin n) (Fin n) ℝ := fun i j => ∑' m, coeff i m * coeff j m
+
+lemma coefficient_product_summable {ι : Type*} {a b : ι → ℝ}
+ (ha : Summable a) (hb : Summable b) : Summable (fun m => a m * b m) := by
+ have hp := summable_mul_of_summable_norm ha.norm hb.norm
+ simpa only [Function.comp_def] using hp.comp_injective
+ (show Function.Injective (fun m : ι => (m,m)) from
+ fun i j h => congrArg Prod.fst h)
+
+lemma coefficientGram_quadratic_hasSum {ι : Type*} {n : ℕ} (coeff : Fin n → ι → ℝ)
+ (hc : ∀ i, Summable (coeff i)) (z : Fin n → ℝ) :
+ HasSum (fun m => (∑ i, z i * coeff i m)^2)
+ (star z ⬝ᵥ (coefficientGram coeff *ᵥ z)) := by
+ have hs : HasSum (fun m => ∑ i, ∑ j, z i * (coeff i m * coeff j m) * z j)
+ (∑ i, ∑ j, z i * coefficientGram coeff i j * z j) :=
+ hasSum_sum (fun i _ => hasSum_sum (fun j _ =>
+ (((coefficient_product_summable (hc i) (hc j)).hasSum).mul_left (z i)).mul_right (z j)))
+ convert hs using 1
+ · funext m
+ rw [pow_two, Finset.sum_mul_sum]
+ apply Finset.sum_congr rfl
+ intro i _
+ apply Finset.sum_congr rfl
+ intro j _
+ ring
+ · simp [Matrix.mulVec, dotProduct, Finset.mul_sum, mul_assoc]
+
+lemma coefficientGram_posDef_of_separating {ι : Type*} {n : ℕ}
+ (coeff : Fin n → ι → ℝ) (hc : ∀ i, Summable (coeff i))
+ (hsep : ∀ z : Fin n → ℝ, z ≠ 0 → ∃ m, (∑ i, z i * coeff i m) ≠ 0) :
+ (coefficientGram coeff).PosDef := by
+ apply Matrix.PosDef.of_dotProduct_mulVec_pos
+ · ext i j
+ simp only [coefficientGram, Matrix.conjTranspose_apply, star_trivial]
+ apply tsum_congr
+ intro m
+ ring
+ · intro z hz
+ have hs := coefficientGram_quadratic_hasSum coeff hc z
+ rw [← hs.tsum_eq]
+ obtain ⟨m, hm⟩ := hsep z hz
+ exact hs.summable.tsum_pos (fun m => sq_nonneg _) m (sq_pos_of_ne_zero hm)
+
+/-- Seven explicit independent mode columns force positivity of the entire infinite Gram sum.
+No positive-definiteness or invertibility conclusion is an input premise. -/
+theorem contact_coefficientGram_posDef {ι : Type*} (coeff : Fin 7 → ι → ℝ)
+ (hcoeff : ∀ i, Summable (coeff i)) {c : ℝ} (hc : c ≠ 0)
+ (mode : Fin 7 → ι) (a : Fin 7 → ℝ) (ha : ∀ s, a s ≠ 0)
+ (hcolumns : ∀ i s, coeff i (mode s) = a s * contactWitness c i s) :
+ (coefficientGram coeff).PosDef := by
+ apply coefficientGram_posDef_of_separating coeff hcoeff
+ intro z hz
+ classical
+ by_cases hex : ∃ m, (∑ i, z i * coeff i m) ≠ 0
+ · exact hex
+ · exfalso
+ apply hz
+ apply contactWitness_amplitude_transpose_injective hc a ha
+ rw [Matrix.mulVec_zero]
+ funext s
+ have hm : (∑ i, z i * coeff i (mode s)) = 0 :=
+ not_ne_iff.mp (not_exists.mp hex (mode s))
+ simp_rw [hcolumns] at hm
+ simpa [Matrix.mulVec, dotProduct, Matrix.mul_diagonal, mul_comm, mul_left_comm,
+ mul_assoc] using hm
+
+/-- A positive-definite six-plus-one block covariance has strictly positive scalar Schur complement. -/
+theorem contact_schur_pos (A : Matrix (Fin 6) (Fin 6) ℝ)
+ (B : Matrix (Fin 6) Unit ℝ) (D : Matrix Unit Unit ℝ)
+ (hG : (Matrix.fromBlocks A B Bᴴ D).PosDef) :
+ A.PosDef ∧ 0 < (D - Bᴴ * A⁻¹ * B) () () := by
+ have hA : A.PosDef := by
+ convert hG.submatrix (e := Sum.inl) Sum.inl_injective using 1
+ ext i j
+ rfl
+ let _ : Invertible A := hA.isUnit.invertible
+ let y : Unit → ℝ := fun _ => 1
+ let x : Fin 6 → ℝ := -((A⁻¹ * B) *ᵥ y)
+ have hxy : Sum.elim x y ≠ 0 := by
+ intro h
+ have hh := congrFun h (Sum.inr ())
+ simp [y] at hh
+ have hp := hG.dotProduct_mulVec_pos hxy
+ rw [Matrix.dotProduct_mulVec,
+ Matrix.schur_complement_eq₁₁ B D x y hA.isHermitian] at hp
+ dsimp [x] at hp
+ rw [neg_add_cancel, dotProduct_zero, zero_add] at hp
+ refine ⟨hA, ?_⟩
+ simpa [y, Matrix.vecMul, dotProduct] using hp
+
+
+end I4ContactGram
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/GaussianRegressionLimits.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/GaussianRegressionLimits.lean
new file mode 100644
index 000000000..4e5485667
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/GaussianRegressionLimits.lean
@@ -0,0 +1,159 @@
+import Mathlib.Topology.Instances.Matrix
+import Mathlib.Topology.Algebra.GroupWithZero
+import Mathlib.Topology.Algebra.Ring.Real
+import Mathlib.Topology.Order.LeftRightNhds
+import Mathlib.Analysis.Normed.Group.Real
+import Mathlib.Analysis.Normed.Group.Constructions
+import Mathlib.Analysis.Normed.Group.Continuity
+import Mathlib.Tactic.Linarith
+import Mathlib.Tactic.Positivity
+import Mathlib.Tactic.FunProp
+
+/-!
+# Regression parameter limits and uniform small-radius bounds
+
+Only the limiting pin covariance is assumed invertible. Current inverses,
+regression means/covariances and their uniform bounds are consequences of the
+input block limits. No target covariance inverse or zero-mean premise occurs.
+See SOURCE_REGRESSION_LIMITS.md for the frozen source contract.
+-/
+
+noncomputable section
+namespace I4GaussianRegressionLimits
+open Matrix Filter
+open scoped Topology
+set_option autoImplicit false
+
+/-- The actual regression mean for a centered prior and target d. -/
+def regressionMean {p t : Type*} [Fintype p] [DecidableEq p]
+ (G : Matrix p p ℝ) (C : Matrix t p ℝ) (d : p → ℝ) : t → ℝ :=
+ (C * G⁻¹) *ᵥ d
+
+/-- The Schur covariance; no inverse of this target block is taken. -/
+def regressionCovariance {p t : Type*} [Fintype p] [DecidableEq p]
+ (G : Matrix p p ℝ) (C : Matrix t p ℝ) (B : Matrix t t ℝ) : Matrix t t ℝ :=
+ B - C * G⁻¹ * C.transpose
+
+private theorem tendsto_matrix_mul_explicit {α p t q : Type*} [Fintype t]
+ {u : Filter α} {A : α → Matrix p t ℝ} {A0 : Matrix p t ℝ}
+ {B : α → Matrix t q ℝ} {B0 : Matrix t q ℝ}
+ (hA : Tendsto A u (𝓝 A0)) (hB : Tendsto B u (𝓝 B0)) :
+ Tendsto (fun r => A r * B r) u (𝓝 (A0 * B0)) := by
+ have hAij (i : p) (j : t) : Tendsto (fun r => A r i j) u (𝓝 (A0 i j)) :=
+ ((continuous_apply j).tendsto (A0 i)).comp
+ (((continuous_apply i).tendsto A0).comp hA)
+ have hBij (i : t) (j : q) : Tendsto (fun r => B r i j) u (𝓝 (B0 i j)) :=
+ ((continuous_apply j).tendsto (B0 i)).comp
+ (((continuous_apply i).tendsto B0).comp hB)
+ apply tendsto_pi_nhds.mpr
+ intro i
+ apply tendsto_pi_nhds.mpr
+ intro j
+ exact tendsto_finsetSum Finset.univ (fun k _ => (hAij i k).mul (hBij k j))
+
+private theorem tendsto_matrix_mulVec_explicit {α p t : Type*} [Fintype t]
+ {u : Filter α} {A : α → Matrix p t ℝ} {A0 : Matrix p t ℝ}
+ {b : α → (t → ℝ)} {b0 : t → ℝ}
+ (hA : Tendsto A u (𝓝 A0)) (hb : Tendsto b u (𝓝 b0)) :
+ Tendsto (fun r => A r *ᵥ b r) u (𝓝 (A0 *ᵥ b0)) := by
+ have hAij (i : p) (j : t) : Tendsto (fun r => A r i j) u (𝓝 (A0 i j)) :=
+ ((continuous_apply j).tendsto (A0 i)).comp
+ (((continuous_apply i).tendsto A0).comp hA)
+ have hbi (i : t) : Tendsto (fun r => b r i) u (𝓝 (b0 i)) :=
+ ((continuous_apply i).tendsto b0).comp hb
+ apply tendsto_pi_nhds.mpr
+ intro i
+ exact tendsto_finsetSum Finset.univ (fun j _ => (hAij i j).mul (hbi j))
+
+/-- Continuous pin/target blocks give current invertibility and convergence
+of the inverse, noncentered regression mean and possibly singular covariance. -/
+theorem regression_parameter_limits
+ {p t a : Type*} [Fintype p] [DecidableEq p] [Fintype t]
+ (u : Filter a)
+ (G : a → Matrix p p ℝ) (C : a → Matrix t p ℝ)
+ (B : a → Matrix t t ℝ) (d : a → p → ℝ)
+ (G0 : Matrix p p ℝ) (C0 : Matrix t p ℝ) (B0 : Matrix t t ℝ) (d0 : p → ℝ)
+ (hG : Tendsto G u (𝓝 G0)) (hC : Tendsto C u (𝓝 C0))
+ (hB : Tendsto B u (𝓝 B0)) (hd : Tendsto d u (𝓝 d0)) (hG0 : IsUnit G0) :
+ (∀ᶠ r in u, IsUnit (G r)) ∧
+ Tendsto (fun r => (G r)⁻¹) u (𝓝 G0⁻¹) ∧
+ Tendsto (fun r => regressionMean (G r) (C r) (d r)) u
+ (𝓝 (regressionMean G0 C0 d0)) ∧
+ Tendsto (fun r => regressionCovariance (G r) (C r) (B r)) u
+ (𝓝 (regressionCovariance G0 C0 B0)) := by
+ have hdet0 : G0.det ≠ 0 := ((Matrix.isUnit_iff_isUnit_det G0).mp hG0).ne_zero
+ have hdet : Tendsto (fun r => (G r).det) u (𝓝 G0.det) :=
+ (continuous_id.matrix_det.tendsto G0).comp hG
+ have hunit : ∀ᶠ r in u, IsUnit (G r) := by
+ filter_upwards [hdet.eventually_ne hdet0] with r hr
+ exact (Matrix.isUnit_iff_isUnit_det (G r)).mpr (isUnit_iff_ne_zero.mpr hr)
+ have hInv : Tendsto (fun r => (G r)⁻¹) u (𝓝 G0⁻¹) := by
+ have hc : ContinuousAt (Ring.inverse : ℝ → ℝ) G0.det := by
+ simpa only [Ring.inverse_eq_inv'] using (continuousAt_inv₀ hdet0)
+ exact (continuousAt_matrix_inv G0 hc).tendsto.comp hG
+ have hK : Tendsto (fun r => C r * (G r)⁻¹) u (𝓝 (C0 * G0⁻¹)) :=
+ tendsto_matrix_mul_explicit hC hInv
+ have hm : Tendsto (fun r => regressionMean (G r) (C r) (d r)) u
+ (𝓝 (regressionMean G0 C0 d0)) :=
+ tendsto_matrix_mulVec_explicit hK hd
+ have htrans : Tendsto (fun r => (C r).transpose) u (𝓝 C0.transpose) := by
+ have hc : Continuous (fun D : Matrix t p ℝ => D.transpose) := by fun_prop
+ exact (hc.tendsto C0).comp hC
+ have hcov := hB.sub (tendsto_matrix_mul_explicit hK htrans)
+ exact ⟨hunit, hInv, hm, hcov⟩
+
+private theorem bounds_from_limits {ι : Type*} [Fintype ι]
+ (f : ℝ → (ι → ℝ)) (g : ℝ → Matrix ι ι ℝ)
+ (f0 : ι → ℝ) (g0 : Matrix ι ι ℝ)
+ (hf : Tendsto f (𝓝[>] (0 : ℝ)) (𝓝 f0))
+ (hg : Tendsto g (𝓝[>] (0 : ℝ)) (𝓝 g0)) :
+ ∃ B V δ : ℝ, 0 ≤ B ∧ 0 ≤ V ∧ 0 < δ ∧
+ ∀ r : ℝ, 0 < r → r < δ →
+ (∀ i, |f r i| ≤ B) ∧ (∀ i, |g r i i| ≤ V) := by
+ have hfb : ∀ᶠ r in 𝓝[>] (0 : ℝ), ‖f r‖ < ‖f0‖ + 1 :=
+ hf.norm.eventually (gt_mem_nhds (by linarith))
+ have hgg : Tendsto (fun r => fun i j => g r i j) (𝓝[>] (0 : ℝ))
+ (𝓝 (fun i j => g0 i j)) := hg
+ have hgb : ∀ᶠ r in 𝓝[>] (0 : ℝ), ‖fun i j => g r i j‖ < ‖fun i j => g0 i j‖ + 1 :=
+ hgg.norm.eventually (gt_mem_nhds (by linarith))
+ obtain ⟨δ, hδ, hbounds⟩ := mem_nhdsGT_iff_exists_Ioo_subset.mp (hfb.and hgb)
+ refine ⟨‖f0‖+1, ‖fun i j => g0 i j‖+1, δ, by positivity, by positivity, hδ, ?_⟩
+ intro r hr hrδ
+ have hb := hbounds ⟨hr, hrδ⟩
+ constructor
+ · intro i
+ exact (show |f r i| ≤ ‖f r‖ by simpa only [Real.norm_eq_abs] using norm_le_pi_norm (f r) i).trans hb.1.le
+ · intro i
+ exact (show |g r i i| ≤ ‖fun i j => g r i j‖ by
+ exact (show |g r i i| ≤ ‖g r i‖ by simpa only [Real.norm_eq_abs] using norm_le_pi_norm (g r i) i).trans
+ (norm_le_pi_norm (fun i j => g r i j) i)).trans hb.2.le
+
+
+/-- One small-radius interval supplies current invertibility and simultaneous
+mean/diagonal-covariance bounds, derived solely from the block limits. -/
+theorem regression_uniform_bounds
+ {p t : Type*} [Fintype p] [DecidableEq p] [Fintype t]
+ (G : ℝ → Matrix p p ℝ) (C : ℝ → Matrix t p ℝ)
+ (B : ℝ → Matrix t t ℝ) (d : ℝ → p → ℝ)
+ (G0 : Matrix p p ℝ) (C0 : Matrix t p ℝ) (B0 : Matrix t t ℝ) (d0 : p → ℝ)
+ (hG : Tendsto G (𝓝[>] (0 : ℝ)) (𝓝 G0))
+ (hC : Tendsto C (𝓝[>] (0 : ℝ)) (𝓝 C0))
+ (hB : Tendsto B (𝓝[>] (0 : ℝ)) (𝓝 B0))
+ (hd : Tendsto d (𝓝[>] (0 : ℝ)) (𝓝 d0)) (hG0 : IsUnit G0) :
+ ∃ M V δ : ℝ, 0 ≤ M ∧ 0 ≤ V ∧ 0 < δ ∧
+ ∀ r : ℝ, 0 < r → r < δ → IsUnit (G r) ∧
+ (∀ i, |regressionMean (G r) (C r) (d r) i| ≤ M) ∧
+ (∀ i, |regressionCovariance (G r) (C r) (B r) i i| ≤ V) := by
+ obtain ⟨hunit, _hInv, hm, hcov⟩ := regression_parameter_limits
+ (𝓝[>] (0 : ℝ)) G C B d G0 C0 B0 d0 hG hC hB hd hG0
+ obtain ⟨M, V, δB, hM, hV, hδB, hb⟩ := bounds_from_limits
+ (fun r => regressionMean (G r) (C r) (d r))
+ (fun r => regressionCovariance (G r) (C r) (B r))
+ (regressionMean G0 C0 d0) (regressionCovariance G0 C0 B0) hm hcov
+ obtain ⟨δU, hδU, hu⟩ := mem_nhdsGT_iff_exists_Ioo_subset.mp hunit
+ refine ⟨M, V, min δB δU, hM, hV, lt_min hδB hδU, ?_⟩
+ intro r hr hrδ
+ exact ⟨hu ⟨hr, lt_of_lt_of_le hrδ (min_le_right _ _)⟩,
+ hb r hr (lt_of_lt_of_le hrδ (min_le_left _ _))⟩
+
+end I4GaussianRegressionLimits
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/GaussianWeightedMajorants.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/GaussianWeightedMajorants.lean
new file mode 100644
index 000000000..675338206
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/GaussianWeightedMajorants.lean
@@ -0,0 +1,386 @@
+import Mathlib.MeasureTheory.Order.Group.Lattice
+import Mathlib.Analysis.Convex.Jensen
+import Mathlib.Analysis.Convex.SpecificFunctions.Basic
+import Mathlib.MeasureTheory.Integral.Lebesgue.Add
+import Mathlib.Tactic.FieldSimp
+import Mathlib.Tactic.Ring
+import Mathlib.Tactic.Linarith
+import Mathlib.Tactic.Positivity
+import Mathlib.Probability.Distributions.Gaussian.Real
+import Mathlib.Probability.HasLaw
+import Mathlib.MeasureTheory.Constructions.BorelSpace.Order
+import Mathlib.Tactic.FunProp
+import Mathlib.MeasureTheory.Function.LpSpace.InfiniteSum
+import Mathlib.MeasureTheory.Function.LpSeminorm.SMul
+import Mathlib.MeasureTheory.Function.L1Space.Integrable
+
+/-! Weighted absolute Gaussian series. The coordinates need only standard
+Gaussian marginals; no independence is assumed. See SOURCE_GAUSSIAN_MAJORANTS.md. -/
+
+noncomputable section
+open MeasureTheory ProbabilityTheory Filter
+open scoped BigOperators Topology ENNReal NNReal
+set_option autoImplicit false
+
+namespace I4GaussianMajorant
+
+def weightedAbsSeries {I Ω : Type*} (w : I → ℝ) (U : I → Ω → ℝ) (ω : Ω) : ℝ :=
+ ∑' i, w i * |U i ω|
+
+def standardAbsMoment (n : ℕ) : ℝ := ∫ z : ℝ, |z| ^ n ∂gaussianReal 0 1
+
+theorem standardAbsMoment_integrable (n : ℕ) :
+ Integrable (fun z : ℝ => |z| ^ n) (gaussianReal 0 1) := by
+ simpa only [Real.norm_eq_abs, id_eq] using
+ (memLp_id_gaussianReal (μ := 0) (v := 1) (n : ℝ≥0)).integrable_norm_pow'
+
+theorem weightedAbsSeries_nonneg {I Ω : Type*} (w : I → ℝ) (U : I → Ω → ℝ)
+ (hw0 : ∀ i, 0 ≤ w i) (ω : Ω) : 0 ≤ weightedAbsSeries w U ω :=
+ tsum_nonneg (fun i => mul_nonneg (hw0 i) (abs_nonneg _))
+
+theorem weightedAbsSeries_measurable {I Ω : Type*} [Countable I] [MeasurableSpace Ω]
+ (w : I → ℝ) (U : I → Ω → ℝ) (hU : ∀ i, Measurable (U i)) :
+ Measurable (weightedAbsSeries w U) :=
+ Measurable.tsum (fun i => measurable_const.mul (continuous_abs.measurable.comp (hU i)))
+
+private theorem coordinate_eLpNorm {I Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
+ (w : I → ℝ) (U : I → Ω → ℝ) (hw0 : ∀ i, 0 ≤ w i)
+ (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P) (p : ℝ≥0∞) (i : I) :
+ eLpNorm (fun ω => w i * |U i ω|) p P =
+ ENNReal.ofReal (w i) * eLpNorm id p (gaussianReal 0 1) := by
+ have hmap := eLpNorm_map_measure (p := p) (f := U i) (g := fun z : ℝ => ‖z‖)
+ (by fun_prop) (hlaw i).aemeasurable
+ have hn : eLpNorm (fun z : ℝ => ‖z‖) p (gaussianReal 0 1) =
+ eLpNorm id p (gaussianReal 0 1) := by
+ simpa only [id_eq] using eLpNorm_norm (μ := gaussianReal 0 1) (p := p) id aestronglyMeasurable_id
+ rw [(hlaw i).map_eq, hn] at hmap
+ have hu : eLpNorm (fun ω => |U i ω|) p P = eLpNorm id p (gaussianReal 0 1) := by
+ simpa only [Function.comp_def, Real.norm_eq_abs] using hmap.symm
+ calc
+ _ = ‖w i‖ₑ * eLpNorm (fun ω => |U i ω|) p P := by
+ have heq : (w i • (fun ω => |U i ω|)) = (fun ω => w i * |U i ω|) := by
+ funext ω
+ rfl
+ rw [← heq]
+ exact eLpNorm_const_smul (w i) (fun ω => |U i ω|) p P
+ _ = _ := by rw [hu]; simp [Real.enorm_eq_ofReal_abs, abs_of_nonneg (hw0 i)]
+
+theorem weightedAbsSeries_memLp_bound {I Ω : Type*} [Countable I] [MeasurableSpace Ω]
+ (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)
+ (hU : ∀ i, Measurable (U i)) (hw0 : ∀ i, 0 ≤ w i) (hw : Summable w)
+ (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P)
+ (p : ℝ≥0) (hp : 1 ≤ p) :
+ MemLp (weightedAbsSeries w U) p P ∧
+ eLpNorm (weightedAbsSeries w U) p P ≤
+ ENNReal.ofReal (∑' i, w i) * eLpNorm id p (gaussianReal 0 1) := by
+ classical
+ let F : I → Ω → ℝ := fun i ω => w i * |U i ω|
+ let C := ENNReal.ofReal (∑' i, w i) * eLpNorm id p (gaussianReal 0 1)
+ have hG := memLp_id_gaussianReal (μ := 0) (v := 1) p
+ have hC : C ≠ ∞ := ENNReal.mul_ne_top ENNReal.ofReal_ne_top hG.eLpNorm_ne_top
+ have hsum : (∑' i, eLpNorm (F i) p P) = C := by
+ simp_rw [F, coordinate_eLpNorm P w U hw0 hlaw]
+ rw [ENNReal.tsum_mul_right, ← ENNReal.ofReal_tsum_of_nonneg hw0 hw]
+ have hae : ∀ᵐ ω ∂P, Summable (fun i => F i ω) := by
+ have ht := summable_norm_of_tsum_eLpNorm_ne_top (show (1 : ℝ≥0∞) ≤ p by exact_mod_cast hp)
+ (by rw [hsum]; exact hC)
+ filter_upwards [ht] with ω hω
+ simpa only [F, Real.norm_eq_abs, abs_of_nonneg (mul_nonneg (hw0 _) (abs_nonneg _))] using hω
+ have hbound (s : Finset I) : eLpNorm (fun ω => ∑ i ∈ s, F i ω) p P ≤ C := by
+ calc
+ _ ≤ ∑ i ∈ s, eLpNorm (F i) p P :=
+ by
+ have heq : (∑ i ∈ s, F i) = (fun ω => ∑ i ∈ s, F i ω) := by
+ funext ω
+ simp
+ rw [← heq]
+ exact
+ (eLpNorm_sum_le (μ := P) (f := F) (s := s)
+ (show (1 : ℝ≥0∞) ≤ p by exact_mod_cast hp))
+ _ ≤ ∑' i, eLpNorm (F i) p P := ENNReal.sum_le_tsum s
+ _ = C := hsum
+ have hnorm : eLpNorm (weightedAbsSeries w U) p P ≤ C := by
+ apply Lp.eLpNorm_le_of_ae_tendsto (u := (atTop : Filter (Finset I)))
+ (f := fun s ω => ∑ i ∈ s, F i ω) (Filter.Eventually.of_forall hbound)
+ (fun s => (s.measurable_fun_sum (fun i _ => measurable_const.mul (continuous_abs.measurable.comp (hU i)))).aestronglyMeasurable)
+ (weightedAbsSeries_measurable w U hU).aestronglyMeasurable
+ filter_upwards [hae] with ω hω
+ exact hω.hasSum
+ exact ⟨lt_of_le_of_lt hnorm (lt_top_iff_ne_top.mpr hC), hnorm⟩
+
+theorem weightedAbsSeries_ae_summable {I Ω : Type*} [Countable I] [MeasurableSpace Ω]
+ (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)
+ (_hU : ∀ i, Measurable (U i)) (hw0 : ∀ i, 0 ≤ w i) (hw : Summable w)
+ (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P) :
+ ∀ᵐ ω ∂P, Summable (fun i => w i * |U i ω|) := by
+ have hG := memLp_id_gaussianReal (μ := 0) (v := 1) 1
+ have hs : (∑' i, eLpNorm (fun ω => w i * |U i ω|) 1 P) ≠ ∞ := by
+ simp_rw [coordinate_eLpNorm P w U hw0 hlaw]
+ rw [ENNReal.tsum_mul_right, ← ENNReal.ofReal_tsum_of_nonneg hw0 hw]
+ exact ENNReal.mul_ne_top ENNReal.ofReal_ne_top hG.eLpNorm_ne_top
+ have ht := summable_norm_of_tsum_eLpNorm_ne_top (le_refl (1 : ℝ≥0∞)) hs
+ filter_upwards [ht] with ω hω
+ simpa only [Real.norm_eq_abs, abs_of_nonneg (mul_nonneg (hw0 _) (abs_nonneg _))] using hω
+
+private theorem eLpNorm_nat_pow_integral {Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) (f : Ω → ℝ) (hf : AEStronglyMeasurable f P)
+ (hnonneg : ∀ ω, 0 ≤ f ω) (n : ℕ) (hn : n ≠ 0)
+ (hint : Integrable (fun ω => f ω ^ n) P) :
+ eLpNorm f n P ^ n = ENNReal.ofReal (∫ ω, f ω ^ n ∂P) := by
+ have he := eLpNorm_nnreal_pow_eq_lintegral (p := (n : ℝ≥0))
+ (by exact_mod_cast hn) hf
+ have he' : eLpNorm f n P ^ n = ∫⁻ ω, ENNReal.ofReal (f ω ^ n) ∂P := by
+ simpa only [NNReal.coe_natCast, ENNReal.coe_natCast, ENNReal.rpow_natCast,
+ Real.enorm_eq_ofReal_abs, abs_of_nonneg (hnonneg _),
+ ← ENNReal.ofReal_pow (hnonneg _)] using he
+ rw [he', ofReal_integral_eq_lintegral_ofReal hint
+ (Filter.Eventually.of_forall (fun ω => pow_nonneg (hnonneg ω) n))]
+
+theorem weightedAbsSeries_moment {I Ω : Type*} [Countable I] [MeasurableSpace Ω]
+ (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)
+ (hU : ∀ i, Measurable (U i)) (hw0 : ∀ i, 0 ≤ w i) (hw : Summable w)
+ (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P) (n : ℕ) :
+ Integrable (fun ω => weightedAbsSeries w U ω ^ n) P ∧
+ (∫ ω, weightedAbsSeries w U ω ^ n ∂P) ≤
+ (∑' i, w i) ^ n * standardAbsMoment n := by
+ rcases eq_or_ne n 0 with rfl | hn
+ · simp [standardAbsMoment]
+ have hp : (1 : ℝ≥0) ≤ n := by exact_mod_cast Nat.one_le_iff_ne_zero.mpr hn
+ have hb := weightedAbsSeries_memLp_bound P w U hU hw0 hw hlaw (n : ℝ≥0) hp
+ have hnonneg := weightedAbsSeries_nonneg w U hw0
+ have hi : Integrable (fun ω => weightedAbsSeries w U ω ^ n) P := by
+ simpa only [Real.norm_eq_abs, abs_of_nonneg (hnonneg _)] using hb.1.integrable_norm_pow'
+ refine ⟨hi, ?_⟩
+ have hstd := standardAbsMoment_integrable n
+ have hpow := pow_le_pow_left' hb.2 n
+ have href : eLpNorm id (n : ℝ≥0∞) (gaussianReal 0 1) ^ n =
+ ENNReal.ofReal (standardAbsMoment n) := by
+ have he := eLpNorm_nat_pow_integral (gaussianReal 0 1) (fun z : ℝ => |z|)
+ (by fun_prop) (fun z => abs_nonneg z) n hn hstd
+ have hnorm : eLpNorm (fun z : ℝ => |z|) (n : ℝ≥0∞) (gaussianReal 0 1) =
+ eLpNorm id (n : ℝ≥0∞) (gaussianReal 0 1) := by
+ simpa only [Real.norm_eq_abs, id_eq] using
+ eLpNorm_norm (μ := gaussianReal 0 1) (p := (n : ℝ≥0∞)) id aestronglyMeasurable_id
+ rw [hnorm] at he
+ exact he
+ change eLpNorm (weightedAbsSeries w U) (n : ℝ≥0∞) P ^ n ≤
+ (ENNReal.ofReal (∑' i, w i) * eLpNorm id (n : ℝ≥0∞) (gaussianReal 0 1)) ^ n at hpow
+ rw [mul_pow, eLpNorm_nat_pow_integral P (weightedAbsSeries w U)
+ (weightedAbsSeries_measurable w U hU).aestronglyMeasurable hnonneg n hn hi, href,
+ ← ENNReal.ofReal_pow (tsum_nonneg hw0), ← ENNReal.ofReal_mul (pow_nonneg (tsum_nonneg hw0) n)] at hpow
+ exact (ENNReal.ofReal_le_ofReal_iff (mul_nonneg (pow_nonneg (tsum_nonneg hw0) n)
+ (integral_nonneg (fun z => pow_nonneg (abs_nonneg z) n)))).mp hpow
+
+/- Exponential support coauthored by
+/root/normalizer_palm_research/gaussian_reference_probe. -/
+
+private lemma exp_mul_abs_le (s x : ℝ) :
+ Real.exp (s * |x|) ≤ Real.exp (s*x) + Real.exp ((-s)*x) := by
+ rcases le_total 0 x with hx | hx
+ · rw [abs_of_nonneg hx]
+ linarith [Real.exp_pos ((-s)*x)]
+ · rw [abs_of_nonpos hx]
+ have h : s * (-x) = (-s)*x := by ring
+ rw [h]
+ linarith [Real.exp_pos (s*x)]
+
+private theorem foldedGaussian_exp (s : ℝ) :
+ Integrable (fun z : ℝ => Real.exp (s * |z|)) (gaussianReal 0 1) ∧
+ (∫ z : ℝ, Real.exp (s * |z|) ∂gaussianReal 0 1) ≤ 2*Real.exp (s^2/2) := by
+ have hp := integrable_exp_mul_gaussianReal (μ := 0) (v := 1) s
+ have hn := integrable_exp_mul_gaussianReal (μ := 0) (v := 1) (-s)
+ have hi : Integrable (fun z : ℝ => Real.exp (s * |z|)) (gaussianReal 0 1) := by
+ apply (hp.add hn).mono' (by fun_prop)
+ filter_upwards [] with z
+ rw [Real.norm_eq_abs, abs_of_pos (Real.exp_pos _)]
+ exact exp_mul_abs_le s z
+ refine ⟨hi, ?_⟩
+ calc
+ _ ≤ ∫ z : ℝ, (Real.exp (s*z) + Real.exp ((-s)*z)) ∂gaussianReal 0 1 :=
+ integral_mono hi (hp.add hn) (fun z => exp_mul_abs_le s z)
+ _ = 2*Real.exp (s^2/2) := by
+ rw [integral_add hp hn]
+ have hplus := congrFun (mgf_fun_id_gaussianReal (μ := 0) (v := 1)) s
+ have hminus := congrFun (mgf_fun_id_gaussianReal (μ := 0) (v := 1)) (-s)
+ simp only [mgf, zero_mul, zero_add, NNReal.coe_one, one_mul, neg_sq] at hplus hminus
+ rw [hplus, hminus]
+ ring
+
+private lemma finite_exp_jensen {I : Type*} (s : Finset I) (w x : I → ℝ)
+ (W t : ℝ) (hW : 0 < W) (hw : ∀ i, 0 ≤ w i)
+ (hsum : ∑ i ∈ s, w i ≤ W) :
+ Real.exp (t * ∑ i ∈ s, w i * |x i|) ≤
+ (1-∑ i ∈ s, w i/W) + ∑ i ∈ s, (w i/W)*Real.exp (t*W*|x i|) := by
+ have hmass : ∑ i ∈ s, w i/W ≤ 1 := by
+ rw [← Finset.sum_div]
+ exact (div_le_one hW).mpr hsum
+ have hj := convexOn_exp.map_add_sum_le
+ (t := s) (w := fun i => w i/W) (p := fun i => t*W*|x i|)
+ (v := 1-∑ i ∈ s, w i/W) (q := 0)
+ (fun i _ => div_nonneg (hw i) hW.le) (by ring)
+ (fun _ _ => Set.mem_univ _) (by linarith) (Set.mem_univ _)
+ simp only [smul_eq_mul, mul_zero, zero_add, Real.exp_zero, mul_one] at hj
+ have heq : (∑ i ∈ s, (w i/W)*(t*W*|x i|)) = t * ∑ i ∈ s, w i*|x i| := by
+ rw [Finset.mul_sum]
+ apply Finset.sum_congr rfl
+ intro i _
+ field_simp
+ simpa only [heq] using hj
+
+private lemma finite_exp_integrable_bound {I Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) [IsProbabilityMeasure P] (s : Finset I) (w : I → ℝ)
+ (U : I → Ω → ℝ) (hmeas : ∀ i, Measurable (U i))
+ (W t K : ℝ) (hW : 0 < W) (hw : ∀ i, 0 ≤ w i)
+ (hsum : ∑ i ∈ s, w i ≤ W) (hK : 1 ≤ K)
+ (hUi : ∀ i, Integrable (fun ω => Real.exp (t*W*|U i ω|)) P)
+ (hUb : ∀ i, (∫ ω, Real.exp (t*W*|U i ω|) ∂P) ≤ K) :
+ Integrable (fun ω => Real.exp (t*∑ i ∈ s, w i*|U i ω|)) P ∧
+ (∫ ω, Real.exp (t*∑ i ∈ s, w i*|U i ω|) ∂P) ≤ K := by
+ let a := ∑ i ∈ s, w i/W
+ have ha0 : 0 ≤ a := Finset.sum_nonneg (fun i _ => div_nonneg (hw i) hW.le)
+ have ha1 : a ≤ 1 := by
+ dsimp [a]
+ rw [← Finset.sum_div]
+ exact (div_le_one hW).mpr hsum
+ have hsumint : Integrable (fun ω => ∑ i ∈ s, (w i/W)*Real.exp (t*W*|U i ω|)) P :=
+ integrable_finsetSum _ (fun i _ => (hUi i).const_mul _)
+ have hrhs : Integrable (fun ω => (1-a)+∑ i ∈ s, (w i/W)*Real.exp (t*W*|U i ω|)) P :=
+ (integrable_const _).add hsumint
+ have hmeasf : AEStronglyMeasurable (fun ω => Real.exp (t*∑ i ∈ s, w i*|U i ω|)) P := by
+ fun_prop
+ have hint : Integrable (fun ω => Real.exp (t*∑ i ∈ s, w i*|U i ω|)) P := by
+ apply hrhs.mono' hmeasf
+ filter_upwards [] with ω
+ rw [Real.norm_eq_abs, abs_of_pos (Real.exp_pos _)]
+ exact finite_exp_jensen s w (fun i => U i ω) W t hW hw hsum
+ refine ⟨hint, ?_⟩
+ calc
+ _ ≤ ∫ ω, ((1-a)+∑ i ∈ s, (w i/W)*Real.exp (t*W*|U i ω|)) ∂P :=
+ integral_mono hint hrhs (fun ω => finite_exp_jensen s w (fun i => U i ω) W t hW hw hsum)
+ _ = (1-a)+∑ i ∈ s, (w i/W)*(∫ ω, Real.exp (t*W*|U i ω|) ∂P) := by
+ rw [integral_add (integrable_const _) hsumint, integral_finsetSum _
+ (fun i _ => (hUi i).const_mul _)]
+ simp only [integral_const_mul, integral_const, probReal_univ, smul_eq_mul, one_mul]
+ _ ≤ (1-a)+∑ i ∈ s, (w i/W)*K := by
+ exact add_le_add le_rfl (Finset.sum_le_sum (fun i _ => mul_le_mul_of_nonneg_left (hUb i)
+ (div_nonneg (hw i) hW.le)))
+ _ = (1-a)+a*K := by rw [← Finset.sum_mul]
+ _ ≤ K := by nlinarith
+
+
+private theorem weightedAbsSeries_exp_posWeight {I Ω : Type*} [Countable I] [MeasurableSpace Ω]
+ (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)
+ (hmeas : ∀ i, Measurable (U i)) (hw : ∀ i, 0 ≤ w i) (hws : Summable w)
+ (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P)
+ (haesum : ∀ᵐ ω ∂P, Summable (fun i => w i*|U i ω|))
+ (hW : 0 < ∑' i, w i) (t : ℝ) :
+ Integrable (fun ω => Real.exp (t*weightedAbsSeries w U ω)) P ∧
+ (∫ ω, Real.exp (t*weightedAbsSeries w U ω) ∂P) ≤
+ 2*Real.exp (t^2*(∑' i, w i)^2/2) := by
+ let W := ∑' i, w i
+ let K := 2*Real.exp ((t*W)^2/2)
+ have hK : 1 ≤ K := by
+ have hexp : 1 ≤ Real.exp ((t*W)^2/2) := Real.one_le_exp_iff.mpr (by positivity)
+ dsimp [K]
+ linarith
+ have hUi (i : I) : Integrable (fun ω => Real.exp (t*W*|U i ω|)) P :=
+ (hlaw i).integrable_comp (foldedGaussian_exp (t*W)).1
+ have hUb (i : I) : (∫ ω, Real.exp (t*W*|U i ω|) ∂P) ≤ K := by
+ have heq := (hlaw i).integral_comp
+ (show AEStronglyMeasurable (fun z : ℝ => Real.exp (t*W*|z|)) (gaussianReal 0 1) by fun_prop)
+ exact heq.trans_le (foldedGaussian_exp (t*W)).2
+ have hfinite (s : Finset I) :
+ Integrable (fun ω => Real.exp (t*∑ i ∈ s, w i*|U i ω|)) P ∧
+ (∫ ω, Real.exp (t*∑ i ∈ s, w i*|U i ω|) ∂P) ≤ K :=
+ finite_exp_integrable_bound P s w U hmeas W t K hW hw
+ (hws.sum_le_tsum s (fun i _ => hw i)) hK hUi hUb
+ have hlim : (fun ω => liminf (fun s : Finset I =>
+ ENNReal.ofReal (Real.exp (t*∑ i ∈ s, w i*|U i ω|))) atTop) =ᵐ[P]
+ (fun ω => ENNReal.ofReal (Real.exp (t*weightedAbsSeries w U ω))) := by
+ filter_upwards [haesum] with ω hω
+ have hc : Tendsto (fun s : Finset I => Real.exp (t*∑ i ∈ s, w i*|U i ω|)) atTop
+ (𝓝 (Real.exp (t*weightedAbsSeries w U ω))) :=
+ (Real.continuous_exp.tendsto _).comp (tendsto_const_nhds.mul hω.hasSum)
+ exact ((ENNReal.continuous_ofReal.tendsto _).comp hc).liminf_eq
+ have hfinbound (s : Finset I) :
+ (∫⁻ ω, ENNReal.ofReal (Real.exp (t*∑ i ∈ s, w i*|U i ω|)) ∂P) ≤ ENNReal.ofReal K := by
+ rw [← ofReal_integral_eq_lintegral_ofReal (hfinite s).1
+ (Eventually.of_forall (fun ω => (Real.exp_pos _).le))]
+ exact ENNReal.ofReal_le_ofReal (hfinite s).2
+ have hlin : (∫⁻ ω, ENNReal.ofReal (Real.exp (t*weightedAbsSeries w U ω)) ∂P) ≤
+ ENNReal.ofReal K := by
+ rw [← lintegral_congr_ae hlim]
+ calc
+ _ ≤ liminf (fun s : Finset I => ∫⁻ ω,
+ ENNReal.ofReal (Real.exp (t*∑ i ∈ s, w i*|U i ω|)) ∂P) atTop :=
+ lintegral_liminf_le (fun s => by fun_prop)
+ _ ≤ liminf (fun _s : Finset I => ENNReal.ofReal K) atTop :=
+ liminf_le_liminf (Eventually.of_forall hfinbound)
+ _ = ENNReal.ofReal K := liminf_const _
+ have hmeasGamma : Measurable (weightedAbsSeries w U) := by
+ apply Measurable.tsum
+ intro i
+ exact measurable_const.mul (hmeas i).abs
+ have hint : Integrable (fun ω => Real.exp (t*weightedAbsSeries w U ω)) P := by
+ refine ⟨by fun_prop, ?_⟩
+ apply (hasFiniteIntegral_iff_ofReal (Eventually.of_forall (fun ω => (Real.exp_pos _).le))).mpr
+ exact hlin.trans_lt ENNReal.ofReal_lt_top
+ refine ⟨hint, ?_⟩
+ have hb : (∫ ω, Real.exp (t*weightedAbsSeries w U ω) ∂P) ≤ K := by
+ rw [← ofReal_integral_eq_lintegral_ofReal hint
+ (Eventually.of_forall (fun ω => (Real.exp_pos _).le))] at hlin
+ exact (ENNReal.ofReal_le_ofReal_iff (by linarith : 0 ≤ K)).mp hlin
+ convert hb using 1; simp only [K, mul_pow, W]
+
+
+theorem weightedAbsSeries_exp_bound {I Ω : Type*} [Countable I] [MeasurableSpace Ω]
+ (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)
+ (hmeas : ∀ i, Measurable (U i)) (hw : ∀ i, 0 ≤ w i) (hws : Summable w)
+ (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P)
+ (t : ℝ) :
+ Integrable (fun ω => Real.exp (t*weightedAbsSeries w U ω)) P ∧
+ (∫ ω, Real.exp (t*weightedAbsSeries w U ω) ∂P) ≤
+ 2*Real.exp (t^2*(∑' i, w i)^2/2) := by
+ have haesum := weightedAbsSeries_ae_summable P w U hmeas hw hws hlaw
+ classical
+ by_cases hzero : (∑' i, w i) = 0
+ · have hwi (i : I) : w i = 0 := by
+ have hi : w i ≤ ∑' i, w i := by
+ simpa only [Finset.sum_singleton] using
+ hws.sum_le_tsum ({i} : Finset I) (fun j _ => hw j)
+ exact le_antisymm (hzero ▸ hi) (hw i)
+ constructor
+ · simp [weightedAbsSeries, hwi]
+ · simp [weightedAbsSeries, hwi]
+ · exact weightedAbsSeries_exp_posWeight P w U hmeas hw hws hlaw haesum
+ (lt_of_le_of_ne (tsum_nonneg hw) (Ne.symm hzero)) t
+
+
+/-- Exponential Markov with t=R/W² gives the Gaussian upper tail without independence. -/
+theorem weightedAbsSeries_upper_tail {I Ω : Type*} [Countable I] [MeasurableSpace Ω]
+ (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)
+ (hU : ∀ i, Measurable (U i)) (hw0 : ∀ i, 0 ≤ w i) (hw : Summable w)
+ (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P)
+ (hW : 0 < ∑' i, w i) (R : ℝ) (hR : 0 ≤ R) :
+ P.real {ω | R ≤ weightedAbsSeries w U ω} ≤
+ 2 * Real.exp (-(R ^ 2) / (2 * (∑' i, w i) ^ 2)) := by
+ let W := ∑' i, w i
+ let t := R / W ^ 2
+ have hW0 : W ≠ 0 := ne_of_gt hW
+ have ht : 0 ≤ t := div_nonneg hR (sq_nonneg W)
+ have hb := weightedAbsSeries_exp_bound P w U hU hw0 hw hlaw t
+ have hm := measure_ge_le_exp_mul_mgf (μ := P) (X := weightedAbsSeries w U) R ht hb.1
+ calc
+ _ ≤ Real.exp (-t * R) * mgf (weightedAbsSeries w U) P t := hm
+ _ ≤ Real.exp (-t * R) * (2 * Real.exp (t ^ 2 * W ^ 2 / 2)) :=
+ mul_le_mul_of_nonneg_left hb.2 (Real.exp_pos _).le
+ _ = 2 * Real.exp (-t * R + t ^ 2 * W ^ 2 / 2) := by
+ rw [Real.exp_add]
+ ring
+ _ = _ := by
+ congr 2
+ dsimp [t]
+ field_simp [hW0]
+ ring
+
+end I4GaussianMajorant
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConditionalMajorant.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConditionalMajorant.lean
new file mode 100644
index 000000000..205903a0f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConditionalMajorant.lean
@@ -0,0 +1,448 @@
+import SourceSmoothConditionalKernel
+import GaussianWeightedMajorants
+import SourceSmoothPalm
+
+/-!
+# Actual conditional Fourier derivative majorants
+
+The posterior retains its literal coefficient shift and noncentered drift.
+All series below are justified on the existing smooth sample carrier.
+See SOURCE_CONDITIONAL_MAJORANT.md for the frozen source contract.
+-/
+
+noncomputable section
+
+open I4Foundation I4Source I4Weights I4Smooth I4SmoothCarrier I4SourceDerivativeGaussian
+open I4SourceDerivativeContinuity I4SourceConfluentLimits I4SourceEndpointRegression
+open I4SourceEndpointEstimates I4SourceContact I4SourceSmoothConditional I4ContactGram
+open I4GaussianMajorant
+open I4SourceSmoothPalm
+open MeasureTheory ProbabilityTheory Matrix Filter
+open scoped BigOperators Topology
+
+set_option autoImplicit false
+
+namespace I4SourceConditionalMajorant
+
+def sampleMajorant {L : ℝ} (w : SourceMode 2 → ℝ) (ω : SmoothSample 2 L) : ℝ :=
+ ∑' m, w m * |ω.val m|
+
+def sourceDerivativeMajorant (L : ℝ) (k : ℕ) (ω : SmoothSample 2 L) : ℝ :=
+ sampleMajorant (orderModeBound k 2 L) ω
+
+theorem sampleMajorant_nonneg {L : ℝ} (w : SourceMode 2 → ℝ)
+ (hw : ∀ m, 0 ≤ w m) (ω : SmoothSample 2 L) : 0 ≤ sampleMajorant w ω :=
+ tsum_nonneg (fun m => mul_nonneg (hw m) (abs_nonneg _))
+
+theorem derivativeMajorant_weighted_summable {L : ℝ} (ω : SmoothSample 2 L)
+ (k : ℕ) (u : Fin k → (Fin 2 → ℝ)) :
+ Summable (fun m => derivativeMajorant 2 L k u m * |ω.val m|) := by
+ have h := (ω.property k).mul_right (∏ j, ‖u j‖)
+ simpa only [derivativeMajorant, mul_assoc, mul_left_comm, mul_comm] using h
+
+theorem confluentMajorant_weighted_summable {L : ℝ} (ω : SmoothSample 2 L) :
+ Summable (fun m => confluentModeMajorant L m * |ω.val m|) := by
+ have hc (s : Fin 8) : Summable (fun m => modeComponentMajorant L m s * |ω.val m|) := by
+ fin_cases s <;> dsimp [modeComponentMajorant]
+ all_goals exact derivativeMajorant_weighted_summable ω _ _
+ have hs := (summable_sum (fun s (_ : s ∈ (Finset.univ : Finset (Fin 8))) => hc s)).mul_left 6
+ convert hs using 1
+ funext m
+ simp only [confluentModeMajorant, Finset.sum_mul, mul_assoc]
+
+theorem pinCoefficient_abs_le {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0)
+ (i : Fin 6) (m : SourceMode 2) : |pinCoefficient L r i m| ≤ confluentModeMajorant L m := by
+ rw [pinCoefficient_eq_regularized L r hr]
+ simpa only [Real.norm_eq_abs] using regularizedPinCoefficient_bound hL r i m
+
+theorem sourceConfluentPins_abs_le {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0)
+ (ω : SmoothSample 2 L) (i : Fin 6) :
+ |sourceConfluentPinsAt L r ω i| ≤ sampleMajorant (confluentModeMajorant L) ω := by
+ rw [congrFun (sourceConfluentPinsAt_series hL r ω) i]
+ change |∑' m, pinCoefficient L r i m * ω.val m| ≤ _
+ have h := tsum_of_norm_bounded (confluentMajorant_weighted_summable ω).hasSum
+ (fun m => show ‖pinCoefficient L r i m * ω.val m‖ ≤
+ confluentModeMajorant L m * |ω.val m| by
+ rw [Real.norm_eq_abs, abs_mul]
+ exact mul_le_mul_of_nonneg_right (pinCoefficient_abs_le hL r hr i m) (abs_nonneg _))
+ simpa only [Real.norm_eq_abs, sampleMajorant] using h
+
+private theorem six_mulVec_abs_le (M : Matrix (Fin 6) (Fin 6) ℝ)
+ (K T : ℝ) (hK : 0 ≤ K) (_hT : 0 ≤ T)
+ (hM : ∀ i j, |M i j| ≤ K) (y : Fin 6 → ℝ) (hy : ∀ j, |y j| ≤ T) (i : Fin 6) :
+ |(M *ᵥ y) i| ≤ 6*K*T := by
+ calc
+ _ ≤ ∑ j, |M i j * y j| := Finset.abs_sum_le_sum_abs _ _
+ _ ≤ ∑ _j : Fin 6, K*T := Finset.sum_le_sum (fun j _ => by
+ rw [abs_mul]
+ exact mul_le_mul (hM i j) (hy j) (abs_nonneg _) hK)
+ _ = _ := by simp; ring
+
+theorem pinLift_abs_le {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0)
+ (K D : ℝ) (hK : 0 ≤ K) (hD : 0 ≤ D)
+ (hInv : ∀ i j, |(sourcePinCovarianceAt L r)⁻¹ i j| ≤ K)
+ (x : Fin 6 → ℝ) (hx : ∀ i, |x i| ≤ D) (ω : SmoothSample 2 L) (m : SourceMode 2) :
+ |pinLift L r (x - sourceConfluentPinsAt L r ω) m| ≤
+ 36*K*confluentModeMajorant L m *
+ (D + sampleMajorant (confluentModeMajorant L) ω) := by
+ let T := D + sampleMajorant (confluentModeMajorant L) ω
+ have hT : 0 ≤ T := add_nonneg hD
+ (sampleMajorant_nonneg _ (confluentModeMajorant_nonneg L) ω)
+ have hy (i : Fin 6) : |(x - sourceConfluentPinsAt L r ω) i| ≤ T := by
+ exact (abs_sub _ _).trans (add_le_add (hx i) (sourceConfluentPins_abs_le hL r hr ω i))
+ have hv := six_mulVec_abs_le ((sourcePinCovarianceAt L r)⁻¹) K T hK hT hInv
+ (x - sourceConfluentPinsAt L r ω) hy
+ unfold pinLift
+ calc
+ _ ≤ ∑ i, |pinCoefficient L r i m *
+ (((sourcePinCovarianceAt L r)⁻¹ *ᵥ (x - sourceConfluentPinsAt L r ω)) i)| :=
+ Finset.abs_sum_le_sum_abs _ _
+ _ ≤ ∑ _i : Fin 6, confluentModeMajorant L m * (6*K*T) :=
+ Finset.sum_le_sum (fun i _ => by
+ rw [abs_mul]
+ exact mul_le_mul (pinCoefficient_abs_le hL r hr i m) (hv i) (abs_nonneg _)
+ (confluentModeMajorant_nonneg L m))
+ _ = _ := by simp [T]; ring
+
+/-- The deterministic posterior bound includes every required summability
+premise for a general weight. Source derivative weights supply it pointwise. -/
+theorem posterior_sampleMajorant_le {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0)
+ (w : SourceMode 2 → ℝ) (hw0 : ∀ m, 0 ≤ w m)
+ (hwA : Summable (fun m => w m * confluentModeMajorant L m))
+ (K D : ℝ) (hK : 0 ≤ K) (hD : 0 ≤ D)
+ (hInv : ∀ i j, |(sourcePinCovarianceAt L r)⁻¹ i j| ≤ K)
+ (x : Fin 6 → ℝ) (hx : ∀ i, |x i| ≤ D) (ω : SmoothSample 2 L)
+ (hwω : Summable (fun m => w m * |ω.val m|)) :
+ Summable (fun m => w m * |(posteriorSample hL r x ω).val m|) ∧
+ sampleMajorant w (posteriorSample hL r x ω) ≤ sampleMajorant w ω +
+ 36*K*(∑' m, w m * confluentModeMajorant L m)*
+ (D + sampleMajorant (confluentModeMajorant L) ω) := by
+ let T := D + sampleMajorant (confluentModeMajorant L) ω
+ let C := 36*K*T
+ have hC : 0 ≤ C := mul_nonneg (mul_nonneg (by norm_num) hK)
+ (add_nonneg hD (sampleMajorant_nonneg _ (confluentModeMajorant_nonneg L) ω))
+ have hmajor := hwω.add (hwA.mul_left C)
+ have hpoint (m : SourceMode 2) : w m * |(posteriorSample hL r x ω).val m| ≤
+ w m * |ω.val m| + C*(w m*confluentModeMajorant L m) := by
+ rw [posteriorSample_val]
+ calc
+ _ ≤ w m * (|ω.val m| + |pinLift L r (x-sourceConfluentPinsAt L r ω) m|) :=
+ mul_le_mul_of_nonneg_left (abs_add_le _ _) (hw0 m)
+ _ ≤ w m * (|ω.val m| + 36*K*confluentModeMajorant L m*T) :=
+ mul_le_mul_of_nonneg_left
+ (add_le_add le_rfl (pinLift_abs_le hL r hr K D hK hD hInv x hx ω m)) (hw0 m)
+ _ = _ := by dsimp [C]; ring
+ have hpost : Summable (fun m => w m * |(posteriorSample hL r x ω).val m|) :=
+ Summable.of_nonneg_of_le (fun m => mul_nonneg (hw0 m) (abs_nonneg _)) hpoint hmajor
+ refine ⟨hpost, ?_⟩
+ calc
+ _ ≤ ∑' m, (w m * |ω.val m| + C*(w m*confluentModeMajorant L m)) :=
+ hpost.tsum_le_tsum hpoint hmajor
+ _ = sampleMajorant w ω + C*(∑' m, w m*confluentModeMajorant L m) := by
+ rw [hwω.tsum_add (hwA.mul_left C), tsum_mul_left]
+ rfl
+ _ = _ := by dsimp [C, T]; ring
+
+/-- Actual inverse continuity and the actual prescribed pin limit derive the
+uniform constants used by the posterior bound; neither is a model premise. -/
+theorem sourceInverse_prescribed_uniform_bounds {L : ℝ} (hL : L ≠ 0) (b : ℝ) :
+ ∃ K D δ : ℝ, 0 ≤ K ∧ 0 ≤ D ∧ 0 < δ ∧ δ ≤ 1 ∧
+ ∀ r : ℝ, 0 < r → r < δ →
+ (∀ i j, |(sourcePinCovarianceAt L r)⁻¹ i j| ≤ K) ∧
+ (∀ i, |sourcePrescribedPins r b i| ≤ D) := by
+ have hdet : (sourcePinCovariance L).det ≠ 0 :=
+ ((Matrix.isUnit_iff_isUnit_det _).mp (sourcePinCovariance_isUnit hL)).ne_zero
+ have hc : ContinuousAt (Ring.inverse : ℝ → ℝ) (sourcePinCovariance L).det := by
+ simpa only [Ring.inverse_eq_inv'] using continuousAt_inv₀ hdet
+ have hi := (continuousAt_matrix_inv (sourcePinCovariance L) hc).tendsto.comp
+ (sourcePinCovarianceAt_tendsto hL)
+ have hi' : Tendsto (fun r => fun i j => (sourcePinCovarianceAt L r)⁻¹ i j)
+ (𝓝[>] (0 : ℝ)) (𝓝 (fun i j => (sourcePinCovariance L)⁻¹ i j)) := hi
+ have hib : ∀ᶠ r in 𝓝[>] (0 : ℝ), ‖fun i j => (sourcePinCovarianceAt L r)⁻¹ i j‖ <
+ ‖fun i j => (sourcePinCovariance L)⁻¹ i j‖ + 1 :=
+ hi'.norm.eventually (gt_mem_nhds (by linarith))
+ have hdb : ∀ᶠ r in 𝓝[>] (0 : ℝ), ‖sourcePrescribedPins r b‖ <
+ ‖(![b,0,0,0,0,2] : Fin 6 → ℝ)‖ + 1 :=
+ (sourcePrescribedPins_tendsto b).norm.eventually (gt_mem_nhds (by linarith))
+ have hunit := (sourceEndpoint_parameter_limits hL b).1
+ obtain ⟨δ, hδ, hb⟩ := mem_nhdsGT_iff_exists_Ioo_subset.mp ((hib.and hdb).and hunit)
+ refine ⟨‖fun i j => (sourcePinCovariance L)⁻¹ i j‖+1,
+ ‖(![b,0,0,0,0,2] : Fin 6 → ℝ)‖+1,min δ 1, by positivity, by positivity,
+ lt_min hδ (by norm_num),min_le_right _ _,?_⟩
+ intro r hr hrδ
+ have hh := (hb ⟨hr,lt_of_lt_of_le hrδ (min_le_left _ _)⟩).1
+ constructor
+ · intro i j
+ exact (show |(sourcePinCovarianceAt L r)⁻¹ i j| ≤
+ ‖fun i j => (sourcePinCovarianceAt L r)⁻¹ i j‖ from
+ (show |(sourcePinCovarianceAt L r)⁻¹ i j| ≤ ‖(sourcePinCovarianceAt L r)⁻¹ i‖ by
+ simpa only [Real.norm_eq_abs] using norm_le_pi_norm ((sourcePinCovarianceAt L r)⁻¹ i) j).trans
+ (norm_le_pi_norm (fun i j => (sourcePinCovarianceAt L r)⁻¹ i j) i)).trans hh.1.le
+ · intro i
+ exact (show |sourcePrescribedPins r b i| ≤ ‖sourcePrescribedPins r b‖ by
+ simpa only [Real.norm_eq_abs] using norm_le_pi_norm (sourcePrescribedPins r b) i).trans hh.2.le
+
+/-- Every actual derivative is bounded globally in its evaluation point by
+the literal all-order Fourier absolute majorant on the smooth carrier. -/
+theorem smoothSourceField_global_derivative_bound {L : ℝ} (hL : L ≠ 0)
+ (k : ℕ) (ω : SmoothSample 2 L) (x : Fin 2 → ℝ) :
+ ‖iteratedFDeriv ℝ k (smoothSourceField 2 L ω) x‖ ≤ sourceDerivativeMajorant L k ω := by
+ apply ContinuousMultilinearMap.opNorm_le_bound
+ (sampleMajorant_nonneg _ (orderModeBound_nonneg k 2 L) ω)
+ intro u
+ rw [smoothSourceField_derivative_series 2 hL]
+ have hs := (ω.property k).mul_right (∏ j, ‖u j‖)
+ have h := tsum_of_norm_bounded hs.hasSum (fun m =>
+ show ‖derivativeCoefficient 2 L k x u m * ω.val m‖ ≤
+ (orderModeBound k 2 L m * |ω.val m|) * (∏ j, ‖u j‖) by
+ simp only [norm_mul, Real.norm_eq_abs]
+ have hb := mul_le_mul_of_nonneg_right (derivativeCoefficient_bound 2 hL k u m x)
+ (abs_nonneg (ω.val m))
+ simpa only [Real.norm_eq_abs, derivativeMajorant, mul_assoc, mul_left_comm, mul_comm] using hb)
+ change ‖∑' m, derivativeCoefficient 2 L k x u m * ω.val m‖ ≤ _
+ simpa only [sourceDerivativeMajorant, sampleMajorant, tsum_mul_right] using h
+
+theorem sampleMajorant_measurable (L : ℝ) (w : SourceMode 2 → ℝ) :
+ Measurable (sampleMajorant (L := L) w) := by
+ exact weightedAbsSeries_measurable w (fun m (ω : SmoothSample 2 L) => ω.val m)
+ (fun m => (measurable_pi_apply m).comp measurable_subtype_coe)
+
+theorem sourceDerivativeMajorant_measurable (L : ℝ) (k : ℕ) :
+ Measurable (sourceDerivativeMajorant L k) := sampleMajorant_measurable L _
+
+theorem sampleMajorant_add {L : ℝ} (w v : SourceMode 2 → ℝ) (ω : SmoothSample 2 L)
+ (hw : Summable (fun m => w m * |ω.val m|))
+ (hv : Summable (fun m => v m * |ω.val m|)) :
+ sampleMajorant (fun m => w m+v m) ω = sampleMajorant w ω + sampleMajorant v ω := by
+ unfold sampleMajorant
+ simp_rw [add_mul]
+ exact hw.tsum_add hv
+
+theorem sampleMajorant_const_mul {L : ℝ} (c : ℝ) (w : SourceMode 2 → ℝ)
+ (ω : SmoothSample 2 L) :
+ sampleMajorant (fun m => c*w m) ω = c*sampleMajorant w ω := by
+ unfold sampleMajorant
+ simp_rw [mul_assoc]
+ exact tsum_mul_left
+
+/-- The posterior is dominated by one fixed positive summable weight plus
+its retained drift, uniformly at every sufficiently small positive radius. -/
+theorem sourceDerivativeMajorant_uniform_domination {L : ℝ} (hL : L ≠ 0)
+ (b : ℝ) (k : ℕ) :
+ ∃ a : ℝ, ∃ w : SourceMode 2 → ℝ, ∃ δ : ℝ,
+ 0 ≤ a ∧ (∀ m, 0 ≤ w m) ∧ Summable w ∧ 0 < ∑' m, w m ∧ 0 < δ ∧ δ ≤ 1 ∧
+ ∀ r : ℝ, 0 < r → r < δ → ∀ ω : SmoothSample 2 L,
+ sourceDerivativeMajorant L k (posteriorSample hL r (sourcePrescribedPins r b) ω) ≤
+ a + sampleMajorant w ω := by
+ obtain ⟨K,D,δ,hK,hD,hδ,hδ1,hbounds⟩ := sourceInverse_prescribed_uniform_bounds hL b
+ let w0 := orderModeBound k 2 L
+ let A := confluentModeMajorant L
+ have hw0 : ∀ m, 0 ≤ w0 m := orderModeBound_nonneg k 2 L
+ have hA : ∀ m, 0 ≤ A m := confluentModeMajorant_nonneg L
+ have hwA : Summable (fun m => w0 m*A m) := coefficient_product_summable
+ (orderModeBound_summable k 2 hL) (confluentModeMajorant_summable hL)
+ let B := ∑' m, w0 m*A m
+ have hB : 0 ≤ B := tsum_nonneg (fun m => mul_nonneg (hw0 m) (hA m))
+ let C := 36*K*B
+ have hC : 0 ≤ C := mul_nonneg (mul_nonneg (by norm_num) hK) hB
+ let w := fun m => w0 m+C*A m
+ have hw : Summable w := (orderModeBound_summable k 2 hL).add
+ ((confluentModeMajorant_summable hL).mul_left C)
+ have hwpos : ∀ m, 0 ≤ w m := fun m => add_nonneg (hw0 m) (mul_nonneg hC (hA m))
+ have hDC : 0 < w0 none := by
+ change 0 < Real.sqrt (1/sourceZ 2 L)
+ exact Real.sqrt_pos.mpr (one_div_pos.mpr (sourceZ_pos 2 hL))
+ have hW : 0 < ∑' m, w m :=
+ (hDC.trans_le (le_add_of_nonneg_right (mul_nonneg hC (hA none)))).trans_le
+ (hw.le_tsum none (fun m _ => hwpos m))
+ refine ⟨C*D,w,δ,mul_nonneg hC hD,hwpos,hw,hW,hδ,hδ1,?_⟩
+ intro r hr hrδ ω
+ obtain ⟨hInv,hx⟩ := hbounds r hr hrδ
+ have hbound := (posterior_sampleMajorant_le hL r hr.ne' w0 hw0 hwA K D hK hD hInv
+ (sourcePrescribedPins r b) hx ω (ω.property k)).2
+ have hrec : sampleMajorant w ω = sourceDerivativeMajorant L k ω +
+ C*sampleMajorant A ω := by
+ rw [show w = (fun m => w0 m+C*A m) from rfl,
+ sampleMajorant_add w0 (fun m => C*A m) ω (ω.property k)]
+ · rw [sampleMajorant_const_mul]
+ rfl
+ · convert (confluentMajorant_weighted_summable ω).mul_left C using 1
+ funext m
+ ring
+ calc
+ _ ≤ sampleMajorant w0 ω + 36*K*B*(D+sampleMajorant A ω) := hbound
+ _ = C*D + sampleMajorant w ω := by rw [hrec]; dsimp [C,sourceDerivativeMajorant,w0]; ring
+
+theorem source_coordinate_hasLaw {L : ℝ} (hL : L ≠ 0) (m : SourceMode 2) :
+ HasLaw (fun ω : SmoothSample 2 L => ω.val m) (gaussianReal 0 1) (smoothLaw 2 L) where
+ aemeasurable := ((measurable_pi_apply m).comp measurable_subtype_coe).aemeasurable
+ map_eq := I4SmoothCarrier.coordinate_marginal 2 hL m
+
+theorem sampleMajorant_prior_moment {L : ℝ} (hL : L ≠ 0)
+ (w : SourceMode 2 → ℝ) (hw0 : ∀ m, 0 ≤ w m) (hw : Summable w) (n : ℕ) :
+ Integrable (fun ω : SmoothSample 2 L => sampleMajorant w ω ^ n) (smoothLaw 2 L) ∧
+ (∫ ω, sampleMajorant w ω ^ n ∂smoothLaw 2 L) ≤
+ (∑' m, w m)^n * standardAbsMoment n := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ exact weightedAbsSeries_moment (smoothLaw 2 L) w
+ (fun m (ω : SmoothSample 2 L) => ω.val m)
+ (fun m => (measurable_pi_apply m).comp measurable_subtype_coe) hw0 hw
+ (source_coordinate_hasLaw hL) n
+
+private theorem drift_majorant_integrable_pow {L : ℝ} (hL : L ≠ 0)
+ (a : ℝ) (ha : 0 ≤ a) (w : SourceMode 2 → ℝ) (hw0 : ∀ m, 0 ≤ w m)
+ (hw : Summable w) (n : ℕ) :
+ Integrable (fun ω : SmoothSample 2 L => (a+sampleMajorant w ω)^n) (smoothLaw 2 L) := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ have hΓ := (sampleMajorant_prior_moment hL w hw0 hw n).1
+ have hmajor : Integrable (fun ω : SmoothSample 2 L =>
+ (2:ℝ)^(n-1)*(a^n+sampleMajorant w ω^n)) (smoothLaw 2 L) :=
+ ((integrable_const _).add hΓ).const_mul _
+ apply hmajor.mono' (((sampleMajorant_measurable L w).const_add a).pow_const n).aestronglyMeasurable
+ filter_upwards [] with ω
+ rw [Real.norm_eq_abs,abs_of_nonneg (pow_nonneg (add_nonneg ha (sampleMajorant_nonneg w hw0 ω)) n)]
+ exact add_pow_le ha (sampleMajorant_nonneg w hw0 ω) n
+
+/-- Every natural conditional derivative-majorant moment is derived from the
+actual posterior sampling map; the common small-radius interval is uniform in n. -/
+theorem sourceConditionalDerivative_moments {L : ℝ} (hL : L ≠ 0) (b : ℝ) (k : ℕ) :
+ ∃ δ : ℝ, 0 < δ ∧ δ ≤ 1 ∧ ∀ n : ℕ, ∃ M : ℝ, 0 ≤ M ∧
+ ∀ r : ℝ, 0 < r → r < δ →
+ Integrable (fun ω => sourceDerivativeMajorant L k ω ^ n)
+ (sourceSmoothKernel hL r (sourcePrescribedPins r b)) ∧
+ (∫ ω, sourceDerivativeMajorant L k ω ^ n
+ ∂sourceSmoothKernel hL r (sourcePrescribedPins r b)) ≤ M := by
+ obtain ⟨a,w,δ,ha,hw0,hw,_hW,hδ,hδ1,hdom⟩ := sourceDerivativeMajorant_uniform_domination hL b k
+ refine ⟨δ,hδ,hδ1,?_⟩
+ intro n
+ let F : SmoothSample 2 L → ℝ := fun ω => (a+sampleMajorant w ω)^n
+ have hF : Integrable F (smoothLaw 2 L) := drift_majorant_integrable_pow hL a ha w hw0 hw n
+ refine ⟨∫ ω, F ω ∂smoothLaw 2 L,integral_nonneg (fun ω =>
+ pow_nonneg (add_nonneg ha (sampleMajorant_nonneg w hw0 ω)) n),?_⟩
+ intro r hr hrδ
+ have hp : Measurable (posteriorSample hL r (sourcePrescribedPins r b)) :=
+ (posteriorSample_measurable hL r).comp (measurable_const.prodMk measurable_id)
+ have hg := (sourceDerivativeMajorant_measurable L k).pow_const n
+ have hpoint (ω : SmoothSample 2 L) :
+ sourceDerivativeMajorant L k (posteriorSample hL r (sourcePrescribedPins r b) ω)^n ≤ F ω :=
+ pow_le_pow_left₀ (sampleMajorant_nonneg _ (orderModeBound_nonneg k 2 L) _) (hdom r hr hrδ ω) n
+ have hpost : Integrable (fun ω => sourceDerivativeMajorant L k
+ (posteriorSample hL r (sourcePrescribedPins r b) ω)^n) (smoothLaw 2 L) := by
+ apply hF.mono' (hg.comp hp).aestronglyMeasurable
+ filter_upwards [] with ω
+ rw [Real.norm_eq_abs]
+ change |sourceDerivativeMajorant L k (posteriorSample hL r (sourcePrescribedPins r b) ω)^n| ≤ F ω
+ have hnon : 0 ≤ sourceDerivativeMajorant L k
+ (posteriorSample hL r (sourcePrescribedPins r b) ω)^n :=
+ pow_nonneg (sampleMajorant_nonneg _ (orderModeBound_nonneg k 2 L) _) n
+ rw [abs_of_nonneg hnon]
+ exact hpoint ω
+ rw [sourceSmoothKernel_apply hL r (sourcePrescribedPins r b)]
+ refine ⟨(integrable_map_measure hg.aestronglyMeasurable hp.aemeasurable).mpr hpost,?_⟩
+ rw [integral_map hp.aemeasurable hg.aestronglyMeasurable]
+ exact integral_mono hpost hF hpoint
+
+/-- Markov gives every polynomial rate for the literal measurable majorant
+cutoff. This event certifies the global derivative bound without a supremum. -/
+theorem sourceConditionalDerivative_cutoff_tail {L : ℝ} (hL : L ≠ 0)
+ (b : ℝ) (k n : ℕ) :
+ ∃ M δ : ℝ, 0 ≤ M ∧ 0 < δ ∧ δ ≤ 1 ∧ ∀ r : ℝ, 0 < r → r < δ →
+ (sourceSmoothKernel hL r (sourcePrescribedPins r b)).real
+ {ω | r⁻¹ < sourceDerivativeMajorant L k ω} ≤ M*r^n := by
+ obtain ⟨δ,hδ,hδ1,hmom⟩ := sourceConditionalDerivative_moments hL b k
+ obtain ⟨M,hM,hm⟩ := hmom n
+ refine ⟨M,δ,hM,hδ,hδ1,?_⟩
+ intro r hr hrδ
+ obtain ⟨hint,hbound⟩ := hm r hr hrδ
+ let P := sourceSmoothKernel hL r (sourcePrescribedPins r b)
+ have : IsProbabilityMeasure P := inferInstance
+ have hpow : 0 ≤ᵐ[P] (fun ω => sourceDerivativeMajorant L k ω ^ n) :=
+ Eventually.of_forall (fun ω => pow_nonneg
+ (sampleMajorant_nonneg _ (orderModeBound_nonneg k 2 L) ω) n)
+ have hMarkov := mul_meas_ge_le_integral_of_nonneg hpow hint ((r⁻¹)^n)
+ have hsub : {ω : SmoothSample 2 L | r⁻¹ < sourceDerivativeMajorant L k ω} ⊆
+ {ω | (r⁻¹)^n ≤ sourceDerivativeMajorant L k ω^n} :=
+ fun ω hω => pow_le_pow_left₀ (inv_nonneg.mpr hr.le) hω.le n
+ have hreal := measureReal_mono (μ := P) hsub
+ have hprod : (r⁻¹)^n * P.real {ω | r⁻¹ < sourceDerivativeMajorant L k ω} ≤ M :=
+ (mul_le_mul_of_nonneg_left hreal (pow_nonneg (inv_nonneg.mpr hr.le) n)).trans
+ (hMarkov.trans hbound)
+ have hcancel : ((r⁻¹)^n * P.real {ω | r⁻¹ < sourceDerivativeMajorant L k ω}) * r^n =
+ P.real {ω | r⁻¹ < sourceDerivativeMajorant L k ω} := by
+ rw [mul_right_comm,←mul_pow,inv_mul_cancel₀ hr.ne',one_pow,one_mul]
+ rw [←hcancel]
+ exact mul_le_mul_of_nonneg_right hprod (pow_nonneg hr.le n)
+
+/-- A genuine Gaussian upper tail follows from the independently proved
+folded-Gaussian exponential estimate, with the posterior drift retained. -/
+theorem sourceConditionalDerivative_gaussian_upper_tail {L : ℝ} (hL : L ≠ 0)
+ (b : ℝ) (k : ℕ) :
+ ∃ a s δ : ℝ, 0 ≤ a ∧ 0 < s ∧ 0 < δ ∧ δ ≤ 1 ∧
+ ∀ r : ℝ, 0 < r → r < δ → ∀ R : ℝ, 0 ≤ R →
+ (sourceSmoothKernel hL r (sourcePrescribedPins r b)).real
+ {ω | a+R ≤ sourceDerivativeMajorant L k ω} ≤
+ 2*Real.exp (-(R^2)/(2*s^2)) := by
+ obtain ⟨a,w,δ,ha,hw0,hw,hW,hδ,hδ1,hdom⟩ := sourceDerivativeMajorant_uniform_domination hL b k
+ refine ⟨a,∑' m,w m,δ,ha,hW,hδ,hδ1,?_⟩
+ intro r hr hrδ R hR
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ have hp : Measurable (posteriorSample hL r (sourcePrescribedPins r b)) :=
+ (posteriorSample_measurable hL r).comp (measurable_const.prodMk measurable_id)
+ have hE : MeasurableSet {ω : SmoothSample 2 L | a+R ≤ sourceDerivativeMajorant L k ω} :=
+ measurableSet_le measurable_const (sourceDerivativeMajorant_measurable L k)
+ have htail := weightedAbsSeries_upper_tail (smoothLaw 2 L) w
+ (fun m (ω : SmoothSample 2 L) => ω.val m)
+ (fun m => (measurable_pi_apply m).comp measurable_subtype_coe) hw0 hw
+ (source_coordinate_hasLaw hL) hW R hR
+ rw [sourceSmoothKernel_apply hL r (sourcePrescribedPins r b),measureReal_def,
+ Measure.map_apply hp hE]
+ change (smoothLaw 2 L).real
+ {ω | a+R ≤ sourceDerivativeMajorant L k (posteriorSample hL r (sourcePrescribedPins r b) ω)} ≤ _
+ calc
+ _ ≤ (smoothLaw 2 L).real {ω | R ≤ sampleMajorant w ω} := by
+ apply measureReal_mono
+ · intro ω hω
+ have hd := hdom r hr hrδ ω
+ change a+R ≤ sourceDerivativeMajorant L k (posteriorSample hL r (sourcePrescribedPins r b) ω) at hω
+ change R ≤ sampleMajorant w ω
+ linarith
+ · exact measure_ne_top _ _
+ _ ≤ _ := htail
+
+/-- The same measurable cutoff has every polynomial rate under the actual
+whole-carrier endpoint-weighted law. This is an explicit weighted probability,
+with no identification with a geometric Kac–Rice/Palm law asserted. -/
+theorem sourceWeightedDerivative_cutoff_tail {L : ℝ} (hL : L ≠ 0)
+ (b : ℝ) (k n : ℕ) :
+ ∃ M δ : ℝ, 0 ≤ M ∧ 0 < δ ∧ δ ≤ 1 ∧ ∀ r : ℝ, 0 < r → r < δ →
+ IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) ∧
+ (sourceSmoothWeightedLaw hL r b).real
+ {ω | r⁻¹ < sourceDerivativeMajorant L k ω} ≤ M*r^n := by
+ obtain ⟨C,c,δP,hC,hc,hδP,hδP1,hPalm⟩ := sourceSmoothPalm_estimates hL b
+ obtain ⟨B,δB,hB,hδB,hδB1,hbase⟩ := sourceConditionalDerivative_cutoff_tail hL b k (2*n)
+ let A := Real.sqrt C/c
+ have hA : 0 ≤ A := div_nonneg (Real.sqrt_nonneg _) hc.le
+ refine ⟨A*Real.sqrt B,min δP δB,mul_nonneg hA (Real.sqrt_nonneg _),
+ lt_min hδP hδB,(min_le_left _ _).trans hδP1,?_⟩
+ intro r hr hrδ
+ have hrP : r < δP := lt_of_lt_of_le hrδ (min_le_left _ _)
+ have hrB : r < δB := lt_of_lt_of_le hrδ (min_le_right _ _)
+ have hp := hPalm r hr hrP
+ have hE : MeasurableSet {ω : SmoothSample 2 L | r⁻¹ < sourceDerivativeMajorant L k ω} :=
+ measurableSet_lt measurable_const (sourceDerivativeMajorant_measurable L k)
+ refine ⟨hp.2.2.2.1,?_⟩
+ have he := hp.2.2.2.2.1 _ hE
+ have hb := hbase r hr hrB
+ have hsqrt : Real.sqrt ((sourceSmoothLaw hL r b).real
+ {ω | r⁻¹ < sourceDerivativeMajorant L k ω}) ≤ Real.sqrt B*r^n := by
+ calc
+ _ ≤ Real.sqrt (B*r^(2*n)) := Real.sqrt_le_sqrt hb
+ _ = Real.sqrt B*r^n := by
+ rw [Real.sqrt_mul hB,show r^(2*n) = (r^n)^2 by rw [←pow_mul,Nat.mul_comm],
+ Real.sqrt_sq (pow_nonneg hr.le n)]
+ exact he.trans (by
+ change A*Real.sqrt ((sourceSmoothLaw hL r b).real
+ {ω | r⁻¹ < sourceDerivativeMajorant L k ω}) ≤ A*Real.sqrt B*r^n
+ simpa only [mul_assoc] using mul_le_mul_of_nonneg_left hsqrt hA)
+
+end I4SourceConditionalMajorant
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConfluentLimits.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConfluentLimits.lean
new file mode 100644
index 000000000..5daa669f9
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConfluentLimits.lean
@@ -0,0 +1,1127 @@
+import SourceEndpointRegression
+import SourceDerivativeContinuity
+import SourceContactSchur
+import SourceContactEndpointParameters
+import ConfluentIntegralIdentities
+import Mathlib.Analysis.Normed.Group.Tannery
+import Mathlib.MeasureTheory.Integral.DominatedConvergence
+import Mathlib.Analysis.SpecialFunctions.Integrals.Basic
+
+/-! Actual Fourier representations and covariance limits for the confluent pins
+and pin-adjusted endpoint observations. Singular quotient values at zero are
+not identified with their continuous contact extensions. -/
+
+noncomputable section
+
+open I4Foundation I4Source I4Smooth I4SmoothCarrier I4SourceGaussian
+open I4SourceDerivativeGaussian I4SourceDerivativeContinuity I4SourceConfluentPins
+open I4SourceEndpointRegression I4SourceContact I4ConfluentIntegralIdentities
+open MeasureTheory ProbabilityTheory Matrix Filter
+open scoped BigOperators NNReal Topology
+
+namespace I4SourceConfluentLimits
+
+abbrev rawDerivativeOrder : Fin 12 → ℕ := ![0,0,1,1,1,1,2,2,2,2,2,2]
+
+def rawDerivativePoint (r : ℝ) : Fin 12 → (Fin 2 → ℝ) :=
+ ![endpointM r,endpointS r,endpointM r,endpointS r,endpointM r,endpointS r,
+ endpointM r,endpointM r,endpointM r,endpointS r,endpointS r,endpointS r]
+
+def rawDerivativeDirections : (i : Fin 12) → Fin (rawDerivativeOrder i) → (Fin 2 → ℝ) :=
+ fun i a => if i.val < 4 then directionX else if i.val < 6 then directionY
+ else if i.val % 3 = 0 then directionX
+ else if i.val % 3 = 1 ∧ a.val = 0 then directionX else directionY
+
+def rawDerivativeCoefficient (L r : ℝ) (i : Fin 12) (m : SourceMode 2) : ℝ :=
+ derivativeCoefficient 2 L (rawDerivativeOrder i) (rawDerivativePoint r i)
+ (rawDerivativeDirections i) m
+
+def pinObservationMap (r : ℝ) : (Fin 12 → ℝ) →L[ℝ] (Fin 6 → ℝ) :=
+ (ContinuousLinearMap.fst ℝ (Fin 6 → ℝ) (Fin 6 → ℝ)).comp (endpointObservationMap r)
+
+def adjustedObservationMap (r : ℝ) : (Fin 12 → ℝ) →L[ℝ] (Fin 6 → ℝ) :=
+ (ContinuousLinearMap.snd ℝ (Fin 6 → ℝ) (Fin 6 → ℝ)).comp (endpointObservationMap r)
+
+def pinCoefficient (L r : ℝ) (i : Fin 6) (m : SourceMode 2) : ℝ :=
+ pinObservationMap r (fun j => rawDerivativeCoefficient L r j m) i
+
+def adjustedCoefficient (L r : ℝ) (i : Fin 6) (m : SourceMode 2) : ℝ :=
+ adjustedObservationMap r (fun j => rawDerivativeCoefficient L r j m) i
+
+private theorem derivativeCoefficient_weighted_summable {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample 2 L) (k : ℕ) (x : Fin 2 → ℝ) (u : Fin k → (Fin 2 → ℝ)) :
+ Summable (fun m => derivativeCoefficient 2 L k x u m * sampleInclusion 2 L ω m) := by
+ apply ((ω.property k).mul_right (∏ j, ‖u j‖)).of_norm_bounded
+ intro m
+ rw [norm_mul, Real.norm_eq_abs]
+ calc
+ _ ≤ derivativeMajorant 2 L k u m * |sampleInclusion 2 L ω m| :=
+ mul_le_mul_of_nonneg_right (derivativeCoefficient_bound 2 hL k u m x) (abs_nonneg _)
+ _ = (orderModeBound k 2 L m * |sampleInclusion 2 L ω m|) * ∏ j, ‖u j‖ := by
+ unfold derivativeMajorant
+ ring
+
+private theorem finiteSeries_map {ι : Type*} {n q : ℕ}
+ (a : Fin n → ι → ℝ) (ω : ι → ℝ)
+ (ha : ∀ i, Summable (fun m => a i m * ω m))
+ (T : (Fin n → ℝ) →L[ℝ] (Fin q → ℝ)) :
+ T (fun i => scalarSeries (a i) ω) =
+ (fun j => scalarSeries (fun m => T (fun i => a i m) j) ω) := by
+ have hs : HasSum (fun m i => a i m * ω m) (fun i => scalarSeries (a i) ω) :=
+ Pi.hasSum.mpr (fun i => (ha i).hasSum)
+ have ht := hs.map T.toAddMonoidHom T.continuous
+ funext j
+ have hj : HasSum (fun m => T (fun i => a i m) j * ω m)
+ (T (fun i => scalarSeries (a i) ω) j) := by
+ convert Pi.hasSum.mp ht j using 1
+ · funext m
+ have hm : (fun i => a i m * ω m) = ω m • (fun i => a i m) := by
+ funext i
+ simp only [Pi.smul_apply, smul_eq_mul, mul_comm]
+ change T (fun i => a i m) j * ω m = T (fun i => a i m * ω m) j
+ rw [hm, map_smul]
+ exact mul_comm _ _
+ · rfl
+ exact hj.tsum_eq.symm
+
+private theorem finiteCoefficient_map_summable {ι : Type*} {n q : ℕ}
+ (a : Fin n → ι → ℝ) (ha : ∀ i, Summable (a i))
+ (T : (Fin n → ℝ) →L[ℝ] (Fin q → ℝ)) (j : Fin q) :
+ Summable (fun m => T (fun i => a i m) j) := by
+ have hs : HasSum (fun m i => a i m) (fun i => ∑' m, a i m) :=
+ Pi.hasSum.mpr (fun i => (ha i).hasSum)
+ exact (Pi.hasSum.mp (hs.map T.toAddMonoidHom T.continuous) j).summable
+
+theorem rawPinsWithHessians_series {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (ω : SmoothSample 2 L) :
+ rawPinsWithHessians L r ω =
+ (fun i => scalarSeries (rawDerivativeCoefficient L r i) (sampleInclusion 2 L ω)) := by
+ funext i
+ unfold rawDerivativeCoefficient
+ rw [← smoothSourceField_derivative_series 2 hL ω]
+ fin_cases i <;>
+ dsimp [rawPinsWithHessians, rawPins, rawDerivativeCoefficient, rawDerivativeOrder,
+ rawDerivativePoint, rawDerivativeDirections]
+ all_goals first
+ | rfl
+ | exact (iteratedFDeriv_one_apply (rawDerivativeDirections 2)).symm
+ | exact (iteratedFDeriv_one_apply (rawDerivativeDirections 3)).symm
+ | exact (iteratedFDeriv_one_apply (rawDerivativeDirections 4)).symm
+ | exact (iteratedFDeriv_one_apply (rawDerivativeDirections 5)).symm
+ | apply congrArg (iteratedFDeriv ℝ 2 (smoothSourceField 2 L ω) (endpointM r))
+ ext a
+ fin_cases a <;> rfl
+ | apply congrArg (iteratedFDeriv ℝ 2 (smoothSourceField 2 L ω) (endpointS r))
+ ext a
+ fin_cases a <;> rfl
+
+theorem pinCoefficient_summable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i : Fin 6) :
+ Summable (pinCoefficient L r i) :=
+ finiteCoefficient_map_summable (rawDerivativeCoefficient L r)
+ (fun j => derivativeCoefficient_summable 2 hL (rawDerivativeOrder j)
+ (rawDerivativePoint r j) (rawDerivativeDirections j)) (pinObservationMap r) i
+
+theorem adjustedCoefficient_summable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i : Fin 6) :
+ Summable (adjustedCoefficient L r i) :=
+ finiteCoefficient_map_summable (rawDerivativeCoefficient L r)
+ (fun j => derivativeCoefficient_summable 2 hL (rawDerivativeOrder j)
+ (rawDerivativePoint r j) (rawDerivativeDirections j)) (adjustedObservationMap r) i
+
+theorem sourceConfluentPinsAt_series {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (ω : SmoothSample 2 L) :
+ sourceConfluentPinsAt L r ω =
+ (fun i => scalarSeries (pinCoefficient L r i) (sampleInclusion 2 L ω)) := by
+ have hactual := congrArg Prod.fst (endpointObservationMap_actual L r ω)
+ change pinObservationMap r (rawPinsWithHessians L r ω) = sourceConfluentPinsAt L r ω
+ at hactual
+ rw [← hactual, rawPinsWithHessians_series hL]
+ exact finiteSeries_map (rawDerivativeCoefficient L r) (sampleInclusion 2 L ω)
+ (fun j => derivativeCoefficient_weighted_summable hL ω (rawDerivativeOrder j)
+ (rawDerivativePoint r j) (rawDerivativeDirections j)) (pinObservationMap r)
+
+theorem sourceAdjustedEndpoints_series {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (ω : SmoothSample 2 L) :
+ sourceAdjustedEndpoints L r ω =
+ (fun i => scalarSeries (adjustedCoefficient L r i) (sampleInclusion 2 L ω)) := by
+ have hactual := congrArg Prod.snd (endpointObservationMap_actual L r ω)
+ change adjustedObservationMap r (rawPinsWithHessians L r ω) = sourceAdjustedEndpoints L r ω
+ at hactual
+ rw [← hactual, rawPinsWithHessians_series hL]
+ exact finiteSeries_map (rawDerivativeCoefficient L r) (sampleInclusion 2 L ω)
+ (fun j => derivativeCoefficient_weighted_summable hL ω (rawDerivativeOrder j)
+ (rawDerivativePoint r j) (rawDerivativeDirections j)) (adjustedObservationMap r)
+
+theorem sourcePinCovarianceAt_coefficient {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i j : Fin 6) :
+ sourcePinCovarianceAt L r i j = ∑' m, pinCoefficient L r i m * pinCoefficient L r j m := by
+ unfold sourcePinCovarianceAt
+ simp_rw [sourceConfluentPinsAt_series hL]
+ rw [covariance_comp_inclusion 2 hL _ _ (scalarSeries_measurable _)
+ (scalarSeries_measurable _)]
+ exact I4SourceCovariance.scalarSeries_covariance _ _
+ (pinCoefficient_summable hL r i) (pinCoefficient_summable hL r j)
+
+theorem sourceCrossCovarianceAt_coefficient {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i j : Fin 6) :
+ sourceCrossCovarianceAt L r i j =
+ ∑' m, adjustedCoefficient L r i m * pinCoefficient L r j m := by
+ unfold sourceCrossCovarianceAt
+ simp_rw [sourceConfluentPinsAt_series hL, sourceAdjustedEndpoints_series hL]
+ rw [covariance_comp_inclusion 2 hL _ _ (scalarSeries_measurable _)
+ (scalarSeries_measurable _)]
+ exact I4SourceCovariance.scalarSeries_covariance _ _
+ (adjustedCoefficient_summable hL r i) (pinCoefficient_summable hL r j)
+
+theorem sourceEndpointCovarianceAt_coefficient {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i j : Fin 6) :
+ sourceEndpointCovarianceAt L r i j =
+ ∑' m, adjustedCoefficient L r i m * adjustedCoefficient L r j m := by
+ unfold sourceEndpointCovarianceAt
+ simp_rw [sourceAdjustedEndpoints_series hL]
+ rw [covariance_comp_inclusion 2 hL _ _ (scalarSeries_measurable _)
+ (scalarSeries_measurable _)]
+ exact I4SourceCovariance.scalarSeries_covariance _ _
+ (adjustedCoefficient_summable hL r i) (adjustedCoefficient_summable hL r j)
+
+end I4SourceConfluentLimits
+
+
+/- The following source-mode chain qualifications were coauthored by
+OpenAI/Codex /root/dm2_landed_composition and supplied as compiled scratch
+ModeCurveChains.lean; this is proof authorship, not independent review. -/
+
+
+open I4Source I4Weights I4SourceDerivativeGaussian I4SourceConfluentPins
+
+namespace I4ModeCurveChains
+
+def axisMap : ℝ →L[ℝ] (Fin 2 → ℝ) where
+ toFun t := ![t,0]
+ map_add' s t := by ext i; fin_cases i <;> simp
+ map_smul' c t := by ext i; fin_cases i <;> simp
+ cont := by fun_prop
+
+theorem mode_smooth (L : ℝ) (m : SourceMode 2) :
+ ContDiff ℝ (⊤ : ℕ∞) (modeCoefficient 2 L m) := by
+ cases m with
+ | none =>
+ change ContDiff ℝ (⊤ : ℕ∞) (fun _ : Fin 2 → ℝ => Real.sqrt (1 / sourceZ 2 L))
+ fun_prop
+ | some p =>
+ rcases p with ⟨k,b⟩
+ change ContDiff ℝ (⊤ : ℕ∞) (fun x : Fin 2 → ℝ =>
+ Real.sqrt (2 * sourceWeight 2 L k / sourceZ 2 L) *
+ if b then Real.sin (phase 2 L k x) else Real.cos (phase 2 L k x))
+ cases b <;> simp only [Bool.false_eq_true, ite_false, ite_true] <;>
+ unfold phase <;> fun_prop
+
+theorem axis_iteratedDeriv (f : (Fin 2 → ℝ) → ℝ)
+ (hf : ContDiff ℝ (⊤ : ℕ∞) f) (k : ℕ) (t : ℝ) :
+ iteratedDeriv k (fun s => f ![s,0]) t =
+ iteratedFDeriv ℝ k f ![t,0] (fun _ => directionX) := by
+ rw [iteratedDeriv_eq_iteratedFDeriv]
+ have h := axisMap.iteratedFDeriv_comp_right hf t (i := k) (by simp)
+ have hh := congrArg (fun A => A (fun _ => (1 : ℝ))) h
+ simpa [Function.comp_def, axisMap, directionX,
+ ContinuousMultilinearMap.compContinuousLinearMap_apply] using hh
+
+theorem axis_transverse_smooth (f : (Fin 2 → ℝ) → ℝ)
+ (hf : ContDiff ℝ (⊤ : ℕ∞) f) :
+ ContDiff ℝ (⊤ : ℕ∞) (fun t => fderiv ℝ f ![t,0] directionY) := by
+ have hdf : ContDiff ℝ (⊤ : ℕ∞) (fderiv ℝ f) := hf.fderiv_right (by simp)
+ exact (hdf.clm_apply contDiff_const).comp axisMap.contDiff
+
+theorem axis_transverse_iteratedDeriv (f : (Fin 2 → ℝ) → ℝ)
+ (hf : ContDiff ℝ (⊤ : ℕ∞) f) (k : ℕ) (t : ℝ) :
+ iteratedDeriv k (fun s => fderiv ℝ f ![s,0] directionY) t =
+ iteratedFDeriv ℝ (k+1) f ![t,0] (Fin.snoc (fun _ => directionX) directionY) := by
+ have hdf : ContDiff ℝ (⊤ : ℕ∞) (fderiv ℝ f) := hf.fderiv_right (by simp)
+ have hfun : ContDiff ℝ (⊤ : ℕ∞) (fun x => fderiv ℝ f x directionY) :=
+ hdf.clm_apply contDiff_const
+ calc
+ _ = iteratedFDeriv ℝ k (fun x => fderiv ℝ f x directionY) ![t,0]
+ (fun _ => directionX) := axis_iteratedDeriv _ hfun k t
+ _ = iteratedFDeriv ℝ k (fderiv ℝ f) ![t,0] (fun _ => directionX) directionY :=
+ iteratedFDeriv_clm_apply_const_apply hdf (by simp)
+ _ = _ := by
+ rw [iteratedFDeriv_succ_apply_right, Fin.init_snoc, Fin.snoc_last]
+
+def modeF (L : ℝ) (m : SourceMode 2) (t : ℝ) : ℝ := modeCoefficient 2 L m ![t,0]
+def modeH (L : ℝ) (m : SourceMode 2) (t : ℝ) : ℝ :=
+ derivativeCoefficient 2 L 1 ![t,0] ![directionY] m
+
+theorem modeH_eq (L : ℝ) (m : SourceMode 2) :
+ modeH L m = fun t => fderiv ℝ (modeCoefficient 2 L m) ![t,0] directionY := by
+ funext t
+ exact iteratedFDeriv_one_apply _
+
+theorem modeF_C3 (L : ℝ) (m : SourceMode 2) : ContDiff ℝ 3 (modeF L m) :=
+ ((mode_smooth L m).comp axisMap.contDiff).of_le (by simp)
+
+theorem modeH_C2 (L : ℝ) (m : SourceMode 2) : ContDiff ℝ 2 (modeH L m) := by
+ rw [modeH_eq]
+ exact (axis_transverse_smooth _ (mode_smooth L m)).of_le (by simp)
+
+theorem modeF_deriv (L : ℝ) (m : SourceMode 2) (t : ℝ) :
+ deriv (modeF L m) t = derivativeCoefficient 2 L 1 ![t,0] ![directionX] m := by
+ change deriv (fun s => modeCoefficient 2 L m ![s,0]) t = _
+ have h := axis_iteratedDeriv _ (mode_smooth L m) 1 t
+ simpa [derivativeCoefficient, iteratedDeriv_one] using h
+
+theorem modeF_second (L : ℝ) (m : SourceMode 2) (t : ℝ) :
+ iteratedDeriv 2 (modeF L m) t =
+ derivativeCoefficient 2 L 2 ![t,0] ![directionX,directionX] m := by
+ change iteratedDeriv 2 (fun s => modeCoefficient 2 L m ![s,0]) t = _
+ have h := axis_iteratedDeriv _ (mode_smooth L m) 2 t
+ have hd : (fun _ : Fin 2 => directionX) = ![directionX,directionX] := by
+ ext i; fin_cases i <;> rfl
+ simpa only [derivativeCoefficient, hd] using h
+
+theorem modeF_third (L : ℝ) (m : SourceMode 2) (t : ℝ) :
+ iteratedDeriv 3 (modeF L m) t =
+ derivativeCoefficient 2 L 3 ![t,0] ![directionX,directionX,directionX] m := by
+ change iteratedDeriv 3 (fun s => modeCoefficient 2 L m ![s,0]) t = _
+ have h := axis_iteratedDeriv _ (mode_smooth L m) 3 t
+ have hd : (fun _ : Fin 3 => directionX) = ![directionX,directionX,directionX] := by
+ ext i; fin_cases i <;> rfl
+ simpa only [derivativeCoefficient, hd] using h
+
+theorem modeH_deriv (L : ℝ) (m : SourceMode 2) (t : ℝ) :
+ deriv (modeH L m) t = derivativeCoefficient 2 L 2 ![t,0] ![directionX,directionY] m := by
+ rw [modeH_eq]
+ have h := axis_transverse_iteratedDeriv _ (mode_smooth L m) 1 t
+ have hd : Fin.snoc (fun _ : Fin 1 => directionX) directionY =
+ ![directionX,directionY] := by ext i; fin_cases i <;> rfl
+ simpa only [iteratedDeriv_one, derivativeCoefficient, hd] using h
+
+theorem modeH_second (L : ℝ) (m : SourceMode 2) (t : ℝ) :
+ iteratedDeriv 2 (modeH L m) t =
+ derivativeCoefficient 2 L 3 ![t,0] ![directionX,directionX,directionY] m := by
+ rw [modeH_eq]
+ have h := axis_transverse_iteratedDeriv _ (mode_smooth L m) 2 t
+ have hd : Fin.snoc (fun _ : Fin 2 => directionX) directionY =
+ ![directionX,directionX,directionY] := by ext i; fin_cases i <;> rfl
+ simpa only [derivativeCoefficient, hd] using h
+
+end I4ModeCurveChains
+
+namespace I4SourceConfluentLimits
+
+open I4ModeCurveChains
+
+def modeYY (L : ℝ) (m : SourceMode 2) (t : ℝ) : ℝ :=
+ derivativeCoefficient 2 L 2 ![t,0] ![directionY,directionY] m
+
+def modeRawValues (L r : ℝ) (m : SourceMode 2) : Fin 12 → ℝ :=
+ ![modeF L m (-r/2), modeF L m (r/2),
+ deriv (modeF L m) (-r/2), deriv (modeF L m) (r/2),
+ modeH L m (-r/2), modeH L m (r/2),
+ iteratedDeriv 2 (modeF L m) (-r/2), deriv (modeH L m) (-r/2), modeYY L m (-r/2),
+ iteratedDeriv 2 (modeF L m) (r/2), deriv (modeH L m) (r/2), modeYY L m (r/2)]
+
+private theorem rawDirections2 : rawDerivativeDirections 2 = ![directionX] := by
+ funext a
+ fin_cases a
+ rfl
+
+private theorem rawDirections3 : rawDerivativeDirections 3 = ![directionX] := by
+ funext a
+ fin_cases a
+ rfl
+
+private theorem rawDirections4 : rawDerivativeDirections 4 = ![directionY] := by
+ funext a
+ fin_cases a
+ rfl
+
+private theorem rawDirections5 : rawDerivativeDirections 5 = ![directionY] := by
+ funext a
+ fin_cases a
+ rfl
+
+private theorem rawDirections6 : rawDerivativeDirections 6 = ![directionX,directionX] := by
+ funext a
+ fin_cases a <;> rfl
+
+private theorem rawDirections7 : rawDerivativeDirections 7 = ![directionX,directionY] := by
+ funext a
+ fin_cases a <;> rfl
+
+private theorem rawDirections8 : rawDerivativeDirections 8 = ![directionY,directionY] := by
+ funext a
+ fin_cases a <;> rfl
+
+private theorem rawDirections9 : rawDerivativeDirections 9 = ![directionX,directionX] := by
+ funext a
+ fin_cases a <;> rfl
+
+private theorem rawDirections10 : rawDerivativeDirections 10 = ![directionX,directionY] := by
+ funext a
+ fin_cases a <;> rfl
+
+private theorem rawDirections11 : rawDerivativeDirections 11 = ![directionY,directionY] := by
+ funext a
+ fin_cases a <;> rfl
+
+theorem rawDerivativeCoefficient_explicit (L r : ℝ) (m : SourceMode 2) :
+ (fun i => rawDerivativeCoefficient L r i m) = modeRawValues L r m := by
+ funext i
+ fin_cases i
+ all_goals try rfl
+ all_goals first
+ | change rawDerivativeCoefficient L r 2 m = modeRawValues L r m 2
+ | change rawDerivativeCoefficient L r 3 m = modeRawValues L r m 3
+ | change rawDerivativeCoefficient L r 4 m = modeRawValues L r m 4
+ | change rawDerivativeCoefficient L r 5 m = modeRawValues L r m 5
+ | change rawDerivativeCoefficient L r 6 m = modeRawValues L r m 6
+ | change rawDerivativeCoefficient L r 7 m = modeRawValues L r m 7
+ | change rawDerivativeCoefficient L r 8 m = modeRawValues L r m 8
+ | change rawDerivativeCoefficient L r 9 m = modeRawValues L r m 9
+ | change rawDerivativeCoefficient L r 10 m = modeRawValues L r m 10
+ | change rawDerivativeCoefficient L r 11 m = modeRawValues L r m 11
+ all_goals unfold rawDerivativeCoefficient
+ all_goals first
+ | rw [rawDirections2]
+ | rw [rawDirections3]
+ | rw [rawDirections4]
+ | rw [rawDirections5]
+ | rw [rawDirections6]
+ | rw [rawDirections7]
+ | rw [rawDirections8]
+ | rw [rawDirections9]
+ | rw [rawDirections10]
+ | rw [rawDirections11]
+ all_goals dsimp only [rawDerivativeOrder, rawDerivativePoint, modeRawValues]
+ all_goals try simp only [modeF_deriv, modeF_second, modeH_deriv]
+ all_goals rfl
+
+def modePinValues (L r : ℝ) (m : SourceMode 2) : Fin 6 → ℝ :=
+ ![(modeF L m (-r/2) + modeF L m (r/2))/2,
+ (deriv (modeF L m) (-r/2) + deriv (modeF L m) (r/2))/2,
+ (modeH L m (-r/2) + modeH L m (r/2))/2,
+ pin3 (modeF L m) r, pin4 (modeH L m) r, pin5 (modeF L m) r]
+
+theorem pinCoefficient_explicit (L r : ℝ) (m : SourceMode 2) :
+ (fun i => pinCoefficient L r i m) = modePinValues L r m := by
+ unfold pinCoefficient
+ rw [rawDerivativeCoefficient_explicit]
+ funext i
+ fin_cases i <;>
+ simp [pinObservationMap, endpointObservationMap, confluentTransform, modeRawValues,
+ modePinValues, pin3, pin4, pin5, add_comm]
+
+def modeAdjustedValues (L r : ℝ) (m : SourceMode 2) : Fin 6 → ℝ :=
+ ![(iteratedDeriv 2 (modeF L m) (-r/2) - pin3 (modeF L m) r)/r,
+ (iteratedDeriv 2 (modeF L m) (r/2) - pin3 (modeF L m) r)/r,
+ (deriv (modeH L m) (-r/2) - pin4 (modeH L m) r)/r,
+ (deriv (modeH L m) (r/2) - pin4 (modeH L m) r)/r,
+ modeYY L m (-r/2), modeYY L m (r/2)]
+
+theorem adjustedCoefficient_explicit (L r : ℝ) (m : SourceMode 2) :
+ (fun i => adjustedCoefficient L r i m) = modeAdjustedValues L r m := by
+ unfold adjustedCoefficient
+ rw [rawDerivativeCoefficient_explicit]
+ funext i
+ fin_cases i <;>
+ simp [adjustedObservationMap, endpointObservationMap, confluentTransform, modeRawValues,
+ modeAdjustedValues, pin3, pin4]
+
+end I4SourceConfluentLimits
+
+/- Weighted-integral support coauthored by OpenAI/Codex
+/root/dm2_landed_composition, supplied as compiled scratch
+WeightedModeIntegrals.lean; no scientific-review credit. -/
+
+
+open I4Source I4SourceDerivativeGaussian I4SourceDerivativeContinuity
+open MeasureTheory Set
+open scoped Interval
+
+namespace I4WeightedModeIntegrals
+
+def weightedDerivativeIntegral (L : ℝ) (k : ℕ) (u : Fin k → (Fin 2 → ℝ))
+ (m : SourceMode 2) (w : ℝ → ℝ) (r : ℝ) : ℝ :=
+ ∫ t in (-1/2 : ℝ)..(1/2 : ℝ), w t * derivativeCoefficient 2 L k ![r*t,0] u m
+
+theorem weighted_integrand_bound {L : ℝ} (hL : L ≠ 0) (k : ℕ)
+ (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ)
+ (K : ℝ) (hK : 0 ≤ K)
+ (hwbound : ∀ t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ), |w t| ≤ K)
+ (r t : ℝ) (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) :
+ ‖w t * derivativeCoefficient 2 L k ![r*t,0] u m‖ ≤
+ K * derivativeMajorant 2 L k u m := by
+ rw [norm_mul, Real.norm_eq_abs]
+ exact mul_le_mul (hwbound t ht) (derivativeCoefficient_bound 2 hL k u m ![r*t,0])
+ (norm_nonneg _) hK
+
+theorem weightedDerivativeIntegral_continuous {L : ℝ} (hL : L ≠ 0) (k : ℕ)
+ (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ) (hw : Continuous w)
+ (K : ℝ) (hK : 0 ≤ K)
+ (hwbound : ∀ t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ), |w t| ≤ K) :
+ Continuous (weightedDerivativeIntegral L k u m w) := by
+ unfold weightedDerivativeIntegral
+ apply intervalIntegral.continuous_of_dominated_interval
+ (bound := fun _ => K * derivativeMajorant 2 L k u m)
+ · intro r
+ have hc : Continuous (fun t => w t * derivativeCoefficient 2 L k ![r*t,0] u m) :=
+ hw.mul ((derivativeCoefficient_continuous 2 L k u m).comp (by fun_prop))
+ exact hc.aestronglyMeasurable
+ · intro r
+ exact Filter.Eventually.of_forall (fun t ht =>
+ weighted_integrand_bound hL k u m w K hK hwbound r t ht)
+ · exact continuous_const.intervalIntegrable _ _
+ · exact Filter.Eventually.of_forall (fun t _ =>
+ continuous_const.mul ((derivativeCoefficient_continuous 2 L k u m).comp (by fun_prop)))
+
+theorem weightedDerivativeIntegral_norm_le {L : ℝ} (hL : L ≠ 0) (k : ℕ)
+ (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ)
+ (K : ℝ) (hK : 0 ≤ K)
+ (hwbound : ∀ t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ), |w t| ≤ K) (r : ℝ) :
+ ‖weightedDerivativeIntegral L k u m w r‖ ≤ K * derivativeMajorant 2 L k u m := by
+ have h := intervalIntegral.norm_integral_le_of_norm_le_const
+ (fun t ht => weighted_integrand_bound hL k u m w K hK hwbound r t ht)
+ norm_num at h
+ simpa only [weightedDerivativeIntegral, Real.norm_eq_abs, neg_div] using h
+
+theorem weightedDerivativeIntegral_zero (L : ℝ) (k : ℕ)
+ (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ) :
+ weightedDerivativeIntegral L k u m w 0 =
+ (∫ t in (-1/2 : ℝ)..(1/2 : ℝ), w t) * derivativeCoefficient 2 L k 0 u m := by
+ unfold weightedDerivativeIntegral
+ have hzero : (![0,0] : Fin 2 → ℝ) = 0 := by ext i; fin_cases i <;> rfl
+ simp_rw [zero_mul, hzero]
+ exact intervalIntegral.integral_mul_const _ _
+
+end I4WeightedModeIntegrals
+
+namespace I4SourceConfluentLimits
+
+open I4ModeCurveChains I4WeightedModeIntegrals
+
+def peanoLeft (t : ℝ) : ℝ := 1/2-t
+def peanoRight (t : ℝ) : ℝ := t+1/2
+def peanoCubic (t : ℝ) : ℝ := 1/4-t^2
+
+private theorem peano_one_bound (t : ℝ)
+ (_ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |(1 : ℝ)| ≤ 1 := by norm_num
+
+private theorem peano_left_bound (t : ℝ)
+ (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoLeft t| ≤ 1 := by
+ rw [Set.uIoc_of_le (by norm_num)] at ht
+ unfold peanoLeft
+ exact abs_le.mpr ⟨by linarith [ht.2], by linarith [ht.1]⟩
+
+private theorem peano_right_bound (t : ℝ)
+ (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoRight t| ≤ 1 := by
+ rw [Set.uIoc_of_le (by norm_num)] at ht
+ unfold peanoRight
+ exact abs_le.mpr ⟨by linarith [ht.1], by linarith [ht.2]⟩
+
+private theorem peano_cubic_bound (t : ℝ)
+ (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoCubic t| ≤ 1 := by
+ rw [Set.uIoc_of_le (by norm_num)] at ht
+ have habs : |t| ≤ (1/2 : ℝ) := abs_le.mpr ⟨by linarith [ht.1], ht.2⟩
+ have hsq := (sq_le_sq₀ (abs_nonneg t) (by norm_num : (0 : ℝ) ≤ 1/2)).2 habs
+ rw [sq_abs] at hsq
+ unfold peanoCubic
+ exact abs_le.mpr ⟨by nlinarith, by nlinarith [sq_nonneg t]⟩
+
+theorem peano_kernel_masses :
+ (∫ _t in (-1/2 : ℝ)..(1/2 : ℝ), (1 : ℝ)) = 1 ∧
+ (∫ t in (-1/2 : ℝ)..(1/2 : ℝ), peanoLeft t) = 1/2 ∧
+ (∫ t in (-1/2 : ℝ)..(1/2 : ℝ), peanoRight t) = 1/2 ∧
+ 6 * (∫ t in (-1/2 : ℝ)..(1/2 : ℝ), peanoCubic t) = 1 := by
+ have hi : IntervalIntegrable (fun t : ℝ => t) volume (-1/2 : ℝ) (1/2 : ℝ) :=
+ continuous_id.intervalIntegrable _ _
+ have hp : IntervalIntegrable (fun t : ℝ => t^2) volume (-1/2 : ℝ) (1/2 : ℝ) :=
+ (continuous_id.pow 2).intervalIntegrable _ _
+ refine ⟨by norm_num, ?_, ?_, ?_⟩
+ · unfold peanoLeft
+ rw [intervalIntegral.integral_sub (continuous_const.intervalIntegrable _ _) hi]
+ norm_num [integral_id]
+ · unfold peanoRight
+ rw [intervalIntegral.integral_add hi (continuous_const.intervalIntegrable _ _)]
+ norm_num [integral_id]
+ · unfold peanoCubic
+ rw [intervalIntegral.integral_sub (continuous_const.intervalIntegrable _ _) hp]
+ norm_num [integral_pow]
+
+/-- The Peano formulas define a genuine continuous extension of each pin mode,
+while preserving the singular raw formulas at every nonzero radius. -/
+def regularizedPinCoefficient (L r : ℝ) (i : Fin 6) (m : SourceMode 2) : ℝ :=
+ ![(modeF L m (-r/2) + modeF L m (r/2))/2,
+ (deriv (modeF L m) (-r/2) + deriv (modeF L m) (r/2))/2,
+ (modeH L m (-r/2) + modeH L m (r/2))/2,
+ weightedDerivativeIntegral L 2 ![directionX,directionX] m (fun _ => 1) r,
+ weightedDerivativeIntegral L 2 ![directionX,directionY] m (fun _ => 1) r,
+ 6 * weightedDerivativeIntegral L 3 ![directionX,directionX,directionX] m peanoCubic r] i
+
+def regularizedAdjustedCoefficient (L r : ℝ) (i : Fin 6) (m : SourceMode 2) : ℝ :=
+ ![-weightedDerivativeIntegral L 3 ![directionX,directionX,directionX] m peanoLeft r,
+ weightedDerivativeIntegral L 3 ![directionX,directionX,directionX] m peanoRight r,
+ -weightedDerivativeIntegral L 3 ![directionX,directionX,directionY] m peanoLeft r,
+ weightedDerivativeIntegral L 3 ![directionX,directionX,directionY] m peanoRight r,
+ modeYY L m (-r/2), modeYY L m (r/2)] i
+
+theorem pinCoefficient_eq_regularized (L r : ℝ) (hr : r ≠ 0) (i : Fin 6)
+ (m : SourceMode 2) : pinCoefficient L r i m = regularizedPinCoefficient L r i m := by
+ rw [show pinCoefficient L r i m = modePinValues L r m i from
+ congrFun (pinCoefficient_explicit L r m) i]
+ fin_cases i
+ · rfl
+ · rfl
+ · rfl
+ · change pin3 (modeF L m) r = _
+ rw [pin3_integral _ (modeF_C3 L m) r hr]
+ simp_rw [modeF_second]
+ simp [regularizedPinCoefficient, weightedDerivativeIntegral]
+ · change pin4 (modeH L m) r = _
+ rw [pin4_integral _ (modeH_C2 L m) r hr]
+ simp_rw [modeH_deriv]
+ simp [regularizedPinCoefficient, weightedDerivativeIntegral]
+ · change pin5 (modeF L m) r = _
+ rw [pin5_integral _ (modeF_C3 L m) r hr]
+ simp_rw [modeF_third]
+ rfl
+
+theorem adjustedCoefficient_eq_regularized (L r : ℝ) (hr : r ≠ 0) (i : Fin 6)
+ (m : SourceMode 2) : adjustedCoefficient L r i m = regularizedAdjustedCoefficient L r i m := by
+ rw [show adjustedCoefficient L r i m = modeAdjustedValues L r m i from
+ congrFun (adjustedCoefficient_explicit L r m) i]
+ fin_cases i
+ · change (iteratedDeriv 2 (modeF L m) (-r/2) - pin3 (modeF L m) r)/r = _
+ rw [adjusted_second_left _ (modeF_C3 L m) r hr]
+ simp_rw [modeF_third]
+ rfl
+ · change (iteratedDeriv 2 (modeF L m) (r/2) - pin3 (modeF L m) r)/r = _
+ rw [adjusted_second_right _ (modeF_C3 L m) r hr]
+ simp_rw [modeF_third]
+ rfl
+ · change (deriv (modeH L m) (-r/2) - pin4 (modeH L m) r)/r = _
+ rw [adjusted_transverse_left _ (modeH_C2 L m) r hr]
+ simp_rw [modeH_second]
+ rfl
+ · change (deriv (modeH L m) (r/2) - pin4 (modeH L m) r)/r = _
+ rw [adjusted_transverse_right _ (modeH_C2 L m) r hr]
+ simp_rw [modeH_second]
+ rfl
+ · rfl
+ · rfl
+
+end I4SourceConfluentLimits
+
+/- Literal contact coefficient identification coauthored by OpenAI/Codex
+/root/normalizer_palm_research, supplied as compiled scratch
+ContactCoefficientLimits.lean; no independent-review credit. -/
+
+open I4Foundation I4Source I4SourceGaussian I4SmoothCarrier I4SourceDerivativeGaussian
+open I4SourceContact I4SourceConfluentPins MeasureTheory ProbabilityTheory
+open scoped BigOperators
+set_option autoImplicit false
+
+namespace I4ContactCoefficientLimits
+
+def contactPinCoefficient (L : ℝ) (i : Fin 6) (m : SourceMode 2) : ℝ :=
+ sourceContactCoefficient L i.castSucc m
+
+def contactAdjustedCoefficient (L : ℝ) (i : Fin 6) (m : SourceMode 2) : ℝ :=
+ ![-derivativeCoefficient 2 L 3 0 ![directionX,directionX,directionX] m / 2,
+ derivativeCoefficient 2 L 3 0 ![directionX,directionX,directionX] m / 2,
+ -derivativeCoefficient 2 L 3 0 ![directionX,directionX,directionY] m / 2,
+ derivativeCoefficient 2 L 3 0 ![directionX,directionX,directionY] m / 2,
+ derivativeCoefficient 2 L 2 0 ![directionY,directionY] m,
+ derivativeCoefficient 2 L 2 0 ![directionY,directionY] m] i
+
+theorem contactPinCoefficient_summable {L : ℝ} (hL : L ≠ 0) (i : Fin 6) :
+ Summable (contactPinCoefficient L i) :=
+ sourceContactCoefficient_summable hL i.castSucc
+
+theorem contactAdjustedCoefficient_summable {L : ℝ} (hL : L ≠ 0) (i : Fin 6) :
+ Summable (contactAdjustedCoefficient L i) := by
+ change Summable (fun m => contactAdjustedCoefficient L i m)
+ have hx := derivativeCoefficient_summable 2 hL 3 0 ![directionX,directionX,directionX]
+ have ha := derivativeCoefficient_summable 2 hL 3 0 ![directionX,directionX,directionY]
+ have hq := derivativeCoefficient_summable 2 hL 2 0 ![directionY,directionY]
+ fin_cases i
+ · simpa [contactAdjustedCoefficient, div_eq_mul_inv, mul_comm] using
+ hx.neg.mul_left ((2 : ℝ)⁻¹)
+ · simpa [contactAdjustedCoefficient, div_eq_mul_inv, mul_comm] using
+ hx.mul_left ((2 : ℝ)⁻¹)
+ · simpa [contactAdjustedCoefficient, div_eq_mul_inv, mul_comm] using
+ ha.neg.mul_left ((2 : ℝ)⁻¹)
+ · simpa [contactAdjustedCoefficient, div_eq_mul_inv, mul_comm] using
+ ha.mul_left ((2 : ℝ)⁻¹)
+ · exact hq
+ · exact hq
+
+theorem sourcePinVector_eq_contactSeries {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample 2 L) (i : Fin 6) :
+ sourcePinVector L ω i =
+ scalarSeries (contactPinCoefficient L i) (sampleInclusion 2 L ω) :=
+ smoothSourceField_derivative_series 2 hL ω (contactOrder i.castSucc) 0
+ (contactDirections i.castSucc)
+
+private theorem scalarSeries_div {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ) (c : ℝ) :
+ scalarSeries (fun m => a m / c) ω = scalarSeries a ω / c := by
+ simp [scalarSeries, div_mul_eq_mul_div, tsum_div_const]
+
+private theorem scalarSeries_neg {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ) :
+ scalarSeries (fun m => -a m) ω = -scalarSeries a ω := by
+ simp [scalarSeries, neg_mul, tsum_neg]
+
+theorem sourceContactEndpointVector_eq_contactSeries {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample 2 L) (i : Fin 6) :
+ sourceContactEndpointVector L ω i =
+ scalarSeries (contactAdjustedCoefficient L i) (sampleInclusion 2 L ω) := by
+ have hx := smoothSourceField_derivative_series 2 hL ω 3 0
+ ![directionX,directionX,directionX]
+ have ha := smoothSourceField_derivative_series 2 hL ω 3 0
+ ![directionX,directionX,directionY]
+ have hq := smoothSourceField_derivative_series 2 hL ω 2 0 ![directionY,directionY]
+ fin_cases i
+ · change -iteratedFDeriv ℝ 3 (smoothSourceField 2 L ω) 0
+ ![directionX,directionX,directionX] / 2 =
+ scalarSeries (fun m => -derivativeCoefficient 2 L 3 0
+ ![directionX,directionX,directionX] m / 2) (sampleInclusion 2 L ω)
+ rw [scalarSeries_div, scalarSeries_neg, hx]
+ · change iteratedFDeriv ℝ 3 (smoothSourceField 2 L ω) 0
+ ![directionX,directionX,directionX] / 2 =
+ scalarSeries (fun m => derivativeCoefficient 2 L 3 0
+ ![directionX,directionX,directionX] m / 2) (sampleInclusion 2 L ω)
+ rw [scalarSeries_div, hx]
+ · change -iteratedFDeriv ℝ 3 (smoothSourceField 2 L ω) 0
+ ![directionX,directionX,directionY] / 2 =
+ scalarSeries (fun m => -derivativeCoefficient 2 L 3 0
+ ![directionX,directionX,directionY] m / 2) (sampleInclusion 2 L ω)
+ rw [scalarSeries_div, scalarSeries_neg, ha]
+ · change iteratedFDeriv ℝ 3 (smoothSourceField 2 L ω) 0
+ ![directionX,directionX,directionY] / 2 =
+ scalarSeries (fun m => derivativeCoefficient 2 L 3 0
+ ![directionX,directionX,directionY] m / 2) (sampleInclusion 2 L ω)
+ rw [scalarSeries_div, ha]
+ · exact hq
+ · exact hq
+
+theorem sourcePinCovariance_eq_contactCoefficientGram {L : ℝ} (hL : L ≠ 0)
+ (i j : Fin 6) : sourcePinCovariance L i j =
+ ∑' m, contactPinCoefficient L i m * contactPinCoefficient L j m := by
+ change covariance (fun ω => sourcePinVector L ω i) (fun ω => sourcePinVector L ω j)
+ (smoothLaw 2 L) = _
+ simp_rw [sourcePinVector_eq_contactSeries hL]
+ rw [covariance_comp_inclusion 2 hL _ _ (scalarSeries_measurable _)
+ (scalarSeries_measurable _)]
+ exact I4SourceCovariance.scalarSeries_covariance _ _
+ (contactPinCoefficient_summable hL i) (contactPinCoefficient_summable hL j)
+
+theorem sourceContactEndpointCrossCovariance_eq_contactCoefficientGram {L : ℝ}
+ (hL : L ≠ 0) (i j : Fin 6) : sourceContactEndpointCrossCovariance L i j =
+ ∑' m, contactAdjustedCoefficient L i m * contactPinCoefficient L j m := by
+ unfold sourceContactEndpointCrossCovariance
+ simp_rw [sourceContactEndpointVector_eq_contactSeries hL, sourcePinVector_eq_contactSeries hL]
+ rw [covariance_comp_inclusion 2 hL _ _ (scalarSeries_measurable _)
+ (scalarSeries_measurable _)]
+ exact I4SourceCovariance.scalarSeries_covariance _ _
+ (contactAdjustedCoefficient_summable hL i) (contactPinCoefficient_summable hL j)
+
+theorem sourceContactEndpointCovariance_eq_contactCoefficientGram {L : ℝ}
+ (hL : L ≠ 0) (i j : Fin 6) : sourceContactEndpointCovariance L i j =
+ ∑' m, contactAdjustedCoefficient L i m * contactAdjustedCoefficient L j m := by
+ unfold sourceContactEndpointCovariance
+ simp_rw [sourceContactEndpointVector_eq_contactSeries hL]
+ rw [covariance_comp_inclusion 2 hL _ _ (scalarSeries_measurable _)
+ (scalarSeries_measurable _)]
+ exact I4SourceCovariance.scalarSeries_covariance _ _
+ (contactAdjustedCoefficient_summable hL i) (contactAdjustedCoefficient_summable hL j)
+
+end I4ContactCoefficientLimits
+
+namespace I4SourceConfluentLimits
+
+open I4ModeCurveChains I4WeightedModeIntegrals I4ContactCoefficientLimits
+
+def modeComponentMajorant (L : ℝ) (m : SourceMode 2) : Fin 8 → ℝ :=
+ ![derivativeMajorant 2 L 0 ![] m,
+ derivativeMajorant 2 L 1 ![directionX] m,
+ derivativeMajorant 2 L 1 ![directionY] m,
+ derivativeMajorant 2 L 2 ![directionX,directionX] m,
+ derivativeMajorant 2 L 2 ![directionX,directionY] m,
+ derivativeMajorant 2 L 3 ![directionX,directionX,directionX] m,
+ derivativeMajorant 2 L 3 ![directionX,directionX,directionY] m,
+ derivativeMajorant 2 L 2 ![directionY,directionY] m]
+
+def confluentModeMajorant (L : ℝ) (m : SourceMode 2) : ℝ :=
+ 6 * ∑ s, modeComponentMajorant L m s
+
+private theorem modeComponentMajorant_nonneg (L : ℝ) (m : SourceMode 2) (s : Fin 8) :
+ 0 ≤ modeComponentMajorant L m s := by
+ fin_cases s <;> dsimp [modeComponentMajorant]
+ all_goals exact derivativeMajorant_nonneg 2 L _ _ m
+
+theorem confluentModeMajorant_nonneg (L : ℝ) (m : SourceMode 2) :
+ 0 ≤ confluentModeMajorant L m :=
+ mul_nonneg (by norm_num) (Finset.sum_nonneg (fun s _ => modeComponentMajorant_nonneg L m s))
+
+theorem confluentModeMajorant_summable {L : ℝ} (hL : L ≠ 0) :
+ Summable (confluentModeMajorant L) := by
+ apply Summable.mul_left 6
+ apply summable_sum
+ intro s _
+ fin_cases s <;> dsimp [modeComponentMajorant]
+ all_goals exact derivativeMajorant_summable 2 hL _ _
+
+private theorem six_component_le_majorant (L : ℝ) (m : SourceMode 2) (s : Fin 8) :
+ 6 * modeComponentMajorant L m s ≤ confluentModeMajorant L m := by
+ apply mul_le_mul_of_nonneg_left _ (by norm_num)
+ exact Finset.single_le_sum (fun t _ => modeComponentMajorant_nonneg L m t) (Finset.mem_univ s)
+
+private theorem component_le_majorant (L : ℝ) (m : SourceMode 2) (s : Fin 8) :
+ modeComponentMajorant L m s ≤ confluentModeMajorant L m := by
+ have h := six_component_le_majorant L m s
+ have hn := modeComponentMajorant_nonneg L m s
+ linarith
+
+private theorem average_norm_le (a b M : ℝ) (ha : ‖a‖ ≤ M) (hb : ‖b‖ ≤ M) :
+ ‖(a+b)/2‖ ≤ M := by
+ have h := (norm_add_le a b).trans (add_le_add ha hb)
+ calc
+ _ = ‖a+b‖ / 2 := by rw [norm_div]; norm_num
+ _ ≤ (M+M)/2 := div_le_div_of_nonneg_right h (by norm_num)
+ _ = M := by ring
+
+private theorem integral_bound_one {L : ℝ} (hL : L ≠ 0) (k : ℕ)
+ (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ)
+ (hw : ∀ t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ), |w t| ≤ 1) (r : ℝ) :
+ ‖weightedDerivativeIntegral L k u m w r‖ ≤ derivativeMajorant 2 L k u m := by
+ have h := weightedDerivativeIntegral_norm_le hL k u m w 1 (by norm_num) hw r
+ simpa only [one_mul] using h
+
+private theorem modeF_norm_bound {L : ℝ} (hL : L ≠ 0) (m : SourceMode 2) (t : ℝ) :
+ ‖modeF L m t‖ ≤ derivativeMajorant 2 L 0 ![] m := by
+ simpa only [derivativeCoefficient, iteratedFDeriv_zero_apply, modeF] using
+ derivativeCoefficient_bound 2 hL 0 ![] m ![t,0]
+
+theorem regularizedPinCoefficient_bound {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (i : Fin 6) (m : SourceMode 2) :
+ ‖regularizedPinCoefficient L r i m‖ ≤ confluentModeMajorant L m := by
+ fin_cases i
+ · exact (average_norm_le _ _ _ (modeF_norm_bound hL m (-r/2))
+ (modeF_norm_bound hL m (r/2))).trans (component_le_majorant L m 0)
+ · change ‖(deriv (modeF L m) (-r/2) + deriv (modeF L m) (r/2))/2‖ ≤ _
+ simp_rw [modeF_deriv]
+ exact (average_norm_le _ _ _ (derivativeCoefficient_bound 2 hL 1 ![directionX] m _)
+ (derivativeCoefficient_bound 2 hL 1 ![directionX] m _)).trans (component_le_majorant L m 1)
+ · exact (average_norm_le _ _ _ (derivativeCoefficient_bound 2 hL 1 ![directionY] m _)
+ (derivativeCoefficient_bound 2 hL 1 ![directionY] m _)).trans (component_le_majorant L m 2)
+ · exact (integral_bound_one hL 2
+ ![directionX,directionX] m (fun _ => 1) peano_one_bound r).trans
+ (component_le_majorant L m 3)
+ · exact (integral_bound_one hL 2
+ ![directionX,directionY] m (fun _ => 1) peano_one_bound r).trans
+ (component_le_majorant L m 4)
+ · change ‖6 * weightedDerivativeIntegral L 3 ![directionX,directionX,directionX] m peanoCubic r‖ ≤ _
+ rw [norm_mul, show ‖(6 : ℝ)‖ = 6 from by norm_num]
+ have h := integral_bound_one hL 3 ![directionX,directionX,directionX] m
+ peanoCubic peano_cubic_bound r
+ calc
+ _ ≤ 6 * derivativeMajorant 2 L 3 ![directionX,directionX,directionX] m :=
+ mul_le_mul_of_nonneg_left h (by norm_num)
+ _ ≤ confluentModeMajorant L m := six_component_le_majorant L m 5
+
+theorem regularizedAdjustedCoefficient_bound {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (i : Fin 6) (m : SourceMode 2) :
+ ‖regularizedAdjustedCoefficient L r i m‖ ≤ confluentModeMajorant L m := by
+ fin_cases i
+ · change ‖-weightedDerivativeIntegral L 3 ![directionX,directionX,directionX] m peanoLeft r‖ ≤ _
+ rw [norm_neg]
+ exact (integral_bound_one hL 3
+ ![directionX,directionX,directionX] m peanoLeft peano_left_bound r).trans
+ (component_le_majorant L m 5)
+ · exact (integral_bound_one hL 3
+ ![directionX,directionX,directionX] m peanoRight peano_right_bound r).trans
+ (component_le_majorant L m 5)
+ · change ‖-weightedDerivativeIntegral L 3 ![directionX,directionX,directionY] m peanoLeft r‖ ≤ _
+ rw [norm_neg]
+ exact (integral_bound_one hL 3
+ ![directionX,directionX,directionY] m peanoLeft peano_left_bound r).trans
+ (component_le_majorant L m 6)
+ · exact (integral_bound_one hL 3
+ ![directionX,directionX,directionY] m peanoRight peano_right_bound r).trans
+ (component_le_majorant L m 6)
+ · exact (derivativeCoefficient_bound 2 hL 2 ![directionY,directionY] m _).trans
+ (component_le_majorant L m 7)
+ · exact (derivativeCoefficient_bound 2 hL 2 ![directionY,directionY] m _).trans
+ (component_le_majorant L m 7)
+
+end I4SourceConfluentLimits
+
+/- Coauthor support: OpenAI/Codex /root/dm2_landed_composition: regularized coefficient continuity.
+Copied from the supplied compiled scratch proof; no review credit. -/
+
+
+open I4Source I4SourceDerivativeGaussian I4SourceDerivativeContinuity
+open I4SourceConfluentPins I4ModeCurveChains I4WeightedModeIntegrals
+open MeasureTheory Set
+open scoped Interval
+
+namespace I4SourceConfluentLimits
+
+private theorem helper_left_bound (t : ℝ)
+ (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoLeft t| ≤ 1 := by
+ rw [Set.uIoc_of_le (by norm_num)] at ht
+ unfold peanoLeft
+ exact abs_le.mpr ⟨by linarith [ht.2], by linarith [ht.1]⟩
+
+private theorem helper_right_bound (t : ℝ)
+ (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoRight t| ≤ 1 := by
+ rw [Set.uIoc_of_le (by norm_num)] at ht
+ unfold peanoRight
+ exact abs_le.mpr ⟨by linarith [ht.1], by linarith [ht.2]⟩
+
+private theorem helper_cubic_bound (t : ℝ)
+ (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoCubic t| ≤ 1 := by
+ rw [Set.uIoc_of_le (by norm_num)] at ht
+ have habs : |t| ≤ (1/2 : ℝ) := abs_le.mpr ⟨by linarith [ht.1], ht.2⟩
+ have hsq := (sq_le_sq₀ (abs_nonneg t) (by norm_num : (0 : ℝ) ≤ 1/2)).2 habs
+ rw [sq_abs] at hsq
+ unfold peanoCubic
+ exact abs_le.mpr ⟨by nlinarith, by nlinarith [sq_nonneg t]⟩
+
+theorem regularizedPinCoefficient_continuous {L : ℝ} (hL : L ≠ 0)
+ (i : Fin 6) (m : SourceMode 2) :
+ Continuous (fun r => regularizedPinCoefficient L r i m) := by
+ have hF := (modeF_C3 L m).continuous
+ have hH := (modeH_C2 L m).continuous
+ have hF' : Continuous (deriv (modeF L m)) := by
+ simpa only [iteratedDeriv_one] using
+ (modeF_C3 L m).continuous_iteratedDeriv 1 (by norm_num)
+ have hpoly : Continuous peanoCubic := by unfold peanoCubic; fun_prop
+ fin_cases i
+ · change Continuous (fun r : ℝ => (modeF L m (-r/2) + modeF L m (r/2))/2)
+ exact ((hF.comp (by fun_prop)).add (hF.comp (by fun_prop))).div_const 2
+ · change Continuous (fun r : ℝ => (deriv (modeF L m) (-r/2) + deriv (modeF L m) (r/2))/2)
+ exact ((hF'.comp (by fun_prop)).add (hF'.comp (by fun_prop))).div_const 2
+ · change Continuous (fun r : ℝ => (modeH L m (-r/2) + modeH L m (r/2))/2)
+ exact ((hH.comp (by fun_prop)).add (hH.comp (by fun_prop))).div_const 2
+ · exact weightedDerivativeIntegral_continuous hL 2 ![directionX,directionX] m
+ (fun _ => 1) continuous_const 1 (by norm_num) (by intro t ht; norm_num)
+ · exact weightedDerivativeIntegral_continuous hL 2 ![directionX,directionY] m
+ (fun _ => 1) continuous_const 1 (by norm_num) (by intro t ht; norm_num)
+ · exact (weightedDerivativeIntegral_continuous hL 3 ![directionX,directionX,directionX] m
+ peanoCubic hpoly 1 (by norm_num) helper_cubic_bound).const_mul 6
+
+theorem regularizedAdjustedCoefficient_continuous {L : ℝ} (hL : L ≠ 0)
+ (i : Fin 6) (m : SourceMode 2) :
+ Continuous (fun r => regularizedAdjustedCoefficient L r i m) := by
+ have hleft : Continuous peanoLeft := by unfold peanoLeft; fun_prop
+ have hright : Continuous peanoRight := by unfold peanoRight; fun_prop
+ have hYY : Continuous (modeYY L m) :=
+ (derivativeCoefficient_continuous 2 L 2 ![directionY,directionY] m).comp (by fun_prop)
+ fin_cases i
+ · exact (weightedDerivativeIntegral_continuous hL 3 ![directionX,directionX,directionX] m
+ peanoLeft hleft 1 (by norm_num) helper_left_bound).neg
+ · exact weightedDerivativeIntegral_continuous hL 3 ![directionX,directionX,directionX] m
+ peanoRight hright 1 (by norm_num) helper_right_bound
+ · exact (weightedDerivativeIntegral_continuous hL 3 ![directionX,directionX,directionY] m
+ peanoLeft hleft 1 (by norm_num) helper_left_bound).neg
+ · exact weightedDerivativeIntegral_continuous hL 3 ![directionX,directionX,directionY] m
+ peanoRight hright 1 (by norm_num) helper_right_bound
+ · exact hYY.comp (by fun_prop)
+ · exact hYY.comp (by fun_prop)
+
+end I4SourceConfluentLimits
+
+/- Coauthor support: OpenAI/Codex /root/normalizer_palm_research: exact contact coefficient values.
+Copied from the supplied compiled scratch proof; no review credit. -/
+
+open I4Source I4SourceDerivativeGaussian I4SourceConfluentPins I4SourceContact
+open I4SourceConfluentLimits I4ModeCurveChains I4WeightedModeIntegrals I4ContactCoefficientLimits
+open MeasureTheory
+open scoped BigOperators Interval
+set_option autoImplicit false
+
+namespace I4SourceConfluentLimits
+
+theorem regularizedPinCoefficient_zero (L : ℝ) (i : Fin 6) (m : SourceMode 2) :
+ regularizedPinCoefficient L 0 i m = contactPinCoefficient L i m := by
+ have hpoint : (![0,0] : Fin 2 → ℝ) = 0 := by ext j; fin_cases j <;> rfl
+ have hm := peano_kernel_masses
+ fin_cases i
+ · change (modeF L m (-0/2) + modeF L m (0/2))/2 =
+ derivativeCoefficient 2 L 0 0 ![] m
+ simp [modeF, derivativeCoefficient, iteratedFDeriv_zero_apply, hpoint]
+ · change (deriv (modeF L m) (-0/2) + deriv (modeF L m) (0/2))/2 =
+ derivativeCoefficient 2 L 1 0 ![directionX] m
+ simp only [neg_zero, zero_div, modeF_deriv, hpoint]
+ ring
+ · change (modeH L m (-0/2) + modeH L m (0/2))/2 =
+ derivativeCoefficient 2 L 1 0 ![directionY] m
+ simp only [neg_zero, zero_div, modeH, hpoint]
+ ring
+ · change weightedDerivativeIntegral L 2 ![directionX,directionX] m (fun _ => 1) 0 =
+ derivativeCoefficient 2 L 2 0 ![directionX,directionX] m
+ rw [weightedDerivativeIntegral_zero, hm.1, one_mul]
+ · change weightedDerivativeIntegral L 2 ![directionX,directionY] m (fun _ => 1) 0 =
+ derivativeCoefficient 2 L 2 0 ![directionX,directionY] m
+ rw [weightedDerivativeIntegral_zero, hm.1, one_mul]
+ · change 6 * weightedDerivativeIntegral L 3 ![directionX,directionX,directionX]
+ m peanoCubic 0 = derivativeCoefficient 2 L 3 0 ![directionX,directionX,directionX] m
+ rw [weightedDerivativeIntegral_zero, ← mul_assoc, hm.2.2.2, one_mul]
+
+theorem regularizedAdjustedCoefficient_zero (L : ℝ) (i : Fin 6) (m : SourceMode 2) :
+ regularizedAdjustedCoefficient L 0 i m = contactAdjustedCoefficient L i m := by
+ have hpoint : (![0,0] : Fin 2 → ℝ) = 0 := by ext j; fin_cases j <;> rfl
+ have hm := peano_kernel_masses
+ fin_cases i
+ · change -weightedDerivativeIntegral L 3 ![directionX,directionX,directionX]
+ m peanoLeft 0 = -derivativeCoefficient 2 L 3 0 ![directionX,directionX,directionX] m / 2
+ rw [weightedDerivativeIntegral_zero, hm.2.1]
+ ring
+ · change weightedDerivativeIntegral L 3 ![directionX,directionX,directionX]
+ m peanoRight 0 = derivativeCoefficient 2 L 3 0 ![directionX,directionX,directionX] m / 2
+ rw [weightedDerivativeIntegral_zero, hm.2.2.1]
+ ring
+ · change -weightedDerivativeIntegral L 3 ![directionX,directionX,directionY]
+ m peanoLeft 0 = -derivativeCoefficient 2 L 3 0 ![directionX,directionX,directionY] m / 2
+ rw [weightedDerivativeIntegral_zero, hm.2.1]
+ ring
+ · change weightedDerivativeIntegral L 3 ![directionX,directionX,directionY]
+ m peanoRight 0 = derivativeCoefficient 2 L 3 0 ![directionX,directionX,directionY] m / 2
+ rw [weightedDerivativeIntegral_zero, hm.2.2.1]
+ ring
+ · change modeYY L m (-0/2) = derivativeCoefficient 2 L 2 0 ![directionY,directionY] m
+ simp only [neg_zero, zero_div, modeYY, hpoint]
+ · change modeYY L m (0/2) = derivativeCoefficient 2 L 2 0 ![directionY,directionY] m
+ simp only [zero_div, modeYY, hpoint]
+
+end I4SourceConfluentLimits
+
+namespace I4SourceConfluentLimits
+
+open I4ContactCoefficientLimits
+
+def regularizedPinCovariance (L r : ℝ) : Matrix (Fin 6) (Fin 6) ℝ :=
+ fun i j => ∑' m, regularizedPinCoefficient L r i m * regularizedPinCoefficient L r j m
+
+def regularizedCrossCovariance (L r : ℝ) : Matrix (Fin 6) (Fin 6) ℝ :=
+ fun i j => ∑' m, regularizedAdjustedCoefficient L r i m * regularizedPinCoefficient L r j m
+
+def regularizedEndpointCovariance (L r : ℝ) : Matrix (Fin 6) (Fin 6) ℝ :=
+ fun i j => ∑' m, regularizedAdjustedCoefficient L r i m * regularizedAdjustedCoefficient L r j m
+
+private theorem regularizedGram_continuous {L : ℝ} (hL : L ≠ 0)
+ (a b : ℝ → Fin 6 → SourceMode 2 → ℝ)
+ (ha : ∀ i m, Continuous (fun r => a r i m))
+ (hb : ∀ i m, Continuous (fun r => b r i m))
+ (hba : ∀ r i m, ‖a r i m‖ ≤ confluentModeMajorant L m)
+ (hbb : ∀ r i m, ‖b r i m‖ ≤ confluentModeMajorant L m) :
+ Continuous (fun r => (fun i j => ∑' m, a r i m * b r j m : Matrix (Fin 6) (Fin 6) ℝ)) := by
+ apply continuous_pi
+ intro i
+ apply continuous_pi
+ intro j
+ apply continuous_tsum
+ · intro m
+ exact (ha i m).mul (hb j m)
+ · exact I4ContactGram.coefficient_product_summable
+ (confluentModeMajorant_summable hL) (confluentModeMajorant_summable hL)
+ · intro m r
+ rw [norm_mul]
+ exact mul_le_mul (hba r i m) (hbb r j m) (norm_nonneg _)
+ (confluentModeMajorant_nonneg L m)
+
+theorem regularizedPinCovariance_continuous {L : ℝ} (hL : L ≠ 0) :
+ Continuous (regularizedPinCovariance L) :=
+ regularizedGram_continuous hL (regularizedPinCoefficient L) (regularizedPinCoefficient L)
+ (regularizedPinCoefficient_continuous hL) (regularizedPinCoefficient_continuous hL)
+ (regularizedPinCoefficient_bound hL) (regularizedPinCoefficient_bound hL)
+
+theorem regularizedCrossCovariance_continuous {L : ℝ} (hL : L ≠ 0) :
+ Continuous (regularizedCrossCovariance L) :=
+ regularizedGram_continuous hL (regularizedAdjustedCoefficient L) (regularizedPinCoefficient L)
+ (regularizedAdjustedCoefficient_continuous hL) (regularizedPinCoefficient_continuous hL)
+ (regularizedAdjustedCoefficient_bound hL) (regularizedPinCoefficient_bound hL)
+
+theorem regularizedEndpointCovariance_continuous {L : ℝ} (hL : L ≠ 0) :
+ Continuous (regularizedEndpointCovariance L) :=
+ regularizedGram_continuous hL (regularizedAdjustedCoefficient L) (regularizedAdjustedCoefficient L)
+ (regularizedAdjustedCoefficient_continuous hL) (regularizedAdjustedCoefficient_continuous hL)
+ (regularizedAdjustedCoefficient_bound hL) (regularizedAdjustedCoefficient_bound hL)
+
+theorem sourcePinCovarianceAt_eq_regularized {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :
+ sourcePinCovarianceAt L r = regularizedPinCovariance L r := by
+ ext i j
+ rw [sourcePinCovarianceAt_coefficient hL]
+ unfold regularizedPinCovariance
+ apply tsum_congr
+ intro m
+ rw [pinCoefficient_eq_regularized L r hr i m, pinCoefficient_eq_regularized L r hr j m]
+
+theorem sourceCrossCovarianceAt_eq_regularized {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :
+ sourceCrossCovarianceAt L r = regularizedCrossCovariance L r := by
+ ext i j
+ rw [sourceCrossCovarianceAt_coefficient hL]
+ unfold regularizedCrossCovariance
+ apply tsum_congr
+ intro m
+ rw [adjustedCoefficient_eq_regularized L r hr i m, pinCoefficient_eq_regularized L r hr j m]
+
+theorem sourceEndpointCovarianceAt_eq_regularized {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :
+ sourceEndpointCovarianceAt L r = regularizedEndpointCovariance L r := by
+ ext i j
+ rw [sourceEndpointCovarianceAt_coefficient hL]
+ unfold regularizedEndpointCovariance
+ apply tsum_congr
+ intro m
+ rw [adjustedCoefficient_eq_regularized L r hr i m, adjustedCoefficient_eq_regularized L r hr j m]
+
+theorem regularizedPinCovariance_zero {L : ℝ} (hL : L ≠ 0) :
+ regularizedPinCovariance L 0 = sourcePinCovariance L := by
+ ext i j
+ rw [sourcePinCovariance_eq_contactCoefficientGram hL]
+ unfold regularizedPinCovariance
+ simp_rw [regularizedPinCoefficient_zero]
+
+theorem regularizedCrossCovariance_zero {L : ℝ} (hL : L ≠ 0) :
+ regularizedCrossCovariance L 0 = sourceContactEndpointCrossCovariance L := by
+ ext i j
+ rw [sourceContactEndpointCrossCovariance_eq_contactCoefficientGram hL]
+ unfold regularizedCrossCovariance
+ simp_rw [regularizedPinCoefficient_zero, regularizedAdjustedCoefficient_zero]
+
+theorem regularizedEndpointCovariance_zero {L : ℝ} (hL : L ≠ 0) :
+ regularizedEndpointCovariance L 0 = sourceContactEndpointCovariance L := by
+ ext i j
+ rw [sourceContactEndpointCovariance_eq_contactCoefficientGram hL]
+ unfold regularizedEndpointCovariance
+ simp_rw [regularizedAdjustedCoefficient_zero]
+
+/-- The actual confluent six-pin covariance converges to the literal contact
+pin covariance. Only the source period is assumed nonzero. -/
+theorem sourcePinCovarianceAt_tendsto {L : ℝ} (hL : L ≠ 0) :
+ Tendsto (sourcePinCovarianceAt L) (𝓝[>] (0 : ℝ)) (𝓝 (sourcePinCovariance L)) := by
+ have h := (regularizedPinCovariance_continuous hL).tendsto 0
+ rw [regularizedPinCovariance_zero hL] at h
+ apply (h.mono_left nhdsWithin_le_nhds).congr'
+ filter_upwards [self_mem_nhdsWithin] with r hr
+ exact (sourcePinCovarianceAt_eq_regularized hL r (ne_of_gt hr)).symm
+
+/-- The actual adjusted-endpoint/pin cross covariance has the stated literal
+contact limit, with the pin corrections retained before division. -/
+theorem sourceCrossCovarianceAt_tendsto {L : ℝ} (hL : L ≠ 0) :
+ Tendsto (sourceCrossCovarianceAt L) (𝓝[>] (0 : ℝ))
+ (𝓝 (sourceContactEndpointCrossCovariance L)) := by
+ have h := (regularizedCrossCovariance_continuous hL).tendsto 0
+ rw [regularizedCrossCovariance_zero hL] at h
+ apply (h.mono_left nhdsWithin_le_nhds).congr'
+ filter_upwards [self_mem_nhdsWithin] with r hr
+ exact (sourceCrossCovarianceAt_eq_regularized hL r (ne_of_gt hr)).symm
+
+/-- The actual pin-adjusted endpoint covariance converges to Cov(T,T), where
+T=(-fxxx/2,fxxx/2,-fxxy/2,fxxy/2,fyy,fyy) at the origin. -/
+theorem sourceEndpointCovarianceAt_tendsto {L : ℝ} (hL : L ≠ 0) :
+ Tendsto (sourceEndpointCovarianceAt L) (𝓝[>] (0 : ℝ))
+ (𝓝 (sourceContactEndpointCovariance L)) := by
+ have h := (regularizedEndpointCovariance_continuous hL).tendsto 0
+ rw [regularizedEndpointCovariance_zero hL] at h
+ apply (h.mono_left nhdsWithin_le_nhds).congr'
+ filter_upwards [self_mem_nhdsWithin] with r hr
+ exact (sourceEndpointCovarianceAt_eq_regularized hL r (ne_of_gt hr)).symm
+
+end I4SourceConfluentLimits
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConfluentPins.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConfluentPins.lean
new file mode 100644
index 000000000..6ee0be6db
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConfluentPins.lean
@@ -0,0 +1,152 @@
+import SourceDerivativeGaussian
+import Mathlib.Tactic.FieldSimp
+import Mathlib.Tactic.FinCases
+import Mathlib.Tactic.Ring
+
+/-!
+# Actual six endpoint pins and their confluent frame
+
+The raw order is `(fM,fS,fxM,fxS,fyM,fyS)`. This is the literal LM006
+endpoint-extension frame, including its arbitrary prescribed height.
+See SOURCE_CONFLUENT_PINS.md for the frozen preimplementation contract.
+-/
+
+noncomputable section
+
+open I4SmoothCarrier I4SourceDerivativeGaussian
+open MeasureTheory ProbabilityTheory
+open scoped Topology
+
+namespace I4SourceConfluentPins
+
+/-- Literal raw-to-confluent transform, defined also at zero for notation. -/
+def confluentTransform (r : ℝ) (v : Fin 6 → ℝ) : Fin 6 → ℝ :=
+ ![(v 0 + v 1) / 2, (v 2 + v 3) / 2, (v 4 + v 5) / 2,
+ (v 3 - v 2) / r, (v 5 - v 4) / r,
+ (12 / r ^ 2) * ((v 2 + v 3) / 2 - (v 1 - v 0) / r)]
+
+/-- The literal inverse, with the cubic correction to the two field values. -/
+def rawTransform (r : ℝ) (p : Fin 6 → ℝ) : Fin 6 → ℝ :=
+ ![p 0 - r * p 1 / 2 + r ^ 3 * p 5 / 24,
+ p 0 + r * p 1 / 2 - r ^ 3 * p 5 / 24,
+ p 1 - r * p 3 / 2, p 1 + r * p 3 / 2,
+ p 2 - r * p 4 / 2, p 2 + r * p 4 / 2]
+
+theorem rawTransform_confluentTransform (r : ℝ) (hr : r ≠ 0) (v : Fin 6 → ℝ) :
+ rawTransform r (confluentTransform r v) = v := by
+ ext i
+ fin_cases i <;> simp [rawTransform, confluentTransform]
+ all_goals field_simp [hr]
+ all_goals ring
+
+theorem confluentTransform_rawTransform (r : ℝ) (hr : r ≠ 0) (p : Fin 6 → ℝ) :
+ confluentTransform r (rawTransform r p) = p := by
+ ext i
+ fin_cases i <;> simp [rawTransform, confluentTransform]
+ all_goals field_simp [hr]
+ all_goals ring
+
+/-- For every nonzero separation, the confluent frame is an actual continuous
+linear equivalence. No covariance invertibility is assumed or asserted. -/
+def confluentEquiv (r : ℝ) (hr : r ≠ 0) : (Fin 6 → ℝ) ≃L[ℝ] (Fin 6 → ℝ) where
+ toFun := confluentTransform r
+ invFun := rawTransform r
+ left_inv := rawTransform_confluentTransform r hr
+ right_inv := confluentTransform_rawTransform r hr
+ map_add' v w := by
+ ext i
+ fin_cases i <;> simp [confluentTransform] <;> ring
+ map_smul' c v := by
+ ext i
+ fin_cases i <;> simp [confluentTransform] <;> ring
+ continuous_toFun := by unfold confluentTransform; fun_prop
+ continuous_invFun := by unfold rawTransform; fun_prop
+
+@[simp] theorem confluentEquiv_apply (r : ℝ) (hr : r ≠ 0) (v : Fin 6 → ℝ) :
+ confluentEquiv r hr v = confluentTransform r v := rfl
+
+@[simp] theorem confluentEquiv_symm_apply (r : ℝ) (hr : r ≠ 0) (p : Fin 6 → ℝ) :
+ (confluentEquiv r hr).symm p = rawTransform r p := rfl
+
+/-- The literal prescribed raw pins keep arbitrary height and have zero first
+confluent derivative. The normalized third confluent pin is exactly two. -/
+theorem prescribed_target (r b : ℝ) (hr : r ≠ 0) :
+ confluentEquiv r hr ![b, b - r ^ 3 / 6, 0, 0, 0, 0] =
+ ![b - r ^ 3 / 12, 0, 0, 0, 0, 2] := by
+ ext i
+ fin_cases i <;> simp [confluentTransform] <;> field_simp [hr] <;> ring
+
+def endpointM (r : ℝ) : Fin 2 → ℝ := ![-r / 2, 0]
+def endpointS (r : ℝ) : Fin 2 → ℝ := ![r / 2, 0]
+def directionX : Fin 2 → ℝ := ![1, 0]
+def directionY : Fin 2 → ℝ := ![0, 1]
+
+/-- Actual field values and actual directional x/y first derivatives of the
+unchanged smooth Fourier source, in the literal raw pin order. -/
+def rawPins (L r : ℝ) (ω : SmoothSample 2 L) : Fin 6 → ℝ :=
+ ![smoothSourceField 2 L ω (endpointM r),
+ smoothSourceField 2 L ω (endpointS r),
+ fderiv ℝ (smoothSourceField 2 L ω) (endpointM r) directionX,
+ fderiv ℝ (smoothSourceField 2 L ω) (endpointS r) directionX,
+ fderiv ℝ (smoothSourceField 2 L ω) (endpointM r) directionY,
+ fderiv ℝ (smoothSourceField 2 L ω) (endpointS r) directionY]
+
+/-- Joint Gaussianity is derived from one heterogeneous vector of actual
+order-zero and order-one observations; no observation independence is used. -/
+theorem rawPins_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ HasGaussianLaw (rawPins L r) (smoothLaw 2 L) := by
+ let k : Fin 6 → ℕ := ![0, 0, 1, 1, 1, 1]
+ let x : Fin 6 → (Fin 2 → ℝ) :=
+ ![endpointM r, endpointS r, endpointM r, endpointS r, endpointM r, endpointS r]
+ let u : ∀ j : Fin 6, Fin (k j) → (Fin 2 → ℝ) :=
+ fun j _ => if j.val < 4 then directionX else directionY
+ have hG := smoothSourceField_derivativeVector_hasGaussianLaw 2 hL 6 k x u
+ apply hG.congr
+ filter_upwards with ω
+ ext i
+ fin_cases i <;> dsimp [rawPins, k, x, u]
+ all_goals first | rfl | exact iteratedFDeriv_one_apply _
+
+/-- Actual confluent observations are the proved linear image of raw pins. -/
+def confluentPins (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) : Fin 6 → ℝ :=
+ confluentEquiv r hr (rawPins L r ω)
+
+theorem confluentPins_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :
+ HasGaussianLaw (confluentPins L r hr) (smoothLaw 2 L) :=
+ (rawPins_hasGaussianLaw hL r).map_equiv_fun (confluentEquiv r hr)
+
+/-- One literal vector containing the raw six pins followed by endpoint Hessian
+entries `(fxxM,fxyM,fyyM,fxxS,fxyS,fyyS)`. No r-dependent midpoint jet is used. -/
+def rawPinsWithHessians (L r : ℝ) (ω : SmoothSample 2 L) : Fin 12 → ℝ :=
+ ![rawPins L r ω 0, rawPins L r ω 1, rawPins L r ω 2,
+ rawPins L r ω 3, rawPins L r ω 4, rawPins L r ω 5,
+ iteratedFDeriv ℝ 2 (smoothSourceField 2 L ω) (endpointM r) ![directionX, directionX],
+ iteratedFDeriv ℝ 2 (smoothSourceField 2 L ω) (endpointM r) ![directionX, directionY],
+ iteratedFDeriv ℝ 2 (smoothSourceField 2 L ω) (endpointM r) ![directionY, directionY],
+ iteratedFDeriv ℝ 2 (smoothSourceField 2 L ω) (endpointS r) ![directionX, directionX],
+ iteratedFDeriv ℝ 2 (smoothSourceField 2 L ω) (endpointS r) ![directionX, directionY],
+ iteratedFDeriv ℝ 2 (smoothSourceField 2 L ω) (endpointS r) ![directionY, directionY]]
+
+/-- The pin and Hessian observations are jointly Gaussian, derived together
+from their single actual derivative vector rather than separate marginal laws. -/
+theorem rawPinsWithHessians_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ HasGaussianLaw (rawPinsWithHessians L r) (smoothLaw 2 L) := by
+ let k : Fin 12 → ℕ := ![0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2]
+ let x : Fin 12 → (Fin 2 → ℝ) :=
+ ![endpointM r, endpointS r, endpointM r, endpointS r, endpointM r, endpointS r,
+ endpointM r, endpointM r, endpointM r, endpointS r, endpointS r, endpointS r]
+ let u : ∀ j : Fin 12, Fin (k j) → (Fin 2 → ℝ) := fun j a =>
+ if j.val < 4 then directionX else if j.val < 6 then directionY
+ else if j.val % 3 = 0 then directionX
+ else if j.val % 3 = 1 ∧ a.val = 0 then directionX else directionY
+ have hG := smoothSourceField_derivativeVector_hasGaussianLaw 2 hL 12 k x u
+ apply hG.congr
+ filter_upwards with ω
+ ext i
+ fin_cases i <;> dsimp [rawPinsWithHessians, rawPins, k, x, u]
+ all_goals first
+ | rfl
+ | exact iteratedFDeriv_one_apply _
+ | congr 1; ext a; fin_cases a <;> rfl
+
+end I4SourceConfluentPins
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactCovariance.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactCovariance.lean
new file mode 100644
index 000000000..b64390842
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactCovariance.lean
@@ -0,0 +1,180 @@
+import SourceDerivativeGaussian
+import ContactJetCovariance
+import Mathlib.Tactic.FinCases
+import Mathlib.Tactic.NormNum
+import Mathlib.Tactic.Ring
+
+/-! The actual origin contact covariance of the literal Fourier source.
+Rows are (f,fx,fy,fxx,fxy,fxxx,fyy). Selected canonical Fourier modes are
+proved to give the seven-mode witness with their actual positive amplitudes. -/
+
+noncomputable section
+open I4Source I4Weights I4C4 I4SmoothCarrier I4SourceDerivativeGaussian I4ContactGram
+open MeasureTheory ProbabilityTheory Matrix
+open scoped BigOperators Matrix NNReal
+
+namespace I4SourceContact
+
+def contactOrder : Fin 7 → ℕ := ![0,1,1,2,2,3,2]
+
+def contactE0 : Fin 2 → ℝ := ![1,0]
+def contactE1 : Fin 2 → ℝ := ![0,1]
+
+def contactDirections : (i : Fin 7) → Fin (contactOrder i) → (Fin 2 → ℝ) :=
+ Fin.cases ![]
+ (Fin.cases ![contactE0]
+ (Fin.cases ![contactE1]
+ (Fin.cases ![contactE0,contactE0]
+ (Fin.cases ![contactE0,contactE1]
+ (Fin.cases ![contactE0,contactE0,contactE0]
+ (Fin.cases ![contactE1,contactE1] (fun i => Fin.elim0 i)))))))
+
+def sourceContactVector (L : ℝ) (ω : SmoothSample 2 L) (i : Fin 7) : ℝ :=
+ iteratedFDeriv ℝ (contactOrder i) (smoothSourceField 2 L ω) 0 (contactDirections i)
+
+def sourceContactCoefficient (L : ℝ) (i : Fin 7) (m : SourceMode 2) : ℝ :=
+ derivativeCoefficient 2 L (contactOrder i) 0 (contactDirections i) m
+
+def sourceContactCovariance (L : ℝ) : Matrix (Fin 7) (Fin 7) ℝ :=
+ fun i j => cov[fun ω => sourceContactVector L ω i,
+ fun ω => sourceContactVector L ω j; smoothLaw 2 L]
+
+theorem sourceContactVector_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) :
+ HasGaussianLaw (sourceContactVector L) (smoothLaw 2 L) :=
+ smoothSourceField_derivativeVector_hasGaussianLaw 2 hL 7 contactOrder (fun _ => 0)
+ contactDirections
+
+theorem sourceContactCoefficient_summable {L : ℝ} (hL : L ≠ 0) (i : Fin 7) :
+ Summable (sourceContactCoefficient L i) :=
+ derivativeCoefficient_summable 2 hL (contactOrder i) 0 (contactDirections i)
+
+theorem sourceContactCovariance_eq_coefficientGram {L : ℝ} (hL : L ≠ 0) :
+ sourceContactCovariance L = coefficientGram (sourceContactCoefficient L) := by
+ ext i j
+ exact smoothSourceField_derivative_covariance 2 hL (contactOrder i) (contactOrder j)
+ 0 0 (contactDirections i) (contactDirections j)
+
+private def frequency10 : ↥(halfLattice 2) := ⟨![1,0], by
+ refine ⟨0, by norm_num, ?_⟩
+ intro j hj
+ fin_cases j <;> norm_num at hj⟩
+
+private def frequency01 : ↥(halfLattice 2) := ⟨![0,1], by
+ refine ⟨1, by norm_num, ?_⟩
+ intro j hj
+ fin_cases j <;> norm_num at *⟩
+
+private def frequency11 : ↥(halfLattice 2) := ⟨![1,1], by
+ refine ⟨0, by norm_num, ?_⟩
+ intro j hj
+ fin_cases j <;> norm_num at hj⟩
+
+private def frequency20 : ↥(halfLattice 2) := ⟨![2,0], by
+ refine ⟨0, by norm_num, ?_⟩
+ intro j hj
+ fin_cases j <;> norm_num at hj⟩
+
+/-- DC, cos(1,0), cos(0,1), cos(1,1), sin(1,0), sin(2,0), sin(0,1).
+The frequency subtypes retain the canonical half-lattice membership proofs. -/
+def sourceContactMode : Fin 7 → SourceMode 2 :=
+ ![none, some (frequency10,false), some (frequency01,false), some (frequency11,false),
+ some (frequency10,true), some (frequency20,true), some (frequency01,true)]
+
+theorem sourceContactMode_nonzero_frequency (s : Fin 7) :
+ match sourceContactMode s with
+ | none => True
+ | some (k, _) => (k : Fin 2 → ℤ) ≠ 0 := by
+ cases sourceContactMode s with
+ | none => trivial
+ | some p => exact I4Lattice.halfLattice_ne_zero 2 p.1.property
+
+def sourceModeAmplitude (L : ℝ) (m : SourceMode 2) : ℝ := match m with
+ | none => Real.sqrt (1 / sourceZ 2 L)
+ | some (k, _) => Real.sqrt (2 * sourceWeight 2 L k / sourceZ 2 L)
+
+def sourceContactAmplitude (L : ℝ) (s : Fin 7) : ℝ :=
+ sourceModeAmplitude L (sourceContactMode s)
+
+theorem sourceContactAmplitude_pos {L : ℝ} (hL : L ≠ 0) (s : Fin 7) :
+ 0 < sourceContactAmplitude L s := by
+ unfold sourceContactAmplitude sourceModeAmplitude
+ cases sourceContactMode s with
+ | none => exact Real.sqrt_pos.mpr (one_div_pos.mpr (sourceZ_pos 2 hL))
+ | some p =>
+ apply Real.sqrt_pos.mpr
+ apply div_pos _ (sourceZ_pos 2 hL)
+ apply mul_pos (by norm_num)
+ rw [sourceWeight_eq_physical]
+ exact Real.exp_pos _
+
+private theorem derivativeCoefficient_none (L : ℝ) (k : ℕ)
+ (u : Fin k → (Fin 2 → ℝ)) :
+ derivativeCoefficient 2 L k 0 u none = if k = 0 then Real.sqrt (1 / sourceZ 2 L) else 0 := by
+ cases k with
+ | zero => simp [derivativeCoefficient, modeCoefficient, iteratedFDeriv_zero_apply]
+ | succ k =>
+ simp only [Nat.succ_ne_zero, ite_false]
+ change (iteratedFDeriv ℝ (k + 1)
+ (fun _ : Fin 2 → ℝ => Real.sqrt (1 / sourceZ 2 L)) 0) u = 0
+ rw [iteratedFDeriv_succ_const]
+ rfl
+
+private theorem derivativeCoefficient_some (L : ℝ) (k : ↥(halfLattice 2)) (b : Bool)
+ (n : ℕ) (u : Fin n → (Fin 2 → ℝ)) :
+ derivativeCoefficient 2 L n 0 u (some (k,b)) =
+ Real.sqrt (2 * sourceWeight 2 L k / sourceZ 2 L) *
+ ((∏ j, phaseCLM 2 L k (u j)) *
+ iteratedDeriv n (if b then Real.sin else Real.cos) 0) := by
+ let A := Real.sqrt (2 * sourceWeight 2 L k / sourceZ 2 L)
+ let g : ℝ → ℝ := if b then Real.sin else Real.cos
+ let ell := phaseCLM 2 L k
+ have hg : ContDiff ℝ n g := by
+ cases b <;> simp only [g, Bool.false_eq_true, ite_false, ite_true] <;> fun_prop
+ have hcomp : ContDiff ℝ n (g ∘ ell) := hg.comp_continuousLinearMap
+ have heq : modeCoefficient 2 L (some (k,b)) = A • (g ∘ ell) := by
+ funext x
+ cases b <;> simp [modeCoefficient, A, g, ell, phaseCLM_apply, Function.comp_apply]
+ unfold derivativeCoefficient
+ rw [heq, iteratedFDeriv_const_smul_apply hcomp.contDiffAt,
+ ell.iteratedFDeriv_comp_right hg 0 le_rfl]
+ simp only [_root_.smul_apply, ContinuousMultilinearMap.compContinuousLinearMap_apply,
+ map_zero, iteratedFDeriv_apply_eq_iteratedDeriv_mul_prod, smul_eq_mul]
+ rfl
+
+set_option maxHeartbeats 2000000 in
+/-- These are literal differentiated source columns, with the actual Fourier
+amplitudes, rather than assumed witness columns or a finite-mode replacement. -/
+theorem sourceContact_selected_columns (L : ℝ) (i s : Fin 7) :
+ sourceContactCoefficient L i (sourceContactMode s) =
+ sourceContactAmplitude L s * contactWitness (sourceC L) i s := by
+ fin_cases i
+ all_goals first
+ | change derivativeCoefficient 2 L 0 0 ![] (sourceContactMode s) = _
+ | change derivativeCoefficient 2 L 1 0 ![contactE0] (sourceContactMode s) = _
+ | change derivativeCoefficient 2 L 1 0 ![contactE1] (sourceContactMode s) = _
+ | change derivativeCoefficient 2 L 2 0 ![contactE0,contactE0] (sourceContactMode s) = _
+ | change derivativeCoefficient 2 L 2 0 ![contactE0,contactE1] (sourceContactMode s) = _
+ | change derivativeCoefficient 2 L 3 0 ![contactE0,contactE0,contactE0] (sourceContactMode s) = _
+ | change derivativeCoefficient 2 L 2 0 ![contactE1,contactE1] (sourceContactMode s) = _
+ all_goals fin_cases s <;>
+ norm_num [sourceContactCoefficient, sourceContactMode, sourceContactAmplitude,
+ sourceModeAmplitude, contactOrder, contactE0, contactE1,
+ derivativeCoefficient_none, derivativeCoefficient_some, contactWitness,
+ phaseCLM_apply, phase, frequency10, frequency01, frequency11, frequency20,
+ Fin.prod_univ_succ, Real.iteratedDeriv_add_one_sin, Real.iteratedDeriv_add_one_cos,
+ iteratedDeriv_zero] <;> ring_nf <;> simp
+
+/-- Positive definiteness of the actual contact covariance, obtained from its
+infinite coefficient Gram sum and seven proved canonical source columns. -/
+theorem sourceContactCovariance_posDef {L : ℝ} (hL : L ≠ 0) :
+ (sourceContactCovariance L).PosDef := by
+ rw [sourceContactCovariance_eq_coefficientGram hL]
+ apply contact_coefficientGram_posDef (sourceContactCoefficient L)
+ (sourceContactCoefficient_summable hL)
+ (show sourceC L ≠ 0 from div_ne_zero
+ (mul_ne_zero (by norm_num) (ne_of_gt Real.pi_pos)) hL)
+ sourceContactMode (sourceContactAmplitude L)
+ (fun s => (sourceContactAmplitude_pos hL s).ne')
+ exact sourceContact_selected_columns L
+
+end I4SourceContact
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactEndpointParameters.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactEndpointParameters.lean
new file mode 100644
index 000000000..ba4c8e5a3
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactEndpointParameters.lean
@@ -0,0 +1,325 @@
+import SourceContactSchur
+import Mathlib.Probability.Moments.CovarianceBilin
+
+/-!
+# Actual limiting adjusted-endpoint contact parameters
+
+The endpoint order is `(aM,aS,bM,bS,cM,cS)`. All covariance blocks below
+come from literal origin derivatives of the unchanged smooth Fourier source.
+The six pins are `(f,fx,fy,fxx,fxy,fxxx)` and their prescribed cubic value is
+`(b,0,0,0,0,2)`. See `SOURCE_CONTACT_ENDPOINT_PARAMETERS.md`.
+-/
+
+noncomputable section
+
+open I4SmoothCarrier I4SourceDerivativeGaussian
+open MeasureTheory ProbabilityTheory Matrix
+open scoped BigOperators Matrix RealInnerProductSpace
+
+set_option autoImplicit false
+
+namespace I4SourceContact
+
+/-- The literal mixed third derivative A=fxxy at the origin. -/
+def sourceContactA (L : ℝ) (ω : SmoothSample 2 L) : ℝ :=
+ iteratedFDeriv ℝ 3 (smoothSourceField 2 L ω) 0 ![contactE0,contactE0,contactE1]
+
+/-- The actual limiting adjusted endpoints, in the normalizer's six-coordinate order. -/
+def sourceContactEndpointVector (L : ℝ) (ω : SmoothSample 2 L) : Fin 6 → ℝ :=
+ ![-sourcePinVector L ω 5 / 2, sourcePinVector L ω 5 / 2,
+ -sourceContactA L ω / 2, sourceContactA L ω / 2,
+ sourceContactQ L ω, sourceContactQ L ω]
+
+/-- Literal limiting endpoint/pin cross covariance C0. -/
+def sourceContactEndpointCrossCovariance (L : ℝ) : Matrix (Fin 6) (Fin 6) ℝ :=
+ fun i j => covariance (fun ω => sourceContactEndpointVector L ω i)
+ (fun ω => sourcePinVector L ω j) (smoothLaw 2 L)
+
+/-- Literal limiting endpoint covariance B0. -/
+def sourceContactEndpointCovariance (L : ℝ) : Matrix (Fin 6) (Fin 6) ℝ :=
+ fun i j => covariance (fun ω => sourceContactEndpointVector L ω i)
+ (fun ω => sourceContactEndpointVector L ω j) (smoothLaw 2 L)
+
+def sourceContactEndpointRegression (L : ℝ) : Matrix (Fin 6) (Fin 6) ℝ :=
+ sourceContactEndpointCrossCovariance L * (sourcePinCovariance L)⁻¹
+
+/-- The prescribed limiting pin retains an arbitrary level b. -/
+def sourceContactPinValue (b : ℝ) : Fin 6 → ℝ := ![b,0,0,0,0,2]
+
+def sourceContactEndpointMean (L b : ℝ) : Fin 6 → ℝ :=
+ sourceContactEndpointRegression L *ᵥ sourceContactPinValue b
+
+def sourceContactEndpointSchur (L : ℝ) : Matrix (Fin 6) (Fin 6) ℝ :=
+ sourceContactEndpointCovariance L -
+ sourceContactEndpointCrossCovariance L * (sourcePinCovariance L)⁻¹ *
+ (sourceContactEndpointCrossCovariance L)ᵀ
+
+def sourceContactEndpointResidual (L : ℝ) (ω : SmoothSample 2 L) : Fin 6 → ℝ :=
+ sourceContactEndpointVector L ω -
+ sourceContactEndpointRegression L *ᵥ sourcePinVector L ω
+
+private theorem contact_generic_residual_covariance {Ω ι κ : Type*} [MeasurableSpace Ω]
+ [Fintype ι] [DecidableEq ι] [Fintype κ] [DecidableEq κ]
+ {P : Measure Ω} [IsFiniteMeasure P]
+ (J : Ω → ι → ℝ) (T : Ω → κ → ℝ)
+ (hJ : ∀ i, MemLp (fun ω => J ω i) 2 P)
+ (hT : ∀ i, MemLp (fun ω => T ω i) 2 P)
+ (hG : IsUnit (Matrix.of (fun i j => covariance (fun ω => J ω i) (fun ω => J ω j) P) : Matrix ι ι ℝ)) :
+ let G : Matrix ι ι ℝ := fun i j => covariance (fun ω => J ω i) (fun ω => J ω j) P
+ let C : Matrix κ ι ℝ := fun i j => covariance (fun ω => T ω i) (fun ω => J ω j) P
+ let B : Matrix κ κ ℝ := fun i j => covariance (fun ω => T ω i) (fun ω => T ω j) P
+ let D := C * G⁻¹
+ let R := fun ω => T ω - D *ᵥ J ω
+ (∀ i j, covariance (fun ω => R ω i) (fun ω => R ω j) P = (B - C * G⁻¹ * Cᵀ) i j) ∧
+ (B - C * G⁻¹ * Cᵀ).PosSemidef := by
+ classical
+ intro G C B D R
+ have hG' : IsUnit G := hG
+ let _ : Invertible G := hG'.invertible
+ let U := fun ω => D *ᵥ J ω
+ have hU (i : κ) : MemLp (fun ω => U ω i) 2 P :=
+ memLp_finsetSum Finset.univ (fun a _ => (hJ a).const_mul (D i a))
+ have hR (i : κ) : MemLp (fun ω => R ω i) 2 P := (hT i).sub (hU i)
+ have hnormal : D * G = C := by
+ dsimp [D]
+ rw [Matrix.mul_assoc, Matrix.inv_mul_of_invertible, Matrix.mul_one]
+ have hUJ (i : κ) (j : ι) : covariance (fun ω => U ω i) (fun ω => J ω j) P = C i j := by
+ change covariance (fun ω => ∑ a, D i a * J ω a) (fun ω => J ω j) P = C i j
+ rw [covariance_fun_sum_left (fun a => (hJ a).const_mul _) (hJ j)]
+ simp_rw [covariance_const_mul_left]
+ exact congrFun (congrFun hnormal i) j
+ have hJR (i : ι) (j : κ) : covariance (fun ω => J ω i) (fun ω => R ω j) P = 0 := by
+ change covariance (fun ω => J ω i) (fun ω => T ω j - U ω j) P = 0
+ rw [covariance_fun_sub_right (hJ i) (hT j) (hU j),
+ covariance_comm (fun ω => J ω i) (fun ω => U ω j), hUJ]
+ change covariance (fun ω => J ω i) (fun ω => T ω j) P -
+ covariance (fun ω => T ω j) (fun ω => J ω i) P = 0
+ rw [covariance_comm, sub_self]
+ have hUR (i j : κ) : covariance (fun ω => U ω i) (fun ω => R ω j) P = 0 := by
+ change covariance (fun ω => ∑ a, D i a * J ω a) (fun ω => R ω j) P = 0
+ rw [covariance_fun_sum_left (fun a => (hJ a).const_mul _) (hR j)]
+ simp_rw [covariance_const_mul_left, hJR, mul_zero]
+ exact Finset.sum_const_zero
+ have hUT (i j : κ) : covariance (fun ω => U ω i) (fun ω => T ω j) P = (D * Cᵀ) i j := by
+ change covariance (fun ω => ∑ a, D i a * J ω a) (fun ω => T ω j) P = _
+ rw [covariance_fun_sum_left (fun a => (hJ a).const_mul _) (hT j)]
+ simp_rw [covariance_const_mul_left]
+ simp only [Matrix.mul_apply, C]
+ apply Finset.sum_congr rfl
+ intro a _
+ rw [covariance_comm (fun ω => J ω a)]
+ rfl
+ have hcov (i j : κ) : covariance (fun ω => R ω i) (fun ω => R ω j) P = (B - C * G⁻¹ * Cᵀ) i j := by
+ change covariance (fun ω => R ω i) (fun ω => T ω j - U ω j) P = _
+ rw [covariance_fun_sub_right (hR i) (hT j) (hU j),
+ covariance_comm (fun ω => R ω i) (fun ω => U ω j), hUR, sub_zero]
+ change covariance (fun ω => T ω i - U ω i) (fun ω => T ω j) P = _
+ rw [covariance_fun_sub_left (hT i) (hU i) (hT j), hUT]
+ rfl
+ refine ⟨hcov, ?_⟩
+ apply Matrix.PosSemidef.of_dotProduct_mulVec_nonneg
+ · ext i j
+ simp only [Matrix.conjTranspose_apply, star_trivial]
+ rw [← hcov i j, ← hcov j i]
+ exact covariance_comm _ _
+ · intro x
+ have hp := covarianceBilin_self_nonneg (μ := P.map (fun ω => WithLp.toLp 2 (R ω))) (WithLp.toLp 2 x)
+ rw [covarianceBilin_apply_pi hR] at hp
+ simpa [hcov, dotProduct, Matrix.mulVec, Finset.mul_sum, mul_assoc, mul_left_comm, mul_comm] using hp
+
+private theorem sourceContactA_memLp {L : ℝ} (hL : L ≠ 0) :
+ MemLp (sourceContactA L) 2 (smoothLaw 2 L) := by
+ exact ((smoothSourceField_derivativeVector_hasGaussianLaw 2 hL 1 (fun _ => 3)
+ (fun _ => 0) (fun _ => ![contactE0,contactE0,contactE1])).eval 0).memLp_two
+
+private theorem sourcePin_memLp {L : ℝ} (hL : L ≠ 0) (i : Fin 6) :
+ MemLp (fun ω => sourcePinVector L ω i) 2 (smoothLaw 2 L) :=
+ ((sourceContactVector_hasGaussianLaw hL).eval i.castSucc).memLp_two
+
+private theorem sourceContactEndpoint_memLp {L : ℝ} (hL : L ≠ 0) (i : Fin 6) :
+ MemLp (fun ω => sourceContactEndpointVector L ω i) 2 (smoothLaw 2 L) := by
+ have hQ := ((sourceContactVector_hasGaussianLaw hL).eval 6).memLp_two
+ fin_cases i
+ · simpa [sourceContactEndpointVector, div_eq_mul_inv, mul_comm] using
+ ((sourcePin_memLp hL 5).neg).const_mul ((2 : ℝ)⁻¹)
+ · simpa [sourceContactEndpointVector, div_eq_mul_inv, mul_comm] using
+ (sourcePin_memLp hL 5).const_mul ((2 : ℝ)⁻¹)
+ · simpa [sourceContactEndpointVector, div_eq_mul_inv, mul_comm] using
+ (sourceContactA_memLp hL).neg.const_mul ((2 : ℝ)⁻¹)
+ · simpa [sourceContactEndpointVector, div_eq_mul_inv, mul_comm] using
+ (sourceContactA_memLp hL).const_mul ((2 : ℝ)⁻¹)
+ · exact hQ
+ · exact hQ
+
+private theorem cross_row_zero (L : ℝ) (j : Fin 6) :
+ sourceContactEndpointCrossCovariance L 0 j = -sourcePinCovariance L 5 j / 2 := by
+ change covariance (fun ω => -sourcePinVector L ω 5 / 2)
+ (fun ω => sourcePinVector L ω j) (smoothLaw 2 L) = _
+ rw [covariance_fun_div_left, covariance_fun_neg_left]
+ rfl
+
+private theorem cross_row_one (L : ℝ) (j : Fin 6) :
+ sourceContactEndpointCrossCovariance L 1 j = sourcePinCovariance L 5 j / 2 := by
+ change covariance (fun ω => sourcePinVector L ω 5 / 2)
+ (fun ω => sourcePinVector L ω j) (smoothLaw 2 L) = _
+ rw [covariance_fun_div_left]
+ rfl
+
+private theorem cross_row_two (L : ℝ) (j : Fin 6) :
+ sourceContactEndpointCrossCovariance L 2 j =
+ -sourceContactEndpointCrossCovariance L 3 j := by
+ change covariance (fun ω => -sourceContactA L ω / 2)
+ (fun ω => sourcePinVector L ω j) (smoothLaw 2 L) =
+ -covariance (fun ω => sourceContactA L ω / 2)
+ (fun ω => sourcePinVector L ω j) (smoothLaw 2 L)
+ rw [covariance_fun_div_left, covariance_fun_div_left, covariance_fun_neg_left]
+ ring
+
+private theorem cross_row_four (L : ℝ) (j : Fin 6) :
+ sourceContactEndpointCrossCovariance L 4 j =
+ sourceContactEndpointCrossCovariance L 5 j := rfl
+
+private theorem regression_pin_coordinates {L : ℝ} (hL : L ≠ 0) (x : Fin 6 → ℝ) :
+ (sourceContactEndpointRegression L *ᵥ x) 0 = -x 5 / 2 ∧
+ (sourceContactEndpointRegression L *ᵥ x) 1 = x 5 / 2 := by
+ let _ : Invertible (sourcePinCovariance L) := (sourcePinCovariance_isUnit hL).invertible
+ have hcancel : sourcePinCovariance L *ᵥ ((sourcePinCovariance L)⁻¹ *ᵥ x) = x := by
+ rw [Matrix.mulVec_mulVec, Matrix.mul_inv_of_invertible, Matrix.one_mulVec]
+ have hc := congrFun hcancel 5
+ rw [sourceContactEndpointRegression, ← Matrix.mulVec_mulVec]
+ change (∑ j, sourceContactEndpointCrossCovariance L 0 j *
+ ((sourcePinCovariance L)⁻¹ *ᵥ x) j) = -x 5 / 2 ∧
+ (∑ j, sourceContactEndpointCrossCovariance L 1 j *
+ ((sourcePinCovariance L)⁻¹ *ᵥ x) j) = x 5 / 2
+ simp_rw [cross_row_zero, cross_row_one]
+ change (∑ j, sourcePinCovariance L 5 j *
+ ((sourcePinCovariance L)⁻¹ *ᵥ x) j) = x 5 at hc
+ constructor
+ · calc
+ _ = (-1 / 2 : ℝ) * (∑ j, sourcePinCovariance L 5 j *
+ ((sourcePinCovariance L)⁻¹ *ᵥ x) j) := by
+ rw [Finset.mul_sum]
+ apply Finset.sum_congr rfl
+ intro j _
+ ring
+ _ = -x 5 / 2 := by rw [hc]; ring
+ · calc
+ _ = (1 / 2 : ℝ) * (∑ j, sourcePinCovariance L 5 j *
+ ((sourcePinCovariance L)⁻¹ *ᵥ x) j) := by
+ rw [Finset.mul_sum]
+ apply Finset.sum_congr rfl
+ intro j _
+ ring
+ _ = x 5 / 2 := by rw [hc]; ring
+
+private theorem regression_other_coordinates (L : ℝ) (x : Fin 6 → ℝ) :
+ (sourceContactEndpointRegression L *ᵥ x) 2 =
+ -(sourceContactEndpointRegression L *ᵥ x) 3 ∧
+ (sourceContactEndpointRegression L *ᵥ x) 4 =
+ (sourceContactEndpointRegression L *ᵥ x) 5 := by
+ rw [sourceContactEndpointRegression, ← Matrix.mulVec_mulVec]
+ constructor
+ · simp only [Matrix.mulVec, dotProduct, cross_row_two, neg_mul, Finset.sum_neg_distrib]
+ · simp only [Matrix.mulVec, dotProduct, cross_row_four]
+
+theorem sourceContactEndpointMean_contact {L : ℝ} (hL : L ≠ 0) (b : ℝ) :
+ sourceContactEndpointMean L b 0 = -1 ∧
+ sourceContactEndpointMean L b 1 = 1 ∧
+ sourceContactEndpointMean L b 2 + sourceContactEndpointMean L b 3 = 0 ∧
+ sourceContactEndpointMean L b 4 - sourceContactEndpointMean L b 5 = 0 := by
+ have hp := regression_pin_coordinates hL (sourceContactPinValue b)
+ have ho := regression_other_coordinates L (sourceContactPinValue b)
+ change _ ∧ _ ∧ _ ∧ _
+ dsimp only [sourceContactEndpointMean]
+ refine ⟨?_, ?_, ?_, ?_⟩
+ · simpa [sourceContactPinValue] using hp.1
+ · simpa [sourceContactPinValue] using hp.2
+ · rw [ho.1]; ring
+ · rw [ho.2]; ring
+
+private theorem sourceContactEndpointResidual_contact {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample 2 L) :
+ sourceContactEndpointResidual L ω 0 = 0 ∧
+ sourceContactEndpointResidual L ω 1 = 0 ∧
+ sourceContactEndpointResidual L ω 2 = -sourceContactEndpointResidual L ω 3 ∧
+ sourceContactEndpointResidual L ω 4 = sourceContactEndpointResidual L ω 5 := by
+ have hp := regression_pin_coordinates hL (sourcePinVector L ω)
+ have ho := regression_other_coordinates L (sourcePinVector L ω)
+ dsimp only [sourceContactEndpointResidual, Pi.sub_apply, sourceContactEndpointVector,
+ Matrix.cons_val_zero, Matrix.cons_val_one, Matrix.cons_val]
+ refine ⟨?_, ?_, ?_, ?_⟩
+ · rw [hp.1]; ring
+ · rw [hp.2]; ring
+ · rw [ho.1]; ring
+ · rw [ho.2]
+
+/-- The limiting Schur matrix is the actual least-squares endpoint residual covariance. -/
+theorem sourceContactEndpointSchur_covariance {L : ℝ} (hL : L ≠ 0) :
+ (∀ i j, covariance (fun ω => sourceContactEndpointResidual L ω i)
+ (fun ω => sourceContactEndpointResidual L ω j) (smoothLaw 2 L) =
+ sourceContactEndpointSchur L i j) ∧ (sourceContactEndpointSchur L).PosSemidef := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ have hG : IsUnit (Matrix.of (fun i j =>
+ covariance (fun ω => sourcePinVector L ω i) (fun ω => sourcePinVector L ω j)
+ (smoothLaw 2 L)) : Matrix (Fin 6) (Fin 6) ℝ) := by
+ convert sourcePinCovariance_isUnit hL using 1
+ ext i j
+ rfl
+ exact contact_generic_residual_covariance (sourcePinVector L) (sourceContactEndpointVector L)
+ (sourcePin_memLp hL) (sourceContactEndpoint_memLp hL) hG
+
+theorem sourceContactEndpointSchur_posSemidef {L : ℝ} (hL : L ≠ 0) :
+ (sourceContactEndpointSchur L).PosSemidef :=
+ (sourceContactEndpointSchur_covariance hL).2
+
+/-- The deterministic endpoint relations become exactly the four required zero variances. -/
+theorem sourceContactEndpointSchur_contact {L : ℝ} (hL : L ≠ 0) :
+ sourceContactEndpointSchur L 0 0 = 0 ∧
+ sourceContactEndpointSchur L 1 1 = 0 ∧
+ sourceContactEndpointSchur L 2 2 + 2 * sourceContactEndpointSchur L 2 3 +
+ sourceContactEndpointSchur L 3 3 = 0 ∧
+ sourceContactEndpointSchur L 4 4 - 2 * sourceContactEndpointSchur L 4 5 +
+ sourceContactEndpointSchur L 5 5 = 0 := by
+ have hc := (sourceContactEndpointSchur_covariance hL).1
+ have hzero : (fun ω => sourceContactEndpointResidual L ω 0) = 0 :=
+ funext fun ω => (sourceContactEndpointResidual_contact hL ω).1
+ have hone : (fun ω => sourceContactEndpointResidual L ω 1) = 0 :=
+ funext fun ω => (sourceContactEndpointResidual_contact hL ω).2.1
+ have htwo : (fun ω => sourceContactEndpointResidual L ω 2) =
+ -(fun ω => sourceContactEndpointResidual L ω 3) :=
+ funext fun ω => (sourceContactEndpointResidual_contact hL ω).2.2.1
+ have hfour : (fun ω => sourceContactEndpointResidual L ω 4) =
+ (fun ω => sourceContactEndpointResidual L ω 5) :=
+ funext fun ω => (sourceContactEndpointResidual_contact hL ω).2.2.2
+ refine ⟨?_, ?_, ?_, ?_⟩
+ · rw [← hc 0 0, hzero]; simp
+ · rw [← hc 1 1, hone]; simp
+ · rw [← hc 2 2, ← hc 2 3, ← hc 3 3, htwo]
+ simp only [covariance_neg_left, covariance_neg_right]
+ ring
+ · rw [← hc 4 4, ← hc 4 5, ← hc 5 5, hfour]
+ ring
+
+private theorem cross_row_Q (L : ℝ) (j : Fin 6) :
+ sourceContactEndpointCrossCovariance L 4 j = sourceContactCross L j := by
+ exact covariance_comm _ _
+
+/-- The reference entry is the already established actual torus curvature Schur variance. -/
+theorem sourceContactEndpointSchur_four_four_eq_schur (L : ℝ) :
+ sourceContactEndpointSchur L 4 4 = sourceContactSchur L := by
+ have heq : (sourceContactEndpointCrossCovariance L * (sourcePinCovariance L)⁻¹ *
+ (sourceContactEndpointCrossCovariance L)ᵀ) 4 4 =
+ sourceContactCross L ⬝ᵥ ((sourcePinCovariance L)⁻¹ *ᵥ sourceContactCross L) := by
+ simp only [Matrix.mul_apply, Matrix.transpose_apply, cross_row_Q, dotProduct, Matrix.mulVec]
+ simp_rw [Finset.sum_mul]
+ rw [Finset.sum_comm]
+ simp only [Finset.mul_sum, mul_assoc]
+ change sourceContactQVariance L - _ = sourceContactQVariance L - _
+ rw [heq]
+
+theorem sourceContactEndpointSchur_referenceVariance_pos {L : ℝ} (hL : L ≠ 0) :
+ 0 < sourceContactEndpointSchur L 4 4 := by
+ rw [sourceContactEndpointSchur_four_four_eq_schur]
+ exact sourceContactSchur_pos hL
+
+end I4SourceContact
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactSchur.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactSchur.lean
new file mode 100644
index 000000000..11019ab39
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactSchur.lean
@@ -0,0 +1,206 @@
+import SourceContactCovariance
+
+/-!
+# Literal six-pin covariance and positive reference Schur variance
+
+The six pin coordinates are `(f, fx, fy, fxx, fxy, fxxx)` and the remaining
+coordinate is `Q = fyy`, all taken from the literal origin contact vector.
+The block identity below uses an explicit equivalence of the seven coordinates.
+Positive definiteness, invertibility and strict Schur positivity follow from
+`L ≠ 0`; no covariance or positivity conclusion is an input hypothesis.
+
+These statements concern the torus source with its actual period. They do not
+identify its regression mean or variance with a planar reference constant.
+See `SOURCE_CONTACT_SCHUR.md` for the frozen scope.
+-/
+
+noncomputable section
+
+open I4SmoothCarrier I4ContactGram MeasureTheory ProbabilityTheory Matrix
+open scoped BigOperators Matrix
+
+set_option autoImplicit false
+
+namespace I4SourceContact
+
+/-- Literal six-pin observations in their source order. -/
+def sourcePinVector (L : ℝ) (ω : SmoothSample 2 L) (i : Fin 6) : ℝ :=
+ sourceContactVector L ω i.castSucc
+
+/-- Literal remaining curvature coordinate Q=fyy. -/
+def sourceContactQ (L : ℝ) (ω : SmoothSample 2 L) : ℝ :=
+ sourceContactVector L ω 6
+
+/-- Principal covariance of the literal six origin pin coordinates. -/
+def sourcePinCovariance (L : ℝ) : Matrix (Fin 6) (Fin 6) ℝ :=
+ (sourceContactCovariance L).submatrix Fin.castSucc Fin.castSucc
+
+/-- Covariance of each literal pin coordinate with the remaining curvature Q=fyy. -/
+def sourceContactCross (L : ℝ) (i : Fin 6) : ℝ :=
+ sourceContactCovariance L i.castSucc 6
+
+/-- Literal Q covariance with itself. -/
+def sourceContactQVariance (L : ℝ) : ℝ := sourceContactCovariance L 6 6
+
+def sourceContactCrossMatrix (L : ℝ) : Matrix (Fin 6) Unit ℝ :=
+ fun i _ => sourceContactCross L i
+
+def sourceContactQMatrix (L : ℝ) : Matrix Unit Unit ℝ :=
+ fun _ _ => sourceContactQVariance L
+
+/-- The scalar Schur complement of the actual six-pin covariance. -/
+def sourceContactSchur (L : ℝ) : ℝ :=
+ sourceContactQVariance L -
+ sourceContactCross L ⬝ᵥ ((sourcePinCovariance L)⁻¹ *ᵥ sourceContactCross L)
+
+/-- Exact 6+1 splitting of the source's seven origin coordinates. -/
+def sourceContactBlockEquiv : (Fin 6 ⊕ Unit) ≃ Fin 7 :=
+ (Equiv.sumCongr (Equiv.refl (Fin 6)) finOneEquiv.symm).trans finSumFinEquiv
+
+@[simp] lemma sourceContactBlockEquiv_inl (i : Fin 6) :
+ sourceContactBlockEquiv (Sum.inl i) = i.castSucc := rfl
+
+@[simp] lemma sourceContactBlockEquiv_inr (u : Unit) :
+ sourceContactBlockEquiv (Sum.inr u) = 6 := by
+ cases u
+ rfl
+
+/-- The literal covariance equals the stated six-pin/Q blocks under the exact coordinate split. -/
+theorem sourceContactCovariance_block_identity (L : ℝ) :
+ (sourceContactCovariance L).submatrix sourceContactBlockEquiv sourceContactBlockEquiv =
+ Matrix.fromBlocks (sourcePinCovariance L) (sourceContactCrossMatrix L)
+ (sourceContactCrossMatrix L)ᴴ (sourceContactQMatrix L) := by
+ ext i j
+ cases i with
+ | inl i =>
+ cases j with
+ | inl j => rfl
+ | inr u => cases u; rfl
+ | inr u =>
+ cases u
+ cases j with
+ | inl j =>
+ change covariance (fun ω => sourceContactVector L ω 6)
+ (fun ω => sourceContactVector L ω j.castSucc) (smoothLaw 2 L) =
+ covariance (fun ω => sourceContactVector L ω j.castSucc)
+ (fun ω => sourceContactVector L ω 6) (smoothLaw 2 L)
+ exact covariance_comm _ _
+ | inr v => cases v; rfl
+
+theorem sourcePinCovariance_posDef {L : ℝ} (hL : L ≠ 0) :
+ (sourcePinCovariance L).PosDef :=
+ (sourceContactCovariance_posDef hL).submatrix (Fin.castSucc_injective 6)
+
+theorem sourcePinCovariance_isUnit {L : ℝ} (hL : L ≠ 0) :
+ IsUnit (sourcePinCovariance L) :=
+ (sourcePinCovariance_posDef hL).isUnit
+
+/-- An actual inverse of the six-pin covariance, with no invertibility premise. -/
+@[instance_reducible] def sourcePinCovarianceInvertible {L : ℝ} (hL : L ≠ 0) :
+ Invertible (sourcePinCovariance L) :=
+ (sourcePinCovariance_isUnit hL).invertible
+
+theorem sourceContactQVariance_eq_variance {L : ℝ} (hL : L ≠ 0) :
+ sourceContactQVariance L =
+ Var[fun ω => sourceContactVector L ω 6; smoothLaw 2 L] := by
+ exact covariance_self ((sourceContactVector_hasGaussianLaw hL).eval 6).aemeasurable
+
+/-- Strict positivity of the actual curvature Schur variance follows from the literal contact law. -/
+theorem sourceContactSchur_pos {L : ℝ} (hL : L ≠ 0) :
+ 0 < sourceContactSchur L := by
+ have hblock : (Matrix.fromBlocks (sourcePinCovariance L) (sourceContactCrossMatrix L)
+ (sourceContactCrossMatrix L)ᴴ (sourceContactQMatrix L)).PosDef := by
+ rw [← sourceContactCovariance_block_identity L]
+ exact (sourceContactCovariance_posDef hL).submatrix sourceContactBlockEquiv.injective
+ have hs := (contact_schur_pos (sourcePinCovariance L) (sourceContactCrossMatrix L)
+ (sourceContactQMatrix L) hblock).2
+ have heq : ((sourceContactCrossMatrix L)ᴴ * (sourcePinCovariance L)⁻¹ *
+ sourceContactCrossMatrix L) () () =
+ sourceContactCross L ⬝ᵥ ((sourcePinCovariance L)⁻¹ *ᵥ sourceContactCross L) := by
+ simp only [Matrix.mul_apply, Matrix.conjTranspose_apply, sourceContactCrossMatrix,
+ star_trivial, dotProduct, Matrix.mulVec]
+ simp_rw [Finset.sum_mul]
+ rw [Finset.sum_comm]
+ simp only [Finset.mul_sum, mul_assoc]
+ change 0 < sourceContactQVariance L -
+ ((sourceContactCrossMatrix L)ᴴ * (sourcePinCovariance L)⁻¹ * sourceContactCrossMatrix L) () () at hs
+ rw [heq] at hs
+ exact hs
+
+/-- Finite Gaussian applications use this L² covariance identity; its normal equations are derived. -/
+lemma contact_residual_variance_of_isUnit_covariance {Ω ι : Type*} [MeasurableSpace Ω]
+ [Fintype ι] [DecidableEq ι] {P : Measure Ω} [IsFiniteMeasure P]
+ (J : Ω → ι → ℝ) (Q : Ω → ℝ)
+ (hJ : ∀ i, MemLp (fun ω => J ω i) 2 P) (hQ : MemLp Q 2 P)
+ (hG : IsUnit (Matrix.of (fun i j =>
+ covariance (fun ω => J ω i) (fun ω => J ω j) P) : Matrix ι ι ℝ)) :
+ let G : Matrix ι ι ℝ := fun i j => covariance (fun ω => J ω i) (fun ω => J ω j) P
+ let b : ι → ℝ := fun i => covariance (fun ω => J ω i) Q P
+ variance (fun ω => Q ω - (G⁻¹ *ᵥ b) ⬝ᵥ J ω) P =
+ variance Q P - b ⬝ᵥ (G⁻¹ *ᵥ b) := by
+ classical
+ let G : Matrix ι ι ℝ := fun i j => covariance (fun ω => J ω i) (fun ω => J ω j) P
+ let b : ι → ℝ := fun i => covariance (fun ω => J ω i) Q P
+ let a : ι → ℝ := G⁻¹ *ᵥ b
+ let U : Ω → ℝ := fun ω => a ⬝ᵥ J ω
+ change variance (fun ω => Q ω - U ω) P = variance Q P - b ⬝ᵥ a
+ have hG' : IsUnit G := hG
+ let _ : Invertible G := hG'.invertible
+ have hnormal : G *ᵥ a = b := by
+ dsimp [a]
+ rw [Matrix.mulVec_mulVec, Matrix.mul_inv_of_invertible, Matrix.one_mulVec]
+ have hterms (i : ι) : MemLp (fun ω => a i * J ω i) 2 P :=
+ (hJ i).const_mul _
+ have hU : MemLp U 2 P := memLp_finsetSum Finset.univ (fun i _ => hterms i)
+ have hJU (i : ι) : covariance (fun ω => J ω i) U P = b i := by
+ change covariance (fun ω => J ω i) (fun ω => ∑ j, a j * J ω j) P = b i
+ rw [covariance_fun_sum_right hterms (hJ i)]
+ simp_rw [covariance_const_mul_right]
+ simpa [G, Matrix.mulVec, dotProduct, mul_comm] using congrFun hnormal i
+ have hQU : covariance Q U P = a ⬝ᵥ b := by
+ change covariance Q (fun ω => ∑ i, a i * J ω i) P = a ⬝ᵥ b
+ rw [covariance_fun_sum_right hterms hQ]
+ simp_rw [covariance_const_mul_right]
+ simp only [b, dotProduct, covariance_comm Q]
+ have hvarU : variance U P = a ⬝ᵥ b := by
+ rw [← covariance_self hU.aemeasurable]
+ change covariance (fun ω => ∑ i, a i * J ω i) U P = a ⬝ᵥ b
+ rw [covariance_fun_sum_left hterms hU]
+ simp_rw [covariance_const_mul_left, hJU]
+ rfl
+ rw [variance_fun_sub hQ hU, hQU, hvarU, dotProduct_comm b a]
+ ring
+
+/-- The actual least-squares curvature residual, without replacing the torus covariance. -/
+def sourceContactResidual (L : ℝ) (ω : SmoothSample 2 L) : ℝ :=
+ sourceContactQ L ω -
+ ((sourcePinCovariance L)⁻¹ *ᵥ sourceContactCross L) ⬝ᵥ sourcePinVector L ω
+
+/-- The strictly positive Schur complement is the actual curvature residual variance. -/
+theorem sourceContactResidual_variance {L : ℝ} (hL : L ≠ 0) :
+ Var[sourceContactResidual L; smoothLaw 2 L] = sourceContactSchur L := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ have hJ (i : Fin 6) : MemLp (fun ω => sourcePinVector L ω i) 2 (smoothLaw 2 L) :=
+ ((sourceContactVector_hasGaussianLaw hL).eval i.castSucc).memLp_two
+ have hQ : MemLp (sourceContactQ L) 2 (smoothLaw 2 L) :=
+ ((sourceContactVector_hasGaussianLaw hL).eval 6).memLp_two
+ have hG : IsUnit (Matrix.of (fun i j =>
+ covariance (fun ω => sourcePinVector L ω i) (fun ω => sourcePinVector L ω j)
+ (smoothLaw 2 L)) : Matrix (Fin 6) (Fin 6) ℝ) := by
+ convert sourcePinCovariance_isUnit hL using 1
+ ext i j
+ rfl
+ have hv := contact_residual_variance_of_isUnit_covariance
+ (sourcePinVector L) (sourceContactQ L) hJ hQ hG
+ change Var[sourceContactResidual L; smoothLaw 2 L] =
+ Var[sourceContactQ L; smoothLaw 2 L] -
+ sourceContactCross L ⬝ᵥ ((sourcePinCovariance L)⁻¹ *ᵥ sourceContactCross L) at hv
+ rw [sourceContactSchur, sourceContactQVariance_eq_variance hL]
+ exact hv
+
+theorem sourceContactResidual_variance_pos {L : ℝ} (hL : L ≠ 0) :
+ 0 < Var[sourceContactResidual L; smoothLaw 2 L] := by
+ rw [sourceContactResidual_variance hL]
+ exact sourceContactSchur_pos hL
+
+end I4SourceContact
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceDerivativeContinuity.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceDerivativeContinuity.lean
new file mode 100644
index 000000000..c618c20e0
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceDerivativeContinuity.lean
@@ -0,0 +1,99 @@
+import SourceDerivativeGaussian
+import Mathlib.Analysis.Normed.Group.FunctionSeries
+
+/-! Continuity of the literal derivative covariance via its actual infinite
+Fourier pairing. The summable bounds hold globally in both evaluation points.
+No confluent difference quotient or conditional covariance limit is inferred. -/
+
+noncomputable section
+open I4Foundation I4Source I4Smooth I4SourceGaussian I4SmoothCarrier I4SourceDerivativeGaussian
+open MeasureTheory ProbabilityTheory
+open scoped BigOperators NNReal
+
+namespace I4SourceDerivativeContinuity
+
+/-- A global, point-independent bound for a fixed directional derivative mode. -/
+def derivativeMajorant (d : ℕ) (L : ℝ) (k : ℕ) (u : Fin k → (Fin d → ℝ))
+ (m : SourceMode d) : ℝ :=
+ orderModeBound k d L m * ∏ j, ‖u j‖
+
+theorem derivativeMajorant_nonneg (d : ℕ) (L : ℝ) (k : ℕ)
+ (u : Fin k → (Fin d → ℝ)) (m : SourceMode d) :
+ 0 ≤ derivativeMajorant d L k u m :=
+ mul_nonneg (orderModeBound_nonneg k d L m)
+ (Finset.prod_nonneg (fun _ _ => norm_nonneg _))
+
+theorem derivativeMajorant_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : ℕ)
+ (u : Fin k → (Fin d → ℝ)) : Summable (derivativeMajorant d L k u) :=
+ (orderModeBound_summable k d hL).mul_right _
+
+theorem derivativeCoefficient_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : ℕ)
+ (u : Fin k → (Fin d → ℝ)) (m : SourceMode d) (x : Fin d → ℝ) :
+ ‖derivativeCoefficient d L k x u m‖ ≤ derivativeMajorant d L k u m := by
+ exact ((iteratedFDeriv ℝ k (modeCoefficient d L m) x).le_opNorm u).trans
+ (mul_le_mul_of_nonneg_right (modeCoefficient_iteratedFDeriv_order_bound d hL m k x)
+ (Finset.prod_nonneg (fun _ _ => norm_nonneg _)))
+
+theorem derivativeCoefficient_continuous (d : ℕ) (L : ℝ) (k : ℕ)
+ (u : Fin k → (Fin d → ℝ)) (m : SourceMode d) :
+ Continuous (fun x => derivativeCoefficient d L k x u m) := by
+ have hf : ContDiff ℝ k (modeCoefficient d L m) := by
+ cases m with
+ | none =>
+ change ContDiff ℝ k (fun _ : Fin d → ℝ => Real.sqrt (1 / I4Weights.sourceZ d L))
+ fun_prop
+ | some p =>
+ rcases p with ⟨q, b⟩
+ change ContDiff ℝ k (fun x : Fin d → ℝ =>
+ Real.sqrt (2 * I4Weights.sourceWeight d L q / I4Weights.sourceZ d L) *
+ if b then Real.sin (phase d L q x) else Real.cos (phase d L q x))
+ cases b <;> simp only [Bool.false_eq_true, ite_false, ite_true] <;>
+ unfold phase <;> fun_prop
+ exact (continuous_eval_const u).comp
+ (hf.continuous_iteratedFDeriv le_rfl)
+
+private theorem derivativeMajorant_product_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k l : ℕ) (u : Fin k → (Fin d → ℝ)) (v : Fin l → (Fin d → ℝ)) :
+ Summable (fun m => derivativeMajorant d L k u m * derivativeMajorant d L l v m) := by
+ have h := summable_mul_of_summable_norm
+ (derivativeMajorant_summable d hL k u).norm
+ (derivativeMajorant_summable d hL l v).norm
+ simpa only [Function.comp_def] using h.comp_injective
+ (show Function.Injective (fun m : SourceMode d => (m,m)) from
+ fun _ _ h => congrArg Prod.fst h)
+
+/-- The covariance of two actual fixed-order directional derivatives is
+continuous in their two evaluation points, including coincident points. -/
+theorem smoothSourceField_derivative_covariance_continuous (d : ℕ) {L : ℝ}
+ (hL : L ≠ 0) (k l : ℕ) (u : Fin k → (Fin d → ℝ))
+ (v : Fin l → (Fin d → ℝ)) :
+ Continuous (fun xy : (Fin d → ℝ) × (Fin d → ℝ) =>
+ cov[fun ω => iteratedFDeriv ℝ k (smoothSourceField d L ω) xy.1 u,
+ fun ω => iteratedFDeriv ℝ l (smoothSourceField d L ω) xy.2 v; smoothLaw d L]) := by
+ simp_rw [smoothSourceField_derivative_covariance d hL]
+ apply continuous_tsum
+ · intro m
+ exact ((derivativeCoefficient_continuous d L k u m).comp continuous_fst).mul
+ ((derivativeCoefficient_continuous d L l v m).comp continuous_snd)
+ · exact derivativeMajorant_product_summable d hL k l u v
+ · intro m xy
+ rw [norm_mul]
+ exact mul_le_mul (derivativeCoefficient_bound d hL k u m xy.1)
+ (derivativeCoefficient_bound d hL l v m xy.2) (norm_nonneg _)
+ (derivativeMajorant_nonneg d L k u m)
+
+/-- Every actual directional derivative is centered under the unchanged source
+law. Noncentered conditional means are not identified with these means. -/
+theorem smoothSourceField_derivative_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k : ℕ) (x : Fin d → ℝ) (u : Fin k → (Fin d → ℝ)) :
+ (∫ ω, iteratedFDeriv ℝ k (smoothSourceField d L ω) x u ∂smoothLaw d L) = 0 := by
+ simp_rw [smoothSourceField_derivative_series d hL]
+ have h := scalarSeries_integral_zero (derivativeCoefficient d L k x u)
+ (derivativeCoefficient_summable d hL k x u)
+ change (∫ ω, scalarSeries (derivativeCoefficient d L k x u) ω ∂sourceLaw d) = 0 at h
+ rw [← sampleInclusion_map d hL,
+ integral_map (sampleInclusion_measurable d L).aemeasurable
+ (scalarSeries_measurable _).aestronglyMeasurable] at h
+ exact h
+
+end I4SourceDerivativeContinuity
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceDerivativeGaussian.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceDerivativeGaussian.lean
new file mode 100644
index 000000000..c40511553
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceDerivativeGaussian.lean
@@ -0,0 +1,188 @@
+import SourceSmoothCarrier
+import Mathlib.Analysis.Calculus.SmoothSeries
+import Mathlib.Topology.Algebra.Module.Multilinear.Topology
+
+/-! Actual derivative observations of the literal smooth Fourier source.
+All derivative orders are differentiated termwise on the existing SmoothSample
+carrier. Joint Gaussianity follows from summable deterministic coefficient arrays,
+without an assumed derivative law, conditional law or covariance lower bound. -/
+
+noncomputable section
+
+open I4Foundation I4Source I4Smooth I4SourceGaussian I4SmoothCarrier
+open MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal NNReal Topology
+
+namespace I4SourceDerivativeGaussian
+
+private theorem modeCoefficient_smooth (d : ℕ) (L : ℝ) (m : SourceMode d) :
+ ContDiff ℝ (⊤ : ℕ∞) (modeCoefficient d L m) := by
+ cases m with
+ | none =>
+ change ContDiff ℝ (⊤ : ℕ∞) (fun _ : Fin d → ℝ => Real.sqrt (1 / I4Weights.sourceZ d L))
+ fun_prop
+ | some p =>
+ rcases p with ⟨k, b⟩
+ change ContDiff ℝ (⊤ : ℕ∞) (fun x : Fin d → ℝ =>
+ Real.sqrt (2 * I4Weights.sourceWeight d L k / I4Weights.sourceZ d L) *
+ if b then Real.sin (phase d L k x) else Real.cos (phase d L k x))
+ cases b <;> simp only [Bool.false_eq_true, ite_false, ite_true] <;>
+ unfold phase <;> fun_prop
+
+private theorem weighted_iteratedFDeriv (d : ℕ) (L : ℝ) (m : SourceMode d)
+ (c : ℝ) (k : ℕ) (x : Fin d → ℝ) :
+ iteratedFDeriv ℝ k (fun y => modeCoefficient d L m y * c) x =
+ c • iteratedFDeriv ℝ k (modeCoefficient d L m) x := by
+ have hf : ContDiff ℝ k (modeCoefficient d L m) :=
+ (modeCoefficient_smooth d L m).of_le
+ (by exact_mod_cast (show (k : ℕ∞) ≤ ⊤ from le_top))
+ have heq : (fun y => modeCoefficient d L m y * c) = c • modeCoefficient d L m := by
+ funext y
+ simp only [Pi.smul_apply, smul_eq_mul, mul_comm]
+ rw [heq, iteratedFDeriv_const_smul_apply hf.contDiffAt]
+
+private theorem weighted_iteratedFDeriv_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (m : SourceMode d) (c : ℝ) (k : ℕ) (x : Fin d → ℝ) :
+ ‖iteratedFDeriv ℝ k (fun y => modeCoefficient d L m y * c) x‖ ≤
+ orderModeBound k d L m * |c| := by
+ rw [weighted_iteratedFDeriv, norm_smul, Real.norm_eq_abs]
+ simpa only [mul_comm] using mul_le_mul_of_nonneg_left
+ (modeCoefficient_iteratedFDeriv_order_bound d hL m k x) (abs_nonneg c)
+
+/-- Deterministic Fourier coefficient for an actual directional derivative. -/
+def derivativeCoefficient (d : ℕ) (L : ℝ) (k : ℕ) (x : Fin d → ℝ)
+ (u : Fin k → (Fin d → ℝ)) (m : SourceMode d) : ℝ :=
+ iteratedFDeriv ℝ k (modeCoefficient d L m) x u
+
+theorem derivativeCoefficient_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k : ℕ) (x : Fin d → ℝ) (u : Fin k → (Fin d → ℝ)) :
+ Summable (derivativeCoefficient d L k x u) := by
+ apply ((orderModeBound_summable k d hL).mul_right (∏ i, ‖u i‖)).of_norm_bounded
+ intro m
+ calc
+ ‖derivativeCoefficient d L k x u m‖ ≤
+ ‖iteratedFDeriv ℝ k (modeCoefficient d L m) x‖ * ∏ i, ‖u i‖ :=
+ (iteratedFDeriv ℝ k (modeCoefficient d L m) x).le_opNorm u
+ _ ≤ orderModeBound k d L m * ∏ i, ‖u i‖ :=
+ mul_le_mul_of_nonneg_right (modeCoefficient_iteratedFDeriv_order_bound d hL m k x)
+ (Finset.prod_nonneg (fun _ _ => norm_nonneg _))
+
+/-- This is a literal identity for every sample in the existing smooth carrier,
+including order zero. It is not a finite-mode approximation or a new field. -/
+theorem smoothSourceField_derivative_series (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample d L) (k : ℕ) (x : Fin d → ℝ)
+ (u : Fin k → (Fin d → ℝ)) :
+ iteratedFDeriv ℝ k (smoothSourceField d L ω) x u =
+ scalarSeries (derivativeCoefficient d L k x u) (sampleInclusion d L ω) := by
+ let f : SourceMode d → (Fin d → ℝ) → ℝ :=
+ fun m y => modeCoefficient d L m y * sampleInclusion d L ω m
+ let major : ℕ → SourceMode d → ℝ :=
+ fun j m => orderModeBound j d L m * |sampleInclusion d L ω m|
+ have hf (m : SourceMode d) : ContDiff ℝ (k : ℕ∞) (f m) :=
+ ((modeCoefficient_smooth d L m).of_le
+ (by exact_mod_cast (show (k : ℕ∞) ≤ ⊤ from le_top))).mul contDiff_const
+ have hmajor (j : ℕ) (_hj : (j : ℕ∞) ≤ k) : Summable (major j) :=
+ ω.property j
+ have hbound (j : ℕ) (m : SourceMode d) (y : Fin d → ℝ)
+ (_hj : (j : ℕ∞) ≤ k) : ‖iteratedFDeriv ℝ j (f m) y‖ ≤ major j m :=
+ weighted_iteratedFDeriv_bound d hL m (sampleInclusion d L ω m) j y
+ have hsum : Summable (fun m => iteratedFDeriv ℝ k (f m) x) :=
+ (hmajor k le_rfl).of_norm_bounded (fun m => hbound k m x le_rfl)
+ have hdiff := iteratedFDeriv_tsum_apply hf hmajor hbound (k := k) le_rfl x
+ change iteratedFDeriv ℝ k (fun y => ∑' m, f m y) x u =
+ ∑' m, derivativeCoefficient d L k x u m * sampleInclusion d L ω m
+ rw [hdiff, ContinuousMultilinearMap.tsum_eval hsum]
+ apply tsum_congr
+ intro m
+ dsimp only [f]
+ rw [weighted_iteratedFDeriv]
+ exact mul_comm _ _
+
+private theorem scalarSeries_linearCombination_hasGaussianLaw
+ {ι : Type*} [Countable ι] (n : ℕ) (a : Fin n → ι → ℝ)
+ (ha : ∀ j, Summable (a j)) (c : Fin n → ℝ) :
+ HasGaussianLaw (fun ω => ∑ j, c j * scalarSeries (a j) ω) (coefficientLaw ι) := by
+ classical
+ let b : ι → ℝ := fun m => ∑ j, c j * a j m
+ have hb : Summable b := summable_sum (fun j _ => (ha j).mul_left (c j))
+ have hG : HasGaussianLaw (scalarSeries b) (coefficientLaw ι) := by
+ constructor
+ · exact (scalarSeries_measurable b).aemeasurable
+ · rw [scalarSeries_map_gaussian b hb]
+ infer_instance
+ apply hG.congr
+ filter_upwards [ae_all_iff.2 (fun j : Fin n => scalarSeries_hasSum_ae (a j) (ha j)),
+ scalarSeries_hasSum_ae b hb] with ω hω hsum
+ have heq : HasSum (fun m => ∑ j, c j * a j m * ω m)
+ (∑ j, c j * scalarSeries (a j) ω) := by
+ simpa only [mul_assoc] using hasSum_sum (fun j _ => (hω j).mul_left (c j))
+ exact hsum.unique (by simpa only [b, Finset.sum_mul] using heq)
+
+/-- Arbitrary finite arrays of summable coefficient series are jointly Gaussian.
+No independence of the resulting observations is asserted or assumed. -/
+theorem scalarSeries_finiteVector_hasGaussianLaw
+ {ι : Type*} [Countable ι] (n : ℕ) (a : Fin n → ι → ℝ)
+ (ha : ∀ j, Summable (a j)) :
+ HasGaussianLaw (fun ω j => scalarSeries (a j) ω) (coefficientLaw ι) := by
+ classical
+ have hm : Measurable (fun ω j => scalarSeries (a j) ω) :=
+ Measurable.of_eval (fun j => scalarSeries_measurable (a j))
+ refine ⟨hm.aemeasurable, ?_⟩
+ apply isGaussian_of_map_eq_gaussianReal
+ intro ell
+ let c : Fin n → ℝ := fun j => ell (Pi.single j 1)
+ have hrep (z : Fin n → ℝ) : ell z = ∑ j, c j * z j := by
+ rw [← LinearMap.sum_single_apply (fun _ : Fin n => ℝ) z, map_sum]
+ apply Finset.sum_congr rfl
+ intro j _
+ have hs : Pi.single j (z j) = z j • Pi.single j (1 : ℝ) := by
+ rw [← Pi.single_smul, smul_eq_mul, mul_one]
+ rw [hs, map_smul]
+ simp [c, smul_eq_mul, mul_comm]
+ have hG : HasGaussianLaw (fun ω => ell (fun j => scalarSeries (a j) ω))
+ (coefficientLaw ι) :=
+ (scalarSeries_linearCombination_hasGaussianLaw n a ha c).congr
+ (Filter.Eventually.of_forall (fun ω => (hrep _).symm))
+ refine ⟨(coefficientLaw ι)[fun ω => ell (fun j => scalarSeries (a j) ω)],
+ Var[fun ω => ell (fun j => scalarSeries (a j) ω); coefficientLaw ι].toNNReal, ?_⟩
+ rw [Measure.map_map ell.continuous.measurable hm]
+ exact hG.map_eq_gaussianReal
+
+/-- Heterogeneous derivative orders, points and directions of the actual smooth
+field are jointly Gaussian under its unchanged literal law. Empty families,
+order zero and repeated observations are retained. -/
+theorem smoothSourceField_derivativeVector_hasGaussianLaw (d : ℕ) {L : ℝ}
+ (hL : L ≠ 0) (n : ℕ) (k : Fin n → ℕ) (x : Fin n → (Fin d → ℝ))
+ (u : ∀ j, Fin (k j) → (Fin d → ℝ)) :
+ HasGaussianLaw (fun ω j =>
+ iteratedFDeriv ℝ (k j) (smoothSourceField d L ω) (x j) (u j)) (smoothLaw d L) := by
+ let a : Fin n → SourceMode d → ℝ := fun j => derivativeCoefficient d L (k j) (x j) (u j)
+ have ha (j : Fin n) : Summable (a j) :=
+ derivativeCoefficient_summable d hL (k j) (x j) (u j)
+ have hm : Measurable (fun η j => scalarSeries (a j) η) :=
+ Measurable.of_eval (fun j => scalarSeries_measurable (a j))
+ have hG : HasGaussianLaw
+ (fun ω j => scalarSeries (a j) (sampleInclusion d L ω)) (smoothLaw d L) := by
+ refine ⟨(hm.comp (sampleInclusion_measurable d L)).aemeasurable, ?_⟩
+ rw [observation_map_eq d hL _ hm]
+ exact (scalarSeries_finiteVector_hasGaussianLaw n a ha).isGaussian_map
+ apply hG.congr
+ filter_upwards with ω
+ funext j
+ exact (smoothSourceField_derivative_series d hL ω (k j) (x j) (u j)).symm
+
+/-- Actual derivative covariance as a convergent Fourier coefficient pairing.
+This does not yet identify the pairing with derivatives of the theta kernel. -/
+theorem smoothSourceField_derivative_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k l : ℕ) (x y : Fin d → ℝ) (u : Fin k → (Fin d → ℝ))
+ (v : Fin l → (Fin d → ℝ)) :
+ cov[fun ω => iteratedFDeriv ℝ k (smoothSourceField d L ω) x u,
+ fun ω => iteratedFDeriv ℝ l (smoothSourceField d L ω) y v; smoothLaw d L] =
+ ∑' m, derivativeCoefficient d L k x u m * derivativeCoefficient d L l y v m := by
+ simp_rw [smoothSourceField_derivative_series d hL]
+ rw [covariance_comp_inclusion d hL _ _ (scalarSeries_measurable _)
+ (scalarSeries_measurable _)]
+ exact I4SourceCovariance.scalarSeries_covariance _ _
+ (derivativeCoefficient_summable d hL k x u) (derivativeCoefficient_summable d hL l y v)
+
+end I4SourceDerivativeGaussian
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointEstimates.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointEstimates.lean
new file mode 100644
index 000000000..5beba8edd
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointEstimates.lean
@@ -0,0 +1,366 @@
+import SourceEndpointParameters
+import SourceConfluentLimits
+import SourceContactEndpointParameters
+import SourcePhysicalEndpointKernel
+import GaussianRegressionLimits
+import ResearchFormalCoreR1.GaussianNormalizerLimit
+import ResearchFormalCoreR1.PalmReweighting
+
+/-!
+# Actual canonical endpoint estimates and reweighting
+
+The LM006 endpoint vector is explicitly converted to the literal physical
+maximum/saddle determinant weight. These composition lemmas retain the actual
+canonical all-pin kernel and its derived Gaussian parameters.
+See SOURCE_ENDPOINT_ESTIMATES.md for the frozen source contract.
+-/
+
+noncomputable section
+
+open I4SmoothCarrier I4SourceConfluentPins I4SourceEndpointRegression
+open I4SourceEndpointParameters ResearchFormalCoreR1
+open MeasureTheory ProbabilityTheory Matrix WithLp Filter
+open scoped Topology NNReal
+
+set_option autoImplicit false
+
+namespace I4SourceEndpointEstimates
+
+/-- LM006 `(aM,aS,bM,bS,cM,cS)` to actual `(aM,bM,cM,aS,bS,cS)` order. -/
+def sourcePhysicalCoordinates (v : Fin 6 → ℝ) : Fin 6 → ℝ :=
+ ![v 0,v 2,v 4,v 1,v 3,v 5]
+
+def sourcePhysicalIndex : Fin 6 → Fin 6 := ![0,2,4,1,3,5]
+
+theorem sourcePhysicalCoordinates_apply (v : Fin 6 → ℝ) (i : Fin 6) :
+ sourcePhysicalCoordinates v i = v (sourcePhysicalIndex i) := by
+ fin_cases i <;> rfl
+
+theorem sourcePhysicalCoordinates_continuous : Continuous sourcePhysicalCoordinates := by
+ unfold sourcePhysicalCoordinates
+ fun_prop
+
+theorem sourcePhysicalCoordinates_inverse (v : Fin 6 → ℝ) :
+ enb_permutation (sourcePhysicalCoordinates v) = v := by
+ ext i
+ fin_cases i <;> rfl
+
+/-- The literal strict typed physical endpoint determinant weight. -/
+def sourceEndpointWeight (r : ℝ) (v : Fin 6 → ℝ) : ℝ :=
+ egm_weight r (sourcePhysicalCoordinates v)
+
+theorem sourceEndpointWeight_measurable (r : ℝ) : Measurable (sourceEndpointWeight r) :=
+ (egm_weight_measurable r).comp sourcePhysicalCoordinates_continuous.measurable
+
+theorem sourceEndpointWeight_nonneg (r : ℝ) (v : Fin 6 → ℝ) :
+ 0 ≤ sourceEndpointWeight r v := by
+ unfold sourceEndpointWeight egm_weight
+ split_ifs
+ · exact abs_nonneg _
+ · exact le_rfl
+
+theorem sourceEndpointWeight_eq_continuous (r : ℝ) (hr : 0 < r) (v : Fin 6 → ℝ) :
+ sourceEndpointWeight r v = r^2 * gn_normalizedWeight r v := by
+ simpa only [sourceEndpointWeight, sourcePhysicalCoordinates_inverse] using
+ enb_weight_identity r (sourcePhysicalCoordinates v) hr
+
+def sourceEndpointLaw (L r b : ℝ) : Measure (Fin 6 → ℝ) :=
+ sourceEndpointKernel L r (sourcePrescribedPins r b)
+
+def sourceEndpointMean (L r b : ℝ) : Fin 6 → ℝ :=
+ sourceRegressionMapAt L r (sourcePrescribedPins r b)
+
+theorem sourceEndpointLaw_isProbabilityMeasure {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :
+ IsProbabilityMeasure (sourceEndpointLaw L r b) := by
+ unfold sourceEndpointLaw
+ have : IsMarkovKernel (sourceEndpointKernel L r) := sourceEndpointKernel_markov hL r
+ exact inferInstance
+
+/-- The actual canonical every-pin kernel has the derived finite Gaussian law. -/
+theorem sourceEndpointLaw_euclidean_hasLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ HasLaw (toLp 2) (multivariateGaussian (toLp 2 (sourceEndpointMean L r b))
+ (sourceEndpointSchurAt L r)) (sourceEndpointLaw L r b) where
+ aemeasurable := by fun_prop
+ map_eq := sourceEndpointKernel_eq_multivariateGaussian hL r hG (sourcePrescribedPins r b)
+
+/-- Every physical coordinate marginal is derived from the actual kernel,
+including singular residual covariances and noncentered prescribed heights. -/
+theorem sourceEndpointLaw_physical_marginal {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) (i : Fin 6) :
+ HasLaw (fun v => sourcePhysicalCoordinates v i)
+ (gaussianReal (sourceEndpointMean L r b (sourcePhysicalIndex i))
+ ((sourceEndpointSchurAt L r) (sourcePhysicalIndex i) (sourcePhysicalIndex i)).toNNReal)
+ (sourceEndpointLaw L r b) := by
+ have hPSD := sourceEndpointSchurAt_posSemidef hL r hG
+ have h := (measurePreserving_eval_multivariateGaussian
+ (μ := toLp 2 (sourceEndpointMean L r b)) hPSD (i := sourcePhysicalIndex i)).hasLaw.fun_comp
+ (sourceEndpointLaw_euclidean_hasLaw hL r b hG)
+ exact h.congr (Eventually.of_forall (fun v => sourcePhysicalCoordinates_apply v i))
+
+/-- Integrals of the literal physical weight transfer to the exact finite
+Gaussian parameter law without an assumed integral representation. -/
+theorem sourceEndpointLaw_weight_integral {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ (∫ v, sourceEndpointWeight r v ∂sourceEndpointLaw L r b) =
+ ∫ x : EuclideanSpace ℝ (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]
+ ∂multivariateGaussian (toLp 2 (sourceEndpointMean L r b)) (sourceEndpointSchurAt L r) := by
+ have h := (sourceEndpointLaw_euclidean_hasLaw hL r b hG).integral_comp
+ (f := fun x : EuclideanSpace ℝ (Fin 6) => egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5])
+ (show AEStronglyMeasurable
+ (fun x : EuclideanSpace ℝ (Fin 6) => egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5])
+ (multivariateGaussian (toLp 2 (sourceEndpointMean L r b)) (sourceEndpointSchurAt L r)) by
+ exact ((egm_weight_measurable r).comp (by fun_prop)).aestronglyMeasurable)
+ simpa only [sourceEndpointWeight, sourcePhysicalCoordinates, Function.comp_def,
+ ofLp_toLp] using h
+
+/-- Per-radius moment composition from explicit parameter bounds. The later
+actual-source family theorem derives these bounds from the actual block limits. -/
+theorem sourceEndpointLaw_second_moment_of_parameter_bounds {L : ℝ} (hL : L ≠ 0)
+ (r b B V : ℝ) (hG : IsUnit (sourcePinCovarianceAt L r))
+ (hB : 0 ≤ B) (hV : 0 ≤ V) (hr : 0 < r) (hr1 : r ≤ 1)
+ (hmean : ∀ i, |sourceEndpointMean L r b i| ≤ B)
+ (hvar : ∀ i, |sourceEndpointSchurAt L r i i| ≤ V) :
+ Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b) ∧
+ (∫ v, sourceEndpointWeight r v ^ 2 ∂sourceEndpointLaw L r b) ≤
+ 16 * gm8FiniteM8 6 B V * r ^ 4 := by
+ have := sourceEndpointLaw_isProbabilityMeasure hL r b
+ have hPSD := sourceEndpointSchurAt_posSemidef hL r hG
+ apply egm_gaussian_moment (sourceEndpointLaw L r b) sourcePhysicalCoordinates
+ sourcePhysicalCoordinates_continuous.measurable
+ (fun i => sourceEndpointMean L r b (sourcePhysicalIndex i))
+ (fun i => ((sourceEndpointSchurAt L r) (sourcePhysicalIndex i) (sourcePhysicalIndex i)).toNNReal)
+ B V r hB hV hr hr1
+ · exact fun i => hmean (sourcePhysicalIndex i)
+ · intro i
+ rw [Real.coe_toNNReal _ hPSD.diag_nonneg]
+ exact (le_abs_self _).trans (hvar (sourcePhysicalIndex i))
+ · exact sourceEndpointLaw_physical_marginal hL r b hG
+
+/-- Actual physical square integrability needs no supplied parameter bound.
+Finite current Gaussian parameters provide their own finite coordinate bounds. -/
+theorem sourceEndpointLaw_weight_square_integrable {L : ℝ} (hL : L ≠ 0)
+ (r b : ℝ) (hG : IsUnit (sourcePinCovarianceAt L r)) (hr : 0 < r) (hr1 : r ≤ 1) :
+ Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b) := by
+ apply (sourceEndpointLaw_second_moment_of_parameter_bounds hL r b
+ ‖sourceEndpointMean L r b‖ ‖fun i => sourceEndpointSchurAt L r i i‖
+ hG (norm_nonneg _) (norm_nonneg _) hr hr1 ?_ ?_).1
+ · intro i
+ simpa only [Real.norm_eq_abs] using norm_le_pi_norm (sourceEndpointMean L r b) i
+ · intro i
+ simpa only [Real.norm_eq_abs] using
+ norm_le_pi_norm (fun i => sourceEndpointSchurAt L r i i) i
+
+theorem sourceEndpointLaw_weight_integrable {L : ℝ} (hL : L ≠ 0)
+ (r b : ℝ) (hG : IsUnit (sourcePinCovarianceAt L r)) (hr : 0 < r) (hr1 : r ≤ 1) :
+ Integrable (sourceEndpointWeight r) (sourceEndpointLaw L r b) := by
+ have := sourceEndpointLaw_isProbabilityMeasure hL r b
+ exact prw_integrable_of_integrable_sq _ _ (sourceEndpointWeight_measurable r)
+ (sourceEndpointLaw_weight_square_integrable hL r b hG hr hr1)
+
+/-- The literal prescribed height has the actual contact pin as its right limit. -/
+theorem sourcePrescribedPins_tendsto (b : ℝ) :
+ Tendsto (fun r => sourcePrescribedPins r b) (𝓝[>] (0 : ℝ))
+ (𝓝 ![b,0,0,0,0,2]) := by
+ have hc : Continuous (fun r => sourcePrescribedPins r b) := by
+ unfold sourcePrescribedPins
+ fun_prop
+ simpa [sourcePrescribedPins] using (hc.tendsto 0).mono_left nhdsWithin_le_nhds
+
+/-- Explicit endpoint probability with the literal normalized weight density. -/
+def sourceEndpointWeightedProbability (L r b : ℝ) : Measure (Fin 6 → ℝ) :=
+ prwMeasure (sourceEndpointLaw L r b) (sourceEndpointWeight r)
+
+/-- Endpoint reweighting glue; its estimates are derived in the final actual
+source theorem after the actual covariance-limit exports are available. -/
+theorem sourceEndpoint_weighted_event_bound_of_estimates {L : ℝ} (hL : L ≠ 0)
+ (r b C c : ℝ) (hC : 0 ≤ C) (hc : 0 < c) (hr : 0 < r)
+ (hsq : Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b))
+ (hmoment : (∫ v, sourceEndpointWeight r v ^ 2 ∂sourceEndpointLaw L r b) ≤ C*r^4)
+ (hfloor : c*r^2 ≤ ∫ v, sourceEndpointWeight r v ∂sourceEndpointLaw L r b)
+ (E : Set (Fin 6 → ℝ)) (hE : MeasurableSet E) :
+ IsProbabilityMeasure (sourceEndpointWeightedProbability L r b) ∧
+ (sourceEndpointWeightedProbability L r b).real E ≤
+ (Real.sqrt C/c) * Real.sqrt ((sourceEndpointLaw L r b).real E) := by
+ have := sourceEndpointLaw_isProbabilityMeasure hL r b
+ exact prw_square_root_event_bound (sourceEndpointLaw L r b) (sourceEndpointWeight r)
+ (sourceEndpointWeight_measurable r) (sourceEndpointWeight_nonneg r) hsq
+ C c r hC hc hr hmoment hfloor E hE
+
+open I4SourceContact I4SourceConfluentLimits I4GaussianRegressionLimits
+
+theorem sourceEndpoint_parameter_limits {L : ℝ} (hL : L ≠ 0) (b : ℝ) :
+ (∀ᶠ r in 𝓝[>] (0 : ℝ), IsUnit (sourcePinCovarianceAt L r)) ∧
+ Tendsto (fun r => toLp 2 (sourceEndpointMean L r b)) (𝓝[>] (0 : ℝ))
+ (𝓝 (toLp 2 (sourceContactEndpointMean L b))) ∧
+ Tendsto (sourceEndpointSchurAt L) (𝓝[>] (0 : ℝ))
+ (𝓝 (sourceContactEndpointSchur L)) := by
+ have hd : Tendsto (fun r => sourcePrescribedPins r b) (𝓝[>] (0 : ℝ))
+ (𝓝 (sourceContactPinValue b)) := by
+ simpa only [sourceContactPinValue] using sourcePrescribedPins_tendsto b
+ have hp := regression_parameter_limits (𝓝[>] (0 : ℝ))
+ (sourcePinCovarianceAt L) (sourceCrossCovarianceAt L) (sourceEndpointCovarianceAt L)
+ (fun r => sourcePrescribedPins r b)
+ (sourcePinCovariance L) (sourceContactEndpointCrossCovariance L)
+ (sourceContactEndpointCovariance L) (sourceContactPinValue b)
+ (sourcePinCovarianceAt_tendsto hL) (sourceCrossCovarianceAt_tendsto hL)
+ (sourceEndpointCovarianceAt_tendsto hL) hd (sourcePinCovariance_isUnit hL)
+ refine ⟨hp.1, ?_, ?_⟩
+ · have hm : Tendsto (fun r => sourceEndpointMean L r b) (𝓝[>] (0 : ℝ))
+ (𝓝 (sourceContactEndpointMean L b)) := by
+ simpa only [regressionMean, sourceEndpointMean, sourceRegressionMapAt_apply,
+ sourceRegressionMatrixAt, sourceContactEndpointMean, sourceContactEndpointRegression]
+ using hp.2.2.1
+ exact ((PiLp.continuous_toLp 2 (fun _ : Fin 6 => ℝ)).tendsto _).comp hm
+ · exact hp.2.2.2
+
+theorem sourceEndpoint_uniform_parameter_bounds {L : ℝ} (hL : L ≠ 0) (b : ℝ) :
+ ∃ M V δ : ℝ, 0 ≤ M ∧ 0 ≤ V ∧ 0 < δ ∧
+ ∀ r : ℝ, 0 < r → r < δ → IsUnit (sourcePinCovarianceAt L r) ∧
+ (∀ i, |sourceEndpointMean L r b i| ≤ M) ∧
+ (∀ i, |sourceEndpointSchurAt L r i i| ≤ V) := by
+ have hd : Tendsto (fun r => sourcePrescribedPins r b) (𝓝[>] (0 : ℝ))
+ (𝓝 (sourceContactPinValue b)) := by
+ simpa only [sourceContactPinValue] using sourcePrescribedPins_tendsto b
+ obtain ⟨M,V,δ,hM,hV,hδ,hbounds⟩ := regression_uniform_bounds
+ (sourcePinCovarianceAt L) (sourceCrossCovarianceAt L) (sourceEndpointCovarianceAt L)
+ (fun r => sourcePrescribedPins r b)
+ (sourcePinCovariance L) (sourceContactEndpointCrossCovariance L)
+ (sourceContactEndpointCovariance L) (sourceContactPinValue b)
+ (sourcePinCovarianceAt_tendsto hL) (sourceCrossCovarianceAt_tendsto hL)
+ (sourceEndpointCovarianceAt_tendsto hL) hd (sourcePinCovariance_isUnit hL)
+ refine ⟨M,V,δ,hM,hV,hδ,?_⟩
+ intro r hr hrδ
+ obtain ⟨hunit,hm,hcov⟩ := hbounds r hr hrδ
+ refine ⟨hunit,?_,?_⟩
+ · simpa only [regressionMean, sourceEndpointMean, sourceRegressionMapAt_apply,
+ sourceRegressionMatrixAt] using hm
+ · simpa only [regressionCovariance, sourceEndpointSchurAt] using hcov
+
+
+/- Normalizer assembly coauthored by actual OpenAI/Codex helper
+/root/dm2_landed_composition/peano_strategy; author-side only. -/
+/-- The actual every-pin source law has a positive small-radius physical
+normalizer coefficient, with arbitrary fixed real prescribed height. -/
+theorem sourceEndpoint_normalizer_floor {L : ℝ} (hL : L ≠ 0) (b : ℝ) :
+ ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧
+ ∀ r : ℝ, 0 < r → r < δ →
+ c * r^2 ≤ ∫ v, sourceEndpointWeight r v ∂sourceEndpointLaw L r b := by
+ obtain ⟨hunit, hm, hS⟩ := sourceEndpoint_parameter_limits hL b
+ have hPSD : ∀ᶠ r in 𝓝[>] (0 : ℝ), (sourceEndpointSchurAt L r).PosSemidef := by
+ filter_upwards [hunit] with r hr
+ exact sourceEndpointSchurAt_posSemidef hL r hr
+ have hmC := sourceContactEndpointMean_contact hL b
+ have hSC := sourceContactEndpointSchur_contact hL
+ obtain ⟨c, hc, δN, hδN, hfloor⟩ :=
+ gnl_physical_normalizer_floor_of_parameter_limits
+ (fun r => toLp 2 (sourceEndpointMean L r b)) (sourceEndpointSchurAt L)
+ (toLp 2 (sourceContactEndpointMean L b)) (sourceContactEndpointSchur L)
+ hm hS hPSD (sourceContactEndpointSchur_posSemidef hL)
+ hmC.1 hmC.2.1 hmC.2.2.1 hmC.2.2.2
+ hSC.1 hSC.2.1 hSC.2.2.1 hSC.2.2.2
+ (sourceContactEndpointSchur_referenceVariance_pos hL)
+ obtain ⟨δG, hδG, hGinterval⟩ := mem_nhdsGT_iff_exists_Ioo_subset.mp hunit
+ refine ⟨c, hc, min δN δG, lt_min hδN hδG, ?_⟩
+ intro r hr hrδ
+ have hG : IsUnit (sourcePinCovarianceAt L r) :=
+ hGinterval ⟨hr, lt_of_lt_of_le hrδ (min_le_right _ _)⟩
+ rw [sourceEndpointLaw_weight_integral hL r b hG]
+ exact hfloor r hr (lt_of_lt_of_le hrδ (min_le_left _ _))
+
+theorem sourceEndpoint_estimates {L : ℝ} (hL : L ≠ 0) (b : ℝ) :
+ ∃ C c δ : ℝ, 0 ≤ C ∧ 0 < c ∧ 0 < δ ∧ δ ≤ 1 ∧
+ ∀ r : ℝ, 0 < r → r < δ →
+ Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b) ∧
+ (∫ v, sourceEndpointWeight r v ^ 2 ∂sourceEndpointLaw L r b) ≤ C*r^4 ∧
+ c*r^2 ≤ ∫ v, sourceEndpointWeight r v ∂sourceEndpointLaw L r b := by
+ obtain ⟨M,V,δM,hM,hV,hδM,hbounds⟩ := sourceEndpoint_uniform_parameter_bounds hL b
+ obtain ⟨c,hc,δF,hδF,hfloor⟩ := sourceEndpoint_normalizer_floor hL b
+ refine ⟨16 * gm8FiniteM8 6 M V,c,min δM (min δF 1),
+ mul_nonneg (by norm_num) (gm8FiniteM8_nonneg 6 M V),hc,
+ lt_min hδM (lt_min hδF (by norm_num)),
+ (min_le_right _ _).trans (min_le_right _ _),?_⟩
+ intro r hr hrδ
+ have hrM : r < δM := lt_of_lt_of_le hrδ (min_le_left _ _)
+ have hrF : r < δF := lt_of_lt_of_le hrδ ((min_le_right _ _).trans (min_le_left _ _))
+ have hr1 : r ≤ 1 := (le_of_lt hrδ).trans ((min_le_right _ _).trans (min_le_right _ _))
+ obtain ⟨hunit,hm,hv⟩ := hbounds r hr hrM
+ obtain ⟨hsq,hbound⟩ := sourceEndpointLaw_second_moment_of_parameter_bounds hL r b M V
+ hunit hM hV hr hr1 hm hv
+ exact ⟨hsq,hbound,hfloor r hr hrF⟩
+
+theorem sourceEndpoint_estimates_and_weighted_events {L : ℝ} (hL : L ≠ 0) (b : ℝ) :
+ ∃ C c δ : ℝ, 0 ≤ C ∧ 0 < c ∧ 0 < δ ∧ δ ≤ 1 ∧
+ ∀ r : ℝ, 0 < r → r < δ →
+ Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b) ∧
+ (∫ v, sourceEndpointWeight r v ^ 2 ∂sourceEndpointLaw L r b) ≤ C*r^4 ∧
+ c*r^2 ≤ (∫ v, sourceEndpointWeight r v ∂sourceEndpointLaw L r b) ∧
+ IsProbabilityMeasure (sourceEndpointWeightedProbability L r b) ∧
+ ∀ E : Set (Fin 6 → ℝ), MeasurableSet E →
+ (sourceEndpointWeightedProbability L r b).real E ≤
+ (Real.sqrt C/c) * Real.sqrt ((sourceEndpointLaw L r b).real E) := by
+ obtain ⟨C,c,δ,hC,hc,hδ,hδ1,he⟩ := sourceEndpoint_estimates hL b
+ refine ⟨C,c,δ,hC,hc,hδ,hδ1,?_⟩
+ intro r hr hrδ
+ obtain ⟨hsq,hm,hf⟩ := he r hr hrδ
+ have hp := sourceEndpoint_weighted_event_bound_of_estimates hL r b C c hC hc hr
+ hsq hm hf Set.univ MeasurableSet.univ
+ refine ⟨hsq,hm,hf,hp.1,?_⟩
+ intro E hE
+ exact (sourceEndpoint_weighted_event_bound_of_estimates hL r b C c hC hc hr
+ hsq hm hf E hE).2
+
+
+open I4SourcePhysicalEndpointKernel
+
+/-- The canonical kernel of the actual physical normalized Hessian entries. -/
+def sourcePhysicalEndpointLaw (L r b : ℝ) : Measure (Fin 6 → ℝ) :=
+ sourcePhysicalEndpointKernel L r (sourcePrescribedPins r b)
+
+/-- Literal equality of the specified kernels at the prescribed pins, derived
+from their common residual law and the proved zero correction there. -/
+theorem sourcePhysicalEndpointLaw_eq {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :
+ sourcePhysicalEndpointLaw L r b = sourceEndpointLaw L r b :=
+ sourcePhysicalEndpointKernel_at_prescribed hL r b
+
+theorem sourcePhysicalEndpointLaw_isProbabilityMeasure {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :
+ IsProbabilityMeasure (sourcePhysicalEndpointLaw L r b) := by
+ rw [sourcePhysicalEndpointLaw_eq hL r b]
+ exact sourceEndpointLaw_isProbabilityMeasure hL r b
+
+/-- Actual block limits supply current invertibility, hence the physical
+kernel is a conditional law at every sufficiently small positive radius. -/
+theorem sourcePhysicalEndpointKernel_eventually_hasCondDistrib {L : ℝ} (hL : L ≠ 0) :
+ ∀ᶠ r in 𝓝[>] (0 : ℝ),
+ HasCondDistrib (sourceNormalizedEndpoints L r) (sourceConfluentPinsAt L r)
+ (sourcePhysicalEndpointKernel L r) (smoothLaw 2 L) := by
+ filter_upwards [(sourceEndpoint_parameter_limits hL 0).1] with r hr
+ exact sourcePhysicalEndpointKernel_hasCondDistrib hL r hr
+
+/-- The explicit probability is weighted from the actual physical endpoint law. -/
+def sourcePhysicalEndpointWeightedProbability (L r b : ℝ) : Measure (Fin 6 → ℝ) :=
+ prwMeasure (sourcePhysicalEndpointLaw L r b) (sourceEndpointWeight r)
+
+theorem sourcePhysicalEndpointWeightedProbability_eq {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :
+ sourcePhysicalEndpointWeightedProbability L r b = sourceEndpointWeightedProbability L r b := by
+ unfold sourcePhysicalEndpointWeightedProbability sourceEndpointWeightedProbability
+ rw [sourcePhysicalEndpointLaw_eq hL r b]
+
+/-- Actual physical canonical endpoint moment, normalizer and measurable-event
+estimates, at arbitrary fixed height. No desired law, covariance limit,
+parameter bound or positive normalizer is a premise. -/
+theorem sourcePhysicalEndpoint_estimates_and_weighted_events {L : ℝ} (hL : L ≠ 0) (b : ℝ) :
+ ∃ C c δ : ℝ, 0 ≤ C ∧ 0 < c ∧ 0 < δ ∧ δ ≤ 1 ∧
+ ∀ r : ℝ, 0 < r → r < δ →
+ Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourcePhysicalEndpointLaw L r b) ∧
+ (∫ v, sourceEndpointWeight r v ^ 2 ∂sourcePhysicalEndpointLaw L r b) ≤ C*r^4 ∧
+ c*r^2 ≤ (∫ v, sourceEndpointWeight r v ∂sourcePhysicalEndpointLaw L r b) ∧
+ IsProbabilityMeasure (sourcePhysicalEndpointWeightedProbability L r b) ∧
+ ∀ E : Set (Fin 6 → ℝ), MeasurableSet E →
+ (sourcePhysicalEndpointWeightedProbability L r b).real E ≤
+ (Real.sqrt C/c) * Real.sqrt ((sourcePhysicalEndpointLaw L r b).real E) := by
+ simpa only [sourcePhysicalEndpointLaw_eq hL,
+ sourcePhysicalEndpointWeightedProbability_eq hL] using
+ sourceEndpoint_estimates_and_weighted_events hL b
+
+end I4SourceEndpointEstimates
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointParameters.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointParameters.lean
new file mode 100644
index 000000000..dac364319
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointParameters.lean
@@ -0,0 +1,291 @@
+import SourceEndpointRegression
+import Mathlib.Probability.Distributions.Gaussian.Multivariate
+
+/-!
+# Actual canonical endpoint-kernel Gaussian parameters
+
+Unconditional means are derived from the literal differentiated source series.
+The residual covariance is derived from bilinearity and the actual regression
+normal equations. Its Schur matrix is positive semidefinite because it is an
+actual Gaussian covariance; no positivity premise is added.
+
+At every pin the canonical kernel, transported from the Pi space to Euclidean
+space, equals the literal `multivariateGaussian` with mean `C G⁻¹ x` and Schur
+covariance. Singular residual covariance is retained. Current pin covariance
+invertibility is explicit pending the separate covariance-limit join.
+See `SOURCE_ENDPOINT_PARAMETERS.md` for the frozen source contract.
+-/
+
+noncomputable section
+
+open I4Foundation I4Source I4SourceGaussian I4SmoothCarrier I4SourceDerivativeGaussian
+open I4SourceConfluentPins I4SourceEndpointRegression ResearchFormalCoreR1
+open MeasureTheory ProbabilityTheory Matrix WithLp
+open scoped BigOperators Matrix RealInnerProductSpace
+
+set_option autoImplicit false
+
+namespace I4SourceEndpointParameters
+
+theorem smoothSourceField_derivative_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k : ℕ) (x : Fin d → ℝ) (u : Fin k → (Fin d → ℝ)) :
+ (∫ ω, iteratedFDeriv ℝ k (smoothSourceField d L ω) x u ∂smoothLaw d L) = 0 := by
+ simp_rw [smoothSourceField_derivative_series d hL]
+ have hm := integral_map (μ := smoothLaw d L) (sampleInclusion_measurable d L).aemeasurable
+ (scalarSeries_measurable (derivativeCoefficient d L k x u)).aestronglyMeasurable
+ rw [sampleInclusion_map d hL] at hm
+ rw [← hm]
+ exact scalarSeries_integral_zero _ (derivativeCoefficient_summable d hL k x u)
+
+theorem rawPinsWithHessians_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i : Fin 12) :
+ (∫ ω, rawPinsWithHessians L r ω i ∂smoothLaw 2 L) = 0 := by
+ fin_cases i
+ all_goals dsimp [rawPinsWithHessians, rawPins]
+ all_goals first
+ | exact smoothSourceField_derivative_integral_zero 2 hL 2 _ _
+ | simpa only [iteratedFDeriv_zero_apply] using
+ smoothSourceField_derivative_integral_zero 2 hL 0 _ ![]
+ | simpa [iteratedFDeriv_one_apply] using
+ smoothSourceField_derivative_integral_zero 2 hL 1 _ ![directionX]
+ | simpa [iteratedFDeriv_one_apply] using
+ smoothSourceField_derivative_integral_zero 2 hL 1 _ ![directionY]
+
+theorem rawPinsWithHessians_integral_vector_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ (∫ ω, rawPinsWithHessians L r ω ∂smoothLaw 2 L) = 0 := by
+ ext i
+ have hh := (ContinuousLinearMap.proj i : (Fin 12 → ℝ) →L[ℝ] ℝ).integral_comp_comm
+ (rawPinsWithHessians_hasGaussianLaw hL r).integrable
+ change (∫ ω, rawPinsWithHessians L r ω i ∂smoothLaw 2 L) =
+ (∫ ω, rawPinsWithHessians L r ω ∂smoothLaw 2 L) i at hh
+ change (∫ ω, rawPinsWithHessians L r ω ∂smoothLaw 2 L) i = 0
+ rw [← hh]
+ exact rawPinsWithHessians_integral_zero hL r i
+
+theorem sourcePins_adjusted_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ (∫ ω, (sourceConfluentPinsAt L r ω, sourceAdjustedEndpoints L r ω) ∂smoothLaw 2 L) = 0 := by
+ have hh := (endpointObservationMap r).integral_comp_comm
+ (rawPinsWithHessians_hasGaussianLaw hL r).integrable
+ simp_rw [endpointObservationMap_actual] at hh
+ rw [rawPinsWithHessians_integral_vector_zero hL r, map_zero] at hh
+ exact hh
+
+theorem sourceConfluentPinsAt_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ (∫ ω, sourceConfluentPinsAt L r ω ∂smoothLaw 2 L) = 0 := by
+ have hh := congrArg Prod.fst (sourcePins_adjusted_integral_zero hL r)
+ rw [fst_integral (sourcePins_adjusted_hasGaussianLaw hL r).integrable] at hh
+ exact hh
+
+theorem sourceAdjustedEndpoints_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ (∫ ω, sourceAdjustedEndpoints L r ω ∂smoothLaw 2 L) = 0 := by
+ have hh := congrArg Prod.snd (sourcePins_adjusted_integral_zero hL r)
+ rw [snd_integral (sourcePins_adjusted_hasGaussianLaw hL r).integrable] at hh
+ exact hh
+
+theorem sourceEndpointResidual_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ (∫ ω, sourceEndpointResidual L r ω ∂smoothLaw 2 L) = 0 := by
+ have hG := sourcePins_adjusted_hasGaussianLaw hL r
+ unfold sourceEndpointResidual
+ rw [integral_sub hG.snd.integrable (hG.fst.map_fun (sourceRegressionMapAt L r)).integrable,
+ (sourceRegressionMapAt L r).integral_comp_comm hG.fst.integrable,
+ sourceAdjustedEndpoints_integral_zero hL r, sourceConfluentPinsAt_integral_zero hL r,
+ map_zero, sub_zero]
+
+theorem sourceEndpointResidual_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) (i j : Fin 6) :
+ covariance (fun ω => sourceEndpointResidual L r ω i)
+ (fun ω => sourceEndpointResidual L r ω j) (smoothLaw 2 L) =
+ sourceEndpointCovarianceAt L r i j -
+ (sourceCrossCovarianceAt L r * (sourcePinCovarianceAt L r)⁻¹ *
+ (sourceCrossCovarianceAt L r)ᵀ) i j := by
+ let X := sourceConfluentPinsAt L r
+ let V := sourceAdjustedEndpoints L r
+ let B := sourceRegressionMapAt L r
+ let R := sourceEndpointResidual L r
+ let P := smoothLaw 2 L
+ have hXV := sourcePins_adjusted_hasGaussianLaw hL r
+ have : IsProbabilityMeasure P := hXV.isProbabilityMeasure
+ have hXi (l : Fin 6) : MemLp (fun ω => X ω l) 2 P := (hXV.fst.eval l).memLp_two
+ have hVi (l : Fin 6) : MemLp (fun ω => V ω l) 2 P := (hXV.snd.eval l).memLp_two
+ have hBi (l : Fin 6) : MemLp (fun ω => B (X ω) l) 2 P :=
+ ((hXV.fst.map_fun B).eval l).memLp_two
+ have hRi (l : Fin 6) : MemLp (fun ω => R ω l) 2 P := by
+ exact (hVi l).sub (hBi l)
+ have hXR (l t : Fin 6) :
+ covariance (fun ω => X ω l) (fun ω => R ω t) P = 0 := by
+ simpa only [sub_zero, X, R, P, sourceEndpointResidual] using
+ regression_residual_zero_covariance hXV B 0 0
+ (sourceRegression_normal_equations L r hG) l t
+ have hBR (l t : Fin 6) :
+ covariance (fun ω => B (X ω) l) (fun ω => R ω t) P = 0 := by
+ have heq : (fun ω => B (X ω) l) =
+ (fun ω => ∑ a, B (Pi.single a 1) l * X ω a) := by
+ funext ω
+ exact regression_map_coordinate B (X ω) l
+ rw [heq, covariance_fun_sum_left (fun a => (hXi a).const_mul _) (hRi t)]
+ simp_rw [covariance_const_mul_left, hXR, mul_zero]
+ exact Finset.sum_const_zero
+ have hBV (l t : Fin 6) :
+ covariance (fun ω => B (X ω) l) (fun ω => V ω t) P =
+ (sourceRegressionMatrixAt L r * (sourceCrossCovarianceAt L r)ᵀ) l t := by
+ have heq : (fun ω => B (X ω) l) =
+ (fun ω => ∑ a, B (Pi.single a 1) l * X ω a) := by
+ funext ω
+ exact regression_map_coordinate B (X ω) l
+ rw [heq, covariance_fun_sum_left (fun a => (hXi a).const_mul _) (hVi t)]
+ simp_rw [covariance_const_mul_left]
+ change (∑ a, sourceRegressionMapAt L r (Pi.single a 1) l *
+ covariance (fun ω => X ω a) (fun ω => V ω t) P) = _
+ simp only [sourceRegressionMapAt_single, Matrix.mul_apply, Matrix.transpose_apply]
+ apply Finset.sum_congr rfl
+ intro a _
+ congr 1
+ exact covariance_comm _ _
+ change covariance (fun ω => R ω i) (fun ω => V ω j - B (X ω) j) P = _
+ rw [covariance_fun_sub_right (hRi i) (hVi j) (hBi j),
+ covariance_comm (fun ω => R ω i) (fun ω => B (X ω) j), hBR j i, sub_zero]
+ change covariance (fun ω => V ω i - B (X ω) i) (fun ω => V ω j) P = _
+ rw [covariance_fun_sub_left (hVi i) (hBi i) (hVi j), hBV i j]
+ rfl
+
+lemma finiteGaussian_law_parameters {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} {n : ℕ} {Z : Ω → Fin n → ℝ}
+ (hZ : HasGaussianLaw Z P) (m : Fin n → ℝ) (hm : (∫ ω, Z ω ∂P) = m)
+ (S : Matrix (Fin n) (Fin n) ℝ)
+ (hcov : ∀ i j, covariance (fun ω => Z ω i) (fun ω => Z ω j) P = S i j) :
+ S.PosSemidef ∧ P.map (fun ω => toLp 2 (Z ω)) = multivariateGaussian (toLp 2 m) S := by
+ have : IsProbabilityMeasure P := hZ.isProbabilityMeasure
+ let e : (Fin n → ℝ) ≃L[ℝ] EuclideanSpace ℝ (Fin n) :=
+ (PiLp.continuousLinearEquiv 2 ℝ (fun _ : Fin n => ℝ)).symm
+ have hE : HasGaussianLaw (fun ω => toLp 2 (Z ω)) P := hZ.map_equiv_fun e
+ have : IsGaussian (P.map (fun ω => toLp 2 (Z ω))) := hE.isGaussian_map
+ have hZi (i : Fin n) : MemLp (fun ω => Z ω i) 2 P := (hZ.eval i).memLp_two
+ have hS : S.PosSemidef := by
+ apply Matrix.PosSemidef.of_dotProduct_mulVec_nonneg
+ · ext i j
+ simp only [Matrix.conjTranspose_apply, star_trivial]
+ rw [← hcov i j, ← hcov j i]
+ exact covariance_comm _ _
+ · intro x
+ have hp := covarianceBilin_self_nonneg
+ (μ := P.map (fun ω => toLp 2 (Z ω))) (toLp 2 x)
+ rw [covarianceBilin_apply_pi hZi] at hp
+ simpa [hcov, dotProduct, Matrix.mulVec, Finset.mul_sum, mul_assoc, mul_left_comm,
+ mul_comm] using hp
+ refine ⟨hS, ?_⟩
+ apply IsGaussian.ext
+ · simp only [id_eq]
+ rw [integral_id_multivariateGaussian]
+ rw [integral_map hE.aemeasurable (by fun_prop)]
+ change (∫ ω, e (Z ω) ∂P) = e m
+ rw [e.integral_comp_comm, hm]
+ · rw [← ContinuousLinearMap.toBilinForm_inj]
+ refine LinearMap.BilinForm.ext_basis (EuclideanSpace.basisFun (Fin n) ℝ).toBasis fun i j => ?_
+ simp only [ContinuousLinearMap.toBilinForm_apply]
+ change covarianceBilin (P.map (fun ω => toLp 2 (Z ω)))
+ (EuclideanSpace.basisFun (Fin n) ℝ i) (EuclideanSpace.basisFun (Fin n) ℝ j) =
+ covarianceBilin (multivariateGaussian (toLp 2 m) S)
+ (EuclideanSpace.basisFun (Fin n) ℝ i) (EuclideanSpace.basisFun (Fin n) ℝ j)
+ rw [covarianceBilin_apply_basisFun hZi, covarianceBilin_multivariateGaussian hS]
+ simpa using hcov i j
+
+/-- The actual adjusted-endpoint Schur covariance. -/
+def sourceEndpointSchurAt (L r : ℝ) : Matrix (Fin 6) (Fin 6) ℝ :=
+ sourceEndpointCovarianceAt L r -
+ sourceCrossCovarianceAt L r * (sourcePinCovarianceAt L r)⁻¹ * (sourceCrossCovarianceAt L r)ᵀ
+
+/-- Gaussianity is inherited from the actual jointly Gaussian pin/endpoint vector. -/
+theorem sourceEndpointResidual_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ HasGaussianLaw (sourceEndpointResidual L r) (smoothLaw 2 L) := by
+ have hR := (regression_residual_jointGaussian (sourcePins_adjusted_hasGaussianLaw hL r)
+ (sourceRegressionMapAt L r) 0 0).snd
+ unfold sourceEndpointResidual
+ simpa only [sub_zero] using hR
+
+/-- A literal posterior sample at a prescribed pin. -/
+def sourceEndpointPosterior (L r : ℝ) (x : Fin 6 → ℝ) (ω : SmoothSample 2 L) : Fin 6 → ℝ :=
+ sourceEndpointResidual L r ω + sourceRegressionMapAt L r x
+
+theorem sourceEndpointPosterior_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (x : Fin 6 → ℝ) : HasGaussianLaw (sourceEndpointPosterior L r x) (smoothLaw 2 L) := by
+ have hR := sourceEndpointResidual_hasGaussianLaw hL r
+ refine ⟨hR.aemeasurable.add aemeasurable_const, ?_⟩
+ have : IsGaussian ((smoothLaw 2 L).map (sourceEndpointResidual L r)) := hR.isGaussian_map
+ convert (inferInstance : IsGaussian (((smoothLaw 2 L).map (sourceEndpointResidual L r)).map
+ (fun v => v + sourceRegressionMapAt L r x))) using 1
+ rw [AEMeasurable.map_map_of_aemeasurable (by fun_prop) hR.aemeasurable]
+ rfl
+
+theorem sourceEndpointPosterior_integral {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (x : Fin 6 → ℝ) : (∫ ω, sourceEndpointPosterior L r x ω ∂smoothLaw 2 L) =
+ sourceRegressionMapAt L r x := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ unfold sourceEndpointPosterior
+ rw [integral_add (sourceEndpointResidual_hasGaussianLaw hL r).integrable (integrable_const _),
+ sourceEndpointResidual_integral_zero hL r, integral_const, zero_add]
+ simp
+
+theorem sourceEndpointPosterior_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) (i j : Fin 6) :
+ covariance (fun ω => sourceEndpointPosterior L r x ω i)
+ (fun ω => sourceEndpointPosterior L r x ω j) (smoothLaw 2 L) =
+ sourceEndpointSchurAt L r i j := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ have hR := sourceEndpointResidual_hasGaussianLaw hL r
+ change covariance (fun ω => sourceEndpointResidual L r ω i + sourceRegressionMapAt L r x i)
+ (fun ω => sourceEndpointResidual L r ω j + sourceRegressionMapAt L r x j) _ = _
+ rw [covariance_add_const_left (hR.eval i).integrable,
+ covariance_add_const_right (hR.eval j).integrable]
+ exact sourceEndpointResidual_covariance hL r hG i j
+
+/-- The canonical all-pin law is the literal posterior sampling map. -/
+theorem sourceEndpointKernel_eq_map_posterior {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (x : Fin 6 → ℝ) : sourceEndpointKernel L r x =
+ (smoothLaw 2 L).map (sourceEndpointPosterior L r x) := by
+ rw [sourceEndpointKernel_apply hL r x,
+ AEMeasurable.map_map_of_aemeasurable (by fun_prop)
+ (sourceEndpointResidual_hasGaussianLaw hL r).aemeasurable]
+ rfl
+
+theorem sourceEndpointKernel_isGaussian {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (x : Fin 6 → ℝ) : IsGaussian (sourceEndpointKernel L r x) := by
+ rw [sourceEndpointKernel_eq_map_posterior hL r x]
+ exact (sourceEndpointPosterior_hasGaussianLaw hL r x).isGaussian_map
+
+/-- Positive semidefiniteness follows from the actual residual covariance, including singular cases. -/
+theorem sourceEndpointSchurAt_posSemidef {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) : (sourceEndpointSchurAt L r).PosSemidef := by
+ exact (finiteGaussian_law_parameters (sourceEndpointPosterior_hasGaussianLaw hL r 0)
+ (sourceRegressionMapAt L r 0) (sourceEndpointPosterior_integral hL r 0)
+ (sourceEndpointSchurAt L r) (sourceEndpointPosterior_covariance hL r hG 0)).1
+
+/-- Exact literal multivariate Gaussian law at every prescribed pin, with no residual PSD premise. -/
+theorem sourceEndpointKernel_eq_multivariateGaussian {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) :
+ (sourceEndpointKernel L r x).map (toLp 2) =
+ multivariateGaussian (toLp 2 (sourceRegressionMapAt L r x)) (sourceEndpointSchurAt L r) := by
+ rw [sourceEndpointKernel_eq_map_posterior hL r x,
+ AEMeasurable.map_map_of_aemeasurable (by fun_prop)
+ (sourceEndpointPosterior_hasGaussianLaw hL r x).aemeasurable]
+ exact (finiteGaussian_law_parameters (sourceEndpointPosterior_hasGaussianLaw hL r x)
+ (sourceRegressionMapAt L r x) (sourceEndpointPosterior_integral hL r x)
+ (sourceEndpointSchurAt L r) (sourceEndpointPosterior_covariance hL r hG x)).2
+
+/-- The original Pi-space kernel mean is the actual regression mean. -/
+theorem sourceEndpointKernel_integral {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (x : Fin 6 → ℝ) : (∫ v, v ∂sourceEndpointKernel L r x) = sourceRegressionMapAt L r x := by
+ rw [sourceEndpointKernel_eq_map_posterior hL r x,
+ integral_map (sourceEndpointPosterior_hasGaussianLaw hL r x).aemeasurable (by fun_prop)]
+ exact sourceEndpointPosterior_integral hL r x
+
+/-- The original Pi-space kernel covariance is the derived actual Schur covariance. -/
+theorem sourceEndpointKernel_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) (i j : Fin 6) :
+ covariance (fun v => v i) (fun v => v j) (sourceEndpointKernel L r x) =
+ sourceEndpointSchurAt L r i j := by
+ rw [sourceEndpointKernel_eq_map_posterior hL r x,
+ covariance_map_fun (measurable_pi_apply i).aestronglyMeasurable
+ (measurable_pi_apply j).aestronglyMeasurable
+ (sourceEndpointPosterior_hasGaussianLaw hL r x).aemeasurable]
+ exact sourceEndpointPosterior_covariance hL r hG x i j
+
+end I4SourceEndpointParameters
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointRegression.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointRegression.lean
new file mode 100644
index 000000000..9e832ed60
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointRegression.lean
@@ -0,0 +1,206 @@
+import SourceConfluentPins
+import ResearchFormalCoreR1.GaussianRegressionKernel
+import Mathlib.LinearAlgebra.Matrix.ToLin
+
+/-!
+# Canonical regression kernel for actual adjusted endpoint observations
+
+The definitions are families in every real separation, so limits can be stated
+without dependent proof arguments. Their values at zero are not claimed to be
+contact limits. For nonzero period the actual pin/adjusted-endpoint pair is a
+linear image of the proved twelve-observation Gaussian vector.
+
+The only current algebraic premise in the regression theorem is invertibility
+of the actual pin covariance. The residual law and the conditional-law conclusion
+are derived. Values of the explicit kernel are specified at every pin vector.
+See `SOURCE_ENDPOINT_REGRESSION.md` for the frozen source contract.
+-/
+
+noncomputable section
+
+open I4SmoothCarrier I4SourceConfluentPins ResearchFormalCoreR1
+open MeasureTheory ProbabilityTheory Matrix
+open scoped BigOperators Matrix
+
+set_option autoImplicit false
+
+namespace I4SourceEndpointRegression
+
+/-- Actual confluent observations as a nondependent family in r. -/
+def sourceConfluentPinsAt (L r : ℝ) (ω : SmoothSample 2 L) : Fin 6 → ℝ :=
+ confluentTransform r (rawPins L r ω)
+
+@[simp] theorem sourceConfluentPinsAt_eq (L r : ℝ) (hr : r ≠ 0) :
+ sourceConfluentPinsAt L r = confluentPins L r hr := rfl
+
+/-- LM006 order `(xxM,xxS,xyM,xyS,yyM,yyS)`, with the confluent xx/xy pins subtracted. -/
+def sourceAdjustedEndpoints (L r : ℝ) (ω : SmoothSample 2 L) : Fin 6 → ℝ :=
+ let x := sourceConfluentPinsAt L r ω
+ let v := rawPinsWithHessians L r ω
+ ![(v 6 - x 3)/r, (v 9 - x 3)/r, (v 7 - x 4)/r, (v 10 - x 4)/r, v 8, v 11]
+
+/-- The actual pin covariance G. -/
+def sourcePinCovarianceAt (L r : ℝ) : Matrix (Fin 6) (Fin 6) ℝ :=
+ fun i j => covariance (fun ω => sourceConfluentPinsAt L r ω i)
+ (fun ω => sourceConfluentPinsAt L r ω j) (smoothLaw 2 L)
+
+/-- The actual adjusted-endpoint/pin cross covariance C, with endpoint rows. -/
+def sourceCrossCovarianceAt (L r : ℝ) : Matrix (Fin 6) (Fin 6) ℝ :=
+ fun i j => covariance (fun ω => sourceAdjustedEndpoints L r ω i)
+ (fun ω => sourceConfluentPinsAt L r ω j) (smoothLaw 2 L)
+
+/-- The actual adjusted endpoint covariance, without an assumed limiting model. -/
+def sourceEndpointCovarianceAt (L r : ℝ) : Matrix (Fin 6) (Fin 6) ℝ :=
+ fun i j => covariance (fun ω => sourceAdjustedEndpoints L r ω i)
+ (fun ω => sourceAdjustedEndpoints L r ω j) (smoothLaw 2 L)
+
+def sourceRegressionMatrixAt (L r : ℝ) : Matrix (Fin 6) (Fin 6) ℝ :=
+ sourceCrossCovarianceAt L r * (sourcePinCovarianceAt L r)⁻¹
+
+def sourceRegressionMapAt (L r : ℝ) : (Fin 6 → ℝ) →L[ℝ] (Fin 6 → ℝ) :=
+ (Matrix.toLin' (sourceRegressionMatrixAt L r)).toContinuousLinearMap
+
+/-- Deterministic twelve-observation map: no observation law is built into its definition. -/
+def endpointObservationMap (r : ℝ) :
+ (Fin 12 → ℝ) →L[ℝ] ((Fin 6 → ℝ) × (Fin 6 → ℝ)) where
+ toFun v :=
+ let x := confluentTransform r (fun i : Fin 6 => v (Fin.castAdd 6 i))
+ (x, ![(v 6 - x 3)/r, (v 9 - x 3)/r, (v 7 - x 4)/r, (v 10 - x 4)/r, v 8, v 11])
+ map_add' v w := by
+ ext i <;> fin_cases i <;> simp [confluentTransform] <;> ring
+ map_smul' c v := by
+ ext i <;> fin_cases i <;> simp [confluentTransform] <;> ring
+ cont := by
+ unfold confluentTransform
+ fun_prop
+
+lemma endpointObservationMap_actual (L r : ℝ) (ω : SmoothSample 2 L) :
+ endpointObservationMap r (rawPinsWithHessians L r ω) =
+ (sourceConfluentPinsAt L r ω, sourceAdjustedEndpoints L r ω) := by
+ have hp : (fun i : Fin 6 => rawPinsWithHessians L r ω (Fin.castAdd 6 i)) =
+ rawPins L r ω := by
+ ext i
+ fin_cases i <;> rfl
+ change (confluentTransform r _, _) = _
+ simp only [hp]
+ rfl
+
+/-- The actual joint Gaussian law is a proved image of the actual twelve derivative observations. -/
+theorem sourcePins_adjusted_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ HasGaussianLaw (fun ω => (sourceConfluentPinsAt L r ω, sourceAdjustedEndpoints L r ω))
+ (smoothLaw 2 L) := by
+ have hG := (rawPinsWithHessians_hasGaussianLaw hL r).map_fun (endpointObservationMap r)
+ apply hG.congr
+ filter_upwards with ω
+ exact endpointObservationMap_actual L r ω
+
+@[simp] theorem sourceRegressionMapAt_apply (L r : ℝ) (x : Fin 6 → ℝ) :
+ sourceRegressionMapAt L r x = sourceRegressionMatrixAt L r *ᵥ x := rfl
+
+@[simp] theorem sourceRegressionMapAt_single (L r : ℝ) (l j : Fin 6) :
+ sourceRegressionMapAt L r (Pi.single l 1) j = sourceRegressionMatrixAt L r j l := by
+ simp [sourceRegressionMapAt]
+
+/-- The matrix inverse derives the regression normal equations for these actual observations. -/
+theorem sourceRegression_normal_equations (L r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ ∀ i j, covariance (fun ω => sourceConfluentPinsAt L r ω i)
+ (fun ω => sourceAdjustedEndpoints L r ω j) (smoothLaw 2 L) =
+ ∑ l, sourceRegressionMapAt L r (Pi.single l 1) j *
+ covariance (fun ω => sourceConfluentPinsAt L r ω i)
+ (fun ω => sourceConfluentPinsAt L r ω l) (smoothLaw 2 L) := by
+ let _ : Invertible (sourcePinCovarianceAt L r) := hG.invertible
+ have hprod : sourceCrossCovarianceAt L r * (sourcePinCovarianceAt L r)⁻¹ *
+ sourcePinCovarianceAt L r = sourceCrossCovarianceAt L r :=
+ Matrix.inv_mul_cancel_right_of_invertible _ _
+ intro i j
+ calc
+ covariance (fun ω => sourceConfluentPinsAt L r ω i)
+ (fun ω => sourceAdjustedEndpoints L r ω j) (smoothLaw 2 L) =
+ sourceCrossCovarianceAt L r j i := covariance_comm _ _
+ _ = ∑ l, sourceRegressionMatrixAt L r j l * sourcePinCovarianceAt L r l i :=
+ (congrArg (fun M => M j i) hprod).symm
+ _ = ∑ l, sourceRegressionMapAt L r (Pi.single l 1) j *
+ covariance (fun ω => sourceConfluentPinsAt L r ω i)
+ (fun ω => sourceConfluentPinsAt L r ω l) (smoothLaw 2 L) := by
+ apply Finset.sum_congr rfl
+ intro l _
+ rw [sourceRegressionMapAt_single]
+ congr 1
+ exact covariance_comm _ _
+
+/-- The actual affine regression residual, with no assumed residual law. -/
+def sourceEndpointResidual (L r : ℝ) (ω : SmoothSample 2 L) : Fin 6 → ℝ :=
+ sourceAdjustedEndpoints L r ω - sourceRegressionMapAt L r (sourceConfluentPinsAt L r ω)
+
+/-- The canonical actual endpoint kernel, specified at every pin value. -/
+def sourceEndpointKernel (L r : ℝ) : Kernel (Fin 6 → ℝ) (Fin 6 → ℝ) :=
+ regressionKernel ((smoothLaw 2 L).map (sourceEndpointResidual L r))
+ (sourceRegressionMapAt L r) 0 0
+
+theorem sourceEndpointKernel_markov {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ IsMarkovKernel (sourceEndpointKernel L r) := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ unfold sourceEndpointKernel
+ infer_instance
+
+theorem sourceEndpointKernel_measurable (L r : ℝ) : Measurable (sourceEndpointKernel L r) :=
+ Kernel.measurable _
+
+/-- The all-pin pushforward identity includes every probability-zero prescribed pin vector. -/
+theorem sourceEndpointKernel_apply {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ) :
+ sourceEndpointKernel L r x =
+ ((smoothLaw 2 L).map (sourceEndpointResidual L r)).map
+ (fun v => v + sourceRegressionMapAt L r x) := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ simpa [sourceEndpointKernel] using
+ regressionKernel_apply ((smoothLaw 2 L).map (sourceEndpointResidual L r))
+ (sourceRegressionMapAt L r) 0 0 x
+
+/-- The actual target's conditional law, with Gaussian residual hypotheses derived rather than assumed.
+Current pin-covariance invertibility is the sole algebraic premise. -/
+theorem sourceEndpointKernel_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ HasCondDistrib (sourceAdjustedEndpoints L r) (sourceConfluentPinsAt L r)
+ (sourceEndpointKernel L r) (smoothLaw 2 L) := by
+ have hcond := gaussianRegression_observed_hasCondDistrib
+ (sourcePins_adjusted_hasGaussianLaw hL r) (sourceRegressionMapAt L r) 0 0
+ (sourceRegression_normal_equations L r hG)
+ unfold sourceEndpointKernel sourceEndpointResidual
+ simpa only [sub_zero] using hcond
+
+/-- Combined canonical law for the actual pins and adjusted endpoint vector. -/
+theorem sourceEndpointKernel_spec {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ IsMarkovKernel (sourceEndpointKernel L r) ∧
+ Measurable (sourceEndpointKernel L r) ∧
+ (∀ x, sourceEndpointKernel L r x =
+ ((smoothLaw 2 L).map (sourceEndpointResidual L r)).map
+ (fun v => v + sourceRegressionMapAt L r x)) ∧
+ HasCondDistrib (sourceAdjustedEndpoints L r) (sourceConfluentPinsAt L r)
+ (sourceEndpointKernel L r) (smoothLaw 2 L) :=
+ ⟨sourceEndpointKernel_markov hL r, sourceEndpointKernel_measurable L r,
+ sourceEndpointKernel_apply hL r, sourceEndpointKernel_hasCondDistrib hL r hG⟩
+
+/-- The literal physical normalized endpoint vector in LM006 order. -/
+def sourceNormalizedEndpoints (L r : ℝ) (ω : SmoothSample 2 L) : Fin 6 → ℝ :=
+ let v := rawPinsWithHessians L r ω
+ ![v 6/r, v 9/r, v 7/r, v 10/r, v 8, v 11]
+
+def sourcePrescribedPins (r b : ℝ) : Fin 6 → ℝ := ![b-r^3/12,0,0,0,0,2]
+
+/-- On the two zero xx/xy pin coordinates, adjusted entries are exactly physical normalized entries. -/
+theorem sourceAdjustedEndpoints_on_pin_fiber (L r : ℝ) (ω : SmoothSample 2 L)
+ (h3 : sourceConfluentPinsAt L r ω 3 = 0) (h4 : sourceConfluentPinsAt L r ω 4 = 0) :
+ sourceAdjustedEndpoints L r ω = sourceNormalizedEndpoints L r ω := by
+ simp [sourceAdjustedEndpoints, sourceNormalizedEndpoints, h3, h4]
+
+/-- Exact deterministic reconstruction at the prescribed pin fiber, without choosing an arbitrary RCD. -/
+theorem sourceAdjustedEndpoints_on_prescribed (L r b : ℝ) (ω : SmoothSample 2 L)
+ (hp : sourceConfluentPinsAt L r ω = sourcePrescribedPins r b) :
+ sourceAdjustedEndpoints L r ω = sourceNormalizedEndpoints L r ω := by
+ apply sourceAdjustedEndpoints_on_pin_fiber
+ · simpa [sourcePrescribedPins] using congrFun hp 3
+ · simpa [sourcePrescribedPins] using congrFun hp 4
+
+end I4SourceEndpointRegression
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourcePhysicalEndpointKernel.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourcePhysicalEndpointKernel.lean
new file mode 100644
index 000000000..5b345c2f1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourcePhysicalEndpointKernel.lean
@@ -0,0 +1,131 @@
+import SourceEndpointParameters
+
+/-!
+# Canonical physical endpoint law at every prescribed null pin
+
+The physical and adjusted endpoint vectors differ by a literal pin-dependent
+linear correction. Both canonical kernels use the same actual residual law.
+The correction vanishes at the prescribed vector, proving equality there as
+literal measures. This argument does not substitute an arbitrary conditional
+law version at a zero-probability fiber. See `SOURCE_PHYSICAL_ENDPOINT_KERNEL.md`.
+-/
+
+noncomputable section
+
+open I4SmoothCarrier I4SourceEndpointRegression I4SourceEndpointParameters ResearchFormalCoreR1
+open MeasureTheory ProbabilityTheory Matrix
+open scoped BigOperators Matrix
+
+set_option autoImplicit false
+
+namespace I4SourcePhysicalEndpointKernel
+
+/-- The literal correction from adjusted entries to physical normalized endpoint entries. -/
+def sourcePhysicalCorrection (r : ℝ) : (Fin 6 → ℝ) →L[ℝ] (Fin 6 → ℝ) where
+ toFun x := ![x 3/r, x 3/r, x 4/r, x 4/r, 0, 0]
+ map_add' x y := by ext i; fin_cases i <;> simp <;> ring
+ map_smul' c x := by ext i; fin_cases i <;> simp <;> ring
+ cont := by fun_prop
+
+def sourcePhysicalRegressionMap (L r : ℝ) : (Fin 6 → ℝ) →L[ℝ] (Fin 6 → ℝ) :=
+ sourceRegressionMapAt L r + sourcePhysicalCorrection r
+
+/-- A pointwise identity for the actual source observations, at every separation. -/
+theorem sourceNormalizedEndpoints_eq_adjusted (L r : ℝ) (ω : SmoothSample 2 L) :
+ sourceNormalizedEndpoints L r ω =
+ sourceAdjustedEndpoints L r ω + sourcePhysicalCorrection r (sourceConfluentPinsAt L r ω) := by
+ ext i
+ fin_cases i <;> simp [sourceNormalizedEndpoints, sourceAdjustedEndpoints, sourcePhysicalCorrection]
+ all_goals ring
+
+/-- The physical canonical kernel retains exactly the same actual adjusted residual law. -/
+def sourcePhysicalEndpointKernel (L r : ℝ) : Kernel (Fin 6 → ℝ) (Fin 6 → ℝ) :=
+ regressionKernel ((smoothLaw 2 L).map (sourceEndpointResidual L r))
+ (sourcePhysicalRegressionMap L r) 0 0
+
+theorem sourcePhysicalEndpointKernel_markov {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ IsMarkovKernel (sourcePhysicalEndpointKernel L r) := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ unfold sourcePhysicalEndpointKernel
+ infer_instance
+
+theorem sourcePhysicalEndpointKernel_measurable (L r : ℝ) :
+ Measurable (sourcePhysicalEndpointKernel L r) := Kernel.measurable _
+
+/-- Its all-pin pushforward is literal, rather than an almost-everywhere kernel identity. -/
+theorem sourcePhysicalEndpointKernel_apply {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ) :
+ sourcePhysicalEndpointKernel L r x =
+ ((smoothLaw 2 L).map (sourceEndpointResidual L r)).map
+ (fun v => v + sourceRegressionMapAt L r x + sourcePhysicalCorrection r x) := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ simpa only [sourcePhysicalEndpointKernel, sourcePhysicalRegressionMap, sub_zero, add_zero,
+ _root_.add_apply, add_assoc] using
+ regressionKernel_apply ((smoothLaw 2 L).map (sourceEndpointResidual L r))
+ (sourcePhysicalRegressionMap L r) 0 0 x
+
+/-- The physical observations have this canonical conditional law, derived from the actual residual. -/
+theorem sourcePhysicalEndpointKernel_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ HasCondDistrib (sourceNormalizedEndpoints L r) (sourceConfluentPinsAt L r)
+ (sourcePhysicalEndpointKernel L r) (smoothLaw 2 L) := by
+ have hXV := sourcePins_adjusted_hasGaussianLaw hL r
+ have hXR : HasGaussianLaw (fun ω =>
+ (sourceConfluentPinsAt L r ω, sourceEndpointResidual L r ω)) (smoothLaw 2 L) := by
+ unfold sourceEndpointResidual
+ simpa only [sub_zero] using regression_residual_jointGaussian hXV (sourceRegressionMapAt L r) 0 0
+ have hzero : ∀ i j, covariance (fun ω => sourceConfluentPinsAt L r ω i)
+ (fun ω => sourceEndpointResidual L r ω j) (smoothLaw 2 L) = 0 := by
+ unfold sourceEndpointResidual
+ simpa only [sub_zero] using regression_residual_zero_covariance hXV
+ (sourceRegressionMapAt L r) 0 0 (sourceRegression_normal_equations L r hG)
+ have hcond := gaussianRegression_hasCondDistrib hXR hzero (sourcePhysicalRegressionMap L r) 0 0
+ unfold sourcePhysicalEndpointKernel
+ convert hcond using 1
+ funext ω
+ rw [sourceNormalizedEndpoints_eq_adjusted]
+ simp only [add_zero, sub_zero, sourceEndpointResidual, sourcePhysicalRegressionMap,
+ _root_.add_apply]
+ abel
+
+/-- The explicit physical correction is zero at every prescribed pin, for arbitrary height. -/
+theorem sourcePhysicalCorrection_prescribed (r b : ℝ) :
+ sourcePhysicalCorrection r (sourcePrescribedPins r b) = 0 := by
+ ext i
+ fin_cases i <;> simp [sourcePhysicalCorrection, sourcePrescribedPins]
+
+/-- Equality at the prescribed null pin is equality of the two literal canonical measures. -/
+theorem sourcePhysicalEndpointKernel_at_prescribed {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :
+ sourcePhysicalEndpointKernel L r (sourcePrescribedPins r b) =
+ sourceEndpointKernel L r (sourcePrescribedPins r b) := by
+ rw [sourcePhysicalEndpointKernel_apply hL, sourceEndpointKernel_apply hL,
+ sourcePhysicalCorrection_prescribed]
+ simp only [add_zero]
+
+/-- The physical kernel has the extra pin-dependent correction in its mean away from the prescribed fiber. -/
+theorem sourcePhysicalEndpointKernel_integral {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ) :
+ (∫ v, v ∂sourcePhysicalEndpointKernel L r x) =
+ sourceRegressionMapAt L r x + sourcePhysicalCorrection r x := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ have hR := sourceEndpointResidual_hasGaussianLaw hL r
+ rw [sourcePhysicalEndpointKernel_apply hL r x,
+ integral_map (by fun_prop) (by fun_prop), integral_map hR.aemeasurable (by fun_prop)]
+ rw [integral_add (f := fun ω => sourceEndpointResidual L r ω + sourceRegressionMapAt L r x)
+ (g := fun _ => sourcePhysicalCorrection r x)
+ (hR.integrable.add (integrable_const _)) (integrable_const _),
+ integral_add hR.integrable (integrable_const _), sourceEndpointResidual_integral_zero hL r]
+ simp
+
+/-- All-point physical kernel specification; no residual hypothesis is assumed. -/
+theorem sourcePhysicalEndpointKernel_spec {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ IsMarkovKernel (sourcePhysicalEndpointKernel L r) ∧
+ Measurable (sourcePhysicalEndpointKernel L r) ∧
+ (∀ x, sourcePhysicalEndpointKernel L r x =
+ ((smoothLaw 2 L).map (sourceEndpointResidual L r)).map
+ (fun v => v + sourceRegressionMapAt L r x + sourcePhysicalCorrection r x)) ∧
+ HasCondDistrib (sourceNormalizedEndpoints L r) (sourceConfluentPinsAt L r)
+ (sourcePhysicalEndpointKernel L r) (smoothLaw 2 L) :=
+ ⟨sourcePhysicalEndpointKernel_markov hL r, sourcePhysicalEndpointKernel_measurable L r,
+ sourcePhysicalEndpointKernel_apply hL r, sourcePhysicalEndpointKernel_hasCondDistrib hL r hG⟩
+
+end I4SourcePhysicalEndpointKernel
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceSmoothConditionalKernel.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceSmoothConditionalKernel.lean
new file mode 100644
index 000000000..1eac792ee
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceSmoothConditionalKernel.lean
@@ -0,0 +1,720 @@
+import SourceEndpointEstimates
+import Mathlib.Probability.Independence.Process.Basic
+import Mathlib.MeasureTheory.MeasurableSpace.Embedding
+
+/-!
+# Canonical conditioning on the actual smooth coefficient carrier
+
+The literal coefficient shift preserves every source summability order. Its
+pushforward kernel is specified for every pin value, including null pins.
+Actual finite Gaussian coefficient laws establish residual-process independence;
+no full-carrier conditional law or independence conclusion is assumed.
+
+Source: SOURCE_SMOOTH_CONDITIONAL.md. OpenAI/Codex author-side proof work;
+independent scientific review and geometric Palm identification are separate.
+Carrier support coauthored by /root/normalizer_palm_research with
+/root/normalizer_palm_research/gaussian_reference_probe, supplied as compiled
+scratch CarrierShift.lean.
+-/
+
+noncomputable section
+
+open I4Foundation I4Source I4Smooth I4SmoothCarrier I4SourceGaussian
+open I4SourceDerivativeGaussian I4SourceDerivativeContinuity I4SourceConfluentLimits
+open I4SourceEndpointRegression I4ContactGram MeasureTheory ProbabilityTheory Matrix
+open scoped BigOperators
+set_option autoImplicit false
+
+namespace I4SourceSmoothConditional
+
+def zeroSample (d : ℕ) (L : ℝ) : SmoothSample d L :=
+ ⟨fun _ => 0, by
+ intro n
+ simpa only [Pi.zero_apply, abs_zero, mul_zero] using
+ (summable_zero : Summable (fun _ : SourceMode d => (0 : ℝ)))⟩
+
+theorem exists_measurable_sampleProjection (d : ℕ) (L : ℝ) :
+ ∃ q : (SourceMode d → ℝ) → SmoothSample d L,
+ Measurable q ∧ ∀ ω : SmoothSample d L, q (sampleInclusion d L ω) = ω := by
+ exact (goodSet_measurable d L).exists_measurable_proj
+ ⟨(zeroSample d L).val, (zeroSample d L).property⟩
+
+theorem goodSample_add {d : ℕ} {L : ℝ}
+ (ω η : SourceMode d → ℝ) (hω : goodSample d L ω) (hη : goodSample d L η) :
+ goodSample d L (ω + η) := by
+ intro n
+ apply Summable.of_nonneg_of_le
+ (fun m => mul_nonneg (orderModeBound_nonneg n d L m) (abs_nonneg _))
+ (fun m => ?_) ((hω n).add (hη n))
+ change orderModeBound n d L m * |ω m + η m| ≤
+ orderModeBound n d L m * |ω m| + orderModeBound n d L m * |η m|
+ rw [← mul_add]
+ exact mul_le_mul_of_nonneg_left (abs_add_le _ _) (orderModeBound_nonneg n d L m)
+
+theorem goodSample_neg {d : ℕ} {L : ℝ}
+ (ω : SourceMode d → ℝ) (hω : goodSample d L ω) : goodSample d L (-ω) := by
+ intro n
+ simpa only [Pi.neg_apply, abs_neg] using hω n
+
+
+theorem derivativeCoefficient_weighted_summable {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample 2 L) (k : ℕ) (x : Fin 2 → ℝ) (u : Fin k → (Fin 2 → ℝ)) :
+ Summable (fun m => derivativeCoefficient 2 L k x u m * sampleInclusion 2 L ω m) := by
+ apply ((ω.property k).mul_right (∏ j, ‖u j‖)).of_norm_bounded
+ intro m
+ rw [norm_mul, Real.norm_eq_abs]
+ calc
+ _ ≤ derivativeMajorant 2 L k u m * |sampleInclusion 2 L ω m| :=
+ mul_le_mul_of_nonneg_right (derivativeCoefficient_bound 2 hL k u m x) (abs_nonneg _)
+ _ = (orderModeBound k 2 L m * |sampleInclusion 2 L ω m|) * ∏ j, ‖u j‖ := by
+ unfold derivativeMajorant
+ ring
+
+theorem finiteCoefficient_weighted_summable {ι : Type*} {n q : ℕ}
+ (a : Fin n → ι → ℝ) (ω : ι → ℝ)
+ (ha : ∀ i, Summable (fun m => a i m * ω m))
+ (T : (Fin n → ℝ) →L[ℝ] (Fin q → ℝ)) (j : Fin q) :
+ Summable (fun m => T (fun i => a i m) j * ω m) := by
+ have hs : HasSum (fun m i => a i m * ω m) (fun i => ∑' m, a i m * ω m) :=
+ Pi.hasSum.mpr (fun i => (ha i).hasSum)
+ have ht := hs.map T.toAddMonoidHom T.continuous
+ convert (Pi.hasSum.mp ht j).summable using 1
+ funext m
+ have hm : (fun i => a i m * ω m) = ω m • (fun i => a i m) := by
+ funext i
+ simp only [Pi.smul_apply, smul_eq_mul, mul_comm]
+ change T (fun i => a i m) j * ω m = T (fun i => a i m * ω m) j
+ rw [hm, map_smul]
+ exact mul_comm _ _
+
+theorem pinCoefficient_weighted_summable {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (ω : SmoothSample 2 L) (i : Fin 6) :
+ Summable (fun m => pinCoefficient L r i m * sampleInclusion 2 L ω m) :=
+ finiteCoefficient_weighted_summable (rawDerivativeCoefficient L r)
+ (sampleInclusion 2 L ω)
+ (fun j => derivativeCoefficient_weighted_summable hL ω (rawDerivativeOrder j)
+ (rawDerivativePoint r j) (rawDerivativeDirections j)) (pinObservationMap r) i
+
+theorem adjustedCoefficient_weighted_summable {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (ω : SmoothSample 2 L) (i : Fin 6) :
+ Summable (fun m => adjustedCoefficient L r i m * sampleInclusion 2 L ω m) :=
+ finiteCoefficient_weighted_summable (rawDerivativeCoefficient L r)
+ (sampleInclusion 2 L ω)
+ (fun j => derivativeCoefficient_weighted_summable hL ω (rawDerivativeOrder j)
+ (rawDerivativePoint r j) (rawDerivativeDirections j)) (adjustedObservationMap r) i
+
+theorem sourceConfluentPinsAt_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ Measurable (sourceConfluentPinsAt L r) := by
+ have heq : sourceConfluentPinsAt L r =
+ fun ω i => scalarSeries (pinCoefficient L r i) (sampleInclusion 2 L ω) := by
+ funext ω
+ exact sourceConfluentPinsAt_series hL r ω
+ rw [heq]
+ exact Measurable.of_eval (fun i =>
+ (scalarSeries_measurable _).comp (sampleInclusion_measurable 2 L))
+
+theorem sourceAdjustedEndpoints_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ Measurable (sourceAdjustedEndpoints L r) := by
+ have heq : sourceAdjustedEndpoints L r =
+ fun ω i => scalarSeries (adjustedCoefficient L r i) (sampleInclusion 2 L ω) := by
+ funext ω
+ exact sourceAdjustedEndpoints_series hL r ω
+ rw [heq]
+ exact Measurable.of_eval (fun i =>
+ (scalarSeries_measurable _).comp (sampleInclusion_measurable 2 L))
+
+def pinLift (L r : ℝ) (y : Fin 6 → ℝ) (m : SourceMode 2) : ℝ :=
+ ∑ i, pinCoefficient L r i m * (((sourcePinCovarianceAt L r)⁻¹ *ᵥ y) i)
+
+theorem pinLift_zero (L r : ℝ) : pinLift L r 0 = 0 := by
+ funext m
+ simp [pinLift]
+
+theorem pinLift_add (L r : ℝ) (x y : Fin 6 → ℝ) :
+ pinLift L r (x + y) = pinLift L r x + pinLift L r y := by
+ funext m
+ simp [pinLift, Matrix.mulVec_add, mul_add, Finset.sum_add_distrib]
+
+theorem pinLift_neg (L r : ℝ) (x : Fin 6 → ℝ) :
+ pinLift L r (-x) = -pinLift L r x := by
+ funext m
+ simp [pinLift, Matrix.mulVec_neg]
+
+theorem pinLift_goodSample {L : ℝ} (hL : L ≠ 0) (r : ℝ) (y : Fin 6 → ℝ) :
+ goodSample 2 L (pinLift L r y) := by
+ intro n
+ have hprod (i : Fin 6) : Summable (fun m =>
+ orderModeBound n 2 L m * |pinCoefficient L r i m|) :=
+ coefficient_product_summable (orderModeBound_summable n 2 hL)
+ (pinCoefficient_summable hL r i).abs
+ have hs : Summable (fun m => ∑ i,
+ (orderModeBound n 2 L m * |pinCoefficient L r i m|) *
+ |((sourcePinCovarianceAt L r)⁻¹ *ᵥ y) i|) :=
+ summable_sum (fun i _ => (hprod i).mul_right _)
+ apply Summable.of_nonneg_of_le (fun m =>
+ mul_nonneg (orderModeBound_nonneg n 2 L m) (abs_nonneg _)) _ hs
+ intro m
+ calc
+ _ ≤ orderModeBound n 2 L m *
+ ∑ i, |pinCoefficient L r i m * (((sourcePinCovarianceAt L r)⁻¹ *ᵥ y) i)| :=
+ mul_le_mul_of_nonneg_left (Finset.abs_sum_le_sum_abs _ _) (orderModeBound_nonneg n 2 L m)
+ _ = _ := by simp only [abs_mul, Finset.mul_sum, mul_assoc]
+
+theorem pinLift_measurable (L r : ℝ) : Measurable (pinLift L r) := by
+ apply Measurable.of_eval
+ intro m
+ unfold pinLift
+ fun_prop
+
+def addLift {L : ℝ} (hL : L ≠ 0) (r : ℝ) (y : Fin 6 → ℝ)
+ (ω : SmoothSample 2 L) : SmoothSample 2 L :=
+ ⟨sampleInclusion 2 L ω + pinLift L r y,
+ goodSample_add _ _ ω.property (pinLift_goodSample hL r y)⟩
+
+@[simp] theorem addLift_val {L : ℝ} (hL : L ≠ 0) (r : ℝ) (y : Fin 6 → ℝ)
+ (ω : SmoothSample 2 L) (m : SourceMode 2) :
+ (addLift hL r y ω).val m = ω.val m + pinLift L r y m := rfl
+
+theorem addLift_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ Measurable (fun p : (Fin 6 → ℝ) × SmoothSample 2 L => addLift hL r p.1 p.2) := by
+ unfold addLift
+ apply Measurable.subtype_mk
+ exact ((sampleInclusion_measurable 2 L).comp measurable_snd).add
+ ((pinLift_measurable L r).comp measurable_fst)
+
+def posteriorSample {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ)
+ (ω : SmoothSample 2 L) : SmoothSample 2 L :=
+ addLift hL r (x - sourceConfluentPinsAt L r ω) ω
+
+@[simp] theorem posteriorSample_val {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ)
+ (ω : SmoothSample 2 L) (m : SourceMode 2) :
+ (posteriorSample hL r x ω).val m = ω.val m +
+ pinLift L r (x - sourceConfluentPinsAt L r ω) m := rfl
+
+theorem posteriorSample_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ Measurable (fun p : (Fin 6 → ℝ) × SmoothSample 2 L => posteriorSample hL r p.1 p.2) := by
+ exact (addLift_measurable hL r).comp
+ ((measurable_fst.sub ((sourceConfluentPinsAt_measurable hL r).comp measurable_snd)).prodMk
+ measurable_snd)
+
+end I4SourceSmoothConditional
+
+namespace I4SourceSmoothConditional
+
+lemma scalarSeries_add_finiteShift {ι : Type*} {n : ℕ}
+ (a : ι → ℝ) (b : Fin n → ι → ℝ) (ω : ι → ℝ) (c : Fin n → ℝ)
+ (ha : Summable a) (hb : ∀ j, Summable (b j))
+ (hω : Summable (fun m => a m * ω m)) :
+ scalarSeries a (fun m => ω m + ∑ j, b j m * c j) =
+ scalarSeries a ω + ∑ j, (∑' m, a m * b j m) * c j := by
+ have hs : HasSum (fun m => ∑ j, (a m * b j m) * c j)
+ (∑ j, (∑' m, a m * b j m) * c j) :=
+ hasSum_sum (fun j _ => ((coefficient_product_summable ha (hb j)).hasSum).mul_right (c j))
+ have ht := hω.hasSum.add hs
+ change (∑' m, a m * (ω m + ∑ j, b j m * c j)) =
+ (∑' m, a m * ω m) + ∑ j, (∑' m, a m * b j m) * c j
+ convert ht.tsum_eq using 1
+ apply tsum_congr
+ intro m
+ rw [mul_add, Finset.mul_sum]
+ congr 1
+ apply Finset.sum_congr rfl
+ intro j _
+ ring
+
+end I4SourceSmoothConditional
+
+
+namespace I4SourceSmoothConditional
+
+theorem sourceConfluentPinsAt_addLift {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (y : Fin 6 → ℝ) (ω : SmoothSample 2 L) :
+ sourceConfluentPinsAt L r (addLift hL r y ω) = sourceConfluentPinsAt L r ω +
+ sourcePinCovarianceAt L r *ᵥ ((sourcePinCovarianceAt L r)⁻¹ *ᵥ y) := by
+ ext i
+ rw [sourceConfluentPinsAt_series hL r (addLift hL r y ω),
+ sourceConfluentPinsAt_series hL r ω]
+ change scalarSeries (pinCoefficient L r i)
+ (fun m => sampleInclusion 2 L ω m + ∑ j,
+ pinCoefficient L r j m * (((sourcePinCovarianceAt L r)⁻¹ *ᵥ y) j)) =
+ scalarSeries (pinCoefficient L r i) (sampleInclusion 2 L ω) + _
+ rw [scalarSeries_add_finiteShift _ _ _ _ (pinCoefficient_summable hL r i)
+ (pinCoefficient_summable hL r) (pinCoefficient_weighted_summable hL r ω i)]
+ simp_rw [← sourcePinCovarianceAt_coefficient hL r]
+ rfl
+
+theorem sourceAdjustedEndpoints_addLift {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (y : Fin 6 → ℝ) (ω : SmoothSample 2 L) :
+ sourceAdjustedEndpoints L r (addLift hL r y ω) = sourceAdjustedEndpoints L r ω +
+ sourceRegressionMapAt L r y := by
+ ext i
+ rw [sourceAdjustedEndpoints_series hL r (addLift hL r y ω),
+ sourceAdjustedEndpoints_series hL r ω]
+ change scalarSeries (adjustedCoefficient L r i)
+ (fun m => sampleInclusion 2 L ω m + ∑ j,
+ pinCoefficient L r j m * (((sourcePinCovarianceAt L r)⁻¹ *ᵥ y) j)) =
+ scalarSeries (adjustedCoefficient L r i) (sampleInclusion 2 L ω) + _
+ rw [scalarSeries_add_finiteShift _ _ _ _ (adjustedCoefficient_summable hL r i)
+ (pinCoefficient_summable hL r) (adjustedCoefficient_weighted_summable hL r ω i)]
+ simp_rw [← sourceCrossCovarianceAt_coefficient hL r]
+ change _ = _ + ((sourceCrossCovarianceAt L r * (sourcePinCovarianceAt L r)⁻¹) *ᵥ y) i
+ rw [← Matrix.mulVec_mulVec]
+ rfl
+
+theorem sourceConfluentPinsAt_posteriorSample {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ)
+ (ω : SmoothSample 2 L) :
+ sourceConfluentPinsAt L r (posteriorSample hL r x ω) = x := by
+ let _ : Invertible (sourcePinCovarianceAt L r) := hG.invertible
+ rw [posteriorSample, sourceConfluentPinsAt_addLift hL r,
+ Matrix.mulVec_mulVec, Matrix.mul_inv_of_invertible, Matrix.one_mulVec]
+ abel
+
+theorem sourceAdjustedEndpoints_posteriorSample {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (x : Fin 6 → ℝ) (ω : SmoothSample 2 L) :
+ sourceAdjustedEndpoints L r (posteriorSample hL r x ω) =
+ sourceAdjustedEndpoints L r ω +
+ sourceRegressionMapAt L r (x - sourceConfluentPinsAt L r ω) :=
+ sourceAdjustedEndpoints_addLift hL r _ ω
+
+end I4SourceSmoothConditional
+
+open I4SourceEndpointParameters I4SourceEndpointEstimates ResearchFormalCoreR1 Filter
+open scoped Topology
+
+namespace I4SourceSmoothConditional
+
+/-- The literal coefficient-shift law, specified at every pin value. -/
+def sourceSmoothKernel {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ Kernel (Fin 6 → ℝ) (SmoothSample 2 L) :=
+ ((Kernel.id : Kernel (Fin 6 → ℝ) (Fin 6 → ℝ)) ×ₖ
+ Kernel.const (Fin 6 → ℝ) (smoothLaw 2 L)).map
+ (fun p => posteriorSample hL r p.1 p.2)
+
+instance sourceSmoothKernel_isMarkov {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ IsMarkovKernel (sourceSmoothKernel hL r) := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ exact Kernel.IsMarkovKernel.map _ (posteriorSample_measurable hL r)
+
+theorem sourceSmoothKernel_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ Measurable (sourceSmoothKernel hL r) := Kernel.measurable _
+
+/-- Exact sampling formula, including every probability-zero pin. -/
+theorem sourceSmoothKernel_apply {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ) :
+ sourceSmoothKernel hL r x = (smoothLaw 2 L).map (posteriorSample hL r x) := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ rw [sourceSmoothKernel, Kernel.map_apply _ (posteriorSample_measurable hL r),
+ Kernel.prod_apply, Kernel.id_apply, Kernel.const_apply, Measure.dirac_prod,
+ Measure.map_map (posteriorSample_measurable hL r) (by fun_prop)]
+ rfl
+
+theorem sourceSmoothKernel_pin_map {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) :
+ (sourceSmoothKernel hL r x).map (sourceConfluentPinsAt L r) = Measure.dirac x := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ have hp : Measurable (posteriorSample hL r x) :=
+ (posteriorSample_measurable hL r).comp (measurable_const.prodMk measurable_id)
+ rw [sourceSmoothKernel_apply hL r x,
+ Measure.map_map (sourceConfluentPinsAt_measurable hL r) hp]
+ have heq : sourceConfluentPinsAt L r ∘ posteriorSample hL r x = fun _ => x := by
+ funext ω
+ exact sourceConfluentPinsAt_posteriorSample hL r hG x ω
+ rw [heq]
+ simp
+
+theorem sourceSmoothKernel_pin_fiber {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) :
+ sourceSmoothKernel hL r x {ω | sourceConfluentPinsAt L r ω = x} = 1 := by
+ calc
+ _ = ((sourceSmoothKernel hL r x).map (sourceConfluentPinsAt L r)) {x} := by
+ rw [Measure.map_apply (sourceConfluentPinsAt_measurable hL r)
+ (measurableSet_singleton x)]
+ rfl
+ _ = 1 := by rw [sourceSmoothKernel_pin_map hL r hG x]; simp
+
+/-- The actual endpoint kernel is the marginal of the full coefficient shift
+at every pin, including prescribed null pins. -/
+theorem sourceSmoothKernel_endpoint_map {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (x : Fin 6 → ℝ) :
+ (sourceSmoothKernel hL r x).map (sourceAdjustedEndpoints L r) =
+ sourceEndpointKernel L r x := by
+ have hp : Measurable (posteriorSample hL r x) :=
+ (posteriorSample_measurable hL r).comp (measurable_const.prodMk measurable_id)
+ rw [sourceSmoothKernel_apply hL r x,
+ Measure.map_map (sourceAdjustedEndpoints_measurable hL r) hp,
+ sourceEndpointKernel_eq_map_posterior hL r x]
+ congr 1
+ funext ω
+ change sourceAdjustedEndpoints L r (posteriorSample hL r x ω) =
+ sourceEndpointResidual L r ω + sourceRegressionMapAt L r x
+ rw [sourceAdjustedEndpoints_posteriorSample hL r x ω]
+ simp only [sourceEndpointResidual, map_sub]
+ abel
+
+end I4SourceSmoothConditional
+
+/- Finite-Gaussian and process-independence support coauthored by
+/root/regression_kernel, /root/regression_kernel/endpoint_means, and
+/root/regression_kernel/gaussian_api, supplied as compiled scratch
+ProcessSupport.lean; coauthorship only, no scientific-review credit. -/
+
+namespace I4SourceSmoothConditional
+
+theorem scalarSeries_finite_hasGaussianLaw {ι τ : Type*} [Countable ι] [Fintype τ]
+ (a : τ → ι → ℝ) (ha : ∀ j, Summable (a j)) :
+ HasGaussianLaw (fun η j => scalarSeries (a j) η) (coefficientLaw ι) := by
+ classical
+ let e : τ ≃ Fin (Fintype.card τ) := Fintype.equivFin τ
+ let reindex : (Fin (Fintype.card τ) → ℝ) →L[ℝ] (τ → ℝ) :=
+ ContinuousLinearMap.pi (fun j => ContinuousLinearMap.proj (e j))
+ have hG := (scalarSeries_finiteVector_hasGaussianLaw (Fintype.card τ)
+ (fun j => a (e.symm j)) (fun j => ha (e.symm j))).map_fun reindex
+ simpa [reindex] using hG
+
+def residualCoefficient (L r : ℝ) (ω : SmoothSample 2 L) (m : SourceMode 2) : ℝ :=
+ ω.val m - pinLift L r (sourceConfluentPinsAt L r ω) m
+
+lemma scalarSeries_single {ι : Type*} [DecidableEq ι] (m : ι) (η : ι → ℝ) :
+ scalarSeries (Pi.single m (1 : ℝ)) η = η m := by
+ simp [scalarSeries, Pi.single_apply]
+
+lemma scalarSeries_coordinate_covariance {ι : Type*} [Countable ι]
+ (a : ι → ℝ) (ha : Summable a) (m : ι) :
+ covariance (scalarSeries a) (fun ω : ι → ℝ => ω m) (coefficientLaw ι) = a m := by
+ classical
+ have hd : Summable (Pi.single m (1 : ℝ)) := by
+ apply summable_of_ne_finset_zero (s := {m})
+ intro n hn
+ simp only [Finset.mem_singleton] at hn
+ simp [hn]
+ have heq : (fun ω : ι → ℝ => ω m) = scalarSeries (Pi.single m 1) := by
+ funext ω
+ exact (scalarSeries_single m ω).symm
+ rw [heq, I4SourceCovariance.scalarSeries_covariance _ _ ha hd]
+ simp [Pi.single_apply, mul_ite]
+
+theorem pin_coefficient_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (i : Fin 6) (m : SourceMode 2) :
+ covariance (fun ω => sourceConfluentPinsAt L r ω i)
+ (fun ω : SmoothSample 2 L => ω.val m) (smoothLaw 2 L) = pinCoefficient L r i m := by
+ simp_rw [sourceConfluentPinsAt_series hL]
+ change covariance
+ (fun ω => scalarSeries (pinCoefficient L r i) (sampleInclusion 2 L ω))
+ (fun ω => (sampleInclusion 2 L ω) m) (smoothLaw 2 L) = _
+ rw [covariance_comp_inclusion 2 hL _ _ (scalarSeries_measurable _)
+ (measurable_pi_apply m)]
+ exact scalarSeries_coordinate_covariance _ (pinCoefficient_summable hL r i) m
+
+
+theorem pin_finite_coefficients_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (I : Finset (SourceMode 2)) :
+ HasGaussianLaw (fun ω : SmoothSample 2 L =>
+ (sourceConfluentPinsAt L r ω, fun m : I => ω.val m)) (smoothLaw 2 L) := by
+ classical
+ let q : (Fin 6 ⊕ I) → SourceMode 2 → ℝ :=
+ Sum.elim (pinCoefficient L r) (fun m => Pi.single m.val 1)
+ have hq (j : Fin 6 ⊕ I) : Summable (q j) := by
+ cases j with
+ | inl i => exact pinCoefficient_summable hL r i
+ | inr m =>
+ apply summable_of_ne_finset_zero (s := {m.val})
+ intro n hn
+ simp only [Finset.mem_singleton] at hn
+ simp [q, hn]
+ have hG := scalarSeries_finite_hasGaussianLaw q hq
+ have hm : Measurable (fun η j => scalarSeries (q j) η) :=
+ Measurable.of_eval (fun j => scalarSeries_measurable (q j))
+ have hμ : HasGaussianLaw (fun ω : SmoothSample 2 L =>
+ fun j => scalarSeries (q j) (sampleInclusion 2 L ω)) (smoothLaw 2 L) := by
+ refine ⟨(hm.comp (sampleInclusion_measurable 2 L)).aemeasurable, ?_⟩
+ rw [observation_map_eq 2 hL _ hm]
+ exact hG.isGaussian_map
+ let T : ((Fin 6 ⊕ I) → ℝ) →L[ℝ] ((Fin 6 → ℝ) × (I → ℝ)) :=
+ (ContinuousLinearMap.pi (fun i => ContinuousLinearMap.proj (Sum.inl i))).prod
+ (ContinuousLinearMap.pi (fun m => ContinuousLinearMap.proj (Sum.inr m)))
+ apply (hμ.map_fun T).congr
+ filter_upwards with ω
+ apply Prod.ext
+ · funext i
+ change scalarSeries (pinCoefficient L r i) (sampleInclusion 2 L ω) =
+ sourceConfluentPinsAt L r ω i
+ exact (congrFun (sourceConfluentPinsAt_series hL r ω) i).symm
+ · funext m
+ exact scalarSeries_single m.val ω.val
+
+def finiteLift (L r : ℝ) (I : Finset (SourceMode 2)) :
+ (Fin 6 → ℝ) →L[ℝ] (I → ℝ) :=
+ (Matrix.toLin' ((Matrix.of (fun (m : I) i => pinCoefficient L r i m.val)) *
+ (sourcePinCovarianceAt L r)⁻¹)).toContinuousLinearMap
+
+lemma finiteLift_apply (L r : ℝ) (I : Finset (SourceMode 2)) (y : Fin 6 → ℝ) (m : I) :
+ finiteLift L r I y m = pinLift L r y m.val := by
+ change (((Matrix.of (fun (m : I) i => pinCoefficient L r i m.val)) *
+ (sourcePinCovarianceAt L r)⁻¹) *ᵥ y) m = _
+ rw [← Matrix.mulVec_mulVec]
+ rfl
+
+theorem pin_residual_finite_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (I : Finset (SourceMode 2)) :
+ HasGaussianLaw (fun ω : SmoothSample 2 L =>
+ (sourceConfluentPinsAt L r ω, fun m : I => residualCoefficient L r ω m.val))
+ (smoothLaw 2 L) := by
+ let T : ((Fin 6 → ℝ) × (I → ℝ)) →L[ℝ] ((Fin 6 → ℝ) × (I → ℝ)) :=
+ (ContinuousLinearMap.fst ℝ (Fin 6 → ℝ) (I → ℝ)).prod
+ (ContinuousLinearMap.snd ℝ (Fin 6 → ℝ) (I → ℝ) -
+ (finiteLift L r I).comp (ContinuousLinearMap.fst ℝ (Fin 6 → ℝ) (I → ℝ)))
+ apply ((pin_finite_coefficients_hasGaussianLaw hL r I).map_fun T).congr
+ filter_upwards with ω
+ apply Prod.ext
+ · rfl
+ · funext m
+ change ω.val m - finiteLift L r I (sourceConfluentPinsAt L r ω) m = _
+ rw [finiteLift_apply]
+ rfl
+
+lemma coefficient_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (m : SourceMode 2) :
+ HasGaussianLaw (fun ω : SmoothSample 2 L => ω.val m) (smoothLaw 2 L) := by
+ refine ⟨((measurable_pi_apply m).comp measurable_subtype_coe).aemeasurable, ?_⟩
+ change IsGaussian ((smoothLaw 2 L).map (fun ω => sampleInclusion 2 L ω m))
+ rw [I4SmoothCarrier.coordinate_marginal 2 hL m]
+ infer_instance
+
+theorem residualCoefficient_zero_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) (i : Fin 6) (m : SourceMode 2) :
+ covariance (fun ω => sourceConfluentPinsAt L r ω i)
+ (fun ω => residualCoefficient L r ω m) (smoothLaw 2 L) = 0 := by
+ classical
+ have hX := (sourcePins_adjusted_hasGaussianLaw hL r).fst
+ have : IsProbabilityMeasure (smoothLaw 2 L) := hX.isProbabilityMeasure
+ let I : Finset (SourceMode 2) := {m}
+ let mm : I := ⟨m, by simp [I]⟩
+ let C : Matrix I (Fin 6) ℝ := fun t j => pinCoefficient L r j t.val
+ let G := sourcePinCovarianceAt L r
+ let _ : Invertible G := hG.invertible
+ have hprod : C * G⁻¹ * G = C := Matrix.inv_mul_cancel_right_of_invertible G C
+ have hXi (l : Fin 6) : MemLp (fun ω => sourceConfluentPinsAt L r ω l) 2 (smoothLaw 2 L) :=
+ (hX.eval l).memLp_two
+ have hη : MemLp (fun ω : SmoothSample 2 L => ω.val m) 2 (smoothLaw 2 L) :=
+ (coefficient_hasGaussianLaw hL m).memLp_two
+ have hpred : MemLp (fun ω => pinLift L r (sourceConfluentPinsAt L r ω) m)
+ 2 (smoothLaw 2 L) := by
+ have hh := ((hX.map_fun (finiteLift L r I)).eval mm).memLp_two
+ simpa only [finiteLift_apply] using hh
+ have heq : (fun ω => pinLift L r (sourceConfluentPinsAt L r ω) m) =
+ (fun ω => ∑ l, (C * G⁻¹) mm l * sourceConfluentPinsAt L r ω l) := by
+ funext ω
+ exact (finiteLift_apply L r I (sourceConfluentPinsAt L r ω) mm).symm
+ have hcov : covariance (fun ω => sourceConfluentPinsAt L r ω i)
+ (fun ω => pinLift L r (sourceConfluentPinsAt L r ω) m) (smoothLaw 2 L) =
+ pinCoefficient L r i m := by
+ rw [heq, covariance_fun_sum_right (fun l => (hXi l).const_mul _) (hXi i)]
+ simp_rw [covariance_const_mul_right]
+ calc
+ _ = ∑ l, (C * G⁻¹) mm l * G l i := by
+ apply Finset.sum_congr rfl
+ intro l _
+ congr 1
+ exact covariance_comm _ _
+ _ = C mm i := congrArg (fun N => N mm i) hprod
+ _ = pinCoefficient L r i m := rfl
+ unfold residualCoefficient
+ rw [covariance_fun_sub_right (hXi i) hη hpred, pin_coefficient_covariance hL r i m,
+ hcov, sub_self]
+
+theorem residualCoefficient_finite_indepFun {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) (I : Finset (SourceMode 2)) :
+ IndepFun (sourceConfluentPinsAt L r)
+ (fun (ω : SmoothSample 2 L) (m : I) => residualCoefficient L r ω m.val) (smoothLaw 2 L) := by
+ exact (pin_residual_finite_hasGaussianLaw hL r I).indepFun_of_covariance_eval
+ (fun i m => residualCoefficient_zero_covariance hL r hG i m.val)
+
+theorem residualCoefficient_indepFun {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ IndepFun (sourceConfluentPinsAt L r) (fun ω m => residualCoefficient L r ω m)
+ (smoothLaw 2 L) := by
+ have hX := (sourcePins_adjusted_hasGaussianLaw hL r).fst
+ have : IsProbabilityMeasure (smoothLaw 2 L) := hX.isProbabilityMeasure
+ apply IndepFun.indepFun_process₀ hX.aemeasurable
+ · intro m
+ have hφ : Measurable (fun y : Fin 6 → ℝ => pinLift L r y m) := by
+ unfold pinLift
+ fun_prop
+ exact ((measurable_pi_apply m).comp measurable_subtype_coe).aemeasurable.sub
+ (hφ.comp_aemeasurable hX.aemeasurable)
+ · exact residualCoefficient_finite_indepFun hL r hG
+
+end I4SourceSmoothConditional
+
+open I4SourcePhysicalEndpointKernel
+
+namespace I4SourceSmoothConditional
+
+theorem sourceNormalizedEndpoints_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :
+ Measurable (sourceNormalizedEndpoints L r) := by
+ have heq : sourceNormalizedEndpoints L r = fun ω => sourceAdjustedEndpoints L r ω +
+ sourcePhysicalCorrection r (sourceConfluentPinsAt L r ω) :=
+ funext (sourceNormalizedEndpoints_eq_adjusted L r)
+ rw [heq]
+ exact (sourceAdjustedEndpoints_measurable hL r).add
+ ((sourcePhysicalCorrection r).continuous.measurable.comp
+ (sourceConfluentPinsAt_measurable hL r))
+
+/-- The literal physical endpoint kernel is also an all-pin marginal of the
+whole-carrier conditional sampling law. -/
+theorem sourceSmoothKernel_physical_endpoint_map {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) :
+ (sourceSmoothKernel hL r x).map (sourceNormalizedEndpoints L r) =
+ sourcePhysicalEndpointKernel L r x := by
+ have hp : Measurable (posteriorSample hL r x) :=
+ (posteriorSample_measurable hL r).comp (measurable_const.prodMk measurable_id)
+ have hR : Measurable (sourceEndpointResidual L r) :=
+ (sourceAdjustedEndpoints_measurable hL r).sub
+ ((sourceRegressionMapAt L r).continuous.measurable.comp
+ (sourceConfluentPinsAt_measurable hL r))
+ rw [sourceSmoothKernel_apply hL r x,
+ Measure.map_map (sourceNormalizedEndpoints_measurable hL r) hp,
+ sourcePhysicalEndpointKernel_apply hL r x,
+ Measure.map_map (by fun_prop) hR]
+ congr 1
+ funext ω
+ change sourceNormalizedEndpoints L r (posteriorSample hL r x ω) =
+ sourceEndpointResidual L r ω + sourceRegressionMapAt L r x + sourcePhysicalCorrection r x
+ rw [sourceNormalizedEndpoints_eq_adjusted,
+ sourceConfluentPinsAt_posteriorSample hL r hG x ω,
+ sourceAdjustedEndpoints_posteriorSample hL r x ω]
+ simp only [sourceEndpointResidual, map_sub]
+ abel
+
+/-- Prescribed null pins select exactly the physical endpoint law already used
+by the completed endpoint estimates. -/
+theorem sourceSmoothKernel_physical_prescribed_map {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ (sourceSmoothKernel hL r (sourcePrescribedPins r b)).map (sourceNormalizedEndpoints L r) =
+ sourcePhysicalEndpointLaw L r b :=
+ sourceSmoothKernel_physical_endpoint_map hL r hG (sourcePrescribedPins r b)
+
+end I4SourceSmoothConditional
+
+/- Measurable carrier reconstruction and final conditional-law join
+coauthored by /root/normalizer_palm_research, supplied as compiled scratch
+Reconstruction.lean. Coauthor work, no scientific-review credit. -/
+
+namespace I4SourceSmoothConditional
+
+theorem posteriorSample_self {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (ω : SmoothSample 2 L) :
+ posteriorSample hL r (sourceConfluentPinsAt L r ω) ω = ω := by
+ apply Subtype.ext
+ funext m
+ simp only [posteriorSample_val, sub_self, pinLift_zero, Pi.zero_apply, add_zero]
+
+theorem posteriorSample_eq_addLift_residual {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (x : Fin 6 → ℝ) (ω : SmoothSample 2 L) :
+ addLift hL r x (posteriorSample hL r 0 ω) = posteriorSample hL r x ω := by
+ apply Subtype.ext
+ funext m
+ simp only [addLift_val, posteriorSample_val, sub_eq_add_neg,
+ pinLift_add, pinLift_neg, pinLift_zero, Pi.zero_apply, Pi.add_apply, Pi.neg_apply]
+ abel
+
+theorem addLift_observation_residual {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (ω : SmoothSample 2 L) :
+ addLift hL r (sourceConfluentPinsAt L r ω) (posteriorSample hL r 0 ω) = ω := by
+ rw [posteriorSample_eq_addLift_residual, posteriorSample_self]
+
+theorem posteriorSample_zero_inclusion {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (ω : SmoothSample 2 L) :
+ sampleInclusion 2 L (posteriorSample hL r 0 ω) = residualCoefficient L r ω := by
+ funext m
+ change (posteriorSample hL r 0 ω).val m = residualCoefficient L r ω m
+ simp only [posteriorSample_val, residualCoefficient, sub_eq_add_neg, zero_add,
+ pinLift_neg, Pi.neg_apply]
+
+theorem posteriorSample_zero_indepFun {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ IndepFun (sourceConfluentPinsAt L r) (posteriorSample hL r 0) (smoothLaw 2 L) := by
+ obtain ⟨q,hq,hret⟩ := exists_measurable_sampleProjection 2 L
+ have hi := (residualCoefficient_indepFun hL r hG).comp measurable_id hq
+ have heq : q ∘ (fun ω => residualCoefficient L r ω) = posteriorSample hL r 0 := by
+ funext ω
+ rw [Function.comp_apply, ← posteriorSample_zero_inclusion hL r ω, hret]
+ simpa only [Function.id_comp, heq] using hi
+
+theorem sourceSmoothKernel_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ HasCondDistrib (id : SmoothSample 2 L → SmoothSample 2 L)
+ (sourceConfluentPinsAt L r) (sourceSmoothKernel hL r) (smoothLaw 2 L) := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ have hX := sourceConfluentPinsAt_measurable hL r
+ have hR : Measurable (posteriorSample hL r 0) :=
+ (posteriorSample_measurable hL r).comp (measurable_const.prodMk measurable_id)
+ have hc := (regression_pair_hasCondDistrib hX.aemeasurable hR.aemeasurable
+ (posteriorSample_zero_indepFun hL r hG)).comp_left (addLift_measurable hL r)
+ have hrec : (fun p : (Fin 6 → ℝ) × SmoothSample 2 L => addLift hL r p.1 p.2) ∘
+ (fun ω => (sourceConfluentPinsAt L r ω, posteriorSample hL r 0 ω)) = id := by
+ funext ω
+ exact addLift_observation_residual hL r ω
+ have hk : ((Kernel.id : Kernel (Fin 6 → ℝ) (Fin 6 → ℝ)) ×ₖ
+ Kernel.const (Fin 6 → ℝ) ((smoothLaw 2 L).map (posteriorSample hL r 0))).map
+ (fun p => addLift hL r p.1 p.2) = sourceSmoothKernel hL r := by
+ ext x : 1
+ rw [Kernel.map_apply _ (addLift_measurable hL r), Kernel.prod_apply,
+ Kernel.id_apply, Kernel.const_apply, Measure.dirac_prod,
+ Measure.map_map (addLift_measurable hL r) (by fun_prop), sourceSmoothKernel_apply hL r x]
+ have ha : Measurable (addLift hL r x) :=
+ (addLift_measurable hL r).comp (measurable_const.prodMk measurable_id)
+ change (((smoothLaw 2 L).map (posteriorSample hL r 0)).map (addLift hL r x)) = _
+ rw [Measure.map_map ha hR]
+ congr 1
+ funext ω
+ exact posteriorSample_eq_addLift_residual hL r x ω
+ rw [hrec, hk] at hc
+ exact hc
+
+end I4SourceSmoothConditional
+
+namespace I4SourceSmoothConditional
+
+/-- Every measurable functional of the actual carrier inherits this specified
+conditional kernel. -/
+theorem sourceSmoothKernel_map_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) {E : Type*} [MeasurableSpace E]
+ (F : SmoothSample 2 L → E) (hF : Measurable F) :
+ HasCondDistrib F (sourceConfluentPinsAt L r) ((sourceSmoothKernel hL r).map F)
+ (smoothLaw 2 L) := by
+ have : IsProbabilityMeasure (smoothLaw 2 L) := smoothLaw_isProbabilityMeasure 2 hL
+ simpa only [Function.comp_id] using
+ (sourceSmoothKernel_hasCondDistrib hL r hG).comp_left hF
+
+/-- The literal smooth field is measurable for the coordinate product sigma
+algebra on functions. No additional topological function-space law is chosen. -/
+theorem smoothSourceField_measurable (d : ℕ) (L : ℝ) :
+ Measurable (smoothSourceField d L) := by
+ apply Measurable.of_eval
+ intro x
+ exact (sourceField_eval_measurable d L x).comp (sampleInclusion_measurable d L)
+
+theorem sourceSmoothKernel_field_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ HasCondDistrib (smoothSourceField 2 L) (sourceConfluentPinsAt L r)
+ ((sourceSmoothKernel hL r).map (smoothSourceField 2 L)) (smoothLaw 2 L) :=
+ sourceSmoothKernel_map_hasCondDistrib hL r hG _ (smoothSourceField_measurable 2 L)
+
+/-- The completed actual covariance limits supply invertibility. The final
+whole-carrier conditioning statement retains only the actual scale hypothesis. -/
+theorem sourceSmoothKernel_eventually_hasCondDistrib {L : ℝ} (hL : L ≠ 0) :
+ ∀ᶠ r in 𝓝[>] (0 : ℝ),
+ HasCondDistrib (id : SmoothSample 2 L → SmoothSample 2 L)
+ (sourceConfluentPinsAt L r) (sourceSmoothKernel hL r) (smoothLaw 2 L) := by
+ filter_upwards [(sourceEndpoint_parameter_limits hL 0).1] with r hG
+ exact sourceSmoothKernel_hasCondDistrib hL r hG
+
+theorem sourceSmoothKernel_eventually_map_hasCondDistrib {L : ℝ} (hL : L ≠ 0)
+ {E : Type*} [MeasurableSpace E] (F : SmoothSample 2 L → E) (hF : Measurable F) :
+ ∀ᶠ r in 𝓝[>] (0 : ℝ),
+ HasCondDistrib F (sourceConfluentPinsAt L r) ((sourceSmoothKernel hL r).map F)
+ (smoothLaw 2 L) := by
+ filter_upwards [(sourceEndpoint_parameter_limits hL 0).1] with r hG
+ exact sourceSmoothKernel_map_hasCondDistrib hL r hG F hF
+
+end I4SourceSmoothConditional
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceSmoothPalm.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceSmoothPalm.lean
new file mode 100644
index 000000000..62da624fa
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceSmoothPalm.lean
@@ -0,0 +1,329 @@
+import SourceSmoothConditionalKernel
+
+/-!
+# Literal determinant weighting on the actual smooth carrier
+
+The base law is the specified actual whole-carrier kernel at the prescribed
+six-pin value. The weight uses the actual endpoint Hessian entries and strict
+maximum/saddle typing. Exact endpoint pushforward identities transfer the
+proved moment and normalizer estimates to every measurable carrier event.
+
+The normalized density formula below is a probability law on the actual smooth
+carrier. It is not identified here with a geometric critical-point-process Palm
+disintegration, and supplies no Morse, elder, counting or event measurability claim.
+See `SOURCE_SMOOTH_PALM.md` for the frozen source contract.
+-/
+
+noncomputable section
+
+open I4SmoothCarrier I4SourceConfluentPins I4SourceEndpointRegression I4SourceSmoothConditional
+open I4SourceEndpointEstimates I4SourceEndpointParameters
+open MeasureTheory ProbabilityTheory ResearchFormalCoreR1 Matrix Filter
+open scoped BigOperators ENNReal Topology
+
+set_option autoImplicit false
+
+namespace I4SourceSmoothPalm
+
+lemma withDensity_map_comp {Ω E : Type*} [MeasurableSpace Ω] [MeasurableSpace E]
+ (μ : Measure Ω) (F : Ω → E) (w : E → ℝ≥0∞) (hF : Measurable F)
+ (hw : Measurable w) :
+ (μ.withDensity (fun ω => w (F ω))).map F = (μ.map F).withDensity w := by
+ ext s hs
+ rw [Measure.map_apply hF hs, withDensity_apply _ (hs.preimage hF),
+ withDensity_apply _ hs, setLIntegral_map hs hw hF]
+
+/-- Normalized weighting commutes exactly with a measurable pushforward.
+The two normalizers are derived to be equal; no positivity or integrability premise is needed. -/
+theorem prwMeasure_map_comp {Ω E : Type*} [MeasurableSpace Ω] [MeasurableSpace E]
+ (μ : Measure Ω) (F : Ω → E) (W : E → ℝ) (hF : Measurable F)
+ (hW : Measurable W) :
+ (prwMeasure μ (W ∘ F)).map F = prwMeasure (μ.map F) W := by
+ have hnormalizer : (∫ ω, (W ∘ F) ω ∂μ) = ∫ y, W y ∂μ.map F :=
+ (integral_map hF.aemeasurable hW.aestronglyMeasurable).symm
+ unfold prwMeasure
+ rw [hnormalizer]
+ exact withDensity_map_comp μ F (fun y => ENNReal.ofReal (W y / ∫ z, W z ∂μ.map F))
+ hF (by fun_prop)
+
+lemma prwMeasure_absolutelyContinuous {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) : prwMeasure μ W ≪ μ :=
+ withDensity_absolutelyContinuous _ _
+
+lemma prwMeasure_ae_of_ae {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) {p : Ω → Prop} (hp : ∀ᵐ ω ∂μ, p ω) :
+ ∀ᵐ ω ∂prwMeasure μ W, p ω :=
+ (prwMeasure_absolutelyContinuous μ W).ae_le hp
+
+lemma prwMeasure_ae_weight_pos {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) (hW : Measurable W)
+ (hZ : 0 < ∫ ω, W ω ∂μ) :
+ ∀ᵐ ω ∂prwMeasure μ W, 0 < W ω := by
+ unfold prwMeasure
+ rw [ae_withDensity_iff (by fun_prop)]
+ filter_upwards [] with ω hω
+ have hd : 0 < W ω / ∫ x, W x ∂μ := ENNReal.ofReal_pos.mp (pos_iff_ne_zero.mpr hω)
+ exact (div_pos_iff_of_pos_right hZ).mp hd
+
+def sourceSmoothLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ) : Measure (SmoothSample 2 L) :=
+ sourceSmoothKernel hL r (sourcePrescribedPins r b)
+
+instance sourceSmoothLaw_isProbabilityMeasure {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :
+ IsProbabilityMeasure (sourceSmoothLaw hL r b) := by
+ unfold sourceSmoothLaw
+ infer_instance
+
+lemma rawPins_prescribed_iff {L : ℝ} (r b : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :
+ rawPins L r ω = ![b,b-r^3/6,0,0,0,0] ↔
+ sourceConfluentPinsAt L r ω = sourcePrescribedPins r b := by
+ change _ ↔ confluentEquiv r hr (rawPins L r ω) = _
+ rw [← show confluentEquiv r hr ![b,b-r^3/6,0,0,0,0] = sourcePrescribedPins r b from
+ prescribed_target r b hr]
+ exact (confluentEquiv r hr).injective.eq_iff.symm
+
+theorem sourceSmoothLaw_raw_pin_fiber {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ sourceSmoothLaw hL r b {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} = 1 := by
+ have hset : {ω : SmoothSample 2 L | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} =
+ {ω | sourceConfluentPinsAt L r ω = sourcePrescribedPins r b} := by
+ ext ω
+ exact rawPins_prescribed_iff r b hr ω
+ rw [hset]
+ exact sourceSmoothKernel_pin_fiber hL r hG (sourcePrescribedPins r b)
+
+lemma sourceRawPins_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :
+ Measurable (rawPins L r) := by
+ have heq : rawPins L r = fun ω => rawTransform r (sourceConfluentPinsAt L r ω) := by
+ funext ω
+ exact (rawTransform_confluentTransform r hr (rawPins L r ω)).symm
+ rw [heq]
+ have hc : Continuous (rawTransform r) := by
+ unfold rawTransform
+ fun_prop
+ exact hc.measurable.comp (sourceConfluentPinsAt_measurable hL r)
+
+theorem sourceSmoothLaw_raw_pin_fiber_ae {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ ∀ᵐ ω ∂sourceSmoothLaw hL r b, rawPins L r ω = ![b,b-r^3/6,0,0,0,0] := by
+ apply (mem_ae_iff_prob_eq_one
+ (measurableSet_eq_fun (sourceRawPins_measurable hL r hr) measurable_const)).2
+ exact sourceSmoothLaw_raw_pin_fiber hL r b hr hG
+
+/-- Every probability measure absolutely continuous with respect to the actual conditioned
+carrier law retains its exact prescribed raw values and zero gradients. -/
+theorem raw_pin_fiber_of_absolutelyContinuous {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r))
+ (ν : Measure (SmoothSample 2 L)) [IsProbabilityMeasure ν]
+ (hν : ν ≪ sourceSmoothLaw hL r b) :
+ ν {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} = 1 := by
+ apply (mem_ae_iff_prob_eq_one
+ (measurableSet_eq_fun (sourceRawPins_measurable hL r hr) measurable_const)).1
+ exact hν.ae_le (sourceSmoothLaw_raw_pin_fiber_ae hL r b hr hG)
+
+theorem prwMeasure_raw_pin_fiber {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) (W : SmoothSample 2 L → ℝ)
+ [IsProbabilityMeasure (prwMeasure (sourceSmoothLaw hL r b) W)] :
+ prwMeasure (sourceSmoothLaw hL r b) W
+ {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} = 1 := by
+ apply raw_pin_fiber_of_absolutelyContinuous hL r b hr hG
+ exact withDensity_absolutelyContinuous _ _
+
+/-- Literal actual symmetric endpoint Hessian entries at M. -/
+def sourceRawHM (L r : ℝ) (ω : SmoothSample 2 L) : Matrix (Fin 2) (Fin 2) ℝ :=
+ let v := rawPinsWithHessians L r ω
+ !![v 6,v 7;v 7,v 8]
+
+/-- Literal actual symmetric endpoint Hessian entries at S. -/
+def sourceRawHS (L r : ℝ) (ω : SmoothSample 2 L) : Matrix (Fin 2) (Fin 2) ℝ :=
+ let v := rawPinsWithHessians L r ω
+ !![v 9,v 10;v 10,v 11]
+
+def sourceSmoothTyped (L r : ℝ) (ω : SmoothSample 2 L) : Prop :=
+ dm2Negative (sourceRawHM L r ω) ∧ (sourceRawHS L r ω).det < 0
+
+/-- Strict maximum/saddle determinant weight of the actual field at its two endpoints. -/
+def sourceSmoothWeight (L r : ℝ) (ω : SmoothSample 2 L) : ℝ := by
+ classical
+ exact if sourceSmoothTyped L r ω then |(sourceRawHM L r ω).det * (sourceRawHS L r ω).det| else 0
+
+lemma sourceRawHM_eq_normalized (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :
+ sourceRawHM L r ω = egm_HM r (sourcePhysicalCoordinates (sourceNormalizedEndpoints L r ω)) := by
+ ext i j
+ fin_cases i <;> fin_cases j <;>
+ simp [sourceRawHM, egm_HM, sourcePhysicalCoordinates, sourceNormalizedEndpoints]
+ all_goals field_simp [hr]
+
+lemma sourceRawHS_eq_normalized (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :
+ sourceRawHS L r ω = egm_HS r (sourcePhysicalCoordinates (sourceNormalizedEndpoints L r ω)) := by
+ ext i j
+ fin_cases i <;> fin_cases j <;>
+ simp [sourceRawHS, egm_HS, sourcePhysicalCoordinates, sourceNormalizedEndpoints]
+ all_goals field_simp [hr]
+
+theorem sourceSmoothWeight_eq (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :
+ sourceSmoothWeight L r ω = sourceEndpointWeight r (sourceNormalizedEndpoints L r ω) := by
+ unfold sourceSmoothWeight sourceSmoothTyped sourceEndpointWeight egm_weight
+ rw [sourceRawHM_eq_normalized L r hr ω, sourceRawHS_eq_normalized L r hr ω]
+ split_ifs <;> rfl
+
+theorem sourceSmoothWeight_nonneg (L r : ℝ) (ω : SmoothSample 2 L) :
+ 0 ≤ sourceSmoothWeight L r ω := by
+ unfold sourceSmoothWeight
+ split_ifs
+ · exact abs_nonneg _
+ · exact le_rfl
+
+theorem sourceSmoothWeight_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :
+ Measurable (sourceSmoothWeight L r) := by
+ have heq : sourceSmoothWeight L r = sourceEndpointWeight r ∘ sourceNormalizedEndpoints L r :=
+ funext (sourceSmoothWeight_eq L r hr)
+ rw [heq]
+ exact (sourceEndpointWeight_measurable r).comp (sourceNormalizedEndpoints_measurable hL r)
+
+theorem sourceSmoothWeight_pos_iff (L r : ℝ) (ω : SmoothSample 2 L) :
+ 0 < sourceSmoothWeight L r ω ↔ sourceSmoothTyped L r ω := by
+ classical
+ by_cases ht : sourceSmoothTyped L r ω
+ · have hM : 0 < (sourceRawHM L r ω).det := by
+ have h := (dm2_negative_iff _ _ _).mp ht.1
+ simpa [sourceRawHM, Matrix.det_fin_two, pow_two] using h.2
+ have hn : (sourceRawHM L r ω).det * (sourceRawHS L r ω).det ≠ 0 :=
+ mul_ne_zero hM.ne' ht.2.ne
+ rw [sourceSmoothWeight, ite_eq_left ht]
+ exact ⟨fun _ => ht, fun _ => abs_pos.mpr hn⟩
+ · simp [sourceSmoothWeight, ht]
+
+theorem sourceSmoothTyped_measurableSet {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :
+ MeasurableSet {ω : SmoothSample 2 L | sourceSmoothTyped L r ω} := by
+ have heq : {ω : SmoothSample 2 L | sourceSmoothTyped L r ω} =
+ {ω | 0 < sourceSmoothWeight L r ω} := by
+ ext ω
+ exact (sourceSmoothWeight_pos_iff L r ω).symm
+ rw [heq]
+ exact measurableSet_lt measurable_const (sourceSmoothWeight_measurable hL r hr)
+
+/-- The whole-carrier probability defined by the literal normalized actual determinant density. -/
+def sourceSmoothWeightedLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ) : Measure (SmoothSample 2 L) :=
+ prwMeasure (sourceSmoothLaw hL r b) (sourceSmoothWeight L r)
+
+theorem sourceSmoothLaw_endpoint_hasLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ HasLaw (sourceNormalizedEndpoints L r) (sourcePhysicalEndpointLaw L r b)
+ (sourceSmoothLaw hL r b) := by
+ refine ⟨(sourceNormalizedEndpoints_measurable hL r).aemeasurable, ?_⟩
+ exact sourceSmoothKernel_physical_prescribed_map hL r b hG
+
+theorem sourceSmoothLaw_weight_square_integrable {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r))
+ (hsq : Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourcePhysicalEndpointLaw L r b)) :
+ Integrable (fun ω => sourceSmoothWeight L r ω ^ 2) (sourceSmoothLaw hL r b) := by
+ simpa only [sourceSmoothWeight_eq L r hr, Function.comp_def] using
+ (sourceSmoothLaw_endpoint_hasLaw hL r b hG).integrable_comp hsq
+
+theorem sourceSmoothLaw_weight_integral {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ (∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b) =
+ ∫ v, sourceEndpointWeight r v ∂sourcePhysicalEndpointLaw L r b := by
+ simpa only [sourceSmoothWeight_eq L r hr, Function.comp_def] using
+ (sourceSmoothLaw_endpoint_hasLaw hL r b hG).integral_comp
+ (sourceEndpointWeight_measurable r).aestronglyMeasurable
+
+theorem sourceSmoothLaw_weight_square_integral {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) =
+ ∫ v, sourceEndpointWeight r v ^ 2 ∂sourcePhysicalEndpointLaw L r b := by
+ simpa only [sourceSmoothWeight_eq L r hr, Function.comp_def] using
+ (sourceSmoothLaw_endpoint_hasLaw hL r b hG).integral_comp
+ ((sourceEndpointWeight_measurable r).pow_const 2).aestronglyMeasurable
+
+/-- Exact endpoint pushforward of the literal weighted whole-carrier law. -/
+theorem sourceSmoothWeightedLaw_endpoint_map {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ (sourceSmoothWeightedLaw hL r b).map (sourceNormalizedEndpoints L r) =
+ sourcePhysicalEndpointWeightedProbability L r b := by
+ have heq : sourceSmoothWeight L r = sourceEndpointWeight r ∘ sourceNormalizedEndpoints L r :=
+ funext (sourceSmoothWeight_eq L r hr)
+ unfold sourceSmoothWeightedLaw sourcePhysicalEndpointWeightedProbability
+ rw [heq, prwMeasure_map_comp _ _ _ (sourceNormalizedEndpoints_measurable hL r)
+ (sourceEndpointWeight_measurable r), (sourceSmoothLaw_endpoint_hasLaw hL r b hG).map_eq]
+
+/-- The event estimate applies to every measurable event of the actual smooth carrier. -/
+theorem sourceSmooth_weighted_event_bound_of_estimates {L : ℝ} (hL : L ≠ 0)
+ (r b C c : ℝ) (hC : 0 ≤ C) (hc : 0 < c) (hr : 0 < r)
+ (hsq : Integrable (fun ω => sourceSmoothWeight L r ω ^ 2) (sourceSmoothLaw hL r b))
+ (hmoment : (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) ≤ C*r^4)
+ (hfloor : c*r^2 ≤ ∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b)
+ (E : Set (SmoothSample 2 L)) (hE : MeasurableSet E) :
+ IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) ∧
+ (sourceSmoothWeightedLaw hL r b).real E ≤
+ (Real.sqrt C/c) * Real.sqrt ((sourceSmoothLaw hL r b).real E) := by
+ exact prw_square_root_event_bound (sourceSmoothLaw hL r b) (sourceSmoothWeight L r)
+ (sourceSmoothWeight_measurable hL r hr.ne') (sourceSmoothWeight_nonneg L r) hsq
+ C c r hC hc hr hmoment hfloor E hE
+
+/-- The literal density is positive only on the strict maximum/saddle type, which has full mass. -/
+theorem sourceSmoothWeightedLaw_typed {L : ℝ} (hL : L ≠ 0) (r b : ℝ) (hr : r ≠ 0)
+ [IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b)]
+ (hZ : 0 < ∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b) :
+ sourceSmoothWeightedLaw hL r b {ω | sourceSmoothTyped L r ω} = 1 := by
+ apply (mem_ae_iff_prob_eq_one (sourceSmoothTyped_measurableSet hL r hr)).1
+ have hp := prwMeasure_ae_weight_pos (sourceSmoothLaw hL r b) (sourceSmoothWeight L r)
+ (sourceSmoothWeight_measurable hL r hr) hZ
+ filter_upwards [hp] with ω hω
+ exact (sourceSmoothWeight_pos_iff L r ω).mp hω
+
+/-- The density preserves the exact raw prescribed values and all four zero first derivatives. -/
+theorem sourceSmoothWeightedLaw_raw_pins {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r))
+ [IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b)] :
+ sourceSmoothWeightedLaw hL r b {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} = 1 := by
+ have : IsProbabilityMeasure (prwMeasure (sourceSmoothLaw hL r b) (sourceSmoothWeight L r)) :=
+ ‹IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b)›
+ exact prwMeasure_raw_pin_fiber hL r b hr hG (sourceSmoothWeight L r)
+
+/-- Actual whole-carrier determinant moments, normalizer, probability and event transfer.
+Only the period and fixed prescribed height are inputs; actual covariance limits supply
+all sufficiently-small-radius invertibility needed by the literal endpoint marginal. -/
+theorem sourceSmoothPalm_estimates {L : ℝ} (hL : L ≠ 0) (b : ℝ) :
+ ∃ C c δ : ℝ, 0 ≤ C ∧ 0 < c ∧ 0 < δ ∧ δ ≤ 1 ∧
+ ∀ r : ℝ, 0 < r → r < δ →
+ Integrable (fun ω => sourceSmoothWeight L r ω ^ 2) (sourceSmoothLaw hL r b) ∧
+ (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) ≤ C*r^4 ∧
+ c*r^2 ≤ (∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b) ∧
+ IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) ∧
+ (∀ E : Set (SmoothSample 2 L), MeasurableSet E →
+ (sourceSmoothWeightedLaw hL r b).real E ≤
+ (Real.sqrt C/c) * Real.sqrt ((sourceSmoothLaw hL r b).real E)) ∧
+ (sourceSmoothWeightedLaw hL r b).map (sourceNormalizedEndpoints L r) =
+ sourcePhysicalEndpointWeightedProbability L r b ∧
+ sourceSmoothWeightedLaw hL r b
+ {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} = 1 ∧
+ sourceSmoothWeightedLaw hL r b {ω | sourceSmoothTyped L r ω} = 1 := by
+ obtain ⟨C,c,δE,hC,hc,hδE,hδE1,he⟩ := sourcePhysicalEndpoint_estimates_and_weighted_events hL b
+ obtain ⟨δG,hδG,hGinterval⟩ := mem_nhdsGT_iff_exists_Ioo_subset.mp
+ (sourceEndpoint_parameter_limits hL b).1
+ refine ⟨C,c,min δE δG,hC,hc,lt_min hδE hδG,(min_le_left _ _).trans hδE1,?_⟩
+ intro r hr hrδ
+ have hrE : r < δE := lt_of_lt_of_le hrδ (min_le_left _ _)
+ have hG : IsUnit (sourcePinCovarianceAt L r) :=
+ hGinterval ⟨hr,lt_of_lt_of_le hrδ (min_le_right _ _)⟩
+ obtain ⟨hsqE,hmE,hfE,_,_⟩ := he r hr hrE
+ have hsq := sourceSmoothLaw_weight_square_integrable hL r b hr.ne' hG hsqE
+ have hm : (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) ≤ C*r^4 := by
+ rw [sourceSmoothLaw_weight_square_integral hL r b hr.ne' hG]
+ exact hmE
+ have hf : c*r^2 ≤ ∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b := by
+ rw [sourceSmoothLaw_weight_integral hL r b hr.ne' hG]
+ exact hfE
+ have hp := sourceSmooth_weighted_event_bound_of_estimates hL r b C c hC hc hr
+ hsq hm hf Set.univ MeasurableSet.univ
+ have : IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) := hp.1
+ have hZ : 0 < ∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b :=
+ (mul_pos hc (sq_pos_of_pos hr)).trans_le hf
+ refine ⟨hsq,hm,hf,hp.1,?_,sourceSmoothWeightedLaw_endpoint_map hL r b hr.ne' hG,
+ sourceSmoothWeightedLaw_raw_pins hL r b hr.ne' hG,
+ sourceSmoothWeightedLaw_typed hL r b hr.ne' hZ⟩
+ intro E hE
+ exact (sourceSmooth_weighted_event_bound_of_estimates hL r b C c hC hc hr hsq hm hf E hE).2
+
+end I4SourceSmoothPalm
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/GaussianSeriesFoundation.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/GaussianSeriesFoundation.lean
new file mode 100644
index 000000000..93651da7f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/GaussianSeriesFoundation.lean
@@ -0,0 +1,96 @@
+import Mathlib.Probability.Distributions.Gaussian.Real
+import Mathlib.Probability.Independence.InfinitePi
+import Mathlib.MeasureTheory.Function.LpSpace.InfiniteSum
+import Mathlib.MeasureTheory.Function.LpSeminorm.SMul
+
+/-! The actual product law and the almost-sure absolute-series foundation.
+This does not assert a Fourier covariance, sample smoothness or finite-jet rank. -/
+
+noncomputable section
+
+open MeasureTheory ProbabilityTheory
+open scoped ENNReal
+
+namespace I4Foundation
+
+/-- The same actual probability measure used for every coefficient and series assertion. -/
+def coefficientLaw (ι : Type*) : Measure (ι → ℝ) :=
+ Measure.infinitePi (fun _ : ι => gaussianReal 0 1)
+
+instance coefficientLaw_isProbabilityMeasure (ι : Type*) :
+ IsProbabilityMeasure (coefficientLaw ι) := by
+ unfold coefficientLaw
+ infer_instance
+
+theorem coordinate_measurePreserving {ι : Type*} (i : ι) :
+ MeasurePreserving (fun ω : ι → ℝ => ω i) (coefficientLaw ι)
+ (gaussianReal 0 1) := by
+ exact measurePreserving_eval_infinitePi (fun _ : ι => gaussianReal 0 1) i
+
+theorem coordinate_marginal {ι : Type*} (i : ι) :
+ (coefficientLaw ι).map (fun ω => ω i) = gaussianReal 0 1 := by
+ exact (coordinate_measurePreserving i).map_eq
+
+theorem coordinates_independent (ι : Type*) :
+ iIndepFun (fun i (ω : ι → ℝ) => ω i) (coefficientLaw ι) := by
+ exact iIndepFun_infinitePi (P := fun _ : ι => gaussianReal 0 1)
+ (X := fun _ : ι => id) (fun _ => measurable_id)
+
+theorem coordinate_memLp {ι : Type*} (i : ι) (p : ℝ≥0∞) (hp : p ≠ ∞) :
+ MemLp (fun ω : ι → ℝ => ω i) p (coefficientLaw ι) := by
+ exact (memLp_id_gaussianReal' p hp).comp_measurePreserving
+ (coordinate_measurePreserving i)
+
+theorem coordinate_integrable {ι : Type*} (i : ι) :
+ Integrable (fun ω : ι → ℝ => ω i) (coefficientLaw ι) := by
+ exact memLp_one_iff_integrable.mp (coordinate_memLp i 1 (by simp))
+
+theorem coordinate_abs_integrable {ι : Type*} (i : ι) :
+ Integrable (fun ω : ι → ℝ => |ω i|) (coefficientLaw ι) := by
+ simpa only [Real.norm_eq_abs] using (coordinate_integrable i).norm
+
+theorem weighted_abs_summable_ae {ι : Type*} [Countable ι]
+ (a : ι → ℝ) (ha : ∀ i, 0 ≤ a i) (hs : Summable a) :
+ ∀ᵐ ω ∂coefficientLaw ι, Summable (fun i => a i * |ω i|) := by
+ let C := eLpNorm id 1 (gaussianReal 0 1)
+ have hC : C < ∞ := (memLp_id_gaussianReal' 1 (by simp)).eLpNorm_lt_top
+ have hcoord (i : ι) :
+ eLpNorm (fun ω : ι → ℝ => ω i) 1 (coefficientLaw ι) = C := by
+ exact eLpNorm_comp_measurePreserving
+ (memLp_id_gaussianReal' 1 (by simp)).aestronglyMeasurable
+ (coordinate_measurePreserving i)
+ have hnorm (i : ι) :
+ eLpNorm (fun ω : ι → ℝ => a i * ω i) 1 (coefficientLaw ι) =
+ ENNReal.ofReal (a i) * C := by
+ change eLpNorm (a i • (fun ω : ι → ℝ => ω i)) 1 (coefficientLaw ι) = _
+ rw [eLpNorm_const_smul, Real.enorm_eq_ofReal (ha i), hcoord]
+ have hsum : (∑' i, eLpNorm (fun ω : ι → ℝ => a i * ω i) 1
+ (coefficientLaw ι)) ≠ ∞ := by
+ simp_rw [hnorm]
+ rw [ENNReal.tsum_mul_right]
+ exact ENNReal.mul_ne_top hs.tsum_ofReal_ne_top hC.ne
+ have h := summable_norm_of_tsum_eLpNorm_ne_top (p := 1) (le_refl 1) hsum
+ filter_upwards [h] with ω hω
+ simpa only [Real.norm_eq_abs, abs_mul, abs_of_nonneg (ha _)] using hω
+
+/-- The actual scalar sum; its convergence is proved separately on the product law. -/
+def scalarSeries {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ) : ℝ :=
+ ∑' i, a i * ω i
+
+theorem scalarSeries_measurable {ι : Type*} [Countable ι] (a : ι → ℝ) :
+ Measurable (scalarSeries a) := by
+ unfold scalarSeries
+ apply Measurable.tsum
+ intro i
+ exact measurable_const.mul (measurable_pi_apply i)
+
+theorem scalarSeries_hasSum_ae {ι : Type*} [Countable ι]
+ (a : ι → ℝ) (hs : Summable a) :
+ ∀ᵐ ω ∂coefficientLaw ι, HasSum (fun i => a i * ω i) (scalarSeries a ω) := by
+ filter_upwards [weighted_abs_summable_ae (fun i => |a i|)
+ (fun i => abs_nonneg _) hs.abs] with ω hω
+ have hnorm : Summable (fun i => ‖a i * ω i‖) := by
+ simpa only [Real.norm_eq_abs, abs_mul] using hω
+ exact hnorm.of_norm.hasSum
+
+end I4Foundation
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/DeterminantMoment.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/DeterminantMoment.lean
new file mode 100644
index 000000000..93e296ca1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/DeterminantMoment.lean
@@ -0,0 +1,218 @@
+import Mathlib.MeasureTheory.Integral.Bochner.Basic
+import Mathlib.LinearAlgebra.Matrix.Determinant.Basic
+import Mathlib.Topology.Instances.Matrix
+import Mathlib.MeasureTheory.Order.Group.Lattice
+import Mathlib.Tactic.FieldSimp
+import Mathlib.Tactic.Ring
+import Mathlib.Tactic.NormNum
+import Mathlib.Tactic.Positivity
+import Mathlib.Tactic.Linarith
+import Mathlib.Tactic.FinCases
+import Mathlib.Tactic.FunProp
+import Mathlib.Tactic.Push
+
+namespace ResearchFormalCoreR1
+
+set_option autoImplicit false
+
+open MeasureTheory
+open scoped BigOperators
+
+abbrev DM2Jet := Fin 9 → ℝ
+
+def dm2Radius (j : DM2Jet) : ℝ := 1 + ∑ i, |j i|
+
+noncomputable def dm2HM (r : ℝ) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) ℝ :=
+ !![-r + r^2*j 4/12, -j 1*r/2 + r^2*j 5/12;
+ -j 1*r/2 + r^2*j 5/12, j 0-r*j 2/2+r^2*j 6/8]
+
+noncomputable def dm2HS (r : ℝ) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) ℝ :=
+ !![r + r^2*j 4/12, j 1*r/2 + r^2*j 5/12;
+ j 1*r/2 + r^2*j 5/12, j 0+r*j 2/2+r^2*j 6/8]
+
+/-- The source's negative-definite condition, stated as the quadratic form. -/
+def dm2Negative (H : Matrix (Fin 2) (Fin 2) ℝ) : Prop :=
+ ∀ v : Fin 2 → ℝ, v ≠ 0 → ∑ i, ∑ k, v i * H i k * v k < 0
+
+noncomputable def dm2Weight (r : ℝ) (j : DM2Jet) : ℝ := by
+ classical
+ exact if dm2Negative (dm2HM r j) ∧ (dm2HS r j).det < 0 then
+ |(dm2HM r j).det * (dm2HS r j).det| else 0
+
+private lemma dm2_scale (r x : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1) :
+ |r*x| ≤ |x| := by
+ rw [abs_mul, abs_of_nonneg hr]
+ nlinarith [abs_nonneg x]
+
+private lemma dm2_factors (r A B C R : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1)
+ (hR : 0 ≤ R) (hA : |A| ≤ R) (hB : |B| ≤ R) (hC : |C| ≤ R) :
+ |A*C-r*B^2| ≤ 2*R^2 := by
+ have hAC : |A*C| ≤ R^2 := by
+ rw [abs_mul, pow_two]
+ exact mul_le_mul hA hC (abs_nonneg _) hR
+ have hBB : B^2 ≤ R^2 := by nlinarith [sq_abs B, abs_nonneg B]
+ have hrBB : |r*B^2| ≤ R^2 := by
+ rw [abs_of_nonneg (mul_nonneg hr (sq_nonneg B))]
+ nlinarith [sq_nonneg B]
+ exact (abs_sub _ _).trans (by linarith)
+
+/-- Exact untyped determinant domination; no jet-coordinate or type assumptions. -/
+theorem dm2_untyped (r : ℝ) (j : DM2Jet) (hr : 0 < r) (hr1 : r ≤ 1) :
+ ((dm2HM r j).det * (dm2HS r j).det)^2 ≤ 16*r^4*dm2Radius j^8 := by
+ let R := dm2Radius j
+ have hR : 0 ≤ R := by dsimp [R, dm2Radius]; positivity
+ have hsum : (∑ i, |j i|) = |j 0|+|j 1|+|j 2|+|j 3|+|j 4|+|j 5|+|j 6|+|j 7|+|j 8| := by
+ simp [Fin.sum_univ_succ]; ring
+ have hbudget : 1+|j 0|+|j 1|+|j 2|+|j 4|+|j 5|+|j 6| ≤ R := by
+ dsimp [R, dm2Radius]; rw [hsum]
+ linarith [abs_nonneg (j 3), abs_nonneg (j 7), abs_nonneg (j 8)]
+ have hscale (i : Fin 9) : r*|j i| ≤ |j i| := by nlinarith [abs_nonneg (j i)]
+ have hscale2 (i : Fin 9) : r^2*|j i| ≤ |j i| := by
+ exact mul_le_of_le_one_left (abs_nonneg _) (by nlinarith)
+ have haM : |-1+r*j 4/12| ≤ R := by
+ calc
+ _ ≤ 1+|j 4| := by
+ have := abs_add_le (-1 : ℝ) (r*j 4/12)
+ rw [abs_div] at this
+ norm_num [abs_of_pos hr] at this
+ linarith [hscale 4, abs_nonneg (j 4)]
+ _ ≤ R := by linarith [abs_nonneg (j 0), abs_nonneg (j 1), abs_nonneg (j 2), abs_nonneg (j 5), abs_nonneg (j 6)]
+ have haS : |1+r*j 4/12| ≤ R := by
+ have := abs_add_le (1 : ℝ) (r*j 4/12)
+ rw [abs_div] at this
+ norm_num [abs_of_pos hr] at this
+ linarith [hscale 4, abs_nonneg (j 0), abs_nonneg (j 1), abs_nonneg (j 2), abs_nonneg (j 4), abs_nonneg (j 5), abs_nonneg (j 6)]
+ have hbM : |-j 1/2+r*j 5/12| ≤ R := by
+ have := abs_add_le (-j 1/2) (r*j 5/12)
+ simp only [abs_div, abs_neg] at this
+ norm_num [abs_of_pos hr] at this
+ linarith [hscale 5, abs_nonneg (j 0), abs_nonneg (j 1), abs_nonneg (j 2), abs_nonneg (j 4), abs_nonneg (j 5), abs_nonneg (j 6)]
+ have hbS : |j 1/2+r*j 5/12| ≤ R := by
+ have := abs_add_le (j 1/2) (r*j 5/12)
+ simp only [abs_div] at this
+ norm_num [abs_of_pos hr] at this
+ linarith [hscale 5, abs_nonneg (j 0), abs_nonneg (j 1), abs_nonneg (j 2), abs_nonneg (j 4), abs_nonneg (j 5), abs_nonneg (j 6)]
+ have hcM : |j 0-r*j 2/2+r^2*j 6/8| ≤ R := by
+ have h1 := abs_sub (j 0) (r*j 2/2)
+ have h2 := abs_add_le (j 0-r*j 2/2) (r^2*j 6/8)
+ simp only [abs_div] at h1 h2
+ norm_num [abs_of_pos hr] at h1 h2
+ linarith [hscale 2, hscale2 6, abs_nonneg (j 1), abs_nonneg (j 2), abs_nonneg (j 4), abs_nonneg (j 5), abs_nonneg (j 6)]
+ have hcS : |j 0+r*j 2/2+r^2*j 6/8| ≤ R := by
+ have h1 := abs_add_le (j 0) (r*j 2/2)
+ have h2 := abs_add_le (j 0+r*j 2/2) (r^2*j 6/8)
+ simp only [abs_div] at h1 h2
+ norm_num [abs_of_pos hr] at h1 h2
+ linarith [hscale 2, hscale2 6, abs_nonneg (j 1), abs_nonneg (j 2), abs_nonneg (j 4), abs_nonneg (j 5), abs_nonneg (j 6)]
+ have hM := dm2_factors r _ _ _ R hr.le hr1 hR haM hbM hcM
+ have hS := dm2_factors r _ _ _ R hr.le hr1 hR haS hbS hcS
+ have hprod : |((-1+r*j 4/12)*(j 0-r*j 2/2+r^2*j 6/8)-r*(-j 1/2+r*j 5/12)^2) *
+ ((1+r*j 4/12)*(j 0+r*j 2/2+r^2*j 6/8)-r*(j 1/2+r*j 5/12)^2)| ≤ (2*R^2)^2 := by
+ rw [abs_mul]
+ calc
+ _ ≤ (2*R^2)*(2*R^2) := mul_le_mul hM hS (abs_nonneg _) (by positivity)
+ _ = (2*R^2)^2 := (pow_two _).symm
+ have hsquare : (((-1+r*j 4/12)*(j 0-r*j 2/2+r^2*j 6/8)-r*(-j 1/2+r*j 5/12)^2) *
+ ((1+r*j 4/12)*(j 0+r*j 2/2+r^2*j 6/8)-r*(j 1/2+r*j 5/12)^2))^2 ≤ ((2*R^2)^2)^2 := by
+ simpa only [sq_abs] using
+ (sq_le_sq₀ (abs_nonneg _) (sq_nonneg (2*R^2))).2 hprod
+ have hid : ((dm2HM r j).det*(dm2HS r j).det)^2 = r^4 *
+ (((-1+r*j 4/12)*(j 0-r*j 2/2+r^2*j 6/8)-r*(-j 1/2+r*j 5/12)^2) *
+ ((1+r*j 4/12)*(j 0+r*j 2/2+r^2*j 6/8)-r*(j 1/2+r*j 5/12)^2))^2 := by
+ simp [dm2HM, dm2HS, Matrix.det_fin_two]; ring
+ rw [hid]
+ calc
+ _ ≤ r^4*((2*R^2)^2)^2 := mul_le_mul_of_nonneg_left hsquare (by positivity)
+ _ = 16*r^4*dm2Radius j^8 := by dsimp [R]; ring
+
+/-- P02-LM-002 section 2, with the literal quadratic-form type indicator. -/
+theorem dm2_pointwise (r : ℝ) (j : DM2Jet) (hr : 0 < r) (hr1 : r ≤ 1) :
+ dm2Weight r j ^ 2 ≤ 16*r^4*dm2Radius j^8 := by
+ classical
+ unfold dm2Weight
+ split_ifs
+ · simpa only [sq_abs] using dm2_untyped r j hr hr1
+ · simpa only [zero_pow (by decide : (2 : ℕ) ≠ 0)] using
+ (show 0 ≤ 16*r^4*dm2Radius j^8 by positivity)
+
+/-- Two-dimensional Sylvester criterion for the literal quadratic-form definition. -/
+theorem dm2_negative_iff (a b c : ℝ) :
+ dm2Negative !![a,b;b,c] ↔ a < 0 ∧ 0 < a*c-b^2 := by
+ constructor
+ · intro h
+ have ha := h ![1,0] (by simp)
+ simp [Fin.sum_univ_two] at ha
+ have hv : (![(-b),a] : Fin 2 → ℝ) ≠ 0 := by
+ intro heq
+ have := congrFun heq 1
+ simp at this
+ linarith
+ have hd := h ![-b,a] hv
+ simp [Fin.sum_univ_two] at hd
+ refine ⟨ha, ?_⟩
+ by_contra hn
+ have hh : 0 ≤ a*(a*c-b^2) := mul_nonneg_of_nonpos_of_nonpos ha.le (le_of_not_gt hn)
+ nlinarith
+ · rintro ⟨ha,hd⟩ v hv
+ have hvxy : v 0 ≠ 0 ∨ v 1 ≠ 0 := by
+ by_contra hn
+ push Not at hn
+ apply hv
+ ext i
+ fin_cases i <;> simp_all
+ have hq : 0 < (a*v 0+b*v 1)^2+(a*c-b^2)*(v 1)^2 := by
+ rcases eq_or_ne (v 1) 0 with hy|hy
+ · have hx : v 0 ≠ 0 := hvxy.resolve_right (not_ne_iff.mpr hy)
+ simpa [hy] using sq_pos_of_ne_zero (mul_ne_zero ha.ne hx)
+ · exact add_pos_of_nonneg_of_pos (sq_nonneg _) (mul_pos hd (sq_pos_of_ne_zero hy))
+ simp [Fin.sum_univ_two]
+ nlinarith
+
+/-- Measurability of the exact typed weight, with no assumed type-null boundary. -/
+theorem dm2_weight_measurable (r : ℝ) : Measurable (dm2Weight r) := by
+ classical
+ have hm : Continuous (fun j : DM2Jet => (dm2HM r j).det) := by
+ simp only [dm2HM, Matrix.det_fin_two]
+ fun_prop
+ have hs : Continuous (fun j : DM2Jet => (dm2HS r j).det) := by
+ simp only [dm2HS, Matrix.det_fin_two]
+ fun_prop
+ have htype : MeasurableSet {j : DM2Jet | dm2Negative (dm2HM r j) ∧ (dm2HS r j).det < 0} := by
+ simp only [dm2HM, dm2_negative_iff]
+ apply MeasurableSet.inter
+ · apply MeasurableSet.inter
+ · have h : Continuous (fun j : DM2Jet => -r+r^2*j 4/12) := by fun_prop
+ exact (isOpen_lt h continuous_const).measurableSet
+ · have h : Continuous (fun j : DM2Jet => (-r+r^2*j 4/12)*(j 0-r*j 2/2+r^2*j 6/8)-(-j 1*r/2+r^2*j 5/12)^2) := by fun_prop
+ exact (isOpen_lt continuous_const h).measurableSet
+ · exact (isOpen_lt hs continuous_const).measurableSet
+ change Measurable (fun j : DM2Jet => if dm2Negative (dm2HM r j) ∧ (dm2HS r j).det < 0 then |(dm2HM r j).det*(dm2HS r j).det| else 0)
+ exact Measurable.ite htype (hm.measurable.mul hs.measurable).abs measurable_const
+
+/-- P02-LM-002's expectation step: eighth-moment control supplies integrability
+and the second moment, rather than presupposing that second moment. -/
+theorem dm2_moment {Ω : Type*} [MeasurableSpace Ω] (μ : MeasureTheory.Measure Ω)
+ (J : Ω → DM2Jet) (hJ : Measurable J) (r M8 : ℝ) (hr : 0 < r) (hr1 : r ≤ 1)
+ (h8 : MeasureTheory.Integrable (fun x => dm2Radius (J x)^8) μ)
+ (hM8 : (∫ x, dm2Radius (J x)^8 ∂μ) ≤ M8) :
+ MeasureTheory.Integrable (fun x => dm2Weight r (J x)^2) μ ∧
+ (∫ x, dm2Weight r (J x)^2 ∂μ) ≤ 16*M8*r^4 := by
+ have hmajor : MeasureTheory.Integrable (fun x => 16*r^4*dm2Radius (J x)^8) μ :=
+ h8.const_mul _
+ have hmeas : MeasureTheory.AEStronglyMeasurable (fun x => dm2Weight r (J x)^2) μ :=
+ (((dm2_weight_measurable r).comp hJ).pow_const 2).aestronglyMeasurable
+ have hi : MeasureTheory.Integrable (fun x => dm2Weight r (J x)^2) μ :=
+ hmajor.mono' hmeas (Filter.Eventually.of_forall (fun x => by
+ rw [Real.norm_eq_abs, abs_of_nonneg (sq_nonneg _)]
+ exact dm2_pointwise r (J x) hr hr1))
+ refine ⟨hi, ?_⟩
+ calc
+ _ ≤ ∫ x, 16*r^4*dm2Radius (J x)^8 ∂μ :=
+ MeasureTheory.integral_mono hi hmajor (fun x => dm2_pointwise r (J x) hr hr1)
+ _ = 16*r^4*(∫ x, dm2Radius (J x)^8 ∂μ) := MeasureTheory.integral_const_mul _ _
+ _ ≤ 16*r^4*M8 := mul_le_mul_of_nonneg_left hM8 (by positivity)
+ _ = 16*M8*r^4 := by ring
+
+end ResearchFormalCoreR1
+
+
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointGaussianMoments.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointGaussianMoments.lean
new file mode 100644
index 000000000..7683112b1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointGaussianMoments.lean
@@ -0,0 +1,139 @@
+import ResearchFormalCoreR1.GaussianJetMoments
+
+/-! Gaussian moments for the six actual normalized endpoint entries from
+GP-DER-047 section 13. Coordinates are (fxx(M)/r,fxy(M)/r,fyy(M),
+fxx(S)/r,fxy(S)/r,fyy(S)); no polynomial midpoint-jet identity is assumed. -/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory ProbabilityTheory
+open scoped BigOperators NNReal
+
+set_option autoImplicit false
+
+def egm_HM (r : ℝ) (j : Fin 6 → ℝ) : Matrix (Fin 2) (Fin 2) ℝ :=
+ !![r * j 0, r * j 1; r * j 1, j 2]
+
+def egm_HS (r : ℝ) (j : Fin 6 → ℝ) : Matrix (Fin 2) (Fin 2) ℝ :=
+ !![r * j 3, r * j 4; r * j 4, j 5]
+
+noncomputable def egm_weight (r : ℝ) (j : Fin 6 → ℝ) : ℝ := by
+ classical
+ exact if dm2Negative (egm_HM r j) ∧ (egm_HS r j).det < 0 then
+ |(egm_HM r j).det * (egm_HS r j).det| else 0
+
+/-- The maximum condition is the original strict quadratic-form condition;
+no null-boundary assumption is needed for measurable typing. -/
+theorem egm_weight_measurable (r : ℝ) : Measurable (egm_weight r) := by
+ classical
+ have hm : Continuous (fun j : Fin 6 → ℝ => (egm_HM r j).det) := by
+ simp only [egm_HM, Matrix.det_fin_two]
+ fun_prop
+ have hs : Continuous (fun j : Fin 6 → ℝ => (egm_HS r j).det) := by
+ simp only [egm_HS, Matrix.det_fin_two]
+ fun_prop
+ have htype : MeasurableSet {j : Fin 6 → ℝ |
+ dm2Negative (egm_HM r j) ∧ (egm_HS r j).det < 0} := by
+ simp only [egm_HM, dm2_negative_iff]
+ apply MeasurableSet.inter
+ · apply MeasurableSet.inter
+ · have h : Continuous (fun j : Fin 6 → ℝ => r * j 0) := by fun_prop
+ exact (isOpen_lt h continuous_const).measurableSet
+ · have h : Continuous (fun j : Fin 6 → ℝ =>
+ (r * j 0) * j 2 - (r * j 1) ^ 2) := by fun_prop
+ exact (isOpen_lt continuous_const h).measurableSet
+ · exact (isOpen_lt hs continuous_const).measurableSet
+ change Measurable (fun j => if dm2Negative (egm_HM r j) ∧ (egm_HS r j).det < 0
+ then |(egm_HM r j).det * (egm_HS r j).det| else 0)
+ exact Measurable.ite htype (hm.measurable.mul hs.measurable).abs measurable_const
+
+private theorem egm_coordinate_bound (j : Fin 6 → ℝ) (i : Fin 6) :
+ |j i| ≤ gm8Radius j := by
+ have hsum : |j i| ≤ ∑ k, |j k| :=
+ Finset.single_le_sum (fun k _ => abs_nonneg (j k)) (Finset.mem_univ i)
+ unfold gm8Radius
+ linarith
+
+private theorem egm_factor_bound (r a b c R : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1)
+ (hR : 0 ≤ R) (ha : |a| ≤ R) (hb : |b| ≤ R) (hc : |c| ≤ R) :
+ |a * c - r * b ^ 2| ≤ 2 * R ^ 2 := by
+ have hac : |a * c| ≤ R ^ 2 := by
+ rw [abs_mul, pow_two]
+ exact mul_le_mul ha hc (abs_nonneg c) hR
+ have hbb : b ^ 2 ≤ R ^ 2 := by nlinarith [sq_abs b, abs_nonneg b]
+ have hrbb : |r * b ^ 2| ≤ R ^ 2 := by
+ rw [abs_of_nonneg (mul_nonneg hr (sq_nonneg b))]
+ exact (mul_le_of_le_one_left (sq_nonneg b) hr1).trans hbb
+ exact (abs_sub _ _).trans (by linarith)
+
+private theorem egm_untyped (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :
+ ((egm_HM r j).det * (egm_HS r j).det) ^ 2 ≤
+ 16 * r ^ 4 * gm8Radius j ^ 8 := by
+ let R := gm8Radius j
+ let dM := j 0 * j 2 - r * j 1 ^ 2
+ let dS := j 3 * j 5 - r * j 4 ^ 2
+ have hR : 0 ≤ R := by dsimp [R, gm8Radius]; positivity
+ have hM : |dM| ≤ 2 * R ^ 2 :=
+ egm_factor_bound r _ _ _ R hr.le hr1 hR
+ (egm_coordinate_bound j 0) (egm_coordinate_bound j 1) (egm_coordinate_bound j 2)
+ have hS : |dS| ≤ 2 * R ^ 2 :=
+ egm_factor_bound r _ _ _ R hr.le hr1 hR
+ (egm_coordinate_bound j 3) (egm_coordinate_bound j 4) (egm_coordinate_bound j 5)
+ have hprod : |dM * dS| ≤ (2 * R ^ 2) ^ 2 := by
+ rw [abs_mul, pow_two]
+ exact mul_le_mul hM hS (abs_nonneg _) (by positivity)
+ have hsq : (dM * dS) ^ 2 ≤ ((2 * R ^ 2) ^ 2) ^ 2 := by
+ simpa only [sq_abs] using
+ (sq_le_sq₀ (abs_nonneg (dM * dS)) (sq_nonneg (2 * R ^ 2))).2 hprod
+ have hdet : ((egm_HM r j).det * (egm_HS r j).det) ^ 2 =
+ r ^ 4 * (dM * dS) ^ 2 := by
+ simp [egm_HM, egm_HS, Matrix.det_fin_two, dM, dS]
+ ring
+ calc
+ _ = r ^ 4 * (dM * dS) ^ 2 := hdet
+ _ ≤ r ^ 4 * ((2 * R ^ 2) ^ 2) ^ 2 :=
+ mul_le_mul_of_nonneg_left hsq (by positivity)
+ _ = 16 * r ^ 4 * gm8Radius j ^ 8 := by dsimp [R]; ring
+
+/-- Exact endpoint determinant domination in the actual normalized six-vector.
+The type indicators can only reduce the nonnegative determinant product. -/
+theorem egm_pointwise (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :
+ egm_weight r j ^ 2 ≤ 16 * r ^ 4 * gm8Radius j ^ 8 := by
+ classical
+ unfold egm_weight
+ split_ifs
+ · simpa only [sq_abs] using egm_untyped r j hr hr1
+ · simpa only [zero_pow (by decide : (2 : ℕ) ≠ 0)] using
+ (show 0 ≤ 16 * r ^ 4 * gm8Radius j ^ 8 by positivity)
+
+/-- Genuine Gaussian marginal laws of the actual normalized endpoint vector
+supply both integrability and its determinant second moment. The derivative-map,
+conditioning law and uniform parameter bounds remain explicit model inputs. -/
+theorem egm_gaussian_moment {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → Fin 6 → ℝ)
+ (hJ : Measurable J) (m : Fin 6 → ℝ) (v : Fin 6 → ℝ≥0)
+ (B V r : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V) (hr : 0 < r) (hr1 : r ≤ 1)
+ (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)
+ (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :
+ Integrable (fun x => egm_weight r (J x) ^ 2) μ ∧
+ (∫ x, egm_weight r (J x) ^ 2 ∂μ) ≤ 16 * gm8FiniteM8 6 B V * r ^ 4 := by
+ obtain ⟨h8, hbound⟩ := gm8_finite_integrable_bound 6 μ J hJ m v B V hB hV
+ hmean hvar hlaw
+ have hmajor : Integrable (fun x => 16 * r ^ 4 * gm8Radius (J x) ^ 8) μ :=
+ h8.const_mul _
+ have hmeas : AEStronglyMeasurable (fun x => egm_weight r (J x) ^ 2) μ :=
+ (((egm_weight_measurable r).comp hJ).pow_const 2).aestronglyMeasurable
+ have hi : Integrable (fun x => egm_weight r (J x) ^ 2) μ :=
+ hmajor.mono' hmeas (Filter.Eventually.of_forall (fun x => by
+ rw [Real.norm_eq_abs, abs_of_nonneg (sq_nonneg _)]
+ exact egm_pointwise r (J x) hr hr1))
+ refine ⟨hi, ?_⟩
+ calc
+ _ ≤ ∫ x, 16 * r ^ 4 * gm8Radius (J x) ^ 8 ∂μ :=
+ integral_mono hi hmajor (fun x => egm_pointwise r (J x) hr hr1)
+ _ = 16 * r ^ 4 * (∫ x, gm8Radius (J x) ^ 8 ∂μ) := integral_const_mul _ _
+ _ ≤ 16 * r ^ 4 * gm8FiniteM8 6 B V :=
+ mul_le_mul_of_nonneg_left hbound (by positivity)
+ _ = 16 * gm8FiniteM8 6 B V * r ^ 4 := by ring
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointNormalizerBridge.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointNormalizerBridge.lean
new file mode 100644
index 000000000..73d861b7e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointNormalizerBridge.lean
@@ -0,0 +1,191 @@
+import ResearchFormalCoreR1.EndpointGaussianMoments
+import ResearchFormalCoreR1.NormalizerFloor
+
+/-!
+# Literal endpoint weight and continuous normalized weight
+
+The actual endpoint vector has order `(aM,bM,cM,aS,bS,cS)`, while the
+continuous normalizer uses `(aM,aS,bM,bS,cM,cS)`. The permutation below
+and the identity hold pointwise, including all determinant/type boundaries.
+See ../SOURCE_ENDPOINT_NORMALIZER_BRIDGE.md for the frozen source contract.
+-/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory ProbabilityTheory Filter
+open scoped Topology NNReal
+
+set_option autoImplicit false
+
+/-- Convert the actual six endpoint entries to the continuous weight's order. -/
+def enb_permutation (j : Fin 6 → ℝ) : Fin 6 → ℝ :=
+ ![j 0, j 3, j 1, j 4, j 2, j 5]
+
+theorem enb_permutation_continuous : Continuous enb_permutation := by
+ unfold enb_permutation
+ fun_prop
+
+private theorem enb_maximum_factor (r a b c : ℝ) (hr : 0 < r) :
+ max (max (-a) 0 * max (-c) 0 - r * b ^ 2) 0 =
+ if a < 0 ∧ 0 < a * c - r * b ^ 2 then a * c - r * b ^ 2 else 0 := by
+ by_cases h : a < 0 ∧ 0 < a * c - r * b ^ 2
+ · have hc : c < 0 := by
+ by_contra hn
+ have hac : a * c ≤ 0 := mul_nonpos_of_nonpos_of_nonneg h.1.le (le_of_not_gt hn)
+ have hrb : 0 ≤ r * b ^ 2 := mul_nonneg hr.le (sq_nonneg b)
+ linarith [h.2]
+ rw [ite_eq_left h, max_eq_left (neg_nonneg.mpr h.1.le),
+ max_eq_left (neg_nonneg.mpr hc.le)]
+ have heq : -a * -c - r * b ^ 2 = a * c - r * b ^ 2 := by ring
+ rw [heq, max_eq_left h.2.le]
+ · rw [ite_eq_right h]
+ by_cases ha : a < 0
+ · have hd : a * c - r * b ^ 2 ≤ 0 :=
+ le_of_not_gt (fun hp => h ⟨ha, hp⟩)
+ by_cases hc : c ≤ 0
+ · rw [max_eq_left (neg_nonneg.mpr ha.le), max_eq_left (neg_nonneg.mpr hc)]
+ have heq : -a * -c - r * b ^ 2 = a * c - r * b ^ 2 := by ring
+ rw [heq, max_eq_right hd]
+ · rw [max_eq_right (by linarith : -c ≤ 0)]
+ simpa using (max_eq_right (neg_nonpos.mpr (mul_nonneg hr.le (sq_nonneg b))))
+ · rw [max_eq_right (by linarith : -a ≤ 0)]
+ simpa using (max_eq_right (neg_nonpos.mpr (mul_nonneg hr.le (sq_nonneg b))))
+
+/-- Strict negative definiteness in actual endpoint coordinates, with no
+assumed sign of the other diagonal entry or omission of singular boundaries. -/
+theorem enb_maximum_iff (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :
+ dm2Negative (egm_HM r j) ↔ j 0 < 0 ∧ 0 < j 0 * j 2 - r * j 1 ^ 2 := by
+ rw [egm_HM, dm2_negative_iff]
+ have heq : r * j 0 * j 2 - (r * j 1) ^ 2 =
+ r * (j 0 * j 2 - r * j 1 ^ 2) := by ring
+ have hmul (x : ℝ) : r * x < 0 ↔ x < 0 := by
+ constructor <;> intro hx <;> nlinarith
+ rw [heq, hmul, mul_pos_iff_of_pos_left hr]
+
+/-- The literal strict saddle condition is the sign of its factored determinant. -/
+theorem enb_saddle_iff (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :
+ (egm_HS r j).det < 0 ↔ j 3 * j 5 - r * j 4 ^ 2 < 0 := by
+ have heq : (egm_HS r j).det = r * (j 3 * j 5 - r * j 4 ^ 2) := by
+ simp [egm_HS, Matrix.det_fin_two]
+ ring
+ rw [heq]
+ constructor <;> intro h <;> nlinarith
+
+/-- Exact bridge from the literal typed physical endpoint weight to the
+continuous expression. All excluded types and all zero boundaries give zero. -/
+theorem enb_weight_identity (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :
+ egm_weight r j = r ^ 2 * gn_normalizedWeight r (enb_permutation j) := by
+ classical
+ have hM := enb_maximum_iff r j hr
+ have hS := enb_saddle_iff r j hr
+ have hdetM : (egm_HM r j).det = r * (j 0 * j 2 - r * j 1 ^ 2) := by
+ simp [egm_HM, Matrix.det_fin_two]
+ ring
+ have hdetS : (egm_HS r j).det = r * (j 3 * j 5 - r * j 4 ^ 2) := by
+ simp [egm_HS, Matrix.det_fin_two]
+ ring
+ unfold egm_weight gn_normalizedWeight
+ change (if dm2Negative (egm_HM r j) ∧ (egm_HS r j).det < 0 then
+ |(egm_HM r j).det * (egm_HS r j).det| else 0) =
+ r ^ 2 * (max (max (-j 0) 0 * max (-j 2) 0 - r * j 1 ^ 2) 0 *
+ max (r * j 4 ^ 2 - j 3 * j 5) 0)
+ rw [enb_maximum_factor r (j 0) (j 1) (j 2) hr]
+ by_cases hmax : j 0 < 0 ∧ 0 < j 0 * j 2 - r * j 1 ^ 2
+ · rw [ite_eq_left hmax]
+ by_cases hsad : j 3 * j 5 - r * j 4 ^ 2 < 0
+ · rw [ite_eq_left ⟨hM.mpr hmax, hS.mpr hsad⟩, hdetM, hdetS]
+ rw [max_eq_left (by linarith : 0 ≤ r * j 4 ^ 2 - j 3 * j 5)]
+ have hp : r * (j 0 * j 2 - r * j 1 ^ 2) *
+ (r * (j 3 * j 5 - r * j 4 ^ 2)) ≤ 0 :=
+ mul_nonpos_of_nonneg_of_nonpos (mul_nonneg hr.le hmax.2.le)
+ (mul_nonpos_of_nonneg_of_nonpos hr.le hsad.le)
+ rw [abs_of_nonpos hp]
+ ring
+ · rw [ite_eq_right (fun h => hsad (hS.mp h.2)),
+ max_eq_right (by linarith : r * j 4 ^ 2 - j 3 * j 5 ≤ 0)]
+ ring
+ · rw [ite_eq_right hmax, ite_eq_right (fun h => hmax (hM.mp h.1))]
+ ring
+
+/-- The physical and continuous normalizers are the same integral up to the
+exact radius factor, for any common random six-vector and any measure. -/
+theorem enb_integral_identity {Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) (J : Ω → Fin 6 → ℝ) (r : ℝ) (hr : 0 < r) :
+ (∫ ω, egm_weight r (J ω) ∂P) =
+ r ^ 2 * ∫ ω, gn_normalizedWeight r (enb_permutation (J ω)) ∂P := by
+ calc
+ _ = ∫ ω, r ^ 2 * gn_normalizedWeight r (enb_permutation (J ω)) ∂P :=
+ integral_congr_ae (Eventually.of_forall (fun ω => enb_weight_identity r (J ω) hr))
+ _ = _ := integral_const_mul _ _
+
+/-- Positive radius makes the exact scaling nonzero, so either weight is
+integrable precisely when the other is. -/
+theorem enb_integrable_iff {Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) (J : Ω → Fin 6 → ℝ) (r : ℝ) (hr : 0 < r) :
+ Integrable (fun ω => egm_weight r (J ω)) P ↔
+ Integrable (fun ω => gn_normalizedWeight r (enb_permutation (J ω))) P := by
+ have heq : (fun ω => egm_weight r (J ω)) =
+ (fun ω => r ^ 2 * gn_normalizedWeight r (enb_permutation (J ω))) :=
+ funext (fun ω => enb_weight_identity r (J ω) hr)
+ rw [heq, integrable_const_mul_iff (isUnit_iff_ne_zero.mpr (pow_ne_zero 2 hr.ne'))]
+
+/-- On a finite measure, the actual endpoint second-moment theorem supplies
+the first-moment hypotheses needed by the normalizer join. -/
+theorem enb_integrable_of_integrable_sq {Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) [IsFiniteMeasure P]
+ (J : Ω → Fin 6 → ℝ) (hJ : Measurable J) (r : ℝ) (hr : 0 < r)
+ (hsq : Integrable (fun ω => egm_weight r (J ω) ^ 2) P) :
+ Integrable (fun ω => egm_weight r (J ω)) P ∧
+ Integrable (fun ω => gn_normalizedWeight r (enb_permutation (J ω))) P := by
+ have hmajor : Integrable (fun ω => 1 + egm_weight r (J ω) ^ 2) P :=
+ (integrable_const 1).add hsq
+ have hphysical : Integrable (fun ω => egm_weight r (J ω)) P := by
+ apply hmajor.mono' (((egm_weight_measurable r).comp hJ).aestronglyMeasurable)
+ filter_upwards [] with ω
+ rw [Real.norm_eq_abs]
+ change |egm_weight r (J ω)| ≤ 1 + egm_weight r (J ω) ^ 2
+ nlinarith [sq_nonneg (|egm_weight r (J ω)| - 1/2), sq_abs (egm_weight r (J ω))]
+ exact ⟨hphysical, (enb_integrable_iff P J r hr).mp hphysical⟩
+
+/-- The proved common-coupling normalizer floor transfers to the literal
+physical endpoint weight, with its own actual coordinate order. Current
+physical integrability and the conditioned-field convergence remain inputs. -/
+theorem enb_normalizer_floor_of_common_coupling
+ {Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) [IsProbabilityMeasure P]
+ (J : ℝ → Ω → Fin 6 → ℝ) (hJ : ∀ r, Measurable (J r))
+ (A Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)
+ (hQ : HasLaw Q (gaussianReal m v) P)
+ (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => J r ω) (𝓝[>] (0 : ℝ))
+ (𝓝 ![-1,-A ω/2,Q ω,1,A ω/2,Q ω]))
+ (hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),
+ Integrable (fun ω => egm_weight r (J r ω)) P) :
+ ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧
+ ∀ r : ℝ, 0 < r → r < δ →
+ c * r ^ 2 ≤ ∫ ω, egm_weight r (J r ω) ∂P := by
+ let X : ℝ → Ω → Fin 6 → ℝ := fun r ω => enb_permutation (J r ω)
+ have hX (r : ℝ) : Measurable (X r) :=
+ enb_permutation_continuous.measurable.comp (hJ r)
+ have hXconv : ∀ᵐ ω ∂P, Tendsto (fun r => X r ω) (𝓝[>] (0 : ℝ))
+ (𝓝 ![-1,1,-A ω/2,A ω/2,Q ω,Q ω]) := by
+ filter_upwards [hconv] with ω hω
+ have hp := (enb_permutation_continuous.tendsto
+ ![-1,-A ω/2,Q ω,1,A ω/2,Q ω]).comp hω
+ have hcontact : enb_permutation ![-1,-A ω/2,Q ω,1,A ω/2,Q ω] =
+ ![-1,1,-A ω/2,A ω/2,Q ω,Q ω] := rfl
+ simpa only [Function.comp_def, hcontact, X] using hp
+ have hXint : ∀ᶠ r in 𝓝[>] (0 : ℝ),
+ Integrable (fun ω => gn_normalizedWeight r (X r ω)) P := by
+ filter_upwards [hint, self_mem_nhdsWithin] with r hri hr
+ exact (enb_integrable_iff P (J r) r hr).mp hri
+ obtain ⟨c, hc, δ, hδ, hfloor⟩ :=
+ gn_normalizer_floor_of_common_coupling P X hX A Q m v hv hQ hXconv hXint
+ refine ⟨c, hc, δ, hδ, ?_⟩
+ intro r hr hrδ
+ have hbound := hfloor r hr hrδ
+ calc
+ c * r ^ 2 ≤ ∫ ω, r ^ 2 * gn_normalizedWeight r (X r ω) ∂P := hbound
+ _ = ∫ ω, egm_weight r (J r ω) ∂P :=
+ integral_congr_ae (Eventually.of_forall (fun ω => (enb_weight_identity r (J r ω) hr).symm))
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianCoupling.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianCoupling.lean
new file mode 100644
index 000000000..143c6253a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianCoupling.lean
@@ -0,0 +1,65 @@
+import Mathlib.Probability.Distributions.Gaussian.Multivariate
+import Mathlib.Probability.HasLaw
+import Mathlib.Analysis.SpecialFunctions.ContinuousFunctionalCalculus.Rpow.Isometric
+
+/-!
+# One continuous standard-Gaussian coupling of a finite Gaussian family
+
+PSD square-root continuity allows singular covariance and arbitrary varying
+means. The affine maps have the literal pinned multivariateGaussian laws.
+Actual source endpoint means/covariances and their limits remain application
+joins; see ../SOURCE_GAUSSIAN_COUPLING.md for the frozen source contract.
+-/
+
+namespace ResearchFormalCoreR1
+open MeasureTheory ProbabilityTheory Filter Matrix WithLp
+open scoped Topology ENNReal NNReal MatrixOrder Matrix.Norms.L2Operator
+set_option autoImplicit false
+
+private theorem gc_matrix_eval_tendsto {ι R : Type*} [Fintype ι] [DecidableEq ι]
+ {u : Filter R} {S : R → Matrix ι ι ℝ} {S0 : Matrix ι ι ℝ}
+ (hS : Tendsto S u (𝓝 S0)) (z : EuclideanSpace ℝ ι) :
+ Tendsto (fun r => Matrix.toEuclideanCLM (𝕜 := ℝ) (S r) z) u
+ (𝓝 (Matrix.toEuclideanCLM (𝕜 := ℝ) S0 z)) := by
+ have hcoord (i j : ι) : Tendsto (fun r => S r i j) u (𝓝 (S0 i j)) :=
+ ((continuous_apply j).tendsto (S0 i)).comp
+ (((continuous_apply i).tendsto S0).comp hS)
+ have hvec : Tendsto (fun r => (S r) *ᵥ ofLp z) u (𝓝 (S0 *ᵥ ofLp z)) := by
+ apply tendsto_pi_nhds.mpr
+ intro i
+ exact tendsto_finsetSum Finset.univ (fun j _ =>
+ (hcoord i j).mul tendsto_const_nhds)
+ change Tendsto (fun r => toLp 2 ((S r) *ᵥ ofLp z)) u
+ (𝓝 (toLp 2 (S0 *ᵥ ofLp z)))
+ exact ((PiLp.continuous_toLp 2 (fun _ : ι => ℝ)).tendsto _).comp hvec
+
+/-- The canonical affine vector on one common standard Gaussian space. -/
+noncomputable def gc_coupledVector {ι : Type*} [Fintype ι] [DecidableEq ι]
+ (m : EuclideanSpace ℝ ι) (S : Matrix ι ι ℝ) (z : EuclideanSpace ℝ ι) :
+ EuclideanSpace ℝ ι := m + Matrix.toEuclideanCLM (𝕜 := ℝ) (CFC.sqrt S) z
+
+/-- Exact marginal law; this is the pinned multivariateGaussian definition. -/
+theorem gc_coupledVector_hasLaw {ι : Type*} [Fintype ι] [DecidableEq ι]
+ (m : EuclideanSpace ℝ ι) (S : Matrix ι ι ℝ) :
+ HasLaw (gc_coupledVector m S) (multivariateGaussian m S)
+ (stdGaussian (EuclideanSpace ℝ ι)) where
+ aemeasurable := by unfold gc_coupledVector; fun_prop
+ map_eq := rfl
+
+/-- Every common Gaussian coordinate converges when means and PSD covariances
+converge. No invertibility, fixed rank, or square-root Lipschitz estimate. -/
+theorem gc_coupledVector_tendsto {ι κ : Type*} [Fintype ι] [DecidableEq ι]
+ (u : Filter κ) (m : κ → EuclideanSpace ℝ ι) (S : κ → Matrix ι ι ℝ)
+ (m0 : EuclideanSpace ℝ ι) (S0 : Matrix ι ι ℝ)
+ (hm : Tendsto m u (𝓝 m0)) (hS : Tendsto S u (𝓝 S0))
+ (hPSD : ∀ᶠ t in u, (S t).PosSemidef) (hPSD0 : S0.PosSemidef)
+ (z : EuclideanSpace ℝ ι) :
+ Tendsto (fun t => gc_coupledVector (m t) (S t) z) u
+ (𝓝 (gc_coupledVector m0 S0 z)) := by
+ have hwithin : Tendsto S u (𝓝[{B : Matrix ι ι ℝ | 0 ≤ B}] S0) :=
+ tendsto_nhdsWithin_iff.mpr ⟨hS, hPSD.mono (fun t ht => ht.nonneg)⟩
+ have hsqrt : Tendsto (fun t => CFC.sqrt (S t)) u (𝓝 (CFC.sqrt S0)) :=
+ (CFC.continuousOn_sqrt S0 hPSD0.nonneg).tendsto.comp hwithin
+ have heval := gc_matrix_eval_tendsto hsqrt z
+ exact hm.add heval
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianJetMoments.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianJetMoments.lean
new file mode 100644
index 000000000..52498daf0
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianJetMoments.lean
@@ -0,0 +1,124 @@
+import ResearchFormalCoreR1.DeterminantMoment
+import ResearchFormalCoreR1.GaussianScalarMoments
+import Mathlib.Probability.HasLaw
+import Mathlib.Algebra.Order.Chebyshev
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory ProbabilityTheory
+open scoped BigOperators NNReal
+
+set_option autoImplicit false
+
+/-- Radius for a finite vector, including its constant one. -/
+def gm8Radius {n : ℕ} (j : Fin n → ℝ) : ℝ := 1 + ∑ i, |j i|
+
+/-- One finite-dimensional Gaussian radius moment constant. -/
+noncomputable def gm8FiniteM8 (n : ℕ) (B V : ℝ) : ℝ :=
+ ((n+1 : ℕ) : ℝ)^7 * (1 + (n : ℝ)*128*(B^8 + V^4*gm8C8))
+
+theorem gm8FiniteM8_nonneg (n : ℕ) (B V : ℝ) : 0 ≤ gm8FiniteM8 n B V := by
+ unfold gm8FiniteM8
+ have hC := gm8_standard_nonneg
+ positivity
+
+/-- The source's exact fixed nine-coordinate constant. -/
+noncomputable def gm8M8 (B V : ℝ) : ℝ :=
+ (10 : ℝ)^7 * (1 + 9*128*(B^8 + V^4*gm8C8))
+
+theorem gm8M8_nonneg (B V : ℝ) : 0 ≤ gm8M8 B V := by
+ simpa [gm8M8, gm8FiniteM8] using gm8FiniteM8_nonneg 9 B V
+
+theorem gm8_finite_radius_power_bound (n : ℕ) (j : Fin n → ℝ) :
+ gm8Radius j ^ 8 ≤ ((n+1 : ℕ) : ℝ)^7 * (1 + ∑ i, |j i|^8) := by
+ let f : Fin (n+1) → ℝ := Fin.cases 1 (fun i : Fin n => |j i|)
+ have h := pow_sum_le_card_mul_sum_pow (s := Finset.univ) (f := f)
+ (fun i _ => by
+ refine Fin.cases ?_ (fun k => ?_) i
+ · norm_num [f]
+ · exact abs_nonneg (j k)) 7
+ simpa [f, gm8Radius, Fin.sum_univ_succ] using h
+
+theorem gm8_finite_integrable_bound (n : ℕ) {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → Fin n → ℝ)
+ (hJ : Measurable J) (m : Fin n → ℝ) (v : Fin n → ℝ≥0)
+ (B V : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V)
+ (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)
+ (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :
+ Integrable (fun x => gm8Radius (J x)^8) μ ∧
+ (∫ x, gm8Radius (J x)^8 ∂μ) ≤ gm8FiniteM8 n B V := by
+ have hi (i : Fin n) : Integrable (fun x => |J x i|^8) μ := by
+ exact (hlaw i).integrable_comp
+ (gm8_scalar_integrable_bound (m i) B V (v i) hB hV (hmean i) (hvar i)).1
+ have hsum : Integrable (fun x => ∑ i, |J x i|^8) μ :=
+ integrable_finsetSum _ (fun i _ => hi i)
+ have hmajor : Integrable (fun x => ((n+1 : ℕ) : ℝ)^7*(1+∑ i, |J x i|^8)) μ :=
+ ((integrable_const 1).add hsum).const_mul _
+ have hc : Continuous (gm8Radius (n := n)) := by unfold gm8Radius; fun_prop
+ have hmeas : AEStronglyMeasurable (fun x => gm8Radius (J x)^8) μ :=
+ ((hc.measurable.comp hJ).pow_const 8).aestronglyMeasurable
+ have hR : Integrable (fun x => gm8Radius (J x)^8) μ :=
+ hmajor.mono' hmeas (Filter.Eventually.of_forall (fun x => by
+ rw [Real.norm_eq_abs, abs_of_nonneg (pow_nonneg (by unfold gm8Radius; positivity) 8)]
+ exact gm8_finite_radius_power_bound n (J x)))
+ have hcoord (i : Fin n) :
+ (∫ x, |J x i|^8 ∂μ) ≤ 128*(B^8+V^4*gm8C8) := by
+ have heq := (hlaw i).integral_comp
+ (show AEStronglyMeasurable (fun y : ℝ => |y|^8) (gaussianReal (m i) (v i)) by fun_prop)
+ exact heq.trans_le (gm8_scalar_integrable_bound (m i) B V (v i) hB hV
+ (hmean i) (hvar i)).2
+ refine ⟨hR, ?_⟩
+ calc
+ _ ≤ ∫ x, ((n+1 : ℕ) : ℝ)^7*(1+∑ i, |J x i|^8) ∂μ :=
+ integral_mono hR hmajor (fun x => gm8_finite_radius_power_bound n (J x))
+ _ = ((n+1 : ℕ) : ℝ)^7*(1+∑ i, ∫ x, |J x i|^8 ∂μ) := by
+ rw [integral_const_mul, integral_add (integrable_const _) hsum,
+ integral_finsetSum _ (fun i _ => hi i)]
+ simp
+ _ ≤ ((n+1 : ℕ) : ℝ)^7*(1+∑ _i : Fin n, 128*(B^8+V^4*gm8C8)) := by
+ apply mul_le_mul_of_nonneg_left _ (by positivity)
+ exact add_le_add le_rfl (Finset.sum_le_sum (fun i _ => hcoord i))
+ _ = gm8FiniteM8 n B V := by simp [gm8FiniteM8, mul_assoc]
+
+/-- The exact DM2 radius is the nine-dimensional specialization. -/
+theorem gm8_radius_power_bound (j : DM2Jet) :
+ dm2Radius j ^ 8 ≤ (10 : ℝ)^7 * (1 + ∑ i, |j i|^8) := by
+ simpa [gm8Radius, dm2Radius] using gm8_finite_radius_power_bound 9 j
+
+/-- The nine-jet Gaussian marginal moment interface, with no independence or
+moment conclusion assumed. -/
+theorem gm8_jet_integrable_bound {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → DM2Jet)
+ (hJ : Measurable J) (m : Fin 9 → ℝ) (v : Fin 9 → ℝ≥0)
+ (B V : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V)
+ (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)
+ (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :
+ Integrable (fun x => dm2Radius (J x)^8) μ ∧
+ (∫ x, dm2Radius (J x)^8 ∂μ) ≤ gm8M8 B V := by
+ simpa [gm8Radius, dm2Radius, gm8M8, gm8FiniteM8] using
+ gm8_finite_integrable_bound 9 μ J hJ m v B V hB hV hmean hvar hlaw
+
+/-- The same B,V give one determinant second-moment coefficient throughout
+0 J r x i) (gaussianReal (m r i) (v r i)) (μ r)) :
+ 0 ≤ 16*gm8M8 B V ∧ ∀ r, 0 < r → r ≤ r0 →
+ Integrable (fun x => dm2Weight r (J r x)^2) (μ r) ∧
+ (∫ x, dm2Weight r (J r x)^2 ∂μ r) ≤ (16*gm8M8 B V)*r^4 := by
+ refine ⟨mul_nonneg (by norm_num) (gm8M8_nonneg B V), ?_⟩
+ intro r hr hr0
+ have : IsProbabilityMeasure (μ r) := hprob r hr hr0
+ obtain ⟨h8, hbound⟩ := gm8_jet_integrable_bound (μ r) (J r) (hJ r hr hr0)
+ (m r) (v r) B V hB hV (hmean r hr hr0) (hvar r hr hr0) (hlaw r hr hr0)
+ exact dm2_moment (μ r) (J r) (hJ r hr hr0) r (gm8M8 B V) hr (hr0.trans hr01)
+ h8 hbound
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizer.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizer.lean
new file mode 100644
index 000000000..a9657cfb8
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizer.lean
@@ -0,0 +1,110 @@
+import Mathlib.Probability.Distributions.Gaussian.Real
+import Mathlib.MeasureTheory.Integral.Bochner.Basic
+import Mathlib.MeasureTheory.Measure.Lebesgue.Basic
+import Mathlib.Tactic.Linarith
+import Mathlib.Tactic.NormNum
+import Mathlib.Tactic.FunProp
+import Mathlib.Tactic.Positivity
+
+/-!
+# Gaussian reference positivity and an endpoint-box weight floor
+
+The literal continuous normalized endpoint weight is from LM006 stability,
+sections 1–2. These components do not construct the conditioned field law,
+its endpoint convergence, a positive box mass, or the full normalizer floor.
+See ../SOURCE_GAUSSIAN_NORMALIZER.md for the frozen source contract.
+-/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory ProbabilityTheory
+open scoped ENNReal NNReal
+
+set_option autoImplicit false
+
+/-- The six coordinates are aM,aS,bM,bS,cM,cS. For physical positive radius,
+the source identifies this continuous expression with its typed W_r/r². -/
+noncomputable def gn_normalizedWeight (r : ℝ) (v : Fin 6 → ℝ) : ℝ :=
+ max (max (-v 0) 0 * max (-v 4) 0 - r * (v 2)^2) 0 *
+ max (r * (v 3)^2 - v 1 * v 5) 0
+
+/-- The contact negative-curvature reference has an integrable, strictly
+positive squared negative part, with arbitrary mean and nonzero variance. -/
+theorem gn_gaussian_reference_integrable_pos (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0) :
+ Integrable (fun q : ℝ => (max (-q) 0)^2) (gaussianReal m v) ∧
+ 0 < ∫ q : ℝ, (max (-q) 0)^2 ∂gaussianReal m v := by
+ have hsq : Integrable (fun q : ℝ => q^2) (gaussianReal m v) := by
+ simpa using (memLp_id_gaussianReal (μ := m) (v := v) 2).integrable_sq
+ have hint : Integrable (fun q : ℝ => (max (-q) 0)^2) (gaussianReal m v) := by
+ apply hsq.mono' (by fun_prop)
+ filter_upwards [] with q
+ rw [Real.norm_eq_abs, abs_of_nonneg (sq_nonneg _)]
+ rcases le_total 0 q with hq | hq
+ · rw [max_eq_right (neg_nonpos.mpr hq)]
+ simpa using sq_nonneg q
+ · rw [max_eq_left (neg_nonneg.mpr hq)]
+ nlinarith
+ have hsupp : Function.support (fun q : ℝ => (max (-q) 0)^2) = Set.Iio 0 := by
+ ext q
+ simp only [Function.mem_support, Set.mem_Iio]
+ constructor
+ · intro h
+ by_contra hn
+ have hq : 0 ≤ q := le_of_not_gt hn
+ apply h
+ simp [max_eq_right (neg_nonpos.mpr hq)]
+ · intro hq
+ have hp : 0 < (max (-q) 0)^2 := sq_pos_of_pos (lt_max_of_lt_left (neg_pos.mpr hq))
+ exact hp.ne'
+ have hmass : 0 < gaussianReal m v (Set.Iio 0) := by
+ apply pos_iff_ne_zero.mpr
+ intro hzero
+ have hvol := (gaussianReal_absolutelyContinuous' m hv) hzero
+ simp at hvol
+ refine ⟨hint, ?_⟩
+ apply (integral_pos_iff_support_of_nonneg (fun q => sq_nonneg _) hint).mpr
+ simpa only [hsupp] using hmass
+
+/-- An explicit open endpoint box has a uniform positive normalized weight.
+This is a pointwise component, with no claimed probability mass for the box. -/
+theorem gn_open_box_floor
+ (r K : ℝ) (v : Fin 6 → ℝ)
+ (hr : 0 ≤ r) (hK : 0 < K) (hsmall : r * K^2 ≤ 1/4)
+ (haM : v 0 ∈ Set.Ioo (-5/4) (-3/4))
+ (haS : v 1 ∈ Set.Ioo (3/4) (5/4))
+ (hbM : |v 2| < K) (_hbS : |v 3| < K)
+ (hcM : v 4 ∈ Set.Ioo (-2) (-1))
+ (hcS : v 5 ∈ Set.Ioo (-2) (-1)) :
+ (3 : ℝ)/8 ≤ gn_normalizedWeight r v := by
+ have ha0 : 3/4 ≤ -v 0 := by linarith [haM.2]
+ have hc4 : 1 ≤ -v 4 := by linarith [hcM.2]
+ have ha1 : 3/4 ≤ v 1 := haS.1.le
+ have hc5 : 1 ≤ -v 5 := by linarith [hcS.2]
+ have hAM : max (-v 0) 0 = -v 0 := max_eq_left (by linarith)
+ have hCM : max (-v 4) 0 = -v 4 := max_eq_left (by linarith)
+ have hb2 : (v 2)^2 ≤ K^2 := by
+ simpa only [sq_abs] using (sq_le_sq₀ (abs_nonneg (v 2)) hK.le).2 hbM.le
+ have hrb : r * (v 2)^2 ≤ 1/4 :=
+ (mul_le_mul_of_nonneg_left hb2 hr).trans hsmall
+ have hprodM : (3 : ℝ)/4 ≤ (-v 0) * (-v 4) := by
+ have h := mul_le_mul ha0 hc4 (by norm_num : (0 : ℝ) ≤ 1) (by linarith : 0 ≤ -v 0)
+ norm_num at h ⊢
+ exact h
+ have hprodS : (3 : ℝ)/4 ≤ -(v 1 * v 5) := by
+ have h := mul_le_mul ha1 hc5 (by norm_num : (0 : ℝ) ≤ 1) (by linarith : 0 ≤ v 1)
+ norm_num at h
+ nlinarith
+ have hF : (1 : ℝ)/2 ≤ max (max (-v 0) 0 * max (-v 4) 0 - r * (v 2)^2) 0 := by
+ rw [hAM, hCM]
+ exact (show (1 : ℝ)/2 ≤ (-v 0) * (-v 4) - r * (v 2)^2 by linarith).trans
+ (le_max_left _ _)
+ have hG : (3 : ℝ)/4 ≤ max (r * (v 3)^2 - v 1 * v 5) 0 := by
+ have hp : 0 ≤ r * (v 3)^2 := mul_nonneg hr (sq_nonneg _)
+ exact (show (3 : ℝ)/4 ≤ r * (v 3)^2 - v 1 * v 5 by linarith).trans
+ (le_max_left _ _)
+ have h := mul_le_mul hF hG (by norm_num : (0 : ℝ) ≤ 3/4)
+ (le_max_right _ _)
+ norm_num at h
+ exact h
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizerLimit.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizerLimit.lean
new file mode 100644
index 000000000..be08ef92c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizerLimit.lean
@@ -0,0 +1,210 @@
+import ResearchFormalCoreR1.GaussianCoupling
+import ResearchFormalCoreR1.NormalizerFloor
+import ResearchFormalCoreR1.EndpointNormalizerBridge
+import Mathlib.Probability.Moments.Variance
+import Mathlib.MeasureTheory.Function.LpSeminorm.CompareExp
+
+/-!
+# A full normalizer floor from finite Gaussian parameter limits
+
+Contact identities follow from the displayed zero variances. The common
+coupling, noncentered nondegenerate scalar reference and weight integrability
+are derived. No positive normalizer, coupling limit or moment bound is assumed.
+Actual torus conditional means/covariances remain a separate source join.
+See ../SOURCE_GAUSSIAN_NORMALIZER_LIMIT.md for the frozen source contract.
+-/
+
+namespace ResearchFormalCoreR1
+open MeasureTheory ProbabilityTheory Filter Matrix WithLp
+open scoped Topology ENNReal NNReal MatrixOrder Matrix.Norms.L2Operator
+set_option autoImplicit false
+
+private theorem gnl_contact_relations (m : EuclideanSpace ℝ (Fin 6)) (S : Matrix (Fin 6) (Fin 6) ℝ)
+ (hS : S.PosSemidef)
+ (hm0 : m 0 = -1) (hm1 : m 1 = 1)
+ (hm23 : m 2 + m 3 = 0) (hm45 : m 4 - m 5 = 0)
+ (hS0 : S 0 0 = 0) (hS1 : S 1 1 = 0)
+ (hS23 : S 2 2 + 2*S 2 3 + S 3 3 = 0)
+ (hS45 : S 4 4 - 2*S 4 5 + S 5 5 = 0) :
+ ∀ᵐ x ∂multivariateGaussian m S,
+ x 0 = -1 ∧ x 1 = 1 ∧ x 2 + x 3 = 0 ∧ x 4 - x 5 = 0 := by
+ let P := multivariateGaussian m S
+ have hLp (i : Fin 6) : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => x i) 2 P := by
+ exact (IsGaussian.memLp_two_id (μ := P)).continuousLinearMap_comp (EuclideanSpace.proj (𝕜 := ℝ) i)
+ have hi (i : Fin 6) : ∫ x : EuclideanSpace ℝ (Fin 6), x i ∂P = m i := by
+ change ∫ x, (EuclideanSpace.proj (𝕜 := ℝ) i) x ∂P = m i
+ rw [ContinuousLinearMap.integral_comp_id_comm]
+ · simp [P]
+ · exact IsGaussian.integrable_id
+ have hvar0 : Var[fun x : EuclideanSpace ℝ (Fin 6) => x 0; P] = 0 := by
+ exact (variance_eval_multivariateGaussian hS 0).trans hS0
+ have hvar1 : Var[fun x : EuclideanSpace ℝ (Fin 6) => x 1; P] = 0 := by
+ exact (variance_eval_multivariateGaussian hS 1).trans hS1
+ have hvar23 : Var[fun x : EuclideanSpace ℝ (Fin 6) => x 2 + x 3; P] = 0 := by
+ rw [variance_fun_add (hLp 2) (hLp 3)]
+ simpa [P, variance_eval_multivariateGaussian hS,
+ covariance_eval_multivariateGaussian hS] using hS23
+ have hvar45 : Var[fun x : EuclideanSpace ℝ (Fin 6) => x 4 - x 5; P] = 0 := by
+ rw [variance_fun_sub (hLp 4) (hLp 5)]
+ simpa [P, variance_eval_multivariateGaussian hS,
+ covariance_eval_multivariateGaussian hS] using hS45
+ have hi23 : ∫ x : EuclideanSpace ℝ (Fin 6), (x 2 + x 3) ∂P = 0 := by
+ rw [integral_add ((hLp 2).integrable (by norm_num)) ((hLp 3).integrable (by norm_num)), hi, hi]
+ exact hm23
+ have hi45 : ∫ x : EuclideanSpace ℝ (Fin 6), (x 4 - x 5) ∂P = 0 := by
+ rw [integral_sub ((hLp 4).integrable (by norm_num)) ((hLp 5).integrable (by norm_num)), hi, hi]
+ exact hm45
+ filter_upwards [ae_eq_integral_of_variance_eq_zero (hLp 0) hvar0,
+ ae_eq_integral_of_variance_eq_zero (hLp 1) hvar1,
+ ae_eq_integral_of_variance_eq_zero ((hLp 2).add (hLp 3)) hvar23,
+ ae_eq_integral_of_variance_eq_zero ((hLp 4).sub (hLp 5)) hvar45]
+ with x hx0 hx1 hx23 hx45
+ exact ⟨hx0.trans ((hi 0).trans hm0), hx1.trans ((hi 1).trans hm1),
+ hx23.trans hi23, hx45.trans hi45⟩
+
+private lemma gnl_positivePart_memLp {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} {f : Ω → ℝ} {p : ℝ≥0∞} (hf : MemLp f p P) :
+ MemLp (fun x => max (f x) 0) p P := by
+ apply hf.norm.mono' ((hf.aestronglyMeasurable.aemeasurable.sup_const 0).aestronglyMeasurable)
+ filter_upwards [] with x
+ rw [Real.norm_eq_abs, Real.norm_eq_abs, abs_of_nonneg (le_max_right _ _)]
+ exact max_le (le_abs_self _) (abs_nonneg _)
+
+private lemma gnl_gaussian_weight_integrable (r : ℝ) (m : EuclideanSpace ℝ (Fin 6))
+ (S : Matrix (Fin 6) (Fin 6) ℝ) (hS : S.PosSemidef) :
+ Integrable (fun x : EuclideanSpace ℝ (Fin 6) => gn_normalizedWeight r (ofLp x))
+ (multivariateGaussian m S) := by
+ have : ENNReal.HolderTriple 4 4 2 := ⟨by
+ rw [← two_mul, show (4 : ℝ≥0∞) = 2*2 by norm_num, ENNReal.mul_inv (by simp) (by simp),
+ ← mul_assoc, ENNReal.mul_inv_cancel two_ne_zero ENNReal.ofNat_ne_top, one_mul]⟩
+ let P := multivariateGaussian m S
+ have hc (i : Fin 6) : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => x i) 4 P := by
+ have hp := measurePreserving_eval_multivariateGaussian (μ := m) hS (i := i)
+ have hlaw : HasLaw (fun x : EuclideanSpace ℝ (Fin 6) => x i)
+ (gaussianReal (m i) (S i i).toNNReal) P := ⟨hp.measurable.aemeasurable, hp.map_eq⟩
+ exact hlaw.memLp (memLp_id_gaussianReal 4)
+ have hpos (i : Fin 6) : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => max (-x i) 0) 4 P :=
+ gnl_positivePart_memLp (hc i).neg
+ have hM : MemLp (fun x : EuclideanSpace ℝ (Fin 6) =>
+ max (-x 0) 0 * max (-x 4) 0 - r*(x 2)^2) 2 P := by
+ have h1 : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => max (-x 0) 0 * max (-x 4) 0) 2 P :=
+ (hpos 0).fun_mul (hpos 4)
+ have h2 : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => (x 2)^2) 2 P := by
+ simpa only [pow_two] using (hc 2).fun_mul (hc 2)
+ exact h1.sub (h2.const_mul r)
+ have hSadd : MemLp (fun x : EuclideanSpace ℝ (Fin 6) =>
+ r*(x 3)^2 - x 1*x 5) 2 P := by
+ have h1 : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => (x 3)^2) 2 P := by
+ simpa only [pow_two] using (hc 3).fun_mul (hc 3)
+ have h2 : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => x 1*x 5) 2 P :=
+ (hc 1).fun_mul (hc 5)
+ exact (h1.const_mul r).sub h2
+ have hT : MemLp (fun x : EuclideanSpace ℝ (Fin 6) => gn_normalizedWeight r (ofLp x)) 1 P :=
+ (gnl_positivePart_memLp hM).fun_mul (gnl_positivePart_memLp hSadd)
+ exact memLp_one_iff_integrable.mp hT
+
+
+/-- Gaussian endpoint parameter convergence and concrete contact moments supply
+one positive physical normalizer coefficient at every sufficiently small radius.
+The covariance may be singular; the transverse reference mean is unrestricted. -/
+theorem gnl_normalizer_floor_of_parameter_limits
+ (m : ℝ → EuclideanSpace ℝ (Fin 6)) (S : ℝ → Matrix (Fin 6) (Fin 6) ℝ)
+ (m0 : EuclideanSpace ℝ (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) ℝ)
+ (hm : Tendsto m (𝓝[>] (0 : ℝ)) (𝓝 m0))
+ (hS : Tendsto S (𝓝[>] (0 : ℝ)) (𝓝 S0))
+ (hPSD : ∀ᶠ r in 𝓝[>] (0 : ℝ), (S r).PosSemidef) (hPSD0 : S0.PosSemidef)
+ (hm0 : m0 0 = -1) (hm1 : m0 1 = 1)
+ (hm23 : m0 2 + m0 3 = 0) (hm45 : m0 4 - m0 5 = 0)
+ (hS0 : S0 0 0 = 0) (hS1 : S0 1 1 = 0)
+ (hS23 : S0 2 2 + 2*S0 2 3 + S0 3 3 = 0)
+ (hS45 : S0 4 4 - 2*S0 4 5 + S0 5 5 = 0) (hQpos : 0 < S0 4 4) :
+ ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧
+ ∀ r : ℝ, 0 < r → r < δ → c*r^2 ≤
+ ∫ x : EuclideanSpace ℝ (Fin 6), r^2 * gn_normalizedWeight r (ofLp x)
+ ∂multivariateGaussian (m r) (S r) := by
+ let P := stdGaussian (EuclideanSpace ℝ (Fin 6))
+ let X : ℝ → EuclideanSpace ℝ (Fin 6) → Fin 6 → ℝ :=
+ fun r z => ofLp (gc_coupledVector (m r) (S r) z)
+ let A : EuclideanSpace ℝ (Fin 6) → ℝ := fun z => 2 * gc_coupledVector m0 S0 z 3
+ let Q : EuclideanSpace ℝ (Fin 6) → ℝ := fun z => gc_coupledVector m0 S0 z 4
+ have hX (r : ℝ) : Measurable (X r) := by
+ dsimp [X, gc_coupledVector]
+ fun_prop
+ have hLaw0 : HasLaw (gc_coupledVector m0 S0) (multivariateGaussian m0 S0) P :=
+ gc_coupledVector_hasLaw m0 S0
+ have hcontacts : ∀ᵐ z ∂P,
+ gc_coupledVector m0 S0 z 0 = -1 ∧ gc_coupledVector m0 S0 z 1 = 1 ∧
+ gc_coupledVector m0 S0 z 2 + gc_coupledVector m0 S0 z 3 = 0 ∧
+ gc_coupledVector m0 S0 z 4 - gc_coupledVector m0 S0 z 5 = 0 := by
+ have hb : ∀ᵐ x ∂P.map (gc_coupledVector m0 S0),
+ x 0 = -1 ∧ x 1 = 1 ∧ x 2 + x 3 = 0 ∧ x 4 - x 5 = 0 := by
+ rw [hLaw0.map_eq]
+ exact gnl_contact_relations m0 S0 hPSD0 hm0 hm1 hm23 hm45 hS0 hS1 hS23 hS45
+ exact ae_of_ae_map hLaw0.aemeasurable hb
+ have hconv : ∀ᵐ z ∂P, Tendsto (fun r => X r z) (𝓝[>] (0 : ℝ))
+ (𝓝 ![-1,1,-A z/2,A z/2,Q z,Q z]) := by
+ filter_upwards [hcontacts] with z hz
+ have hshape : ofLp (gc_coupledVector m0 S0 z) = ![-1,1,-A z/2,A z/2,Q z,Q z] := by
+ funext i
+ fin_cases i <;> simp [A, Q] <;> linarith [hz.1, hz.2.1, hz.2.2.1, hz.2.2.2]
+ have ht := ((PiLp.continuous_ofLp 2 (fun _ : Fin 6 => ℝ)).tendsto
+ (gc_coupledVector m0 S0 z)).comp
+ (gc_coupledVector_tendsto (𝓝[>] (0 : ℝ)) m S m0 S0 hm hS hPSD hPSD0 z)
+ simpa only [Function.comp_def, X, hshape] using ht
+ have hv : (S0 4 4).toNNReal ≠ 0 := ne_of_gt (Real.toNNReal_pos.mpr hQpos)
+ have hQ : HasLaw Q (gaussianReal (m0 4) (S0 4 4).toNNReal) P := by
+ exact (measurePreserving_eval_multivariateGaussian (μ := m0) hPSD0 (i := 4)).hasLaw.fun_comp hLaw0
+ have hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),
+ Integrable (fun z => gn_normalizedWeight r (X r z)) P := by
+ filter_upwards [hPSD] with r hr
+ exact (gc_coupledVector_hasLaw (m r) (S r)).integrable_comp
+ (gnl_gaussian_weight_integrable r (m r) (S r) hr)
+ obtain ⟨c, hc, δ, hδ, hfloor⟩ :=
+ gn_normalizer_floor_of_common_coupling P X hX A Q (m0 4) (S0 4 4).toNNReal hv hQ hconv hint
+ refine ⟨c, hc, δ, hδ, ?_⟩
+ intro r hr hrδ
+ calc
+ c*r^2 ≤ ∫ z, r^2 * gn_normalizedWeight r (X r z) ∂P := hfloor r hr hrδ
+ _ = ∫ x : EuclideanSpace ℝ (Fin 6), r^2 * gn_normalizedWeight r (ofLp x)
+ ∂multivariateGaussian (m r) (S r) := by
+ simpa only [Function.comp_def, X] using
+ (gc_coupledVector_hasLaw (m r) (S r)).integral_comp
+ (f := fun x : EuclideanSpace ℝ (Fin 6) => r^2 * gn_normalizedWeight r (ofLp x))
+ (by unfold gn_normalizedWeight; fun_prop)
+
+
+/-- The same Gaussian parameter limit gives the full literal typed endpoint
+normalizer, after the explicit permutation back to physical endpoint order. -/
+theorem gnl_physical_normalizer_floor_of_parameter_limits
+ (m : ℝ → EuclideanSpace ℝ (Fin 6)) (S : ℝ → Matrix (Fin 6) (Fin 6) ℝ)
+ (m0 : EuclideanSpace ℝ (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) ℝ)
+ (hm : Tendsto m (𝓝[>] (0 : ℝ)) (𝓝 m0))
+ (hS : Tendsto S (𝓝[>] (0 : ℝ)) (𝓝 S0))
+ (hPSD : ∀ᶠ r in 𝓝[>] (0 : ℝ), (S r).PosSemidef) (hPSD0 : S0.PosSemidef)
+ (hm0 : m0 0 = -1) (hm1 : m0 1 = 1)
+ (hm23 : m0 2 + m0 3 = 0) (hm45 : m0 4 - m0 5 = 0)
+ (hS0 : S0 0 0 = 0) (hS1 : S0 1 1 = 0)
+ (hS23 : S0 2 2 + 2*S0 2 3 + S0 3 3 = 0)
+ (hS45 : S0 4 4 - 2*S0 4 5 + S0 5 5 = 0) (hQpos : 0 < S0 4 4) :
+ ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧
+ ∀ r : ℝ, 0 < r → r < δ → c*r^2 ≤
+ ∫ x : EuclideanSpace ℝ (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]
+ ∂multivariateGaussian (m r) (S r) := by
+ obtain ⟨c, hc, δ, hδ, hfloor⟩ := gnl_normalizer_floor_of_parameter_limits
+ m S m0 S0 hm hS hPSD hPSD0 hm0 hm1 hm23 hm45 hS0 hS1 hS23 hS45 hQpos
+ refine ⟨c, hc, δ, hδ, ?_⟩
+ intro r hr hrδ
+ calc
+ c*r^2 ≤ ∫ x : EuclideanSpace ℝ (Fin 6), r^2 * gn_normalizedWeight r (ofLp x)
+ ∂multivariateGaussian (m r) (S r) := hfloor r hr hrδ
+ _ = ∫ x : EuclideanSpace ℝ (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]
+ ∂multivariateGaussian (m r) (S r) := by
+ apply integral_congr_ae
+ filter_upwards [] with x
+ have hp : enb_permutation ![x 0,x 2,x 4,x 1,x 3,x 5] = ofLp x := by
+ funext i
+ fin_cases i <;> rfl
+ simpa only [hp] using
+ (enb_weight_identity r ![x 0,x 2,x 4,x 1,x 3,x 5] hr).symm
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianRegressionKernel.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianRegressionKernel.lean
new file mode 100644
index 000000000..face5de81
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianRegressionKernel.lean
@@ -0,0 +1,270 @@
+import Mathlib.Probability.HasCondDistrib
+import Mathlib.Probability.Distributions.Gaussian.HasGaussianLaw.Independence
+
+/-!
+# Canonical Gaussian regression kernel
+
+For a residual law `ν`, `regressionKernel ν B mX mY x` is the literal affine pushforward
+`ν.map (fun r => r + mY + B (x - mX))` at every observation `x`. The kernel is constructed
+measurably from a deterministic observation and a constant residual kernel, so it has a
+specified value even where the observation has probability zero.
+
+The Gaussian theorem derives observation/residual independence from joint Gaussianity and
+zero coordinate cross-covariance. No nondegeneracy or residual covariance inverse is needed.
+The direct observed/target theorem derives those residual hypotheses from the coordinate
+normal equations for `B`. The construction does not identify concrete derivative observations,
+regression or Schur covariance blocks, a Palm weight, or a conditional law of a literal smooth field.
+
+Source contract: `SOURCE_REGRESSION_KERNEL.md` in this packet. Author-side Lean verification
+is separate from source alignment and the required review by another model family.
+-/
+
+open MeasureTheory ProbabilityTheory
+open scoped ProbabilityTheory BigOperators
+
+set_option autoImplicit false
+
+namespace ResearchFormalCoreR1
+
+/-- Copying the first coordinate and retaining an independent second coordinate. -/
+lemma regression_compProd_id_const {α β : Type*} [MeasurableSpace α] [MeasurableSpace β]
+ (μ : Measure α) (ν : Measure β) [SFinite μ] [SFinite ν] :
+ μ ⊗ₘ (Kernel.id ×ₖ Kernel.const α ν) =
+ (μ.prod ν).map (fun p : α × β => (p.1, p)) := by
+ ext s hs
+ rw [Measure.compProd_apply hs, Measure.map_apply (by fun_prop) hs,
+ Measure.prod_apply (s := (fun p : α × β => (p.1, p)) ⁻¹' s) (hs.preimage (by fun_prop))]
+ simp_rw [Kernel.prod_apply, Kernel.id_apply, Kernel.const_apply, Measure.dirac_prod]
+ congr with x
+ rw [Measure.map_apply (by fun_prop) (measurable_prodMk_left hs)]
+ rfl
+
+/-- An independent residual paired with the observation has the explicit product kernel. -/
+lemma regression_pair_hasCondDistrib {Ω α β : Type*} [MeasurableSpace Ω]
+ [MeasurableSpace α] [MeasurableSpace β] {P : Measure Ω} [IsProbabilityMeasure P]
+ {X : Ω → α} {R : Ω → β} (hX : AEMeasurable X P) (hR : AEMeasurable R P)
+ (hXR : IndepFun X R P) :
+ HasCondDistrib (fun ω => (X ω, R ω)) X
+ (Kernel.id ×ₖ Kernel.const α (P.map R)) P := by
+ refine ⟨hX.prodMk (hX.prodMk hR), ?_⟩
+ calc
+ P.map (fun ω => (X ω, (X ω, R ω))) =
+ (P.map (fun ω => (X ω, R ω))).map (fun p : α × β => (p.1, p)) := by
+ rw [AEMeasurable.map_map_of_aemeasurable (by fun_prop) (hX.prodMk hR)]
+ rfl
+ _ = ((P.map X).prod (P.map R)).map (fun p : α × β => (p.1, p)) := by
+ rw [hXR.map_prod_eq_prod_map_map hX hR]
+ _ = (P.map X) ⊗ₘ (Kernel.id ×ₖ Kernel.const α (P.map R)) :=
+ (regression_compProd_id_const (P.map X) (P.map R)).symm
+
+
+/-- Affine reconstruction of the target from the observation and the regression residual. -/
+def regressionReconstruction {n k : ℕ}
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)
+ (p : (Fin n → ℝ) × (Fin k → ℝ)) : Fin k → ℝ :=
+ p.2 + mY + B (p.1 - mX)
+
+lemma regressionReconstruction_measurable {n k : ℕ}
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ Measurable (regressionReconstruction B mX mY) := by
+ unfold regressionReconstruction
+ fun_prop
+
+/-- The canonical regression law is specified at every observation, including null pins. -/
+noncomputable def regressionKernel {n k : ℕ} (ν : Measure (Fin k → ℝ))
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ Kernel (Fin n → ℝ) (Fin k → ℝ) :=
+ ((Kernel.id : Kernel (Fin n → ℝ) (Fin n → ℝ)) ×ₖ
+ Kernel.const (Fin n → ℝ) ν).map (regressionReconstruction B mX mY)
+
+instance regressionKernel_isMarkov {n k : ℕ} (ν : Measure (Fin k → ℝ))
+ [IsProbabilityMeasure ν] (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ))
+ (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ IsMarkovKernel (regressionKernel ν B mX mY) := by
+ unfold regressionKernel
+ exact Kernel.IsMarkovKernel.map _ (regressionReconstruction_measurable B mX mY)
+
+lemma regressionKernel_apply {n k : ℕ} (ν : Measure (Fin k → ℝ)) [SFinite ν]
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)
+ (x : Fin n → ℝ) :
+ regressionKernel ν B mX mY x = ν.map (fun r => r + mY + B (x - mX)) := by
+ rw [regressionKernel, Kernel.map_apply _ (regressionReconstruction_measurable B mX mY),
+ Kernel.prod_apply, Kernel.id_apply, Kernel.const_apply, Measure.dirac_prod,
+ Measure.map_map (regressionReconstruction_measurable B mX mY) (by fun_prop)]
+ rfl
+
+/-- Affine reconstruction from an independent residual has the canonical conditional kernel. -/
+lemma independentResidual_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} [IsProbabilityMeasure P] {n k : ℕ}
+ {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}
+ (hX : AEMeasurable X P) (hR : AEMeasurable R P) (hXR : IndepFun X R P)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X
+ (regressionKernel (P.map R) B mX mY) P := by
+ exact (regression_pair_hasCondDistrib hX hR hXR).comp_left
+ (regressionReconstruction_measurable B mX mY)
+
+/-- Joint Gaussianity and vanishing observation/residual cross-covariance give the canonical
+conditional law, without choosing an almost-everywhere version at a prescribed observation. -/
+theorem gaussianRegression_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}
+ (hXR : HasGaussianLaw (fun ω => (X ω, R ω)) P)
+ (hzero : ∀ i j, covariance (fun ω => X ω i) (fun ω => R ω j) P = 0)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X
+ (regressionKernel (P.map R) B mX mY) P := by
+ have : IsProbabilityMeasure P := hXR.isProbabilityMeasure
+ exact independentResidual_hasCondDistrib hXR.fst.aemeasurable hXR.snd.aemeasurable
+ (hXR.indepFun_of_covariance_eval hzero) B mX mY
+
+/-- Kernel measurability is pointwise in the observation and does not require a Gaussian law. -/
+lemma regressionKernel_measurable {n k : ℕ} (ν : Measure (Fin k → ℝ))
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ Measurable (regressionKernel ν B mX mY) :=
+ Kernel.measurable _
+
+/-- All parts of the canonical Gaussian conditional-law construction, including the literal
+pushforward at every prescribed observation. Zero-dimensional and degenerate laws are allowed. -/
+theorem gaussianRegressionKernel_spec {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}
+ (hXR : HasGaussianLaw (fun ω => (X ω, R ω)) P)
+ (hzero : ∀ i j, covariance (fun ω => X ω i) (fun ω => R ω j) P = 0)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ IsMarkovKernel (regressionKernel (P.map R) B mX mY) ∧
+ Measurable (regressionKernel (P.map R) B mX mY) ∧
+ (∀ x, regressionKernel (P.map R) B mX mY x =
+ (P.map R).map (fun r => r + mY + B (x - mX))) ∧
+ HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X
+ (regressionKernel (P.map R) B mX mY) P := by
+ have : IsProbabilityMeasure P := hXR.isProbabilityMeasure
+ exact ⟨inferInstance, regressionKernel_measurable _ B mX mY,
+ regressionKernel_apply _ B mX mY, gaussianRegression_hasCondDistrib hXR hzero B mX mY⟩
+
+/-- Coordinates of a finite-vector continuous linear map in the standard basis. -/
+lemma regression_map_coordinate {n k : ℕ}
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (v : Fin n → ℝ) (j : Fin k) :
+ B v j = ∑ l, B (Pi.single l 1) j * v l := by
+ calc
+ B v j = B (∑ l, v l • (Pi.single l 1 : Fin n → ℝ)) j :=
+ congrArg (fun w => B w j) (pi_eq_sum_univ' v)
+ _ = ∑ l, B (Pi.single l 1) j * v l := by
+ simp [map_sum, mul_comm]
+
+/-- The covariance of a centered finite-vector linear predictor is its normal-equation sum. -/
+lemma regression_covariance_map {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} [IsProbabilityMeasure P] {n k : ℕ}
+ {X : Ω → Fin n → ℝ} (hX : HasGaussianLaw X P)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ)
+ (i : Fin n) (j : Fin k) :
+ covariance (fun ω => X ω i) (fun ω => B (X ω - mX) j) P =
+ ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P := by
+ have hcoord : (fun ω => B (X ω - mX) j) =
+ (fun ω => ∑ l, B (Pi.single l 1) j * (X ω l - mX l)) := by
+ funext ω
+ exact regression_map_coordinate B (X ω - mX) j
+ rw [hcoord, covariance_fun_sum_right]
+ · apply Finset.sum_congr rfl
+ intro l _
+ rw [covariance_const_mul_right, covariance_sub_const_right (hX.eval l).integrable]
+ · intro l
+ exact ((hX.eval l).memLp_two.sub (memLp_const _)).const_mul _
+ · exact (hX.eval i).memLp_two
+
+/-- The actual regression residual has zero observation cross-covariance by the normal equations. -/
+lemma regression_residual_zero_covariance {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}
+ (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)
+ (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =
+ ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :
+ ∀ i j, covariance (fun ω => X ω i)
+ (fun ω => (Y ω - mY - B (X ω - mX)) j) P = 0 := by
+ have : IsProbabilityMeasure P := hXY.isProbabilityMeasure
+ intro i j
+ have hXi := (hXY.fst.eval i).memLp_two
+ have hYj := (hXY.snd.eval j).memLp_two
+ have hBj : MemLp (fun ω => B (X ω - mX) j) 2 P := by
+ have hcoord : (fun ω => B (X ω - mX) j) =
+ (fun ω => ∑ l, B (Pi.single l 1) j * (X ω l - mX l)) := by
+ funext ω
+ exact regression_map_coordinate B (X ω - mX) j
+ rw [hcoord]
+ exact memLp_finsetSum _ (fun l _ =>
+ ((hXY.fst.eval l).memLp_two.sub (memLp_const _)).const_mul _)
+ simp only [Pi.sub_apply]
+ rw [covariance_fun_sub_right (Y := fun ω => Y ω j - mY j) hXi (hYj.sub (memLp_const _)) hBj,
+ covariance_sub_const_right (hXY.snd.eval j).integrable,
+ regression_covariance_map hXY.fst B mX i j, hnormal i j, sub_self]
+
+/-- The observation and the actual affine residual are jointly Gaussian. -/
+lemma regression_residual_jointGaussian {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} {n k : ℕ}
+ {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}
+ (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :
+ HasGaussianLaw (fun ω => (X ω, Y ω - mY - B (X ω - mX))) P := by
+ let L : ((Fin n → ℝ) × (Fin k → ℝ)) →L[ℝ]
+ ((Fin n → ℝ) × (Fin k → ℝ)) :=
+ (ContinuousLinearMap.fst ℝ (Fin n → ℝ) (Fin k → ℝ)).prod
+ (ContinuousLinearMap.snd ℝ (Fin n → ℝ) (Fin k → ℝ) -
+ B.comp (ContinuousLinearMap.fst ℝ (Fin n → ℝ) (Fin k → ℝ)))
+ let c : (Fin n → ℝ) × (Fin k → ℝ) := (0, B mX - mY)
+ have hL : HasGaussianLaw (fun ω => L (X ω, Y ω)) P := hXY.map_fun L
+ have hshift : HasGaussianLaw (fun ω => L (X ω, Y ω) + c) P := {
+ aemeasurable := hL.aemeasurable.add aemeasurable_const
+ isGaussian_map := by
+ have : IsGaussian (P.map (fun ω => L (X ω, Y ω))) := hL.isGaussian_map
+ convert (inferInstance : IsGaussian
+ ((P.map (fun ω => L (X ω, Y ω))).map (fun p => p + c))) using 1
+ rw [AEMeasurable.map_map_of_aemeasurable (by fun_prop) hL.aemeasurable]
+ rfl }
+ apply hshift.congr
+ filter_upwards [] with ω
+ apply Prod.ext
+ · simp [L, c]
+ · change Y ω - B (X ω) + (B mX - mY) = Y ω - mY - B (X ω - mX)
+ rw [map_sub]
+ abel
+
+
+
+/-- The actual target has the explicit regression conditional law when the coefficient map
+satisfies the coordinate normal equations. The residual hypotheses are derived. -/
+theorem gaussianRegression_observed_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}
+ (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)
+ (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =
+ ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :
+ HasCondDistrib Y X
+ (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) P := by
+ have hXR := regression_residual_jointGaussian hXY B mX mY
+ have hzero := regression_residual_zero_covariance hXY B mX mY hnormal
+ have hcond := gaussianRegression_hasCondDistrib hXR hzero B mX mY
+ convert hcond using 1
+ funext ω
+ abel
+
+/-- The canonical conditional-law specification for the actual jointly Gaussian target.
+The residual Gaussianity and its zero cross-covariance are conclusions of the construction. -/
+theorem gaussianRegression_observed_spec {Ω : Type*} [MeasurableSpace Ω]
+ {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}
+ (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)
+ (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)
+ (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =
+ ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :
+ IsMarkovKernel
+ (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) ∧
+ Measurable
+ (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) ∧
+ (∀ x, regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY x =
+ (P.map (fun ω => Y ω - mY - B (X ω - mX))).map
+ (fun r => r + mY + B (x - mX))) ∧
+ HasCondDistrib Y X
+ (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) P := by
+ have hXR := regression_residual_jointGaussian hXY B mX mY
+ have hzero := regression_residual_zero_covariance hXY B mX mY hnormal
+ have hspec := gaussianRegressionKernel_spec hXR hzero B mX mY
+ exact ⟨hspec.1, hspec.2.1, hspec.2.2.1,
+ gaussianRegression_observed_hasCondDistrib hXY B mX mY hnormal⟩
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianScalarMoments.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianScalarMoments.lean
new file mode 100644
index 000000000..ce432cb71
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianScalarMoments.lean
@@ -0,0 +1,99 @@
+import Mathlib.Probability.Distributions.Gaussian.Real
+import Mathlib.Algebra.Order.Ring.Basic
+import Mathlib.Tactic.FunProp
+import Mathlib.Tactic.NormNum
+import Mathlib.Tactic.Ring
+
+/-! Scalar eighth moments for noncentered Gaussian laws. The finite standard
+Gaussian moment is proved integrable; it is not an assumed model bound. -/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory ProbabilityTheory
+open scoped NNReal
+
+set_option autoImplicit false
+
+noncomputable def gm8C8 : ℝ := ∫ z : ℝ, |z| ^ 8 ∂gaussianReal 0 1
+
+theorem gm8_standard_integrable :
+ Integrable (fun z : ℝ => |z| ^ 8) (gaussianReal 0 1) := by
+ simpa only [id_eq, Real.norm_eq_abs] using
+ (memLp_id_gaussianReal' (μ := 0) (v := 1) 8 (by norm_num)).integrable_norm_pow
+ (by norm_num : (8 : ℕ) ≠ 0)
+
+theorem gm8_standard_nonneg : 0 ≤ gm8C8 := by
+ exact integral_nonneg (fun z => pow_nonneg (abs_nonneg z) 8)
+
+private theorem gm8_integrable (m : ℝ) (v : ℝ≥0) :
+ Integrable (fun x : ℝ => |x| ^ 8) (gaussianReal m v) := by
+ simpa only [id_eq, Real.norm_eq_abs] using
+ (memLp_id_gaussianReal' (μ := m) (v := v) 8 (by norm_num)).integrable_norm_pow
+ (by norm_num : (8 : ℕ) ≠ 0)
+
+private theorem gm8_sqrt_pow (V : ℝ) (hV : 0 ≤ V) :
+ (Real.sqrt V) ^ 8 = V ^ 4 := by
+ calc
+ _ = ((Real.sqrt V) ^ 2) ^ 4 := by ring
+ _ = V ^ 4 := by rw [Real.sq_sqrt hV]
+
+private theorem gm8_affine_map (m : ℝ) (v : ℝ≥0) :
+ (gaussianReal 0 1).map (fun z : ℝ => m + Real.sqrt (v : ℝ) * z) =
+ gaussianReal m v := by
+ calc
+ _ = ((gaussianReal 0 1).map (fun z : ℝ => Real.sqrt (v : ℝ) * z)).map
+ (fun z : ℝ => m + z) := by
+ rw [Measure.map_map (by fun_prop) (by fun_prop)]
+ rfl
+ _ = gaussianReal m v := by
+ rw [gaussianReal_map_const_mul, gaussianReal_map_const_add]
+ simp only [mul_zero, zero_add, mul_one]
+ congr 1
+ apply NNReal.eq
+ exact Real.sq_sqrt v.property
+
+private theorem gm8_affine_bound (m B V : ℝ) (v : ℝ≥0) (hB : 0 ≤ B) (hV : 0 ≤ V)
+ (hm : |m| ≤ B) (hv : (v : ℝ) ≤ V) (z : ℝ) :
+ |m + Real.sqrt (v : ℝ) * z| ^ 8 ≤ 128 * (B ^ 8 + V ^ 4 * |z| ^ 8) := by
+ have habs : |m + Real.sqrt (v : ℝ) * z| ≤ B + Real.sqrt V * |z| := by
+ calc
+ _ ≤ |m| + |Real.sqrt (v : ℝ) * z| := abs_add_le _ _
+ _ = |m| + Real.sqrt (v : ℝ) * |z| := by
+ rw [abs_mul, abs_of_nonneg (Real.sqrt_nonneg _)]
+ _ ≤ B + Real.sqrt V * |z| :=
+ add_le_add hm (mul_le_mul_of_nonneg_right (Real.sqrt_le_sqrt hv) (abs_nonneg z))
+ calc
+ _ ≤ (B + Real.sqrt V * |z|) ^ 8 := pow_le_pow_left₀ (abs_nonneg _) habs 8
+ _ ≤ 128 * (B ^ 8 + (Real.sqrt V * |z|) ^ 8) := by
+ convert add_pow_le hB (mul_nonneg (Real.sqrt_nonneg V) (abs_nonneg z)) 8 using 1
+ norm_num
+ _ = 128 * (B ^ 8 + V ^ 4 * |z| ^ 8) := by
+ rw [mul_pow, gm8_sqrt_pow V hV]
+
+/-- Bounded means and variances give a uniform eighth-moment bound, including
+zero variance and nonzero means. No eighth-moment hypothesis is assumed. -/
+theorem gm8_scalar_integrable_bound (m B V : ℝ) (v : ℝ≥0)
+ (hB : 0 ≤ B) (hV : 0 ≤ V) (hm : |m| ≤ B) (hv : (v : ℝ) ≤ V) :
+ Integrable (fun x : ℝ => |x| ^ 8) (gaussianReal m v) ∧
+ (∫ x : ℝ, |x| ^ 8 ∂gaussianReal m v) ≤
+ 128 * (B ^ 8 + V ^ 4 * gm8C8) := by
+ have hi := gm8_integrable m v
+ have hmajor : Integrable (fun z : ℝ => 128 * (B ^ 8 + V ^ 4 * |z| ^ 8))
+ (gaussianReal 0 1) :=
+ ((integrable_const (B ^ 8)).add (gm8_standard_integrable.const_mul (V ^ 4))).const_mul 128
+ have hiaff : Integrable (fun z : ℝ => |m + Real.sqrt (v : ℝ) * z| ^ 8)
+ (gaussianReal 0 1) := by
+ rw [← gm8_affine_map m v] at hi
+ exact (integrable_map_measure (by fun_prop) (by fun_prop)).mp hi
+ refine ⟨hi, ?_⟩
+ calc
+ _ = ∫ z : ℝ, |m + Real.sqrt (v : ℝ) * z| ^ 8 ∂gaussianReal 0 1 := by
+ rw [← gm8_affine_map m v, integral_map (by fun_prop) (by fun_prop)]
+ _ ≤ ∫ z : ℝ, 128 * (B ^ 8 + V ^ 4 * |z| ^ 8) ∂gaussianReal 0 1 :=
+ integral_mono hiaff hmajor (gm8_affine_bound m B V v hB hV hm hv)
+ _ = 128 * (B ^ 8 + V ^ 4 * gm8C8) := by
+ rw [integral_const_mul, integral_add (integrable_const _)
+ (gm8_standard_integrable.const_mul _), integral_const_mul]
+ simp only [integral_const, probReal_univ, smul_eq_mul, one_mul, gm8C8]
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/NormalizerFloor.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/NormalizerFloor.lean
new file mode 100644
index 000000000..3635695ef
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/NormalizerFloor.lean
@@ -0,0 +1,120 @@
+import ResearchFormalCoreR1.GaussianNormalizer
+import Mathlib.Probability.HasLaw
+import Mathlib.MeasureTheory.Integral.Lebesgue.Add
+import Mathlib.Topology.Instances.ENNReal.Lemmas
+import Mathlib.Topology.Order.LeftRightNhds
+
+/-!
+# A full small-radius lower normalizer from an explicit common coupling
+
+Nonnegative Fatou and the proved positive Gaussian reference give one lower
+constant for every sufficiently small positive radius. Neither uniform
+integrability nor convergence of normalizers is assumed. The literal
+conditioned-field construction of the coupling remains an application join.
+See ../SOURCE_GAUSSIAN_NORMALIZER.md for the frozen source contract.
+-/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory ProbabilityTheory Filter
+open scoped Topology ENNReal NNReal
+
+set_option autoImplicit false
+
+private theorem nfloor_eventually_lower_of_fatou {Ω ι : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) (u : Filter ι) [IsCountablyGenerated u] [NeBot u]
+ (f : ι → Ω → ℝ) (g : Ω → ℝ)
+ (hmeas : ∀ r, Measurable (f r))
+ (hnonneg : ∀ r ω, 0 ≤ f r ω)
+ (hg : Integrable g P) (hgpos : 0 < ∫ ω, g ω ∂P)
+ (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => f r ω) u (𝓝 (g ω)))
+ (hfint : ∀ᶠ r in u, Integrable (f r) P) :
+ ∀ᶠ r in u, (∫ ω, g ω ∂P)/2 ≤ ∫ ω, f r ω ∂P := by
+ have hg0 : 0 ≤ᵐ[P] g := hconv.mono (fun ω hω =>
+ ge_of_tendsto hω (Eventually.of_forall (fun r => hnonneg r ω)))
+ have hlim : (fun ω => liminf (fun r => ENNReal.ofReal (f r ω)) u) =ᵐ[P]
+ (fun ω => ENNReal.ofReal (g ω)) := by
+ filter_upwards [hconv] with ω hω
+ exact ((ENNReal.continuous_ofReal.tendsto (g ω)).comp hω).liminf_eq
+ have hfatou : ENNReal.ofReal (∫ ω, g ω ∂P) ≤
+ liminf (fun r => ∫⁻ ω, ENNReal.ofReal (f r ω) ∂P) u := by
+ rw [ofReal_integral_eq_lintegral_ofReal hg hg0]
+ rw [← lintegral_congr_ae hlim]
+ exact lintegral_liminf_le (fun r => (hmeas r).ennreal_ofReal)
+ have hhalf : ENNReal.ofReal ((∫ ω, g ω ∂P)/2) <
+ ENNReal.ofReal (∫ ω, g ω ∂P) := by
+ exact (ENNReal.ofReal_lt_ofReal_iff hgpos).mpr (by linarith)
+ have hevent := eventually_lt_of_lt_liminf (hhalf.trans_le hfatou)
+ filter_upwards [hevent, hfint] with r hr hri
+ rw [← ofReal_integral_eq_lintegral_ofReal hri
+ (Eventually.of_forall (fun ω => hnonneg r ω))] at hr
+ exact (ENNReal.ofReal_lt_ofReal_iff'.mp hr).1.le
+
+private theorem nfloor_weight_continuous :
+ Continuous (fun p : ℝ × (Fin 6 → ℝ) => gn_normalizedWeight p.1 p.2) := by
+ unfold gn_normalizedWeight
+ fun_prop
+private theorem nfloor_contact_value (a q : ℝ) :
+ gn_normalizedWeight 0 ![-1,1,-a/2,a/2,q,q] = (max (-q) 0)^2 := by
+ simp [gn_normalizedWeight, pow_two]
+private theorem nfloor_weight_limit (X : ℝ → Fin 6 → ℝ) (a q : ℝ)
+ (hX : Tendsto X (𝓝[>] (0:ℝ)) (𝓝 ![-1,1,-a/2,a/2,q,q])) :
+ Tendsto (fun r => gn_normalizedWeight r (X r)) (𝓝[>] (0:ℝ))
+ (𝓝 ((max (-q) 0)^2)) := by
+ have hr : Tendsto (fun r : ℝ => r) (𝓝[>] (0:ℝ)) (𝓝 0) :=
+ continuousWithinAt_id
+ simpa only [nfloor_contact_value, Function.comp_def] using
+ (nfloor_weight_continuous.tendsto (0, ![-1,1,-a/2,a/2,q,q])).comp (hr.prodMk_nhds hX)
+private theorem nfloor_reference {Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) (Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)
+ (hlaw : HasLaw Q (gaussianReal m v) P) :
+ Integrable (fun ω => (max (-Q ω) 0)^2) P ∧
+ 0 < ∫ ω, (max (-Q ω) 0)^2 ∂P := by
+ obtain ⟨hInt,hPos⟩ := gn_gaussian_reference_integrable_pos m v hv
+ refine ⟨hlaw.integrable_comp hInt, ?_⟩
+ have heq := hlaw.integral_comp
+ (show AEStronglyMeasurable (fun q : ℝ => (max (-q) 0)^2) (gaussianReal m v) by fun_prop)
+ exact heq.trans_gt hPos
+
+/-- The actual integral of the physical r²-scaled continuous endpoint weight
+has a positive lower constant at every sufficiently small positive radius.
+The common coupling and current integrability are explicit premises; its
+positive reference integral and the lower bound are proved, not premises. -/
+theorem gn_normalizer_floor_of_common_coupling
+ {Ω : Type*} [MeasurableSpace Ω]
+ (P : Measure Ω) [IsProbabilityMeasure P]
+ (X : ℝ → Ω → Fin 6 → ℝ) (hX : ∀ r, Measurable (X r))
+ (A Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)
+ (hQ : HasLaw Q (gaussianReal m v) P)
+ (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => X r ω) (𝓝[>] (0 : ℝ))
+ (𝓝 ![-1,1,-A ω/2,A ω/2,Q ω,Q ω]))
+ (hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),
+ Integrable (fun ω => gn_normalizedWeight r (X r ω)) P) :
+ ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧
+ ∀ r : ℝ, 0 < r → r < δ →
+ c * r^2 ≤ ∫ ω, r^2 * gn_normalizedWeight r (X r ω) ∂P := by
+ let g : Ω → ℝ := fun ω => (max (-Q ω) 0)^2
+ obtain ⟨hg, hgpos⟩ := nfloor_reference P Q m v hv hQ
+ have hmeas (r : ℝ) : Measurable (fun ω => gn_normalizedWeight r (X r ω)) := by
+ have hc : Continuous (gn_normalizedWeight r) := by
+ unfold gn_normalizedWeight
+ fun_prop
+ exact hc.measurable.comp (hX r)
+ have hnonneg (r : ℝ) (ω : Ω) : 0 ≤ gn_normalizedWeight r (X r ω) :=
+ mul_nonneg (le_max_right _ _) (le_max_right _ _)
+ have hweightconv : ∀ᵐ ω ∂P,
+ Tendsto (fun r => gn_normalizedWeight r (X r ω)) (𝓝[>] (0 : ℝ)) (𝓝 (g ω)) := by
+ filter_upwards [hconv] with ω hω
+ exact nfloor_weight_limit (fun r => X r ω) (A ω) (Q ω) hω
+ have hfloor : ∀ᶠ r in 𝓝[>] (0 : ℝ),
+ (∫ ω, g ω ∂P)/2 ≤ ∫ ω, gn_normalizedWeight r (X r ω) ∂P :=
+ nfloor_eventually_lower_of_fatou P (𝓝[>] (0 : ℝ))
+ (fun r ω => gn_normalizedWeight r (X r ω)) g hmeas hnonneg hg hgpos hweightconv hint
+ obtain ⟨δ, hδ, hinterval⟩ := mem_nhdsGT_iff_exists_Ioo_subset.mp hfloor
+ refine ⟨(∫ ω, g ω ∂P)/2, by positivity, δ, hδ, ?_⟩
+ intro r hr hrδ
+ have hbound := hinterval ⟨hr, hrδ⟩
+ rw [integral_const_mul]
+ simpa only [mul_comm] using mul_le_mul_of_nonneg_left hbound (sq_nonneg r)
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/PalmReweighting.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/PalmReweighting.lean
new file mode 100644
index 000000000..f0d6abafc
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/PalmReweighting.lean
@@ -0,0 +1,139 @@
+import Mathlib.MeasureTheory.Function.L2Space
+import Mathlib.MeasureTheory.Measure.WithDensity
+import Mathlib.MeasureTheory.Integral.Bochner.Set
+import Mathlib.MeasureTheory.Measure.Real
+import Mathlib.Tactic.Linarith
+import Mathlib.Tactic.NormNum
+import Mathlib.Tactic.Positivity
+import Mathlib.Tactic.FieldSimp
+
+/-!
+# A canonical weighted probability and its square-root event bound
+
+This constructs the literal measure with density `W / integral W`, proves its
+event formula, and applies integral Cauchy–Schwarz. The determinant second
+moment and normalizer estimates cancel their exact radius powers. Identifying
+this measure with a geometric Kac–Rice Palm law remains an application join.
+See ../SOURCE_PALM_REWEIGHTING.md for the frozen source contract.
+-/
+
+namespace ResearchFormalCoreR1
+
+open MeasureTheory
+open scoped ENNReal
+
+set_option autoImplicit false
+
+/-- The literal normalized nonnegative real density, defined for every input. -/
+noncomputable def prwMeasure {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) : Measure Ω :=
+ μ.withDensity (fun ω => ENNReal.ofReal (W ω / ∫ x, W x ∂μ))
+
+/-- On a finite measure, a measurable square-integrable real weight is integrable. -/
+theorem prw_integrable_of_integrable_sq {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) [IsFiniteMeasure μ] (W : Ω → ℝ) (hW : Measurable W)
+ (hsq : Integrable (fun ω => W ω ^ 2) μ) : Integrable W μ := by
+ have hmajor : Integrable (fun ω => 1 + W ω ^ 2) μ :=
+ (integrable_const 1).add hsq
+ apply hmajor.mono' hW.aestronglyMeasurable
+ filter_upwards [] with ω
+ rw [Real.norm_eq_abs]
+ nlinarith [sq_nonneg (|W ω| - 1 / 2), sq_abs (W ω)]
+
+/-- The actual event mass is the normalized set integral, in extended reals. -/
+theorem prw_measure_apply {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)
+ (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ)
+ (E : Set Ω) (hE : MeasurableSet E) :
+ prwMeasure μ W E = ENNReal.ofReal ((∫ x in E, W x ∂μ) / ∫ x, W x ∂μ) := by
+ unfold prwMeasure
+ rw [withDensity_apply _ hE]
+ rw [← ofReal_integral_eq_lintegral_ofReal
+ (hW.integrableOn.div_const _) (Filter.Eventually.of_forall (fun ω =>
+ div_nonneg (hW0 ω) hZ.le))]
+ rw [integral_div]
+
+/-- Positive finite normalizer makes the literal density a probability law. -/
+theorem prw_isProbabilityMeasure {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)
+ (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ) :
+ IsProbabilityMeasure (prwMeasure μ W) := by
+ constructor
+ rw [prw_measure_apply μ W hW hW0 hZ Set.univ MeasurableSet.univ]
+ simp [hZ.ne']
+
+/-- The event identity is proved for the constructed law, not assumed. -/
+theorem prw_measure_real {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)
+ (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ)
+ (E : Set Ω) (hE : MeasurableSet E) :
+ (prwMeasure μ W).real E = (∫ x in E, W x ∂μ) / ∫ x, W x ∂μ := by
+ rw [measureReal_def, prw_measure_apply μ W hW hW0 hZ E hE,
+ ENNReal.toReal_ofReal (div_nonneg (integral_nonneg hW0) hZ.le)]
+
+/-- Integral Cauchy–Schwarz against the event indicator, including null events. -/
+theorem prw_numerator_bound {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) [IsFiniteMeasure μ] (W : Ω → ℝ) (hW : Measurable W)
+ (hW0 : ∀ ω, 0 ≤ W ω) (hsq : Integrable (fun ω => W ω ^ 2) μ)
+ (E : Set Ω) (hE : MeasurableSet E) :
+ (∫ x in E, W x ∂μ) ≤
+ Real.sqrt (∫ x, W x ^ 2 ∂μ) * Real.sqrt (μ.real E) := by
+ classical
+ let I : Ω → ℝ := E.indicator (fun _ => 1)
+ have hI0 : ∀ ω, 0 ≤ I ω := by
+ intro ω
+ simp only [I, Set.indicator_apply]
+ split_ifs <;> norm_num
+ have hWLp : MemLp W (ENNReal.ofReal 2) μ := by
+ simpa using (memLp_two_iff_integrable_sq hW.aestronglyMeasurable).mpr hsq
+ have hILp : MemLp I (ENNReal.ofReal 2) μ :=
+ (memLp_const (1 : ℝ)).indicator hE
+ have hCS := integral_mul_le_Lp_mul_Lq_of_nonneg Real.HolderConjugate.two_two
+ (Filter.Eventually.of_forall hW0) (Filter.Eventually.of_forall hI0) hWLp hILp
+ have hleft : (fun ω => W ω * I ω) = E.indicator W := by
+ funext ω
+ by_cases hω : ω ∈ E <;> simp [I, hω]
+ have hright : (fun ω => I ω ^ (2 : ℝ)) = E.indicator (fun _ => (1 : ℝ)) := by
+ funext ω
+ by_cases hω : ω ∈ E <;> simp [I, hω]
+ have hIint : (∫ ω, I ω ^ (2 : ℝ) ∂μ) = μ.real E := by
+ rw [hright]
+ change (∫ ω, E.indicator (1 : Ω → ℝ) ω ∂μ) = μ.real E
+ exact integral_indicator_one hE
+ rw [hleft, integral_indicator hE, hIint] at hCS
+ simpa only [Real.rpow_two, ← Real.sqrt_eq_rpow] using hCS
+
+/-- The exact `r^4` second moment and `r^2` normalizer cancel in the literal
+weighted probability. No event probability is assumed positive. -/
+theorem prw_square_root_event_bound {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (hW : Measurable W)
+ (hW0 : ∀ ω, 0 ≤ W ω) (hsq : Integrable (fun ω => W ω ^ 2) μ)
+ (C c r : ℝ) (hC : 0 ≤ C) (hc : 0 < c) (hr : 0 < r)
+ (hmoment : (∫ x, W x ^ 2 ∂μ) ≤ C * r ^ 4)
+ (hfloor : c * r ^ 2 ≤ ∫ x, W x ∂μ)
+ (E : Set Ω) (hE : MeasurableSet E) :
+ IsProbabilityMeasure (prwMeasure μ W) ∧
+ (prwMeasure μ W).real E ≤ (Real.sqrt C / c) * Real.sqrt (μ.real E) := by
+ have hZ : 0 < ∫ x, W x ∂μ :=
+ (mul_pos hc (sq_pos_of_pos hr)).trans_le hfloor
+ have hW1 : Integrable W μ := prw_integrable_of_integrable_sq μ W hW hsq
+ refine ⟨prw_isProbabilityMeasure μ W hW1 hW0 hZ, ?_⟩
+ rw [prw_measure_real μ W hW1 hW0 hZ E hE]
+ have hnum := prw_numerator_bound μ W hW hW0 hsq E hE
+ have hsqrt : Real.sqrt (∫ x, W x ^ 2 ∂μ) ≤ Real.sqrt C * r ^ 2 := by
+ calc
+ _ ≤ Real.sqrt (C * r ^ 4) := Real.sqrt_le_sqrt hmoment
+ _ = Real.sqrt C * r ^ 2 := by
+ rw [Real.sqrt_mul hC]
+ congr 1
+ have heq : r ^ 4 = (r ^ 2) ^ 2 := by ring
+ rw [heq, Real.sqrt_sq (sq_nonneg r)]
+ calc
+ _ ≤ (Real.sqrt C * r ^ 2 * Real.sqrt (μ.real E)) / (c * r ^ 2) := by
+ apply div_le_div₀ (by positivity)
+ (hnum.trans (mul_le_mul_of_nonneg_right hsqrt (Real.sqrt_nonneg _)))
+ (mul_pos hc (sq_pos_of_pos hr)) hfloor
+ _ = (Real.sqrt C / c) * Real.sqrt (μ.real E) := by
+ field_simp [hr.ne']
+
+end ResearchFormalCoreR1
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceC4.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceC4.lean
new file mode 100644
index 000000000..f5188d51c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceC4.lean
@@ -0,0 +1,141 @@
+import SourceFourierSeries
+import Mathlib.Analysis.Calculus.SmoothSeries
+import Mathlib.Analysis.SpecialFunctions.Trigonometric.Deriv
+
+/-! Actual same-sample C4 of the canonical normalized Fourier lift.
+Covariance identification, Gaussian field/jet laws and pin regression are separate. -/
+
+noncomputable section
+open I4Foundation I4Weights I4Source MeasureTheory ProbabilityTheory
+open scoped BigOperators
+
+namespace I4C4
+
+def phaseCLM (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : (Fin d → ℝ) →L[ℝ] ℝ :=
+ ∑ i, (sourceC L * (k i : ℝ)) • ContinuousLinearMap.proj i
+
+theorem phaseCLM_apply (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ) :
+ phaseCLM d L k x = phase d L k x := by
+ simp [phaseCLM, phase]
+
+theorem phaseCLM_norm_le (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :
+ ‖phaseCLM d L k‖ ≤ ∑ i, |sourceC L * (k i : ℝ)| := by
+ apply ContinuousLinearMap.opNorm_le_bound _
+ (Finset.sum_nonneg (fun i _ => abs_nonneg _))
+ intro x
+ rw [phaseCLM_apply]
+ calc
+ ‖phase d L k x‖ ≤ ∑ i, ‖sourceC L * (k i : ℝ) * x i‖ := norm_sum_le _ _
+ _ ≤ ∑ i, |sourceC L * (k i : ℝ)| * ‖x‖ := by
+ apply Finset.sum_le_sum
+ intro i _
+ rw [norm_mul, Real.norm_eq_abs]
+ exact mul_le_mul_of_nonneg_left (norm_le_pi_norm x i) (abs_nonneg _)
+ _ = (∑ i, |sourceC L * (k i : ℝ)|) * ‖x‖ := by rw [Finset.sum_mul]
+
+theorem modeCoefficient_iteratedFDeriv_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (m : SourceMode d) (j : ℕ) (hj : j ≤ 4) (x : Fin d → ℝ) :
+ ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ modeMajorant d L m := by
+ classical
+ cases m with
+ | none =>
+ cases j with
+ | zero =>
+ simpa only [norm_iteratedFDeriv_zero, Real.norm_eq_abs] using
+ modeCoefficient_bound d hL none x
+ | succ j =>
+ change ‖iteratedFDeriv ℝ (j + 1)
+ (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L)) x‖ ≤ Real.sqrt (1 / sourceZ d L)
+ rw [iteratedFDeriv_succ_const]
+ simp only [Pi.zero_apply, norm_zero]
+ exact Real.sqrt_nonneg _
+ | some p =>
+ rcases p with ⟨k, b⟩
+ let A := Real.sqrt (2 * sourceWeight d L k / sourceZ d L)
+ let P := ∏ i, (1 + |sourceC L * (k.1 i : ℝ)|)
+ let g : ℝ → ℝ := if b then Real.sin else Real.cos
+ let ell := phaseCLM d L k
+ have hg : ContDiff ℝ j g := by
+ cases b <;> simp only [g, Bool.false_eq_true, ite_false, ite_true] <;> fun_prop
+ have hgc : ContDiff ℝ j (g ∘ ell) := hg.comp_continuousLinearMap
+ have hgn : ‖iteratedFDeriv ℝ j g (ell x)‖ ≤ 1 := by
+ cases b with
+ | false =>
+ simpa only [g, Bool.false_eq_true, ite_false,
+ norm_iteratedFDeriv_eq_norm_iteratedDeriv, Real.norm_eq_abs] using
+ Real.abs_iteratedDeriv_cos_le_one j (ell x)
+ | true =>
+ simpa only [g, ite_true, norm_iteratedFDeriv_eq_norm_iteratedDeriv,
+ Real.norm_eq_abs] using Real.abs_iteratedDeriv_sin_le_one j (ell x)
+ have hP : 1 ≤ P := by
+ apply Finset.one_le_prod₀
+ intro i _
+ linarith [abs_nonneg (sourceC L * (k.1 i : ℝ))]
+ have hl : ‖ell‖ ≤ P := by
+ calc
+ ‖ell‖ ≤ ∑ i, |sourceC L * (k.1 i : ℝ)| := phaseCLM_norm_le d L k
+ _ ≤ 1 + ∑ i, |sourceC L * (k.1 i : ℝ)| := by linarith
+ _ ≤ P := frequency_l1_le_product d _ (fun i => abs_nonneg _)
+ have hpow : ‖ell‖ ^ j ≤ P ^ 4 := by
+ calc
+ ‖ell‖ ^ j ≤ P ^ j := by gcongr
+ _ ≤ P ^ 4 := pow_le_pow_right₀ hP hj
+ have hder : ‖iteratedFDeriv ℝ j (g ∘ ell) x‖ ≤ ‖ell‖ ^ j := by
+ rw [ell.iteratedFDeriv_comp_right hg x le_rfl]
+ calc
+ _ ≤ ‖iteratedFDeriv ℝ j g (ell x)‖ * ∏ _i : Fin j, ‖ell‖ :=
+ (iteratedFDeriv ℝ j g (ell x)).norm_compContinuousLinearMap_le (fun _ => ell)
+ _ ≤ 1 * ∏ _i : Fin j, ‖ell‖ :=
+ mul_le_mul_of_nonneg_right hgn (Finset.prod_nonneg (fun _ _ => norm_nonneg _))
+ _ = ‖ell‖ ^ j := by simp
+ have heq : modeCoefficient d L (some (k, b)) = A • (g ∘ ell) := by
+ funext y
+ cases b <;> simp [modeCoefficient, A, g, Function.comp_apply, Pi.smul_apply,
+ smul_eq_mul, ell, phaseCLM_apply]
+ rw [heq, iteratedFDeriv_const_smul_apply hgc.contDiffAt, norm_smul,
+ Real.norm_eq_abs, abs_of_nonneg (Real.sqrt_nonneg _)]
+ calc
+ _ ≤ A * P ^ 4 := mul_le_mul_of_nonneg_left (hder.trans hpow) (Real.sqrt_nonneg _)
+ _ = modeMajorant d L (some (k, b)) := by
+ rw [modeMajorant, pairedBound_eq_amplitude d hL k]
+ simp only [A, P, Finset.prod_pow]
+
+theorem sourceField_contDiff_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ContDiff ℝ 4 (sourceField d L ω) := by
+ have hc (m : SourceMode d) : ContDiff ℝ 4 (modeCoefficient d L m) := by
+ cases m with
+ | none =>
+ change ContDiff ℝ 4 (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L))
+ fun_prop
+ | some p =>
+ rcases p with ⟨k, b⟩
+ change ContDiff ℝ 4 (fun x : Fin d → ℝ =>
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ (if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)))
+ cases b <;> simp [phase] <;> fun_prop
+ filter_upwards [sourceMajorant_ae d hL] with ω hω
+ change ContDiff ℝ 4 (fun x => ∑' m, modeCoefficient d L m x * ω m)
+ apply contDiff_tsum (v := fun _ m => modeMajorant d L m * |ω m|)
+ · intro m
+ exact (hc m).mul contDiff_const
+ · intro j hj
+ exact hω
+ · intro j m x hj
+ have hj' : j ≤ 4 := by exact_mod_cast hj
+ have hcj : ContDiff ℝ j (modeCoefficient d L m) :=
+ (hc m).of_le (by exact_mod_cast hj')
+ have heq : (fun y => modeCoefficient d L m y * ω m) = ω m • modeCoefficient d L m := by
+ funext y
+ simp [smul_eq_mul, mul_comm]
+ rw [heq, iteratedFDeriv_const_smul_apply hcj.contDiffAt, norm_smul, Real.norm_eq_abs]
+ simpa only [mul_comm] using mul_le_mul_of_nonneg_left
+ (modeCoefficient_iteratedFDeriv_bound d hL m j hj' x) (abs_nonneg (ω m))
+
+theorem sourceField_contDiff_affine_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ∀ (T : (Fin d → ℝ) →L[ℝ] (Fin d → ℝ)) (a : Fin d → ℝ),
+ ContDiff ℝ 4 (fun x => sourceField d L ω (a + T x)) := by
+ filter_upwards [sourceField_contDiff_ae d hL] with ω hω
+ intro T a
+ exact hω.comp (contDiff_const.add T.contDiff)
+
+end I4C4
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceCovariance.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceCovariance.lean
new file mode 100644
index 000000000..50aa85f30
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceCovariance.lean
@@ -0,0 +1,74 @@
+import SourceKernel
+import SourceGaussianLaw
+import Mathlib.Probability.Moments.Covariance
+import Mathlib.Probability.Moments.Variance
+
+noncomputable section
+open I4Foundation I4Weights I4Source I4Kernel I4SourceGaussian MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal NNReal
+namespace I4SourceCovariance
+
+variable {ι : Type*} [Countable ι]
+
+theorem scalarSeries_covariance (a b : ι → ℝ) (ha : Summable a) (hb : Summable b) :
+ cov[scalarSeries a, scalarSeries b; coefficientLaw ι] = ∑' i, a i * b i := by
+ have hsq (f : ι → ℝ) (hf : Summable f) : Summable (fun i => f i ^ 2) := by
+ have hp := summable_mul_of_summable_norm hf.norm hf.norm
+ simpa only [Function.comp_def, pow_two] using hp.comp_injective
+ (show Function.Injective (fun i : ι => (i,i)) from
+ fun i j h => congrArg Prod.fst h)
+ have hprod : Summable (fun i => a i * b i) := by
+ have hp := summable_mul_of_summable_norm ha.norm hb.norm
+ simpa only [Function.comp_def] using hp.comp_injective
+ (show Function.Injective (fun i : ι => (i,i)) from
+ fun i j h => congrArg Prod.fst h)
+ have hLp (f : ι → ℝ) (hf : Summable f) :
+ MemLp (scalarSeries f) 2 (coefficientLaw ι) := by
+ have h : MemLp id 2 ((coefficientLaw ι).map (scalarSeries f)) := by
+ rw [scalarSeries_map_gaussian f hf]
+ exact memLp_id_gaussianReal' 2 (by norm_num)
+ simpa only [Function.comp_def, Function.id_def] using
+ h.comp_of_map (scalarSeries_measurable f).aemeasurable
+ have heq : scalarSeries (a + b) =ᵐ[coefficientLaw ι]
+ (fun ω => scalarSeries a ω + scalarSeries b ω) := by
+ filter_upwards [scalarSeries_hasSum_ae a ha, scalarSeries_hasSum_ae b hb,
+ scalarSeries_hasSum_ae (a+b) (ha.add hb)] with ω haω hbω habω
+ exact habω.unique (by simpa only [Pi.add_apply, add_mul] using haω.add hbω)
+ have hts : (∑' i, (a i + b i)^2) =
+ (∑' i, a i ^ 2) + 2 * (∑' i, a i * b i) + (∑' i, b i ^ 2) := by
+ calc
+ _ = ∑' i, (a i ^ 2 + 2 * (a i * b i) + b i ^ 2) := by
+ exact tsum_congr (fun i => by ring)
+ _ = _ := by
+ rw [((hsq a ha).add (hprod.mul_left 2)).tsum_add (hsq b hb),
+ (hsq a ha).tsum_add (hprod.mul_left 2), tsum_mul_left]
+ have hv := variance_fun_add (hLp a ha) (hLp b hb)
+ rw [← variance_congr heq, scalarSeries_variance (a+b) (ha.add hb),
+ scalarSeries_variance a ha, scalarSeries_variance b hb] at hv
+ change (∑' i, (a i+b i)^2) = _ at hv
+ rw [hts] at hv
+ linarith
+
+theorem sourceField_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :
+ ∫ ω, sourceField d L ω x ∂sourceLaw d = 0 := by
+ have hc : Summable (fun m => modeCoefficient d L m x) :=
+ (modeMajorant_summable d hL).of_norm_bounded (fun m => by
+ simpa only [Real.norm_eq_abs] using modeCoefficient_bound d hL m x)
+ exact scalarSeries_integral_zero (fun m => modeCoefficient d L m x) hc
+
+theorem sourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :
+ cov[fun ω => sourceField d L ω x, fun ω => sourceField d L ω y; sourceLaw d] =
+ sourceSpectralKernel d L (x - y) := by
+ have hc (z : Fin d → ℝ) : Summable (fun m => modeCoefficient d L m z) :=
+ (modeMajorant_summable d hL).of_norm_bounded (fun m => by
+ simpa only [Real.norm_eq_abs] using modeCoefficient_bound d hL m z)
+ change cov[scalarSeries (fun m => modeCoefficient d L m x),
+ scalarSeries (fun m => modeCoefficient d L m y); coefficientLaw (SourceMode d)] = _
+ rw [scalarSeries_covariance _ _ (hc x) (hc y), coefficientKernel_eq_fullLattice d hL x y]
+
+theorem sourceField_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :
+ Var[fun ω => sourceField d L ω x; sourceLaw d] = 1 := by
+ rw [← covariance_self (sourceField_eval_measurable d L x).aemeasurable,
+ sourceField_covariance d hL x x, sub_self, spectralKernel_zero d hL]
+
+end I4SourceCovariance
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceFourierSeries.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceFourierSeries.lean
new file mode 100644
index 000000000..e4cdec9e6
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceFourierSeries.lean
@@ -0,0 +1,147 @@
+import GaussianSeriesFoundation
+import SpectralWeights
+import Mathlib.Logic.Equiv.Option
+import Mathlib.Topology.Algebra.InfiniteSum.TsumUniformlyOn
+
+/-! Actual canonical real Fourier series and a shared-event uniform convergence bridge.
+The half-lattice partition, covariance, sample C4 and finite-jet law require separate proofs. -/
+
+noncomputable section
+open MeasureTheory ProbabilityTheory I4Foundation I4Weights
+open scoped BigOperators ENNReal
+
+namespace I4Source
+
+/-- The representative whose first nonzero coordinate is positive. -/
+def halfLattice (d : ℕ) : Set (Fin d → ℤ) :=
+ {k | ∃ i, 0 < k i ∧ ∀ j, j < i → k j = 0}
+
+abbrev SourceMode (d : ℕ) := Option (↥(halfLattice d) × Bool)
+
+/-- The actual common law, with independent variance-one real coefficients. -/
+abbrev sourceLaw (d : ℕ) : Measure (SourceMode d → ℝ) :=
+ coefficientLaw (SourceMode d)
+
+def phase (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ) : ℝ :=
+ ∑ i, sourceC L * (k i : ℝ) * x i
+
+/-- False is the cosine coefficient and true the independent sine coefficient. -/
+def modeCoefficient (d : ℕ) (L : ℝ) (m : SourceMode d) (x : Fin d → ℝ) : ℝ :=
+ match m with
+ | none => Real.sqrt (1 / sourceZ d L)
+ | some (k, b) => Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)
+
+def modeMajorant (d : ℕ) (L : ℝ) (m : SourceMode d) : ℝ :=
+ match m with
+ | none => Real.sqrt (1 / sourceZ d L)
+ | some (k, _) => pairedBound d L k
+
+/-- Literal normalized real Fourier sum on the common coefficient samples. -/
+def sourceField (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) (x : Fin d → ℝ) : ℝ :=
+ scalarSeries (fun m => modeCoefficient d L m x) ω
+
+theorem modeMajorant_nonneg (d : ℕ) (L : ℝ) (m : SourceMode d) :
+ 0 ≤ modeMajorant d L m := by
+ cases m with
+ | none => exact Real.sqrt_nonneg _
+ | some p =>
+ change 0 ≤ pairedBound d L p.1
+ unfold pairedBound productBound coordinateBound decay
+ positivity
+
+theorem modeMajorant_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (modeMajorant d L) := by
+ classical
+ have hs := pairedBound_subtype_summable d hL (halfLattice d)
+ have hb : Summable (fun _ : Bool => (1 : ℝ)) := (hasSum_fintype _).summable
+ have hp : Summable (fun p : ↥(halfLattice d) × Bool => pairedBound d L p.1) := by
+ simpa only [mul_one] using hs.mul_of_nonneg hb
+ (fun k => modeMajorant_nonneg d L (some (k, false))) (fun _ => zero_le_one)
+ let e := Equiv.optionEquivSumPUnit.{0, 0} (↥(halfLattice d) × Bool)
+ apply e.symm.summable_iff.mp
+ apply Summable.sum (fun q => modeMajorant d L (e.symm q))
+ · simpa [e, Function.comp_def, modeMajorant] using hp
+ · exact (hasSum_fintype _).summable
+
+theorem modeCoefficient_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (m : SourceMode d) (x : Fin d → ℝ) :
+ |modeCoefficient d L m x| ≤ modeMajorant d L m := by
+ cases m with
+ | none =>
+ exact (abs_of_nonneg (Real.sqrt_nonneg _)).le
+ | some p =>
+ rcases p with ⟨k, b⟩
+ have hprod : 1 ≤ ∏ i, (1 + |sourceC L * (k.val i : ℝ)|) ^ 4 := by
+ apply Finset.one_le_prod₀
+ intro i _
+ apply one_le_pow₀
+ linarith [abs_nonneg (sourceC L * (k.val i : ℝ))]
+ have hamp : Real.sqrt (2 * sourceWeight d L k / sourceZ d L) ≤
+ pairedBound d L k := by
+ rw [pairedBound_eq_amplitude d hL k]
+ simpa only [mul_one] using mul_le_mul_of_nonneg_left hprod
+ (Real.sqrt_nonneg (2 * sourceWeight d L k / sourceZ d L))
+ change |Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ (if b then Real.sin (phase d L k x) else Real.cos (phase d L k x))| ≤ _
+ rw [abs_mul, abs_of_nonneg (Real.sqrt_nonneg _)]
+ have ht : |if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)| ≤ 1 := by
+ cases b with
+ | false => exact Real.abs_cos_le_one _
+ | true => exact Real.abs_sin_le_one _
+ have hbase : Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ |if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)| ≤
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L) := by
+ simpa only [mul_one] using mul_le_mul_of_nonneg_left ht
+ (Real.sqrt_nonneg (2 * sourceWeight d L k / sourceZ d L))
+ exact hbase.trans hamp
+
+theorem sourceField_eval_measurable (d : ℕ) (L : ℝ) (x : Fin d → ℝ) :
+ Measurable (fun ω => sourceField d L ω x) := by
+ exact scalarSeries_measurable _
+
+theorem sourceMajorant_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, Summable (fun m => modeMajorant d L m * |ω m|) := by
+ exact weighted_abs_summable_ae _ (modeMajorant_nonneg d L) (modeMajorant_summable d hL)
+
+theorem sourceAbs_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d,
+ HasSumUniformly (fun m x => |modeCoefficient d L m x * ω m|)
+ (fun x => ∑' m, |modeCoefficient d L m x * ω m|) := by
+ filter_upwards [sourceMajorant_ae d hL] with ω hω
+ apply hasSumUniformly_iff_tendstoUniformly.mpr
+ apply tendstoUniformly_tsum hω
+ intro m x
+ simp only [Real.norm_eq_abs, abs_abs, abs_mul]
+ exact mul_le_mul_of_nonneg_right (modeCoefficient_bound d hL m x) (abs_nonneg _)
+
+theorem sourceField_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d,
+ HasSumUniformly (fun m x => modeCoefficient d L m x * ω m)
+ (sourceField d L ω) := by
+ filter_upwards [sourceMajorant_ae d hL] with ω hω
+ apply hasSumUniformly_iff_tendstoUniformly.mpr
+ apply tendstoUniformly_tsum hω
+ intro m x
+ simp only [Real.norm_eq_abs, abs_mul]
+ exact mul_le_mul_of_nonneg_right (modeCoefficient_bound d hL m x) (abs_nonneg _)
+
+theorem sourceField_continuous_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, Continuous (sourceField d L ω) := by
+ filter_upwards [sourceMajorant_ae d hL] with ω hω
+ change Continuous (fun x => ∑' m, modeCoefficient d L m x * ω m)
+ have hcont (m : SourceMode d) :
+ Continuous (fun x : Fin d → ℝ => modeCoefficient d L m x * ω m) := by
+ cases m with
+ | none =>
+ change Continuous (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L) * ω none)
+ exact continuous_const
+ | some p =>
+ rcases p with ⟨k, b⟩
+ cases b <;> simp [modeCoefficient, phase] <;> fun_prop
+ apply continuous_tsum hcont hω
+ intro m x
+ simp only [Real.norm_eq_abs, abs_mul]
+ exact mul_le_mul_of_nonneg_right (modeCoefficient_bound d hL m x) (abs_nonneg _)
+
+end I4Source
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceGaussianLaw.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceGaussianLaw.lean
new file mode 100644
index 000000000..bb8450b5a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceGaussianLaw.lean
@@ -0,0 +1,189 @@
+import SourceFourierSeries
+import Mathlib.MeasureTheory.Integral.DominatedConvergence
+import Mathlib.Probability.Independence.CharacteristicFunction
+import Mathlib.Probability.Distributions.Gaussian.HasGaussianLaw.Independence
+import Mathlib.Analysis.Normed.Ring.InfiniteSum
+import Mathlib.Probability.Distributions.Gaussian.IsGaussianProcess.Def
+
+/-! Actual Gaussian laws of summable coefficient series and finite evaluation combinations.
+No covariance/source-kernel, torus, derivative-jet, or pinned-law conclusion is assumed. -/
+
+noncomputable section
+open I4Foundation I4Weights I4Source MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal NNReal Topology
+
+namespace I4SourceGaussian
+
+variable {ι : Type*}
+
+private theorem summable_square (a : ι → ℝ) (ha : Summable a) :
+ Summable (fun i => a i ^ 2) := by
+ have h := summable_mul_of_summable_norm ha.norm ha.norm
+ simpa only [Function.comp_def, pow_two] using h.comp_injective
+ (show Function.Injective (fun i : ι => (i, i)) from
+ fun i j hij => congrArg Prod.fst hij)
+
+variable [Countable ι]
+
+omit [Countable ι] in
+private theorem partial_charFun (a : ι → ℝ) (s : Finset ι) (t : ℝ) :
+ charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t =
+ Complex.exp (-((∑ i ∈ s, a i ^ 2 : ℝ) : ℂ) * (t : ℂ) ^ 2 / 2) := by
+ classical
+ have hi : iIndepFun (fun i (ω : ι → ℝ) => a i * ω i) (coefficientLaw ι) :=
+ (coordinates_independent ι).comp (fun i y => a i * y) (fun _ => by fun_prop)
+ have hm (i : ι) : Measurable (fun ω : ι → ℝ => a i * ω i) :=
+ measurable_const.mul (measurable_pi_apply i)
+ have hchar (i : ι) : charFun ((coefficientLaw ι).map
+ (fun ω : ι → ℝ => a i * ω i)) t =
+ Complex.exp (-((a i : ℂ) * (t : ℂ)) ^ 2 / 2) := by
+ rw [charFun_map_mul_comp (f := fun ω : ι → ℝ => ω i)
+ (measurable_pi_apply i).aemeasurable, coordinate_marginal, charFun_gaussianReal]
+ simp only [Complex.ofReal_mul, mul_zero, Complex.ofReal_zero, zero_mul,
+ NNReal.coe_one, Complex.ofReal_one, one_mul, zero_sub]
+ congr 1
+ ring
+ rw [(hi.restrict s).charFun_map_fun_finsetSum_eq_prod (fun i _ => (hm i).aemeasurable)]
+ simp only [Finset.prod_apply]
+ simp_rw [hchar]
+ rw [← Complex.exp_sum]
+ congr 1
+ push_cast
+ simp only [mul_pow]
+ rw [← Finset.sum_div, Finset.sum_neg_distrib, ← Finset.sum_mul]
+ rw [neg_mul]
+
+private theorem charFun_partial_tendsto (a : ι → ℝ) (ha : Summable a) (t : ℝ) :
+ Filter.Tendsto
+ (fun s : Finset ι => charFun ((coefficientLaw ι).map
+ (fun ω => ∑ i ∈ s, a i * ω i)) t)
+ Filter.atTop (𝓝 (charFun ((coefficientLaw ι).map (scalarSeries a)) t)) := by
+ classical
+ have hm (s : Finset ι) : Measurable (fun ω : ι → ℝ => ∑ i ∈ s, a i * ω i) :=
+ Finset.measurable_sum s (fun i _ => measurable_const.mul (measurable_pi_apply i))
+ have heq (s : Finset ι) :
+ charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t =
+ ∫ ω, Complex.exp (((t * ∑ i ∈ s, a i * ω i : ℝ) : ℂ) * Complex.I)
+ ∂coefficientLaw ι := by
+ rw [charFun_apply_real, integral_map (hm s).aemeasurable (by fun_prop)]
+ push_cast
+ rfl
+ have heq' : charFun ((coefficientLaw ι).map (scalarSeries a)) t =
+ ∫ ω, Complex.exp (((t * scalarSeries a ω : ℝ) : ℂ) * Complex.I)
+ ∂coefficientLaw ι := by
+ rw [charFun_apply_real, integral_map (scalarSeries_measurable a).aemeasurable
+ (by fun_prop)]
+ push_cast
+ rfl
+ simp_rw [heq, heq']
+ apply tendsto_integral_filter_of_norm_le_const
+ · filter_upwards with s
+ have hc : Continuous (fun q : ℝ => Complex.exp (((t * q : ℝ) : ℂ) * Complex.I)) :=
+ by fun_prop
+ exact (hc.measurable.comp (hm s)).aestronglyMeasurable
+ · refine ⟨1, Filter.Eventually.of_forall (fun s => ?_)⟩
+ filter_upwards with ω
+ rw [Complex.norm_exp_ofReal_mul_I]
+ · filter_upwards [scalarSeries_hasSum_ae a ha] with ω hω
+ exact ((by fun_prop : Continuous (fun q : ℝ =>
+ Complex.exp (((t * q : ℝ) : ℂ) * Complex.I))).tendsto _).comp hω
+
+theorem scalarSeries_map_gaussian (a : ι → ℝ) (ha : Summable a) :
+ (coefficientLaw ι).map (scalarSeries a) =
+ gaussianReal 0 (∑' i, a i ^ 2).toNNReal := by
+ apply Measure.ext_of_charFun
+ funext t
+ have h1 := charFun_partial_tendsto a ha t
+ have h2 : Filter.Tendsto (fun s : Finset ι =>
+ charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t)
+ Filter.atTop (𝓝 (Complex.exp (-((∑' i, a i ^ 2 : ℝ) : ℂ) * (t : ℂ)^2 / 2))) := by
+ simp_rw [partial_charFun]
+ exact ((by fun_prop : Continuous (fun q : ℝ =>
+ Complex.exp (-(q : ℂ) * (t : ℂ)^2 / 2))).tendsto _).comp
+ (summable_square a ha).hasSum
+ rw [tendsto_nhds_unique h1 h2, charFun_gaussianReal]
+ rw [Real.coe_toNNReal _ (tsum_nonneg (fun i => sq_nonneg (a i)))]
+ congr 1
+ push_cast
+ ring
+
+theorem scalarSeries_integral_zero (a : ι → ℝ) (ha : Summable a) :
+ ∫ ω, scalarSeries a ω ∂coefficientLaw ι = 0 := by
+ have h := integral_id_gaussianReal (μ := 0) (v := (∑' i, a i ^ 2).toNNReal)
+ rw [← scalarSeries_map_gaussian a ha,
+ integral_map (scalarSeries_measurable a).aemeasurable (by fun_prop)] at h
+ exact h
+
+theorem scalarSeries_variance (a : ι → ℝ) (ha : Summable a) :
+ Var[scalarSeries a; coefficientLaw ι] = ∑' i, a i ^ 2 := by
+ rw [← variance_id_map (scalarSeries_measurable a).aemeasurable,
+ scalarSeries_map_gaussian a ha, variance_id_gaussianReal]
+ exact Real.coe_toNNReal _ (tsum_nonneg (fun i => sq_nonneg (a i)))
+
+theorem source_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (x : Fin n → (Fin d → ℝ)) (c : Fin n → ℝ) :
+ HasGaussianLaw (fun ω => ∑ j, c j * sourceField d L ω (x j)) (sourceLaw d) := by
+ classical
+ have hc (j : Fin n) : Summable (fun m => modeCoefficient d L m (x j)) :=
+ (modeMajorant_summable d hL).of_norm_bounded (fun m => by
+ simpa only [Real.norm_eq_abs] using modeCoefficient_bound d hL m (x j))
+ let a : SourceMode d → ℝ := fun m => ∑ j, c j * modeCoefficient d L m (x j)
+ have ha : Summable a := by
+ exact summable_sum (fun j _ => (hc j).mul_left (c j))
+ have hG : HasGaussianLaw (scalarSeries a) (sourceLaw d) := by
+ constructor
+ · exact (scalarSeries_measurable a).aemeasurable
+ · change IsGaussian ((coefficientLaw (SourceMode d)).map (scalarSeries a))
+ rw [scalarSeries_map_gaussian a ha]
+ infer_instance
+ apply hG.congr
+ filter_upwards [ae_all_iff.2 (fun j : Fin n =>
+ scalarSeries_hasSum_ae (fun m => modeCoefficient d L m (x j)) (hc j)),
+ scalarSeries_hasSum_ae a ha] with ω hω hsum
+ have h : HasSum (fun m => ∑ j, c j * modeCoefficient d L m (x j) * ω m)
+ (∑ j, c j * sourceField d L ω (x j)) := by
+ simpa only [sourceField, mul_assoc] using hasSum_sum (fun j _ => (hω j).mul_left (c j))
+ exact hsum.unique (by simpa only [a, Finset.sum_mul] using h)
+
+theorem source_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (x : Fin n → (Fin d → ℝ)) :
+ HasGaussianLaw (fun ω j => sourceField d L ω (x j)) (sourceLaw d) := by
+ classical
+ have hm : Measurable (fun ω j => sourceField d L ω (x j)) :=
+ Measurable.of_eval (fun j => sourceField_eval_measurable d L (x j))
+ refine ⟨hm.aemeasurable, ?_⟩
+ apply isGaussian_of_map_eq_gaussianReal
+ intro ell
+ let c : Fin n → ℝ := fun j => ell (Pi.single j 1)
+ have hrep (v : Fin n → ℝ) : ell v = ∑ j, c j * v j := by
+ rw [← LinearMap.sum_single_apply (fun _ : Fin n => ℝ) v, map_sum]
+ apply Finset.sum_congr rfl
+ intro j _
+ have hs : Pi.single j (v j) = v j • Pi.single j (1 : ℝ) := by
+ rw [← Pi.single_smul, smul_eq_mul, mul_one]
+ rw [hs, map_smul]
+ simp [c, smul_eq_mul, mul_comm]
+ have hg : HasGaussianLaw (fun ω => ell (fun j => sourceField d L ω (x j)))
+ (sourceLaw d) :=
+ (source_linearCombination_hasGaussianLaw d hL n x c).congr
+ (Filter.Eventually.of_forall (fun ω => (hrep _).symm))
+ refine ⟨(sourceLaw d)[fun ω => ell (fun j => sourceField d L ω (x j))],
+ Var[fun ω => ell (fun j => sourceField d L ω (x j)); sourceLaw d].toNNReal, ?_⟩
+ rw [Measure.map_map ell.continuous.measurable hm]
+ exact hg.map_eq_gaussianReal
+
+theorem sourceField_isGaussianProcess (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ IsGaussianProcess (fun x ω => sourceField d L ω x) (sourceLaw d) := by
+ classical
+ constructor
+ intro I
+ let e : ↥I ≃ Fin (Fintype.card ↥I) := Fintype.equivFin ↥I
+ let x : Fin (Fintype.card ↥I) → (Fin d → ℝ) := fun j => (e.symm j).1
+ let R : (Fin (Fintype.card ↥I) → ℝ) →L[ℝ] (↥I → ℝ) :=
+ ContinuousLinearMap.pi (fun i => ContinuousLinearMap.proj (e i))
+ apply ((source_finiteVector_hasGaussianLaw d hL _ x).map_fun R).congr
+ filter_upwards with ω
+ funext i
+ simp [R, x]
+
+end I4SourceGaussian
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceKernel.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceKernel.lean
new file mode 100644
index 000000000..5d5602ac7
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceKernel.lean
@@ -0,0 +1,112 @@
+import SourceLattice
+import Mathlib.Analysis.Normed.Ring.InfiniteSum
+
+noncomputable section
+open I4Foundation I4Weights I4Source I4Lattice MeasureTheory
+open scoped BigOperators
+namespace I4Kernel
+
+def frequencyEquiv (d : ℕ) : SourceMode d ≃ (Fin d → ℤ) :=
+ Equiv.ofBijective (latticeFrequency d) (latticeFrequency_bijective d)
+
+/-- The prescribed normalized full-lattice real Fourier kernel; image/Poisson linkage is separate. -/
+def sourceSpectralKernel (d : ℕ) (L : ℝ) (z : Fin d → ℝ) : ℝ :=
+ ∑' k : Fin d → ℤ, sourceWeight d L k / sourceZ d L * Real.cos (phase d L k z)
+
+private theorem tsum_mode (d : ℕ) (f : SourceMode d → ℝ) (hf : Summable f) :
+ (∑' m, f m) = f none + ∑' k : ↥(halfLattice d),
+ (f (some (k,false)) + f (some (k,true))) := by
+ classical
+ let e := Equiv.optionEquivSumPUnit.{0,0} (↥(halfLattice d) × Bool)
+ have hp : Summable (fun p : ↥(halfLattice d) × Bool => f (some p)) :=
+ hf.comp_injective (Option.some_injective (↥(halfLattice d) × Bool))
+ calc
+ (∑' m, f m) = ∑' q, f (e.symm q) := (e.symm.tsum_eq f).symm
+ _ = (∑' p : ↥(halfLattice d) × Bool, f (some p)) + f none := by
+ rw [Summable.tsum_sum (by simpa [e, Function.comp_def] using hp)
+ (hasSum_fintype _).summable]
+ simp [e]
+ _ = _ := by
+ rw [hp.tsum_prod]
+ simp_rw [tsum_bool]
+ ring
+
+theorem modeProduct_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :
+ Summable (fun m => modeCoefficient d L m x * modeCoefficient d L m y) := by
+ have hc (z : Fin d → ℝ) : Summable (fun m => modeCoefficient d L m z) := by
+ apply Summable.of_norm_bounded (modeMajorant_summable d hL)
+ intro m
+ simpa only [Real.norm_eq_abs] using modeCoefficient_bound d hL m z
+ have hp : Summable (fun p : SourceMode d × SourceMode d =>
+ modeCoefficient d L p.1 x * modeCoefficient d L p.2 y) :=
+ summable_mul_of_summable_norm (hc x).norm (hc y).norm
+ simpa only [Function.comp_def] using hp.comp_injective
+ (show Function.Injective (fun m : SourceMode d => (m,m)) from
+ fun a b h => congrArg Prod.fst h)
+
+theorem spectralKernel_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (z : Fin d → ℝ) :
+ Summable (fun k : Fin d → ℤ =>
+ sourceWeight d L k / sourceZ d L * Real.cos (phase d L k z)) := by
+ have hz := sourceZ_pos d hL
+ apply Summable.of_norm_bounded ((sourceWeight_summable d hL).div_const (sourceZ d L))
+ intro k
+ have hq : 0 ≤ sourceWeight d L k / sourceZ d L := by
+ rw [sourceWeight_eq_physical]
+ exact div_nonneg (Real.exp_pos _).le hz.le
+ rw [norm_mul, Real.norm_eq_abs, abs_of_nonneg hq, Real.norm_eq_abs]
+ simpa only [mul_one] using mul_le_mul_of_nonneg_left (Real.abs_cos_le_one _) hq
+
+theorem coefficientKernel_eq_fullLattice (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :
+ (∑' m, modeCoefficient d L m x * modeCoefficient d L m y) =
+ sourceSpectralKernel d L (x - y) := by
+ classical
+ let g : (Fin d → ℤ) → ℝ := fun k =>
+ sourceWeight d L k / sourceZ d L * Real.cos (phase d L k (x - y))
+ have hg : Summable g := spectralKernel_summable d hL (x - y)
+ have hneg (k : Fin d → ℤ) : g (-k) = g k := by
+ have hp : phase d L (-k) (x - y) = -phase d L k (x - y) := by
+ simp [phase, Finset.sum_neg_distrib]
+ simp only [g, sourceWeight_neg, hp, Real.cos_neg]
+ have hzero : g 0 = 1 / sourceZ d L := by
+ simp [g, sourceWeight_eq_physical, phase]
+ have hc0 : modeCoefficient d L none x * modeCoefficient d L none y = 1 / sourceZ d L := by
+ simp only [modeCoefficient]
+ exact Real.mul_self_sqrt (one_div_nonneg.mpr (sourceZ_pos d hL).le)
+ have hpair (k : ↥(halfLattice d)) :
+ modeCoefficient d L (some (k,false)) x * modeCoefficient d L (some (k,false)) y +
+ modeCoefficient d L (some (k,true)) x * modeCoefficient d L (some (k,true)) y = 2 * g k := by
+ have h := pairedCoefficient_kernel d hL k x y
+ rw [Fintype.sum_bool] at h
+ calc
+ _ = modeCoefficient d L (some (k,true)) x * modeCoefficient d L (some (k,true)) y +
+ modeCoefficient d L (some (k,false)) x * modeCoefficient d L (some (k,false)) y := add_comm _ _
+ _ = _ := h
+ _ = 2 * g k := by dsimp [g]; ring
+ have hleft : (∑' m, modeCoefficient d L m x * modeCoefficient d L m y) =
+ 1 / sourceZ d L + ∑' k : ↥(halfLattice d), 2 * g k := by
+ rw [tsum_mode d _ (modeProduct_summable d hL x y), hc0]
+ congr 1
+ exact tsum_congr hpair
+ have hm : Summable (fun m => g (frequencyEquiv d m)) := (frequencyEquiv d).summable_iff.mpr hg
+ have hright : sourceSpectralKernel d L (x - y) =
+ 1 / sourceZ d L + ∑' k : ↥(halfLattice d), 2 * g k := by
+ change (∑' k, g k) = _
+ rw [← (frequencyEquiv d).tsum_eq g, tsum_mode d _ hm]
+ change g 0 + (∑' k : ↥(halfLattice d), (g k.1 + g (-k.1))) = _
+ rw [hzero]
+ congr 1
+ apply tsum_congr
+ intro k
+ rw [hneg]
+ ring
+ exact hleft.trans hright.symm
+
+theorem spectralKernel_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ sourceSpectralKernel d L 0 = 1 := by
+ unfold sourceSpectralKernel
+ simp only [phase, Pi.zero_apply, mul_zero, Finset.sum_const_zero, Real.cos_zero, mul_one]
+ rw [tsum_div_const]
+ change sourceZ d L / sourceZ d L = 1
+ exact div_self (sourceZ_pos d hL).ne'
+
+end I4Kernel
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceLattice.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceLattice.lean
new file mode 100644
index 000000000..9c1e0557c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceLattice.lean
@@ -0,0 +1,159 @@
+import SourceFourierSeries
+import Mathlib.Data.Finset.Max
+
+noncomputable section
+open I4Foundation I4Weights I4Source MeasureTheory
+open scoped BigOperators
+namespace I4Lattice
+
+def latticeFrequency (d : ℕ) (m : SourceMode d) : Fin d → ℤ :=
+ match m with
+ | none => 0
+ | some (k, b) => if b then -k.1 else k.1
+
+theorem halfLattice_ne_zero (d : ℕ) {k : Fin d → ℤ} (hk : k ∈ halfLattice d) :
+ k ≠ 0 := by
+ rcases hk with ⟨i, hi, _⟩
+ intro h
+ have : k i = 0 := congrFun h i
+ omega
+
+theorem halfLattice_partition (d : ℕ) {k : Fin d → ℤ} (hk : k ≠ 0) :
+ (k ∈ halfLattice d ∨ -k ∈ halfLattice d) ∧
+ ¬ (k ∈ halfLattice d ∧ -k ∈ halfLattice d) := by
+ classical
+ have hex : ∃ i, k i ≠ 0 := by
+ by_contra h
+ push Not at h
+ exact hk (funext h)
+ let s : Finset (Fin d) := Finset.univ.filter (fun i => k i ≠ 0)
+ have hs : s.Nonempty := by
+ obtain ⟨i, hi⟩ := hex
+ exact ⟨i, Finset.mem_filter.mpr ⟨Finset.mem_univ i, hi⟩⟩
+ let i := s.min' hs
+ have hi : k i ≠ 0 := (Finset.mem_filter.mp (Finset.min'_mem s hs)).2
+ have hbefore (j : Fin d) (hj : j < i) : k j = 0 := by
+ by_contra hn
+ have hle := Finset.min'_le s j (Finset.mem_filter.mpr ⟨Finset.mem_univ j, hn⟩)
+ exact (not_le_of_gt hj) hle
+ constructor
+ · rcases lt_or_gt_of_ne hi with hneg | hpos
+ · right
+ refine ⟨i, ?_, ?_⟩
+ · change 0 < -k i
+ omega
+ · intro j hj
+ change -k j = 0
+ rw [hbefore j hj, neg_zero]
+ · exact Or.inl ⟨i, hpos, hbefore⟩
+ · rintro ⟨⟨i, hi, hib⟩, ⟨j, hj, hjb⟩⟩
+ change 0 < -k j at hj
+ rcases lt_trichotomy i j with hij | heq | hji
+ · have h0 := hjb i hij
+ change -k i = 0 at h0
+ omega
+ · subst j
+ omega
+ · have h0 := hib j hji
+ omega
+
+theorem sourceWeight_neg (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :
+ sourceWeight d L (-k) = sourceWeight d L k := by
+ rw [sourceWeight_eq_physical, sourceWeight_eq_physical]
+ simp only [Pi.neg_apply, Int.cast_neg, mul_neg, neg_sq]
+
+theorem phase_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k n : Fin d → ℤ) (x : Fin d → ℝ) :
+ phase d L k (fun i => x i + L * (n i : ℝ)) =
+ phase d L k x + ((∑ i, k i * n i : ℤ) : ℝ) * (2 * Real.pi) := by
+ have he (i : Fin d) : sourceC L * (k i : ℝ) * (x i + L * (n i : ℝ)) =
+ sourceC L * (k i : ℝ) * x i + ((k i * n i : ℤ) : ℝ) * (2 * Real.pi) := by
+ simp only [Int.cast_mul]
+ unfold sourceC
+ field_simp
+ unfold phase
+ simp_rw [he]
+ rw [Finset.sum_add_distrib, ← Finset.sum_mul]
+ simp only [Int.cast_sum]
+
+theorem modeCoefficient_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (m : SourceMode d) (n : Fin d → ℤ) (x : Fin d → ℝ) :
+ modeCoefficient d L m (fun i => x i + L * (n i : ℝ)) =
+ modeCoefficient d L m x := by
+ cases m with
+ | none => rfl
+ | some p =>
+ rcases p with ⟨k,b⟩
+ cases b <;> simp only [modeCoefficient, Bool.false_eq_true, ite_false, ite_true]
+ · rw [phase_lattice_shift d hL, Real.cos_add_int_mul_two_pi]
+ · rw [phase_lattice_shift d hL, Real.sin_add_int_mul_two_pi]
+
+theorem sourceField_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SourceMode d → ℝ) (n : Fin d → ℤ) (x : Fin d → ℝ) :
+ sourceField d L ω (fun i => x i + L * (n i : ℝ)) = sourceField d L ω x := by
+ unfold sourceField scalarSeries
+ apply tsum_congr
+ intro m
+ change modeCoefficient d L m (fun i => x i + L * (n i : ℝ)) * ω m =
+ modeCoefficient d L m x * ω m
+ rw [modeCoefficient_lattice_shift d hL]
+
+theorem pairedCoefficient_kernel (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k : ↥(halfLattice d)) (x y : Fin d → ℝ) :
+ (∑ b : Bool, modeCoefficient d L (some (k,b)) x *
+ modeCoefficient d L (some (k,b)) y) =
+ (2 * sourceWeight d L k / sourceZ d L) * Real.cos (phase d L k (x - y)) := by
+ have hphase : phase d L k (x - y) = phase d L k x - phase d L k y := by
+ simp [phase, mul_sub, Finset.sum_sub_distrib]
+ have hz : 0 ≤ 2 * sourceWeight d L k / sourceZ d L := by
+ rw [sourceWeight_eq_physical]
+ exact div_nonneg (mul_nonneg (by norm_num) (Real.exp_pos _).le) (sourceZ_pos d hL).le
+ rw [Fintype.sum_bool]
+ simp only [modeCoefficient, ite_true, Bool.false_eq_true, ite_false]
+ rw [hphase, Real.cos_sub]
+ calc
+ _ = (Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L)) *
+ (Real.cos (phase d L k x) * Real.cos (phase d L k y) +
+ Real.sin (phase d L k x) * Real.sin (phase d L k y)) := by ring
+ _ = _ := by rw [Real.mul_self_sqrt hz]
+
+theorem latticeFrequency_bijective (d : ℕ) : Function.Bijective (latticeFrequency d) := by
+ classical
+ constructor
+ · intro m n he
+ cases m with
+ | none =>
+ cases n with
+ | none => rfl
+ | some p =>
+ rcases p with ⟨k,b⟩
+ have hk := halfLattice_ne_zero d k.property
+ cases b <;> simp [latticeFrequency] at he <;> exact (hk (by first | exact he | exact he.symm)).elim
+ | some p =>
+ rcases p with ⟨k,b⟩
+ cases n with
+ | none =>
+ have hk := halfLattice_ne_zero d k.property
+ cases b <;> simp [latticeFrequency] at he <;> exact (hk he).elim
+ | some q =>
+ rcases q with ⟨l,c⟩
+ cases b <;> cases c <;> simp only [latticeFrequency, Bool.false_eq_true, ite_false, ite_true] at he
+ · have hkl : k = l := Subtype.ext he
+ subst l
+ rfl
+ · have hn : -k.1 ∈ halfLattice d := by simpa only [he, neg_neg] using l.property
+ exact ((halfLattice_partition d (halfLattice_ne_zero d k.property)).2 ⟨k.property,hn⟩).elim
+ · have hn : -k.1 ∈ halfLattice d := he.symm ▸ l.property
+ exact ((halfLattice_partition d (halfLattice_ne_zero d k.property)).2 ⟨k.property,hn⟩).elim
+ · have hkl : k = l := Subtype.ext (neg_inj.mp he)
+ subst l
+ rfl
+ · intro k
+ by_cases hk : k = 0
+ · exact ⟨none, by simpa [latticeFrequency] using hk.symm⟩
+ · rcases (halfLattice_partition d hk).1 with hp | hn
+ · exact ⟨some (⟨k,hp⟩,false), by simp [latticeFrequency]⟩
+ · exact ⟨some (⟨-k,hn⟩,true), by simp [latticeFrequency]⟩
+
+end I4Lattice
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceSmooth.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceSmooth.lean
new file mode 100644
index 000000000..5b1518449
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceSmooth.lean
@@ -0,0 +1,254 @@
+import SourceC4
+import Mathlib.Data.Nat.Choose.Sum
+
+/-!
+# All-order smoothness of the actual infinite Gaussian Fourier source
+
+This module extends the source-derived polynomial majorant from order four to
+every natural order. It uses the same SourceMode, sourceLaw and sourceField as
+the qualified F7 dependency; no finite-mode approximation or new field is used.
+The good sample predicate is a single countable intersection of explicit
+coefficient summability conditions. Its measurability and probability-law
+restriction are proved in SourceSmoothCarrier.
+
+This is a C261 Stage A prerequisite. It does not identify the spectral covariance
+with Lifetime's theta sum, construct a conditional kernel, or discharge a
+weighted elder, Morse, count/density, or universality conclusion.
+-/
+
+noncomputable section
+open I4Foundation I4Weights I4Source I4C4 MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal
+
+namespace I4Smooth
+
+def orderCoordinateBound (n : ℕ) (a c : ℝ) (k : ℤ) : ℝ :=
+ decay a k * (1 + |c * (k : ℝ)|) ^ n
+
+def orderProductBound (n d : ℕ) (a c : ℝ) (k : Fin d → ℤ) : ℝ :=
+ ∏ i, orderCoordinateBound n a c (k i)
+
+def orderPairedBound (n d : ℕ) (L : ℝ) (k : Fin d → ℤ) : ℝ :=
+ Real.sqrt (2 / sourceZ d L) * orderProductBound n d (sourceA L) (sourceC L) k
+
+def orderModeBound (n d : ℕ) (L : ℝ) (m : SourceMode d) : ℝ :=
+ match m with
+ | none => Real.sqrt (1 / sourceZ d L)
+ | some (k, _) => orderPairedBound n d L k
+
+theorem orderCoordinateBound_summable (n : ℕ) {a c : ℝ} (ha : 0 < a) :
+ Summable (orderCoordinateBound n a c) := by
+ classical
+ let f (r : ℕ) (k : ℤ) : ℝ :=
+ ((n.choose r : ℝ) * |c| ^ (n - r)) * (decay a k * |(k : ℝ)| ^ (n - r))
+ have hf (r : ℕ) : Summable (f r) :=
+ (summable_decay_pow ha (n - r)).mul_left _
+ have hsum (s : Finset ℕ) : Summable (fun k : ℤ => ∑ r ∈ s, f r k) := by
+ induction s using Finset.induction_on with
+ | empty => simpa using (summable_zero : Summable (fun _ : ℤ => (0 : ℝ)))
+ | @insert r s hr ih =>
+ simpa only [Finset.sum_insert hr] using (hf r).add ih
+ convert hsum (Finset.range (n + 1)) using 1
+ funext k
+ unfold orderCoordinateBound
+ rw [add_pow, Finset.mul_sum]
+ apply Finset.sum_congr rfl
+ intro r _
+ simp only [one_pow, one_mul, abs_mul, mul_pow, f]
+ ring
+
+theorem orderProductBound_summable (n d : ℕ) {a c : ℝ} (ha : 0 < a) :
+ Summable (orderProductBound n d a c) := by
+ exact finite_product_summable (orderCoordinateBound_summable n ha)
+ (fun k => by unfold orderCoordinateBound decay; positivity) d
+
+theorem orderPairedBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (orderPairedBound n d L) := by
+ exact (orderProductBound_summable n d (sourceA_pos hL)).mul_left _
+
+theorem orderPairedBound_eq_amplitude (n d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k : Fin d → ℤ) :
+ orderPairedBound n d L k =
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^ n := by
+ have hsqrt : Real.sqrt (sourceWeight d L k) = productDecay d (sourceA L) k := by
+ have hw : sourceWeight d L k = (productDecay d (sourceA L) k) ^ 2 := by
+ rw [sourceWeight, productDecay_eq_exp, productDecay_eq_exp, pow_two, ← Real.exp_add]
+ congr 1
+ ring
+ rw [hw, Real.sqrt_sq_eq_abs, abs_of_nonneg]
+ unfold productDecay decay
+ positivity
+ have hamp : Real.sqrt (2 * sourceWeight d L k / sourceZ d L) =
+ Real.sqrt (2 / sourceZ d L) * productDecay d (sourceA L) k := by
+ have he : 2 * sourceWeight d L k / sourceZ d L =
+ (2 / sourceZ d L) * sourceWeight d L k := by ring
+ rw [he, Real.sqrt_mul (by have := sourceZ_pos d hL; positivity), hsqrt]
+ have hp : orderProductBound n d (sourceA L) (sourceC L) k =
+ productDecay d (sourceA L) k * ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^ n := by
+ exact Finset.prod_mul_distrib
+ rw [orderPairedBound, hp, hamp]
+ ring
+
+theorem orderModeBound_nonneg (n d : ℕ) (L : ℝ) (m : SourceMode d) :
+ 0 ≤ orderModeBound n d L m := by
+ cases m with
+ | none => exact Real.sqrt_nonneg _
+ | some p =>
+ unfold orderModeBound orderPairedBound orderProductBound orderCoordinateBound decay
+ positivity
+
+theorem orderModeBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (orderModeBound n d L) := by
+ classical
+ have hs : Summable (fun k : ↥(halfLattice d) => orderPairedBound n d L k) :=
+ (orderPairedBound_summable n d hL).subtype (halfLattice d)
+ have hb : Summable (fun _ : Bool => (1 : ℝ)) := (hasSum_fintype _).summable
+ have hp : Summable (fun p : ↥(halfLattice d) × Bool => orderPairedBound n d L p.1) := by
+ simpa only [mul_one, Function.comp_def] using hs.mul_of_nonneg hb
+ (fun k => orderModeBound_nonneg n d L (some (k, false))) (fun _ => zero_le_one)
+ let e := Equiv.optionEquivSumPUnit.{0, 0} (↥(halfLattice d) × Bool)
+ apply e.symm.summable_iff.mp
+ apply Summable.sum (fun q => orderModeBound n d L (e.symm q))
+ · simpa [e, Function.comp_def, orderModeBound] using hp
+ · exact (hasSum_fintype _).summable
+
+theorem orderModeBound_four (d : ℕ) (L : ℝ) (m : SourceMode d) :
+ orderModeBound 4 d L m = modeMajorant d L m := by
+ cases m <;> rfl
+
+theorem modeCoefficient_iteratedFDeriv_order_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (m : SourceMode d) (j : ℕ) (x : Fin d → ℝ) :
+ ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ orderModeBound j d L m := by
+ classical
+ cases m with
+ | none =>
+ cases j with
+ | zero =>
+ simpa only [norm_iteratedFDeriv_zero, Real.norm_eq_abs, orderModeBound, modeMajorant] using
+ modeCoefficient_bound d hL none x
+ | succ j =>
+ change ‖iteratedFDeriv ℝ (j + 1)
+ (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L)) x‖ ≤ Real.sqrt (1 / sourceZ d L)
+ rw [iteratedFDeriv_succ_const]
+ simp only [Pi.zero_apply, norm_zero]
+ exact Real.sqrt_nonneg _
+ | some p =>
+ rcases p with ⟨k, b⟩
+ let A := Real.sqrt (2 * sourceWeight d L k / sourceZ d L)
+ let P := ∏ i, (1 + |sourceC L * (k.1 i : ℝ)|)
+ let g : ℝ → ℝ := if b then Real.sin else Real.cos
+ let ell := phaseCLM d L k
+ have hg : ContDiff ℝ j g := by
+ cases b <;> simp only [g, Bool.false_eq_true, ite_false, ite_true] <;> fun_prop
+ have hgc : ContDiff ℝ j (g ∘ ell) := hg.comp_continuousLinearMap
+ have hgn : ‖iteratedFDeriv ℝ j g (ell x)‖ ≤ 1 := by
+ cases b with
+ | false =>
+ simpa only [g, Bool.false_eq_true, ite_false,
+ norm_iteratedFDeriv_eq_norm_iteratedDeriv, Real.norm_eq_abs] using
+ Real.abs_iteratedDeriv_cos_le_one j (ell x)
+ | true =>
+ simpa only [g, ite_true, norm_iteratedFDeriv_eq_norm_iteratedDeriv,
+ Real.norm_eq_abs] using Real.abs_iteratedDeriv_sin_le_one j (ell x)
+ have hl : ‖ell‖ ≤ P := by
+ calc
+ ‖ell‖ ≤ ∑ i, |sourceC L * (k.1 i : ℝ)| := phaseCLM_norm_le d L k
+ _ ≤ 1 + ∑ i, |sourceC L * (k.1 i : ℝ)| := by linarith
+ _ ≤ P := frequency_l1_le_product d _ (fun i => abs_nonneg _)
+ have hpow : ‖ell‖ ^ j ≤ P ^ j := by gcongr
+ have hder : ‖iteratedFDeriv ℝ j (g ∘ ell) x‖ ≤ ‖ell‖ ^ j := by
+ rw [ell.iteratedFDeriv_comp_right hg x le_rfl]
+ calc
+ _ ≤ ‖iteratedFDeriv ℝ j g (ell x)‖ * ∏ _i : Fin j, ‖ell‖ :=
+ (iteratedFDeriv ℝ j g (ell x)).norm_compContinuousLinearMap_le (fun _ => ell)
+ _ ≤ 1 * ∏ _i : Fin j, ‖ell‖ :=
+ mul_le_mul_of_nonneg_right hgn (Finset.prod_nonneg (fun _ _ => norm_nonneg _))
+ _ = ‖ell‖ ^ j := by simp
+ have heq : modeCoefficient d L (some (k, b)) = A • (g ∘ ell) := by
+ funext y
+ cases b <;> simp [modeCoefficient, A, g, Function.comp_apply, Pi.smul_apply,
+ smul_eq_mul, ell, phaseCLM_apply]
+ rw [heq, iteratedFDeriv_const_smul_apply hgc.contDiffAt, norm_smul,
+ Real.norm_eq_abs, abs_of_nonneg (Real.sqrt_nonneg _)]
+ calc
+ _ ≤ A * P ^ j := mul_le_mul_of_nonneg_left (hder.trans hpow) (Real.sqrt_nonneg _)
+ _ = orderModeBound j d L (some (k, b)) := by
+ rw [orderModeBound, orderPairedBound_eq_amplitude j d hL k]
+ simp only [A, P, Finset.prod_pow]
+
+/-- One explicit coefficient event, shared by every derivative order. -/
+def goodSample (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : Prop :=
+ ∀ n : ℕ, Summable (fun m => orderModeBound n d L m * |ω m|)
+
+theorem goodSample_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, goodSample d L ω := by
+ apply ae_all_iff.mpr
+ intro n
+ exact weighted_abs_summable_ae _ (orderModeBound_nonneg n d L)
+ (orderModeBound_summable n d hL)
+
+theorem sourceField_smooth_of_goodSample (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SourceMode d → ℝ) (hω : goodSample d L ω) :
+ ∀ n : ℕ, ContDiff ℝ n (sourceField d L ω) := by
+ intro n
+ have hc (m : SourceMode d) : ContDiff ℝ n (modeCoefficient d L m) := by
+ cases m with
+ | none =>
+ change ContDiff ℝ n (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L))
+ fun_prop
+ | some p =>
+ rcases p with ⟨k, b⟩
+ change ContDiff ℝ n (fun x : Fin d → ℝ =>
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ (if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)))
+ cases b <;> simp [phase] <;> fun_prop
+ change ContDiff ℝ n (fun x => ∑' m, modeCoefficient d L m x * ω m)
+ apply contDiff_tsum (v := fun j m => orderModeBound j d L m * |ω m|)
+ · intro m
+ exact (hc m).mul contDiff_const
+ · intro j _
+ exact hω j
+ · intro j m x hj
+ have hcj : ContDiff ℝ j (modeCoefficient d L m) :=
+ (hc m).of_le (by exact_mod_cast hj)
+ have heq : (fun y => modeCoefficient d L m y * ω m) =
+ ω m • modeCoefficient d L m := by
+ funext y
+ simp [smul_eq_mul, mul_comm]
+ rw [heq, iteratedFDeriv_const_smul_apply hcj.contDiffAt, norm_smul, Real.norm_eq_abs]
+ simpa only [mul_comm] using mul_le_mul_of_nonneg_left
+ (modeCoefficient_iteratedFDeriv_order_bound d hL m j x) (abs_nonneg (ω m))
+
+theorem sourceField_smooth_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L ω) := by
+ filter_upwards [goodSample_ae d hL] with ω hω
+ exact sourceField_smooth_of_goodSample d hL ω hω
+
+/-- The carrier depends only on the coefficient tail; finite coordinate changes
+cannot destroy any derivative-order summability condition. -/
+theorem goodSample_congr_cofinite (d : ℕ) (L : ℝ)
+ (ω η : SourceMode d → ℝ) (hωη : ω =ᶠ[Filter.cofinite] η) :
+ goodSample d L ω ↔ goodSample d L η := by
+ constructor
+ · intro hω n
+ apply (hω n).congr_cofinite
+ filter_upwards [hωη] with m hm
+ rw [hm]
+ · intro hη n
+ apply (hη n).congr_cofinite
+ filter_upwards [hωη.symm] with m hm
+ rw [hm]
+
+theorem goodSample_finite_change_iff (d : ℕ) (L : ℝ)
+ (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))
+ (hωη : ∀ m ∉ s, ω m = η m) :
+ goodSample d L ω ↔ goodSample d L η := by
+ apply goodSample_congr_cofinite d L ω η
+ apply Filter.eventually_cofinite.mpr
+ apply s.finite_toSet.subset
+ intro m hm
+ by_contra hms
+ exact hm (hωη m hms)
+
+end I4Smooth
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceSmoothCarrier.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceSmoothCarrier.lean
new file mode 100644
index 000000000..cb6f7b108
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceSmoothCarrier.lean
@@ -0,0 +1,230 @@
+import SourceSmooth
+import SourceGaussianLaw
+import SourceCovariance
+import SourceTorusC4
+import Mathlib.MeasureTheory.Measure.Restrict
+import Mathlib.MeasureTheory.Measure.Typeclasses.Probability
+import Mathlib.MeasureTheory.Constructions.BorelSpace.Real
+
+/-!
+# A measurable smooth carrier for the actual source law
+
+The carrier consists of the coefficient samples satisfying every explicit
+order-weighted absolute summability condition from SourceSmooth. Its measure is
+the pullback of the existing product Gaussian sourceLaw under literal subtype
+inclusion. Inclusion pushes this measure back to exactly sourceLaw, so finite
+coefficient observations, field evaluation laws, and covariance are unchanged.
+
+The construction concerns the same literal Fourier source, for fixed d and L.
+It does not identify the spectral kernel with a periodized theta kernel, define
+a conditional kernel or a smooth-function-space law, or discharge a Lifetime
+Field adapter, Morse, elder, counting, density, or universality conclusion.
+-/
+
+noncomputable section
+open I4Foundation I4Source I4Smooth I4SourceGaussian I4SourceCovariance I4Kernel
+open I4Torus I4TorusC4 MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal NNReal Manifold Topology
+
+namespace I4SmoothCarrier
+
+/-- The actual common coefficient event, with no smoothness premise added. -/
+def goodSet (d : ℕ) (L : ℝ) : Set (SourceMode d → ℝ) :=
+ {ω | goodSample d L ω}
+
+private def orderAbsNN (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ)
+ (m : SourceMode d) : ℝ≥0 :=
+ ⟨orderModeBound n d L m * |ω m|,
+ mul_nonneg (orderModeBound_nonneg n d L m) (abs_nonneg _)⟩
+
+private def orderAbsTotal (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : ℝ≥0∞ :=
+ ∑' m, (orderAbsNN n d L ω m : ℝ≥0∞)
+
+private theorem orderAbsTotal_ne_top_iff (n d : ℕ) (L : ℝ)
+ (ω : SourceMode d → ℝ) :
+ orderAbsTotal n d L ω ≠ ∞ ↔
+ Summable (fun m => orderModeBound n d L m * |ω m|) := by
+ exact ENNReal.tsum_coe_ne_top_iff_summable_coe (f := orderAbsNN n d L ω)
+
+private theorem orderAbsTotal_measurable (n d : ℕ) (L : ℝ) :
+ Measurable (orderAbsTotal n d L) := by
+ unfold orderAbsTotal
+ simp_rw [ENNReal.tsum_eq_iSup_sum]
+ apply Measurable.iSup
+ intro s
+ apply s.measurable_fun_sum
+ intro m _
+ have hm : Measurable (fun ω : SourceMode d → ℝ => orderAbsNN n d L ω m) := by
+ unfold orderAbsNN
+ exact (show Measurable (fun ω : SourceMode d → ℝ => orderModeBound n d L m * |ω m|) by
+ fun_prop).nnreal_mk
+ exact hm.coe_nnreal_ennreal
+
+theorem goodSet_measurable (d : ℕ) (L : ℝ) : MeasurableSet (goodSet d L) := by
+ have heq : goodSet d L =
+ ⋂ n : ℕ, {ω : SourceMode d → ℝ | orderAbsTotal n d L ω ≠ ∞} := by
+ ext ω
+ simp only [goodSet, Set.mem_setOf_eq, Set.mem_iInter, goodSample]
+ exact forall_congr' fun n => (orderAbsTotal_ne_top_iff n d L ω).symm
+ rw [heq]
+ apply MeasurableSet.iInter
+ intro n
+ convert ((orderAbsTotal_measurable n d L) (measurableSet_singleton ∞)).compl using 1
+ ext ω
+ simp
+
+theorem goodSet_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ω ∈ goodSet d L :=
+ goodSample_ae d hL
+
+theorem goodSet_measure_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ sourceLaw d (goodSet d L) = 1 := by
+ exact (mem_ae_iff_prob_eq_one (goodSet_measurable d L)).mp (goodSet_ae d hL)
+
+/-- A coefficient sample on the explicit all-order summability carrier. -/
+abbrev SmoothSample (d : ℕ) (L : ℝ) := ↥(goodSet d L)
+
+/-- Literal inclusion, retaining every coefficient of the original sample. -/
+def sampleInclusion (d : ℕ) (L : ℝ) : SmoothSample d L → (SourceMode d → ℝ) :=
+ Subtype.val
+
+theorem sampleInclusion_measurable (d : ℕ) (L : ℝ) :
+ Measurable (sampleInclusion d L) :=
+ measurable_subtype_coe
+
+/-- Pull back the original product law; no normalization or new law is chosen. -/
+def smoothLaw (d : ℕ) (L : ℝ) : Measure (SmoothSample d L) :=
+ (sourceLaw d).comap (sampleInclusion d L)
+
+theorem sampleInclusion_map (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ (smoothLaw d L).map (sampleInclusion d L) = sourceLaw d := by
+ change ((sourceLaw d).comap ((↑) : SmoothSample d L → (SourceMode d → ℝ))).map
+ ((↑) : SmoothSample d L → (SourceMode d → ℝ)) = sourceLaw d
+ rw [map_comap_subtype_coe (goodSet_measurable d L),
+ Measure.restrict_eq_self_of_ae_mem (goodSet_ae d hL)]
+
+theorem sampleInclusion_measurePreserving (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ MeasurePreserving (sampleInclusion d L) (smoothLaw d L) (sourceLaw d) :=
+ ⟨sampleInclusion_measurable d L, sampleInclusion_map d hL⟩
+
+theorem smoothLaw_isProbabilityMeasure (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ IsProbabilityMeasure (smoothLaw d L) := by
+ apply (MeasurableEmbedding.subtype_coe (goodSet_measurable d L)).isProbabilityMeasure_comap
+ simpa only [Subtype.range_coe] using goodSet_ae d hL
+
+/-- Every measurable observation has exactly its original pushforward law. -/
+theorem observation_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :
+ (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceLaw d).map X := by
+ change (smoothLaw d L).map (X ∘ sampleInclusion d L) = (sourceLaw d).map X
+ rw [← Measure.map_map hX (sampleInclusion_measurable d L), sampleInclusion_map d hL]
+
+theorem coordinate_marginal (d : ℕ) {L : ℝ} (hL : L ≠ 0) (m : SourceMode d) :
+ (smoothLaw d L).map (fun ω => sampleInclusion d L ω m) = gaussianReal 0 1 := by
+ rw [observation_map_eq d hL (fun ω => ω m) (measurable_pi_apply m)]
+ exact I4Foundation.coordinate_marginal m
+
+theorem finiteCoordinate_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (m : Fin n → SourceMode d) :
+ (smoothLaw d L).map (fun ω j => sampleInclusion d L ω (m j)) =
+ (sourceLaw d).map (fun ω j => ω (m j)) := by
+ exact observation_map_eq d hL _ (Measurable.of_eval (fun j => measurable_pi_apply (m j)))
+
+/-- The unchanged literal real-cover field, evaluated on the carrier. -/
+def smoothSourceField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : Fin d → ℝ) : ℝ :=
+ sourceField d L (sampleInclusion d L ω) x
+
+theorem smoothSourceField_contDiff (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample d L) (n : ℕ) : ContDiff ℝ n (smoothSourceField d L ω) :=
+ sourceField_smooth_of_goodSample d hL (sampleInclusion d L ω) ω.property n
+
+theorem smoothSourceField_smooth (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample d L) : ContDiff ℝ (⊤ : ℕ∞) (smoothSourceField d L ω) :=
+ contDiff_infty.mpr (smoothSourceField_contDiff d hL ω)
+
+theorem smoothSourceField_finiteVector_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (x : Fin n → (Fin d → ℝ)) :
+ (smoothLaw d L).map (fun ω j => smoothSourceField d L ω (x j)) =
+ (sourceLaw d).map (fun ω j => sourceField d L ω (x j)) := by
+ exact observation_map_eq d hL _
+ (Measurable.of_eval (fun j => sourceField_eval_measurable d L (x j)))
+
+theorem smoothSourceField_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (x : Fin n → (Fin d → ℝ)) :
+ HasGaussianLaw (fun ω j => smoothSourceField d L ω (x j)) (smoothLaw d L) := by
+ have hm : Measurable (fun ω j => smoothSourceField d L ω (x j)) :=
+ (Measurable.of_eval (fun j => sourceField_eval_measurable d L (x j))).comp
+ (sampleInclusion_measurable d L)
+ refine ⟨hm.aemeasurable, ?_⟩
+ rw [smoothSourceField_finiteVector_map_eq d hL n x]
+ exact (source_finiteVector_hasGaussianLaw d hL n x).isGaussian_map
+
+theorem covariance_comp_inclusion (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (X Y : (SourceMode d → ℝ) → ℝ) (hX : Measurable X) (hY : Measurable Y) :
+ cov[fun ω => X (sampleInclusion d L ω), fun ω => Y (sampleInclusion d L ω); smoothLaw d L] =
+ cov[X, Y; sourceLaw d] := by
+ have h := covariance_map_fun (μ := smoothLaw d L) (Z := sampleInclusion d L)
+ (X := X) (Y := Y) hX.aestronglyMeasurable hY.aestronglyMeasurable
+ (sampleInclusion_measurable d L).aemeasurable
+ rw [sampleInclusion_map d hL] at h
+ exact h.symm
+
+theorem smoothSourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (x y : Fin d → ℝ) :
+ cov[fun ω => smoothSourceField d L ω x, fun ω => smoothSourceField d L ω y; smoothLaw d L] =
+ sourceSpectralKernel d L (x - y) := by
+ calc
+ _ = cov[fun ω => sourceField d L ω x, fun ω => sourceField d L ω y; sourceLaw d] :=
+ covariance_comp_inclusion d hL _ _ (sourceField_eval_measurable d L x)
+ (sourceField_eval_measurable d L y)
+ _ = _ := sourceField_covariance d hL x y
+
+/-- The unchanged literal torus descent of the same coefficient sample. -/
+def smoothTorusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (ω : SmoothSample d L) (q : SourceTorus d L) : ℝ :=
+ torusSourceField d L (sampleInclusion d L ω) q
+
+attribute [local instance] actualChartedSpace
+
+theorem smoothTorusSourceField_smooth (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (ω : SmoothSample d L) :
+ ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) (⊤ : ℕ∞) (smoothTorusSourceField d L ω) := by
+ let _ := torus_isManifold d L
+ have hs := smoothSourceField_smooth d (Fact.out : 0 < L).ne' ω
+ intro q
+ rw [contMDiffAt_iff_source]
+ have heq : smoothTorusSourceField d L ω ∘ (extChartAt 𝓘(ℝ, Fin d → ℝ) q).symm =
+ smoothSourceField d L ω := by
+ funext x
+ change torusSourceField d L (sampleInclusion d L ω)
+ ((quotientChart d L (chartCenter d L q)).symm x) = _
+ rw [quotientChart_symm]
+ exact torusSourceField_pullback d L (sampleInclusion d L ω) x
+ rw [heq, contMDiffWithinAt_iff_contDiffWithinAt]
+ exact hs.contDiffAt.contDiffWithinAt
+
+theorem smoothTorusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ)
+ [Fact (0 < L)] (n : ℕ) (q : Fin n → SourceTorus d L) :
+ HasGaussianLaw (fun ω j => smoothTorusSourceField d L ω (q j)) (smoothLaw d L) := by
+ have hm : Measurable (fun ω j => smoothTorusSourceField d L ω (q j)) :=
+ (Measurable.of_eval (fun j => torusSourceField_eval_measurable d L (q j))).comp
+ (sampleInclusion_measurable d L)
+ refine ⟨hm.aemeasurable, ?_⟩
+ change IsGaussian ((smoothLaw d L).map
+ (fun ω j => torusSourceField d L (sampleInclusion d L ω) (q j)))
+ rw [observation_map_eq d (Fact.out : 0 < L).ne' _
+ (Measurable.of_eval (fun j => torusSourceField_eval_measurable d L (q j)))]
+ exact (torusSourceField_finiteVector_hasGaussianLaw d L n q).isGaussian_map
+
+theorem smoothTorusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q p : SourceTorus d L) :
+ cov[fun ω => smoothTorusSourceField d L ω q, fun ω => smoothTorusSourceField d L ω p;
+ smoothLaw d L] =
+ sourceSpectralKernel d L (torusRepresentative d L q - torusRepresentative d L p) := by
+ calc
+ _ = cov[fun ω => torusSourceField d L ω q, fun ω => torusSourceField d L ω p; sourceLaw d] :=
+ covariance_comp_inclusion d (Fact.out : 0 < L).ne' _ _
+ (torusSourceField_eval_measurable d L q) (torusSourceField_eval_measurable d L p)
+ _ = _ := torusSourceField_covariance d L q p
+
+end I4SmoothCarrier
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceTorus.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceTorus.lean
new file mode 100644
index 000000000..b9fe49752
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceTorus.lean
@@ -0,0 +1,111 @@
+import SourceCovariance
+import Mathlib.MeasureTheory.Integral.IntervalIntegral.Periodic
+import Mathlib.Probability.Distributions.Gaussian.IsGaussianProcess.Basic
+
+/-! Literal descent of the existing real-cover field to a product of additive circles.
+The sample law remains sourceLaw. Smooth torus and Banach-valued laws are separate. -/
+noncomputable section
+open I4Foundation I4Weights I4Source I4Lattice I4Kernel I4SourceGaussian I4SourceCovariance
+open MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal NNReal
+
+namespace I4Torus
+
+abbrev SourceTorus (d : ℕ) (L : ℝ) := Fin d → AddCircle L
+
+def torusProjection (d : ℕ) (L : ℝ) (x : Fin d → ℝ) : SourceTorus d L :=
+ fun i => (x i : AddCircle L)
+
+def torusRepresentative (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q : SourceTorus d L) : Fin d → ℝ :=
+ fun i => (AddCircle.equivIco L 0 (q i)).1
+
+def torusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (ω : SourceMode d → ℝ) (q : SourceTorus d L) : ℝ :=
+ sourceField d L ω (torusRepresentative d L q)
+
+theorem torusProjection_measurable (d : ℕ) (L : ℝ) : Measurable (torusProjection d L) := by
+ exact Measurable.of_eval (fun i => AddCircle.measurable_mk'.comp (measurable_pi_apply i))
+
+theorem torusRepresentative_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ Measurable (torusRepresentative d L) := by
+ exact Measurable.of_eval (fun i => measurable_subtype_coe.comp
+ ((AddCircle.measurableEquivIco L 0).measurable.comp (measurable_pi_apply i)))
+
+theorem torusProjection_representative (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q : SourceTorus d L) : torusProjection d L (torusRepresentative d L q) = q := by
+ funext i
+ exact AddCircle.coe_equivIco (p := L) (a := 0) (y := q i)
+
+theorem sourceField_eq_of_torusProjection_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SourceMode d → ℝ) (x y : Fin d → ℝ)
+ (h : torusProjection d L x = torusProjection d L y) :
+ sourceField d L ω x = sourceField d L ω y := by
+ classical
+ have hz (i : Fin d) : ∃ n : ℤ, n • L = y i - x i := by
+ apply (AddCircle.coe_eq_zero_iff (p := L)).mp
+ rw [AddCircle.coe_sub]
+ exact sub_eq_zero.mpr (congrFun h i).symm
+ choose n hn using hz
+ have he : y = fun i => x i + L * (n i : ℝ) := by
+ funext i
+ have hi := hn i
+ rw [zsmul_eq_mul] at hi
+ linarith
+ rw [he]
+ exact (sourceField_lattice_shift d hL ω n x).symm
+
+theorem torusSourceField_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (ω : SourceMode d → ℝ) (x : Fin d → ℝ) :
+ torusSourceField d L ω (torusProjection d L x) = sourceField d L ω x := by
+ exact sourceField_eq_of_torusProjection_eq d (Fact.out : 0 < L).ne' ω
+ (torusRepresentative d L (torusProjection d L x)) x
+ (torusProjection_representative d L (torusProjection d L x))
+
+theorem torusSourceField_eval_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q : SourceTorus d L) : Measurable (fun ω => torusSourceField d L ω q) := by
+ exact sourceField_eval_measurable d L (torusRepresentative d L q)
+
+theorem torusSourceField_joint_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ Measurable (fun p : (SourceMode d → ℝ) × SourceTorus d L =>
+ torusSourceField d L p.1 p.2) := by
+ unfold torusSourceField sourceField scalarSeries
+ apply Measurable.tsum
+ intro m
+ have hm : Continuous (fun x : Fin d → ℝ => modeCoefficient d L m x) := by
+ cases m with
+ | none => simp only [modeCoefficient]; fun_prop
+ | some p =>
+ rcases p with ⟨k,b⟩
+ cases b <;> simp only [modeCoefficient, Bool.false_eq_true, ite_false, ite_true] <;>
+ unfold phase <;> fun_prop
+ exact (hm.measurable.comp ((torusRepresentative_measurable d L).comp measurable_snd)).mul
+ ((measurable_pi_apply m).comp measurable_fst)
+
+theorem torusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (n : ℕ) (q : Fin n → SourceTorus d L) :
+ HasGaussianLaw (fun ω j => torusSourceField d L ω (q j)) (sourceLaw d) := by
+ exact source_finiteVector_hasGaussianLaw d (Fact.out : 0 < L).ne' n
+ (fun j => torusRepresentative d L (q j))
+
+theorem torusSourceField_isGaussianProcess (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ IsGaussianProcess (fun q ω => torusSourceField d L ω q) (sourceLaw d) := by
+ exact (sourceField_isGaussianProcess d (Fact.out : 0 < L).ne').comp_right
+ (torusRepresentative d L)
+
+theorem torusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q p : SourceTorus d L) :
+ cov[fun ω => torusSourceField d L ω q, fun ω => torusSourceField d L ω p; sourceLaw d] =
+ sourceSpectralKernel d L (torusRepresentative d L q - torusRepresentative d L p) := by
+ exact sourceField_covariance d (Fact.out : 0 < L).ne'
+ (torusRepresentative d L q) (torusRepresentative d L p)
+
+theorem torusSourceField_covariance_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (x y : Fin d → ℝ) :
+ cov[fun ω => torusSourceField d L ω (torusProjection d L x),
+ fun ω => torusSourceField d L ω (torusProjection d L y); sourceLaw d] =
+ sourceSpectralKernel d L (x - y) := by
+ simp_rw [torusSourceField_pullback]
+ exact sourceField_covariance d (Fact.out : 0 < L).ne' x y
+
+end I4Torus
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceTorusC4.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceTorusC4.lean
new file mode 100644
index 000000000..30cfb670f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceTorusC4.lean
@@ -0,0 +1,134 @@
+import SourceC4
+import SourceTorus
+import Mathlib.Topology.OpenPartialHomeomorph.Constructions
+import Mathlib.Geometry.Manifold.ContMDiff.Basic
+import Mathlib.Geometry.Manifold.ContMDiff.NormedSpace
+import Mathlib.Topology.LocallyConstant.Basic
+
+noncomputable section
+open I4Foundation I4Weights I4Source I4C4 I4Torus MeasureTheory
+open scoped Manifold ContDiff Topology
+namespace I4TorusC4
+
+def quotientChart (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :
+ OpenPartialHomeomorph (SourceTorus d L) (Fin d → ℝ) :=
+ (OpenPartialHomeomorph.pi (fun i : Fin d => AddCircle.openPartialHomeomorphCoe L (a i))).symm
+
+def chartCenter (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) : Fin d → ℝ :=
+ fun i => torusRepresentative d L q i - L / 2
+
+theorem quotientChart_symm (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :
+ (quotientChart d L a).symm = torusProjection d L := by
+ rfl
+
+theorem centered_chart_covers (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) :
+ q ∈ (quotientChart d L (chartCenter d L q)).source := by
+ let e := OpenPartialHomeomorph.pi
+ (fun i : Fin d => AddCircle.openPartialHomeomorphCoe L (chartCenter d L q i))
+ have hs : torusRepresentative d L q ∈ e.source := by
+ change torusRepresentative d L q ∈ Set.pi Set.univ
+ (fun i => Set.Ioo (chartCenter d L q i) (chartCenter d L q i + L))
+ intro i _
+ change chartCenter d L q i < torusRepresentative d L q i ∧
+ torusRepresentative d L q i < chartCenter d L q i + L
+ have hL : 0 < L := Fact.out
+ dsimp [chartCenter]
+ constructor <;> linarith
+ have he : e (torusRepresentative d L q) = q :=
+ torusProjection_representative d L q
+ have ht := e.map_source hs
+ rw [he] at ht
+ exact ht
+
+@[instance_reducible] def actualChartedSpace (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ ChartedSpace (Fin d → ℝ) (SourceTorus d L) where
+ atlas := Set.range (quotientChart d L)
+ chartAt := fun q => quotientChart d L (chartCenter d L q)
+ mem_chart_source := centered_chart_covers d L
+ chart_mem_atlas := fun q => ⟨chartCenter d L q, rfl⟩
+
+attribute [local instance] actualChartedSpace
+
+theorem chart_transition_contDiff (d : ℕ) (L : ℝ) [Fact (0 < L)] (a b : Fin d → ℝ) :
+ ContDiffOn ℝ ∞ ((quotientChart d L a).symm.trans (quotientChart d L b))
+ ((quotientChart d L a).symm.trans (quotientChart d L b)).source := by
+ let ea := quotientChart d L a
+ let eb := quotientChart d L b
+ let T := ea.symm.trans eb
+ let S := T.source
+ have hproj (x : S) : torusProjection d L (T x) = torusProjection d L x := by
+ have hb : ea.symm (x : Fin d → ℝ) ∈ eb.source := x.property.2
+ have hi := eb.left_inv hb
+ simpa only [T, ea, eb, OpenPartialHomeomorph.trans_apply, quotientChart_symm] using hi
+ have hlat (x : S) (i : Fin d) : T x i - (x : Fin d → ℝ) i ∈
+ AddSubgroup.zmultiples L := by
+ apply AddSubgroup.mem_zmultiples_iff.mpr
+ apply (AddCircle.coe_eq_zero_iff (p := L)).mp
+ rw [AddCircle.coe_sub]
+ exact sub_eq_zero.mpr (congrFun (hproj x) i)
+ let delta : S → Fin d → AddSubgroup.zmultiples L :=
+ fun x i => ⟨T x i - (x : Fin d → ℝ) i, hlat x i⟩
+ have hd : Continuous delta := by
+ apply continuous_pi
+ intro i
+ apply Continuous.subtype_mk
+ exact ((continuous_apply i).comp T.continuousOn.domRestrict).sub
+ ((continuous_apply i).comp continuous_subtype_val)
+ have hlc : IsLocallyConstant delta :=
+ (IsLocallyConstant.iff_continuous delta).mpr hd
+ apply T.open_source.contDiffOn_iff.mpr
+ intro x hx
+ let x0 : S := ⟨x, hx⟩
+ let c : Fin d → ℝ := fun i => (delta x0 i : ℝ)
+ have hsub : ∀ᶠ y : S in 𝓝 x0, T y = (y : Fin d → ℝ) + c := by
+ filter_upwards [hlc.eventually_eq x0] with y hy
+ funext i
+ have hi := congrArg (fun z : Fin d → AddSubgroup.zmultiples L => (z i : ℝ)) hy
+ change T y i - (y : Fin d → ℝ) i = c i at hi
+ change T y i = (y : Fin d → ℝ) i + c i
+ linarith
+ have hamb : (fun y => T y) =ᶠ[𝓝 x] (fun y => y + c) := by
+ have hm : ∀ᶠ y in Filter.map ((↑) : S → (Fin d → ℝ)) (𝓝 x0), T y = y + c :=
+ Filter.eventually_map.mpr hsub
+ have hmap : Filter.map ((↑) : S → (Fin d → ℝ)) (𝓝 x0) = 𝓝 x :=
+ map_nhds_subtype_coe_eq_nhds hx (T.open_source.mem_nhds hx)
+ rw [hmap] at hm
+ exact hm
+ exact (contDiff_id.add contDiff_const).contDiffAt.congr_of_eventuallyEq hamb
+
+theorem torus_isManifold (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ IsManifold 𝓘(ℝ, Fin d → ℝ) ∞ (SourceTorus d L) := by
+ apply isManifold_of_contDiffOn
+ intro e e' he he'
+ change e ∈ Set.range (quotientChart d L) at he
+ change e' ∈ Set.range (quotientChart d L) at he'
+ rcases he with ⟨a, rfl⟩
+ rcases he' with ⟨b, rfl⟩
+ simpa only [modelWithCornersSelf_coe, modelWithCornersSelf_coe_symm,
+ Function.comp_id, Function.id_comp, Set.preimage_id, Set.range_id, Set.inter_univ] using
+ chart_transition_contDiff d L a b
+
+theorem torusSourceField_contMDiff_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ ∀ᵐ sample ∂sourceLaw d,
+ ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) 4 (torusSourceField d L sample) := by
+ let _ := torus_isManifold d L
+ filter_upwards [sourceField_contDiff_ae d (Fact.out : 0 < L).ne'] with sample hs
+ intro q
+ rw [contMDiffAt_iff_source]
+ have heq : torusSourceField d L sample ∘ (extChartAt 𝓘(ℝ, Fin d → ℝ) q).symm =
+ sourceField d L sample := by
+ funext x
+ change torusSourceField d L sample ((quotientChart d L (chartCenter d L q)).symm x) = _
+ rw [quotientChart_symm]
+ exact torusSourceField_pullback d L sample x
+ rw [heq, contMDiffWithinAt_iff_contDiffWithinAt]
+ exact hs.contDiffAt.contDiffWithinAt
+
+theorem torusSourceField_weakSuperlevel_closed_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ ∀ᵐ sample ∂sourceLaw d, ∀ h : ℝ,
+ IsClosed {q : SourceTorus d L | h ≤ torusSourceField d L sample q} := by
+ filter_upwards [torusSourceField_contMDiff_ae d L] with sample hs
+ intro h
+ exact isClosed_Ici.preimage hs.continuous
+
+end I4TorusC4
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SpectralWeights.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SpectralWeights.lean
new file mode 100644
index 000000000..191a22f14
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SpectralWeights.lean
@@ -0,0 +1,160 @@
+import Mathlib.NumberTheory.ModularForms.JacobiTheta.TwoVariable
+import Mathlib.Analysis.Normed.Ring.InfiniteSum
+import Mathlib.Data.Fin.Tuple.Basic
+import Mathlib.Algebra.BigOperators.Fin
+
+/-! Concrete square-root Gaussian spectral majorants for the required I4 bridge.
+The product majorant dominates the l1 frequency norm for the default Pi sup norm.
+This file alone proves neither a Gaussian field law nor sample smoothness. -/
+
+noncomputable section
+open Real
+open scoped BigOperators
+namespace I4Weights
+
+def decay (a : ℝ) (k : ℤ) : ℝ := exp (-a * (k : ℝ) ^ 2)
+def coordinateBound (a c : ℝ) (k : ℤ) : ℝ :=
+ decay a k * (1 + |c * (k : ℝ)|) ^ 4
+def productDecay (d : ℕ) (a : ℝ) (k : Fin d → ℤ) : ℝ :=
+ ∏ i, decay a (k i)
+def productBound (d : ℕ) (a c : ℝ) (k : Fin d → ℤ) : ℝ :=
+ ∏ i, coordinateBound a c (k i)
+def sourceA (L : ℝ) : ℝ := π ^ 2 / L ^ 2
+def sourceC (L : ℝ) : ℝ := 2 * π / L
+def sourceWeight (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : ℝ :=
+ productDecay d (2 * sourceA L) k
+def sourceZ (d : ℕ) (L : ℝ) : ℝ := ∑' k, sourceWeight d L k
+def pairedBound (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : ℝ :=
+ Real.sqrt (2 / sourceZ d L) * productBound d (sourceA L) (sourceC L) k
+
+theorem summable_decay_pow {a : ℝ} (ha : 0 < a) (n : ℕ) :
+ Summable (fun k : ℤ => decay a k * |(k : ℝ)| ^ n) := by
+ have hb := summable_pow_mul_jacobiTheta₂_term_bound 0
+ (show 0 < a / π by positivity) n
+ have he (k : ℤ) : -π * (a / π * (k : ℝ) ^ 2 - 2 * 0 * |(k : ℝ)|) =
+ -a * (k : ℝ) ^ 2 := by
+ field_simp
+ ring
+ simp_rw [Int.cast_abs, he] at hb
+ simpa [decay, mul_comm] using hb
+
+theorem coordinateBound_summable {a c : ℝ} (ha : 0 < a) :
+ Summable (coordinateBound a c) := by
+ have hs := summable_decay_pow ha
+ convert ((((hs 0).add ((hs 1).mul_left (4 * |c|))).add
+ ((hs 2).mul_left (6 * |c| ^ 2))).add
+ ((hs 3).mul_left (4 * |c| ^ 3))).add ((hs 4).mul_left (|c| ^ 4)) using 1
+ funext k
+ simp only [coordinateBound, abs_mul]
+ ring
+
+set_option maxHeartbeats 800000 in
+theorem finite_product_summable {f : ℤ → ℝ} (hf : Summable f) (hn : ∀ k, 0 ≤ f k)
+ (d : ℕ) : Summable (fun k : Fin d → ℤ => ∏ i, f (k i)) := by
+ classical
+ induction d with
+ | zero => exact (hasSum_fintype _).summable
+ | succ d ih =>
+ have hp : Summable (fun p : ℤ × (Fin d → ℤ) => f p.1 * ∏ i, f (p.2 i)) :=
+ Summable.mul_of_nonneg (ι := ℤ) (ι' := Fin d → ℤ)
+ (f := f) (g := fun k : Fin d → ℤ => ∏ i, f (k i))
+ hf ih hn (fun k => Finset.prod_nonneg (fun i _ => hn (k i)))
+ have heq :
+ ((fun k : Fin (d + 1) → ℤ => ∏ i, f (k i)) ∘
+ (Fin.consEquiv (fun _ : Fin (d + 1) => ℤ))) =
+ (fun p : ℤ × (Fin d → ℤ) => f p.1 * ∏ i, f (p.2 i)) := by
+ funext p
+ simp only [Function.comp_apply, Fin.consEquiv_apply, Fin.prod_univ_succ,
+ Fin.cons_zero, Fin.cons_succ]
+ apply (Fin.consEquiv (fun _ : Fin (d + 1) => ℤ)).summable_iff.mp
+ rw [heq]
+ exact hp
+
+theorem productBound_summable {a c : ℝ} (ha : 0 < a) (d : ℕ) :
+ Summable (productBound d a c) := by
+ exact finite_product_summable (coordinateBound_summable ha)
+ (fun k => by unfold coordinateBound decay; positivity) d
+
+theorem productDecay_eq_exp (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :
+ productDecay d a k = exp (-a * ∑ i, (k i : ℝ) ^ 2) := by
+ unfold productDecay decay
+ rw [← Real.exp_sum, ← Finset.mul_sum]
+
+theorem frequency_l1_le_product (d : ℕ) (v : Fin d → ℝ) (hv : ∀ i, 0 ≤ v i) :
+ 1 + ∑ i, v i ≤ ∏ i, (1 + v i) := by
+ classical
+ have H (s : Finset (Fin d)) : 1 + ∑ i ∈ s, v i ≤ ∏ i ∈ s, (1 + v i) := by
+ induction s using Finset.induction_on with
+ | empty => simp
+ | @insert i s hi ih =>
+ rw [Finset.sum_insert hi, Finset.prod_insert hi]
+ have hsum : 0 ≤ ∑ j ∈ s, v j := Finset.sum_nonneg (fun j _ => hv j)
+ calc
+ 1 + (v i + ∑ j ∈ s, v j) ≤ (1 + v i) * (1 + ∑ j ∈ s, v j) := by
+ nlinarith [mul_nonneg (hv i) hsum]
+ _ ≤ (1 + v i) * ∏ j ∈ s, (1 + v j) :=
+ mul_le_mul_of_nonneg_left ih (by linarith [hv i])
+ exact H Finset.univ
+
+theorem sourceA_pos {L : ℝ} (hL : L ≠ 0) : 0 < sourceA L := by
+ unfold sourceA
+ positivity
+
+theorem sourceWeight_eq_physical (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :
+ sourceWeight d L k = exp (-(∑ i, (sourceC L * (k i : ℝ)) ^ 2) / 2) := by
+ have hc : sourceC L ^ 2 = 4 * sourceA L := by
+ unfold sourceC sourceA
+ ring
+ have hs : (∑ i, (sourceC L * (k i : ℝ)) ^ 2) =
+ 4 * sourceA L * ∑ i, (k i : ℝ) ^ 2 := by
+ rw [Finset.mul_sum]
+ apply Finset.sum_congr rfl
+ intro i _
+ rw [mul_pow, hc]
+ rw [sourceWeight, productDecay_eq_exp, hs]
+ congr 1
+ ring
+
+theorem sourceWeight_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (sourceWeight d L) := by
+ have ha : 0 < 2 * sourceA L := mul_pos (by norm_num) (sourceA_pos hL)
+ have hs : Summable (decay (2 * sourceA L)) := by
+ simpa using summable_decay_pow ha 0
+ exact finite_product_summable hs (fun k => (Real.exp_pos _).le) d
+
+theorem sourceZ_pos (d : ℕ) {L : ℝ} (hL : L ≠ 0) : 0 < sourceZ d L := by
+ apply (sourceWeight_summable d hL).tsum_pos
+ (fun k => by unfold sourceWeight productDecay decay; positivity) (fun _ => 0)
+ simp [sourceWeight, productDecay, decay]
+
+theorem pairedBound_eq_amplitude (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : Fin d → ℤ) :
+ pairedBound d L k = Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^ 4 := by
+ have hsqrt : Real.sqrt (sourceWeight d L k) = productDecay d (sourceA L) k := by
+ have hw : sourceWeight d L k = (productDecay d (sourceA L) k) ^ 2 := by
+ rw [sourceWeight, productDecay_eq_exp, productDecay_eq_exp, pow_two, ← Real.exp_add]
+ congr 1
+ ring
+ rw [hw, Real.sqrt_sq_eq_abs, abs_of_nonneg]
+ unfold productDecay decay
+ positivity
+ have hamp : Real.sqrt (2 * sourceWeight d L k / sourceZ d L) =
+ Real.sqrt (2 / sourceZ d L) * productDecay d (sourceA L) k := by
+ have he : 2 * sourceWeight d L k / sourceZ d L =
+ (2 / sourceZ d L) * sourceWeight d L k := by ring
+ rw [he, Real.sqrt_mul (by have := sourceZ_pos d hL; positivity), hsqrt]
+ have hp : productBound d (sourceA L) (sourceC L) k =
+ productDecay d (sourceA L) k * ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^ 4 := by
+ exact Finset.prod_mul_distrib
+ rw [pairedBound, hp, hamp]
+ ring
+
+theorem pairedBound_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (pairedBound d L) := by
+ exact (productBound_summable (sourceA_pos hL) d).mul_left _
+
+theorem pairedBound_subtype_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (S : Set (Fin d → ℤ)) : Summable (fun k : S => pairedBound d L k) := by
+ exact (pairedBound_summable d hL).subtype S
+
+end I4Weights
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeAxiomAudit.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeAxiomAudit.lean
new file mode 100644
index 000000000..e437045b2
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeAxiomAudit.lean
@@ -0,0 +1,81 @@
+import SourceLifetimeField
+import SourceLifetimeControls
+import SourceSmoothControls
+import Lean.Elab.Command
+import Lean.Util.CollectAxioms
+
+/-!
+Complete module-origin declaration census, including private/generated helpers.
+This audit is adapted from the unchanged source SourceSmoothAxiomAudit.
+The emitted report is kernel/axiom evidence only after actual successful execution.
+-/
+
+#print axioms I4ThetaBridge.sourceSpectralKernel_eq_periodicCovariance
+#print axioms I4LifetimeField.actualGaussianFieldInterface
+#print axioms I4LifetimeField.actualGaussianFieldInterface_exists
+
+open Lean Elab Command in
+run_cmd do
+ let env := (← getEnv).setExporting false
+ let allowed : Array Name := #[`propext, `Classical.choice, `Quot.sound]
+ let modules : Array Name := #[
+ `GaussianSeriesFoundation, `SpectralWeights, `SourceFourierSeries,
+ `SourceC4, `SourceGaussianLaw, `SourceLattice, `SourceKernel,
+ `SourceCovariance, `SourceTorus, `SourceTorusC4,
+ `SourceSmooth, `SourceSmoothCarrier, `SourceSmoothControls,
+ `Lifetime, `SourceThetaBridge, `SourceLifetimeGeometry, `SourceLifetimeField,
+ `SourceLifetimeControls]
+ liftIO <| IO.eprintln "LIFETIME_AUDIT_PROGRESS START"
+ -- Materialize the complete constant list once; coverage is unchanged.
+ let constants := env.constants.toList
+ let mut allNames : Array Name := #[]
+ for modName in modules do
+ let some idx := env.getModuleIdx? modName
+ | throwError "missing audited module: {modName}"
+ let names := (constants.filterMap fun (name, _) =>
+ if env.getModuleIdxFor? name == some idx then some name else none).toArray.qsort Name.lt
+ if names.isEmpty then
+ throwError "empty declaration inventory for audited module: {modName}"
+ liftIO <| IO.eprintln s!"LIFETIME_AUDIT_PROGRESS {modName} COUNT {names.size}"
+ logInfo m!"LIFETIME_AUDIT_MODULE {modName} COUNT {names.size}"
+ for name in names do
+ if (env.checked.get.find? name).isNone then
+ throwError "missing kernel declaration: {name}"
+ let axs ← Lean.collectAxioms name
+ logInfo m!"LIFETIME_AUDIT_DECL {name} AXIOMS {axs}"
+ for ax in axs do
+ unless allowed.contains ax do
+ throwError "forbidden transitive axiom {ax} in {name}"
+ allNames := allNames.push name
+ let required : Array Name := #[
+ `I4SmoothCarrier.sampleInclusion_map,
+ `I4SmoothCarrier.smoothLaw_isProbabilityMeasure,
+ `I4SmoothCarrier.smoothSourceField_finiteVector_hasGaussianLaw,
+ `I4SmoothCarrier.smoothSourceField_covariance,
+ `UniversalLaw.Spec.Lifetime.GaussianFieldInterface,
+ `I4ThetaBridge.theta_summable,
+ `I4ThetaBridge.theta_zero_pos,
+ `I4ThetaBridge.thetaSum_eq_scaled_cos,
+ `I4ThetaBridge.thetaSum_zero_eq,
+ `I4ThetaBridge.sourceSpectralKernel_eq_periodicCovariance,
+ `I4LifetimeField.coordinates,
+ `I4LifetimeField.actualField,
+ `I4LifetimeField.actualField_integral_zero,
+ `I4LifetimeField.actualField_covariance,
+ `I4LifetimeField.actualField_raw_second_moment,
+ `I4LifetimeField.actualField_linearCombination_variance,
+ `I4LifetimeField.actualField_linearCombination_map,
+ `I4LifetimeField.actualGaussianFieldInterface,
+ `I4LifetimeField.actualGaussianFieldInterface_exists,
+ `I4LifetimeControls.literalCarrier,
+ `I4LifetimeControls.literalLaw,
+ `I4LifetimeControls.literalField,
+ `I4LifetimeControls.dimensionZeroRawVariance,
+ `I4LifetimeControls.emptyFamilyLaw,
+ `I4LifetimeControls.cancelledLaw,
+ `I4LifetimeControls.reinforcedLaw,
+ `I4LifetimeControls.shiftedMeanOne]
+ for name in required do
+ unless allNames.contains name do
+ throwError "required source-law declaration omitted from audit: {name}"
+ logInfo m!"LIFETIME_AUDIT_STANDARD_ONLY_PASS COUNT {allNames.size}"
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeControls.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeControls.lean
new file mode 100644
index 000000000..de65503cd
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeControls.lean
@@ -0,0 +1,124 @@
+import SourceLifetimeField
+
+/-! Source-bound endpoint and degenerate-family controls. These declarations are
+supporting checks; the constructor theorem itself has unrestricted d,m and L>0.
+-/
+
+noncomputable section
+open MeasureTheory ProbabilityTheory
+open UniversalLaw.Spec.Lifetime I4SmoothCarrier I4LifetimeField
+open scoped BigOperators NNReal ENNReal
+
+namespace I4LifetimeControls
+
+def unrestrictedEndpoint (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ GaussianFieldInterface d L := actualGaussianFieldInterface d L hL
+
+theorem literalCarrier (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ (actualGaussianFieldInterface d L hL).Ω = SmoothSample d L := rfl
+
+theorem literalLaw (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ (actualGaussianFieldInterface d L hL).P = smoothLaw d L := rfl
+
+theorem literalField (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (ω : SmoothSample d L) (x : E d) :
+ (actualGaussianFieldInterface d L hL).F ω x =
+ smoothSourceField d L ω (EuclideanSpace.equiv (Fin d) ℝ x) := rfl
+
+theorem sameCarrierOrders (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (ω : SmoothSample d L) :
+ ContDiff ℝ 5 ((actualGaussianFieldInterface d L hL).F ω) ∧
+ ContDiff ℝ 37 ((actualGaussianFieldInterface d L hL).F ω) :=
+ ⟨(actualGaussianFieldInterface d L hL).smooth ω 5,
+ (actualGaussianFieldInterface d L hL).smooth ω 37⟩
+
+theorem wholeCoefficientLaw (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ (actualGaussianFieldInterface d L hL).P.map (sampleInclusion d L) =
+ I4Source.sourceLaw d := sampleInclusion_map d hL.ne'
+
+theorem periodicCovariance_zero (d : ℕ) {L : ℝ} (hL : 0 < L) :
+ periodicCovariance d L 0 = 1 := by
+ exact div_self (ne_of_gt (I4ThetaBridge.theta_zero_pos d hL))
+
+theorem rawDiagonalOne (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :
+ ∫ ω, actualField d L ω x * actualField d L ω x ∂smoothLaw d L = 1 := by
+ rw [actualField_raw_second_moment d hL, sub_self, periodicCovariance_zero d hL]
+
+theorem zeroMean (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :
+ ∫ ω, actualField d L ω x ∂smoothLaw d L = 0 :=
+ actualField_integral_zero d hL x
+
+theorem dimensionZeroTheta (L : ℝ) : thetaSum 0 L 0 = 1 := by
+ simp [thetaSum, latticeVec]
+
+theorem dimensionZeroSpectralNormalizer (L : ℝ) : I4Weights.sourceZ 0 L = 1 := by
+ simp [I4Weights.sourceZ, I4Weights.sourceWeight, I4Weights.productDecay]
+
+theorem dimensionZeroRawVariance (L : ℝ) (hL : 0 < L) :
+ ∫ ω, actualField 0 L ω 0 * actualField 0 L ω 0 ∂smoothLaw 0 L = 1 :=
+ rawDiagonalOne 0 hL 0
+
+theorem emptyQuad (d : ℕ) (L : ℝ) (x : Fin 0 → E d) (a : Fin 0 → ℝ) :
+ covQuadForm d L x a = 0 := by simp [covQuadForm]
+
+theorem emptyFamilyLaw (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (x : Fin 0 → E d) (a : Fin 0 → ℝ) :
+ (smoothLaw d L).map (fun ω => ∑ i, a i * actualField d L ω (x i)) =
+ Measure.dirac 0 := by
+ have hv : (⟨covQuadForm d L x a, covQuadForm_nonneg d hL x a⟩ : ℝ≥0) = 0 := by
+ apply Subtype.ext
+ exact emptyQuad d L x a
+ exact (actualField_linearCombination_map d hL x a).trans
+ ((congrArg (gaussianReal 0) hv).trans (gaussianReal_zero_var 0))
+
+theorem cancelledQuad (d : ℕ) {L : ℝ} (_hL : 0 < L) (x : E d) :
+ covQuadForm d L ![x, x] ![1, -1] = 0 := by
+ simp [covQuadForm, Fin.sum_univ_two]
+
+theorem cancelledSample (d : ℕ) (L : ℝ) (x : E d) (ω : SmoothSample d L) :
+ (∑ i : Fin 2, (![1, -1] : Fin 2 → ℝ) i *
+ actualField d L ω ((![x, x] : Fin 2 → E d) i)) = 0 := by
+ simp [Fin.sum_univ_two]
+
+theorem cancelledLaw (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :
+ (smoothLaw d L).map (fun ω => ∑ i : Fin 2,
+ (![1, -1] : Fin 2 → ℝ) i * actualField d L ω ((![x, x] : Fin 2 → E d) i)) =
+ Measure.dirac 0 := by
+ have hv : (⟨covQuadForm d L ![x, x] ![1, -1],
+ covQuadForm_nonneg d hL ![x, x] ![1, -1]⟩ : ℝ≥0) = 0 := by
+ apply Subtype.ext
+ exact cancelledQuad d hL x
+ exact (actualField_linearCombination_map d hL ![x, x] ![1, -1]).trans
+ ((congrArg (gaussianReal 0) hv).trans (gaussianReal_zero_var 0))
+
+theorem reinforcedQuad (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :
+ covQuadForm d L ![x, x] ![1, 1] = 4 := by
+ norm_num [covQuadForm, Fin.sum_univ_two, periodicCovariance_zero d hL]
+
+theorem reinforcedLaw (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :
+ (smoothLaw d L).map (fun ω => ∑ i : Fin 2,
+ (![1, 1] : Fin 2 → ℝ) i * actualField d L ω ((![x, x] : Fin 2 → E d) i)) =
+ gaussianReal 0 4 := by
+ convert actualField_linearCombination_map d hL ![x, x] ![1, 1] using 1
+ congr 1
+ apply Subtype.ext
+ exact (reinforcedQuad d hL x).symm
+
+theorem everyLatticeTranslation (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (ω : SmoothSample d L) (x : E d) (n : Fin d → ℤ) :
+ actualField d L ω (x + latticeVec d L n) = actualField d L ω x :=
+ (actualGaussianFieldInterface d L hL).periodic ω x n
+
+theorem euclideanNormSquared :
+ ‖(WithLp.toLp 2 (![1, 1] : Fin 2 → ℝ) : E 2)‖ ^ 2 = 2 := by
+ norm_num [EuclideanSpace.real_norm_sq_eq, Fin.sum_univ_two]
+
+/-- Adding one leaves centered covariance unchanged, but violates the required mean. -/
+theorem shiftedMeanOne (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :
+ ∫ ω, (actualField d L ω x + 1) ∂smoothLaw d L = 1 := by
+ let := smoothLaw_isProbabilityMeasure d hL.ne'
+ rw [integral_add (actualField_eval_hasGaussianLaw d hL x).integrable
+ (integrable_const 1), actualField_integral_zero d hL]
+ simp
+
+end I4LifetimeControls
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeField.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeField.lean
new file mode 100644
index 000000000..a07036a15
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeField.lean
@@ -0,0 +1,92 @@
+import SourceLifetimeGeometry
+import SourceThetaBridge
+
+/-! The actual smooth source fills the unchanged Lifetime Gaussian field interface.
+The only final parameter hypothesis is `0 < L`; theta, Gaussian, covariance and
+smoothness properties are proved from the frozen literal source.
+-/
+
+noncomputable section
+open MeasureTheory ProbabilityTheory
+open UniversalLaw.Spec.Lifetime I4SmoothCarrier I4ThetaBridge
+open scoped BigOperators ENNReal NNReal
+
+namespace I4LifetimeField
+
+theorem actualField_covariance (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (x y : E d) :
+ cov[fun ω => actualField d L ω x, fun ω => actualField d L ω y; smoothLaw d L] =
+ periodicCovariance d L (x - y) := by
+ rw [actualField_covariance_spectral d hL]
+ exact sourceSpectralKernel_eq_periodicCovariance d hL (x - y)
+
+theorem actualField_raw_second_moment (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (x y : E d) :
+ ∫ ω, actualField d L ω x * actualField d L ω y ∂smoothLaw d L =
+ periodicCovariance d L (x - y) := by
+ simpa only [ProbabilityTheory.covariance, actualField_integral_zero d hL, sub_zero]
+ using actualField_covariance d hL x y
+
+theorem actualField_linearCombination_variance (d : ℕ) {L : ℝ} (hL : 0 < L)
+ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :
+ Var[fun ω => ∑ i, a i * actualField d L ω (x i); smoothLaw d L] =
+ covQuadForm d L x a := by
+ let : IsProbabilityMeasure (smoothLaw d L) := smoothLaw_isProbabilityMeasure d hL.ne'
+ rw [variance_fun_sum (fun i =>
+ (actualField_eval_hasGaussianLaw d hL (x i)).memLp_two.const_mul (a i))]
+ simp only [covariance_const_mul_left, covariance_const_mul_right,
+ actualField_covariance d hL, covQuadForm]
+ apply Finset.sum_congr rfl
+ intro i _
+ apply Finset.sum_congr rfl
+ intro j _
+ ring
+
+theorem covQuadForm_nonneg (d : ℕ) {L : ℝ} (hL : 0 < L)
+ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :
+ 0 ≤ covQuadForm d L x a := by
+ rw [← actualField_linearCombination_variance d hL x a]
+ exact variance_nonneg _ _
+
+theorem actualField_linearCombination_map (d : ℕ) {L : ℝ} (hL : 0 < L)
+ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :
+ (smoothLaw d L).map (fun ω => ∑ i, a i * actualField d L ω (x i)) =
+ gaussianReal 0 ⟨covQuadForm d L x a, covQuadForm_nonneg d hL x a⟩ := by
+ rw [(actualField_linearCombination_hasGaussianLaw d hL x a).map_eq_gaussianReal,
+ actualField_linearCombination_integral_zero d hL,
+ actualField_linearCombination_variance d hL]
+ congr 1
+ apply Subtype.ext
+ exact Real.coe_toNNReal _ (covQuadForm_nonneg d hL x a)
+
+/-- The original target on the unchanged coefficient carrier and preserved source law. -/
+def actualGaussianFieldInterface (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ GaussianFieldInterface d L where
+ Ω := SmoothSample d L
+ mΩ := inferInstance
+ P := smoothLaw d L
+ isProb := smoothLaw_isProbabilityMeasure d hL.ne'
+ F := actualField d L
+ smooth := actualField_smooth d hL
+ periodic := actualField_periodic d hL
+ summable := theta_summable d hL
+ quad_nonneg := covQuadForm_nonneg d hL
+ gaussian := actualField_linearCombination_map d hL
+ covariance := actualField_raw_second_moment d hL
+
+theorem actualGaussianFieldInterface_exists (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ Nonempty (GaussianFieldInterface d L) :=
+ ⟨actualGaussianFieldInterface d L hL⟩
+
+@[simp] theorem actualGaussianFieldInterface_carrier (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ (actualGaussianFieldInterface d L hL).Ω = SmoothSample d L := rfl
+
+@[simp] theorem actualGaussianFieldInterface_law (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ (actualGaussianFieldInterface d L hL).P = smoothLaw d L := rfl
+
+@[simp] theorem actualGaussianFieldInterface_field (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (ω : SmoothSample d L) (x : E d) :
+ (actualGaussianFieldInterface d L hL).F ω x =
+ smoothSourceField d L ω (coordinates d x) := rfl
+
+end I4LifetimeField
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeGeometry.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeGeometry.lean
new file mode 100644
index 000000000..e83eb8e13
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeGeometry.lean
@@ -0,0 +1,98 @@
+import Lifetime
+import SourceSmoothCarrier
+
+/-! Coordinate and probability transport for the literal smooth Fourier source.
+No theta identity or target field-law premise is introduced in this module.
+-/
+
+noncomputable section
+open MeasureTheory ProbabilityTheory
+open UniversalLaw.Spec.Lifetime I4SmoothCarrier
+open scoped BigOperators ENNReal NNReal
+
+namespace I4LifetimeField
+
+def coordinates (d : ℕ) : E d ≃L[ℝ] (Fin d → ℝ) :=
+ EuclideanSpace.equiv (Fin d) ℝ
+
+@[simp] theorem coordinates_apply (d : ℕ) (x : E d) (i : Fin d) :
+ coordinates d x i = x i := rfl
+
+theorem coordinates_latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) :
+ coordinates d (latticeVec d L n) = fun i => L * (n i : ℝ) := by
+ ext i
+ simp [coordinates, latticeVec]
+
+/-- The same carrier, same law, and same literal source; only spatial coordinates change. -/
+def actualField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : E d) : ℝ :=
+ smoothSourceField d L ω (coordinates d x)
+
+theorem actualField_smooth (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (ω : SmoothSample d L) : IsSmooth d (actualField d L ω) := by
+ intro n
+ exact (smoothSourceField_contDiff d hL.ne' ω n).comp
+ (coordinates d).contDiff
+
+theorem actualField_periodic (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (ω : SmoothSample d L) : IsLPeriodic d L (actualField d L ω) := by
+ intro x n
+ unfold actualField smoothSourceField
+ rw [map_add, coordinates_latticeVec]
+ exact I4Lattice.sourceField_lattice_shift d hL.ne' (sampleInclusion d L ω) n
+ (coordinates d x)
+
+theorem actualField_eval_measurable (d : ℕ) (L : ℝ) (x : E d) :
+ Measurable (fun ω => actualField d L ω x) :=
+ (I4Source.sourceField_eval_measurable d L (coordinates d x)).comp
+ (sampleInclusion_measurable d L)
+
+theorem actualField_eval_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (x : E d) : HasGaussianLaw (fun ω => actualField d L ω x) (smoothLaw d L) := by
+ exact (smoothSourceField_finiteVector_hasGaussianLaw d hL.ne' 1
+ (fun _ => coordinates d x)).eval 0
+
+theorem actualField_linearCombination_measurable (d : ℕ) (L : ℝ) {m : ℕ}
+ (x : Fin m → E d) (a : Fin m → ℝ) :
+ Measurable (fun ω => ∑ i, a i * actualField d L ω (x i)) := by
+ exact Finset.measurable_sum _ (fun i _ =>
+ measurable_const.mul (actualField_eval_measurable d L (x i)))
+
+theorem actualField_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ}
+ (hL : 0 < L) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :
+ HasGaussianLaw (fun ω => ∑ i, a i * actualField d L ω (x i)) (smoothLaw d L) := by
+ have hX : Measurable (fun η : I4Source.SourceMode d → ℝ =>
+ ∑ i, a i * I4Source.sourceField d L η (coordinates d (x i))) :=
+ Finset.measurable_sum _ (fun i _ => measurable_const.mul
+ (I4Source.sourceField_eval_measurable d L (coordinates d (x i))))
+ refine ⟨(actualField_linearCombination_measurable d L x a).aemeasurable, ?_⟩
+ change IsGaussian ((smoothLaw d L).map (fun ω =>
+ ∑ i, a i * I4Source.sourceField d L (sampleInclusion d L ω) (coordinates d (x i))))
+ rw [observation_map_eq d hL.ne' _ hX]
+ exact (I4SourceGaussian.source_linearCombination_hasGaussianLaw d hL.ne' m
+ (fun i => coordinates d (x i)) a).isGaussian_map
+
+theorem actualField_integral_zero (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :
+ ∫ ω, actualField d L ω x ∂smoothLaw d L = 0 := by
+ change (∫ ω, I4Source.sourceField d L (sampleInclusion d L ω) (coordinates d x)
+ ∂smoothLaw d L) = 0
+ rw [(sampleInclusion_measurePreserving d hL.ne').integral_comp
+ (MeasurableEmbedding.subtype_coe (goodSet_measurable d L))
+ (fun η => I4Source.sourceField d L η (coordinates d x))]
+ exact I4SourceCovariance.sourceField_integral_zero d hL.ne' (coordinates d x)
+
+theorem actualField_linearCombination_integral_zero (d : ℕ) {L : ℝ}
+ (hL : 0 < L) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :
+ ∫ ω, (∑ i, a i * actualField d L ω (x i)) ∂smoothLaw d L = 0 := by
+ rw [integral_finsetSum _ (fun i _ =>
+ (actualField_eval_hasGaussianLaw d hL (x i)).integrable.const_mul (a i))]
+ simp only [integral_const_mul, actualField_integral_zero d hL, mul_zero,
+ Finset.sum_const_zero]
+
+theorem actualField_covariance_spectral (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (x y : E d) :
+ cov[fun ω => actualField d L ω x, fun ω => actualField d L ω y; smoothLaw d L] =
+ I4Kernel.sourceSpectralKernel d L (coordinates d (x - y)) := by
+ simpa only [actualField, map_sub] using
+ smoothSourceField_covariance d hL.ne' (coordinates d x) (coordinates d y)
+
+end I4LifetimeField
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceThetaBridge.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceThetaBridge.lean
new file mode 100644
index 000000000..06d14bc95
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceThetaBridge.lean
@@ -0,0 +1,266 @@
+import Lifetime
+import SourceKernel
+import Mathlib.Analysis.SpecialFunctions.Gaussian.PoissonSummation
+
+/-! Exact all-dimensional image/spectral bridge for the unchanged Lifetime target.
+No probabilistic interface or theta identity is assumed. -/
+
+noncomputable section
+open scoped BigOperators
+open I4Weights I4Source
+
+namespace I4ThetaBridge
+
+open UniversalLaw.Spec.Lifetime
+
+theorem latticeVec_apply (d : ℕ) (L : ℝ) (n : Fin d → ℤ) (j : Fin d) :
+ latticeVec d L n j = L * (n j : ℝ) := by
+ change (EuclideanSpace.projₗ j) (∑ i, EuclideanSpace.single i (L * (n i : ℝ))) = _
+ rw [map_sum]
+ simp
+
+theorem theta_summand_eq_product (d : ℕ) (L : ℝ) (z : E d) (n : Fin d → ℤ) :
+ Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2) =
+ ∏ j, Real.exp (-((z j + L * (n j : ℝ)) ^ 2) / 2) := by
+ rw [EuclideanSpace.real_norm_sq_eq, ← Real.exp_sum]
+ congr 1
+ simp only [PiLp.add_apply, latticeVec_apply]
+ rw [← Finset.sum_neg_distrib, Finset.sum_div]
+
+theorem shifted_gaussian_le (L t : ℝ) (n : ℤ) :
+ Real.exp (-((t + L * (n : ℝ)) ^ 2) / 2) ≤
+ Real.exp (t ^ 2 / 2) * decay (L ^ 2 / 4) n := by
+ unfold decay
+ rw [← Real.exp_add, Real.exp_le_exp]
+ nlinarith [sq_nonneg (t + L * (n : ℝ) / 2)]
+
+theorem shifted_gaussian_summable {L : ℝ} (hL : 0 < L) (t : ℝ) :
+ Summable (fun n : ℤ => Real.exp (-((t + L * (n : ℝ)) ^ 2) / 2)) := by
+ have hd : Summable (decay (L ^ 2 / 4)) := by
+ simpa using summable_decay_pow (show 0 < L ^ 2 / 4 by positivity) 0
+ apply Summable.of_norm_bounded (hd.mul_left (Real.exp (t ^ 2 / 2)))
+ intro n
+ rw [Real.norm_eq_abs, abs_of_pos (Real.exp_pos _)]
+ exact shifted_gaussian_le L t n
+
+theorem theta_summable (d : ℕ) {L : ℝ} (hL : 0 < L) (z : E d) :
+ Summable (fun n : Fin d → ℤ =>
+ Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2)) := by
+ have hd : Summable (decay (L ^ 2 / 4)) := by
+ simpa using summable_decay_pow (show 0 < L ^ 2 / 4 by positivity) 0
+ have hp := finite_product_summable hd (fun n => (Real.exp_pos _).le) d
+ apply Summable.of_norm_bounded
+ (hp.mul_left (Real.exp (∑ j : Fin d, (z j) ^ 2 / 2)))
+ intro n
+ rw [Real.norm_eq_abs, abs_of_pos (Real.exp_pos _), theta_summand_eq_product]
+ calc
+ _ ≤ ∏ j : Fin d, (Real.exp ((z j) ^ 2 / 2) * decay (L ^ 2 / 4) (n j)) :=
+ Finset.prod_le_prod₀ (fun j _ => (Real.exp_pos _).le)
+ (fun j _ => shifted_gaussian_le L (z j) (n j))
+ _ = _ := by rw [Finset.prod_mul_distrib, ← Real.exp_sum]
+
+theorem theta_zero_pos (d : ℕ) {L : ℝ} (hL : 0 < L) :
+ 0 < thetaSum d L 0 := by
+ apply (theta_summable d hL 0).tsum_pos (fun _ => (Real.exp_pos _).le) (fun _ => 0)
+ exact Real.exp_pos _
+
+private theorem summable_nonneg_fin_product
+ (d : ℕ) (f : Fin d → ℤ → ℝ)
+ (hf : ∀ j, Summable (f j)) (hn : ∀ j n, 0 ≤ f j n) :
+ Summable (fun k : Fin d → ℤ => ∏ j, f j (k j)) := by
+ classical
+ induction d with
+ | zero => exact (hasSum_fintype _).summable
+ | succ d ih =>
+ have ht : Summable (fun k : Fin d → ℤ => ∏ j : Fin d, f j.succ (k j)) :=
+ ih (fun j => f j.succ) (fun j => hf j.succ) (fun j => hn j.succ)
+ have hp : Summable (fun p : ℤ × (Fin d → ℤ) =>
+ f 0 p.1 * ∏ j : Fin d, f j.succ (p.2 j)) :=
+ Summable.mul_of_nonneg (ι := ℤ) (ι' := Fin d → ℤ) (f := f 0)
+ (g := fun k : Fin d → ℤ => ∏ j : Fin d, f j.succ (k j)) (hf 0) ht (hn 0)
+ (fun k => Finset.prod_nonneg (fun j _ => hn j.succ (k j)))
+ have heq :
+ ((fun k : Fin (d + 1) → ℤ => ∏ j, f j (k j)) ∘
+ (Fin.consEquiv (fun _ : Fin (d + 1) => ℤ))) =
+ (fun p : ℤ × (Fin d → ℤ) => f 0 p.1 * ∏ j : Fin d, f j.succ (p.2 j)) := by
+ funext p
+ simp only [Function.comp_apply, Fin.consEquiv_apply, Fin.prod_univ_succ,
+ Fin.cons_zero, Fin.cons_succ]
+ apply (Fin.consEquiv (fun _ : Fin (d + 1) => ℤ)).summable_iff.mp
+ rw [heq]
+ exact hp
+
+private theorem summable_norm_fin_product
+ (d : ℕ) (f : Fin d → ℤ → ℂ)
+ (hf : ∀ j, Summable (fun n : ℤ => ‖f j n‖)) :
+ Summable (fun k : Fin d → ℤ => ‖∏ j, f j (k j)‖) := by
+ simpa only [norm_prod] using summable_nonneg_fin_product d
+ (fun j n => ‖f j n‖) hf (fun _ _ => norm_nonneg _)
+
+private theorem tsum_fin_product
+ (d : ℕ) (f : Fin d → ℤ → ℂ)
+ (hf : ∀ j, Summable (fun n : ℤ => ‖f j n‖)) :
+ (∑' k : Fin d → ℤ, ∏ j, f j (k j)) = ∏ j, ∑' n : ℤ, f j n := by
+ classical
+ induction d with
+ | zero => simp
+ | succ d ih =>
+ rw [← (Fin.consEquiv (fun _ : Fin (d + 1) => ℤ)).tsum_eq]
+ simp only [Fin.consEquiv_apply, Fin.prod_univ_succ, Fin.cons_zero, Fin.cons_succ]
+ rw [← tsum_mul_tsum_of_summable_norm (hf 0)
+ (summable_norm_fin_product d (fun j => f j.succ) (fun j => hf j.succ))]
+ rw [ih (fun j => f j.succ) (fun j => hf j.succ)]
+
+private def poissonScale (L : ℝ) : ℝ :=
+ 1 / (L ^ 2 / (2 * Real.pi)) ^ (1 / 2 : ℝ)
+
+private theorem poissonScale_eq {L : ℝ} (hL : 0 < L) :
+ poissonScale L = Real.sqrt (2 * Real.pi) / L := by
+ unfold poissonScale
+ rw [← Real.sqrt_eq_rpow, Real.sqrt_div (sq_nonneg L),
+ Real.sqrt_sq_eq_abs, abs_of_pos hL]
+ field_simp
+
+private def spectral1Term (L t : ℝ) (k : ℤ) : ℂ :=
+ (decay (2 * sourceA L) k : ℂ) *
+ Complex.exp (((sourceC L * (k : ℝ) * t : ℝ) : ℂ) * Complex.I)
+
+private theorem spectral1Term_norm (L t : ℝ) (k : ℤ) :
+ ‖spectral1Term L t k‖ = decay (2 * sourceA L) k := by
+ have hp : 0 < decay (2 * sourceA L) k := Real.exp_pos _
+ rw [spectral1Term, norm_mul, Complex.norm_exp_ofReal_mul_I,
+ Complex.norm_real, Real.norm_eq_abs, abs_of_pos hp, mul_one]
+
+private theorem spectral1Term_summable_norm {L : ℝ} (hL : 0 < L) (t : ℝ) :
+ Summable (fun k => ‖spectral1Term L t k‖) := by
+ simp_rw [spectral1Term_norm]
+ simpa using summable_decay_pow
+ (show 0 < 2 * sourceA L from mul_pos (by norm_num) (sourceA_pos hL.ne')) 0
+
+private theorem poisson_one_dimension {L : ℝ} (hL : 0 < L) (t : ℝ) :
+ ((∑' n : ℤ, Real.exp (-((t + L * (n : ℝ)) ^ 2) / 2) : ℝ) : ℂ) =
+ (poissonScale L : ℂ) * ∑' k : ℤ, spectral1Term L t k := by
+ have ha0 : 0 < L ^ 2 / (2 * Real.pi) := by positivity
+ set a : ℂ := ((L ^ 2 / (2 * Real.pi) : ℝ) : ℂ) with ha_def
+ set b : ℂ := ((-(t * L / (2 * Real.pi)) : ℝ) : ℂ) with hb_def
+ have ha : 0 < a.re := by rw [ha_def, Complex.ofReal_re]; exact ha0
+ have h := Complex.tsum_exp_neg_quadratic ha b
+ have hlterm (n : ℤ) :
+ Complex.exp (-((Real.pi : ℝ) : ℂ) * a * (n : ℂ) ^ 2 +
+ 2 * ((Real.pi : ℝ) : ℂ) * b * (n : ℂ)) =
+ ((Real.exp (t ^ 2 / 2) * Real.exp (-((t + L * (n : ℝ)) ^ 2) / 2) : ℝ) : ℂ) := by
+ rw [Complex.ofReal_mul, Complex.ofReal_exp, Complex.ofReal_exp, ← Complex.exp_add]
+ congr 1
+ rw [ha_def, hb_def]
+ push_cast
+ field_simp
+ ring
+ have hrterm (n : ℤ) :
+ Complex.exp (-((Real.pi : ℝ) : ℂ) / a * ((n : ℂ) + Complex.I * b) ^ 2) =
+ ((Real.exp (t ^ 2 / 2) : ℝ) : ℂ) * spectral1Term L t n := by
+ unfold spectral1Term decay sourceA sourceC
+ rw [Complex.ofReal_exp, Complex.ofReal_exp, ← Complex.exp_add, ← Complex.exp_add]
+ congr 1
+ have hLc : (L : ℂ) ≠ 0 := Complex.ofReal_ne_zero.mpr hL.ne'
+ have hπc : ((Real.pi : ℝ) : ℂ) ≠ 0 := Complex.ofReal_ne_zero.mpr Real.pi_ne_zero
+ rw [ha_def, hb_def]
+ push_cast
+ field_simp
+ linear_combination (-(L : ℂ) ^ 2 * (t : ℂ) ^ 2) * Complex.I_sq
+ have hcp : (1 : ℂ) / a ^ (1 / 2 : ℂ) = (poissonScale L : ℂ) := by
+ unfold poissonScale
+ rw [Complex.ofReal_div, Complex.ofReal_one, Complex.ofReal_cpow ha0.le, ha_def]
+ push_cast
+ rfl
+ have hl : (∑' n : ℤ, Complex.exp (-((Real.pi : ℝ) : ℂ) * a * (n : ℂ) ^ 2 +
+ 2 * ((Real.pi : ℝ) : ℂ) * b * (n : ℂ))) =
+ ((Real.exp (t ^ 2 / 2) : ℝ) : ℂ) *
+ ((∑' n : ℤ, Real.exp (-((t + L * (n : ℝ)) ^ 2) / 2) : ℝ) : ℂ) := by
+ rw [tsum_congr hlterm, ← Complex.ofReal_tsum, tsum_mul_left, Complex.ofReal_mul]
+ have hr : (∑' n : ℤ,
+ Complex.exp (-((Real.pi : ℝ) : ℂ) / a * ((n : ℂ) + Complex.I * b) ^ 2)) =
+ ((Real.exp (t ^ 2 / 2) : ℝ) : ℂ) * ∑' n : ℤ, spectral1Term L t n := by
+ rw [tsum_congr hrterm, tsum_mul_left]
+ rw [hl, hr, hcp] at h
+ have hE : ((Real.exp (t ^ 2 / 2) : ℝ) : ℂ) ≠ 0 :=
+ Complex.ofReal_ne_zero.mpr (Real.exp_pos _).ne'
+ apply mul_left_cancel₀ hE
+ calc
+ _ = _ := h
+ _ = _ := by ring
+
+private theorem spectral1Term_prod (d : ℕ) (L : ℝ) (x : Fin d → ℝ)
+ (k : Fin d → ℤ) :
+ (∏ j, spectral1Term L (x j) (k j)) =
+ (sourceWeight d L k : ℂ) * Complex.exp ((phase d L k x : ℂ) * Complex.I) := by
+ unfold spectral1Term sourceWeight productDecay
+ rw [Finset.prod_mul_distrib, ← Complex.ofReal_prod, ← Complex.exp_sum]
+ congr 1
+ congr 1
+ rw [← Finset.sum_mul]
+ simp [phase]
+
+private theorem complex_spectral_summable (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (x : Fin d → ℝ) :
+ Summable (fun k : Fin d → ℤ => (sourceWeight d L k : ℂ) *
+ Complex.exp ((phase d L k x : ℂ) * Complex.I)) := by
+ apply Summable.of_norm_bounded (sourceWeight_summable d hL.ne')
+ intro k
+ have hp : 0 < sourceWeight d L k := by
+ rw [sourceWeight_eq_physical]
+ exact Real.exp_pos _
+ rw [norm_mul, Complex.norm_real, Real.norm_eq_abs, abs_of_pos hp,
+ Complex.norm_exp_ofReal_mul_I, mul_one]
+
+private theorem thetaSum_complex (d : ℕ) {L : ℝ} (hL : 0 < L) (z : E d) :
+ (thetaSum d L z : ℂ) = (poissonScale L : ℂ) ^ d *
+ ∑' k : Fin d → ℤ, (sourceWeight d L k : ℂ) *
+ Complex.exp ((phase d L k (fun i => z i) : ℂ) * Complex.I) := by
+ have hn (j : Fin d) :
+ Summable (fun n : ℤ => ‖(Real.exp (-((z j + L * (n : ℝ)) ^ 2) / 2) : ℂ)‖) := by
+ simpa only [Complex.norm_real, Real.norm_eq_abs, abs_of_pos (Real.exp_pos _)]
+ using shifted_gaussian_summable hL (z j)
+ have ht : (thetaSum d L z : ℂ) = ∑' n : Fin d → ℤ,
+ ∏ j, (Real.exp (-((z j + L * (n j : ℝ)) ^ 2) / 2) : ℂ) := by
+ rw [thetaSum, Complex.ofReal_tsum]
+ apply tsum_congr
+ intro n
+ rw [theta_summand_eq_product, Complex.ofReal_prod]
+ rw [ht, tsum_fin_product d _ hn]
+ simp_rw [← Complex.ofReal_tsum, poisson_one_dimension hL]
+ rw [Finset.prod_mul_distrib, Finset.prod_const, Finset.card_univ, Fintype.card_fin]
+ congr 1
+ rw [← tsum_fin_product d (fun j => spectral1Term L (z j))
+ (fun j => spectral1Term_summable_norm hL (z j))]
+ apply tsum_congr
+ intro k
+ exact spectral1Term_prod d L (fun i => z i) k
+
+theorem thetaSum_eq_scaled_cos (d : ℕ) {L : ℝ} (hL : 0 < L) (z : E d) :
+ thetaSum d L z = (Real.sqrt (2 * Real.pi) / L) ^ d *
+ ∑' k : Fin d → ℤ, sourceWeight d L k *
+ Real.cos (phase d L k (fun i => z i)) := by
+ have h := congrArg Complex.re (thetaSum_complex d hL z)
+ rw [Complex.ofReal_re, ← Complex.ofReal_pow, Complex.re_ofReal_mul,
+ Complex.re_tsum (complex_spectral_summable d hL (fun i => z i))] at h
+ simp only [Complex.re_ofReal_mul, Complex.exp_ofReal_mul_I_re] at h
+ rw [poissonScale_eq hL] at h
+ exact h
+
+theorem thetaSum_zero_eq (d : ℕ) {L : ℝ} (hL : 0 < L) :
+ thetaSum d L 0 = (Real.sqrt (2 * Real.pi) / L) ^ d * sourceZ d L := by
+ simpa [phase, sourceZ] using thetaSum_eq_scaled_cos d hL (0 : E d)
+
+theorem sourceSpectralKernel_eq_periodicCovariance
+ (d : ℕ) {L : ℝ} (hL : 0 < L) (z : E d) :
+ I4Kernel.sourceSpectralKernel d L (fun i => z i) = periodicCovariance d L z := by
+ have hA : (Real.sqrt (2 * Real.pi) / L) ^ d ≠ 0 := by positivity
+ rw [periodicCovariance, thetaSum_eq_scaled_cos d hL z, thetaSum_zero_eq d hL]
+ rw [mul_div_mul_left _ _ hA]
+ unfold I4Kernel.sourceSpectralKernel
+ rw [← tsum_div_const]
+ apply tsum_congr
+ intro k
+ ring
+
+end I4ThetaBridge
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/GaussianSeriesFoundation.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/GaussianSeriesFoundation.lean
new file mode 100644
index 000000000..93651da7f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/GaussianSeriesFoundation.lean
@@ -0,0 +1,96 @@
+import Mathlib.Probability.Distributions.Gaussian.Real
+import Mathlib.Probability.Independence.InfinitePi
+import Mathlib.MeasureTheory.Function.LpSpace.InfiniteSum
+import Mathlib.MeasureTheory.Function.LpSeminorm.SMul
+
+/-! The actual product law and the almost-sure absolute-series foundation.
+This does not assert a Fourier covariance, sample smoothness or finite-jet rank. -/
+
+noncomputable section
+
+open MeasureTheory ProbabilityTheory
+open scoped ENNReal
+
+namespace I4Foundation
+
+/-- The same actual probability measure used for every coefficient and series assertion. -/
+def coefficientLaw (ι : Type*) : Measure (ι → ℝ) :=
+ Measure.infinitePi (fun _ : ι => gaussianReal 0 1)
+
+instance coefficientLaw_isProbabilityMeasure (ι : Type*) :
+ IsProbabilityMeasure (coefficientLaw ι) := by
+ unfold coefficientLaw
+ infer_instance
+
+theorem coordinate_measurePreserving {ι : Type*} (i : ι) :
+ MeasurePreserving (fun ω : ι → ℝ => ω i) (coefficientLaw ι)
+ (gaussianReal 0 1) := by
+ exact measurePreserving_eval_infinitePi (fun _ : ι => gaussianReal 0 1) i
+
+theorem coordinate_marginal {ι : Type*} (i : ι) :
+ (coefficientLaw ι).map (fun ω => ω i) = gaussianReal 0 1 := by
+ exact (coordinate_measurePreserving i).map_eq
+
+theorem coordinates_independent (ι : Type*) :
+ iIndepFun (fun i (ω : ι → ℝ) => ω i) (coefficientLaw ι) := by
+ exact iIndepFun_infinitePi (P := fun _ : ι => gaussianReal 0 1)
+ (X := fun _ : ι => id) (fun _ => measurable_id)
+
+theorem coordinate_memLp {ι : Type*} (i : ι) (p : ℝ≥0∞) (hp : p ≠ ∞) :
+ MemLp (fun ω : ι → ℝ => ω i) p (coefficientLaw ι) := by
+ exact (memLp_id_gaussianReal' p hp).comp_measurePreserving
+ (coordinate_measurePreserving i)
+
+theorem coordinate_integrable {ι : Type*} (i : ι) :
+ Integrable (fun ω : ι → ℝ => ω i) (coefficientLaw ι) := by
+ exact memLp_one_iff_integrable.mp (coordinate_memLp i 1 (by simp))
+
+theorem coordinate_abs_integrable {ι : Type*} (i : ι) :
+ Integrable (fun ω : ι → ℝ => |ω i|) (coefficientLaw ι) := by
+ simpa only [Real.norm_eq_abs] using (coordinate_integrable i).norm
+
+theorem weighted_abs_summable_ae {ι : Type*} [Countable ι]
+ (a : ι → ℝ) (ha : ∀ i, 0 ≤ a i) (hs : Summable a) :
+ ∀ᵐ ω ∂coefficientLaw ι, Summable (fun i => a i * |ω i|) := by
+ let C := eLpNorm id 1 (gaussianReal 0 1)
+ have hC : C < ∞ := (memLp_id_gaussianReal' 1 (by simp)).eLpNorm_lt_top
+ have hcoord (i : ι) :
+ eLpNorm (fun ω : ι → ℝ => ω i) 1 (coefficientLaw ι) = C := by
+ exact eLpNorm_comp_measurePreserving
+ (memLp_id_gaussianReal' 1 (by simp)).aestronglyMeasurable
+ (coordinate_measurePreserving i)
+ have hnorm (i : ι) :
+ eLpNorm (fun ω : ι → ℝ => a i * ω i) 1 (coefficientLaw ι) =
+ ENNReal.ofReal (a i) * C := by
+ change eLpNorm (a i • (fun ω : ι → ℝ => ω i)) 1 (coefficientLaw ι) = _
+ rw [eLpNorm_const_smul, Real.enorm_eq_ofReal (ha i), hcoord]
+ have hsum : (∑' i, eLpNorm (fun ω : ι → ℝ => a i * ω i) 1
+ (coefficientLaw ι)) ≠ ∞ := by
+ simp_rw [hnorm]
+ rw [ENNReal.tsum_mul_right]
+ exact ENNReal.mul_ne_top hs.tsum_ofReal_ne_top hC.ne
+ have h := summable_norm_of_tsum_eLpNorm_ne_top (p := 1) (le_refl 1) hsum
+ filter_upwards [h] with ω hω
+ simpa only [Real.norm_eq_abs, abs_mul, abs_of_nonneg (ha _)] using hω
+
+/-- The actual scalar sum; its convergence is proved separately on the product law. -/
+def scalarSeries {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ) : ℝ :=
+ ∑' i, a i * ω i
+
+theorem scalarSeries_measurable {ι : Type*} [Countable ι] (a : ι → ℝ) :
+ Measurable (scalarSeries a) := by
+ unfold scalarSeries
+ apply Measurable.tsum
+ intro i
+ exact measurable_const.mul (measurable_pi_apply i)
+
+theorem scalarSeries_hasSum_ae {ι : Type*} [Countable ι]
+ (a : ι → ℝ) (hs : Summable a) :
+ ∀ᵐ ω ∂coefficientLaw ι, HasSum (fun i => a i * ω i) (scalarSeries a ω) := by
+ filter_upwards [weighted_abs_summable_ae (fun i => |a i|)
+ (fun i => abs_nonneg _) hs.abs] with ω hω
+ have hnorm : Summable (fun i => ‖a i * ω i‖) := by
+ simpa only [Real.norm_eq_abs, abs_mul] using hω
+ exact hnorm.of_norm.hasSum
+
+end I4Foundation
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/Lifetime.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/Lifetime.lean
new file mode 100644
index 000000000..f2508f7f2
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/Lifetime.lean
@@ -0,0 +1,634 @@
+import Mathlib
+
+/-!
+# Lifetime-track statements: parent Theorems A, B, C, the bounded remainder R and the
+# planar elder lower bound / density gap (statements only)
+
+Scientific effect: NONE. Formal progress of every declaration here: `specified`.
+Organizational-independence credit of this transcription: 0 (Anthropic / Claude).
+
+This module states, as `Prop`-valued definitions, the shapes of the parent lifetime
+results (1.1), (1.2), (1.3) of UNIFORM_MATRIX_CAP_AND_LIFETIME.md, of the bounded
+remainder (R1) of LIFETIME_REMAINDER.md, and of the planar lower bound (E2), the
+two-sided rate (E4) and the compact-window density gap (E11) of
+ELDER_LOWER_AND_DENSITY_GAP.md. Every statement is parametrised by interface objects
+(the Gaussian field, the superlevel-bar / elder-partner relation, and the typed pair law
+probability `p_r(b,k,R)`); it is a statement about whatever objects satisfy those
+interfaces, and the identification of those objects with the objects of the source texts
+is not part of the statement.
+
+This module is self-contained: it imports only Mathlib and re-declares, verbatim up to
+the namespace, the shared objects of `Specifications/Field.lean` (covariance, field
+interface, critical points, Hessian inertia, pairs, superlevel bars, density versions).
+The duplication is deliberate at this layer and is recorded as such.
+
+What this module does not establish. It consists only of definitions and structures;
+it states nothing as a result and proves nothing: none of the parent results, the
+remainder bound or the planar bounds is shown here, and no kernel receipt about them
+exists. It does not transcribe the explicit Gaussian/angular integral (15.2) for the
+leading coefficient `c_{d,L}` (the coefficient is characterised only through the
+leading-term asymptotics of (1.3)); it does not transcribe the regression law
+`Q_{r,b,k,R}`, the typed weight `W_r`, the full normalizer `Z_r` or the marked Kac-Rice
+representation (all informal in the source and taken as the interface field `p`); it
+does not transcribe the reading-rule amendments bound to the parent (congruence erratum,
+Section 9 replacement v1.1, wording W1, embedding radius `r < L/(4 sqrt 2)`), nor the
+marked-cylinder cap support; it asserts no numerical `C`, `r_*`, `z_*`, `ell_*` or
+coefficient value; it does not state Theorem A as consumed by Theorem R; and it does
+not state the compact-window `O(ell^(2/3))` difference for the unrestricted densities.
+The planar statements (E4) and (E11) carry the parent upper bound (1.1), for the same
+typed pair law at `d = 2`, as an explicit hypothesis, as the source does ("If the precise
+Theorem A upper bound in [LP] is consumed"; its Section 4 says the upper half of (E11)
+consumes the parent upper bound already identified there); the direct lower bound (E2) is
+unconditional, as in the source.
+Nothing here promotes, reclassifies or discharges any claim, premise or obligation of
+the registers; the landing disposition `REVIEWED_SCOPED` (lifetime-remainder) and the
+graph classification and review disposition recorded for
+`math.uniform-matrix-cap-lifetime` are transcribed from the registers by the statement
+register, never re-derived here; alignment of these statements with the sources is
+PENDING_INDEPENDENT_REVIEW.
+
+Sources (Layer 0, byte-pinned, `d6g8k5htny-coder/Math-`):
+* `lifetime-parent`: commit `c39164254ad1529ed49543743598d5dcb24bab98`, path
+ `imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md`,
+ sha256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`.
+* `lifetime-remainder`: commit `760340e921ac4ceda296b8118da936f1133e956e`, path
+ `frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md`,
+ sha256 `380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a`.
+* `elder-lower-density-gap`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md`,
+ sha256 `8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c`.
+-/
+
+namespace UniversalLaw.Spec.Lifetime
+
+open MeasureTheory
+
+/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same text, this
+namespace). The duplication is deliberate: modules of this packet import only Mathlib. -/
+
+/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised
+by `L`-periodic functions.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.
+Does not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/
+abbrev E (d : ℕ) : Type := EuclideanSpace ℝ (Fin d)
+
+/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: none.
+Does not claim: anything beyond the definition of the vector `L n`. -/
+noncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : E d :=
+ ∑ i, EuclideanSpace.single i (L * (n i : ℝ))
+
+/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,
+written as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;
+summability is a hypothesis field of `GaussianFieldInterface`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.
+Does not claim: convergence of the sum. -/
+noncomputable def thetaSum (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ ∑' n : Fin d → ℤ, Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2)
+
+/-- The periodized Gaussian covariance
+`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta
+sum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the
+summability field is meant to provide this; not shown here).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of both theta sums is the field `GaussianFieldInterface.summable`.
+Does not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/
+noncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ thetaSum d L z / thetaSum d L 0
+
+/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear
+combination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred
+stationary field with covariance `K_L`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.
+Does not claim: positive definiteness (Section 2 of the source). -/
+noncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) : ℝ :=
+ ∑ i, ∑ j, a i * a j * periodicCovariance d L (x i - x j)
+
+/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the defining predicate of a function on the torus.
+Does not claim: anything about the field. -/
+def IsLPeriodic (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ ∀ (x : E d) (n : Fin d → ℤ), g (x + latticeVec d L n) = g x
+
+/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "In particular the field has a smooth version and all finite moments of its global derivative suprema exist."
+Interface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.
+Does not claim: existence of a smooth version, or moment bounds on derivative suprema. -/
+def IsSmooth (d : ℕ) (g : E d → ℝ) : Prop :=
+ ∀ n : ℕ, ContDiff ℝ n g
+
+/-- Interface for the centred stationary Gaussian field of variance one on the torus
+`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample
+paths, their smoothness and periodicity, the Gaussian law of every finite real linear
+combination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic
+form) and the covariance identity are hypothesis fields, as is summability of the theta
+sums. Existence of such an object is not asserted.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: every field of this structure is a given property of the field, never derived.
+Does 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. -/
+structure GaussianFieldInterface (d : ℕ) (L : ℝ) where
+ /-- The underlying probability space (sample space). -/
+ Ω : Type
+ -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not
+ -- registered for typeclass resolution after this declaration; consumers bring it into
+ -- scope with `haveI := G.mΩ`.
+ [mΩ : MeasurableSpace Ω]
+ /-- The probability measure `P`. -/
+ P : Measure Ω
+ -- `P` is a probability measure (square-bracket field).
+ [isProb : IsProbabilityMeasure P]
+ /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/
+ F : Ω → E d → ℝ
+ /-- Section 2 clause: "the field has a smooth version"; every sample path is smooth. -/
+ smooth : ∀ ω, IsSmooth d (F ω)
+ /-- Section 1 clause: the field lives "On the flat torus X = R^d/(L Z^d)"; every sample path
+ is `L`-periodic. -/
+ periodic : ∀ ω, IsLPeriodic d L (F ω)
+ /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/
+ summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))
+ /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/
+ quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a
+ /-- Section 1 clause: "the centered stationary Gaussian field of variance one with covariance"
+ `K_L`; every finite real linear combination of point evaluations has the centred Gaussian
+ law whose variance is the `K_L`-quadratic form. -/
+ gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),
+ Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =
+ ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩
+ /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/
+ covariance : ∀ x y : E d, ∫ ω, F ω x * F ω y ∂P = periodicCovariance d L (x - y)
+
+/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet
+derivative: `hessian d g x v w = D^2 g(x)[v, w]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: symmetry of the form (true for `C^2` functions, not stated here). -/
+noncomputable def hessian (d : ℕ) (g : E d → ℝ) (x v w : E d) : ℝ :=
+ iteratedFDeriv ℝ 2 g x ![v, w]
+
+/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "grad f(M)=grad f(S)=0."
+Interface: none.
+Does not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/
+def IsCriticalPoint (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ fderiv ℝ g x = 0
+
+/-- Sylvester-inertia encoding of "the Hessian at `x` is nondegenerate with exactly `j`
+negative and `d - j` positive eigenvalues": there are complementary subspaces `V`, `W` of
+dimensions `j` and `d - j` on which the Hessian form is negative definite, respectively
+positive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)
+Hessians; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "The index counts negative eigenvalues."
+Interface: none.
+Does not claim: equivalence with an eigenvalue count for a non-symmetric form. -/
+def HessianHasInertia (d : ℕ) (g : E d → ℝ) (x : E d) (j : ℕ) : Prop :=
+ ∃ V W : Submodule ℝ (E d), IsCompl V W ∧
+ Module.finrank ℝ V = j ∧ Module.finrank ℝ W = d - j ∧
+ (∀ v ∈ V, v ≠ 0 → hessian d g x v v < 0) ∧
+ (∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)
+
+/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative
+eigenvalues (negative definite).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/
+def IsNondegMax (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x d
+
+/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one
+positive eigenvalue.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that such a saddle is a merging saddle of any superlevel bar. -/
+def IsIndexSaddle (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x (d - 1)
+
+/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinM (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ -((r / 2) • u)
+
+/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinS (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ (r / 2) • u
+
+/-- Torus distance between two points of `R^d`: the infimum over the lattice of
+`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the
+same torus point; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: that the height gap of an elder pair is the persistence of a bar in any persistence module. -/
+def heightGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=
+ g M - g S
+
+/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: positivity of the height gap (added separately where the source requires it). -/
+def IsCandidatePair (d : ℕ) (L : ℝ) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S
+
+/-- Morse genericity with distinct critical values on the torus: every critical point is
+nondegenerate (has some inertia) and critical points at distinct torus positions have
+distinct critical values.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Countable exhaustion now proves that Q is almost surely Morse with distinct critical values."
+Interface: none; used only as a hypothesis of the elder-partner interface clause.
+Does not claim: that sample paths are almost surely Morse (Section 8 of the source). -/
+def IsMorseDistinct (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ (∀ x : E d, IsCriticalPoint d g x → ∃ j : ℕ, HessianHasInertia d g x j) ∧
+ (∀ x y : E d, IsCriticalPoint d g x → IsCriticalPoint d g y →
+ 0 < torusDist d L x y → g x ≠ g y)
+
+/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:
+the maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary
+elder death partner relation. These are GIVEN relations; the fields transcribe the source
+clauses that characterise them on smooth periodic functions, and the elder relation is
+pinned only on the Morse distinct-value locus, exactly as the source does.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint."
+Interface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.
+Does 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. -/
+structure SuperlevelBarInterface (d : ℕ) (L : ℝ) where
+ /-- Section 8 clause: the maximin connection level
+ `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/
+ deathHeight : (E d → ℝ) → E d → ℝ
+ /-- The essential class: the global maximum, which "has no older endpoint" and whose
+ superlevel H0 bar is not finite. -/
+ IsEssential : (E d → ℝ) → E d → Prop
+ /-- Section 1 clause: "the global ordinary superlevel elder death partner of M is S". -/
+ ElderPartner : (E d → ℝ) → E d → E d → Prop
+ /-- `M` is essential exactly when no point is strictly higher (so the supremum in the
+ maximin is over an empty set, "equal to -infinity"). -/
+ essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M
+ /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly
+ higher point stays strictly above `h`. -/
+ deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,
+ h < deathHeight g M ↔
+ ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)
+ /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, "equality
+ d_f(M)=f(S)" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle "expresses
+ ordinary elder death at S". -/
+ elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →
+ ∀ M S : E d, ElderPartner g M S ↔
+ (IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)
+
+/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`
+(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus
+distance. The essential global-maximum class is excluded because `ElderPartner` requires
+`¬ IsEssential` on the Morse locus.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death."
+Interface: `I : SuperlevelBarInterface d L` is given.
+Does 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. -/
+def IsFiniteBar (d : ℕ) (L : ℝ) (I : SuperlevelBarInterface d L) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S
+
+/-- The set of pairs of a population `Pair` with both points in the fundamental domain and
+lifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of this set (a field of the density-version predicate). -/
+def pairSet (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop) (g : E d → ℝ) (A : Set ℝ) :
+ Set (E d × E d) :=
+ {p | p.1 ∈ FundDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}
+
+/-- Number of pairs of the population with lifetime in `A` and base points in the
+fundamental domain (`Set.ncard`, which is `0` for an infinite set).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of the counted set. -/
+noncomputable def pairCount (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop)
+ (g : E d → ℝ) (A : Set ℝ) : ℕ :=
+ Set.ncard (pairSet d L Pair g A)
+
+/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population
+`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost
+surely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and
+`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.
+The source's densities are only defined up to such versions. The sigma-algebra of the sample
+space is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket
+field of a bundled record is not registered for typeclass resolution after the declaration).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "These densities admit versions with"
+Interface: 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.
+Does 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. -/
+def IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (Pair : (E d → ℝ) → E d → E d → Prop) (ν : ℝ → ℝ) : Prop :=
+ haveI := G.mΩ
+ (∀ ℓ : ℝ, 0 ≤ ν ℓ) ∧ Measurable ν ∧
+ (∀ A : Set ℝ, MeasurableSet A → A ⊆ Set.Ioi 0 →
+ (∀ᵐ ω ∂G.P, (pairSet d L Pair (G.F ω) A).Finite) ∧
+ Integrable (fun ω => ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ)) G.P ∧
+ IntegrableOn ν A ∧
+ ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)
+
+/-! ### Populations of pairs -/
+
+/-- Compact-window population of Theorem B: ordered maximum / index-(d-1)-saddle pairs with
+`0 < distance <= ρ`, birth `f(M)` in `B = [bLo, bHi]` and scaled gap in `K = [kLo, kHi]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none beyond the shared predicates.
+Does not claim: anything about the off-diagonal (far) population separately (Section 14 of the source). -/
+def IsUnrestrictedPair (d : ℕ) (L : ℝ) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsCandidatePair d L g M S ∧ 0 < heightGap d g M S
+
+/-! ### The typed pair law as an interface -/
+
+/-- Interface for the weighted regression (typed pair) law: the only object consumed by the
+statements is the probability `p_r(b,k,R)` that the global ordinary superlevel elder death
+partner of the pinned maximum `M = -(r/2)u` is the pinned saddle `S = (r/2)u`, under the
+law `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}`.
+That law, its weight, its normalizer and the regression construction are informal in the
+source and are NOT transcribed; `p` is a GIVEN function of radius `r`, birth `b`, gap mark
+`k` and orthonormal frame `R` with values in `[0, 1]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S."
+Interface: `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.
+Does 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). -/
+structure PairLawInterface (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) where
+ /-- Section 1 clause: "Let p_r(b,k,R) be the Q^W probability that the global ordinary
+ superlevel elder death partner of M is S." -/
+ p : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → ℝ
+ /-- `p` is a probability: nonnegative. -/
+ p_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 ≤ p r b k R
+ /-- `p` is a probability: at most one. -/
+ p_le_one : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), p r b k R ≤ 1
+
+/-! ### The parent statements (1.1), (1.2), (1.3) -/
+
+/-- Shape of Theorem A (1.1), uniform selection candidate: for fixed `d ≥ 2`, `L > 0`,
+compact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo ≤ kHi`, there exist `r_* > 0`
+and `C` (quantified OUTSIDE the universal quantifiers over `r`, `b`, `k` and the frame)
+such that `0 <= 1 - p_r(b,k,R) <= C r^3` for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K` and all
+orthonormal frames `R`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "There exist r_*>0 and C 0` and
+windows `B`, `K` of positive length with `kLo > 0`, there are a distance cutoff `r_* > 0`, a
+constant `c_{B,K} > 0` and a constant `C_{B,K}` such that the compact-window candidate and
+elder lifetime densities admit versions `νc`, `νe` with `νc(ℓ) ~ c_{B,K} ℓ^(-1/3)`,
+`νe(ℓ) ~ c_{B,K} ℓ^(-1/3)` as `ℓ ↓ 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and
+`0 ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all sufficiently small `ℓ > 0`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),"
+Interface: `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).
+Does 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. -/
+def ParentCompactWindowDensityB (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo < bHi → 0 < kLo → kLo < kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ c : ℝ, 0 < c ∧ ∃ C : ℝ, ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsWindowPair d L rStar bLo bHi kLo kHi) νc ∧
+ IsLifetimeDensityVersion d L G (IsWindowElderPair d L rStar bLo bHi kLo kHi I) νe ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νc
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ ∃ ℓStar : ℝ, 0 < ℓStar ∧ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3)
+
+/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and
+versions `νc`, `νe` of the unrestricted candidate density and of the finite ordinary
+superlevel H0 bar density satisfy `νc(ℓ) ~ c ℓ^(-1/3)` and `νe(ℓ) ~ c ℓ^(-1/3)` as `ℓ ↓ 0`.
+The essential global-maximum class is excluded from `νe` through `IsFiniteBar`. This is the
+conclusion of (1.3) for a given `c`; it characterises `c_{d,L}` by its leading-term role,
+not by the integral (13.6)/(15.2).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "There is a positive finite constant c_{d,L} such that"
+Interface: `G` and `I` are given; versions are characterised by the integral identity only.
+Does 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. -/
+def IsUnrestrictedLeadingCoefficient (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) (c : ℝ) : Prop :=
+ 0 < c ∧ ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsUnrestrictedPair d L) νc ∧
+ IsLifetimeDensityVersion d L G (IsFiniteBar d L I) νe ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νc
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3))
+
+/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for
+fixed `d ≥ 2` and `L > 0` there is a positive finite constant `c_{d,L}` such that the
+unrestricted candidate density and the finite ordinary superlevel H0 bar density (all birth
+heights, all positive gap marks, all separations; essential global maximum excluded) admit
+versions with `ν(ℓ) ~ c_{d,L} ℓ^(-1/3)` as `ℓ ↓ 0`. Leading term only.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),"
+Interface: `G` and `I` are given; versions are characterised by the integral identity only.
+Does 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. -/
+def ParentUnrestrictedLeadingDensityC (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) : Prop :=
+ 2 ≤ d → 0 < L → ∃ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c
+
+/-! ### The bounded remainder (R1) -/
+
+/-- Shape of Theorem R (R1), bounded unrestricted short-lifetime remainder: for fixed
+`d ≥ 2`, `L > 0` and with `c = c_{d,L}` the parent leading coefficient (characterised here
+by `IsUnrestrictedLeadingCoefficient`), there are `ell_* > 0` and `C` such that versions of
+the unrestricted candidate and finite-bar densities satisfy, for `0 < ℓ ≤ ell_*`,
+`|νc(ℓ) - c ℓ^(-1/3)| ≤ C`, `0 ≤ νc(ℓ) - νe(ℓ) ≤ C` and `|νe(ℓ) - c ℓ^(-1/3)| ≤ C`.
+The `O(1)` remainder is stated with an explicit absolute-value bound.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md sha256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a
+Anchor: "|nu_cand(ell)-c ell^(-1/3)| <= C,"
+Interface: `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).
+Does 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. -/
+def RemainderBoundedR1 (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) : Prop :=
+ 2 ≤ d → 0 < L → ∀ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c →
+ ∃ ℓStar : ℝ, 0 < ℓStar ∧ ∃ C : ℝ, ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsUnrestrictedPair d L) νc ∧
+ IsLifetimeDensityVersion d L G (IsFiniteBar d L I) νe ∧
+ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ |νc ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C ∧
+ 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C ∧
+ |νe ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C
+
+/-! ### Planar elder lower bound and density gap (d = 2) -/
+
+/-- Shape of the planar direct lower bound (E2): on the fixed planar torus (`d = 2`), with
+birth `b` in a fixed compact interval, `k ∈ [kLo, kHi]` with `kLo > 0` and frames ranging
+over `O(2)`, there are `c > 0` and `r_* > 0` such that `1 - p_r(b,k,R) ≥ c r^3` for all
+`0 < r ≤ r_*`, uniformly in `b`, `k` and the frame.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c
+Anchor: "1-p_r(b,k,R) >= c r^3, 0 0` there are a distance cutoff
+`r_* > 0`, constants `c_{B,K} > 0`, `C_{B,K}` and `ell_* > 0` such that versions of the
+compact-window candidate and ordinary elder densities satisfy
+`c_{B,K} ℓ^(2/3) ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all `0 < ℓ ≤ ell_*`. The parent upper
+input is an explicit hypothesis, not folded into the conclusion. The lower half, which the
+source derives from (E2) alone, is stated under the same hypothesis because the source displays
+(E11) as one two-sided inequality; that is a hypothesis the source does not need for the lower
+half, recorded here as such.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c
+Anchor: " <= C_{B,K} ell^(2/3). (E11)"
+Interface: `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.
+Does 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. -/
+def PlanarDensityGapE11 (L : ℝ) (G : GaussianFieldInterface 2 L) (I : SuperlevelBarInterface 2 L)
+ (PL : PairLawInterface 2 L G I) (bLo bHi kLo kHi : ℝ) : Prop :=
+ ParentUniformSelectionA 2 L G I PL bLo bHi kLo kHi →
+ (0 < L → bLo < bHi → 0 < kLo → kLo < kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ c : ℝ, 0 < c ∧ ∃ C : ℝ, ∃ ℓStar : ℝ, 0 < ℓStar ∧
+ ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion 2 L G (IsWindowPair 2 L rStar bLo bHi kLo kHi) νc ∧
+ IsLifetimeDensityVersion 2 L G (IsWindowElderPair 2 L rStar bLo bHi kLo kHi I) νe ∧
+ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ c * ℓ ^ ((2 : ℝ) / 3) ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3))
+
+end UniversalLaw.Spec.Lifetime
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceC4.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceC4.lean
new file mode 100644
index 000000000..f5188d51c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceC4.lean
@@ -0,0 +1,141 @@
+import SourceFourierSeries
+import Mathlib.Analysis.Calculus.SmoothSeries
+import Mathlib.Analysis.SpecialFunctions.Trigonometric.Deriv
+
+/-! Actual same-sample C4 of the canonical normalized Fourier lift.
+Covariance identification, Gaussian field/jet laws and pin regression are separate. -/
+
+noncomputable section
+open I4Foundation I4Weights I4Source MeasureTheory ProbabilityTheory
+open scoped BigOperators
+
+namespace I4C4
+
+def phaseCLM (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : (Fin d → ℝ) →L[ℝ] ℝ :=
+ ∑ i, (sourceC L * (k i : ℝ)) • ContinuousLinearMap.proj i
+
+theorem phaseCLM_apply (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ) :
+ phaseCLM d L k x = phase d L k x := by
+ simp [phaseCLM, phase]
+
+theorem phaseCLM_norm_le (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :
+ ‖phaseCLM d L k‖ ≤ ∑ i, |sourceC L * (k i : ℝ)| := by
+ apply ContinuousLinearMap.opNorm_le_bound _
+ (Finset.sum_nonneg (fun i _ => abs_nonneg _))
+ intro x
+ rw [phaseCLM_apply]
+ calc
+ ‖phase d L k x‖ ≤ ∑ i, ‖sourceC L * (k i : ℝ) * x i‖ := norm_sum_le _ _
+ _ ≤ ∑ i, |sourceC L * (k i : ℝ)| * ‖x‖ := by
+ apply Finset.sum_le_sum
+ intro i _
+ rw [norm_mul, Real.norm_eq_abs]
+ exact mul_le_mul_of_nonneg_left (norm_le_pi_norm x i) (abs_nonneg _)
+ _ = (∑ i, |sourceC L * (k i : ℝ)|) * ‖x‖ := by rw [Finset.sum_mul]
+
+theorem modeCoefficient_iteratedFDeriv_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (m : SourceMode d) (j : ℕ) (hj : j ≤ 4) (x : Fin d → ℝ) :
+ ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ modeMajorant d L m := by
+ classical
+ cases m with
+ | none =>
+ cases j with
+ | zero =>
+ simpa only [norm_iteratedFDeriv_zero, Real.norm_eq_abs] using
+ modeCoefficient_bound d hL none x
+ | succ j =>
+ change ‖iteratedFDeriv ℝ (j + 1)
+ (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L)) x‖ ≤ Real.sqrt (1 / sourceZ d L)
+ rw [iteratedFDeriv_succ_const]
+ simp only [Pi.zero_apply, norm_zero]
+ exact Real.sqrt_nonneg _
+ | some p =>
+ rcases p with ⟨k, b⟩
+ let A := Real.sqrt (2 * sourceWeight d L k / sourceZ d L)
+ let P := ∏ i, (1 + |sourceC L * (k.1 i : ℝ)|)
+ let g : ℝ → ℝ := if b then Real.sin else Real.cos
+ let ell := phaseCLM d L k
+ have hg : ContDiff ℝ j g := by
+ cases b <;> simp only [g, Bool.false_eq_true, ite_false, ite_true] <;> fun_prop
+ have hgc : ContDiff ℝ j (g ∘ ell) := hg.comp_continuousLinearMap
+ have hgn : ‖iteratedFDeriv ℝ j g (ell x)‖ ≤ 1 := by
+ cases b with
+ | false =>
+ simpa only [g, Bool.false_eq_true, ite_false,
+ norm_iteratedFDeriv_eq_norm_iteratedDeriv, Real.norm_eq_abs] using
+ Real.abs_iteratedDeriv_cos_le_one j (ell x)
+ | true =>
+ simpa only [g, ite_true, norm_iteratedFDeriv_eq_norm_iteratedDeriv,
+ Real.norm_eq_abs] using Real.abs_iteratedDeriv_sin_le_one j (ell x)
+ have hP : 1 ≤ P := by
+ apply Finset.one_le_prod₀
+ intro i _
+ linarith [abs_nonneg (sourceC L * (k.1 i : ℝ))]
+ have hl : ‖ell‖ ≤ P := by
+ calc
+ ‖ell‖ ≤ ∑ i, |sourceC L * (k.1 i : ℝ)| := phaseCLM_norm_le d L k
+ _ ≤ 1 + ∑ i, |sourceC L * (k.1 i : ℝ)| := by linarith
+ _ ≤ P := frequency_l1_le_product d _ (fun i => abs_nonneg _)
+ have hpow : ‖ell‖ ^ j ≤ P ^ 4 := by
+ calc
+ ‖ell‖ ^ j ≤ P ^ j := by gcongr
+ _ ≤ P ^ 4 := pow_le_pow_right₀ hP hj
+ have hder : ‖iteratedFDeriv ℝ j (g ∘ ell) x‖ ≤ ‖ell‖ ^ j := by
+ rw [ell.iteratedFDeriv_comp_right hg x le_rfl]
+ calc
+ _ ≤ ‖iteratedFDeriv ℝ j g (ell x)‖ * ∏ _i : Fin j, ‖ell‖ :=
+ (iteratedFDeriv ℝ j g (ell x)).norm_compContinuousLinearMap_le (fun _ => ell)
+ _ ≤ 1 * ∏ _i : Fin j, ‖ell‖ :=
+ mul_le_mul_of_nonneg_right hgn (Finset.prod_nonneg (fun _ _ => norm_nonneg _))
+ _ = ‖ell‖ ^ j := by simp
+ have heq : modeCoefficient d L (some (k, b)) = A • (g ∘ ell) := by
+ funext y
+ cases b <;> simp [modeCoefficient, A, g, Function.comp_apply, Pi.smul_apply,
+ smul_eq_mul, ell, phaseCLM_apply]
+ rw [heq, iteratedFDeriv_const_smul_apply hgc.contDiffAt, norm_smul,
+ Real.norm_eq_abs, abs_of_nonneg (Real.sqrt_nonneg _)]
+ calc
+ _ ≤ A * P ^ 4 := mul_le_mul_of_nonneg_left (hder.trans hpow) (Real.sqrt_nonneg _)
+ _ = modeMajorant d L (some (k, b)) := by
+ rw [modeMajorant, pairedBound_eq_amplitude d hL k]
+ simp only [A, P, Finset.prod_pow]
+
+theorem sourceField_contDiff_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ContDiff ℝ 4 (sourceField d L ω) := by
+ have hc (m : SourceMode d) : ContDiff ℝ 4 (modeCoefficient d L m) := by
+ cases m with
+ | none =>
+ change ContDiff ℝ 4 (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L))
+ fun_prop
+ | some p =>
+ rcases p with ⟨k, b⟩
+ change ContDiff ℝ 4 (fun x : Fin d → ℝ =>
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ (if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)))
+ cases b <;> simp [phase] <;> fun_prop
+ filter_upwards [sourceMajorant_ae d hL] with ω hω
+ change ContDiff ℝ 4 (fun x => ∑' m, modeCoefficient d L m x * ω m)
+ apply contDiff_tsum (v := fun _ m => modeMajorant d L m * |ω m|)
+ · intro m
+ exact (hc m).mul contDiff_const
+ · intro j hj
+ exact hω
+ · intro j m x hj
+ have hj' : j ≤ 4 := by exact_mod_cast hj
+ have hcj : ContDiff ℝ j (modeCoefficient d L m) :=
+ (hc m).of_le (by exact_mod_cast hj')
+ have heq : (fun y => modeCoefficient d L m y * ω m) = ω m • modeCoefficient d L m := by
+ funext y
+ simp [smul_eq_mul, mul_comm]
+ rw [heq, iteratedFDeriv_const_smul_apply hcj.contDiffAt, norm_smul, Real.norm_eq_abs]
+ simpa only [mul_comm] using mul_le_mul_of_nonneg_left
+ (modeCoefficient_iteratedFDeriv_bound d hL m j hj' x) (abs_nonneg (ω m))
+
+theorem sourceField_contDiff_affine_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ∀ (T : (Fin d → ℝ) →L[ℝ] (Fin d → ℝ)) (a : Fin d → ℝ),
+ ContDiff ℝ 4 (fun x => sourceField d L ω (a + T x)) := by
+ filter_upwards [sourceField_contDiff_ae d hL] with ω hω
+ intro T a
+ exact hω.comp (contDiff_const.add T.contDiff)
+
+end I4C4
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceCovariance.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceCovariance.lean
new file mode 100644
index 000000000..50aa85f30
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceCovariance.lean
@@ -0,0 +1,74 @@
+import SourceKernel
+import SourceGaussianLaw
+import Mathlib.Probability.Moments.Covariance
+import Mathlib.Probability.Moments.Variance
+
+noncomputable section
+open I4Foundation I4Weights I4Source I4Kernel I4SourceGaussian MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal NNReal
+namespace I4SourceCovariance
+
+variable {ι : Type*} [Countable ι]
+
+theorem scalarSeries_covariance (a b : ι → ℝ) (ha : Summable a) (hb : Summable b) :
+ cov[scalarSeries a, scalarSeries b; coefficientLaw ι] = ∑' i, a i * b i := by
+ have hsq (f : ι → ℝ) (hf : Summable f) : Summable (fun i => f i ^ 2) := by
+ have hp := summable_mul_of_summable_norm hf.norm hf.norm
+ simpa only [Function.comp_def, pow_two] using hp.comp_injective
+ (show Function.Injective (fun i : ι => (i,i)) from
+ fun i j h => congrArg Prod.fst h)
+ have hprod : Summable (fun i => a i * b i) := by
+ have hp := summable_mul_of_summable_norm ha.norm hb.norm
+ simpa only [Function.comp_def] using hp.comp_injective
+ (show Function.Injective (fun i : ι => (i,i)) from
+ fun i j h => congrArg Prod.fst h)
+ have hLp (f : ι → ℝ) (hf : Summable f) :
+ MemLp (scalarSeries f) 2 (coefficientLaw ι) := by
+ have h : MemLp id 2 ((coefficientLaw ι).map (scalarSeries f)) := by
+ rw [scalarSeries_map_gaussian f hf]
+ exact memLp_id_gaussianReal' 2 (by norm_num)
+ simpa only [Function.comp_def, Function.id_def] using
+ h.comp_of_map (scalarSeries_measurable f).aemeasurable
+ have heq : scalarSeries (a + b) =ᵐ[coefficientLaw ι]
+ (fun ω => scalarSeries a ω + scalarSeries b ω) := by
+ filter_upwards [scalarSeries_hasSum_ae a ha, scalarSeries_hasSum_ae b hb,
+ scalarSeries_hasSum_ae (a+b) (ha.add hb)] with ω haω hbω habω
+ exact habω.unique (by simpa only [Pi.add_apply, add_mul] using haω.add hbω)
+ have hts : (∑' i, (a i + b i)^2) =
+ (∑' i, a i ^ 2) + 2 * (∑' i, a i * b i) + (∑' i, b i ^ 2) := by
+ calc
+ _ = ∑' i, (a i ^ 2 + 2 * (a i * b i) + b i ^ 2) := by
+ exact tsum_congr (fun i => by ring)
+ _ = _ := by
+ rw [((hsq a ha).add (hprod.mul_left 2)).tsum_add (hsq b hb),
+ (hsq a ha).tsum_add (hprod.mul_left 2), tsum_mul_left]
+ have hv := variance_fun_add (hLp a ha) (hLp b hb)
+ rw [← variance_congr heq, scalarSeries_variance (a+b) (ha.add hb),
+ scalarSeries_variance a ha, scalarSeries_variance b hb] at hv
+ change (∑' i, (a i+b i)^2) = _ at hv
+ rw [hts] at hv
+ linarith
+
+theorem sourceField_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :
+ ∫ ω, sourceField d L ω x ∂sourceLaw d = 0 := by
+ have hc : Summable (fun m => modeCoefficient d L m x) :=
+ (modeMajorant_summable d hL).of_norm_bounded (fun m => by
+ simpa only [Real.norm_eq_abs] using modeCoefficient_bound d hL m x)
+ exact scalarSeries_integral_zero (fun m => modeCoefficient d L m x) hc
+
+theorem sourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :
+ cov[fun ω => sourceField d L ω x, fun ω => sourceField d L ω y; sourceLaw d] =
+ sourceSpectralKernel d L (x - y) := by
+ have hc (z : Fin d → ℝ) : Summable (fun m => modeCoefficient d L m z) :=
+ (modeMajorant_summable d hL).of_norm_bounded (fun m => by
+ simpa only [Real.norm_eq_abs] using modeCoefficient_bound d hL m z)
+ change cov[scalarSeries (fun m => modeCoefficient d L m x),
+ scalarSeries (fun m => modeCoefficient d L m y); coefficientLaw (SourceMode d)] = _
+ rw [scalarSeries_covariance _ _ (hc x) (hc y), coefficientKernel_eq_fullLattice d hL x y]
+
+theorem sourceField_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :
+ Var[fun ω => sourceField d L ω x; sourceLaw d] = 1 := by
+ rw [← covariance_self (sourceField_eval_measurable d L x).aemeasurable,
+ sourceField_covariance d hL x x, sub_self, spectralKernel_zero d hL]
+
+end I4SourceCovariance
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceFourierSeries.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceFourierSeries.lean
new file mode 100644
index 000000000..e4cdec9e6
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceFourierSeries.lean
@@ -0,0 +1,147 @@
+import GaussianSeriesFoundation
+import SpectralWeights
+import Mathlib.Logic.Equiv.Option
+import Mathlib.Topology.Algebra.InfiniteSum.TsumUniformlyOn
+
+/-! Actual canonical real Fourier series and a shared-event uniform convergence bridge.
+The half-lattice partition, covariance, sample C4 and finite-jet law require separate proofs. -/
+
+noncomputable section
+open MeasureTheory ProbabilityTheory I4Foundation I4Weights
+open scoped BigOperators ENNReal
+
+namespace I4Source
+
+/-- The representative whose first nonzero coordinate is positive. -/
+def halfLattice (d : ℕ) : Set (Fin d → ℤ) :=
+ {k | ∃ i, 0 < k i ∧ ∀ j, j < i → k j = 0}
+
+abbrev SourceMode (d : ℕ) := Option (↥(halfLattice d) × Bool)
+
+/-- The actual common law, with independent variance-one real coefficients. -/
+abbrev sourceLaw (d : ℕ) : Measure (SourceMode d → ℝ) :=
+ coefficientLaw (SourceMode d)
+
+def phase (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ) : ℝ :=
+ ∑ i, sourceC L * (k i : ℝ) * x i
+
+/-- False is the cosine coefficient and true the independent sine coefficient. -/
+def modeCoefficient (d : ℕ) (L : ℝ) (m : SourceMode d) (x : Fin d → ℝ) : ℝ :=
+ match m with
+ | none => Real.sqrt (1 / sourceZ d L)
+ | some (k, b) => Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)
+
+def modeMajorant (d : ℕ) (L : ℝ) (m : SourceMode d) : ℝ :=
+ match m with
+ | none => Real.sqrt (1 / sourceZ d L)
+ | some (k, _) => pairedBound d L k
+
+/-- Literal normalized real Fourier sum on the common coefficient samples. -/
+def sourceField (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) (x : Fin d → ℝ) : ℝ :=
+ scalarSeries (fun m => modeCoefficient d L m x) ω
+
+theorem modeMajorant_nonneg (d : ℕ) (L : ℝ) (m : SourceMode d) :
+ 0 ≤ modeMajorant d L m := by
+ cases m with
+ | none => exact Real.sqrt_nonneg _
+ | some p =>
+ change 0 ≤ pairedBound d L p.1
+ unfold pairedBound productBound coordinateBound decay
+ positivity
+
+theorem modeMajorant_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (modeMajorant d L) := by
+ classical
+ have hs := pairedBound_subtype_summable d hL (halfLattice d)
+ have hb : Summable (fun _ : Bool => (1 : ℝ)) := (hasSum_fintype _).summable
+ have hp : Summable (fun p : ↥(halfLattice d) × Bool => pairedBound d L p.1) := by
+ simpa only [mul_one] using hs.mul_of_nonneg hb
+ (fun k => modeMajorant_nonneg d L (some (k, false))) (fun _ => zero_le_one)
+ let e := Equiv.optionEquivSumPUnit.{0, 0} (↥(halfLattice d) × Bool)
+ apply e.symm.summable_iff.mp
+ apply Summable.sum (fun q => modeMajorant d L (e.symm q))
+ · simpa [e, Function.comp_def, modeMajorant] using hp
+ · exact (hasSum_fintype _).summable
+
+theorem modeCoefficient_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (m : SourceMode d) (x : Fin d → ℝ) :
+ |modeCoefficient d L m x| ≤ modeMajorant d L m := by
+ cases m with
+ | none =>
+ exact (abs_of_nonneg (Real.sqrt_nonneg _)).le
+ | some p =>
+ rcases p with ⟨k, b⟩
+ have hprod : 1 ≤ ∏ i, (1 + |sourceC L * (k.val i : ℝ)|) ^ 4 := by
+ apply Finset.one_le_prod₀
+ intro i _
+ apply one_le_pow₀
+ linarith [abs_nonneg (sourceC L * (k.val i : ℝ))]
+ have hamp : Real.sqrt (2 * sourceWeight d L k / sourceZ d L) ≤
+ pairedBound d L k := by
+ rw [pairedBound_eq_amplitude d hL k]
+ simpa only [mul_one] using mul_le_mul_of_nonneg_left hprod
+ (Real.sqrt_nonneg (2 * sourceWeight d L k / sourceZ d L))
+ change |Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ (if b then Real.sin (phase d L k x) else Real.cos (phase d L k x))| ≤ _
+ rw [abs_mul, abs_of_nonneg (Real.sqrt_nonneg _)]
+ have ht : |if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)| ≤ 1 := by
+ cases b with
+ | false => exact Real.abs_cos_le_one _
+ | true => exact Real.abs_sin_le_one _
+ have hbase : Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ |if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)| ≤
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L) := by
+ simpa only [mul_one] using mul_le_mul_of_nonneg_left ht
+ (Real.sqrt_nonneg (2 * sourceWeight d L k / sourceZ d L))
+ exact hbase.trans hamp
+
+theorem sourceField_eval_measurable (d : ℕ) (L : ℝ) (x : Fin d → ℝ) :
+ Measurable (fun ω => sourceField d L ω x) := by
+ exact scalarSeries_measurable _
+
+theorem sourceMajorant_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, Summable (fun m => modeMajorant d L m * |ω m|) := by
+ exact weighted_abs_summable_ae _ (modeMajorant_nonneg d L) (modeMajorant_summable d hL)
+
+theorem sourceAbs_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d,
+ HasSumUniformly (fun m x => |modeCoefficient d L m x * ω m|)
+ (fun x => ∑' m, |modeCoefficient d L m x * ω m|) := by
+ filter_upwards [sourceMajorant_ae d hL] with ω hω
+ apply hasSumUniformly_iff_tendstoUniformly.mpr
+ apply tendstoUniformly_tsum hω
+ intro m x
+ simp only [Real.norm_eq_abs, abs_abs, abs_mul]
+ exact mul_le_mul_of_nonneg_right (modeCoefficient_bound d hL m x) (abs_nonneg _)
+
+theorem sourceField_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d,
+ HasSumUniformly (fun m x => modeCoefficient d L m x * ω m)
+ (sourceField d L ω) := by
+ filter_upwards [sourceMajorant_ae d hL] with ω hω
+ apply hasSumUniformly_iff_tendstoUniformly.mpr
+ apply tendstoUniformly_tsum hω
+ intro m x
+ simp only [Real.norm_eq_abs, abs_mul]
+ exact mul_le_mul_of_nonneg_right (modeCoefficient_bound d hL m x) (abs_nonneg _)
+
+theorem sourceField_continuous_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, Continuous (sourceField d L ω) := by
+ filter_upwards [sourceMajorant_ae d hL] with ω hω
+ change Continuous (fun x => ∑' m, modeCoefficient d L m x * ω m)
+ have hcont (m : SourceMode d) :
+ Continuous (fun x : Fin d → ℝ => modeCoefficient d L m x * ω m) := by
+ cases m with
+ | none =>
+ change Continuous (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L) * ω none)
+ exact continuous_const
+ | some p =>
+ rcases p with ⟨k, b⟩
+ cases b <;> simp [modeCoefficient, phase] <;> fun_prop
+ apply continuous_tsum hcont hω
+ intro m x
+ simp only [Real.norm_eq_abs, abs_mul]
+ exact mul_le_mul_of_nonneg_right (modeCoefficient_bound d hL m x) (abs_nonneg _)
+
+end I4Source
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceGaussianLaw.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceGaussianLaw.lean
new file mode 100644
index 000000000..bb8450b5a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceGaussianLaw.lean
@@ -0,0 +1,189 @@
+import SourceFourierSeries
+import Mathlib.MeasureTheory.Integral.DominatedConvergence
+import Mathlib.Probability.Independence.CharacteristicFunction
+import Mathlib.Probability.Distributions.Gaussian.HasGaussianLaw.Independence
+import Mathlib.Analysis.Normed.Ring.InfiniteSum
+import Mathlib.Probability.Distributions.Gaussian.IsGaussianProcess.Def
+
+/-! Actual Gaussian laws of summable coefficient series and finite evaluation combinations.
+No covariance/source-kernel, torus, derivative-jet, or pinned-law conclusion is assumed. -/
+
+noncomputable section
+open I4Foundation I4Weights I4Source MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal NNReal Topology
+
+namespace I4SourceGaussian
+
+variable {ι : Type*}
+
+private theorem summable_square (a : ι → ℝ) (ha : Summable a) :
+ Summable (fun i => a i ^ 2) := by
+ have h := summable_mul_of_summable_norm ha.norm ha.norm
+ simpa only [Function.comp_def, pow_two] using h.comp_injective
+ (show Function.Injective (fun i : ι => (i, i)) from
+ fun i j hij => congrArg Prod.fst hij)
+
+variable [Countable ι]
+
+omit [Countable ι] in
+private theorem partial_charFun (a : ι → ℝ) (s : Finset ι) (t : ℝ) :
+ charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t =
+ Complex.exp (-((∑ i ∈ s, a i ^ 2 : ℝ) : ℂ) * (t : ℂ) ^ 2 / 2) := by
+ classical
+ have hi : iIndepFun (fun i (ω : ι → ℝ) => a i * ω i) (coefficientLaw ι) :=
+ (coordinates_independent ι).comp (fun i y => a i * y) (fun _ => by fun_prop)
+ have hm (i : ι) : Measurable (fun ω : ι → ℝ => a i * ω i) :=
+ measurable_const.mul (measurable_pi_apply i)
+ have hchar (i : ι) : charFun ((coefficientLaw ι).map
+ (fun ω : ι → ℝ => a i * ω i)) t =
+ Complex.exp (-((a i : ℂ) * (t : ℂ)) ^ 2 / 2) := by
+ rw [charFun_map_mul_comp (f := fun ω : ι → ℝ => ω i)
+ (measurable_pi_apply i).aemeasurable, coordinate_marginal, charFun_gaussianReal]
+ simp only [Complex.ofReal_mul, mul_zero, Complex.ofReal_zero, zero_mul,
+ NNReal.coe_one, Complex.ofReal_one, one_mul, zero_sub]
+ congr 1
+ ring
+ rw [(hi.restrict s).charFun_map_fun_finsetSum_eq_prod (fun i _ => (hm i).aemeasurable)]
+ simp only [Finset.prod_apply]
+ simp_rw [hchar]
+ rw [← Complex.exp_sum]
+ congr 1
+ push_cast
+ simp only [mul_pow]
+ rw [← Finset.sum_div, Finset.sum_neg_distrib, ← Finset.sum_mul]
+ rw [neg_mul]
+
+private theorem charFun_partial_tendsto (a : ι → ℝ) (ha : Summable a) (t : ℝ) :
+ Filter.Tendsto
+ (fun s : Finset ι => charFun ((coefficientLaw ι).map
+ (fun ω => ∑ i ∈ s, a i * ω i)) t)
+ Filter.atTop (𝓝 (charFun ((coefficientLaw ι).map (scalarSeries a)) t)) := by
+ classical
+ have hm (s : Finset ι) : Measurable (fun ω : ι → ℝ => ∑ i ∈ s, a i * ω i) :=
+ Finset.measurable_sum s (fun i _ => measurable_const.mul (measurable_pi_apply i))
+ have heq (s : Finset ι) :
+ charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t =
+ ∫ ω, Complex.exp (((t * ∑ i ∈ s, a i * ω i : ℝ) : ℂ) * Complex.I)
+ ∂coefficientLaw ι := by
+ rw [charFun_apply_real, integral_map (hm s).aemeasurable (by fun_prop)]
+ push_cast
+ rfl
+ have heq' : charFun ((coefficientLaw ι).map (scalarSeries a)) t =
+ ∫ ω, Complex.exp (((t * scalarSeries a ω : ℝ) : ℂ) * Complex.I)
+ ∂coefficientLaw ι := by
+ rw [charFun_apply_real, integral_map (scalarSeries_measurable a).aemeasurable
+ (by fun_prop)]
+ push_cast
+ rfl
+ simp_rw [heq, heq']
+ apply tendsto_integral_filter_of_norm_le_const
+ · filter_upwards with s
+ have hc : Continuous (fun q : ℝ => Complex.exp (((t * q : ℝ) : ℂ) * Complex.I)) :=
+ by fun_prop
+ exact (hc.measurable.comp (hm s)).aestronglyMeasurable
+ · refine ⟨1, Filter.Eventually.of_forall (fun s => ?_)⟩
+ filter_upwards with ω
+ rw [Complex.norm_exp_ofReal_mul_I]
+ · filter_upwards [scalarSeries_hasSum_ae a ha] with ω hω
+ exact ((by fun_prop : Continuous (fun q : ℝ =>
+ Complex.exp (((t * q : ℝ) : ℂ) * Complex.I))).tendsto _).comp hω
+
+theorem scalarSeries_map_gaussian (a : ι → ℝ) (ha : Summable a) :
+ (coefficientLaw ι).map (scalarSeries a) =
+ gaussianReal 0 (∑' i, a i ^ 2).toNNReal := by
+ apply Measure.ext_of_charFun
+ funext t
+ have h1 := charFun_partial_tendsto a ha t
+ have h2 : Filter.Tendsto (fun s : Finset ι =>
+ charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t)
+ Filter.atTop (𝓝 (Complex.exp (-((∑' i, a i ^ 2 : ℝ) : ℂ) * (t : ℂ)^2 / 2))) := by
+ simp_rw [partial_charFun]
+ exact ((by fun_prop : Continuous (fun q : ℝ =>
+ Complex.exp (-(q : ℂ) * (t : ℂ)^2 / 2))).tendsto _).comp
+ (summable_square a ha).hasSum
+ rw [tendsto_nhds_unique h1 h2, charFun_gaussianReal]
+ rw [Real.coe_toNNReal _ (tsum_nonneg (fun i => sq_nonneg (a i)))]
+ congr 1
+ push_cast
+ ring
+
+theorem scalarSeries_integral_zero (a : ι → ℝ) (ha : Summable a) :
+ ∫ ω, scalarSeries a ω ∂coefficientLaw ι = 0 := by
+ have h := integral_id_gaussianReal (μ := 0) (v := (∑' i, a i ^ 2).toNNReal)
+ rw [← scalarSeries_map_gaussian a ha,
+ integral_map (scalarSeries_measurable a).aemeasurable (by fun_prop)] at h
+ exact h
+
+theorem scalarSeries_variance (a : ι → ℝ) (ha : Summable a) :
+ Var[scalarSeries a; coefficientLaw ι] = ∑' i, a i ^ 2 := by
+ rw [← variance_id_map (scalarSeries_measurable a).aemeasurable,
+ scalarSeries_map_gaussian a ha, variance_id_gaussianReal]
+ exact Real.coe_toNNReal _ (tsum_nonneg (fun i => sq_nonneg (a i)))
+
+theorem source_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (x : Fin n → (Fin d → ℝ)) (c : Fin n → ℝ) :
+ HasGaussianLaw (fun ω => ∑ j, c j * sourceField d L ω (x j)) (sourceLaw d) := by
+ classical
+ have hc (j : Fin n) : Summable (fun m => modeCoefficient d L m (x j)) :=
+ (modeMajorant_summable d hL).of_norm_bounded (fun m => by
+ simpa only [Real.norm_eq_abs] using modeCoefficient_bound d hL m (x j))
+ let a : SourceMode d → ℝ := fun m => ∑ j, c j * modeCoefficient d L m (x j)
+ have ha : Summable a := by
+ exact summable_sum (fun j _ => (hc j).mul_left (c j))
+ have hG : HasGaussianLaw (scalarSeries a) (sourceLaw d) := by
+ constructor
+ · exact (scalarSeries_measurable a).aemeasurable
+ · change IsGaussian ((coefficientLaw (SourceMode d)).map (scalarSeries a))
+ rw [scalarSeries_map_gaussian a ha]
+ infer_instance
+ apply hG.congr
+ filter_upwards [ae_all_iff.2 (fun j : Fin n =>
+ scalarSeries_hasSum_ae (fun m => modeCoefficient d L m (x j)) (hc j)),
+ scalarSeries_hasSum_ae a ha] with ω hω hsum
+ have h : HasSum (fun m => ∑ j, c j * modeCoefficient d L m (x j) * ω m)
+ (∑ j, c j * sourceField d L ω (x j)) := by
+ simpa only [sourceField, mul_assoc] using hasSum_sum (fun j _ => (hω j).mul_left (c j))
+ exact hsum.unique (by simpa only [a, Finset.sum_mul] using h)
+
+theorem source_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (x : Fin n → (Fin d → ℝ)) :
+ HasGaussianLaw (fun ω j => sourceField d L ω (x j)) (sourceLaw d) := by
+ classical
+ have hm : Measurable (fun ω j => sourceField d L ω (x j)) :=
+ Measurable.of_eval (fun j => sourceField_eval_measurable d L (x j))
+ refine ⟨hm.aemeasurable, ?_⟩
+ apply isGaussian_of_map_eq_gaussianReal
+ intro ell
+ let c : Fin n → ℝ := fun j => ell (Pi.single j 1)
+ have hrep (v : Fin n → ℝ) : ell v = ∑ j, c j * v j := by
+ rw [← LinearMap.sum_single_apply (fun _ : Fin n => ℝ) v, map_sum]
+ apply Finset.sum_congr rfl
+ intro j _
+ have hs : Pi.single j (v j) = v j • Pi.single j (1 : ℝ) := by
+ rw [← Pi.single_smul, smul_eq_mul, mul_one]
+ rw [hs, map_smul]
+ simp [c, smul_eq_mul, mul_comm]
+ have hg : HasGaussianLaw (fun ω => ell (fun j => sourceField d L ω (x j)))
+ (sourceLaw d) :=
+ (source_linearCombination_hasGaussianLaw d hL n x c).congr
+ (Filter.Eventually.of_forall (fun ω => (hrep _).symm))
+ refine ⟨(sourceLaw d)[fun ω => ell (fun j => sourceField d L ω (x j))],
+ Var[fun ω => ell (fun j => sourceField d L ω (x j)); sourceLaw d].toNNReal, ?_⟩
+ rw [Measure.map_map ell.continuous.measurable hm]
+ exact hg.map_eq_gaussianReal
+
+theorem sourceField_isGaussianProcess (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ IsGaussianProcess (fun x ω => sourceField d L ω x) (sourceLaw d) := by
+ classical
+ constructor
+ intro I
+ let e : ↥I ≃ Fin (Fintype.card ↥I) := Fintype.equivFin ↥I
+ let x : Fin (Fintype.card ↥I) → (Fin d → ℝ) := fun j => (e.symm j).1
+ let R : (Fin (Fintype.card ↥I) → ℝ) →L[ℝ] (↥I → ℝ) :=
+ ContinuousLinearMap.pi (fun i => ContinuousLinearMap.proj (e i))
+ apply ((source_finiteVector_hasGaussianLaw d hL _ x).map_fun R).congr
+ filter_upwards with ω
+ funext i
+ simp [R, x]
+
+end I4SourceGaussian
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceKernel.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceKernel.lean
new file mode 100644
index 000000000..5d5602ac7
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceKernel.lean
@@ -0,0 +1,112 @@
+import SourceLattice
+import Mathlib.Analysis.Normed.Ring.InfiniteSum
+
+noncomputable section
+open I4Foundation I4Weights I4Source I4Lattice MeasureTheory
+open scoped BigOperators
+namespace I4Kernel
+
+def frequencyEquiv (d : ℕ) : SourceMode d ≃ (Fin d → ℤ) :=
+ Equiv.ofBijective (latticeFrequency d) (latticeFrequency_bijective d)
+
+/-- The prescribed normalized full-lattice real Fourier kernel; image/Poisson linkage is separate. -/
+def sourceSpectralKernel (d : ℕ) (L : ℝ) (z : Fin d → ℝ) : ℝ :=
+ ∑' k : Fin d → ℤ, sourceWeight d L k / sourceZ d L * Real.cos (phase d L k z)
+
+private theorem tsum_mode (d : ℕ) (f : SourceMode d → ℝ) (hf : Summable f) :
+ (∑' m, f m) = f none + ∑' k : ↥(halfLattice d),
+ (f (some (k,false)) + f (some (k,true))) := by
+ classical
+ let e := Equiv.optionEquivSumPUnit.{0,0} (↥(halfLattice d) × Bool)
+ have hp : Summable (fun p : ↥(halfLattice d) × Bool => f (some p)) :=
+ hf.comp_injective (Option.some_injective (↥(halfLattice d) × Bool))
+ calc
+ (∑' m, f m) = ∑' q, f (e.symm q) := (e.symm.tsum_eq f).symm
+ _ = (∑' p : ↥(halfLattice d) × Bool, f (some p)) + f none := by
+ rw [Summable.tsum_sum (by simpa [e, Function.comp_def] using hp)
+ (hasSum_fintype _).summable]
+ simp [e]
+ _ = _ := by
+ rw [hp.tsum_prod]
+ simp_rw [tsum_bool]
+ ring
+
+theorem modeProduct_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :
+ Summable (fun m => modeCoefficient d L m x * modeCoefficient d L m y) := by
+ have hc (z : Fin d → ℝ) : Summable (fun m => modeCoefficient d L m z) := by
+ apply Summable.of_norm_bounded (modeMajorant_summable d hL)
+ intro m
+ simpa only [Real.norm_eq_abs] using modeCoefficient_bound d hL m z
+ have hp : Summable (fun p : SourceMode d × SourceMode d =>
+ modeCoefficient d L p.1 x * modeCoefficient d L p.2 y) :=
+ summable_mul_of_summable_norm (hc x).norm (hc y).norm
+ simpa only [Function.comp_def] using hp.comp_injective
+ (show Function.Injective (fun m : SourceMode d => (m,m)) from
+ fun a b h => congrArg Prod.fst h)
+
+theorem spectralKernel_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (z : Fin d → ℝ) :
+ Summable (fun k : Fin d → ℤ =>
+ sourceWeight d L k / sourceZ d L * Real.cos (phase d L k z)) := by
+ have hz := sourceZ_pos d hL
+ apply Summable.of_norm_bounded ((sourceWeight_summable d hL).div_const (sourceZ d L))
+ intro k
+ have hq : 0 ≤ sourceWeight d L k / sourceZ d L := by
+ rw [sourceWeight_eq_physical]
+ exact div_nonneg (Real.exp_pos _).le hz.le
+ rw [norm_mul, Real.norm_eq_abs, abs_of_nonneg hq, Real.norm_eq_abs]
+ simpa only [mul_one] using mul_le_mul_of_nonneg_left (Real.abs_cos_le_one _) hq
+
+theorem coefficientKernel_eq_fullLattice (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :
+ (∑' m, modeCoefficient d L m x * modeCoefficient d L m y) =
+ sourceSpectralKernel d L (x - y) := by
+ classical
+ let g : (Fin d → ℤ) → ℝ := fun k =>
+ sourceWeight d L k / sourceZ d L * Real.cos (phase d L k (x - y))
+ have hg : Summable g := spectralKernel_summable d hL (x - y)
+ have hneg (k : Fin d → ℤ) : g (-k) = g k := by
+ have hp : phase d L (-k) (x - y) = -phase d L k (x - y) := by
+ simp [phase, Finset.sum_neg_distrib]
+ simp only [g, sourceWeight_neg, hp, Real.cos_neg]
+ have hzero : g 0 = 1 / sourceZ d L := by
+ simp [g, sourceWeight_eq_physical, phase]
+ have hc0 : modeCoefficient d L none x * modeCoefficient d L none y = 1 / sourceZ d L := by
+ simp only [modeCoefficient]
+ exact Real.mul_self_sqrt (one_div_nonneg.mpr (sourceZ_pos d hL).le)
+ have hpair (k : ↥(halfLattice d)) :
+ modeCoefficient d L (some (k,false)) x * modeCoefficient d L (some (k,false)) y +
+ modeCoefficient d L (some (k,true)) x * modeCoefficient d L (some (k,true)) y = 2 * g k := by
+ have h := pairedCoefficient_kernel d hL k x y
+ rw [Fintype.sum_bool] at h
+ calc
+ _ = modeCoefficient d L (some (k,true)) x * modeCoefficient d L (some (k,true)) y +
+ modeCoefficient d L (some (k,false)) x * modeCoefficient d L (some (k,false)) y := add_comm _ _
+ _ = _ := h
+ _ = 2 * g k := by dsimp [g]; ring
+ have hleft : (∑' m, modeCoefficient d L m x * modeCoefficient d L m y) =
+ 1 / sourceZ d L + ∑' k : ↥(halfLattice d), 2 * g k := by
+ rw [tsum_mode d _ (modeProduct_summable d hL x y), hc0]
+ congr 1
+ exact tsum_congr hpair
+ have hm : Summable (fun m => g (frequencyEquiv d m)) := (frequencyEquiv d).summable_iff.mpr hg
+ have hright : sourceSpectralKernel d L (x - y) =
+ 1 / sourceZ d L + ∑' k : ↥(halfLattice d), 2 * g k := by
+ change (∑' k, g k) = _
+ rw [← (frequencyEquiv d).tsum_eq g, tsum_mode d _ hm]
+ change g 0 + (∑' k : ↥(halfLattice d), (g k.1 + g (-k.1))) = _
+ rw [hzero]
+ congr 1
+ apply tsum_congr
+ intro k
+ rw [hneg]
+ ring
+ exact hleft.trans hright.symm
+
+theorem spectralKernel_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ sourceSpectralKernel d L 0 = 1 := by
+ unfold sourceSpectralKernel
+ simp only [phase, Pi.zero_apply, mul_zero, Finset.sum_const_zero, Real.cos_zero, mul_one]
+ rw [tsum_div_const]
+ change sourceZ d L / sourceZ d L = 1
+ exact div_self (sourceZ_pos d hL).ne'
+
+end I4Kernel
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceLattice.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceLattice.lean
new file mode 100644
index 000000000..9c1e0557c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceLattice.lean
@@ -0,0 +1,159 @@
+import SourceFourierSeries
+import Mathlib.Data.Finset.Max
+
+noncomputable section
+open I4Foundation I4Weights I4Source MeasureTheory
+open scoped BigOperators
+namespace I4Lattice
+
+def latticeFrequency (d : ℕ) (m : SourceMode d) : Fin d → ℤ :=
+ match m with
+ | none => 0
+ | some (k, b) => if b then -k.1 else k.1
+
+theorem halfLattice_ne_zero (d : ℕ) {k : Fin d → ℤ} (hk : k ∈ halfLattice d) :
+ k ≠ 0 := by
+ rcases hk with ⟨i, hi, _⟩
+ intro h
+ have : k i = 0 := congrFun h i
+ omega
+
+theorem halfLattice_partition (d : ℕ) {k : Fin d → ℤ} (hk : k ≠ 0) :
+ (k ∈ halfLattice d ∨ -k ∈ halfLattice d) ∧
+ ¬ (k ∈ halfLattice d ∧ -k ∈ halfLattice d) := by
+ classical
+ have hex : ∃ i, k i ≠ 0 := by
+ by_contra h
+ push Not at h
+ exact hk (funext h)
+ let s : Finset (Fin d) := Finset.univ.filter (fun i => k i ≠ 0)
+ have hs : s.Nonempty := by
+ obtain ⟨i, hi⟩ := hex
+ exact ⟨i, Finset.mem_filter.mpr ⟨Finset.mem_univ i, hi⟩⟩
+ let i := s.min' hs
+ have hi : k i ≠ 0 := (Finset.mem_filter.mp (Finset.min'_mem s hs)).2
+ have hbefore (j : Fin d) (hj : j < i) : k j = 0 := by
+ by_contra hn
+ have hle := Finset.min'_le s j (Finset.mem_filter.mpr ⟨Finset.mem_univ j, hn⟩)
+ exact (not_le_of_gt hj) hle
+ constructor
+ · rcases lt_or_gt_of_ne hi with hneg | hpos
+ · right
+ refine ⟨i, ?_, ?_⟩
+ · change 0 < -k i
+ omega
+ · intro j hj
+ change -k j = 0
+ rw [hbefore j hj, neg_zero]
+ · exact Or.inl ⟨i, hpos, hbefore⟩
+ · rintro ⟨⟨i, hi, hib⟩, ⟨j, hj, hjb⟩⟩
+ change 0 < -k j at hj
+ rcases lt_trichotomy i j with hij | heq | hji
+ · have h0 := hjb i hij
+ change -k i = 0 at h0
+ omega
+ · subst j
+ omega
+ · have h0 := hib j hji
+ omega
+
+theorem sourceWeight_neg (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :
+ sourceWeight d L (-k) = sourceWeight d L k := by
+ rw [sourceWeight_eq_physical, sourceWeight_eq_physical]
+ simp only [Pi.neg_apply, Int.cast_neg, mul_neg, neg_sq]
+
+theorem phase_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k n : Fin d → ℤ) (x : Fin d → ℝ) :
+ phase d L k (fun i => x i + L * (n i : ℝ)) =
+ phase d L k x + ((∑ i, k i * n i : ℤ) : ℝ) * (2 * Real.pi) := by
+ have he (i : Fin d) : sourceC L * (k i : ℝ) * (x i + L * (n i : ℝ)) =
+ sourceC L * (k i : ℝ) * x i + ((k i * n i : ℤ) : ℝ) * (2 * Real.pi) := by
+ simp only [Int.cast_mul]
+ unfold sourceC
+ field_simp
+ unfold phase
+ simp_rw [he]
+ rw [Finset.sum_add_distrib, ← Finset.sum_mul]
+ simp only [Int.cast_sum]
+
+theorem modeCoefficient_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (m : SourceMode d) (n : Fin d → ℤ) (x : Fin d → ℝ) :
+ modeCoefficient d L m (fun i => x i + L * (n i : ℝ)) =
+ modeCoefficient d L m x := by
+ cases m with
+ | none => rfl
+ | some p =>
+ rcases p with ⟨k,b⟩
+ cases b <;> simp only [modeCoefficient, Bool.false_eq_true, ite_false, ite_true]
+ · rw [phase_lattice_shift d hL, Real.cos_add_int_mul_two_pi]
+ · rw [phase_lattice_shift d hL, Real.sin_add_int_mul_two_pi]
+
+theorem sourceField_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SourceMode d → ℝ) (n : Fin d → ℤ) (x : Fin d → ℝ) :
+ sourceField d L ω (fun i => x i + L * (n i : ℝ)) = sourceField d L ω x := by
+ unfold sourceField scalarSeries
+ apply tsum_congr
+ intro m
+ change modeCoefficient d L m (fun i => x i + L * (n i : ℝ)) * ω m =
+ modeCoefficient d L m x * ω m
+ rw [modeCoefficient_lattice_shift d hL]
+
+theorem pairedCoefficient_kernel (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k : ↥(halfLattice d)) (x y : Fin d → ℝ) :
+ (∑ b : Bool, modeCoefficient d L (some (k,b)) x *
+ modeCoefficient d L (some (k,b)) y) =
+ (2 * sourceWeight d L k / sourceZ d L) * Real.cos (phase d L k (x - y)) := by
+ have hphase : phase d L k (x - y) = phase d L k x - phase d L k y := by
+ simp [phase, mul_sub, Finset.sum_sub_distrib]
+ have hz : 0 ≤ 2 * sourceWeight d L k / sourceZ d L := by
+ rw [sourceWeight_eq_physical]
+ exact div_nonneg (mul_nonneg (by norm_num) (Real.exp_pos _).le) (sourceZ_pos d hL).le
+ rw [Fintype.sum_bool]
+ simp only [modeCoefficient, ite_true, Bool.false_eq_true, ite_false]
+ rw [hphase, Real.cos_sub]
+ calc
+ _ = (Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L)) *
+ (Real.cos (phase d L k x) * Real.cos (phase d L k y) +
+ Real.sin (phase d L k x) * Real.sin (phase d L k y)) := by ring
+ _ = _ := by rw [Real.mul_self_sqrt hz]
+
+theorem latticeFrequency_bijective (d : ℕ) : Function.Bijective (latticeFrequency d) := by
+ classical
+ constructor
+ · intro m n he
+ cases m with
+ | none =>
+ cases n with
+ | none => rfl
+ | some p =>
+ rcases p with ⟨k,b⟩
+ have hk := halfLattice_ne_zero d k.property
+ cases b <;> simp [latticeFrequency] at he <;> exact (hk (by first | exact he | exact he.symm)).elim
+ | some p =>
+ rcases p with ⟨k,b⟩
+ cases n with
+ | none =>
+ have hk := halfLattice_ne_zero d k.property
+ cases b <;> simp [latticeFrequency] at he <;> exact (hk he).elim
+ | some q =>
+ rcases q with ⟨l,c⟩
+ cases b <;> cases c <;> simp only [latticeFrequency, Bool.false_eq_true, ite_false, ite_true] at he
+ · have hkl : k = l := Subtype.ext he
+ subst l
+ rfl
+ · have hn : -k.1 ∈ halfLattice d := by simpa only [he, neg_neg] using l.property
+ exact ((halfLattice_partition d (halfLattice_ne_zero d k.property)).2 ⟨k.property,hn⟩).elim
+ · have hn : -k.1 ∈ halfLattice d := he.symm ▸ l.property
+ exact ((halfLattice_partition d (halfLattice_ne_zero d k.property)).2 ⟨k.property,hn⟩).elim
+ · have hkl : k = l := Subtype.ext (neg_inj.mp he)
+ subst l
+ rfl
+ · intro k
+ by_cases hk : k = 0
+ · exact ⟨none, by simpa [latticeFrequency] using hk.symm⟩
+ · rcases (halfLattice_partition d hk).1 with hp | hn
+ · exact ⟨some (⟨k,hp⟩,false), by simp [latticeFrequency]⟩
+ · exact ⟨some (⟨-k,hn⟩,true), by simp [latticeFrequency]⟩
+
+end I4Lattice
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmooth.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmooth.lean
new file mode 100644
index 000000000..5b1518449
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmooth.lean
@@ -0,0 +1,254 @@
+import SourceC4
+import Mathlib.Data.Nat.Choose.Sum
+
+/-!
+# All-order smoothness of the actual infinite Gaussian Fourier source
+
+This module extends the source-derived polynomial majorant from order four to
+every natural order. It uses the same SourceMode, sourceLaw and sourceField as
+the qualified F7 dependency; no finite-mode approximation or new field is used.
+The good sample predicate is a single countable intersection of explicit
+coefficient summability conditions. Its measurability and probability-law
+restriction are proved in SourceSmoothCarrier.
+
+This is a C261 Stage A prerequisite. It does not identify the spectral covariance
+with Lifetime's theta sum, construct a conditional kernel, or discharge a
+weighted elder, Morse, count/density, or universality conclusion.
+-/
+
+noncomputable section
+open I4Foundation I4Weights I4Source I4C4 MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal
+
+namespace I4Smooth
+
+def orderCoordinateBound (n : ℕ) (a c : ℝ) (k : ℤ) : ℝ :=
+ decay a k * (1 + |c * (k : ℝ)|) ^ n
+
+def orderProductBound (n d : ℕ) (a c : ℝ) (k : Fin d → ℤ) : ℝ :=
+ ∏ i, orderCoordinateBound n a c (k i)
+
+def orderPairedBound (n d : ℕ) (L : ℝ) (k : Fin d → ℤ) : ℝ :=
+ Real.sqrt (2 / sourceZ d L) * orderProductBound n d (sourceA L) (sourceC L) k
+
+def orderModeBound (n d : ℕ) (L : ℝ) (m : SourceMode d) : ℝ :=
+ match m with
+ | none => Real.sqrt (1 / sourceZ d L)
+ | some (k, _) => orderPairedBound n d L k
+
+theorem orderCoordinateBound_summable (n : ℕ) {a c : ℝ} (ha : 0 < a) :
+ Summable (orderCoordinateBound n a c) := by
+ classical
+ let f (r : ℕ) (k : ℤ) : ℝ :=
+ ((n.choose r : ℝ) * |c| ^ (n - r)) * (decay a k * |(k : ℝ)| ^ (n - r))
+ have hf (r : ℕ) : Summable (f r) :=
+ (summable_decay_pow ha (n - r)).mul_left _
+ have hsum (s : Finset ℕ) : Summable (fun k : ℤ => ∑ r ∈ s, f r k) := by
+ induction s using Finset.induction_on with
+ | empty => simpa using (summable_zero : Summable (fun _ : ℤ => (0 : ℝ)))
+ | @insert r s hr ih =>
+ simpa only [Finset.sum_insert hr] using (hf r).add ih
+ convert hsum (Finset.range (n + 1)) using 1
+ funext k
+ unfold orderCoordinateBound
+ rw [add_pow, Finset.mul_sum]
+ apply Finset.sum_congr rfl
+ intro r _
+ simp only [one_pow, one_mul, abs_mul, mul_pow, f]
+ ring
+
+theorem orderProductBound_summable (n d : ℕ) {a c : ℝ} (ha : 0 < a) :
+ Summable (orderProductBound n d a c) := by
+ exact finite_product_summable (orderCoordinateBound_summable n ha)
+ (fun k => by unfold orderCoordinateBound decay; positivity) d
+
+theorem orderPairedBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (orderPairedBound n d L) := by
+ exact (orderProductBound_summable n d (sourceA_pos hL)).mul_left _
+
+theorem orderPairedBound_eq_amplitude (n d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k : Fin d → ℤ) :
+ orderPairedBound n d L k =
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^ n := by
+ have hsqrt : Real.sqrt (sourceWeight d L k) = productDecay d (sourceA L) k := by
+ have hw : sourceWeight d L k = (productDecay d (sourceA L) k) ^ 2 := by
+ rw [sourceWeight, productDecay_eq_exp, productDecay_eq_exp, pow_two, ← Real.exp_add]
+ congr 1
+ ring
+ rw [hw, Real.sqrt_sq_eq_abs, abs_of_nonneg]
+ unfold productDecay decay
+ positivity
+ have hamp : Real.sqrt (2 * sourceWeight d L k / sourceZ d L) =
+ Real.sqrt (2 / sourceZ d L) * productDecay d (sourceA L) k := by
+ have he : 2 * sourceWeight d L k / sourceZ d L =
+ (2 / sourceZ d L) * sourceWeight d L k := by ring
+ rw [he, Real.sqrt_mul (by have := sourceZ_pos d hL; positivity), hsqrt]
+ have hp : orderProductBound n d (sourceA L) (sourceC L) k =
+ productDecay d (sourceA L) k * ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^ n := by
+ exact Finset.prod_mul_distrib
+ rw [orderPairedBound, hp, hamp]
+ ring
+
+theorem orderModeBound_nonneg (n d : ℕ) (L : ℝ) (m : SourceMode d) :
+ 0 ≤ orderModeBound n d L m := by
+ cases m with
+ | none => exact Real.sqrt_nonneg _
+ | some p =>
+ unfold orderModeBound orderPairedBound orderProductBound orderCoordinateBound decay
+ positivity
+
+theorem orderModeBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (orderModeBound n d L) := by
+ classical
+ have hs : Summable (fun k : ↥(halfLattice d) => orderPairedBound n d L k) :=
+ (orderPairedBound_summable n d hL).subtype (halfLattice d)
+ have hb : Summable (fun _ : Bool => (1 : ℝ)) := (hasSum_fintype _).summable
+ have hp : Summable (fun p : ↥(halfLattice d) × Bool => orderPairedBound n d L p.1) := by
+ simpa only [mul_one, Function.comp_def] using hs.mul_of_nonneg hb
+ (fun k => orderModeBound_nonneg n d L (some (k, false))) (fun _ => zero_le_one)
+ let e := Equiv.optionEquivSumPUnit.{0, 0} (↥(halfLattice d) × Bool)
+ apply e.symm.summable_iff.mp
+ apply Summable.sum (fun q => orderModeBound n d L (e.symm q))
+ · simpa [e, Function.comp_def, orderModeBound] using hp
+ · exact (hasSum_fintype _).summable
+
+theorem orderModeBound_four (d : ℕ) (L : ℝ) (m : SourceMode d) :
+ orderModeBound 4 d L m = modeMajorant d L m := by
+ cases m <;> rfl
+
+theorem modeCoefficient_iteratedFDeriv_order_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (m : SourceMode d) (j : ℕ) (x : Fin d → ℝ) :
+ ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ orderModeBound j d L m := by
+ classical
+ cases m with
+ | none =>
+ cases j with
+ | zero =>
+ simpa only [norm_iteratedFDeriv_zero, Real.norm_eq_abs, orderModeBound, modeMajorant] using
+ modeCoefficient_bound d hL none x
+ | succ j =>
+ change ‖iteratedFDeriv ℝ (j + 1)
+ (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L)) x‖ ≤ Real.sqrt (1 / sourceZ d L)
+ rw [iteratedFDeriv_succ_const]
+ simp only [Pi.zero_apply, norm_zero]
+ exact Real.sqrt_nonneg _
+ | some p =>
+ rcases p with ⟨k, b⟩
+ let A := Real.sqrt (2 * sourceWeight d L k / sourceZ d L)
+ let P := ∏ i, (1 + |sourceC L * (k.1 i : ℝ)|)
+ let g : ℝ → ℝ := if b then Real.sin else Real.cos
+ let ell := phaseCLM d L k
+ have hg : ContDiff ℝ j g := by
+ cases b <;> simp only [g, Bool.false_eq_true, ite_false, ite_true] <;> fun_prop
+ have hgc : ContDiff ℝ j (g ∘ ell) := hg.comp_continuousLinearMap
+ have hgn : ‖iteratedFDeriv ℝ j g (ell x)‖ ≤ 1 := by
+ cases b with
+ | false =>
+ simpa only [g, Bool.false_eq_true, ite_false,
+ norm_iteratedFDeriv_eq_norm_iteratedDeriv, Real.norm_eq_abs] using
+ Real.abs_iteratedDeriv_cos_le_one j (ell x)
+ | true =>
+ simpa only [g, ite_true, norm_iteratedFDeriv_eq_norm_iteratedDeriv,
+ Real.norm_eq_abs] using Real.abs_iteratedDeriv_sin_le_one j (ell x)
+ have hl : ‖ell‖ ≤ P := by
+ calc
+ ‖ell‖ ≤ ∑ i, |sourceC L * (k.1 i : ℝ)| := phaseCLM_norm_le d L k
+ _ ≤ 1 + ∑ i, |sourceC L * (k.1 i : ℝ)| := by linarith
+ _ ≤ P := frequency_l1_le_product d _ (fun i => abs_nonneg _)
+ have hpow : ‖ell‖ ^ j ≤ P ^ j := by gcongr
+ have hder : ‖iteratedFDeriv ℝ j (g ∘ ell) x‖ ≤ ‖ell‖ ^ j := by
+ rw [ell.iteratedFDeriv_comp_right hg x le_rfl]
+ calc
+ _ ≤ ‖iteratedFDeriv ℝ j g (ell x)‖ * ∏ _i : Fin j, ‖ell‖ :=
+ (iteratedFDeriv ℝ j g (ell x)).norm_compContinuousLinearMap_le (fun _ => ell)
+ _ ≤ 1 * ∏ _i : Fin j, ‖ell‖ :=
+ mul_le_mul_of_nonneg_right hgn (Finset.prod_nonneg (fun _ _ => norm_nonneg _))
+ _ = ‖ell‖ ^ j := by simp
+ have heq : modeCoefficient d L (some (k, b)) = A • (g ∘ ell) := by
+ funext y
+ cases b <;> simp [modeCoefficient, A, g, Function.comp_apply, Pi.smul_apply,
+ smul_eq_mul, ell, phaseCLM_apply]
+ rw [heq, iteratedFDeriv_const_smul_apply hgc.contDiffAt, norm_smul,
+ Real.norm_eq_abs, abs_of_nonneg (Real.sqrt_nonneg _)]
+ calc
+ _ ≤ A * P ^ j := mul_le_mul_of_nonneg_left (hder.trans hpow) (Real.sqrt_nonneg _)
+ _ = orderModeBound j d L (some (k, b)) := by
+ rw [orderModeBound, orderPairedBound_eq_amplitude j d hL k]
+ simp only [A, P, Finset.prod_pow]
+
+/-- One explicit coefficient event, shared by every derivative order. -/
+def goodSample (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : Prop :=
+ ∀ n : ℕ, Summable (fun m => orderModeBound n d L m * |ω m|)
+
+theorem goodSample_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, goodSample d L ω := by
+ apply ae_all_iff.mpr
+ intro n
+ exact weighted_abs_summable_ae _ (orderModeBound_nonneg n d L)
+ (orderModeBound_summable n d hL)
+
+theorem sourceField_smooth_of_goodSample (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SourceMode d → ℝ) (hω : goodSample d L ω) :
+ ∀ n : ℕ, ContDiff ℝ n (sourceField d L ω) := by
+ intro n
+ have hc (m : SourceMode d) : ContDiff ℝ n (modeCoefficient d L m) := by
+ cases m with
+ | none =>
+ change ContDiff ℝ n (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L))
+ fun_prop
+ | some p =>
+ rcases p with ⟨k, b⟩
+ change ContDiff ℝ n (fun x : Fin d → ℝ =>
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ (if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)))
+ cases b <;> simp [phase] <;> fun_prop
+ change ContDiff ℝ n (fun x => ∑' m, modeCoefficient d L m x * ω m)
+ apply contDiff_tsum (v := fun j m => orderModeBound j d L m * |ω m|)
+ · intro m
+ exact (hc m).mul contDiff_const
+ · intro j _
+ exact hω j
+ · intro j m x hj
+ have hcj : ContDiff ℝ j (modeCoefficient d L m) :=
+ (hc m).of_le (by exact_mod_cast hj)
+ have heq : (fun y => modeCoefficient d L m y * ω m) =
+ ω m • modeCoefficient d L m := by
+ funext y
+ simp [smul_eq_mul, mul_comm]
+ rw [heq, iteratedFDeriv_const_smul_apply hcj.contDiffAt, norm_smul, Real.norm_eq_abs]
+ simpa only [mul_comm] using mul_le_mul_of_nonneg_left
+ (modeCoefficient_iteratedFDeriv_order_bound d hL m j x) (abs_nonneg (ω m))
+
+theorem sourceField_smooth_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L ω) := by
+ filter_upwards [goodSample_ae d hL] with ω hω
+ exact sourceField_smooth_of_goodSample d hL ω hω
+
+/-- The carrier depends only on the coefficient tail; finite coordinate changes
+cannot destroy any derivative-order summability condition. -/
+theorem goodSample_congr_cofinite (d : ℕ) (L : ℝ)
+ (ω η : SourceMode d → ℝ) (hωη : ω =ᶠ[Filter.cofinite] η) :
+ goodSample d L ω ↔ goodSample d L η := by
+ constructor
+ · intro hω n
+ apply (hω n).congr_cofinite
+ filter_upwards [hωη] with m hm
+ rw [hm]
+ · intro hη n
+ apply (hη n).congr_cofinite
+ filter_upwards [hωη.symm] with m hm
+ rw [hm]
+
+theorem goodSample_finite_change_iff (d : ℕ) (L : ℝ)
+ (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))
+ (hωη : ∀ m ∉ s, ω m = η m) :
+ goodSample d L ω ↔ goodSample d L η := by
+ apply goodSample_congr_cofinite d L ω η
+ apply Filter.eventually_cofinite.mpr
+ apply s.finite_toSet.subset
+ intro m hm
+ by_contra hms
+ exact hm (hωη m hms)
+
+end I4Smooth
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothCarrier.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothCarrier.lean
new file mode 100644
index 000000000..cb6f7b108
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothCarrier.lean
@@ -0,0 +1,230 @@
+import SourceSmooth
+import SourceGaussianLaw
+import SourceCovariance
+import SourceTorusC4
+import Mathlib.MeasureTheory.Measure.Restrict
+import Mathlib.MeasureTheory.Measure.Typeclasses.Probability
+import Mathlib.MeasureTheory.Constructions.BorelSpace.Real
+
+/-!
+# A measurable smooth carrier for the actual source law
+
+The carrier consists of the coefficient samples satisfying every explicit
+order-weighted absolute summability condition from SourceSmooth. Its measure is
+the pullback of the existing product Gaussian sourceLaw under literal subtype
+inclusion. Inclusion pushes this measure back to exactly sourceLaw, so finite
+coefficient observations, field evaluation laws, and covariance are unchanged.
+
+The construction concerns the same literal Fourier source, for fixed d and L.
+It does not identify the spectral kernel with a periodized theta kernel, define
+a conditional kernel or a smooth-function-space law, or discharge a Lifetime
+Field adapter, Morse, elder, counting, density, or universality conclusion.
+-/
+
+noncomputable section
+open I4Foundation I4Source I4Smooth I4SourceGaussian I4SourceCovariance I4Kernel
+open I4Torus I4TorusC4 MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal NNReal Manifold Topology
+
+namespace I4SmoothCarrier
+
+/-- The actual common coefficient event, with no smoothness premise added. -/
+def goodSet (d : ℕ) (L : ℝ) : Set (SourceMode d → ℝ) :=
+ {ω | goodSample d L ω}
+
+private def orderAbsNN (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ)
+ (m : SourceMode d) : ℝ≥0 :=
+ ⟨orderModeBound n d L m * |ω m|,
+ mul_nonneg (orderModeBound_nonneg n d L m) (abs_nonneg _)⟩
+
+private def orderAbsTotal (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : ℝ≥0∞ :=
+ ∑' m, (orderAbsNN n d L ω m : ℝ≥0∞)
+
+private theorem orderAbsTotal_ne_top_iff (n d : ℕ) (L : ℝ)
+ (ω : SourceMode d → ℝ) :
+ orderAbsTotal n d L ω ≠ ∞ ↔
+ Summable (fun m => orderModeBound n d L m * |ω m|) := by
+ exact ENNReal.tsum_coe_ne_top_iff_summable_coe (f := orderAbsNN n d L ω)
+
+private theorem orderAbsTotal_measurable (n d : ℕ) (L : ℝ) :
+ Measurable (orderAbsTotal n d L) := by
+ unfold orderAbsTotal
+ simp_rw [ENNReal.tsum_eq_iSup_sum]
+ apply Measurable.iSup
+ intro s
+ apply s.measurable_fun_sum
+ intro m _
+ have hm : Measurable (fun ω : SourceMode d → ℝ => orderAbsNN n d L ω m) := by
+ unfold orderAbsNN
+ exact (show Measurable (fun ω : SourceMode d → ℝ => orderModeBound n d L m * |ω m|) by
+ fun_prop).nnreal_mk
+ exact hm.coe_nnreal_ennreal
+
+theorem goodSet_measurable (d : ℕ) (L : ℝ) : MeasurableSet (goodSet d L) := by
+ have heq : goodSet d L =
+ ⋂ n : ℕ, {ω : SourceMode d → ℝ | orderAbsTotal n d L ω ≠ ∞} := by
+ ext ω
+ simp only [goodSet, Set.mem_setOf_eq, Set.mem_iInter, goodSample]
+ exact forall_congr' fun n => (orderAbsTotal_ne_top_iff n d L ω).symm
+ rw [heq]
+ apply MeasurableSet.iInter
+ intro n
+ convert ((orderAbsTotal_measurable n d L) (measurableSet_singleton ∞)).compl using 1
+ ext ω
+ simp
+
+theorem goodSet_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ω ∈ goodSet d L :=
+ goodSample_ae d hL
+
+theorem goodSet_measure_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ sourceLaw d (goodSet d L) = 1 := by
+ exact (mem_ae_iff_prob_eq_one (goodSet_measurable d L)).mp (goodSet_ae d hL)
+
+/-- A coefficient sample on the explicit all-order summability carrier. -/
+abbrev SmoothSample (d : ℕ) (L : ℝ) := ↥(goodSet d L)
+
+/-- Literal inclusion, retaining every coefficient of the original sample. -/
+def sampleInclusion (d : ℕ) (L : ℝ) : SmoothSample d L → (SourceMode d → ℝ) :=
+ Subtype.val
+
+theorem sampleInclusion_measurable (d : ℕ) (L : ℝ) :
+ Measurable (sampleInclusion d L) :=
+ measurable_subtype_coe
+
+/-- Pull back the original product law; no normalization or new law is chosen. -/
+def smoothLaw (d : ℕ) (L : ℝ) : Measure (SmoothSample d L) :=
+ (sourceLaw d).comap (sampleInclusion d L)
+
+theorem sampleInclusion_map (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ (smoothLaw d L).map (sampleInclusion d L) = sourceLaw d := by
+ change ((sourceLaw d).comap ((↑) : SmoothSample d L → (SourceMode d → ℝ))).map
+ ((↑) : SmoothSample d L → (SourceMode d → ℝ)) = sourceLaw d
+ rw [map_comap_subtype_coe (goodSet_measurable d L),
+ Measure.restrict_eq_self_of_ae_mem (goodSet_ae d hL)]
+
+theorem sampleInclusion_measurePreserving (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ MeasurePreserving (sampleInclusion d L) (smoothLaw d L) (sourceLaw d) :=
+ ⟨sampleInclusion_measurable d L, sampleInclusion_map d hL⟩
+
+theorem smoothLaw_isProbabilityMeasure (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ IsProbabilityMeasure (smoothLaw d L) := by
+ apply (MeasurableEmbedding.subtype_coe (goodSet_measurable d L)).isProbabilityMeasure_comap
+ simpa only [Subtype.range_coe] using goodSet_ae d hL
+
+/-- Every measurable observation has exactly its original pushforward law. -/
+theorem observation_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :
+ (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceLaw d).map X := by
+ change (smoothLaw d L).map (X ∘ sampleInclusion d L) = (sourceLaw d).map X
+ rw [← Measure.map_map hX (sampleInclusion_measurable d L), sampleInclusion_map d hL]
+
+theorem coordinate_marginal (d : ℕ) {L : ℝ} (hL : L ≠ 0) (m : SourceMode d) :
+ (smoothLaw d L).map (fun ω => sampleInclusion d L ω m) = gaussianReal 0 1 := by
+ rw [observation_map_eq d hL (fun ω => ω m) (measurable_pi_apply m)]
+ exact I4Foundation.coordinate_marginal m
+
+theorem finiteCoordinate_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (m : Fin n → SourceMode d) :
+ (smoothLaw d L).map (fun ω j => sampleInclusion d L ω (m j)) =
+ (sourceLaw d).map (fun ω j => ω (m j)) := by
+ exact observation_map_eq d hL _ (Measurable.of_eval (fun j => measurable_pi_apply (m j)))
+
+/-- The unchanged literal real-cover field, evaluated on the carrier. -/
+def smoothSourceField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : Fin d → ℝ) : ℝ :=
+ sourceField d L (sampleInclusion d L ω) x
+
+theorem smoothSourceField_contDiff (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample d L) (n : ℕ) : ContDiff ℝ n (smoothSourceField d L ω) :=
+ sourceField_smooth_of_goodSample d hL (sampleInclusion d L ω) ω.property n
+
+theorem smoothSourceField_smooth (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample d L) : ContDiff ℝ (⊤ : ℕ∞) (smoothSourceField d L ω) :=
+ contDiff_infty.mpr (smoothSourceField_contDiff d hL ω)
+
+theorem smoothSourceField_finiteVector_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (x : Fin n → (Fin d → ℝ)) :
+ (smoothLaw d L).map (fun ω j => smoothSourceField d L ω (x j)) =
+ (sourceLaw d).map (fun ω j => sourceField d L ω (x j)) := by
+ exact observation_map_eq d hL _
+ (Measurable.of_eval (fun j => sourceField_eval_measurable d L (x j)))
+
+theorem smoothSourceField_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (x : Fin n → (Fin d → ℝ)) :
+ HasGaussianLaw (fun ω j => smoothSourceField d L ω (x j)) (smoothLaw d L) := by
+ have hm : Measurable (fun ω j => smoothSourceField d L ω (x j)) :=
+ (Measurable.of_eval (fun j => sourceField_eval_measurable d L (x j))).comp
+ (sampleInclusion_measurable d L)
+ refine ⟨hm.aemeasurable, ?_⟩
+ rw [smoothSourceField_finiteVector_map_eq d hL n x]
+ exact (source_finiteVector_hasGaussianLaw d hL n x).isGaussian_map
+
+theorem covariance_comp_inclusion (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (X Y : (SourceMode d → ℝ) → ℝ) (hX : Measurable X) (hY : Measurable Y) :
+ cov[fun ω => X (sampleInclusion d L ω), fun ω => Y (sampleInclusion d L ω); smoothLaw d L] =
+ cov[X, Y; sourceLaw d] := by
+ have h := covariance_map_fun (μ := smoothLaw d L) (Z := sampleInclusion d L)
+ (X := X) (Y := Y) hX.aestronglyMeasurable hY.aestronglyMeasurable
+ (sampleInclusion_measurable d L).aemeasurable
+ rw [sampleInclusion_map d hL] at h
+ exact h.symm
+
+theorem smoothSourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (x y : Fin d → ℝ) :
+ cov[fun ω => smoothSourceField d L ω x, fun ω => smoothSourceField d L ω y; smoothLaw d L] =
+ sourceSpectralKernel d L (x - y) := by
+ calc
+ _ = cov[fun ω => sourceField d L ω x, fun ω => sourceField d L ω y; sourceLaw d] :=
+ covariance_comp_inclusion d hL _ _ (sourceField_eval_measurable d L x)
+ (sourceField_eval_measurable d L y)
+ _ = _ := sourceField_covariance d hL x y
+
+/-- The unchanged literal torus descent of the same coefficient sample. -/
+def smoothTorusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (ω : SmoothSample d L) (q : SourceTorus d L) : ℝ :=
+ torusSourceField d L (sampleInclusion d L ω) q
+
+attribute [local instance] actualChartedSpace
+
+theorem smoothTorusSourceField_smooth (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (ω : SmoothSample d L) :
+ ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) (⊤ : ℕ∞) (smoothTorusSourceField d L ω) := by
+ let _ := torus_isManifold d L
+ have hs := smoothSourceField_smooth d (Fact.out : 0 < L).ne' ω
+ intro q
+ rw [contMDiffAt_iff_source]
+ have heq : smoothTorusSourceField d L ω ∘ (extChartAt 𝓘(ℝ, Fin d → ℝ) q).symm =
+ smoothSourceField d L ω := by
+ funext x
+ change torusSourceField d L (sampleInclusion d L ω)
+ ((quotientChart d L (chartCenter d L q)).symm x) = _
+ rw [quotientChart_symm]
+ exact torusSourceField_pullback d L (sampleInclusion d L ω) x
+ rw [heq, contMDiffWithinAt_iff_contDiffWithinAt]
+ exact hs.contDiffAt.contDiffWithinAt
+
+theorem smoothTorusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ)
+ [Fact (0 < L)] (n : ℕ) (q : Fin n → SourceTorus d L) :
+ HasGaussianLaw (fun ω j => smoothTorusSourceField d L ω (q j)) (smoothLaw d L) := by
+ have hm : Measurable (fun ω j => smoothTorusSourceField d L ω (q j)) :=
+ (Measurable.of_eval (fun j => torusSourceField_eval_measurable d L (q j))).comp
+ (sampleInclusion_measurable d L)
+ refine ⟨hm.aemeasurable, ?_⟩
+ change IsGaussian ((smoothLaw d L).map
+ (fun ω j => torusSourceField d L (sampleInclusion d L ω) (q j)))
+ rw [observation_map_eq d (Fact.out : 0 < L).ne' _
+ (Measurable.of_eval (fun j => torusSourceField_eval_measurable d L (q j)))]
+ exact (torusSourceField_finiteVector_hasGaussianLaw d L n q).isGaussian_map
+
+theorem smoothTorusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q p : SourceTorus d L) :
+ cov[fun ω => smoothTorusSourceField d L ω q, fun ω => smoothTorusSourceField d L ω p;
+ smoothLaw d L] =
+ sourceSpectralKernel d L (torusRepresentative d L q - torusRepresentative d L p) := by
+ calc
+ _ = cov[fun ω => torusSourceField d L ω q, fun ω => torusSourceField d L ω p; sourceLaw d] :=
+ covariance_comp_inclusion d (Fact.out : 0 < L).ne' _ _
+ (torusSourceField_eval_measurable d L q) (torusSourceField_eval_measurable d L p)
+ _ = _ := torusSourceField_covariance d L q p
+
+end I4SmoothCarrier
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothControls.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothControls.lean
new file mode 100644
index 000000000..febe52a42
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothControls.lean
@@ -0,0 +1,67 @@
+import SourceSmoothCarrier
+
+/-! Discriminating controls for the actual smooth-source construction.
+These controls are proof obligations, not observed runtime outcomes. They require
+orders above four, a common coefficient event, literal source inclusion and exact
+law preservation. They make no conditional-law or theta-kernel claim. -/
+
+noncomputable section
+open I4Source I4Smooth I4SmoothCarrier I4Kernel MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal
+
+namespace I4SmoothControls
+
+/-- The old a.e. order-four theorem cannot fill the all-orders goal. -/
+theorem old_four_does_not_fill_all_orders (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L ω) := by
+ fail_if_success exact I4C4.sourceField_contDiff_ae d hL
+ exact sourceField_smooth_ae d hL
+
+theorem represented_sample_order_five (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample d L) : ContDiff ℝ 5 (smoothSourceField d L ω) :=
+ smoothSourceField_contDiff d hL ω 5
+
+theorem represented_sample_order_thirtyseven (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample d L) : ContDiff ℝ 37 (smoothSourceField d L ω) :=
+ smoothSourceField_contDiff d hL ω 37
+
+/-- Both higher orders hold for every sample of the very same carrier. -/
+theorem one_carrier_for_both_orders (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample d L) :
+ ContDiff ℝ 5 (smoothSourceField d L ω) ∧
+ ContDiff ℝ 37 (smoothSourceField d L ω) :=
+ ⟨represented_sample_order_five d hL ω, represented_sample_order_thirtyseven d hL ω⟩
+
+theorem literal_field_everywhere (d : ℕ) (L : ℝ) (ω : SmoothSample d L)
+ (x : Fin d → ℝ) :
+ smoothSourceField d L ω x = sourceField d L (sampleInclusion d L ω) x := rfl
+
+theorem entire_coefficient_law_preserved (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ (smoothLaw d L).map (sampleInclusion d L) = sourceLaw d :=
+ sampleInclusion_map d hL
+
+theorem arbitrary_observation_law_preserved (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :
+ (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceLaw d).map X :=
+ observation_map_eq d hL X hX
+
+/-- Arbitrarily large changes on a finite block leave the actual carrier intact. -/
+theorem finite_block_changes_preserve_carrier (d : ℕ) (L : ℝ)
+ (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))
+ (hωη : ∀ m ∉ s, ω m = η m) :
+ goodSample d L ω ↔ goodSample d L η :=
+ goodSample_finite_change_iff d L ω η s hωη
+
+/-- The restricted field keeps variance one, which excludes a zero-field substitution. -/
+theorem field_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :
+ cov[fun ω => smoothSourceField d L ω x,
+ fun ω => smoothSourceField d L ω x; smoothLaw d L] = 1 := by
+ rw [smoothSourceField_covariance d hL x x, sub_self, spectralKernel_zero d hL]
+
+/-- The underlying restricted measure has total mass one, without conditioning
+on a finite pin event or normalizing by a weight. -/
+theorem carrier_probability (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ IsProbabilityMeasure (smoothLaw d L) :=
+ smoothLaw_isProbabilityMeasure d hL
+
+end I4SmoothControls
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceTorus.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceTorus.lean
new file mode 100644
index 000000000..b9fe49752
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceTorus.lean
@@ -0,0 +1,111 @@
+import SourceCovariance
+import Mathlib.MeasureTheory.Integral.IntervalIntegral.Periodic
+import Mathlib.Probability.Distributions.Gaussian.IsGaussianProcess.Basic
+
+/-! Literal descent of the existing real-cover field to a product of additive circles.
+The sample law remains sourceLaw. Smooth torus and Banach-valued laws are separate. -/
+noncomputable section
+open I4Foundation I4Weights I4Source I4Lattice I4Kernel I4SourceGaussian I4SourceCovariance
+open MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal NNReal
+
+namespace I4Torus
+
+abbrev SourceTorus (d : ℕ) (L : ℝ) := Fin d → AddCircle L
+
+def torusProjection (d : ℕ) (L : ℝ) (x : Fin d → ℝ) : SourceTorus d L :=
+ fun i => (x i : AddCircle L)
+
+def torusRepresentative (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q : SourceTorus d L) : Fin d → ℝ :=
+ fun i => (AddCircle.equivIco L 0 (q i)).1
+
+def torusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (ω : SourceMode d → ℝ) (q : SourceTorus d L) : ℝ :=
+ sourceField d L ω (torusRepresentative d L q)
+
+theorem torusProjection_measurable (d : ℕ) (L : ℝ) : Measurable (torusProjection d L) := by
+ exact Measurable.of_eval (fun i => AddCircle.measurable_mk'.comp (measurable_pi_apply i))
+
+theorem torusRepresentative_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ Measurable (torusRepresentative d L) := by
+ exact Measurable.of_eval (fun i => measurable_subtype_coe.comp
+ ((AddCircle.measurableEquivIco L 0).measurable.comp (measurable_pi_apply i)))
+
+theorem torusProjection_representative (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q : SourceTorus d L) : torusProjection d L (torusRepresentative d L q) = q := by
+ funext i
+ exact AddCircle.coe_equivIco (p := L) (a := 0) (y := q i)
+
+theorem sourceField_eq_of_torusProjection_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SourceMode d → ℝ) (x y : Fin d → ℝ)
+ (h : torusProjection d L x = torusProjection d L y) :
+ sourceField d L ω x = sourceField d L ω y := by
+ classical
+ have hz (i : Fin d) : ∃ n : ℤ, n • L = y i - x i := by
+ apply (AddCircle.coe_eq_zero_iff (p := L)).mp
+ rw [AddCircle.coe_sub]
+ exact sub_eq_zero.mpr (congrFun h i).symm
+ choose n hn using hz
+ have he : y = fun i => x i + L * (n i : ℝ) := by
+ funext i
+ have hi := hn i
+ rw [zsmul_eq_mul] at hi
+ linarith
+ rw [he]
+ exact (sourceField_lattice_shift d hL ω n x).symm
+
+theorem torusSourceField_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (ω : SourceMode d → ℝ) (x : Fin d → ℝ) :
+ torusSourceField d L ω (torusProjection d L x) = sourceField d L ω x := by
+ exact sourceField_eq_of_torusProjection_eq d (Fact.out : 0 < L).ne' ω
+ (torusRepresentative d L (torusProjection d L x)) x
+ (torusProjection_representative d L (torusProjection d L x))
+
+theorem torusSourceField_eval_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q : SourceTorus d L) : Measurable (fun ω => torusSourceField d L ω q) := by
+ exact sourceField_eval_measurable d L (torusRepresentative d L q)
+
+theorem torusSourceField_joint_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ Measurable (fun p : (SourceMode d → ℝ) × SourceTorus d L =>
+ torusSourceField d L p.1 p.2) := by
+ unfold torusSourceField sourceField scalarSeries
+ apply Measurable.tsum
+ intro m
+ have hm : Continuous (fun x : Fin d → ℝ => modeCoefficient d L m x) := by
+ cases m with
+ | none => simp only [modeCoefficient]; fun_prop
+ | some p =>
+ rcases p with ⟨k,b⟩
+ cases b <;> simp only [modeCoefficient, Bool.false_eq_true, ite_false, ite_true] <;>
+ unfold phase <;> fun_prop
+ exact (hm.measurable.comp ((torusRepresentative_measurable d L).comp measurable_snd)).mul
+ ((measurable_pi_apply m).comp measurable_fst)
+
+theorem torusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (n : ℕ) (q : Fin n → SourceTorus d L) :
+ HasGaussianLaw (fun ω j => torusSourceField d L ω (q j)) (sourceLaw d) := by
+ exact source_finiteVector_hasGaussianLaw d (Fact.out : 0 < L).ne' n
+ (fun j => torusRepresentative d L (q j))
+
+theorem torusSourceField_isGaussianProcess (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ IsGaussianProcess (fun q ω => torusSourceField d L ω q) (sourceLaw d) := by
+ exact (sourceField_isGaussianProcess d (Fact.out : 0 < L).ne').comp_right
+ (torusRepresentative d L)
+
+theorem torusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q p : SourceTorus d L) :
+ cov[fun ω => torusSourceField d L ω q, fun ω => torusSourceField d L ω p; sourceLaw d] =
+ sourceSpectralKernel d L (torusRepresentative d L q - torusRepresentative d L p) := by
+ exact sourceField_covariance d (Fact.out : 0 < L).ne'
+ (torusRepresentative d L q) (torusRepresentative d L p)
+
+theorem torusSourceField_covariance_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (x y : Fin d → ℝ) :
+ cov[fun ω => torusSourceField d L ω (torusProjection d L x),
+ fun ω => torusSourceField d L ω (torusProjection d L y); sourceLaw d] =
+ sourceSpectralKernel d L (x - y) := by
+ simp_rw [torusSourceField_pullback]
+ exact sourceField_covariance d (Fact.out : 0 < L).ne' x y
+
+end I4Torus
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceTorusC4.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceTorusC4.lean
new file mode 100644
index 000000000..30cfb670f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceTorusC4.lean
@@ -0,0 +1,134 @@
+import SourceC4
+import SourceTorus
+import Mathlib.Topology.OpenPartialHomeomorph.Constructions
+import Mathlib.Geometry.Manifold.ContMDiff.Basic
+import Mathlib.Geometry.Manifold.ContMDiff.NormedSpace
+import Mathlib.Topology.LocallyConstant.Basic
+
+noncomputable section
+open I4Foundation I4Weights I4Source I4C4 I4Torus MeasureTheory
+open scoped Manifold ContDiff Topology
+namespace I4TorusC4
+
+def quotientChart (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :
+ OpenPartialHomeomorph (SourceTorus d L) (Fin d → ℝ) :=
+ (OpenPartialHomeomorph.pi (fun i : Fin d => AddCircle.openPartialHomeomorphCoe L (a i))).symm
+
+def chartCenter (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) : Fin d → ℝ :=
+ fun i => torusRepresentative d L q i - L / 2
+
+theorem quotientChart_symm (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :
+ (quotientChart d L a).symm = torusProjection d L := by
+ rfl
+
+theorem centered_chart_covers (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) :
+ q ∈ (quotientChart d L (chartCenter d L q)).source := by
+ let e := OpenPartialHomeomorph.pi
+ (fun i : Fin d => AddCircle.openPartialHomeomorphCoe L (chartCenter d L q i))
+ have hs : torusRepresentative d L q ∈ e.source := by
+ change torusRepresentative d L q ∈ Set.pi Set.univ
+ (fun i => Set.Ioo (chartCenter d L q i) (chartCenter d L q i + L))
+ intro i _
+ change chartCenter d L q i < torusRepresentative d L q i ∧
+ torusRepresentative d L q i < chartCenter d L q i + L
+ have hL : 0 < L := Fact.out
+ dsimp [chartCenter]
+ constructor <;> linarith
+ have he : e (torusRepresentative d L q) = q :=
+ torusProjection_representative d L q
+ have ht := e.map_source hs
+ rw [he] at ht
+ exact ht
+
+@[instance_reducible] def actualChartedSpace (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ ChartedSpace (Fin d → ℝ) (SourceTorus d L) where
+ atlas := Set.range (quotientChart d L)
+ chartAt := fun q => quotientChart d L (chartCenter d L q)
+ mem_chart_source := centered_chart_covers d L
+ chart_mem_atlas := fun q => ⟨chartCenter d L q, rfl⟩
+
+attribute [local instance] actualChartedSpace
+
+theorem chart_transition_contDiff (d : ℕ) (L : ℝ) [Fact (0 < L)] (a b : Fin d → ℝ) :
+ ContDiffOn ℝ ∞ ((quotientChart d L a).symm.trans (quotientChart d L b))
+ ((quotientChart d L a).symm.trans (quotientChart d L b)).source := by
+ let ea := quotientChart d L a
+ let eb := quotientChart d L b
+ let T := ea.symm.trans eb
+ let S := T.source
+ have hproj (x : S) : torusProjection d L (T x) = torusProjection d L x := by
+ have hb : ea.symm (x : Fin d → ℝ) ∈ eb.source := x.property.2
+ have hi := eb.left_inv hb
+ simpa only [T, ea, eb, OpenPartialHomeomorph.trans_apply, quotientChart_symm] using hi
+ have hlat (x : S) (i : Fin d) : T x i - (x : Fin d → ℝ) i ∈
+ AddSubgroup.zmultiples L := by
+ apply AddSubgroup.mem_zmultiples_iff.mpr
+ apply (AddCircle.coe_eq_zero_iff (p := L)).mp
+ rw [AddCircle.coe_sub]
+ exact sub_eq_zero.mpr (congrFun (hproj x) i)
+ let delta : S → Fin d → AddSubgroup.zmultiples L :=
+ fun x i => ⟨T x i - (x : Fin d → ℝ) i, hlat x i⟩
+ have hd : Continuous delta := by
+ apply continuous_pi
+ intro i
+ apply Continuous.subtype_mk
+ exact ((continuous_apply i).comp T.continuousOn.domRestrict).sub
+ ((continuous_apply i).comp continuous_subtype_val)
+ have hlc : IsLocallyConstant delta :=
+ (IsLocallyConstant.iff_continuous delta).mpr hd
+ apply T.open_source.contDiffOn_iff.mpr
+ intro x hx
+ let x0 : S := ⟨x, hx⟩
+ let c : Fin d → ℝ := fun i => (delta x0 i : ℝ)
+ have hsub : ∀ᶠ y : S in 𝓝 x0, T y = (y : Fin d → ℝ) + c := by
+ filter_upwards [hlc.eventually_eq x0] with y hy
+ funext i
+ have hi := congrArg (fun z : Fin d → AddSubgroup.zmultiples L => (z i : ℝ)) hy
+ change T y i - (y : Fin d → ℝ) i = c i at hi
+ change T y i = (y : Fin d → ℝ) i + c i
+ linarith
+ have hamb : (fun y => T y) =ᶠ[𝓝 x] (fun y => y + c) := by
+ have hm : ∀ᶠ y in Filter.map ((↑) : S → (Fin d → ℝ)) (𝓝 x0), T y = y + c :=
+ Filter.eventually_map.mpr hsub
+ have hmap : Filter.map ((↑) : S → (Fin d → ℝ)) (𝓝 x0) = 𝓝 x :=
+ map_nhds_subtype_coe_eq_nhds hx (T.open_source.mem_nhds hx)
+ rw [hmap] at hm
+ exact hm
+ exact (contDiff_id.add contDiff_const).contDiffAt.congr_of_eventuallyEq hamb
+
+theorem torus_isManifold (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ IsManifold 𝓘(ℝ, Fin d → ℝ) ∞ (SourceTorus d L) := by
+ apply isManifold_of_contDiffOn
+ intro e e' he he'
+ change e ∈ Set.range (quotientChart d L) at he
+ change e' ∈ Set.range (quotientChart d L) at he'
+ rcases he with ⟨a, rfl⟩
+ rcases he' with ⟨b, rfl⟩
+ simpa only [modelWithCornersSelf_coe, modelWithCornersSelf_coe_symm,
+ Function.comp_id, Function.id_comp, Set.preimage_id, Set.range_id, Set.inter_univ] using
+ chart_transition_contDiff d L a b
+
+theorem torusSourceField_contMDiff_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ ∀ᵐ sample ∂sourceLaw d,
+ ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) 4 (torusSourceField d L sample) := by
+ let _ := torus_isManifold d L
+ filter_upwards [sourceField_contDiff_ae d (Fact.out : 0 < L).ne'] with sample hs
+ intro q
+ rw [contMDiffAt_iff_source]
+ have heq : torusSourceField d L sample ∘ (extChartAt 𝓘(ℝ, Fin d → ℝ) q).symm =
+ sourceField d L sample := by
+ funext x
+ change torusSourceField d L sample ((quotientChart d L (chartCenter d L q)).symm x) = _
+ rw [quotientChart_symm]
+ exact torusSourceField_pullback d L sample x
+ rw [heq, contMDiffWithinAt_iff_contDiffWithinAt]
+ exact hs.contDiffAt.contDiffWithinAt
+
+theorem torusSourceField_weakSuperlevel_closed_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ ∀ᵐ sample ∂sourceLaw d, ∀ h : ℝ,
+ IsClosed {q : SourceTorus d L | h ≤ torusSourceField d L sample q} := by
+ filter_upwards [torusSourceField_contMDiff_ae d L] with sample hs
+ intro h
+ exact isClosed_Ici.preimage hs.continuous
+
+end I4TorusC4
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SpectralWeights.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SpectralWeights.lean
new file mode 100644
index 000000000..191a22f14
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SpectralWeights.lean
@@ -0,0 +1,160 @@
+import Mathlib.NumberTheory.ModularForms.JacobiTheta.TwoVariable
+import Mathlib.Analysis.Normed.Ring.InfiniteSum
+import Mathlib.Data.Fin.Tuple.Basic
+import Mathlib.Algebra.BigOperators.Fin
+
+/-! Concrete square-root Gaussian spectral majorants for the required I4 bridge.
+The product majorant dominates the l1 frequency norm for the default Pi sup norm.
+This file alone proves neither a Gaussian field law nor sample smoothness. -/
+
+noncomputable section
+open Real
+open scoped BigOperators
+namespace I4Weights
+
+def decay (a : ℝ) (k : ℤ) : ℝ := exp (-a * (k : ℝ) ^ 2)
+def coordinateBound (a c : ℝ) (k : ℤ) : ℝ :=
+ decay a k * (1 + |c * (k : ℝ)|) ^ 4
+def productDecay (d : ℕ) (a : ℝ) (k : Fin d → ℤ) : ℝ :=
+ ∏ i, decay a (k i)
+def productBound (d : ℕ) (a c : ℝ) (k : Fin d → ℤ) : ℝ :=
+ ∏ i, coordinateBound a c (k i)
+def sourceA (L : ℝ) : ℝ := π ^ 2 / L ^ 2
+def sourceC (L : ℝ) : ℝ := 2 * π / L
+def sourceWeight (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : ℝ :=
+ productDecay d (2 * sourceA L) k
+def sourceZ (d : ℕ) (L : ℝ) : ℝ := ∑' k, sourceWeight d L k
+def pairedBound (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : ℝ :=
+ Real.sqrt (2 / sourceZ d L) * productBound d (sourceA L) (sourceC L) k
+
+theorem summable_decay_pow {a : ℝ} (ha : 0 < a) (n : ℕ) :
+ Summable (fun k : ℤ => decay a k * |(k : ℝ)| ^ n) := by
+ have hb := summable_pow_mul_jacobiTheta₂_term_bound 0
+ (show 0 < a / π by positivity) n
+ have he (k : ℤ) : -π * (a / π * (k : ℝ) ^ 2 - 2 * 0 * |(k : ℝ)|) =
+ -a * (k : ℝ) ^ 2 := by
+ field_simp
+ ring
+ simp_rw [Int.cast_abs, he] at hb
+ simpa [decay, mul_comm] using hb
+
+theorem coordinateBound_summable {a c : ℝ} (ha : 0 < a) :
+ Summable (coordinateBound a c) := by
+ have hs := summable_decay_pow ha
+ convert ((((hs 0).add ((hs 1).mul_left (4 * |c|))).add
+ ((hs 2).mul_left (6 * |c| ^ 2))).add
+ ((hs 3).mul_left (4 * |c| ^ 3))).add ((hs 4).mul_left (|c| ^ 4)) using 1
+ funext k
+ simp only [coordinateBound, abs_mul]
+ ring
+
+set_option maxHeartbeats 800000 in
+theorem finite_product_summable {f : ℤ → ℝ} (hf : Summable f) (hn : ∀ k, 0 ≤ f k)
+ (d : ℕ) : Summable (fun k : Fin d → ℤ => ∏ i, f (k i)) := by
+ classical
+ induction d with
+ | zero => exact (hasSum_fintype _).summable
+ | succ d ih =>
+ have hp : Summable (fun p : ℤ × (Fin d → ℤ) => f p.1 * ∏ i, f (p.2 i)) :=
+ Summable.mul_of_nonneg (ι := ℤ) (ι' := Fin d → ℤ)
+ (f := f) (g := fun k : Fin d → ℤ => ∏ i, f (k i))
+ hf ih hn (fun k => Finset.prod_nonneg (fun i _ => hn (k i)))
+ have heq :
+ ((fun k : Fin (d + 1) → ℤ => ∏ i, f (k i)) ∘
+ (Fin.consEquiv (fun _ : Fin (d + 1) => ℤ))) =
+ (fun p : ℤ × (Fin d → ℤ) => f p.1 * ∏ i, f (p.2 i)) := by
+ funext p
+ simp only [Function.comp_apply, Fin.consEquiv_apply, Fin.prod_univ_succ,
+ Fin.cons_zero, Fin.cons_succ]
+ apply (Fin.consEquiv (fun _ : Fin (d + 1) => ℤ)).summable_iff.mp
+ rw [heq]
+ exact hp
+
+theorem productBound_summable {a c : ℝ} (ha : 0 < a) (d : ℕ) :
+ Summable (productBound d a c) := by
+ exact finite_product_summable (coordinateBound_summable ha)
+ (fun k => by unfold coordinateBound decay; positivity) d
+
+theorem productDecay_eq_exp (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :
+ productDecay d a k = exp (-a * ∑ i, (k i : ℝ) ^ 2) := by
+ unfold productDecay decay
+ rw [← Real.exp_sum, ← Finset.mul_sum]
+
+theorem frequency_l1_le_product (d : ℕ) (v : Fin d → ℝ) (hv : ∀ i, 0 ≤ v i) :
+ 1 + ∑ i, v i ≤ ∏ i, (1 + v i) := by
+ classical
+ have H (s : Finset (Fin d)) : 1 + ∑ i ∈ s, v i ≤ ∏ i ∈ s, (1 + v i) := by
+ induction s using Finset.induction_on with
+ | empty => simp
+ | @insert i s hi ih =>
+ rw [Finset.sum_insert hi, Finset.prod_insert hi]
+ have hsum : 0 ≤ ∑ j ∈ s, v j := Finset.sum_nonneg (fun j _ => hv j)
+ calc
+ 1 + (v i + ∑ j ∈ s, v j) ≤ (1 + v i) * (1 + ∑ j ∈ s, v j) := by
+ nlinarith [mul_nonneg (hv i) hsum]
+ _ ≤ (1 + v i) * ∏ j ∈ s, (1 + v j) :=
+ mul_le_mul_of_nonneg_left ih (by linarith [hv i])
+ exact H Finset.univ
+
+theorem sourceA_pos {L : ℝ} (hL : L ≠ 0) : 0 < sourceA L := by
+ unfold sourceA
+ positivity
+
+theorem sourceWeight_eq_physical (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :
+ sourceWeight d L k = exp (-(∑ i, (sourceC L * (k i : ℝ)) ^ 2) / 2) := by
+ have hc : sourceC L ^ 2 = 4 * sourceA L := by
+ unfold sourceC sourceA
+ ring
+ have hs : (∑ i, (sourceC L * (k i : ℝ)) ^ 2) =
+ 4 * sourceA L * ∑ i, (k i : ℝ) ^ 2 := by
+ rw [Finset.mul_sum]
+ apply Finset.sum_congr rfl
+ intro i _
+ rw [mul_pow, hc]
+ rw [sourceWeight, productDecay_eq_exp, hs]
+ congr 1
+ ring
+
+theorem sourceWeight_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (sourceWeight d L) := by
+ have ha : 0 < 2 * sourceA L := mul_pos (by norm_num) (sourceA_pos hL)
+ have hs : Summable (decay (2 * sourceA L)) := by
+ simpa using summable_decay_pow ha 0
+ exact finite_product_summable hs (fun k => (Real.exp_pos _).le) d
+
+theorem sourceZ_pos (d : ℕ) {L : ℝ} (hL : L ≠ 0) : 0 < sourceZ d L := by
+ apply (sourceWeight_summable d hL).tsum_pos
+ (fun k => by unfold sourceWeight productDecay decay; positivity) (fun _ => 0)
+ simp [sourceWeight, productDecay, decay]
+
+theorem pairedBound_eq_amplitude (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : Fin d → ℤ) :
+ pairedBound d L k = Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^ 4 := by
+ have hsqrt : Real.sqrt (sourceWeight d L k) = productDecay d (sourceA L) k := by
+ have hw : sourceWeight d L k = (productDecay d (sourceA L) k) ^ 2 := by
+ rw [sourceWeight, productDecay_eq_exp, productDecay_eq_exp, pow_two, ← Real.exp_add]
+ congr 1
+ ring
+ rw [hw, Real.sqrt_sq_eq_abs, abs_of_nonneg]
+ unfold productDecay decay
+ positivity
+ have hamp : Real.sqrt (2 * sourceWeight d L k / sourceZ d L) =
+ Real.sqrt (2 / sourceZ d L) * productDecay d (sourceA L) k := by
+ have he : 2 * sourceWeight d L k / sourceZ d L =
+ (2 / sourceZ d L) * sourceWeight d L k := by ring
+ rw [he, Real.sqrt_mul (by have := sourceZ_pos d hL; positivity), hsqrt]
+ have hp : productBound d (sourceA L) (sourceC L) k =
+ productDecay d (sourceA L) k * ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^ 4 := by
+ exact Finset.prod_mul_distrib
+ rw [pairedBound, hp, hamp]
+ ring
+
+theorem pairedBound_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (pairedBound d L) := by
+ exact (productBound_summable (sourceA_pos hL) d).mul_left _
+
+theorem pairedBound_subtype_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (S : Set (Fin d → ℤ)) : Summable (fun k : S => pairedBound d L k) := by
+ exact (pairedBound_summable d hL).subtype S
+
+end I4Weights
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/GaussianSeriesFoundation.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/GaussianSeriesFoundation.lean
new file mode 100644
index 000000000..93651da7f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/GaussianSeriesFoundation.lean
@@ -0,0 +1,96 @@
+import Mathlib.Probability.Distributions.Gaussian.Real
+import Mathlib.Probability.Independence.InfinitePi
+import Mathlib.MeasureTheory.Function.LpSpace.InfiniteSum
+import Mathlib.MeasureTheory.Function.LpSeminorm.SMul
+
+/-! The actual product law and the almost-sure absolute-series foundation.
+This does not assert a Fourier covariance, sample smoothness or finite-jet rank. -/
+
+noncomputable section
+
+open MeasureTheory ProbabilityTheory
+open scoped ENNReal
+
+namespace I4Foundation
+
+/-- The same actual probability measure used for every coefficient and series assertion. -/
+def coefficientLaw (ι : Type*) : Measure (ι → ℝ) :=
+ Measure.infinitePi (fun _ : ι => gaussianReal 0 1)
+
+instance coefficientLaw_isProbabilityMeasure (ι : Type*) :
+ IsProbabilityMeasure (coefficientLaw ι) := by
+ unfold coefficientLaw
+ infer_instance
+
+theorem coordinate_measurePreserving {ι : Type*} (i : ι) :
+ MeasurePreserving (fun ω : ι → ℝ => ω i) (coefficientLaw ι)
+ (gaussianReal 0 1) := by
+ exact measurePreserving_eval_infinitePi (fun _ : ι => gaussianReal 0 1) i
+
+theorem coordinate_marginal {ι : Type*} (i : ι) :
+ (coefficientLaw ι).map (fun ω => ω i) = gaussianReal 0 1 := by
+ exact (coordinate_measurePreserving i).map_eq
+
+theorem coordinates_independent (ι : Type*) :
+ iIndepFun (fun i (ω : ι → ℝ) => ω i) (coefficientLaw ι) := by
+ exact iIndepFun_infinitePi (P := fun _ : ι => gaussianReal 0 1)
+ (X := fun _ : ι => id) (fun _ => measurable_id)
+
+theorem coordinate_memLp {ι : Type*} (i : ι) (p : ℝ≥0∞) (hp : p ≠ ∞) :
+ MemLp (fun ω : ι → ℝ => ω i) p (coefficientLaw ι) := by
+ exact (memLp_id_gaussianReal' p hp).comp_measurePreserving
+ (coordinate_measurePreserving i)
+
+theorem coordinate_integrable {ι : Type*} (i : ι) :
+ Integrable (fun ω : ι → ℝ => ω i) (coefficientLaw ι) := by
+ exact memLp_one_iff_integrable.mp (coordinate_memLp i 1 (by simp))
+
+theorem coordinate_abs_integrable {ι : Type*} (i : ι) :
+ Integrable (fun ω : ι → ℝ => |ω i|) (coefficientLaw ι) := by
+ simpa only [Real.norm_eq_abs] using (coordinate_integrable i).norm
+
+theorem weighted_abs_summable_ae {ι : Type*} [Countable ι]
+ (a : ι → ℝ) (ha : ∀ i, 0 ≤ a i) (hs : Summable a) :
+ ∀ᵐ ω ∂coefficientLaw ι, Summable (fun i => a i * |ω i|) := by
+ let C := eLpNorm id 1 (gaussianReal 0 1)
+ have hC : C < ∞ := (memLp_id_gaussianReal' 1 (by simp)).eLpNorm_lt_top
+ have hcoord (i : ι) :
+ eLpNorm (fun ω : ι → ℝ => ω i) 1 (coefficientLaw ι) = C := by
+ exact eLpNorm_comp_measurePreserving
+ (memLp_id_gaussianReal' 1 (by simp)).aestronglyMeasurable
+ (coordinate_measurePreserving i)
+ have hnorm (i : ι) :
+ eLpNorm (fun ω : ι → ℝ => a i * ω i) 1 (coefficientLaw ι) =
+ ENNReal.ofReal (a i) * C := by
+ change eLpNorm (a i • (fun ω : ι → ℝ => ω i)) 1 (coefficientLaw ι) = _
+ rw [eLpNorm_const_smul, Real.enorm_eq_ofReal (ha i), hcoord]
+ have hsum : (∑' i, eLpNorm (fun ω : ι → ℝ => a i * ω i) 1
+ (coefficientLaw ι)) ≠ ∞ := by
+ simp_rw [hnorm]
+ rw [ENNReal.tsum_mul_right]
+ exact ENNReal.mul_ne_top hs.tsum_ofReal_ne_top hC.ne
+ have h := summable_norm_of_tsum_eLpNorm_ne_top (p := 1) (le_refl 1) hsum
+ filter_upwards [h] with ω hω
+ simpa only [Real.norm_eq_abs, abs_mul, abs_of_nonneg (ha _)] using hω
+
+/-- The actual scalar sum; its convergence is proved separately on the product law. -/
+def scalarSeries {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ) : ℝ :=
+ ∑' i, a i * ω i
+
+theorem scalarSeries_measurable {ι : Type*} [Countable ι] (a : ι → ℝ) :
+ Measurable (scalarSeries a) := by
+ unfold scalarSeries
+ apply Measurable.tsum
+ intro i
+ exact measurable_const.mul (measurable_pi_apply i)
+
+theorem scalarSeries_hasSum_ae {ι : Type*} [Countable ι]
+ (a : ι → ℝ) (hs : Summable a) :
+ ∀ᵐ ω ∂coefficientLaw ι, HasSum (fun i => a i * ω i) (scalarSeries a ω) := by
+ filter_upwards [weighted_abs_summable_ae (fun i => |a i|)
+ (fun i => abs_nonneg _) hs.abs] with ω hω
+ have hnorm : Summable (fun i => ‖a i * ω i‖) := by
+ simpa only [Real.norm_eq_abs, abs_mul] using hω
+ exact hnorm.of_norm.hasSum
+
+end I4Foundation
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceC4.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceC4.lean
new file mode 100644
index 000000000..f5188d51c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceC4.lean
@@ -0,0 +1,141 @@
+import SourceFourierSeries
+import Mathlib.Analysis.Calculus.SmoothSeries
+import Mathlib.Analysis.SpecialFunctions.Trigonometric.Deriv
+
+/-! Actual same-sample C4 of the canonical normalized Fourier lift.
+Covariance identification, Gaussian field/jet laws and pin regression are separate. -/
+
+noncomputable section
+open I4Foundation I4Weights I4Source MeasureTheory ProbabilityTheory
+open scoped BigOperators
+
+namespace I4C4
+
+def phaseCLM (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : (Fin d → ℝ) →L[ℝ] ℝ :=
+ ∑ i, (sourceC L * (k i : ℝ)) • ContinuousLinearMap.proj i
+
+theorem phaseCLM_apply (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ) :
+ phaseCLM d L k x = phase d L k x := by
+ simp [phaseCLM, phase]
+
+theorem phaseCLM_norm_le (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :
+ ‖phaseCLM d L k‖ ≤ ∑ i, |sourceC L * (k i : ℝ)| := by
+ apply ContinuousLinearMap.opNorm_le_bound _
+ (Finset.sum_nonneg (fun i _ => abs_nonneg _))
+ intro x
+ rw [phaseCLM_apply]
+ calc
+ ‖phase d L k x‖ ≤ ∑ i, ‖sourceC L * (k i : ℝ) * x i‖ := norm_sum_le _ _
+ _ ≤ ∑ i, |sourceC L * (k i : ℝ)| * ‖x‖ := by
+ apply Finset.sum_le_sum
+ intro i _
+ rw [norm_mul, Real.norm_eq_abs]
+ exact mul_le_mul_of_nonneg_left (norm_le_pi_norm x i) (abs_nonneg _)
+ _ = (∑ i, |sourceC L * (k i : ℝ)|) * ‖x‖ := by rw [Finset.sum_mul]
+
+theorem modeCoefficient_iteratedFDeriv_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (m : SourceMode d) (j : ℕ) (hj : j ≤ 4) (x : Fin d → ℝ) :
+ ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ modeMajorant d L m := by
+ classical
+ cases m with
+ | none =>
+ cases j with
+ | zero =>
+ simpa only [norm_iteratedFDeriv_zero, Real.norm_eq_abs] using
+ modeCoefficient_bound d hL none x
+ | succ j =>
+ change ‖iteratedFDeriv ℝ (j + 1)
+ (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L)) x‖ ≤ Real.sqrt (1 / sourceZ d L)
+ rw [iteratedFDeriv_succ_const]
+ simp only [Pi.zero_apply, norm_zero]
+ exact Real.sqrt_nonneg _
+ | some p =>
+ rcases p with ⟨k, b⟩
+ let A := Real.sqrt (2 * sourceWeight d L k / sourceZ d L)
+ let P := ∏ i, (1 + |sourceC L * (k.1 i : ℝ)|)
+ let g : ℝ → ℝ := if b then Real.sin else Real.cos
+ let ell := phaseCLM d L k
+ have hg : ContDiff ℝ j g := by
+ cases b <;> simp only [g, Bool.false_eq_true, ite_false, ite_true] <;> fun_prop
+ have hgc : ContDiff ℝ j (g ∘ ell) := hg.comp_continuousLinearMap
+ have hgn : ‖iteratedFDeriv ℝ j g (ell x)‖ ≤ 1 := by
+ cases b with
+ | false =>
+ simpa only [g, Bool.false_eq_true, ite_false,
+ norm_iteratedFDeriv_eq_norm_iteratedDeriv, Real.norm_eq_abs] using
+ Real.abs_iteratedDeriv_cos_le_one j (ell x)
+ | true =>
+ simpa only [g, ite_true, norm_iteratedFDeriv_eq_norm_iteratedDeriv,
+ Real.norm_eq_abs] using Real.abs_iteratedDeriv_sin_le_one j (ell x)
+ have hP : 1 ≤ P := by
+ apply Finset.one_le_prod₀
+ intro i _
+ linarith [abs_nonneg (sourceC L * (k.1 i : ℝ))]
+ have hl : ‖ell‖ ≤ P := by
+ calc
+ ‖ell‖ ≤ ∑ i, |sourceC L * (k.1 i : ℝ)| := phaseCLM_norm_le d L k
+ _ ≤ 1 + ∑ i, |sourceC L * (k.1 i : ℝ)| := by linarith
+ _ ≤ P := frequency_l1_le_product d _ (fun i => abs_nonneg _)
+ have hpow : ‖ell‖ ^ j ≤ P ^ 4 := by
+ calc
+ ‖ell‖ ^ j ≤ P ^ j := by gcongr
+ _ ≤ P ^ 4 := pow_le_pow_right₀ hP hj
+ have hder : ‖iteratedFDeriv ℝ j (g ∘ ell) x‖ ≤ ‖ell‖ ^ j := by
+ rw [ell.iteratedFDeriv_comp_right hg x le_rfl]
+ calc
+ _ ≤ ‖iteratedFDeriv ℝ j g (ell x)‖ * ∏ _i : Fin j, ‖ell‖ :=
+ (iteratedFDeriv ℝ j g (ell x)).norm_compContinuousLinearMap_le (fun _ => ell)
+ _ ≤ 1 * ∏ _i : Fin j, ‖ell‖ :=
+ mul_le_mul_of_nonneg_right hgn (Finset.prod_nonneg (fun _ _ => norm_nonneg _))
+ _ = ‖ell‖ ^ j := by simp
+ have heq : modeCoefficient d L (some (k, b)) = A • (g ∘ ell) := by
+ funext y
+ cases b <;> simp [modeCoefficient, A, g, Function.comp_apply, Pi.smul_apply,
+ smul_eq_mul, ell, phaseCLM_apply]
+ rw [heq, iteratedFDeriv_const_smul_apply hgc.contDiffAt, norm_smul,
+ Real.norm_eq_abs, abs_of_nonneg (Real.sqrt_nonneg _)]
+ calc
+ _ ≤ A * P ^ 4 := mul_le_mul_of_nonneg_left (hder.trans hpow) (Real.sqrt_nonneg _)
+ _ = modeMajorant d L (some (k, b)) := by
+ rw [modeMajorant, pairedBound_eq_amplitude d hL k]
+ simp only [A, P, Finset.prod_pow]
+
+theorem sourceField_contDiff_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ContDiff ℝ 4 (sourceField d L ω) := by
+ have hc (m : SourceMode d) : ContDiff ℝ 4 (modeCoefficient d L m) := by
+ cases m with
+ | none =>
+ change ContDiff ℝ 4 (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L))
+ fun_prop
+ | some p =>
+ rcases p with ⟨k, b⟩
+ change ContDiff ℝ 4 (fun x : Fin d → ℝ =>
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ (if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)))
+ cases b <;> simp [phase] <;> fun_prop
+ filter_upwards [sourceMajorant_ae d hL] with ω hω
+ change ContDiff ℝ 4 (fun x => ∑' m, modeCoefficient d L m x * ω m)
+ apply contDiff_tsum (v := fun _ m => modeMajorant d L m * |ω m|)
+ · intro m
+ exact (hc m).mul contDiff_const
+ · intro j hj
+ exact hω
+ · intro j m x hj
+ have hj' : j ≤ 4 := by exact_mod_cast hj
+ have hcj : ContDiff ℝ j (modeCoefficient d L m) :=
+ (hc m).of_le (by exact_mod_cast hj')
+ have heq : (fun y => modeCoefficient d L m y * ω m) = ω m • modeCoefficient d L m := by
+ funext y
+ simp [smul_eq_mul, mul_comm]
+ rw [heq, iteratedFDeriv_const_smul_apply hcj.contDiffAt, norm_smul, Real.norm_eq_abs]
+ simpa only [mul_comm] using mul_le_mul_of_nonneg_left
+ (modeCoefficient_iteratedFDeriv_bound d hL m j hj' x) (abs_nonneg (ω m))
+
+theorem sourceField_contDiff_affine_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ∀ (T : (Fin d → ℝ) →L[ℝ] (Fin d → ℝ)) (a : Fin d → ℝ),
+ ContDiff ℝ 4 (fun x => sourceField d L ω (a + T x)) := by
+ filter_upwards [sourceField_contDiff_ae d hL] with ω hω
+ intro T a
+ exact hω.comp (contDiff_const.add T.contDiff)
+
+end I4C4
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceCovariance.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceCovariance.lean
new file mode 100644
index 000000000..50aa85f30
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceCovariance.lean
@@ -0,0 +1,74 @@
+import SourceKernel
+import SourceGaussianLaw
+import Mathlib.Probability.Moments.Covariance
+import Mathlib.Probability.Moments.Variance
+
+noncomputable section
+open I4Foundation I4Weights I4Source I4Kernel I4SourceGaussian MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal NNReal
+namespace I4SourceCovariance
+
+variable {ι : Type*} [Countable ι]
+
+theorem scalarSeries_covariance (a b : ι → ℝ) (ha : Summable a) (hb : Summable b) :
+ cov[scalarSeries a, scalarSeries b; coefficientLaw ι] = ∑' i, a i * b i := by
+ have hsq (f : ι → ℝ) (hf : Summable f) : Summable (fun i => f i ^ 2) := by
+ have hp := summable_mul_of_summable_norm hf.norm hf.norm
+ simpa only [Function.comp_def, pow_two] using hp.comp_injective
+ (show Function.Injective (fun i : ι => (i,i)) from
+ fun i j h => congrArg Prod.fst h)
+ have hprod : Summable (fun i => a i * b i) := by
+ have hp := summable_mul_of_summable_norm ha.norm hb.norm
+ simpa only [Function.comp_def] using hp.comp_injective
+ (show Function.Injective (fun i : ι => (i,i)) from
+ fun i j h => congrArg Prod.fst h)
+ have hLp (f : ι → ℝ) (hf : Summable f) :
+ MemLp (scalarSeries f) 2 (coefficientLaw ι) := by
+ have h : MemLp id 2 ((coefficientLaw ι).map (scalarSeries f)) := by
+ rw [scalarSeries_map_gaussian f hf]
+ exact memLp_id_gaussianReal' 2 (by norm_num)
+ simpa only [Function.comp_def, Function.id_def] using
+ h.comp_of_map (scalarSeries_measurable f).aemeasurable
+ have heq : scalarSeries (a + b) =ᵐ[coefficientLaw ι]
+ (fun ω => scalarSeries a ω + scalarSeries b ω) := by
+ filter_upwards [scalarSeries_hasSum_ae a ha, scalarSeries_hasSum_ae b hb,
+ scalarSeries_hasSum_ae (a+b) (ha.add hb)] with ω haω hbω habω
+ exact habω.unique (by simpa only [Pi.add_apply, add_mul] using haω.add hbω)
+ have hts : (∑' i, (a i + b i)^2) =
+ (∑' i, a i ^ 2) + 2 * (∑' i, a i * b i) + (∑' i, b i ^ 2) := by
+ calc
+ _ = ∑' i, (a i ^ 2 + 2 * (a i * b i) + b i ^ 2) := by
+ exact tsum_congr (fun i => by ring)
+ _ = _ := by
+ rw [((hsq a ha).add (hprod.mul_left 2)).tsum_add (hsq b hb),
+ (hsq a ha).tsum_add (hprod.mul_left 2), tsum_mul_left]
+ have hv := variance_fun_add (hLp a ha) (hLp b hb)
+ rw [← variance_congr heq, scalarSeries_variance (a+b) (ha.add hb),
+ scalarSeries_variance a ha, scalarSeries_variance b hb] at hv
+ change (∑' i, (a i+b i)^2) = _ at hv
+ rw [hts] at hv
+ linarith
+
+theorem sourceField_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :
+ ∫ ω, sourceField d L ω x ∂sourceLaw d = 0 := by
+ have hc : Summable (fun m => modeCoefficient d L m x) :=
+ (modeMajorant_summable d hL).of_norm_bounded (fun m => by
+ simpa only [Real.norm_eq_abs] using modeCoefficient_bound d hL m x)
+ exact scalarSeries_integral_zero (fun m => modeCoefficient d L m x) hc
+
+theorem sourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :
+ cov[fun ω => sourceField d L ω x, fun ω => sourceField d L ω y; sourceLaw d] =
+ sourceSpectralKernel d L (x - y) := by
+ have hc (z : Fin d → ℝ) : Summable (fun m => modeCoefficient d L m z) :=
+ (modeMajorant_summable d hL).of_norm_bounded (fun m => by
+ simpa only [Real.norm_eq_abs] using modeCoefficient_bound d hL m z)
+ change cov[scalarSeries (fun m => modeCoefficient d L m x),
+ scalarSeries (fun m => modeCoefficient d L m y); coefficientLaw (SourceMode d)] = _
+ rw [scalarSeries_covariance _ _ (hc x) (hc y), coefficientKernel_eq_fullLattice d hL x y]
+
+theorem sourceField_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :
+ Var[fun ω => sourceField d L ω x; sourceLaw d] = 1 := by
+ rw [← covariance_self (sourceField_eval_measurable d L x).aemeasurable,
+ sourceField_covariance d hL x x, sub_self, spectralKernel_zero d hL]
+
+end I4SourceCovariance
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceFourierSeries.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceFourierSeries.lean
new file mode 100644
index 000000000..e4cdec9e6
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceFourierSeries.lean
@@ -0,0 +1,147 @@
+import GaussianSeriesFoundation
+import SpectralWeights
+import Mathlib.Logic.Equiv.Option
+import Mathlib.Topology.Algebra.InfiniteSum.TsumUniformlyOn
+
+/-! Actual canonical real Fourier series and a shared-event uniform convergence bridge.
+The half-lattice partition, covariance, sample C4 and finite-jet law require separate proofs. -/
+
+noncomputable section
+open MeasureTheory ProbabilityTheory I4Foundation I4Weights
+open scoped BigOperators ENNReal
+
+namespace I4Source
+
+/-- The representative whose first nonzero coordinate is positive. -/
+def halfLattice (d : ℕ) : Set (Fin d → ℤ) :=
+ {k | ∃ i, 0 < k i ∧ ∀ j, j < i → k j = 0}
+
+abbrev SourceMode (d : ℕ) := Option (↥(halfLattice d) × Bool)
+
+/-- The actual common law, with independent variance-one real coefficients. -/
+abbrev sourceLaw (d : ℕ) : Measure (SourceMode d → ℝ) :=
+ coefficientLaw (SourceMode d)
+
+def phase (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ) : ℝ :=
+ ∑ i, sourceC L * (k i : ℝ) * x i
+
+/-- False is the cosine coefficient and true the independent sine coefficient. -/
+def modeCoefficient (d : ℕ) (L : ℝ) (m : SourceMode d) (x : Fin d → ℝ) : ℝ :=
+ match m with
+ | none => Real.sqrt (1 / sourceZ d L)
+ | some (k, b) => Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)
+
+def modeMajorant (d : ℕ) (L : ℝ) (m : SourceMode d) : ℝ :=
+ match m with
+ | none => Real.sqrt (1 / sourceZ d L)
+ | some (k, _) => pairedBound d L k
+
+/-- Literal normalized real Fourier sum on the common coefficient samples. -/
+def sourceField (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) (x : Fin d → ℝ) : ℝ :=
+ scalarSeries (fun m => modeCoefficient d L m x) ω
+
+theorem modeMajorant_nonneg (d : ℕ) (L : ℝ) (m : SourceMode d) :
+ 0 ≤ modeMajorant d L m := by
+ cases m with
+ | none => exact Real.sqrt_nonneg _
+ | some p =>
+ change 0 ≤ pairedBound d L p.1
+ unfold pairedBound productBound coordinateBound decay
+ positivity
+
+theorem modeMajorant_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (modeMajorant d L) := by
+ classical
+ have hs := pairedBound_subtype_summable d hL (halfLattice d)
+ have hb : Summable (fun _ : Bool => (1 : ℝ)) := (hasSum_fintype _).summable
+ have hp : Summable (fun p : ↥(halfLattice d) × Bool => pairedBound d L p.1) := by
+ simpa only [mul_one] using hs.mul_of_nonneg hb
+ (fun k => modeMajorant_nonneg d L (some (k, false))) (fun _ => zero_le_one)
+ let e := Equiv.optionEquivSumPUnit.{0, 0} (↥(halfLattice d) × Bool)
+ apply e.symm.summable_iff.mp
+ apply Summable.sum (fun q => modeMajorant d L (e.symm q))
+ · simpa [e, Function.comp_def, modeMajorant] using hp
+ · exact (hasSum_fintype _).summable
+
+theorem modeCoefficient_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (m : SourceMode d) (x : Fin d → ℝ) :
+ |modeCoefficient d L m x| ≤ modeMajorant d L m := by
+ cases m with
+ | none =>
+ exact (abs_of_nonneg (Real.sqrt_nonneg _)).le
+ | some p =>
+ rcases p with ⟨k, b⟩
+ have hprod : 1 ≤ ∏ i, (1 + |sourceC L * (k.val i : ℝ)|) ^ 4 := by
+ apply Finset.one_le_prod₀
+ intro i _
+ apply one_le_pow₀
+ linarith [abs_nonneg (sourceC L * (k.val i : ℝ))]
+ have hamp : Real.sqrt (2 * sourceWeight d L k / sourceZ d L) ≤
+ pairedBound d L k := by
+ rw [pairedBound_eq_amplitude d hL k]
+ simpa only [mul_one] using mul_le_mul_of_nonneg_left hprod
+ (Real.sqrt_nonneg (2 * sourceWeight d L k / sourceZ d L))
+ change |Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ (if b then Real.sin (phase d L k x) else Real.cos (phase d L k x))| ≤ _
+ rw [abs_mul, abs_of_nonneg (Real.sqrt_nonneg _)]
+ have ht : |if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)| ≤ 1 := by
+ cases b with
+ | false => exact Real.abs_cos_le_one _
+ | true => exact Real.abs_sin_le_one _
+ have hbase : Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ |if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)| ≤
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L) := by
+ simpa only [mul_one] using mul_le_mul_of_nonneg_left ht
+ (Real.sqrt_nonneg (2 * sourceWeight d L k / sourceZ d L))
+ exact hbase.trans hamp
+
+theorem sourceField_eval_measurable (d : ℕ) (L : ℝ) (x : Fin d → ℝ) :
+ Measurable (fun ω => sourceField d L ω x) := by
+ exact scalarSeries_measurable _
+
+theorem sourceMajorant_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, Summable (fun m => modeMajorant d L m * |ω m|) := by
+ exact weighted_abs_summable_ae _ (modeMajorant_nonneg d L) (modeMajorant_summable d hL)
+
+theorem sourceAbs_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d,
+ HasSumUniformly (fun m x => |modeCoefficient d L m x * ω m|)
+ (fun x => ∑' m, |modeCoefficient d L m x * ω m|) := by
+ filter_upwards [sourceMajorant_ae d hL] with ω hω
+ apply hasSumUniformly_iff_tendstoUniformly.mpr
+ apply tendstoUniformly_tsum hω
+ intro m x
+ simp only [Real.norm_eq_abs, abs_abs, abs_mul]
+ exact mul_le_mul_of_nonneg_right (modeCoefficient_bound d hL m x) (abs_nonneg _)
+
+theorem sourceField_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d,
+ HasSumUniformly (fun m x => modeCoefficient d L m x * ω m)
+ (sourceField d L ω) := by
+ filter_upwards [sourceMajorant_ae d hL] with ω hω
+ apply hasSumUniformly_iff_tendstoUniformly.mpr
+ apply tendstoUniformly_tsum hω
+ intro m x
+ simp only [Real.norm_eq_abs, abs_mul]
+ exact mul_le_mul_of_nonneg_right (modeCoefficient_bound d hL m x) (abs_nonneg _)
+
+theorem sourceField_continuous_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, Continuous (sourceField d L ω) := by
+ filter_upwards [sourceMajorant_ae d hL] with ω hω
+ change Continuous (fun x => ∑' m, modeCoefficient d L m x * ω m)
+ have hcont (m : SourceMode d) :
+ Continuous (fun x : Fin d → ℝ => modeCoefficient d L m x * ω m) := by
+ cases m with
+ | none =>
+ change Continuous (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L) * ω none)
+ exact continuous_const
+ | some p =>
+ rcases p with ⟨k, b⟩
+ cases b <;> simp [modeCoefficient, phase] <;> fun_prop
+ apply continuous_tsum hcont hω
+ intro m x
+ simp only [Real.norm_eq_abs, abs_mul]
+ exact mul_le_mul_of_nonneg_right (modeCoefficient_bound d hL m x) (abs_nonneg _)
+
+end I4Source
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceGaussianLaw.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceGaussianLaw.lean
new file mode 100644
index 000000000..bb8450b5a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceGaussianLaw.lean
@@ -0,0 +1,189 @@
+import SourceFourierSeries
+import Mathlib.MeasureTheory.Integral.DominatedConvergence
+import Mathlib.Probability.Independence.CharacteristicFunction
+import Mathlib.Probability.Distributions.Gaussian.HasGaussianLaw.Independence
+import Mathlib.Analysis.Normed.Ring.InfiniteSum
+import Mathlib.Probability.Distributions.Gaussian.IsGaussianProcess.Def
+
+/-! Actual Gaussian laws of summable coefficient series and finite evaluation combinations.
+No covariance/source-kernel, torus, derivative-jet, or pinned-law conclusion is assumed. -/
+
+noncomputable section
+open I4Foundation I4Weights I4Source MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal NNReal Topology
+
+namespace I4SourceGaussian
+
+variable {ι : Type*}
+
+private theorem summable_square (a : ι → ℝ) (ha : Summable a) :
+ Summable (fun i => a i ^ 2) := by
+ have h := summable_mul_of_summable_norm ha.norm ha.norm
+ simpa only [Function.comp_def, pow_two] using h.comp_injective
+ (show Function.Injective (fun i : ι => (i, i)) from
+ fun i j hij => congrArg Prod.fst hij)
+
+variable [Countable ι]
+
+omit [Countable ι] in
+private theorem partial_charFun (a : ι → ℝ) (s : Finset ι) (t : ℝ) :
+ charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t =
+ Complex.exp (-((∑ i ∈ s, a i ^ 2 : ℝ) : ℂ) * (t : ℂ) ^ 2 / 2) := by
+ classical
+ have hi : iIndepFun (fun i (ω : ι → ℝ) => a i * ω i) (coefficientLaw ι) :=
+ (coordinates_independent ι).comp (fun i y => a i * y) (fun _ => by fun_prop)
+ have hm (i : ι) : Measurable (fun ω : ι → ℝ => a i * ω i) :=
+ measurable_const.mul (measurable_pi_apply i)
+ have hchar (i : ι) : charFun ((coefficientLaw ι).map
+ (fun ω : ι → ℝ => a i * ω i)) t =
+ Complex.exp (-((a i : ℂ) * (t : ℂ)) ^ 2 / 2) := by
+ rw [charFun_map_mul_comp (f := fun ω : ι → ℝ => ω i)
+ (measurable_pi_apply i).aemeasurable, coordinate_marginal, charFun_gaussianReal]
+ simp only [Complex.ofReal_mul, mul_zero, Complex.ofReal_zero, zero_mul,
+ NNReal.coe_one, Complex.ofReal_one, one_mul, zero_sub]
+ congr 1
+ ring
+ rw [(hi.restrict s).charFun_map_fun_finsetSum_eq_prod (fun i _ => (hm i).aemeasurable)]
+ simp only [Finset.prod_apply]
+ simp_rw [hchar]
+ rw [← Complex.exp_sum]
+ congr 1
+ push_cast
+ simp only [mul_pow]
+ rw [← Finset.sum_div, Finset.sum_neg_distrib, ← Finset.sum_mul]
+ rw [neg_mul]
+
+private theorem charFun_partial_tendsto (a : ι → ℝ) (ha : Summable a) (t : ℝ) :
+ Filter.Tendsto
+ (fun s : Finset ι => charFun ((coefficientLaw ι).map
+ (fun ω => ∑ i ∈ s, a i * ω i)) t)
+ Filter.atTop (𝓝 (charFun ((coefficientLaw ι).map (scalarSeries a)) t)) := by
+ classical
+ have hm (s : Finset ι) : Measurable (fun ω : ι → ℝ => ∑ i ∈ s, a i * ω i) :=
+ Finset.measurable_sum s (fun i _ => measurable_const.mul (measurable_pi_apply i))
+ have heq (s : Finset ι) :
+ charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t =
+ ∫ ω, Complex.exp (((t * ∑ i ∈ s, a i * ω i : ℝ) : ℂ) * Complex.I)
+ ∂coefficientLaw ι := by
+ rw [charFun_apply_real, integral_map (hm s).aemeasurable (by fun_prop)]
+ push_cast
+ rfl
+ have heq' : charFun ((coefficientLaw ι).map (scalarSeries a)) t =
+ ∫ ω, Complex.exp (((t * scalarSeries a ω : ℝ) : ℂ) * Complex.I)
+ ∂coefficientLaw ι := by
+ rw [charFun_apply_real, integral_map (scalarSeries_measurable a).aemeasurable
+ (by fun_prop)]
+ push_cast
+ rfl
+ simp_rw [heq, heq']
+ apply tendsto_integral_filter_of_norm_le_const
+ · filter_upwards with s
+ have hc : Continuous (fun q : ℝ => Complex.exp (((t * q : ℝ) : ℂ) * Complex.I)) :=
+ by fun_prop
+ exact (hc.measurable.comp (hm s)).aestronglyMeasurable
+ · refine ⟨1, Filter.Eventually.of_forall (fun s => ?_)⟩
+ filter_upwards with ω
+ rw [Complex.norm_exp_ofReal_mul_I]
+ · filter_upwards [scalarSeries_hasSum_ae a ha] with ω hω
+ exact ((by fun_prop : Continuous (fun q : ℝ =>
+ Complex.exp (((t * q : ℝ) : ℂ) * Complex.I))).tendsto _).comp hω
+
+theorem scalarSeries_map_gaussian (a : ι → ℝ) (ha : Summable a) :
+ (coefficientLaw ι).map (scalarSeries a) =
+ gaussianReal 0 (∑' i, a i ^ 2).toNNReal := by
+ apply Measure.ext_of_charFun
+ funext t
+ have h1 := charFun_partial_tendsto a ha t
+ have h2 : Filter.Tendsto (fun s : Finset ι =>
+ charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t)
+ Filter.atTop (𝓝 (Complex.exp (-((∑' i, a i ^ 2 : ℝ) : ℂ) * (t : ℂ)^2 / 2))) := by
+ simp_rw [partial_charFun]
+ exact ((by fun_prop : Continuous (fun q : ℝ =>
+ Complex.exp (-(q : ℂ) * (t : ℂ)^2 / 2))).tendsto _).comp
+ (summable_square a ha).hasSum
+ rw [tendsto_nhds_unique h1 h2, charFun_gaussianReal]
+ rw [Real.coe_toNNReal _ (tsum_nonneg (fun i => sq_nonneg (a i)))]
+ congr 1
+ push_cast
+ ring
+
+theorem scalarSeries_integral_zero (a : ι → ℝ) (ha : Summable a) :
+ ∫ ω, scalarSeries a ω ∂coefficientLaw ι = 0 := by
+ have h := integral_id_gaussianReal (μ := 0) (v := (∑' i, a i ^ 2).toNNReal)
+ rw [← scalarSeries_map_gaussian a ha,
+ integral_map (scalarSeries_measurable a).aemeasurable (by fun_prop)] at h
+ exact h
+
+theorem scalarSeries_variance (a : ι → ℝ) (ha : Summable a) :
+ Var[scalarSeries a; coefficientLaw ι] = ∑' i, a i ^ 2 := by
+ rw [← variance_id_map (scalarSeries_measurable a).aemeasurable,
+ scalarSeries_map_gaussian a ha, variance_id_gaussianReal]
+ exact Real.coe_toNNReal _ (tsum_nonneg (fun i => sq_nonneg (a i)))
+
+theorem source_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (x : Fin n → (Fin d → ℝ)) (c : Fin n → ℝ) :
+ HasGaussianLaw (fun ω => ∑ j, c j * sourceField d L ω (x j)) (sourceLaw d) := by
+ classical
+ have hc (j : Fin n) : Summable (fun m => modeCoefficient d L m (x j)) :=
+ (modeMajorant_summable d hL).of_norm_bounded (fun m => by
+ simpa only [Real.norm_eq_abs] using modeCoefficient_bound d hL m (x j))
+ let a : SourceMode d → ℝ := fun m => ∑ j, c j * modeCoefficient d L m (x j)
+ have ha : Summable a := by
+ exact summable_sum (fun j _ => (hc j).mul_left (c j))
+ have hG : HasGaussianLaw (scalarSeries a) (sourceLaw d) := by
+ constructor
+ · exact (scalarSeries_measurable a).aemeasurable
+ · change IsGaussian ((coefficientLaw (SourceMode d)).map (scalarSeries a))
+ rw [scalarSeries_map_gaussian a ha]
+ infer_instance
+ apply hG.congr
+ filter_upwards [ae_all_iff.2 (fun j : Fin n =>
+ scalarSeries_hasSum_ae (fun m => modeCoefficient d L m (x j)) (hc j)),
+ scalarSeries_hasSum_ae a ha] with ω hω hsum
+ have h : HasSum (fun m => ∑ j, c j * modeCoefficient d L m (x j) * ω m)
+ (∑ j, c j * sourceField d L ω (x j)) := by
+ simpa only [sourceField, mul_assoc] using hasSum_sum (fun j _ => (hω j).mul_left (c j))
+ exact hsum.unique (by simpa only [a, Finset.sum_mul] using h)
+
+theorem source_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (x : Fin n → (Fin d → ℝ)) :
+ HasGaussianLaw (fun ω j => sourceField d L ω (x j)) (sourceLaw d) := by
+ classical
+ have hm : Measurable (fun ω j => sourceField d L ω (x j)) :=
+ Measurable.of_eval (fun j => sourceField_eval_measurable d L (x j))
+ refine ⟨hm.aemeasurable, ?_⟩
+ apply isGaussian_of_map_eq_gaussianReal
+ intro ell
+ let c : Fin n → ℝ := fun j => ell (Pi.single j 1)
+ have hrep (v : Fin n → ℝ) : ell v = ∑ j, c j * v j := by
+ rw [← LinearMap.sum_single_apply (fun _ : Fin n => ℝ) v, map_sum]
+ apply Finset.sum_congr rfl
+ intro j _
+ have hs : Pi.single j (v j) = v j • Pi.single j (1 : ℝ) := by
+ rw [← Pi.single_smul, smul_eq_mul, mul_one]
+ rw [hs, map_smul]
+ simp [c, smul_eq_mul, mul_comm]
+ have hg : HasGaussianLaw (fun ω => ell (fun j => sourceField d L ω (x j)))
+ (sourceLaw d) :=
+ (source_linearCombination_hasGaussianLaw d hL n x c).congr
+ (Filter.Eventually.of_forall (fun ω => (hrep _).symm))
+ refine ⟨(sourceLaw d)[fun ω => ell (fun j => sourceField d L ω (x j))],
+ Var[fun ω => ell (fun j => sourceField d L ω (x j)); sourceLaw d].toNNReal, ?_⟩
+ rw [Measure.map_map ell.continuous.measurable hm]
+ exact hg.map_eq_gaussianReal
+
+theorem sourceField_isGaussianProcess (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ IsGaussianProcess (fun x ω => sourceField d L ω x) (sourceLaw d) := by
+ classical
+ constructor
+ intro I
+ let e : ↥I ≃ Fin (Fintype.card ↥I) := Fintype.equivFin ↥I
+ let x : Fin (Fintype.card ↥I) → (Fin d → ℝ) := fun j => (e.symm j).1
+ let R : (Fin (Fintype.card ↥I) → ℝ) →L[ℝ] (↥I → ℝ) :=
+ ContinuousLinearMap.pi (fun i => ContinuousLinearMap.proj (e i))
+ apply ((source_finiteVector_hasGaussianLaw d hL _ x).map_fun R).congr
+ filter_upwards with ω
+ funext i
+ simp [R, x]
+
+end I4SourceGaussian
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceKernel.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceKernel.lean
new file mode 100644
index 000000000..5d5602ac7
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceKernel.lean
@@ -0,0 +1,112 @@
+import SourceLattice
+import Mathlib.Analysis.Normed.Ring.InfiniteSum
+
+noncomputable section
+open I4Foundation I4Weights I4Source I4Lattice MeasureTheory
+open scoped BigOperators
+namespace I4Kernel
+
+def frequencyEquiv (d : ℕ) : SourceMode d ≃ (Fin d → ℤ) :=
+ Equiv.ofBijective (latticeFrequency d) (latticeFrequency_bijective d)
+
+/-- The prescribed normalized full-lattice real Fourier kernel; image/Poisson linkage is separate. -/
+def sourceSpectralKernel (d : ℕ) (L : ℝ) (z : Fin d → ℝ) : ℝ :=
+ ∑' k : Fin d → ℤ, sourceWeight d L k / sourceZ d L * Real.cos (phase d L k z)
+
+private theorem tsum_mode (d : ℕ) (f : SourceMode d → ℝ) (hf : Summable f) :
+ (∑' m, f m) = f none + ∑' k : ↥(halfLattice d),
+ (f (some (k,false)) + f (some (k,true))) := by
+ classical
+ let e := Equiv.optionEquivSumPUnit.{0,0} (↥(halfLattice d) × Bool)
+ have hp : Summable (fun p : ↥(halfLattice d) × Bool => f (some p)) :=
+ hf.comp_injective (Option.some_injective (↥(halfLattice d) × Bool))
+ calc
+ (∑' m, f m) = ∑' q, f (e.symm q) := (e.symm.tsum_eq f).symm
+ _ = (∑' p : ↥(halfLattice d) × Bool, f (some p)) + f none := by
+ rw [Summable.tsum_sum (by simpa [e, Function.comp_def] using hp)
+ (hasSum_fintype _).summable]
+ simp [e]
+ _ = _ := by
+ rw [hp.tsum_prod]
+ simp_rw [tsum_bool]
+ ring
+
+theorem modeProduct_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :
+ Summable (fun m => modeCoefficient d L m x * modeCoefficient d L m y) := by
+ have hc (z : Fin d → ℝ) : Summable (fun m => modeCoefficient d L m z) := by
+ apply Summable.of_norm_bounded (modeMajorant_summable d hL)
+ intro m
+ simpa only [Real.norm_eq_abs] using modeCoefficient_bound d hL m z
+ have hp : Summable (fun p : SourceMode d × SourceMode d =>
+ modeCoefficient d L p.1 x * modeCoefficient d L p.2 y) :=
+ summable_mul_of_summable_norm (hc x).norm (hc y).norm
+ simpa only [Function.comp_def] using hp.comp_injective
+ (show Function.Injective (fun m : SourceMode d => (m,m)) from
+ fun a b h => congrArg Prod.fst h)
+
+theorem spectralKernel_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (z : Fin d → ℝ) :
+ Summable (fun k : Fin d → ℤ =>
+ sourceWeight d L k / sourceZ d L * Real.cos (phase d L k z)) := by
+ have hz := sourceZ_pos d hL
+ apply Summable.of_norm_bounded ((sourceWeight_summable d hL).div_const (sourceZ d L))
+ intro k
+ have hq : 0 ≤ sourceWeight d L k / sourceZ d L := by
+ rw [sourceWeight_eq_physical]
+ exact div_nonneg (Real.exp_pos _).le hz.le
+ rw [norm_mul, Real.norm_eq_abs, abs_of_nonneg hq, Real.norm_eq_abs]
+ simpa only [mul_one] using mul_le_mul_of_nonneg_left (Real.abs_cos_le_one _) hq
+
+theorem coefficientKernel_eq_fullLattice (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :
+ (∑' m, modeCoefficient d L m x * modeCoefficient d L m y) =
+ sourceSpectralKernel d L (x - y) := by
+ classical
+ let g : (Fin d → ℤ) → ℝ := fun k =>
+ sourceWeight d L k / sourceZ d L * Real.cos (phase d L k (x - y))
+ have hg : Summable g := spectralKernel_summable d hL (x - y)
+ have hneg (k : Fin d → ℤ) : g (-k) = g k := by
+ have hp : phase d L (-k) (x - y) = -phase d L k (x - y) := by
+ simp [phase, Finset.sum_neg_distrib]
+ simp only [g, sourceWeight_neg, hp, Real.cos_neg]
+ have hzero : g 0 = 1 / sourceZ d L := by
+ simp [g, sourceWeight_eq_physical, phase]
+ have hc0 : modeCoefficient d L none x * modeCoefficient d L none y = 1 / sourceZ d L := by
+ simp only [modeCoefficient]
+ exact Real.mul_self_sqrt (one_div_nonneg.mpr (sourceZ_pos d hL).le)
+ have hpair (k : ↥(halfLattice d)) :
+ modeCoefficient d L (some (k,false)) x * modeCoefficient d L (some (k,false)) y +
+ modeCoefficient d L (some (k,true)) x * modeCoefficient d L (some (k,true)) y = 2 * g k := by
+ have h := pairedCoefficient_kernel d hL k x y
+ rw [Fintype.sum_bool] at h
+ calc
+ _ = modeCoefficient d L (some (k,true)) x * modeCoefficient d L (some (k,true)) y +
+ modeCoefficient d L (some (k,false)) x * modeCoefficient d L (some (k,false)) y := add_comm _ _
+ _ = _ := h
+ _ = 2 * g k := by dsimp [g]; ring
+ have hleft : (∑' m, modeCoefficient d L m x * modeCoefficient d L m y) =
+ 1 / sourceZ d L + ∑' k : ↥(halfLattice d), 2 * g k := by
+ rw [tsum_mode d _ (modeProduct_summable d hL x y), hc0]
+ congr 1
+ exact tsum_congr hpair
+ have hm : Summable (fun m => g (frequencyEquiv d m)) := (frequencyEquiv d).summable_iff.mpr hg
+ have hright : sourceSpectralKernel d L (x - y) =
+ 1 / sourceZ d L + ∑' k : ↥(halfLattice d), 2 * g k := by
+ change (∑' k, g k) = _
+ rw [← (frequencyEquiv d).tsum_eq g, tsum_mode d _ hm]
+ change g 0 + (∑' k : ↥(halfLattice d), (g k.1 + g (-k.1))) = _
+ rw [hzero]
+ congr 1
+ apply tsum_congr
+ intro k
+ rw [hneg]
+ ring
+ exact hleft.trans hright.symm
+
+theorem spectralKernel_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ sourceSpectralKernel d L 0 = 1 := by
+ unfold sourceSpectralKernel
+ simp only [phase, Pi.zero_apply, mul_zero, Finset.sum_const_zero, Real.cos_zero, mul_one]
+ rw [tsum_div_const]
+ change sourceZ d L / sourceZ d L = 1
+ exact div_self (sourceZ_pos d hL).ne'
+
+end I4Kernel
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceLattice.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceLattice.lean
new file mode 100644
index 000000000..9c1e0557c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceLattice.lean
@@ -0,0 +1,159 @@
+import SourceFourierSeries
+import Mathlib.Data.Finset.Max
+
+noncomputable section
+open I4Foundation I4Weights I4Source MeasureTheory
+open scoped BigOperators
+namespace I4Lattice
+
+def latticeFrequency (d : ℕ) (m : SourceMode d) : Fin d → ℤ :=
+ match m with
+ | none => 0
+ | some (k, b) => if b then -k.1 else k.1
+
+theorem halfLattice_ne_zero (d : ℕ) {k : Fin d → ℤ} (hk : k ∈ halfLattice d) :
+ k ≠ 0 := by
+ rcases hk with ⟨i, hi, _⟩
+ intro h
+ have : k i = 0 := congrFun h i
+ omega
+
+theorem halfLattice_partition (d : ℕ) {k : Fin d → ℤ} (hk : k ≠ 0) :
+ (k ∈ halfLattice d ∨ -k ∈ halfLattice d) ∧
+ ¬ (k ∈ halfLattice d ∧ -k ∈ halfLattice d) := by
+ classical
+ have hex : ∃ i, k i ≠ 0 := by
+ by_contra h
+ push Not at h
+ exact hk (funext h)
+ let s : Finset (Fin d) := Finset.univ.filter (fun i => k i ≠ 0)
+ have hs : s.Nonempty := by
+ obtain ⟨i, hi⟩ := hex
+ exact ⟨i, Finset.mem_filter.mpr ⟨Finset.mem_univ i, hi⟩⟩
+ let i := s.min' hs
+ have hi : k i ≠ 0 := (Finset.mem_filter.mp (Finset.min'_mem s hs)).2
+ have hbefore (j : Fin d) (hj : j < i) : k j = 0 := by
+ by_contra hn
+ have hle := Finset.min'_le s j (Finset.mem_filter.mpr ⟨Finset.mem_univ j, hn⟩)
+ exact (not_le_of_gt hj) hle
+ constructor
+ · rcases lt_or_gt_of_ne hi with hneg | hpos
+ · right
+ refine ⟨i, ?_, ?_⟩
+ · change 0 < -k i
+ omega
+ · intro j hj
+ change -k j = 0
+ rw [hbefore j hj, neg_zero]
+ · exact Or.inl ⟨i, hpos, hbefore⟩
+ · rintro ⟨⟨i, hi, hib⟩, ⟨j, hj, hjb⟩⟩
+ change 0 < -k j at hj
+ rcases lt_trichotomy i j with hij | heq | hji
+ · have h0 := hjb i hij
+ change -k i = 0 at h0
+ omega
+ · subst j
+ omega
+ · have h0 := hib j hji
+ omega
+
+theorem sourceWeight_neg (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :
+ sourceWeight d L (-k) = sourceWeight d L k := by
+ rw [sourceWeight_eq_physical, sourceWeight_eq_physical]
+ simp only [Pi.neg_apply, Int.cast_neg, mul_neg, neg_sq]
+
+theorem phase_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k n : Fin d → ℤ) (x : Fin d → ℝ) :
+ phase d L k (fun i => x i + L * (n i : ℝ)) =
+ phase d L k x + ((∑ i, k i * n i : ℤ) : ℝ) * (2 * Real.pi) := by
+ have he (i : Fin d) : sourceC L * (k i : ℝ) * (x i + L * (n i : ℝ)) =
+ sourceC L * (k i : ℝ) * x i + ((k i * n i : ℤ) : ℝ) * (2 * Real.pi) := by
+ simp only [Int.cast_mul]
+ unfold sourceC
+ field_simp
+ unfold phase
+ simp_rw [he]
+ rw [Finset.sum_add_distrib, ← Finset.sum_mul]
+ simp only [Int.cast_sum]
+
+theorem modeCoefficient_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (m : SourceMode d) (n : Fin d → ℤ) (x : Fin d → ℝ) :
+ modeCoefficient d L m (fun i => x i + L * (n i : ℝ)) =
+ modeCoefficient d L m x := by
+ cases m with
+ | none => rfl
+ | some p =>
+ rcases p with ⟨k,b⟩
+ cases b <;> simp only [modeCoefficient, Bool.false_eq_true, ite_false, ite_true]
+ · rw [phase_lattice_shift d hL, Real.cos_add_int_mul_two_pi]
+ · rw [phase_lattice_shift d hL, Real.sin_add_int_mul_two_pi]
+
+theorem sourceField_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SourceMode d → ℝ) (n : Fin d → ℤ) (x : Fin d → ℝ) :
+ sourceField d L ω (fun i => x i + L * (n i : ℝ)) = sourceField d L ω x := by
+ unfold sourceField scalarSeries
+ apply tsum_congr
+ intro m
+ change modeCoefficient d L m (fun i => x i + L * (n i : ℝ)) * ω m =
+ modeCoefficient d L m x * ω m
+ rw [modeCoefficient_lattice_shift d hL]
+
+theorem pairedCoefficient_kernel (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k : ↥(halfLattice d)) (x y : Fin d → ℝ) :
+ (∑ b : Bool, modeCoefficient d L (some (k,b)) x *
+ modeCoefficient d L (some (k,b)) y) =
+ (2 * sourceWeight d L k / sourceZ d L) * Real.cos (phase d L k (x - y)) := by
+ have hphase : phase d L k (x - y) = phase d L k x - phase d L k y := by
+ simp [phase, mul_sub, Finset.sum_sub_distrib]
+ have hz : 0 ≤ 2 * sourceWeight d L k / sourceZ d L := by
+ rw [sourceWeight_eq_physical]
+ exact div_nonneg (mul_nonneg (by norm_num) (Real.exp_pos _).le) (sourceZ_pos d hL).le
+ rw [Fintype.sum_bool]
+ simp only [modeCoefficient, ite_true, Bool.false_eq_true, ite_false]
+ rw [hphase, Real.cos_sub]
+ calc
+ _ = (Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L)) *
+ (Real.cos (phase d L k x) * Real.cos (phase d L k y) +
+ Real.sin (phase d L k x) * Real.sin (phase d L k y)) := by ring
+ _ = _ := by rw [Real.mul_self_sqrt hz]
+
+theorem latticeFrequency_bijective (d : ℕ) : Function.Bijective (latticeFrequency d) := by
+ classical
+ constructor
+ · intro m n he
+ cases m with
+ | none =>
+ cases n with
+ | none => rfl
+ | some p =>
+ rcases p with ⟨k,b⟩
+ have hk := halfLattice_ne_zero d k.property
+ cases b <;> simp [latticeFrequency] at he <;> exact (hk (by first | exact he | exact he.symm)).elim
+ | some p =>
+ rcases p with ⟨k,b⟩
+ cases n with
+ | none =>
+ have hk := halfLattice_ne_zero d k.property
+ cases b <;> simp [latticeFrequency] at he <;> exact (hk he).elim
+ | some q =>
+ rcases q with ⟨l,c⟩
+ cases b <;> cases c <;> simp only [latticeFrequency, Bool.false_eq_true, ite_false, ite_true] at he
+ · have hkl : k = l := Subtype.ext he
+ subst l
+ rfl
+ · have hn : -k.1 ∈ halfLattice d := by simpa only [he, neg_neg] using l.property
+ exact ((halfLattice_partition d (halfLattice_ne_zero d k.property)).2 ⟨k.property,hn⟩).elim
+ · have hn : -k.1 ∈ halfLattice d := he.symm ▸ l.property
+ exact ((halfLattice_partition d (halfLattice_ne_zero d k.property)).2 ⟨k.property,hn⟩).elim
+ · have hkl : k = l := Subtype.ext (neg_inj.mp he)
+ subst l
+ rfl
+ · intro k
+ by_cases hk : k = 0
+ · exact ⟨none, by simpa [latticeFrequency] using hk.symm⟩
+ · rcases (halfLattice_partition d hk).1 with hp | hn
+ · exact ⟨some (⟨k,hp⟩,false), by simp [latticeFrequency]⟩
+ · exact ⟨some (⟨-k,hn⟩,true), by simp [latticeFrequency]⟩
+
+end I4Lattice
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmooth.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmooth.lean
new file mode 100644
index 000000000..5b1518449
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmooth.lean
@@ -0,0 +1,254 @@
+import SourceC4
+import Mathlib.Data.Nat.Choose.Sum
+
+/-!
+# All-order smoothness of the actual infinite Gaussian Fourier source
+
+This module extends the source-derived polynomial majorant from order four to
+every natural order. It uses the same SourceMode, sourceLaw and sourceField as
+the qualified F7 dependency; no finite-mode approximation or new field is used.
+The good sample predicate is a single countable intersection of explicit
+coefficient summability conditions. Its measurability and probability-law
+restriction are proved in SourceSmoothCarrier.
+
+This is a C261 Stage A prerequisite. It does not identify the spectral covariance
+with Lifetime's theta sum, construct a conditional kernel, or discharge a
+weighted elder, Morse, count/density, or universality conclusion.
+-/
+
+noncomputable section
+open I4Foundation I4Weights I4Source I4C4 MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal
+
+namespace I4Smooth
+
+def orderCoordinateBound (n : ℕ) (a c : ℝ) (k : ℤ) : ℝ :=
+ decay a k * (1 + |c * (k : ℝ)|) ^ n
+
+def orderProductBound (n d : ℕ) (a c : ℝ) (k : Fin d → ℤ) : ℝ :=
+ ∏ i, orderCoordinateBound n a c (k i)
+
+def orderPairedBound (n d : ℕ) (L : ℝ) (k : Fin d → ℤ) : ℝ :=
+ Real.sqrt (2 / sourceZ d L) * orderProductBound n d (sourceA L) (sourceC L) k
+
+def orderModeBound (n d : ℕ) (L : ℝ) (m : SourceMode d) : ℝ :=
+ match m with
+ | none => Real.sqrt (1 / sourceZ d L)
+ | some (k, _) => orderPairedBound n d L k
+
+theorem orderCoordinateBound_summable (n : ℕ) {a c : ℝ} (ha : 0 < a) :
+ Summable (orderCoordinateBound n a c) := by
+ classical
+ let f (r : ℕ) (k : ℤ) : ℝ :=
+ ((n.choose r : ℝ) * |c| ^ (n - r)) * (decay a k * |(k : ℝ)| ^ (n - r))
+ have hf (r : ℕ) : Summable (f r) :=
+ (summable_decay_pow ha (n - r)).mul_left _
+ have hsum (s : Finset ℕ) : Summable (fun k : ℤ => ∑ r ∈ s, f r k) := by
+ induction s using Finset.induction_on with
+ | empty => simpa using (summable_zero : Summable (fun _ : ℤ => (0 : ℝ)))
+ | @insert r s hr ih =>
+ simpa only [Finset.sum_insert hr] using (hf r).add ih
+ convert hsum (Finset.range (n + 1)) using 1
+ funext k
+ unfold orderCoordinateBound
+ rw [add_pow, Finset.mul_sum]
+ apply Finset.sum_congr rfl
+ intro r _
+ simp only [one_pow, one_mul, abs_mul, mul_pow, f]
+ ring
+
+theorem orderProductBound_summable (n d : ℕ) {a c : ℝ} (ha : 0 < a) :
+ Summable (orderProductBound n d a c) := by
+ exact finite_product_summable (orderCoordinateBound_summable n ha)
+ (fun k => by unfold orderCoordinateBound decay; positivity) d
+
+theorem orderPairedBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (orderPairedBound n d L) := by
+ exact (orderProductBound_summable n d (sourceA_pos hL)).mul_left _
+
+theorem orderPairedBound_eq_amplitude (n d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (k : Fin d → ℤ) :
+ orderPairedBound n d L k =
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^ n := by
+ have hsqrt : Real.sqrt (sourceWeight d L k) = productDecay d (sourceA L) k := by
+ have hw : sourceWeight d L k = (productDecay d (sourceA L) k) ^ 2 := by
+ rw [sourceWeight, productDecay_eq_exp, productDecay_eq_exp, pow_two, ← Real.exp_add]
+ congr 1
+ ring
+ rw [hw, Real.sqrt_sq_eq_abs, abs_of_nonneg]
+ unfold productDecay decay
+ positivity
+ have hamp : Real.sqrt (2 * sourceWeight d L k / sourceZ d L) =
+ Real.sqrt (2 / sourceZ d L) * productDecay d (sourceA L) k := by
+ have he : 2 * sourceWeight d L k / sourceZ d L =
+ (2 / sourceZ d L) * sourceWeight d L k := by ring
+ rw [he, Real.sqrt_mul (by have := sourceZ_pos d hL; positivity), hsqrt]
+ have hp : orderProductBound n d (sourceA L) (sourceC L) k =
+ productDecay d (sourceA L) k * ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^ n := by
+ exact Finset.prod_mul_distrib
+ rw [orderPairedBound, hp, hamp]
+ ring
+
+theorem orderModeBound_nonneg (n d : ℕ) (L : ℝ) (m : SourceMode d) :
+ 0 ≤ orderModeBound n d L m := by
+ cases m with
+ | none => exact Real.sqrt_nonneg _
+ | some p =>
+ unfold orderModeBound orderPairedBound orderProductBound orderCoordinateBound decay
+ positivity
+
+theorem orderModeBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (orderModeBound n d L) := by
+ classical
+ have hs : Summable (fun k : ↥(halfLattice d) => orderPairedBound n d L k) :=
+ (orderPairedBound_summable n d hL).subtype (halfLattice d)
+ have hb : Summable (fun _ : Bool => (1 : ℝ)) := (hasSum_fintype _).summable
+ have hp : Summable (fun p : ↥(halfLattice d) × Bool => orderPairedBound n d L p.1) := by
+ simpa only [mul_one, Function.comp_def] using hs.mul_of_nonneg hb
+ (fun k => orderModeBound_nonneg n d L (some (k, false))) (fun _ => zero_le_one)
+ let e := Equiv.optionEquivSumPUnit.{0, 0} (↥(halfLattice d) × Bool)
+ apply e.symm.summable_iff.mp
+ apply Summable.sum (fun q => orderModeBound n d L (e.symm q))
+ · simpa [e, Function.comp_def, orderModeBound] using hp
+ · exact (hasSum_fintype _).summable
+
+theorem orderModeBound_four (d : ℕ) (L : ℝ) (m : SourceMode d) :
+ orderModeBound 4 d L m = modeMajorant d L m := by
+ cases m <;> rfl
+
+theorem modeCoefficient_iteratedFDeriv_order_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (m : SourceMode d) (j : ℕ) (x : Fin d → ℝ) :
+ ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ orderModeBound j d L m := by
+ classical
+ cases m with
+ | none =>
+ cases j with
+ | zero =>
+ simpa only [norm_iteratedFDeriv_zero, Real.norm_eq_abs, orderModeBound, modeMajorant] using
+ modeCoefficient_bound d hL none x
+ | succ j =>
+ change ‖iteratedFDeriv ℝ (j + 1)
+ (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L)) x‖ ≤ Real.sqrt (1 / sourceZ d L)
+ rw [iteratedFDeriv_succ_const]
+ simp only [Pi.zero_apply, norm_zero]
+ exact Real.sqrt_nonneg _
+ | some p =>
+ rcases p with ⟨k, b⟩
+ let A := Real.sqrt (2 * sourceWeight d L k / sourceZ d L)
+ let P := ∏ i, (1 + |sourceC L * (k.1 i : ℝ)|)
+ let g : ℝ → ℝ := if b then Real.sin else Real.cos
+ let ell := phaseCLM d L k
+ have hg : ContDiff ℝ j g := by
+ cases b <;> simp only [g, Bool.false_eq_true, ite_false, ite_true] <;> fun_prop
+ have hgc : ContDiff ℝ j (g ∘ ell) := hg.comp_continuousLinearMap
+ have hgn : ‖iteratedFDeriv ℝ j g (ell x)‖ ≤ 1 := by
+ cases b with
+ | false =>
+ simpa only [g, Bool.false_eq_true, ite_false,
+ norm_iteratedFDeriv_eq_norm_iteratedDeriv, Real.norm_eq_abs] using
+ Real.abs_iteratedDeriv_cos_le_one j (ell x)
+ | true =>
+ simpa only [g, ite_true, norm_iteratedFDeriv_eq_norm_iteratedDeriv,
+ Real.norm_eq_abs] using Real.abs_iteratedDeriv_sin_le_one j (ell x)
+ have hl : ‖ell‖ ≤ P := by
+ calc
+ ‖ell‖ ≤ ∑ i, |sourceC L * (k.1 i : ℝ)| := phaseCLM_norm_le d L k
+ _ ≤ 1 + ∑ i, |sourceC L * (k.1 i : ℝ)| := by linarith
+ _ ≤ P := frequency_l1_le_product d _ (fun i => abs_nonneg _)
+ have hpow : ‖ell‖ ^ j ≤ P ^ j := by gcongr
+ have hder : ‖iteratedFDeriv ℝ j (g ∘ ell) x‖ ≤ ‖ell‖ ^ j := by
+ rw [ell.iteratedFDeriv_comp_right hg x le_rfl]
+ calc
+ _ ≤ ‖iteratedFDeriv ℝ j g (ell x)‖ * ∏ _i : Fin j, ‖ell‖ :=
+ (iteratedFDeriv ℝ j g (ell x)).norm_compContinuousLinearMap_le (fun _ => ell)
+ _ ≤ 1 * ∏ _i : Fin j, ‖ell‖ :=
+ mul_le_mul_of_nonneg_right hgn (Finset.prod_nonneg (fun _ _ => norm_nonneg _))
+ _ = ‖ell‖ ^ j := by simp
+ have heq : modeCoefficient d L (some (k, b)) = A • (g ∘ ell) := by
+ funext y
+ cases b <;> simp [modeCoefficient, A, g, Function.comp_apply, Pi.smul_apply,
+ smul_eq_mul, ell, phaseCLM_apply]
+ rw [heq, iteratedFDeriv_const_smul_apply hgc.contDiffAt, norm_smul,
+ Real.norm_eq_abs, abs_of_nonneg (Real.sqrt_nonneg _)]
+ calc
+ _ ≤ A * P ^ j := mul_le_mul_of_nonneg_left (hder.trans hpow) (Real.sqrt_nonneg _)
+ _ = orderModeBound j d L (some (k, b)) := by
+ rw [orderModeBound, orderPairedBound_eq_amplitude j d hL k]
+ simp only [A, P, Finset.prod_pow]
+
+/-- One explicit coefficient event, shared by every derivative order. -/
+def goodSample (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : Prop :=
+ ∀ n : ℕ, Summable (fun m => orderModeBound n d L m * |ω m|)
+
+theorem goodSample_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, goodSample d L ω := by
+ apply ae_all_iff.mpr
+ intro n
+ exact weighted_abs_summable_ae _ (orderModeBound_nonneg n d L)
+ (orderModeBound_summable n d hL)
+
+theorem sourceField_smooth_of_goodSample (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SourceMode d → ℝ) (hω : goodSample d L ω) :
+ ∀ n : ℕ, ContDiff ℝ n (sourceField d L ω) := by
+ intro n
+ have hc (m : SourceMode d) : ContDiff ℝ n (modeCoefficient d L m) := by
+ cases m with
+ | none =>
+ change ContDiff ℝ n (fun _ : Fin d → ℝ => Real.sqrt (1 / sourceZ d L))
+ fun_prop
+ | some p =>
+ rcases p with ⟨k, b⟩
+ change ContDiff ℝ n (fun x : Fin d → ℝ =>
+ Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ (if b then Real.sin (phase d L k x) else Real.cos (phase d L k x)))
+ cases b <;> simp [phase] <;> fun_prop
+ change ContDiff ℝ n (fun x => ∑' m, modeCoefficient d L m x * ω m)
+ apply contDiff_tsum (v := fun j m => orderModeBound j d L m * |ω m|)
+ · intro m
+ exact (hc m).mul contDiff_const
+ · intro j _
+ exact hω j
+ · intro j m x hj
+ have hcj : ContDiff ℝ j (modeCoefficient d L m) :=
+ (hc m).of_le (by exact_mod_cast hj)
+ have heq : (fun y => modeCoefficient d L m y * ω m) =
+ ω m • modeCoefficient d L m := by
+ funext y
+ simp [smul_eq_mul, mul_comm]
+ rw [heq, iteratedFDeriv_const_smul_apply hcj.contDiffAt, norm_smul, Real.norm_eq_abs]
+ simpa only [mul_comm] using mul_le_mul_of_nonneg_left
+ (modeCoefficient_iteratedFDeriv_order_bound d hL m j x) (abs_nonneg (ω m))
+
+theorem sourceField_smooth_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L ω) := by
+ filter_upwards [goodSample_ae d hL] with ω hω
+ exact sourceField_smooth_of_goodSample d hL ω hω
+
+/-- The carrier depends only on the coefficient tail; finite coordinate changes
+cannot destroy any derivative-order summability condition. -/
+theorem goodSample_congr_cofinite (d : ℕ) (L : ℝ)
+ (ω η : SourceMode d → ℝ) (hωη : ω =ᶠ[Filter.cofinite] η) :
+ goodSample d L ω ↔ goodSample d L η := by
+ constructor
+ · intro hω n
+ apply (hω n).congr_cofinite
+ filter_upwards [hωη] with m hm
+ rw [hm]
+ · intro hη n
+ apply (hη n).congr_cofinite
+ filter_upwards [hωη.symm] with m hm
+ rw [hm]
+
+theorem goodSample_finite_change_iff (d : ℕ) (L : ℝ)
+ (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))
+ (hωη : ∀ m ∉ s, ω m = η m) :
+ goodSample d L ω ↔ goodSample d L η := by
+ apply goodSample_congr_cofinite d L ω η
+ apply Filter.eventually_cofinite.mpr
+ apply s.finite_toSet.subset
+ intro m hm
+ by_contra hms
+ exact hm (hωη m hms)
+
+end I4Smooth
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothAxiomAudit.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothAxiomAudit.lean
new file mode 100644
index 000000000..e22ec44e5
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothAxiomAudit.lean
@@ -0,0 +1,68 @@
+import SourceSmoothControls
+import Lean
+
+#print axioms I4Smooth.sourceField_smooth_ae
+#print axioms I4SmoothCarrier.sampleInclusion_map
+#print axioms I4SmoothCarrier.smoothLaw_isProbabilityMeasure
+#print axioms I4SmoothCarrier.smoothSourceField_finiteVector_hasGaussianLaw
+#print axioms I4SmoothCarrier.smoothTorusSourceField_smooth
+
+-- Actual imported module identities select every environment constant, including
+-- generated declarations and private helpers. Endpoint lines do not define coverage.
+open Lean Elab Command in
+run_cmd do
+ let env := (← getEnv).setExporting false
+ let allowed : Array Name := #[`propext, `Classical.choice, `Quot.sound]
+ let modules : Array Name := #[
+ `GaussianSeriesFoundation, `SpectralWeights, `SourceFourierSeries,
+ `SourceC4, `SourceGaussianLaw, `SourceLattice, `SourceKernel,
+ `SourceCovariance, `SourceTorus, `SourceTorusC4,
+ `SourceSmooth, `SourceSmoothCarrier, `SourceSmoothControls]
+ let some carrierIdx := env.getModuleIdx? `SourceSmoothCarrier
+ | throwError "missing carrier module for private-helper guards"
+ let mut allNames : Array Name := #[]
+ for modName in modules do
+ let some idx := env.getModuleIdx? modName
+ | throwError "missing audited module: {modName}"
+ let names := (env.constants.toList.filterMap fun (name, _) =>
+ if env.getModuleIdxFor? name == some idx then some name else none).toArray.qsort Name.lt
+ if names.isEmpty then
+ throwError "empty declaration inventory for audited module: {modName}"
+ logInfo m!"SMOOTH_AUDIT_MODULE {modName} COUNT {names.size}"
+ for name in names do
+ if (env.checked.get.find? name).isNone then
+ throwError "missing kernel declaration: {name}"
+ let axs ← Lean.collectAxioms name
+ logInfo m!"SMOOTH_AUDIT_DECL {name} AXIOMS {axs}"
+ for ax in axs do
+ unless allowed.contains ax do
+ throwError "forbidden transitive axiom {ax} in {name}"
+ allNames := allNames.push name
+ let required : Array Name := #[
+ `I4Foundation.coefficientLaw,
+ `I4SourceGaussian.source_finiteVector_hasGaussianLaw,
+ `I4SourceCovariance.sourceField_variance_one,
+ `I4Smooth.goodSample, `I4Smooth.goodSample_ae,
+ `I4Smooth.sourceField_smooth_of_goodSample,
+ `I4Smooth.goodSample_finite_change_iff,
+ `I4SmoothCarrier.goodSet_measurable, `I4SmoothCarrier.sampleInclusion_map,
+ `I4SmoothCarrier.smoothLaw_isProbabilityMeasure,
+ `I4SmoothCarrier.observation_map_eq,
+ `I4SmoothCarrier.smoothSourceField_finiteVector_hasGaussianLaw,
+ `I4SmoothCarrier.smoothSourceField_covariance,
+ `I4SmoothCarrier.smoothTorusSourceField_smooth,
+ `I4SmoothControls.old_four_does_not_fill_all_orders,
+ `I4SmoothControls.field_variance_one]
+ for name in required do
+ unless allNames.contains name do
+ throwError "required source-law declaration omitted from audit: {name}"
+ let privateHelpers : Array Name := #[
+ `I4SmoothCarrier.orderAbsNN, `I4SmoothCarrier.orderAbsTotal,
+ `I4SmoothCarrier.orderAbsTotal_ne_top_iff,
+ `I4SmoothCarrier.orderAbsTotal_measurable]
+ for helper in privateHelpers do
+ unless allNames.any (fun name =>
+ env.getModuleIdxFor? name == some carrierIdx &&
+ Lean.privateToUserName? name == some helper) do
+ throwError "required carrier-private helper omitted from audit: {helper}"
+ logInfo m!"SMOOTH_AUDIT_STANDARD_ONLY_PASS COUNT {allNames.size}"
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothCarrier.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothCarrier.lean
new file mode 100644
index 000000000..cb6f7b108
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothCarrier.lean
@@ -0,0 +1,230 @@
+import SourceSmooth
+import SourceGaussianLaw
+import SourceCovariance
+import SourceTorusC4
+import Mathlib.MeasureTheory.Measure.Restrict
+import Mathlib.MeasureTheory.Measure.Typeclasses.Probability
+import Mathlib.MeasureTheory.Constructions.BorelSpace.Real
+
+/-!
+# A measurable smooth carrier for the actual source law
+
+The carrier consists of the coefficient samples satisfying every explicit
+order-weighted absolute summability condition from SourceSmooth. Its measure is
+the pullback of the existing product Gaussian sourceLaw under literal subtype
+inclusion. Inclusion pushes this measure back to exactly sourceLaw, so finite
+coefficient observations, field evaluation laws, and covariance are unchanged.
+
+The construction concerns the same literal Fourier source, for fixed d and L.
+It does not identify the spectral kernel with a periodized theta kernel, define
+a conditional kernel or a smooth-function-space law, or discharge a Lifetime
+Field adapter, Morse, elder, counting, density, or universality conclusion.
+-/
+
+noncomputable section
+open I4Foundation I4Source I4Smooth I4SourceGaussian I4SourceCovariance I4Kernel
+open I4Torus I4TorusC4 MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal NNReal Manifold Topology
+
+namespace I4SmoothCarrier
+
+/-- The actual common coefficient event, with no smoothness premise added. -/
+def goodSet (d : ℕ) (L : ℝ) : Set (SourceMode d → ℝ) :=
+ {ω | goodSample d L ω}
+
+private def orderAbsNN (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ)
+ (m : SourceMode d) : ℝ≥0 :=
+ ⟨orderModeBound n d L m * |ω m|,
+ mul_nonneg (orderModeBound_nonneg n d L m) (abs_nonneg _)⟩
+
+private def orderAbsTotal (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : ℝ≥0∞ :=
+ ∑' m, (orderAbsNN n d L ω m : ℝ≥0∞)
+
+private theorem orderAbsTotal_ne_top_iff (n d : ℕ) (L : ℝ)
+ (ω : SourceMode d → ℝ) :
+ orderAbsTotal n d L ω ≠ ∞ ↔
+ Summable (fun m => orderModeBound n d L m * |ω m|) := by
+ exact ENNReal.tsum_coe_ne_top_iff_summable_coe (f := orderAbsNN n d L ω)
+
+private theorem orderAbsTotal_measurable (n d : ℕ) (L : ℝ) :
+ Measurable (orderAbsTotal n d L) := by
+ unfold orderAbsTotal
+ simp_rw [ENNReal.tsum_eq_iSup_sum]
+ apply Measurable.iSup
+ intro s
+ apply s.measurable_fun_sum
+ intro m _
+ have hm : Measurable (fun ω : SourceMode d → ℝ => orderAbsNN n d L ω m) := by
+ unfold orderAbsNN
+ exact (show Measurable (fun ω : SourceMode d → ℝ => orderModeBound n d L m * |ω m|) by
+ fun_prop).nnreal_mk
+ exact hm.coe_nnreal_ennreal
+
+theorem goodSet_measurable (d : ℕ) (L : ℝ) : MeasurableSet (goodSet d L) := by
+ have heq : goodSet d L =
+ ⋂ n : ℕ, {ω : SourceMode d → ℝ | orderAbsTotal n d L ω ≠ ∞} := by
+ ext ω
+ simp only [goodSet, Set.mem_setOf_eq, Set.mem_iInter, goodSample]
+ exact forall_congr' fun n => (orderAbsTotal_ne_top_iff n d L ω).symm
+ rw [heq]
+ apply MeasurableSet.iInter
+ intro n
+ convert ((orderAbsTotal_measurable n d L) (measurableSet_singleton ∞)).compl using 1
+ ext ω
+ simp
+
+theorem goodSet_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ω ∈ goodSet d L :=
+ goodSample_ae d hL
+
+theorem goodSet_measure_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ sourceLaw d (goodSet d L) = 1 := by
+ exact (mem_ae_iff_prob_eq_one (goodSet_measurable d L)).mp (goodSet_ae d hL)
+
+/-- A coefficient sample on the explicit all-order summability carrier. -/
+abbrev SmoothSample (d : ℕ) (L : ℝ) := ↥(goodSet d L)
+
+/-- Literal inclusion, retaining every coefficient of the original sample. -/
+def sampleInclusion (d : ℕ) (L : ℝ) : SmoothSample d L → (SourceMode d → ℝ) :=
+ Subtype.val
+
+theorem sampleInclusion_measurable (d : ℕ) (L : ℝ) :
+ Measurable (sampleInclusion d L) :=
+ measurable_subtype_coe
+
+/-- Pull back the original product law; no normalization or new law is chosen. -/
+def smoothLaw (d : ℕ) (L : ℝ) : Measure (SmoothSample d L) :=
+ (sourceLaw d).comap (sampleInclusion d L)
+
+theorem sampleInclusion_map (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ (smoothLaw d L).map (sampleInclusion d L) = sourceLaw d := by
+ change ((sourceLaw d).comap ((↑) : SmoothSample d L → (SourceMode d → ℝ))).map
+ ((↑) : SmoothSample d L → (SourceMode d → ℝ)) = sourceLaw d
+ rw [map_comap_subtype_coe (goodSet_measurable d L),
+ Measure.restrict_eq_self_of_ae_mem (goodSet_ae d hL)]
+
+theorem sampleInclusion_measurePreserving (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ MeasurePreserving (sampleInclusion d L) (smoothLaw d L) (sourceLaw d) :=
+ ⟨sampleInclusion_measurable d L, sampleInclusion_map d hL⟩
+
+theorem smoothLaw_isProbabilityMeasure (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ IsProbabilityMeasure (smoothLaw d L) := by
+ apply (MeasurableEmbedding.subtype_coe (goodSet_measurable d L)).isProbabilityMeasure_comap
+ simpa only [Subtype.range_coe] using goodSet_ae d hL
+
+/-- Every measurable observation has exactly its original pushforward law. -/
+theorem observation_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :
+ (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceLaw d).map X := by
+ change (smoothLaw d L).map (X ∘ sampleInclusion d L) = (sourceLaw d).map X
+ rw [← Measure.map_map hX (sampleInclusion_measurable d L), sampleInclusion_map d hL]
+
+theorem coordinate_marginal (d : ℕ) {L : ℝ} (hL : L ≠ 0) (m : SourceMode d) :
+ (smoothLaw d L).map (fun ω => sampleInclusion d L ω m) = gaussianReal 0 1 := by
+ rw [observation_map_eq d hL (fun ω => ω m) (measurable_pi_apply m)]
+ exact I4Foundation.coordinate_marginal m
+
+theorem finiteCoordinate_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (m : Fin n → SourceMode d) :
+ (smoothLaw d L).map (fun ω j => sampleInclusion d L ω (m j)) =
+ (sourceLaw d).map (fun ω j => ω (m j)) := by
+ exact observation_map_eq d hL _ (Measurable.of_eval (fun j => measurable_pi_apply (m j)))
+
+/-- The unchanged literal real-cover field, evaluated on the carrier. -/
+def smoothSourceField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : Fin d → ℝ) : ℝ :=
+ sourceField d L (sampleInclusion d L ω) x
+
+theorem smoothSourceField_contDiff (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample d L) (n : ℕ) : ContDiff ℝ n (smoothSourceField d L ω) :=
+ sourceField_smooth_of_goodSample d hL (sampleInclusion d L ω) ω.property n
+
+theorem smoothSourceField_smooth (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample d L) : ContDiff ℝ (⊤ : ℕ∞) (smoothSourceField d L ω) :=
+ contDiff_infty.mpr (smoothSourceField_contDiff d hL ω)
+
+theorem smoothSourceField_finiteVector_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (x : Fin n → (Fin d → ℝ)) :
+ (smoothLaw d L).map (fun ω j => smoothSourceField d L ω (x j)) =
+ (sourceLaw d).map (fun ω j => sourceField d L ω (x j)) := by
+ exact observation_map_eq d hL _
+ (Measurable.of_eval (fun j => sourceField_eval_measurable d L (x j)))
+
+theorem smoothSourceField_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (n : ℕ) (x : Fin n → (Fin d → ℝ)) :
+ HasGaussianLaw (fun ω j => smoothSourceField d L ω (x j)) (smoothLaw d L) := by
+ have hm : Measurable (fun ω j => smoothSourceField d L ω (x j)) :=
+ (Measurable.of_eval (fun j => sourceField_eval_measurable d L (x j))).comp
+ (sampleInclusion_measurable d L)
+ refine ⟨hm.aemeasurable, ?_⟩
+ rw [smoothSourceField_finiteVector_map_eq d hL n x]
+ exact (source_finiteVector_hasGaussianLaw d hL n x).isGaussian_map
+
+theorem covariance_comp_inclusion (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (X Y : (SourceMode d → ℝ) → ℝ) (hX : Measurable X) (hY : Measurable Y) :
+ cov[fun ω => X (sampleInclusion d L ω), fun ω => Y (sampleInclusion d L ω); smoothLaw d L] =
+ cov[X, Y; sourceLaw d] := by
+ have h := covariance_map_fun (μ := smoothLaw d L) (Z := sampleInclusion d L)
+ (X := X) (Y := Y) hX.aestronglyMeasurable hY.aestronglyMeasurable
+ (sampleInclusion_measurable d L).aemeasurable
+ rw [sampleInclusion_map d hL] at h
+ exact h.symm
+
+theorem smoothSourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (x y : Fin d → ℝ) :
+ cov[fun ω => smoothSourceField d L ω x, fun ω => smoothSourceField d L ω y; smoothLaw d L] =
+ sourceSpectralKernel d L (x - y) := by
+ calc
+ _ = cov[fun ω => sourceField d L ω x, fun ω => sourceField d L ω y; sourceLaw d] :=
+ covariance_comp_inclusion d hL _ _ (sourceField_eval_measurable d L x)
+ (sourceField_eval_measurable d L y)
+ _ = _ := sourceField_covariance d hL x y
+
+/-- The unchanged literal torus descent of the same coefficient sample. -/
+def smoothTorusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (ω : SmoothSample d L) (q : SourceTorus d L) : ℝ :=
+ torusSourceField d L (sampleInclusion d L ω) q
+
+attribute [local instance] actualChartedSpace
+
+theorem smoothTorusSourceField_smooth (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (ω : SmoothSample d L) :
+ ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) (⊤ : ℕ∞) (smoothTorusSourceField d L ω) := by
+ let _ := torus_isManifold d L
+ have hs := smoothSourceField_smooth d (Fact.out : 0 < L).ne' ω
+ intro q
+ rw [contMDiffAt_iff_source]
+ have heq : smoothTorusSourceField d L ω ∘ (extChartAt 𝓘(ℝ, Fin d → ℝ) q).symm =
+ smoothSourceField d L ω := by
+ funext x
+ change torusSourceField d L (sampleInclusion d L ω)
+ ((quotientChart d L (chartCenter d L q)).symm x) = _
+ rw [quotientChart_symm]
+ exact torusSourceField_pullback d L (sampleInclusion d L ω) x
+ rw [heq, contMDiffWithinAt_iff_contDiffWithinAt]
+ exact hs.contDiffAt.contDiffWithinAt
+
+theorem smoothTorusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ)
+ [Fact (0 < L)] (n : ℕ) (q : Fin n → SourceTorus d L) :
+ HasGaussianLaw (fun ω j => smoothTorusSourceField d L ω (q j)) (smoothLaw d L) := by
+ have hm : Measurable (fun ω j => smoothTorusSourceField d L ω (q j)) :=
+ (Measurable.of_eval (fun j => torusSourceField_eval_measurable d L (q j))).comp
+ (sampleInclusion_measurable d L)
+ refine ⟨hm.aemeasurable, ?_⟩
+ change IsGaussian ((smoothLaw d L).map
+ (fun ω j => torusSourceField d L (sampleInclusion d L ω) (q j)))
+ rw [observation_map_eq d (Fact.out : 0 < L).ne' _
+ (Measurable.of_eval (fun j => torusSourceField_eval_measurable d L (q j)))]
+ exact (torusSourceField_finiteVector_hasGaussianLaw d L n q).isGaussian_map
+
+theorem smoothTorusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q p : SourceTorus d L) :
+ cov[fun ω => smoothTorusSourceField d L ω q, fun ω => smoothTorusSourceField d L ω p;
+ smoothLaw d L] =
+ sourceSpectralKernel d L (torusRepresentative d L q - torusRepresentative d L p) := by
+ calc
+ _ = cov[fun ω => torusSourceField d L ω q, fun ω => torusSourceField d L ω p; sourceLaw d] :=
+ covariance_comp_inclusion d (Fact.out : 0 < L).ne' _ _
+ (torusSourceField_eval_measurable d L q) (torusSourceField_eval_measurable d L p)
+ _ = _ := torusSourceField_covariance d L q p
+
+end I4SmoothCarrier
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothControls.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothControls.lean
new file mode 100644
index 000000000..febe52a42
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothControls.lean
@@ -0,0 +1,67 @@
+import SourceSmoothCarrier
+
+/-! Discriminating controls for the actual smooth-source construction.
+These controls are proof obligations, not observed runtime outcomes. They require
+orders above four, a common coefficient event, literal source inclusion and exact
+law preservation. They make no conditional-law or theta-kernel claim. -/
+
+noncomputable section
+open I4Source I4Smooth I4SmoothCarrier I4Kernel MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal
+
+namespace I4SmoothControls
+
+/-- The old a.e. order-four theorem cannot fill the all-orders goal. -/
+theorem old_four_does_not_fill_all_orders (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L ω) := by
+ fail_if_success exact I4C4.sourceField_contDiff_ae d hL
+ exact sourceField_smooth_ae d hL
+
+theorem represented_sample_order_five (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample d L) : ContDiff ℝ 5 (smoothSourceField d L ω) :=
+ smoothSourceField_contDiff d hL ω 5
+
+theorem represented_sample_order_thirtyseven (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample d L) : ContDiff ℝ 37 (smoothSourceField d L ω) :=
+ smoothSourceField_contDiff d hL ω 37
+
+/-- Both higher orders hold for every sample of the very same carrier. -/
+theorem one_carrier_for_both_orders (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SmoothSample d L) :
+ ContDiff ℝ 5 (smoothSourceField d L ω) ∧
+ ContDiff ℝ 37 (smoothSourceField d L ω) :=
+ ⟨represented_sample_order_five d hL ω, represented_sample_order_thirtyseven d hL ω⟩
+
+theorem literal_field_everywhere (d : ℕ) (L : ℝ) (ω : SmoothSample d L)
+ (x : Fin d → ℝ) :
+ smoothSourceField d L ω x = sourceField d L (sampleInclusion d L ω) x := rfl
+
+theorem entire_coefficient_law_preserved (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ (smoothLaw d L).map (sampleInclusion d L) = sourceLaw d :=
+ sampleInclusion_map d hL
+
+theorem arbitrary_observation_law_preserved (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :
+ (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceLaw d).map X :=
+ observation_map_eq d hL X hX
+
+/-- Arbitrarily large changes on a finite block leave the actual carrier intact. -/
+theorem finite_block_changes_preserve_carrier (d : ℕ) (L : ℝ)
+ (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))
+ (hωη : ∀ m ∉ s, ω m = η m) :
+ goodSample d L ω ↔ goodSample d L η :=
+ goodSample_finite_change_iff d L ω η s hωη
+
+/-- The restricted field keeps variance one, which excludes a zero-field substitution. -/
+theorem field_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :
+ cov[fun ω => smoothSourceField d L ω x,
+ fun ω => smoothSourceField d L ω x; smoothLaw d L] = 1 := by
+ rw [smoothSourceField_covariance d hL x x, sub_self, spectralKernel_zero d hL]
+
+/-- The underlying restricted measure has total mass one, without conditioning
+on a finite pin event or normalizing by a weight. -/
+theorem carrier_probability (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ IsProbabilityMeasure (smoothLaw d L) :=
+ smoothLaw_isProbabilityMeasure d hL
+
+end I4SmoothControls
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceTorus.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceTorus.lean
new file mode 100644
index 000000000..b9fe49752
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceTorus.lean
@@ -0,0 +1,111 @@
+import SourceCovariance
+import Mathlib.MeasureTheory.Integral.IntervalIntegral.Periodic
+import Mathlib.Probability.Distributions.Gaussian.IsGaussianProcess.Basic
+
+/-! Literal descent of the existing real-cover field to a product of additive circles.
+The sample law remains sourceLaw. Smooth torus and Banach-valued laws are separate. -/
+noncomputable section
+open I4Foundation I4Weights I4Source I4Lattice I4Kernel I4SourceGaussian I4SourceCovariance
+open MeasureTheory ProbabilityTheory
+open scoped BigOperators ENNReal NNReal
+
+namespace I4Torus
+
+abbrev SourceTorus (d : ℕ) (L : ℝ) := Fin d → AddCircle L
+
+def torusProjection (d : ℕ) (L : ℝ) (x : Fin d → ℝ) : SourceTorus d L :=
+ fun i => (x i : AddCircle L)
+
+def torusRepresentative (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q : SourceTorus d L) : Fin d → ℝ :=
+ fun i => (AddCircle.equivIco L 0 (q i)).1
+
+def torusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (ω : SourceMode d → ℝ) (q : SourceTorus d L) : ℝ :=
+ sourceField d L ω (torusRepresentative d L q)
+
+theorem torusProjection_measurable (d : ℕ) (L : ℝ) : Measurable (torusProjection d L) := by
+ exact Measurable.of_eval (fun i => AddCircle.measurable_mk'.comp (measurable_pi_apply i))
+
+theorem torusRepresentative_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ Measurable (torusRepresentative d L) := by
+ exact Measurable.of_eval (fun i => measurable_subtype_coe.comp
+ ((AddCircle.measurableEquivIco L 0).measurable.comp (measurable_pi_apply i)))
+
+theorem torusProjection_representative (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q : SourceTorus d L) : torusProjection d L (torusRepresentative d L q) = q := by
+ funext i
+ exact AddCircle.coe_equivIco (p := L) (a := 0) (y := q i)
+
+theorem sourceField_eq_of_torusProjection_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (ω : SourceMode d → ℝ) (x y : Fin d → ℝ)
+ (h : torusProjection d L x = torusProjection d L y) :
+ sourceField d L ω x = sourceField d L ω y := by
+ classical
+ have hz (i : Fin d) : ∃ n : ℤ, n • L = y i - x i := by
+ apply (AddCircle.coe_eq_zero_iff (p := L)).mp
+ rw [AddCircle.coe_sub]
+ exact sub_eq_zero.mpr (congrFun h i).symm
+ choose n hn using hz
+ have he : y = fun i => x i + L * (n i : ℝ) := by
+ funext i
+ have hi := hn i
+ rw [zsmul_eq_mul] at hi
+ linarith
+ rw [he]
+ exact (sourceField_lattice_shift d hL ω n x).symm
+
+theorem torusSourceField_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (ω : SourceMode d → ℝ) (x : Fin d → ℝ) :
+ torusSourceField d L ω (torusProjection d L x) = sourceField d L ω x := by
+ exact sourceField_eq_of_torusProjection_eq d (Fact.out : 0 < L).ne' ω
+ (torusRepresentative d L (torusProjection d L x)) x
+ (torusProjection_representative d L (torusProjection d L x))
+
+theorem torusSourceField_eval_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q : SourceTorus d L) : Measurable (fun ω => torusSourceField d L ω q) := by
+ exact sourceField_eval_measurable d L (torusRepresentative d L q)
+
+theorem torusSourceField_joint_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ Measurable (fun p : (SourceMode d → ℝ) × SourceTorus d L =>
+ torusSourceField d L p.1 p.2) := by
+ unfold torusSourceField sourceField scalarSeries
+ apply Measurable.tsum
+ intro m
+ have hm : Continuous (fun x : Fin d → ℝ => modeCoefficient d L m x) := by
+ cases m with
+ | none => simp only [modeCoefficient]; fun_prop
+ | some p =>
+ rcases p with ⟨k,b⟩
+ cases b <;> simp only [modeCoefficient, Bool.false_eq_true, ite_false, ite_true] <;>
+ unfold phase <;> fun_prop
+ exact (hm.measurable.comp ((torusRepresentative_measurable d L).comp measurable_snd)).mul
+ ((measurable_pi_apply m).comp measurable_fst)
+
+theorem torusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (n : ℕ) (q : Fin n → SourceTorus d L) :
+ HasGaussianLaw (fun ω j => torusSourceField d L ω (q j)) (sourceLaw d) := by
+ exact source_finiteVector_hasGaussianLaw d (Fact.out : 0 < L).ne' n
+ (fun j => torusRepresentative d L (q j))
+
+theorem torusSourceField_isGaussianProcess (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ IsGaussianProcess (fun q ω => torusSourceField d L ω q) (sourceLaw d) := by
+ exact (sourceField_isGaussianProcess d (Fact.out : 0 < L).ne').comp_right
+ (torusRepresentative d L)
+
+theorem torusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (q p : SourceTorus d L) :
+ cov[fun ω => torusSourceField d L ω q, fun ω => torusSourceField d L ω p; sourceLaw d] =
+ sourceSpectralKernel d L (torusRepresentative d L q - torusRepresentative d L p) := by
+ exact sourceField_covariance d (Fact.out : 0 < L).ne'
+ (torusRepresentative d L q) (torusRepresentative d L p)
+
+theorem torusSourceField_covariance_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]
+ (x y : Fin d → ℝ) :
+ cov[fun ω => torusSourceField d L ω (torusProjection d L x),
+ fun ω => torusSourceField d L ω (torusProjection d L y); sourceLaw d] =
+ sourceSpectralKernel d L (x - y) := by
+ simp_rw [torusSourceField_pullback]
+ exact sourceField_covariance d (Fact.out : 0 < L).ne' x y
+
+end I4Torus
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceTorusC4.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceTorusC4.lean
new file mode 100644
index 000000000..30cfb670f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceTorusC4.lean
@@ -0,0 +1,134 @@
+import SourceC4
+import SourceTorus
+import Mathlib.Topology.OpenPartialHomeomorph.Constructions
+import Mathlib.Geometry.Manifold.ContMDiff.Basic
+import Mathlib.Geometry.Manifold.ContMDiff.NormedSpace
+import Mathlib.Topology.LocallyConstant.Basic
+
+noncomputable section
+open I4Foundation I4Weights I4Source I4C4 I4Torus MeasureTheory
+open scoped Manifold ContDiff Topology
+namespace I4TorusC4
+
+def quotientChart (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :
+ OpenPartialHomeomorph (SourceTorus d L) (Fin d → ℝ) :=
+ (OpenPartialHomeomorph.pi (fun i : Fin d => AddCircle.openPartialHomeomorphCoe L (a i))).symm
+
+def chartCenter (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) : Fin d → ℝ :=
+ fun i => torusRepresentative d L q i - L / 2
+
+theorem quotientChart_symm (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :
+ (quotientChart d L a).symm = torusProjection d L := by
+ rfl
+
+theorem centered_chart_covers (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) :
+ q ∈ (quotientChart d L (chartCenter d L q)).source := by
+ let e := OpenPartialHomeomorph.pi
+ (fun i : Fin d => AddCircle.openPartialHomeomorphCoe L (chartCenter d L q i))
+ have hs : torusRepresentative d L q ∈ e.source := by
+ change torusRepresentative d L q ∈ Set.pi Set.univ
+ (fun i => Set.Ioo (chartCenter d L q i) (chartCenter d L q i + L))
+ intro i _
+ change chartCenter d L q i < torusRepresentative d L q i ∧
+ torusRepresentative d L q i < chartCenter d L q i + L
+ have hL : 0 < L := Fact.out
+ dsimp [chartCenter]
+ constructor <;> linarith
+ have he : e (torusRepresentative d L q) = q :=
+ torusProjection_representative d L q
+ have ht := e.map_source hs
+ rw [he] at ht
+ exact ht
+
+@[instance_reducible] def actualChartedSpace (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ ChartedSpace (Fin d → ℝ) (SourceTorus d L) where
+ atlas := Set.range (quotientChart d L)
+ chartAt := fun q => quotientChart d L (chartCenter d L q)
+ mem_chart_source := centered_chart_covers d L
+ chart_mem_atlas := fun q => ⟨chartCenter d L q, rfl⟩
+
+attribute [local instance] actualChartedSpace
+
+theorem chart_transition_contDiff (d : ℕ) (L : ℝ) [Fact (0 < L)] (a b : Fin d → ℝ) :
+ ContDiffOn ℝ ∞ ((quotientChart d L a).symm.trans (quotientChart d L b))
+ ((quotientChart d L a).symm.trans (quotientChart d L b)).source := by
+ let ea := quotientChart d L a
+ let eb := quotientChart d L b
+ let T := ea.symm.trans eb
+ let S := T.source
+ have hproj (x : S) : torusProjection d L (T x) = torusProjection d L x := by
+ have hb : ea.symm (x : Fin d → ℝ) ∈ eb.source := x.property.2
+ have hi := eb.left_inv hb
+ simpa only [T, ea, eb, OpenPartialHomeomorph.trans_apply, quotientChart_symm] using hi
+ have hlat (x : S) (i : Fin d) : T x i - (x : Fin d → ℝ) i ∈
+ AddSubgroup.zmultiples L := by
+ apply AddSubgroup.mem_zmultiples_iff.mpr
+ apply (AddCircle.coe_eq_zero_iff (p := L)).mp
+ rw [AddCircle.coe_sub]
+ exact sub_eq_zero.mpr (congrFun (hproj x) i)
+ let delta : S → Fin d → AddSubgroup.zmultiples L :=
+ fun x i => ⟨T x i - (x : Fin d → ℝ) i, hlat x i⟩
+ have hd : Continuous delta := by
+ apply continuous_pi
+ intro i
+ apply Continuous.subtype_mk
+ exact ((continuous_apply i).comp T.continuousOn.domRestrict).sub
+ ((continuous_apply i).comp continuous_subtype_val)
+ have hlc : IsLocallyConstant delta :=
+ (IsLocallyConstant.iff_continuous delta).mpr hd
+ apply T.open_source.contDiffOn_iff.mpr
+ intro x hx
+ let x0 : S := ⟨x, hx⟩
+ let c : Fin d → ℝ := fun i => (delta x0 i : ℝ)
+ have hsub : ∀ᶠ y : S in 𝓝 x0, T y = (y : Fin d → ℝ) + c := by
+ filter_upwards [hlc.eventually_eq x0] with y hy
+ funext i
+ have hi := congrArg (fun z : Fin d → AddSubgroup.zmultiples L => (z i : ℝ)) hy
+ change T y i - (y : Fin d → ℝ) i = c i at hi
+ change T y i = (y : Fin d → ℝ) i + c i
+ linarith
+ have hamb : (fun y => T y) =ᶠ[𝓝 x] (fun y => y + c) := by
+ have hm : ∀ᶠ y in Filter.map ((↑) : S → (Fin d → ℝ)) (𝓝 x0), T y = y + c :=
+ Filter.eventually_map.mpr hsub
+ have hmap : Filter.map ((↑) : S → (Fin d → ℝ)) (𝓝 x0) = 𝓝 x :=
+ map_nhds_subtype_coe_eq_nhds hx (T.open_source.mem_nhds hx)
+ rw [hmap] at hm
+ exact hm
+ exact (contDiff_id.add contDiff_const).contDiffAt.congr_of_eventuallyEq hamb
+
+theorem torus_isManifold (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ IsManifold 𝓘(ℝ, Fin d → ℝ) ∞ (SourceTorus d L) := by
+ apply isManifold_of_contDiffOn
+ intro e e' he he'
+ change e ∈ Set.range (quotientChart d L) at he
+ change e' ∈ Set.range (quotientChart d L) at he'
+ rcases he with ⟨a, rfl⟩
+ rcases he' with ⟨b, rfl⟩
+ simpa only [modelWithCornersSelf_coe, modelWithCornersSelf_coe_symm,
+ Function.comp_id, Function.id_comp, Set.preimage_id, Set.range_id, Set.inter_univ] using
+ chart_transition_contDiff d L a b
+
+theorem torusSourceField_contMDiff_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ ∀ᵐ sample ∂sourceLaw d,
+ ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) 4 (torusSourceField d L sample) := by
+ let _ := torus_isManifold d L
+ filter_upwards [sourceField_contDiff_ae d (Fact.out : 0 < L).ne'] with sample hs
+ intro q
+ rw [contMDiffAt_iff_source]
+ have heq : torusSourceField d L sample ∘ (extChartAt 𝓘(ℝ, Fin d → ℝ) q).symm =
+ sourceField d L sample := by
+ funext x
+ change torusSourceField d L sample ((quotientChart d L (chartCenter d L q)).symm x) = _
+ rw [quotientChart_symm]
+ exact torusSourceField_pullback d L sample x
+ rw [heq, contMDiffWithinAt_iff_contDiffWithinAt]
+ exact hs.contDiffAt.contDiffWithinAt
+
+theorem torusSourceField_weakSuperlevel_closed_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :
+ ∀ᵐ sample ∂sourceLaw d, ∀ h : ℝ,
+ IsClosed {q : SourceTorus d L | h ≤ torusSourceField d L sample q} := by
+ filter_upwards [torusSourceField_contMDiff_ae d L] with sample hs
+ intro h
+ exact isClosed_Ici.preimage hs.continuous
+
+end I4TorusC4
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SpectralWeights.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SpectralWeights.lean
new file mode 100644
index 000000000..191a22f14
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SpectralWeights.lean
@@ -0,0 +1,160 @@
+import Mathlib.NumberTheory.ModularForms.JacobiTheta.TwoVariable
+import Mathlib.Analysis.Normed.Ring.InfiniteSum
+import Mathlib.Data.Fin.Tuple.Basic
+import Mathlib.Algebra.BigOperators.Fin
+
+/-! Concrete square-root Gaussian spectral majorants for the required I4 bridge.
+The product majorant dominates the l1 frequency norm for the default Pi sup norm.
+This file alone proves neither a Gaussian field law nor sample smoothness. -/
+
+noncomputable section
+open Real
+open scoped BigOperators
+namespace I4Weights
+
+def decay (a : ℝ) (k : ℤ) : ℝ := exp (-a * (k : ℝ) ^ 2)
+def coordinateBound (a c : ℝ) (k : ℤ) : ℝ :=
+ decay a k * (1 + |c * (k : ℝ)|) ^ 4
+def productDecay (d : ℕ) (a : ℝ) (k : Fin d → ℤ) : ℝ :=
+ ∏ i, decay a (k i)
+def productBound (d : ℕ) (a c : ℝ) (k : Fin d → ℤ) : ℝ :=
+ ∏ i, coordinateBound a c (k i)
+def sourceA (L : ℝ) : ℝ := π ^ 2 / L ^ 2
+def sourceC (L : ℝ) : ℝ := 2 * π / L
+def sourceWeight (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : ℝ :=
+ productDecay d (2 * sourceA L) k
+def sourceZ (d : ℕ) (L : ℝ) : ℝ := ∑' k, sourceWeight d L k
+def pairedBound (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : ℝ :=
+ Real.sqrt (2 / sourceZ d L) * productBound d (sourceA L) (sourceC L) k
+
+theorem summable_decay_pow {a : ℝ} (ha : 0 < a) (n : ℕ) :
+ Summable (fun k : ℤ => decay a k * |(k : ℝ)| ^ n) := by
+ have hb := summable_pow_mul_jacobiTheta₂_term_bound 0
+ (show 0 < a / π by positivity) n
+ have he (k : ℤ) : -π * (a / π * (k : ℝ) ^ 2 - 2 * 0 * |(k : ℝ)|) =
+ -a * (k : ℝ) ^ 2 := by
+ field_simp
+ ring
+ simp_rw [Int.cast_abs, he] at hb
+ simpa [decay, mul_comm] using hb
+
+theorem coordinateBound_summable {a c : ℝ} (ha : 0 < a) :
+ Summable (coordinateBound a c) := by
+ have hs := summable_decay_pow ha
+ convert ((((hs 0).add ((hs 1).mul_left (4 * |c|))).add
+ ((hs 2).mul_left (6 * |c| ^ 2))).add
+ ((hs 3).mul_left (4 * |c| ^ 3))).add ((hs 4).mul_left (|c| ^ 4)) using 1
+ funext k
+ simp only [coordinateBound, abs_mul]
+ ring
+
+set_option maxHeartbeats 800000 in
+theorem finite_product_summable {f : ℤ → ℝ} (hf : Summable f) (hn : ∀ k, 0 ≤ f k)
+ (d : ℕ) : Summable (fun k : Fin d → ℤ => ∏ i, f (k i)) := by
+ classical
+ induction d with
+ | zero => exact (hasSum_fintype _).summable
+ | succ d ih =>
+ have hp : Summable (fun p : ℤ × (Fin d → ℤ) => f p.1 * ∏ i, f (p.2 i)) :=
+ Summable.mul_of_nonneg (ι := ℤ) (ι' := Fin d → ℤ)
+ (f := f) (g := fun k : Fin d → ℤ => ∏ i, f (k i))
+ hf ih hn (fun k => Finset.prod_nonneg (fun i _ => hn (k i)))
+ have heq :
+ ((fun k : Fin (d + 1) → ℤ => ∏ i, f (k i)) ∘
+ (Fin.consEquiv (fun _ : Fin (d + 1) => ℤ))) =
+ (fun p : ℤ × (Fin d → ℤ) => f p.1 * ∏ i, f (p.2 i)) := by
+ funext p
+ simp only [Function.comp_apply, Fin.consEquiv_apply, Fin.prod_univ_succ,
+ Fin.cons_zero, Fin.cons_succ]
+ apply (Fin.consEquiv (fun _ : Fin (d + 1) => ℤ)).summable_iff.mp
+ rw [heq]
+ exact hp
+
+theorem productBound_summable {a c : ℝ} (ha : 0 < a) (d : ℕ) :
+ Summable (productBound d a c) := by
+ exact finite_product_summable (coordinateBound_summable ha)
+ (fun k => by unfold coordinateBound decay; positivity) d
+
+theorem productDecay_eq_exp (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :
+ productDecay d a k = exp (-a * ∑ i, (k i : ℝ) ^ 2) := by
+ unfold productDecay decay
+ rw [← Real.exp_sum, ← Finset.mul_sum]
+
+theorem frequency_l1_le_product (d : ℕ) (v : Fin d → ℝ) (hv : ∀ i, 0 ≤ v i) :
+ 1 + ∑ i, v i ≤ ∏ i, (1 + v i) := by
+ classical
+ have H (s : Finset (Fin d)) : 1 + ∑ i ∈ s, v i ≤ ∏ i ∈ s, (1 + v i) := by
+ induction s using Finset.induction_on with
+ | empty => simp
+ | @insert i s hi ih =>
+ rw [Finset.sum_insert hi, Finset.prod_insert hi]
+ have hsum : 0 ≤ ∑ j ∈ s, v j := Finset.sum_nonneg (fun j _ => hv j)
+ calc
+ 1 + (v i + ∑ j ∈ s, v j) ≤ (1 + v i) * (1 + ∑ j ∈ s, v j) := by
+ nlinarith [mul_nonneg (hv i) hsum]
+ _ ≤ (1 + v i) * ∏ j ∈ s, (1 + v j) :=
+ mul_le_mul_of_nonneg_left ih (by linarith [hv i])
+ exact H Finset.univ
+
+theorem sourceA_pos {L : ℝ} (hL : L ≠ 0) : 0 < sourceA L := by
+ unfold sourceA
+ positivity
+
+theorem sourceWeight_eq_physical (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :
+ sourceWeight d L k = exp (-(∑ i, (sourceC L * (k i : ℝ)) ^ 2) / 2) := by
+ have hc : sourceC L ^ 2 = 4 * sourceA L := by
+ unfold sourceC sourceA
+ ring
+ have hs : (∑ i, (sourceC L * (k i : ℝ)) ^ 2) =
+ 4 * sourceA L * ∑ i, (k i : ℝ) ^ 2 := by
+ rw [Finset.mul_sum]
+ apply Finset.sum_congr rfl
+ intro i _
+ rw [mul_pow, hc]
+ rw [sourceWeight, productDecay_eq_exp, hs]
+ congr 1
+ ring
+
+theorem sourceWeight_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (sourceWeight d L) := by
+ have ha : 0 < 2 * sourceA L := mul_pos (by norm_num) (sourceA_pos hL)
+ have hs : Summable (decay (2 * sourceA L)) := by
+ simpa using summable_decay_pow ha 0
+ exact finite_product_summable hs (fun k => (Real.exp_pos _).le) d
+
+theorem sourceZ_pos (d : ℕ) {L : ℝ} (hL : L ≠ 0) : 0 < sourceZ d L := by
+ apply (sourceWeight_summable d hL).tsum_pos
+ (fun k => by unfold sourceWeight productDecay decay; positivity) (fun _ => 0)
+ simp [sourceWeight, productDecay, decay]
+
+theorem pairedBound_eq_amplitude (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : Fin d → ℤ) :
+ pairedBound d L k = Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *
+ ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^ 4 := by
+ have hsqrt : Real.sqrt (sourceWeight d L k) = productDecay d (sourceA L) k := by
+ have hw : sourceWeight d L k = (productDecay d (sourceA L) k) ^ 2 := by
+ rw [sourceWeight, productDecay_eq_exp, productDecay_eq_exp, pow_two, ← Real.exp_add]
+ congr 1
+ ring
+ rw [hw, Real.sqrt_sq_eq_abs, abs_of_nonneg]
+ unfold productDecay decay
+ positivity
+ have hamp : Real.sqrt (2 * sourceWeight d L k / sourceZ d L) =
+ Real.sqrt (2 / sourceZ d L) * productDecay d (sourceA L) k := by
+ have he : 2 * sourceWeight d L k / sourceZ d L =
+ (2 / sourceZ d L) * sourceWeight d L k := by ring
+ rw [he, Real.sqrt_mul (by have := sourceZ_pos d hL; positivity), hsqrt]
+ have hp : productBound d (sourceA L) (sourceC L) k =
+ productDecay d (sourceA L) k * ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^ 4 := by
+ exact Finset.prod_mul_distrib
+ rw [pairedBound, hp, hamp]
+ ring
+
+theorem pairedBound_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :
+ Summable (pairedBound d L) := by
+ exact (productBound_summable (sourceA_pos hL) d).mul_left _
+
+theorem pairedBound_subtype_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)
+ (S : Set (Fin d → ℤ)) : Summable (fun k : S => pairedBound d L k) := by
+ exact (pairedBound_summable d hL).subtype S
+
+end I4Weights
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/D2SchurLinks.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/D2SchurLinks.lean
new file mode 100644
index 000000000..88d9bdeac
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/D2SchurLinks.lean
@@ -0,0 +1,390 @@
+import ResearchFormalCoreR1.D2Schur
+import Mathlib.LinearAlgebra.Matrix.Determinant.Basic
+import Mathlib.LinearAlgebra.Matrix.Notation
+import Mathlib.Analysis.SpecialFunctions.Trigonometric.Inverse
+
+/-!
+# W3Scratch.D2SchurLinks — SCRATCH / ENGINEERING ONLY
+
+Grok Bot agent 13, tasks W3d + W3e (Oct 7, 2026). Not reviewed, not aligned, not a discharge.
+A Lean lemma ≠ alignment acceptance ≠ discharge.
+
+Links between `ResearchFormalCoreR1.D2Schur` (raw moments m2, m4, m6; parameter q) and
+the source objects of reviews/side24_d2_certified_small_L_claude_20261005/NOTE.md
+(blob 852f7403, cumulants k2, k4, k6; direction u = (c, s)) and of Math-#302 comment
+6005199919 (body sha256 28f5d504...).
+
+Readings used (stated, not claimed as the author's intent):
+* NOTE L23 cumulant formulas are those of a symmetric coordinate law (odd moments zero).
+* NOTE L26: u = (c, s) is a unit direction, c² + s² = 1. The NOTE does not write it at L26, but the
+ sources support it: C (certified_d2.py, blob 6fd5b751) L12 states u = (cos t, sin t), NOTE L43
+ parametrizes u by an angle, and NOTE L27's Σu⁴ = 1 − 2q holds iff c² + s² = 1 (the residual is
+ (c² + s² − 1)(c² + s² + 1)). Reader 403/6051288028 item A2.
+-/
+
+noncomputable section
+namespace W3Scratch
+open ResearchFormalCoreR1
+
+/-! ## Source objects, written literally -/
+
+/-- NOTE L23. -/
+def k2 (m2 : ℝ) : ℝ := m2
+/-- NOTE L23. -/
+def k4 (m2 m4 : ℝ) : ℝ := m4 - 3 * m2 ^ 2
+/-- NOTE L23. -/
+def k6 (m2 m4 m6 : ℝ) : ℝ := m6 - 15 * m4 * m2 + 30 * m2 ^ 3
+/-- NOTE L30, in cumulants. -/
+def srcAlpha (m2 m4 q : ℝ) : ℝ := 3 * k2 m2 ^ 2 + k4 m2 m4 - 2 * k4 m2 m4 * q
+/-- NOTE L30, in cumulants. -/
+def srcGamma (m2 m4 q : ℝ) : ℝ := k2 m2 ^ 2 + 2 * k4 m2 m4 * q
+/-- NOTE L26. -/
+def srcQ (c s : ℝ) : ℝ := c ^ 2 * s ^ 2
+/-- NOTE L26. -/
+def srcE (c s : ℝ) : ℝ := c * s * (c ^ 2 - s ^ 2)
+/-- NOTE L34, first form, with e² = q(1 − 4q) (L28). -/
+def srcDet (m2 m4 q : ℝ) : ℝ :=
+ srcAlpha m2 m4 q * srcGamma m2 m4 q - k4 m2 m4 ^ 2 * (q * (1 - 4 * q))
+/-- NOTE L35, with e² = q(1 − 4q). -/
+def srcSchur (m2 m4 q : ℝ) : ℝ :=
+ srcAlpha m2 m4 q -
+ (srcGamma m2 m4 q ^ 3 + (2 * srcGamma m2 m4 q + srcAlpha m2 m4 q) * k4 m2 m4 ^ 2 *
+ (q * (1 - 4 * q))) / srcDet m2 m4 q
+/-- NOTE L36, in cumulants (division is Lean's total division). -/
+def srcTau (m2 m4 m6 q : ℝ) : ℝ :=
+ 6 * k2 m2 ^ 3 + 9 * k2 m2 * k4 m2 m4 * (1 - 2 * q) +
+ (k6 m2 m4 m6 - k4 m2 m4 ^ 2 / k2 m2) * (1 - 3 * q)
+/-- NOTE L43: q(θ) = (1 − cos 4θ)/8. -/
+def srcQTheta (θ : ℝ) : ℝ := (1 - Real.cos (4 * θ)) / 8
+
+/-! ## W3d (b): the missing link det V = αγ − k4² e² -/
+
+theorem d2Alpha_eq_src (m2 m4 q : ℝ) : d2Alpha m2 m4 q = srcAlpha m2 m4 q := by
+ unfold d2Alpha srcAlpha k2 k4; ring
+
+theorem d2Gamma_eq_src (m2 m4 q : ℝ) : d2Gamma m2 m4 q = srcGamma m2 m4 q := by
+ unfold d2Gamma srcGamma k2 k4; ring
+
+theorem srcE_sq (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :
+ srcE c s ^ 2 = srcQ c s * (1 - 4 * srcQ c s) := by
+ unfold srcE srcQ
+ have h : (c ^ 2 - s ^ 2) ^ 2 = (c ^ 2 + s ^ 2) ^ 2 - 4 * (c ^ 2 * s ^ 2) := by ring
+ rw [mul_pow, h, hu]; ring
+
+theorem d2DetV_eq_alpha_gamma_q (m2 m4 q : ℝ) :
+ d2DetV m2 m4 q = d2Alpha m2 m4 q * d2Gamma m2 m4 q - k4 m2 m4 ^ 2 * (q * (1 - 4 * q)) := by
+ unfold d2DetV d2Alpha d2Gamma k4; ring
+
+theorem d2DetV_eq_srcDet (m2 m4 q : ℝ) : d2DetV m2 m4 q = srcDet m2 m4 q := by
+ unfold srcDet; rw [d2DetV_eq_alpha_gamma_q, d2Alpha_eq_src, d2Gamma_eq_src]
+
+theorem d2DetV_eq_alpha_gamma_e (m2 m4 c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :
+ d2DetV m2 m4 (srcQ c s) =
+ srcAlpha m2 m4 (srcQ c s) * srcGamma m2 m4 (srcQ c s) - k4 m2 m4 ^ 2 * srcE c s ^ 2 := by
+ rw [srcE_sq c s hu, ← d2Alpha_eq_src, ← d2Gamma_eq_src]
+ exact d2DetV_eq_alpha_gamma_q m2 m4 (srcQ c s)
+
+theorem d2DetV_eq_det_varV (m2 m4 c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :
+ d2DetV m2 m4 (srcQ c s) =
+ Matrix.det !![srcAlpha m2 m4 (srcQ c s), -(k4 m2 m4 * srcE c s);
+ -(k4 m2 m4 * srcE c s), srcGamma m2 m4 (srcQ c s)] := by
+ rw [Matrix.det_fin_two_of, d2DetV_eq_alpha_gamma_e m2 m4 c s hu]; ring
+
+theorem d2DetV_eq_note_linear (m2 m4 q : ℝ) :
+ d2DetV m2 m4 q =
+ k2 m2 ^ 2 * (3 * k2 m2 ^ 2 + k4 m2 m4) + k4 m2 m4 * (4 * k2 m2 ^ 2 + k4 m2 m4) * q := by
+ unfold d2DetV k2 k4; ring
+
+/-- The unit-norm hypothesis cannot be dropped (c = s = 1, m2 = 1, m4 = 2). -/
+theorem d2DetV_eq_alpha_gamma_e_needs_unit :
+ d2DetV 1 2 (srcQ 1 1) ≠
+ srcAlpha 1 2 (srcQ 1 1) * srcGamma 1 2 (srcQ 1 1) - k4 1 2 ^ 2 * srcE 1 1 ^ 2 := by
+ unfold d2DetV srcAlpha srcGamma srcQ srcE k2 k4; norm_num
+
+/-! ## W3e (a): sweep lemma — q = c²s² over the unit circle is exactly [0, 1/4] -/
+
+theorem srcQ_mem_Icc (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) : srcQ c s ∈ Set.Icc (0 : ℝ) (1 / 4) := by
+ unfold srcQ
+ constructor
+ · positivity
+ · have h : (c ^ 2 + s ^ 2) ^ 2 - 4 * (c ^ 2 * s ^ 2) = (c ^ 2 - s ^ 2) ^ 2 := by ring
+ rw [hu] at h
+ nlinarith [sq_nonneg (c ^ 2 - s ^ 2)]
+
+theorem exists_unit_of_mem_Icc (q : ℝ) (hq : q ∈ Set.Icc (0 : ℝ) (1 / 4)) :
+ ∃ c s : ℝ, c ^ 2 + s ^ 2 = 1 ∧ srcQ c s = q := by
+ obtain ⟨hq0, hq1⟩ := hq
+ set r := Real.sqrt (1 - 4 * q) with hr
+ have hr0 : 0 ≤ r := Real.sqrt_nonneg _
+ have hr2 : r ^ 2 = 1 - 4 * q := Real.sq_sqrt (by linarith)
+ have hr1 : r ≤ 1 := by nlinarith
+ refine ⟨Real.sqrt ((1 + r) / 2), Real.sqrt ((1 - r) / 2), ?_, ?_⟩
+ · rw [Real.sq_sqrt (by linarith), Real.sq_sqrt (by linarith)]; ring
+ · unfold srcQ
+ rw [Real.sq_sqrt (by linarith), Real.sq_sqrt (by linarith)]
+ nlinarith
+
+/-- (a) Sweep lemma as a set equality. -/
+theorem unit_q_range :
+ {q : ℝ | ∃ c s : ℝ, c ^ 2 + s ^ 2 = 1 ∧ q = srcQ c s} = Set.Icc (0 : ℝ) (1 / 4) := by
+ ext q
+ constructor
+ · rintro ⟨c, s, hu, rfl⟩; exact srcQ_mem_Icc c s hu
+ · intro hq
+ obtain ⟨c, s, hu, h⟩ := exists_unit_of_mem_Icc q hq
+ exact ⟨c, s, hu, h.symm⟩
+
+/-- (a) Same, as an image of the unit circle. -/
+theorem unit_q_image :
+ (fun p : ℝ × ℝ => srcQ p.1 p.2) '' {p : ℝ × ℝ | p.1 ^ 2 + p.2 ^ 2 = 1} =
+ Set.Icc (0 : ℝ) (1 / 4) := by
+ rw [← unit_q_range]
+ ext q
+ constructor
+ · rintro ⟨⟨c, s⟩, hu, rfl⟩; exact ⟨c, s, hu, rfl⟩
+ · rintro ⟨c, s, hu, rfl⟩; exact ⟨⟨c, s⟩, hu, rfl⟩
+
+/-- NOTE L43's angle parameterization agrees with q = c²s² at (c, s) = (cos θ, sin θ). -/
+theorem srcQTheta_eq (θ : ℝ) : srcQTheta θ = srcQ (Real.cos θ) (Real.sin θ) := by
+ unfold srcQTheta srcQ
+ have h4 : Real.cos (4 * θ) = 2 * Real.cos (2 * θ) ^ 2 - 1 := by
+ rw [show 4 * θ = 2 * (2 * θ) by ring, Real.cos_two_mul]
+ have h2 : Real.cos (2 * θ) = 2 * Real.cos θ ^ 2 - 1 := Real.cos_two_mul θ
+ have hs : Real.sin θ ^ 2 = 1 - Real.cos θ ^ 2 := by
+ have := Real.sin_sq_add_cos_sq θ; linarith
+ rw [h4, h2, hs]; ring
+
+/-- (a) Angle form: the range of q(θ) = (1 − cos 4θ)/8 is exactly [0, 1/4]. -/
+theorem srcQTheta_range : Set.range srcQTheta = Set.Icc (0 : ℝ) (1 / 4) := by
+ ext q
+ constructor
+ · rintro ⟨θ, rfl⟩
+ rw [srcQTheta_eq]
+ exact srcQ_mem_Icc _ _ (by rw [add_comm]; exact Real.sin_sq_add_cos_sq θ)
+ · rintro ⟨hq0, hq1⟩
+ refine ⟨Real.arccos (1 - 8 * q) / 4, ?_⟩
+ unfold srcQTheta
+ rw [show 4 * (Real.arccos (1 - 8 * q) / 4) = Real.arccos (1 - 8 * q) by ring,
+ Real.cos_arccos (by linarith) (by linarith)]
+ ring
+
+/-! ## W3d (c) + W3e (a): the endpoint minimum, over q and over unit directions -/
+
+theorem d2_schur_endpoint_isLeast (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :
+ IsLeast (d2Schur m2 m4 '' Set.Icc (0 : ℝ) (1 / 4))
+ (d2Numerator m2 m4 / max (m2 ^ 2 * m4) ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4)) := by
+ constructor
+ · rcases le_total ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4) (m2 ^ 2 * m4) with h | h
+ · refine ⟨0, ⟨le_refl _, by norm_num⟩, ?_⟩
+ have hD := d2_det_pos m2 m4 0 hm2 hm4 (le_refl _) (by norm_num)
+ rw [d2_schur_ratio m2 m4 0 (ne_of_gt hD), d2_det_axis, max_eq_left h]
+ · refine ⟨1 / 4, ⟨by norm_num, le_refl _⟩, ?_⟩
+ have hD := d2_det_pos m2 m4 (1 / 4) hm2 hm4 (by norm_num) (le_refl _)
+ rw [d2_schur_ratio m2 m4 (1 / 4) (ne_of_gt hD), d2_det_diagonal, max_eq_right h]
+ · rintro _ ⟨q, ⟨hq0, hq1⟩, rfl⟩
+ exact d2_schur_endpoint_lower m2 m4 q hm2 hm4 hq0 hq1
+
+theorem d2_schur_endpoint_sInf (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :
+ sInf (d2Schur m2 m4 '' Set.Icc (0 : ℝ) (1 / 4)) =
+ d2Numerator m2 m4 / max (m2 ^ 2 * m4) ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4) :=
+ (d2_schur_endpoint_isLeast m2 m4 hm2 hm4).csInf_eq
+
+/-- (a) The comment's L33 minimum, stated directly over unit directions u = (c, s). -/
+theorem d2_schur_min_over_unit_directions (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :
+ IsLeast {σ : ℝ | ∃ c s : ℝ, c ^ 2 + s ^ 2 = 1 ∧ σ = d2Schur m2 m4 (srcQ c s)}
+ (d2Numerator m2 m4 / max (m2 ^ 2 * m4) ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4)) := by
+ have h : {σ : ℝ | ∃ c s : ℝ, c ^ 2 + s ^ 2 = 1 ∧ σ = d2Schur m2 m4 (srcQ c s)} =
+ d2Schur m2 m4 '' Set.Icc (0 : ℝ) (1 / 4) := by
+ rw [← unit_q_range]
+ ext σ
+ constructor
+ · rintro ⟨c, s, hu, rfl⟩; exact ⟨srcQ c s, ⟨c, s, hu, rfl⟩, rfl⟩
+ · rintro ⟨q, ⟨c, s, hu, rfl⟩, rfl⟩; exact ⟨c, s, hu, rfl⟩
+ rw [h]; exact d2_schur_endpoint_isLeast m2 m4 hm2 hm4
+
+/-- (a) The same minimum over the NOTE's angle θ ∈ ℝ (q(θ) = (1 − cos 4θ)/8). -/
+theorem d2_schur_min_over_angles (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :
+ IsLeast (Set.range fun θ : ℝ => d2Schur m2 m4 (srcQTheta θ))
+ (d2Numerator m2 m4 / max (m2 ^ 2 * m4) ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4)) := by
+ have h : (Set.range fun θ : ℝ => d2Schur m2 m4 (srcQTheta θ)) =
+ d2Schur m2 m4 '' Set.Icc (0 : ℝ) (1 / 4) := by
+ rw [← srcQTheta_range, ← Set.range_comp]; rfl
+ rw [h]; exact d2_schur_endpoint_isLeast m2 m4 hm2 hm4
+
+/-! ## W3e (b)1: cumulants ↔ raw moments -/
+
+/-- Inverse map (symmetric law): m4 = k4 + 3k2², m6 = k6 + 15 k2 k4 + 15 k2³. -/
+theorem moments_of_cumulants (m2 m4 m6 : ℝ) :
+ m2 = k2 m2 ∧ m4 = k4 m2 m4 + 3 * k2 m2 ^ 2 ∧
+ m6 = k6 m2 m4 m6 + 15 * k2 m2 * k4 m2 m4 + 15 * k2 m2 ^ 3 := by
+ unfold k2 k4 k6; refine ⟨rfl, by ring, by ring⟩
+
+/-- Round trip from cumulants: any (K2, K4, K6) is hit by exactly the moments above. -/
+theorem cumulants_of_moments (K2 K4 K6 : ℝ) :
+ k2 K2 = K2 ∧ k4 K2 (K4 + 3 * K2 ^ 2) = K4 ∧
+ k6 K2 (K4 + 3 * K2 ^ 2) (K6 + 15 * K2 * K4 + 15 * K2 ^ 3) = K6 := by
+ unfold k2 k4 k6; refine ⟨rfl, by ring, by ring⟩
+
+/-- NOTE L48 Gaussian reference: (k2, k4, k6) = (1, 0, 0) iff (m2, m4, m6) = (1, 3, 15). -/
+theorem gaussian_cumulants_iff (m2 m4 m6 : ℝ) :
+ (k2 m2 = 1 ∧ k4 m2 m4 = 0 ∧ k6 m2 m4 m6 = 0) ↔ (m2 = 1 ∧ m4 = 3 ∧ m6 = 15) := by
+ unfold k2 k4 k6
+ constructor
+ · rintro ⟨h2, h4, h6⟩
+ subst h2
+ have h4' : m4 = 3 := by linarith
+ subst h4'
+ exact ⟨rfl, rfl, by linarith⟩
+ · rintro ⟨rfl, rfl, rfl⟩; norm_num
+
+/-- Helper: (m4 − 3m2²)²/m2 = m4²/m2 − 6 m4 m2 + 9 m2³ for ALL real m2 (both sides 0 at m2 = 0). -/
+theorem k4_sq_div (m2 m4 : ℝ) :
+ k4 m2 m4 ^ 2 / k2 m2 = m4 ^ 2 / m2 - 6 * m4 * m2 + 9 * m2 ^ 3 := by
+ unfold k2 k4
+ rcases eq_or_ne m2 0 with h | h
+ · subst h; simp
+ · field_simp; ring
+
+/-- The NOTE's τ² in cumulants equals the Lean `d2Tau` with NO hypothesis on m2
+(the existing `d2_tau_cumulant_eq` assumes m2 ≠ 0; it is not needed). -/
+theorem d2Tau_eq_srcTau (m2 m4 m6 q : ℝ) : d2Tau m2 m4 m6 q = srcTau m2 m4 m6 q := by
+ unfold srcTau
+ rw [k4_sq_div]
+ unfold d2Tau d2Delta k2 k4 k6
+ ring
+
+/-- The NOTE's Σ_{A|V} in cumulants equals the Lean `d2Schur`, all real q, no hypotheses. -/
+theorem d2Schur_eq_srcSchur (m2 m4 q : ℝ) : d2Schur m2 m4 q = srcSchur m2 m4 q := by
+ unfold d2Schur srcSchur
+ rw [← d2DetV_eq_srcDet, ← d2Alpha_eq_src, ← d2Gamma_eq_src]
+ unfold k4; ring
+
+/-- Comment 6005199919 L15/L17 right-hand side: x(2x+b)(4x+b), x = m2², b = k4. -/
+theorem d2Numerator_eq_comment (m2 m4 : ℝ) :
+ d2Numerator m2 m4 = m2 ^ 2 * (2 * m2 ^ 2 + k4 m2 m4) * (4 * m2 ^ 2 + k4 m2 m4) := by
+ unfold d2Numerator k4; ring
+
+/-- Comment L29: Δ = m6 − m4²/m2 is literally `d2Delta`. NOTE's k6 − k4²/k2 in moments. -/
+theorem src_delta_cumulant (m2 m4 m6 : ℝ) :
+ k6 m2 m4 m6 - k4 m2 m4 ^ 2 / k2 m2 = d2Delta m2 m4 m6 - 9 * m4 * m2 + 21 * m2 ^ 3 := by
+ rw [k4_sq_div]; unfold k6 d2Delta; ring
+
+/-! ## W3e (b)3: all-q identities specialize to the source's restricted statements -/
+
+/-- Generic: an all-q statement restricts to [0, 1/4] and to every unit direction. -/
+theorem restrict_all_q {P : ℝ → Prop} (h : ∀ q, P q) :
+ (∀ q ∈ Set.Icc (0 : ℝ) (1 / 4), P q) ∧ (∀ c s : ℝ, c ^ 2 + s ^ 2 = 1 → P (srcQ c s)) :=
+ ⟨fun q _ => h q, fun c s _ => h (srcQ c s)⟩
+
+/-- NOTE §2 L34–36 in every unit direction, obtained from the all-q identities by specialization. -/
+theorem note_section2_every_direction (m2 m4 m6 c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :
+ srcQ c s ∈ Set.Icc (0 : ℝ) (1 / 4) ∧
+ d2DetV m2 m4 (srcQ c s) =
+ srcAlpha m2 m4 (srcQ c s) * srcGamma m2 m4 (srcQ c s) - k4 m2 m4 ^ 2 * srcE c s ^ 2 ∧
+ d2DetV m2 m4 (srcQ c s) = k2 m2 ^ 2 * (3 * k2 m2 ^ 2 + k4 m2 m4) +
+ k4 m2 m4 * (4 * k2 m2 ^ 2 + k4 m2 m4) * srcQ c s ∧
+ d2Schur m2 m4 (srcQ c s) = srcSchur m2 m4 (srcQ c s) ∧
+ d2Tau m2 m4 m6 (srcQ c s) = srcTau m2 m4 m6 (srcQ c s) ∧
+ d2Alpha m2 m4 (srcQ c s) * d2DetV m2 m4 (srcQ c s) - d2Gamma m2 m4 (srcQ c s) ^ 3 -
+ (2 * d2Gamma m2 m4 (srcQ c s) + d2Alpha m2 m4 (srcQ c s)) *
+ (m4 - 3 * m2 ^ 2) ^ 2 * srcQ c s * (1 - 4 * srcQ c s) = d2Numerator m2 m4 :=
+ ⟨srcQ_mem_Icc c s hu, d2DetV_eq_alpha_gamma_e m2 m4 c s hu, d2DetV_eq_note_linear _ _ _,
+ d2Schur_eq_srcSchur _ _ _, d2Tau_eq_srcTau _ _ _ _, d2_schur_numerator _ _ _⟩
+
+/-- NOTE L48 Gaussian controls hold on [0, 1/4] (specialization of `d2_gaussian_control`). -/
+theorem gaussian_control_on_Icc :
+ ∀ q ∈ Set.Icc (0 : ℝ) (1 / 4), d2DetV 1 3 q = 3 ∧ d2Schur 1 3 q = 8 / 3 ∧ d2Tau 1 3 15 q = 6 :=
+ (restrict_all_q d2_gaussian_control).1
+
+/-! ## W3e (b)2: positivity in every direction, general form -/
+
+/-- NOTE L59/L78 "positive in every direction", as a general real-variable statement:
+any moments with 0 < m2, m2² < m4, 0 < Δ give τ², det V, Σ_{A|V} > 0 for every unit u. -/
+theorem positivity_every_direction (m2 m4 m6 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)
+ (hΔ : 0 < d2Delta m2 m4 m6) (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :
+ 0 < d2DetV m2 m4 (srcQ c s) ∧ 0 < d2Schur m2 m4 (srcQ c s) ∧
+ 0 < d2Tau m2 m4 m6 (srcQ c s) := by
+ obtain ⟨h0, h1⟩ := srcQ_mem_Icc c s hu
+ exact ⟨d2_det_pos _ _ _ hm2 hm4 h0 h1, d2_schur_pos _ _ _ hm2 hm4 h0 h1,
+ d2_tau_pos _ _ _ _ hm2 hm4 hΔ h0 h1⟩
+
+/-- Weighted Lagrange identity (finite sums). -/
+theorem lagrange_weighted {ι : Type*} [Fintype ι] (p f g : ι → ℝ) :
+ 2 * ((∑ i, p i * f i ^ 2) * (∑ i, p i * g i ^ 2) - (∑ i, p i * (f i * g i)) ^ 2) =
+ ∑ i, ∑ j, p i * p j * (f i * g j - f j * g i) ^ 2 := by
+ have e : ∀ i j, p i * p j * (f i * g j - f j * g i) ^ 2 =
+ (p i * f i ^ 2) * (p j * g j ^ 2) + (p i * g i ^ 2) * (p j * f j ^ 2) -
+ (2 * (p i * (f i * g i))) * (p j * (f j * g j)) := by intro i j; ring
+ simp only [e, Finset.sum_sub_distrib, Finset.sum_add_distrib, ← Finset.mul_sum,
+ ← Finset.sum_mul]
+ ring
+
+/-- Raw moment of a finite weighted law. -/
+def finMoment {ι : Type*} [Fintype ι] (p x : ι → ℝ) (n : ℕ) : ℝ := ∑ i, p i * x i ^ n
+
+theorem double_sum_pos {ι : Type*} [Fintype ι] (F : ι → ι → ℝ) (hF : ∀ i j, 0 ≤ F i j)
+ (a b : ι) (hab : 0 < F a b) : 0 < ∑ i, ∑ j, F i j := by
+ apply Finset.sum_pos' (fun i _ => Finset.sum_nonneg (fun j _ => hF i j))
+ exact ⟨a, Finset.mem_univ _, Finset.sum_pos' (fun j _ => hF a j) ⟨b, Finset.mem_univ _, hab⟩⟩
+
+/-- Moment hypotheses for any finite probability law with two nonzero atoms of distinct squares
+(a finite-support analogue of D2MomentBridge's two-atom lemmas; self-contained). -/
+theorem finite_law_moment_hyps {ι : Type*} [Fintype ι] (p x : ι → ℝ) (hp : ∀ i, 0 ≤ p i)
+ (hsum : ∑ i, p i = 1) (a b : ι) (hpa : 0 < p a) (hpb : 0 < p b) (ha0 : x a ≠ 0)
+ (hb0 : x b ≠ 0) (hab : x a ^ 2 ≠ x b ^ 2) :
+ 0 < finMoment p x 2 ∧ finMoment p x 2 ^ 2 < finMoment p x 4 ∧
+ 0 < d2Delta (finMoment p x 2) (finMoment p x 4) (finMoment p x 6) := by
+ have hm2 : 0 < finMoment p x 2 := by
+ unfold finMoment
+ exact Finset.sum_pos' (fun i _ => mul_nonneg (hp i) (sq_nonneg _))
+ ⟨a, Finset.mem_univ _, mul_pos hpa (by positivity)⟩
+ -- m4 − m2² via f = 1, g = x²
+ have L1 := lagrange_weighted p (fun _ => (1 : ℝ)) (fun i => x i ^ 2)
+ have hpos1 : 0 < ∑ i, ∑ j, p i * p j * ((fun _ => (1 : ℝ)) i * (fun i => x i ^ 2) j -
+ (fun _ => (1 : ℝ)) j * (fun i => x i ^ 2) i) ^ 2 := by
+ apply double_sum_pos _ (fun i j => mul_nonneg (mul_nonneg (hp i) (hp j)) (sq_nonneg _)) a b
+ have : x b ^ 2 - x a ^ 2 ≠ 0 := sub_ne_zero.mpr (Ne.symm hab)
+ simp only [one_mul]
+ exact mul_pos (mul_pos hpa hpb) (by positivity)
+ have hm4 : finMoment p x 2 ^ 2 < finMoment p x 4 := by
+ have e1 : (∑ i, p i * (fun _ => (1 : ℝ)) i ^ 2) = 1 := by simpa using hsum
+ have e2 : (∑ i, p i * (fun i => x i ^ 2) i ^ 2) = finMoment p x 4 := by
+ unfold finMoment; refine Finset.sum_congr rfl (fun i _ => ?_); ring
+ have e3 : (∑ i, p i * ((fun _ => (1 : ℝ)) i * (fun i => x i ^ 2) i)) = finMoment p x 2 := by
+ unfold finMoment; refine Finset.sum_congr rfl (fun i _ => ?_); ring
+ rw [e1, e2, e3] at L1
+ linarith
+ -- m2 m6 − m4² via f = x, g = x³
+ have L2 := lagrange_weighted p x (fun i => x i ^ 3)
+ have hpos2 : 0 < ∑ i, ∑ j, p i * p j * (x i * (fun i => x i ^ 3) j -
+ x j * (fun i => x i ^ 3) i) ^ 2 := by
+ apply double_sum_pos _ (fun i j => mul_nonneg (mul_nonneg (hp i) (hp j)) (sq_nonneg _)) a b
+ have h1 : x a * x b ^ 3 - x b * x a ^ 3 = x a * x b * (x b ^ 2 - x a ^ 2) := by ring
+ have : x b ^ 2 - x a ^ 2 ≠ 0 := sub_ne_zero.mpr (Ne.symm hab)
+ simp only []
+ rw [h1]
+ exact mul_pos (mul_pos hpa hpb) (by positivity)
+ have hm6 : finMoment p x 4 ^ 2 < finMoment p x 2 * finMoment p x 6 := by
+ have e1 : (∑ i, p i * x i ^ 2) = finMoment p x 2 := rfl
+ have e2 : (∑ i, p i * (fun i => x i ^ 3) i ^ 2) = finMoment p x 6 := by
+ unfold finMoment; refine Finset.sum_congr rfl (fun i _ => ?_); ring
+ have e3 : (∑ i, p i * (x i * (fun i => x i ^ 3) i)) = finMoment p x 4 := by
+ unfold finMoment; refine Finset.sum_congr rfl (fun i _ => ?_); ring
+ rw [e1, e2, e3] at L2
+ linarith
+ refine ⟨hm2, hm4, ?_⟩
+ unfold d2Delta
+ rw [sub_pos, div_lt_iff₀ hm2]
+ linarith
+
+/-- (b)2 general statement for finite laws: positivity of τ², det V, Σ_{A|V} in every direction. -/
+theorem finite_law_positivity_every_direction {ι : Type*} [Fintype ι] (p x : ι → ℝ)
+ (hp : ∀ i, 0 ≤ p i) (hsum : ∑ i, p i = 1) (a b : ι) (hpa : 0 < p a) (hpb : 0 < p b)
+ (ha0 : x a ≠ 0) (hb0 : x b ≠ 0) (hab : x a ^ 2 ≠ x b ^ 2) (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :
+ 0 < d2DetV (finMoment p x 2) (finMoment p x 4) (srcQ c s) ∧
+ 0 < d2Schur (finMoment p x 2) (finMoment p x 4) (srcQ c s) ∧
+ 0 < d2Tau (finMoment p x 2) (finMoment p x 4) (finMoment p x 6) (srcQ c s) := by
+ obtain ⟨h2, h4, h6⟩ := finite_law_moment_hyps p x hp hsum a b hpa hpb ha0 hb0 hab
+ exact positivity_every_direction _ _ _ h2 h4 h6 c s hu
+
+end W3Scratch
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Law.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Law.lean
new file mode 100644
index 000000000..f94945d12
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Law.lean
@@ -0,0 +1,274 @@
+import W3Scratch.D2SchurLinks
+import Mathlib.NumberTheory.ModularForms.JacobiTheta.TwoVariable
+import Mathlib.Analysis.SpecialFunctions.Gaussian.PoissonSummation
+import Mathlib.RingTheory.Polynomial.Hermite.Gaussian
+
+/-!
+# W3Scratch.Side24Law — SCRATCH / ENGINEERING ONLY
+
+Grok Bot agent 13, task W3f (Oct 7, 2026). Not reviewed, not aligned, not a discharge.
+A Lean lemma ≠ alignment acceptance ≠ discharge.
+
+Merged sources only, Math- main @ 9fd261135b41daf1e377f9ef2db193fee6ec36be:
+* N = reviews/side24_d2_certified_small_L_claude_20261005/NOTE.md, blob 852f7403a8a06a1ef061e363df9502ae16f7a341
+ - N L21: `θ_L(t) = Σ_n e^{−(t+Ln)²/2}`, `q_L = θ_L/θ_L(0)`.
+ - N L22: one coordinate of the spectral law has raw moments m2, m4, m6.
+ - N L53: `θ_L^{(j)}(0) = Σ_n He_j(Ln) e^{−(Ln)²/2}` (image sums).
+ - N L54: Poisson-dual law `P(X = 2πk/L) ∝ e^{−(2πk/L)²/2}`.
+* C = reviews/side24_d2_certified_small_L_claude_20261005/certified_d2.py, blob 6fd5b751cc4157136ae92225838c12d33dc997f3
+ - C L8: same θ_L as N L21. C L111-121: He_2, He_4, He_6 (probabilists' Hermite).
+ - C L137-153 `moments_image`: returns `(-θ2/θ0, θ4/θ0, -θ6/θ0)`, i.e. m_j = (-1)^(j/2) θ^{(j)}(0)/θ(0).
+ - C L156-177 `moments_dual`: weights 1 (k = 0) and 2 e^{−(hk)²/2} (k ≥ 1), h = 2π/L; m_j = Σ w ω^j / Σ w.
+
+Readings (flagged): k ranges over ℤ (N L54 gives no range; C sums k = 0 plus 2× k ≥ 1, which is
+the symmetric ℤ-sum). The θ-route moment formula with the sign (-1)^(j/2) is stated in C L153
+(`moments_image`) and in iba1 NOTE (reviews/iba1_periodic_jet_claude_20261005/NOTE.md, blob
+e36e341f) L32 (m2 = −q2, m4 = q4, m6 = −q6), whose conventions N L24 and C L13 adopt; N does not
+write it directly. Reader 403/6051288028 item A1.
+-/
+
+noncomputable section
+namespace W3Scratch.Side24
+open ResearchFormalCoreR1 W3Scratch Real
+
+/-! ## Generic countable discrete law -/
+
+section Generic
+variable {ι : Type*} (w a : ι → ℝ)
+
+/-- Unnormalized moment sum Σ w_i a_i^n. -/
+def rawSum (n : ℕ) : ℝ := ∑' i, w i * a i ^ n
+/-- Normalized raw moment m_n = Σ w a^n / Σ w. -/
+def lawMoment (n : ℕ) : ℝ := rawSum w a n / rawSum w a 0
+
+variable {w a}
+
+theorem residual4_tsum (hs : ∀ n : ℕ, Summable fun i => w i * a i ^ n) (m : ℝ) :
+ Summable (fun i => w i * (a i ^ 2 - m) ^ 2) ∧
+ ∑' i, w i * (a i ^ 2 - m) ^ 2 = rawSum w a 4 - 2 * m * rawSum w a 2 + m ^ 2 * rawSum w a 0 := by
+ have e : (fun i => w i * (a i ^ 2 - m) ^ 2) =
+ fun i => (w i * a i ^ 4 - 2 * m * (w i * a i ^ 2)) + m ^ 2 * (w i * a i ^ 0) := by
+ funext i; ring
+ have h1 : Summable fun i => w i * a i ^ 4 - 2 * m * (w i * a i ^ 2) :=
+ (hs 4).sub ((hs 2).mul_left _)
+ have h2 : Summable fun i => m ^ 2 * (w i * a i ^ 0) := (hs 0).mul_left _
+ refine ⟨e ▸ h1.add h2, ?_⟩
+ rw [e, h1.tsum_add h2, (hs 4).tsum_sub ((hs 2).mul_left _), tsum_mul_left, tsum_mul_left]
+ rfl
+
+theorem residual6_tsum (hs : ∀ n : ℕ, Summable fun i => w i * a i ^ n) (c : ℝ) :
+ Summable (fun i => w i * (a i ^ 3 - c * a i) ^ 2) ∧
+ ∑' i, w i * (a i ^ 3 - c * a i) ^ 2 =
+ rawSum w a 6 - 2 * c * rawSum w a 4 + c ^ 2 * rawSum w a 2 := by
+ have e : (fun i => w i * (a i ^ 3 - c * a i) ^ 2) =
+ fun i => (w i * a i ^ 6 - 2 * c * (w i * a i ^ 4)) + c ^ 2 * (w i * a i ^ 2) := by
+ funext i; ring
+ have h1 : Summable fun i => w i * a i ^ 6 - 2 * c * (w i * a i ^ 4) :=
+ (hs 6).sub ((hs 4).mul_left _)
+ have h2 : Summable fun i => c ^ 2 * (w i * a i ^ 2) := (hs 2).mul_left _
+ refine ⟨e ▸ h1.add h2, ?_⟩
+ rw [e, h1.tsum_add h2, (hs 6).tsum_sub ((hs 4).mul_left _), tsum_mul_left, tsum_mul_left]
+ rfl
+
+theorem sq_pos_of_ne {x : ℝ} (hx : x ≠ 0) : 0 < x ^ 2 :=
+ lt_of_le_of_ne (sq_nonneg _) (Ne.symm (pow_ne_zero 2 hx))
+
+/-- Countable-support analogue of `finite_law_moment_hyps`: two nonzero atoms with distinct squares
+give 0 < m2, m2² < m4 and Δ > 0. -/
+theorem countable_law_moment_hyps (hw : ∀ i, 0 ≤ w i)
+ (hs : ∀ n : ℕ, Summable fun i => w i * a i ^ n) (i j : ι) (hwi : 0 < w i) (hwj : 0 < w j)
+ (hai : a i ≠ 0) (haj : a j ≠ 0) (hij : a i ^ 2 ≠ a j ^ 2) :
+ 0 < lawMoment w a 2 ∧ lawMoment w a 2 ^ 2 < lawMoment w a 4 ∧
+ 0 < d2Delta (lawMoment w a 2) (lawMoment w a 4) (lawMoment w a 6) := by
+ have hZ : 0 < rawSum w a 0 :=
+ (hs 0).tsum_pos (fun k => by rw [pow_zero, mul_one]; exact hw k) i
+ (by rw [pow_zero, mul_one]; exact hwi)
+ have hS2 : 0 < rawSum w a 2 :=
+ (hs 2).tsum_pos (fun k => mul_nonneg (hw k) (sq_nonneg _)) i (mul_pos hwi (sq_pos_of_ne hai))
+ -- pick an atom whose square differs from a given value
+ have pick : ∀ v : ℝ, ∃ k, 0 < w k ∧ a k ≠ 0 ∧ a k ^ 2 ≠ v := by
+ intro v
+ by_cases h : a i ^ 2 = v
+ · exact ⟨j, hwj, haj, fun h' => hij (h.trans h'.symm)⟩
+ · exact ⟨i, hwi, hai, h⟩
+ set Z := rawSum w a 0 with hZdef
+ set S2 := rawSum w a 2
+ set S4 := rawSum w a 4
+ set S6 := rawSum w a 6
+ -- m4 − m2² > 0
+ obtain ⟨k, hwk, -, hk⟩ := pick (S2 / Z)
+ obtain ⟨hsum4, heq4⟩ := residual4_tsum hs (S2 / Z)
+ have hpos4 : 0 < ∑' i, w i * (a i ^ 2 - S2 / Z) ^ 2 :=
+ hsum4.tsum_pos (fun i => mul_nonneg (hw i) (sq_nonneg _)) k
+ (mul_pos hwk (sq_pos_of_ne (sub_ne_zero.mpr hk)))
+ rw [heq4] at hpos4
+ have h4 : 0 < S4 * Z - S2 ^ 2 := by
+ have e : S4 - 2 * (S2 / Z) * S2 + (S2 / Z) ^ 2 * Z = (S4 * Z - S2 ^ 2) / Z := by
+ field_simp; ring
+ rw [e] at hpos4
+ exact (div_pos_iff_of_pos_right hZ).mp hpos4
+ -- m2 m6 − m4² > 0
+ obtain ⟨k', hwk', hak', hk'⟩ := pick (S4 / S2)
+ obtain ⟨hsum6, heq6⟩ := residual6_tsum hs (S4 / S2)
+ have hpos6 : 0 < ∑' i, w i * (a i ^ 3 - S4 / S2 * a i) ^ 2 := by
+ refine hsum6.tsum_pos (fun i => mul_nonneg (hw i) (sq_nonneg _)) k' (mul_pos hwk' ?_)
+ have : a k' ^ 3 - S4 / S2 * a k' = a k' * (a k' ^ 2 - S4 / S2) := by ring
+ rw [this]
+ exact sq_pos_of_ne (mul_ne_zero hak' (sub_ne_zero.mpr hk'))
+ rw [heq6] at hpos6
+ have h6 : 0 < S6 * S2 - S4 ^ 2 := by
+ have e : S6 - 2 * (S4 / S2) * S4 + (S4 / S2) ^ 2 * S2 = (S6 * S2 - S4 ^ 2) / S2 := by
+ field_simp; ring
+ rw [e] at hpos6
+ exact (div_pos_iff_of_pos_right hS2).mp hpos6
+ refine ⟨div_pos hS2 hZ, ?_, ?_⟩
+ · unfold lawMoment
+ rw [div_pow, div_lt_div_iff₀ (by positivity) hZ]
+ nlinarith [mul_pos h4 hZ]
+ · unfold lawMoment d2Delta
+ have e : S6 / Z - (S4 / Z) ^ 2 / (S2 / Z) = (S6 * S2 - S4 ^ 2) / (Z * S2) := by
+ field_simp
+ rw [e]; exact div_pos h6 (mul_pos hZ hS2)
+
+end Generic
+
+/-! ## The SIDE24 Poisson-dual law (N L54; C L156-177) -/
+
+/-- Atom 2πk/L (N L54). -/
+def atom (L : ℝ) (k : ℤ) : ℝ := 2 * π * k / L
+/-- Unnormalized weight e^{−(2πk/L)²/2} (N L54). -/
+def weight (L : ℝ) (k : ℤ) : ℝ := Real.exp (-(atom L k) ^ 2 / 2)
+/-- Normalizer Σ_k e^{−(2πk/L)²/2}. -/
+def dualZ (L : ℝ) : ℝ := rawSum (weight L) (atom L) 0
+/-- Raw moment m_n(L) of the dual law (C L176-177: w[j]/w[0]). -/
+def dualMoment (L : ℝ) (n : ℕ) : ℝ := lawMoment (weight L) (atom L) n
+
+theorem weight_pos (L : ℝ) (k : ℤ) : 0 < weight L k := Real.exp_pos _
+
+/-- Summability of Σ_k w_k · atom_k^n for every n (in particular n = 6: X⁶ integrability). -/
+theorem summable_weight_mul_atom_pow {L : ℝ} (hL : L ≠ 0) (n : ℕ) :
+ Summable fun k : ℤ => weight L k * atom L k ^ n := by
+ have hT : 0 < 2 * π / L ^ 2 := by positivity
+ have hb := (summable_pow_mul_jacobiTheta₂_term_bound 0 hT n).mul_left ((2 * π / |L|) ^ n)
+ refine Summable.of_norm_bounded hb (fun k => le_of_eq ?_)
+ have hexp : -(atom L k) ^ 2 / 2 = -π * (2 * π / L ^ 2 * (k : ℝ) ^ 2 - 2 * 0 * |(k : ℝ)|) := by
+ unfold atom; field_simp; ring
+ have habs : |atom L k| = 2 * π / |L| * |(k : ℝ)| := by
+ unfold atom
+ rw [abs_div, abs_mul, abs_mul, abs_two, abs_of_pos pi_pos]
+ ring
+ rw [Real.norm_eq_abs, abs_mul, abs_pow, weight, abs_of_pos (Real.exp_pos _), habs, hexp,
+ mul_pow]
+ simp only [Int.cast_abs]
+ ring
+
+/-- X⁶ integrability of the dual law, stated as summability. -/
+theorem summable_sixth {L : ℝ} (hL : L ≠ 0) : Summable fun k : ℤ => weight L k * atom L k ^ 6 :=
+ summable_weight_mul_atom_pow hL 6
+
+theorem dualZ_pos {L : ℝ} (hL : L ≠ 0) : 0 < dualZ L :=
+ (summable_weight_mul_atom_pow hL 0).tsum_pos
+ (fun k => by rw [pow_zero, mul_one]; exact (weight_pos L k).le) 0
+ (by rw [pow_zero, mul_one]; exact weight_pos L 0)
+
+/-- Normalization: the probabilities w_k / Z sum to 1. -/
+theorem dual_normalized {L : ℝ} (hL : L ≠ 0) : ∑' k : ℤ, weight L k / dualZ L = 1 := by
+ have h := dualZ_pos hL
+ rw [tsum_div_const]
+ have : ∑' k : ℤ, weight L k = dualZ L := by
+ unfold dualZ rawSum; simp only [pow_zero, mul_one]
+ rw [this, div_self (ne_of_gt h)]
+
+/-- Symmetry: odd raw moments vanish (atom(−k) = −atom(k), weight even). -/
+theorem dual_odd_moment_zero (L : ℝ) (m : ℕ) : rawSum (weight L) (atom L) (2 * m + 1) = 0 := by
+ unfold rawSum
+ have hneg : ∀ k : ℤ, weight L (-k) * atom L (-k) ^ (2 * m + 1) =
+ -(weight L k * atom L k ^ (2 * m + 1)) := by
+ intro k
+ have ha : atom L (-k) = -atom L k := by unfold atom; push_cast; ring
+ rw [weight, weight, ha, neg_sq, Odd.neg_pow ⟨m, rfl⟩]; ring
+ have h := tsum_comp_neg (fun k : ℤ => weight L k * atom L k ^ (2 * m + 1))
+ simp only [hneg, tsum_neg] at h
+ linarith
+
+/-- Moment hypotheses for the SIDE24 dual law at EVERY nonzero period L (atoms k = 1, 2). -/
+theorem dual_moment_hyps {L : ℝ} (hL : L ≠ 0) :
+ 0 < dualMoment L 2 ∧ dualMoment L 2 ^ 2 < dualMoment L 4 ∧
+ 0 < d2Delta (dualMoment L 2) (dualMoment L 4) (dualMoment L 6) := by
+ have h1 : atom L 1 ≠ 0 := by
+ unfold atom; push_cast; exact div_ne_zero (by positivity) hL
+ have h2 : atom L 2 ≠ 0 := by
+ unfold atom; push_cast; exact div_ne_zero (by positivity) hL
+ have h12 : atom L 1 ^ 2 ≠ atom L 2 ^ 2 := by
+ unfold atom; push_cast
+ intro h
+ have hpi : (2 * π / L) ^ 2 ≠ 0 := pow_ne_zero 2 (div_ne_zero (by positivity) hL)
+ apply hpi
+ have : (2 * π * 2 / L) ^ 2 = 4 * (2 * π / L) ^ 2 := by ring
+ have : (2 * π * 1 / L) ^ 2 = (2 * π / L) ^ 2 := by ring
+ linarith
+ exact countable_law_moment_hyps (fun k => (weight_pos L k).le) (summable_weight_mul_atom_pow hL)
+ 1 2 (weight_pos L 1) (weight_pos L 2) h1 h2 h12
+
+/-- Every-direction positivity for the exact dual-law moments, at every nonzero L. This is a new
+all-L ≠ 0 statement. N certifies "positive in every direction" (N L59, L78) only numerically, by
+interval enclosures, at the six values L ∈ {24, 8, 2π, 4, 3, 2} (N L17, L65-73); this theorem is
+not that certificate, and identifying the two needs analytic question (a) of the README. -/
+theorem dual_positivity_every_direction {L : ℝ} (hL : L ≠ 0) (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :
+ 0 < d2DetV (dualMoment L 2) (dualMoment L 4) (srcQ c s) ∧
+ 0 < d2Schur (dualMoment L 2) (dualMoment L 4) (srcQ c s) ∧
+ 0 < d2Tau (dualMoment L 2) (dualMoment L 4) (dualMoment L 6) (srcQ c s) := by
+ obtain ⟨h2, h4, h6⟩ := dual_moment_hyps hL
+ exact positivity_every_direction _ _ _ h2 h4 h6 c s hu
+
+/-! ## The θ-series route (N L21, L53; C L137-153) -/
+
+/-- θ_L(t) = Σ_n e^{−(t+Ln)²/2} (N L21). -/
+def theta (L t : ℝ) : ℝ := ∑' n : ℤ, Real.exp (-(t + L * n) ^ 2 / 2)
+/-- Image sum Σ_n He_j(Ln) e^{−(Ln)²/2} (N L53), probabilists' Hermite `Polynomial.hermite`. -/
+def imageSum (L : ℝ) (j : ℕ) : ℝ :=
+ ∑' n : ℤ, Polynomial.aeval (L * n) (Polynomial.hermite j) * Real.exp (-(L * n) ^ 2 / 2)
+/-- θ-route moment m_j = (−1)^(j/2) θ^{(j)}(0)/θ(0), via image sums (C L153). -/
+def imageMoment (L : ℝ) (j : ℕ) : ℝ := (-1) ^ (j / 2) * imageSum L j / imageSum L 0
+
+theorem imageSum_zero (L : ℝ) : imageSum L 0 = theta L 0 := by
+ unfold imageSum theta
+ simp [Polynomial.hermite_zero]
+
+/-- Poisson link, j = 0 (closed): θ_L(0) = (L²/(2π))^{−1/2} · Σ_k e^{−(2πk/L)²/2}, from
+Mathlib's `Real.tsum_exp_neg_mul_int_sq`. -/
+theorem theta_zero_eq_dual {L : ℝ} (hL : L ≠ 0) :
+ theta L 0 = 1 / (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ) * dualZ L := by
+ have ha : 0 < L ^ 2 / (2 * π) := by positivity
+ have h := Real.tsum_exp_neg_mul_int_sq ha
+ have e1 : ∀ n : ℤ, Real.exp (-π * (L ^ 2 / (2 * π)) * (n : ℝ) ^ 2) =
+ Real.exp (-((0 : ℝ) + L * n) ^ 2 / 2) := by
+ intro n; congr 1; field_simp; ring
+ have e2 : ∀ n : ℤ, Real.exp (-π / (L ^ 2 / (2 * π)) * (n : ℝ) ^ 2) = weight L n * atom L n ^ 0 := by
+ intro n; rw [pow_zero, mul_one, weight, atom]; congr 1; field_simp
+ simp only [e1, e2] at h
+ exact h
+
+/-- Step (iii) of the Poisson link, closed: the j-th t-derivative at 0 of one θ-term is
+(−1)^j He_j(y) e^{−y²/2} (Mathlib `deriv_gaussian_eq_hermite_mul_gaussian`). -/
+theorem theta_term_iteratedDeriv (y : ℝ) (j : ℕ) :
+ iteratedDeriv j (fun t => Real.exp (-(t + y) ^ 2 / 2)) 0 =
+ (-1 : ℝ) ^ j * Polynomial.aeval y (Polynomial.hermite j) * Real.exp (-y ^ 2 / 2) := by
+ have h := congrFun (iteratedDeriv_comp_add_const j (fun z : ℝ => Real.exp (-(z ^ 2 / 2))) y) 0
+ simp only [zero_add] at h
+ have hf : (fun t : ℝ => Real.exp (-(t + y) ^ 2 / 2)) = fun z => Real.exp (-((z + y) ^ 2 / 2)) := by
+ funext t; congr 1; ring
+ rw [hf, h, iteratedDeriv_eq_iterate, Polynomial.deriv_gaussian_eq_hermite_mul_gaussian]
+ congr 2; ring
+
+/-- N L53 holds termwise: the image sum of even order is the sum of the termwise 2m-th
+derivatives of θ_L at 0. (The exchange of Σ and d/dt, for L ≠ 0, is in `Side24Poisson`:
+`iteratedDeriv_theta`, `iteratedDeriv_theta_zero_even`.) -/
+theorem imageSum_even_eq_tsum_termwise (L : ℝ) (m : ℕ) :
+ imageSum L (2 * m) =
+ ∑' n : ℤ, iteratedDeriv (2 * m) (fun t => Real.exp (-(t + L * n) ^ 2 / 2)) 0 := by
+ unfold imageSum
+ congr 1; funext n
+ rw [theta_term_iteratedDeriv, pow_mul, neg_one_sq, one_pow, one_mul]
+
+end W3Scratch.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Poisson.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Poisson.lean
new file mode 100644
index 000000000..881e82f3a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Poisson.lean
@@ -0,0 +1,342 @@
+import W3Scratch.Side24Law
+
+/-!
+# W3Scratch.Side24Poisson — SCRATCH / ENGINEERING ONLY
+
+Grok Bot agent 13, task W3g (Oct 7, 2026). Not reviewed, not aligned, not a discharge.
+A Lean lemma ≠ alignment acceptance ≠ discharge.
+
+Extends `W3Scratch.Side24Law` (W3f). Sources as there (Math- main @ 9fd26113, unchanged at
+8d70baa7): N = NOTE.md blob 852f7403 (L21, L53, L54), C = certified_d2.py blob 6fd5b751
+(L137-153, L156-177). Reading R1 (k ∈ ℤ) as in W3f. The sign (-1)^(j/2) is stated in C L153 and
+iba1 NOTE (blob e36e341f) L32; c²+s²=1 is supported by C L12 (see W3f and reader 403/6051288028).
+N L53 writes θ_L^{(j)}(0) = Σ_n He_j(Ln) e^{−(Ln)²/2} with no sign. Here it is formalized for even j
+(`iteratedDeriv_theta_zero_even`). For odd j it also holds as written (not formalized here):
+the termwise derivative carries (−1)^j (Mathlib `deriv_gaussian_eq_hermite_mul_gaussian`), and
+reindexing n → −n with He_j(−x) = (−1)^j He_j(x) removes it; both sides vanish because θ_L is even.
+So this is not a source discrepancy (reader 403/6051288028 item A3). N and C use only
+j = 0, 2, 4, 6 (C L144; iba1 NOTE L29).
+The W3f commented target `imageMoment_eq_dualMoment` (0 < L) is proved below under L ≠ 0. (That
+stale W3f comment block was removed from Side24Law.lean in the Math-#403 amend.)
+-/
+
+noncomputable section
+namespace W3Scratch.Side24
+open ResearchFormalCoreR1 W3Scratch Real
+open scoped ContDiff
+
+/-! ## (a) General-t real θ cosine identity (Poisson summation) -/
+
+/-- θ_L(t) = (L²/(2π))^{-1/2} Σ_k w_k cos(2πkt/L) for every real t, L ≠ 0. -/
+theorem theta_eq_cos_series {L : ℝ} (hL : L ≠ 0) (t : ℝ) :
+ theta L t = 1 / (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ) *
+ ∑' k : ℤ, weight L k * Real.cos (atom L k * t) := by
+ have ha0 : 0 < L ^ 2 / (2 * π) := by positivity
+ set a : ℂ := ((L ^ 2 / (2 * π) : ℝ) : ℂ) with ha_def
+ set b : ℂ := ((-(t * L / (2 * π)) : ℝ) : ℂ) with hb_def
+ have ha : 0 < a.re := by rw [ha_def, Complex.ofReal_re]; exact ha0
+ have h := Complex.tsum_exp_neg_quadratic ha b
+ have hL1 : ∀ n : ℤ, Complex.exp (-((π : ℝ) : ℂ) * a * (n : ℂ) ^ 2 + 2 * ((π : ℝ) : ℂ) * b * (n : ℂ))
+ = ((Real.exp (t ^ 2 / 2) * Real.exp (-(t + L * n) ^ 2 / 2) : ℝ) : ℂ) := by
+ intro n
+ rw [Complex.ofReal_mul, Complex.ofReal_exp, Complex.ofReal_exp, ← Complex.exp_add]
+ congr 1
+ rw [ha_def, hb_def]; push_cast
+ field_simp
+ ring
+ have hR1 : ∀ n : ℤ, Complex.exp (-((π : ℝ) : ℂ) / a * ((n : ℂ) + Complex.I * b) ^ 2)
+ = ((Real.exp (t ^ 2 / 2) : ℝ) : ℂ) *
+ (((weight L n : ℝ) : ℂ) * Complex.exp (((atom L n * t : ℝ) : ℂ) * Complex.I)) := by
+ intro n
+ rw [weight, Complex.ofReal_exp, Complex.ofReal_exp, ← Complex.exp_add, ← Complex.exp_add]
+ congr 1
+ have hLc : (L : ℂ) ≠ 0 := Complex.ofReal_ne_zero.mpr hL
+ have hπc : ((π : ℝ) : ℂ) ≠ 0 := Complex.ofReal_ne_zero.mpr Real.pi_ne_zero
+ rw [ha_def, hb_def, atom]; push_cast
+ field_simp
+ linear_combination (-(L : ℂ) ^ 2 * (t : ℂ) ^ 2) * Complex.I_sq
+ have hS : Summable fun n : ℤ =>
+ ((weight L n : ℝ) : ℂ) * Complex.exp (((atom L n * t : ℝ) : ℂ) * Complex.I) := by
+ refine Summable.of_norm ?_
+ have : (fun n : ℤ => ‖((weight L n : ℝ) : ℂ) * Complex.exp (((atom L n * t : ℝ) : ℂ) * Complex.I)‖)
+ = fun n : ℤ => weight L n * atom L n ^ 0 := by
+ funext n
+ rw [norm_mul, Complex.norm_exp_ofReal_mul_I, Complex.norm_real, Real.norm_eq_abs,
+ abs_of_pos (weight_pos L n), pow_zero]
+ rw [this]; exact summable_weight_mul_atom_pow hL 0
+ have hre : (∑' n : ℤ, ((weight L n : ℝ) : ℂ) *
+ Complex.exp (((atom L n * t : ℝ) : ℂ) * Complex.I)).re =
+ ∑' k : ℤ, weight L k * Real.cos (atom L k * t) := by
+ rw [Complex.re_tsum hS]
+ congr 1; funext n
+ rw [Complex.re_ofReal_mul, Complex.exp_ofReal_mul_I_re]
+ have hcp : (1 : ℂ) / a ^ (1 / 2 : ℂ) = (((1 / (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ)) : ℝ) : ℂ) := by
+ rw [Complex.ofReal_div, Complex.ofReal_one, Complex.ofReal_cpow ha0.le, ha_def]
+ push_cast; rfl
+ have hl : ∑' n : ℤ, Complex.exp (-((π : ℝ) : ℂ) * a * (n : ℂ) ^ 2 + 2 * ((π : ℝ) : ℂ) * b * (n : ℂ))
+ = ((Real.exp (t ^ 2 / 2) * theta L t : ℝ) : ℂ) := by
+ rw [tsum_congr hL1, ← Complex.ofReal_tsum, tsum_mul_left]; rfl
+ have hr : ∑' n : ℤ, Complex.exp (-((π : ℝ) : ℂ) / a * ((n : ℂ) + Complex.I * b) ^ 2)
+ = ((Real.exp (t ^ 2 / 2) : ℝ) : ℂ) * ∑' n : ℤ,
+ (((weight L n : ℝ) : ℂ) * Complex.exp (((atom L n * t : ℝ) : ℂ) * Complex.I)) := by
+ rw [tsum_congr hR1, tsum_mul_left]
+ rw [hl, hr, hcp] at h
+ have h2 := congrArg Complex.re h
+ rw [Complex.ofReal_re, Complex.re_ofReal_mul, Complex.re_ofReal_mul, hre] at h2
+ have hE := Real.exp_pos (t ^ 2 / 2)
+ exact mul_left_cancel₀ hE.ne' (by rw [h2]; ring)
+
+/-! ## (b) Term-by-term differentiation of both series -/
+
+/-- Standard Gaussian e^{-x²/2}, in the form used by Mathlib's Hermite lemma. -/
+def gauss : ℝ → ℝ := fun y => Real.exp (-(y ^ 2 / 2))
+
+theorem contDiff_gauss : ContDiff ℝ ∞ gauss := by unfold gauss; fun_prop
+
+theorem hasDerivAt_iterate_deriv_gauss (j : ℕ) (x : ℝ) :
+ HasDerivAt (deriv^[j] gauss) (deriv^[j + 1] gauss x) x := by
+ rw [Function.iterate_succ_apply']
+ exact ((contDiff_gauss.iterate_deriv j).differentiable (by simp)).differentiableAt.hasDerivAt
+
+/-- Every real polynomial is bounded by B e^{|x|}. -/
+theorem poly_exp_bound (p : Polynomial ℤ) :
+ ∃ B : ℝ, 0 ≤ B ∧ ∀ x : ℝ, |Polynomial.aeval x p| ≤ B * Real.exp |x| := by
+ induction p using Polynomial.induction_on' with
+ | add p q hp hq =>
+ obtain ⟨B1, hB1, h1⟩ := hp
+ obtain ⟨B2, hB2, h2⟩ := hq
+ refine ⟨B1 + B2, add_nonneg hB1 hB2, fun x => ?_⟩
+ rw [map_add]
+ calc |Polynomial.aeval x p + Polynomial.aeval x q|
+ ≤ |Polynomial.aeval x p| + |Polynomial.aeval x q| := abs_add_le _ _
+ _ ≤ B1 * Real.exp |x| + B2 * Real.exp |x| := add_le_add (h1 x) (h2 x)
+ _ = (B1 + B2) * Real.exp |x| := by ring
+ | monomial n c =>
+ refine ⟨|(c : ℝ)| * n.factorial, by positivity, fun x => ?_⟩
+ simp only [Polynomial.aeval_monomial, algebraMap_int_eq, Int.coe_castRingHom]
+ rw [abs_mul, abs_pow, mul_assoc]
+ refine mul_le_mul_of_nonneg_left ?_ (abs_nonneg _)
+ have h := Real.pow_div_factorial_le_exp (x := |x|) (abs_nonneg x) n
+ rw [div_le_iff₀ (by positivity)] at h
+ linarith [mul_comm (Real.exp |x|) (n.factorial : ℝ)]
+
+theorem abs_sub_sq_le {L R t : ℝ} (ht : |t| ≤ R) (n : ℤ) :
+ |t + L * n| - (t + L * n) ^ 2 / 2 ≤
+ R + -π * (L ^ 2 / (2 * π) * (n : ℝ) ^ 2 - 2 * ((R + 1) * |L| / (2 * π)) * |(n : ℝ)|) := by
+ have e : -π * (L ^ 2 / (2 * π) * (n : ℝ) ^ 2 - 2 * ((R + 1) * |L| / (2 * π)) * |(n : ℝ)|)
+ = -(L * n) ^ 2 / 2 + (R + 1) * |L * n| := by
+ rw [abs_mul]; field_simp; ring
+ rw [e]
+ set m := L * (n : ℝ)
+ have h1 : |t + m| ≤ |t| + |m| := abs_add_le t m
+ have h2 : -(t * m) ≤ |t| * |m| := by rw [← abs_mul]; exact neg_le_abs _
+ have h3 : |t| * |m| ≤ R * |m| := mul_le_mul_of_nonneg_right ht (abs_nonneg m)
+ nlinarith [sq_nonneg t, abs_nonneg m]
+
+/-- Uniform majorant for g^{(j)}(t + Ln) on |t| ≤ R. -/
+theorem iterate_deriv_gauss_bound (j : ℕ) : ∃ B : ℝ, 0 ≤ B ∧ ∀ (L R t : ℝ), |t| ≤ R → ∀ n : ℤ,
+ ‖deriv^[j] gauss (t + L * n)‖ ≤ B * (Real.exp R *
+ Real.exp (-π * (L ^ 2 / (2 * π) * (n : ℝ) ^ 2 - 2 * ((R + 1) * |L| / (2 * π)) * |(n : ℝ)|))) := by
+ obtain ⟨B, hB, hb⟩ := poly_exp_bound (Polynomial.hermite j)
+ refine ⟨B, hB, fun L R t ht n => ?_⟩
+ unfold gauss
+ rw [Polynomial.deriv_gaussian_eq_hermite_mul_gaussian, Real.norm_eq_abs, abs_mul, abs_mul,
+ abs_pow, abs_neg, abs_one, one_pow, one_mul, abs_of_pos (Real.exp_pos _)]
+ calc |Polynomial.aeval (t + L * n) (Polynomial.hermite j)| * Real.exp (-((t + L * n) ^ 2 / 2))
+ ≤ B * Real.exp |t + L * n| * Real.exp (-((t + L * n) ^ 2 / 2)) :=
+ mul_le_mul_of_nonneg_right (hb _) (Real.exp_pos _).le
+ _ = B * Real.exp (|t + L * n| - (t + L * n) ^ 2 / 2) := by
+ rw [sub_eq_add_neg, Real.exp_add]; ring
+ _ ≤ B * Real.exp (R + -π * (L ^ 2 / (2 * π) * (n : ℝ) ^ 2 -
+ 2 * ((R + 1) * |L| / (2 * π)) * |(n : ℝ)|)) :=
+ mul_le_mul_of_nonneg_left (Real.exp_le_exp.mpr (abs_sub_sq_le ht n)) hB
+ _ = _ := by rw [Real.exp_add]
+
+theorem summable_majorant {L : ℝ} (hL : L ≠ 0) (B R : ℝ) :
+ Summable fun n : ℤ => B * (Real.exp R *
+ Real.exp (-π * (L ^ 2 / (2 * π) * (n : ℝ) ^ 2 - 2 * ((R + 1) * |L| / (2 * π)) * |(n : ℝ)|))) := by
+ have hT : 0 < L ^ 2 / (2 * π) := by positivity
+ have h := summable_pow_mul_jacobiTheta₂_term_bound ((R + 1) * |L| / (2 * π)) hT 0
+ simp only [pow_zero, one_mul, Int.cast_abs] at h
+ exact (h.mul_left _).mul_left _
+
+/-- Termwise j-th derivative series of θ_L: Σ_n g^{(j)}(t + Ln). -/
+def thetaD (L : ℝ) (j : ℕ) (t : ℝ) : ℝ := ∑' n : ℤ, deriv^[j] gauss (t + L * n)
+
+theorem summable_thetaD_terms {L : ℝ} (hL : L ≠ 0) (j : ℕ) (t : ℝ) :
+ Summable fun n : ℤ => deriv^[j] gauss (t + L * n) := by
+ obtain ⟨B, -, hb⟩ := iterate_deriv_gauss_bound j
+ exact Summable.of_norm_bounded (summable_majorant hL B |t|) (fun n => hb L |t| t le_rfl n)
+
+theorem hasDerivAt_thetaD {L : ℝ} (hL : L ≠ 0) (j : ℕ) (y : ℝ) :
+ HasDerivAt (thetaD L j) (thetaD L (j + 1) y) y := by
+ obtain ⟨B, -, hb⟩ := iterate_deriv_gauss_bound (j + 1)
+ show HasDerivAt (fun t => ∑' n : ℤ, deriv^[j] gauss (t + L * n))
+ (∑' n : ℤ, deriv^[j + 1] gauss (y + L * n)) y
+ refine hasDerivAt_tsum_of_isPreconnected (g := fun (n : ℤ) t => deriv^[j] gauss (t + L * n))
+ (g' := fun (n : ℤ) t => deriv^[j + 1] gauss (t + L * n))
+ (summable_majorant hL B (|y| + 1)) Metric.isOpen_ball
+ (convex_ball y 1).isPreconnected (fun n z _ => ?_) (fun n z hz => ?_)
+ (Metric.mem_ball_self one_pos) (summable_thetaD_terms hL j y) (Metric.mem_ball_self one_pos)
+ · have h2 := (hasDerivAt_iterate_deriv_gauss j (z + L * n)).comp z
+ ((hasDerivAt_id' z).add_const (L * n))
+ rw [mul_one] at h2
+ exact h2
+ · refine hb L (|y| + 1) z ?_ n
+ rw [Metric.mem_ball, Real.dist_eq] at hz
+ have := abs_sub_abs_le_abs_sub z y
+ linarith
+
+/-- Termwise j-th derivative series of the cosine side: Σ_k w_k ω_k^j cos(ω_k t + jπ/2). -/
+def cosD (L : ℝ) (j : ℕ) (t : ℝ) : ℝ :=
+ ∑' k : ℤ, weight L k * (atom L k ^ j * Real.cos (atom L k * t + j * (π / 2)))
+
+theorem summable_abs_weight_mul_atom_pow {L : ℝ} (hL : L ≠ 0) (j : ℕ) :
+ Summable fun k : ℤ => weight L k * |atom L k| ^ j := by
+ refine (summable_weight_mul_atom_pow hL j).abs.congr (fun k => ?_)
+ rw [abs_mul, abs_of_pos (weight_pos L k), abs_pow]
+
+theorem cosD_term_bound (L : ℝ) (j : ℕ) (k : ℤ) (t : ℝ) :
+ ‖weight L k * (atom L k ^ j * Real.cos (atom L k * t + j * (π / 2)))‖ ≤
+ weight L k * |atom L k| ^ j := by
+ rw [Real.norm_eq_abs, abs_mul, abs_mul, abs_of_pos (weight_pos L k), abs_pow]
+ exact mul_le_mul_of_nonneg_left
+ (mul_le_of_le_one_right (by positivity) (Real.abs_cos_le_one _)) (weight_pos L k).le
+
+theorem hasDerivAt_cosD {L : ℝ} (hL : L ≠ 0) (j : ℕ) (y : ℝ) :
+ HasDerivAt (cosD L j) (cosD L (j + 1) y) y := by
+ show HasDerivAt
+ (fun t => ∑' k : ℤ, weight L k * (atom L k ^ j * Real.cos (atom L k * t + j * (π / 2))))
+ (∑' k : ℤ, weight L k *
+ (atom L k ^ (j + 1) * Real.cos (atom L k * y + ((j + 1 : ℕ) : ℝ) * (π / 2)))) y
+ refine hasDerivAt_tsum
+ (g := fun k t => weight L k * (atom L k ^ j * Real.cos (atom L k * t + j * (π / 2))))
+ (g' := fun k t => weight L k *
+ (atom L k ^ (j + 1) * Real.cos (atom L k * t + ((j + 1 : ℕ) : ℝ) * (π / 2))))
+ (summable_abs_weight_mul_atom_pow hL (j + 1)) (fun k z => ?_)
+ (fun k z => cosD_term_bound L (j + 1) k z)
+ (Summable.of_norm_bounded (summable_abs_weight_mul_atom_pow hL j)
+ (fun k => cosD_term_bound L j k y)) y
+ have h := ((((hasDerivAt_id' z).const_mul (atom L k)).add_const ((j : ℝ) * (π / 2))).cos.const_mul
+ (atom L k ^ j)).const_mul (weight L k)
+ convert h using 1
+ have e : ((j + 1 : ℕ) : ℝ) * (π / 2) = (j : ℝ) * (π / 2) + π / 2 := by push_cast; ring
+ rw [e, ← add_assoc, Real.cos_add_pi_div_two]
+ ring
+
+theorem thetaD_zero (L t : ℝ) : thetaD L 0 t = theta L t := by
+ unfold thetaD theta gauss
+ congr 1; funext n
+ simp only [Function.iterate_zero, id]
+ congr 1; ring
+
+theorem cosD_zero (L t : ℝ) : cosD L 0 t = ∑' k : ℤ, weight L k * Real.cos (atom L k * t) := by
+ unfold cosD; simp
+
+/-- Term-by-term differentiation, θ side: iteratedDeriv j θ_L = Σ_n g^{(j)}(· + Ln). -/
+theorem iteratedDeriv_theta {L : ℝ} (hL : L ≠ 0) (j : ℕ) : iteratedDeriv j (theta L) = thetaD L j := by
+ induction j with
+ | zero => funext t; rw [iteratedDeriv_zero, thetaD_zero]
+ | succ j ih => funext t; rw [iteratedDeriv_succ, ih]; exact (hasDerivAt_thetaD hL j t).deriv
+
+/-- Same, stated as "derivative of the sum = sum of the derivatives". -/
+theorem iteratedDeriv_theta_termwise {L : ℝ} (hL : L ≠ 0) (j : ℕ) (t : ℝ) :
+ iteratedDeriv j (theta L) t =
+ ∑' n : ℤ, iteratedDeriv j (fun s => Real.exp (-(s + L * n) ^ 2 / 2)) t := by
+ rw [iteratedDeriv_theta hL]
+ unfold thetaD
+ congr 1; funext n
+ have h := congrFun (iteratedDeriv_comp_add_const j gauss (L * n)) t
+ have hf : (fun s : ℝ => Real.exp (-(s + L * n) ^ 2 / 2)) = fun s => gauss (s + L * n) := by
+ funext s; unfold gauss; congr 1; ring
+ rw [hf, h, iteratedDeriv_eq_iterate]
+
+/-- Term-by-term differentiation, cosine side. -/
+theorem iteratedDeriv_cos_series {L : ℝ} (hL : L ≠ 0) (j : ℕ) :
+ iteratedDeriv j (fun t => ∑' k : ℤ, weight L k * Real.cos (atom L k * t)) = cosD L j := by
+ induction j with
+ | zero => funext t; rw [iteratedDeriv_zero, cosD_zero]
+ | succ j ih => funext t; rw [iteratedDeriv_succ, ih]; exact (hasDerivAt_cosD hL j t).deriv
+
+/-- Poisson identity for every termwise derivative (all j, all t). -/
+theorem thetaD_eq_cosD {L : ℝ} (hL : L ≠ 0) (j : ℕ) (t : ℝ) :
+ thetaD L j t = 1 / (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ) * cosD L j t := by
+ induction j generalizing t with
+ | zero => rw [thetaD_zero, cosD_zero]; exact theta_eq_cos_series hL t
+ | succ j ih =>
+ have h1 := hasDerivAt_thetaD hL j t
+ have hf : thetaD L j = fun s => 1 / (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ) * cosD L j s := funext ih
+ rw [hf] at h1
+ exact h1.unique ((hasDerivAt_cosD hL j t).const_mul _)
+
+/-! ## (c) θ-route moments = dual-law moments -/
+
+theorem imageSum_even_eq_thetaD (L : ℝ) (m : ℕ) : imageSum L (2 * m) = thetaD L (2 * m) 0 := by
+ unfold imageSum thetaD gauss
+ congr 1; funext n
+ rw [Polynomial.deriv_gaussian_eq_hermite_mul_gaussian, zero_add, pow_mul, neg_one_sq, one_pow,
+ one_mul, neg_div]
+
+/-- N L53 as written, for even order: θ_L^{(2m)}(0) = Σ_n He_{2m}(Ln) e^{−(Ln)²/2}. -/
+theorem iteratedDeriv_theta_zero_even {L : ℝ} (hL : L ≠ 0) (m : ℕ) :
+ iteratedDeriv (2 * m) (theta L) 0 = imageSum L (2 * m) := by
+ rw [iteratedDeriv_theta hL, imageSum_even_eq_thetaD]
+
+theorem cosD_even_zero (L : ℝ) (m : ℕ) :
+ cosD L (2 * m) 0 = (-1) ^ m * rawSum (weight L) (atom L) (2 * m) := by
+ unfold cosD rawSum
+ have hc : Real.cos (((2 * m : ℕ) : ℝ) * (π / 2)) = (-1) ^ m := by
+ rw [show ((2 * m : ℕ) : ℝ) * (π / 2) = (m : ℝ) * π by push_cast; ring]
+ exact Real.cos_nat_mul_pi m
+ simp only [mul_zero, zero_add, hc]
+ rw [← tsum_mul_left]; congr 1; funext k; ring
+
+theorem imageSum_even_eq {L : ℝ} (hL : L ≠ 0) (m : ℕ) :
+ imageSum L (2 * m) = 1 / (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ) *
+ ((-1) ^ m * rawSum (weight L) (atom L) (2 * m)) := by
+ rw [imageSum_even_eq_thetaD, thetaD_eq_cosD hL, cosD_even_zero]
+
+/-- The link: θ-route moment (N L53 / C L153) = dual-law moment (N L54 / C L156-177), every even
+order, every L ≠ 0. -/
+theorem imageMoment_even_eq_dualMoment {L : ℝ} (hL : L ≠ 0) (m : ℕ) :
+ imageMoment L (2 * m) = dualMoment L (2 * m) := by
+ have hA0 : (1 / (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ) : ℝ) ≠ 0 := by
+ have : 0 < (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ) := Real.rpow_pos_of_pos (by positivity) _
+ positivity
+ have h2m := imageSum_even_eq hL m
+ have h0 := imageSum_even_eq hL 0
+ rw [mul_zero, pow_zero, one_mul] at h0
+ have hs : ((-1 : ℝ) ^ m) ^ 2 = 1 := by rw [← pow_mul, mul_comm, pow_mul, neg_one_sq, one_pow]
+ unfold imageMoment dualMoment lawMoment
+ rw [show 2 * m / 2 = m by omega, h2m, h0]
+ rw [show (-1 : ℝ) ^ m * (1 / (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ) *
+ ((-1) ^ m * rawSum (weight L) (atom L) (2 * m))) =
+ ((-1 : ℝ) ^ m) ^ 2 * (1 / (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ) *
+ rawSum (weight L) (atom L) (2 * m)) by ring, hs, one_mul, mul_div_mul_left _ _ hA0]
+
+/-- j = 2, 4, 6 (the W3f commented target, now with L ≠ 0 instead of 0 < L). -/
+theorem imageMoment_eq_dualMoment {L : ℝ} (hL : L ≠ 0) (j : ℕ) (hj : j = 2 ∨ j = 4 ∨ j = 6) :
+ imageMoment L j = dualMoment L j := by
+ rcases hj with rfl | rfl | rfl
+ · exact imageMoment_even_eq_dualMoment hL 1
+ · exact imageMoment_even_eq_dualMoment hL 2
+ · exact imageMoment_even_eq_dualMoment hL 3
+
+/-- Corollary: the θ-route moments satisfy 0 < m2, m2² < m4, Δ > 0 for every L ≠ 0. -/
+theorem image_moment_hyps {L : ℝ} (hL : L ≠ 0) :
+ 0 < imageMoment L 2 ∧ imageMoment L 2 ^ 2 < imageMoment L 4 ∧
+ 0 < d2Delta (imageMoment L 2) (imageMoment L 4) (imageMoment L 6) := by
+ rw [imageMoment_eq_dualMoment hL 2 (Or.inl rfl), imageMoment_eq_dualMoment hL 4 (Or.inr (Or.inl rfl)),
+ imageMoment_eq_dualMoment hL 6 (Or.inr (Or.inr rfl))]
+ exact dual_moment_hyps hL
+
+/-- Corollary: every-direction positivity for the θ-route moments, every L ≠ 0 (R3: c²+s²=1). -/
+theorem image_positivity_every_direction {L : ℝ} (hL : L ≠ 0) (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :
+ 0 < d2DetV (imageMoment L 2) (imageMoment L 4) (srcQ c s) ∧
+ 0 < d2Schur (imageMoment L 2) (imageMoment L 4) (srcQ c s) ∧
+ 0 < d2Tau (imageMoment L 2) (imageMoment L 4) (imageMoment L 6) (srcQ c s) := by
+ rw [imageMoment_eq_dualMoment hL 2 (Or.inl rfl), imageMoment_eq_dualMoment hL 4 (Or.inr (Or.inl rfl)),
+ imageMoment_eq_dualMoment hL 6 (Or.inr (Or.inr rfl))]
+ exact dual_positivity_every_direction hL c s hu
+
+end W3Scratch.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs.lean
new file mode 100644
index 000000000..ad71949dc
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs.lean
@@ -0,0 +1,14 @@
+import SpecificationProofs.P15Elementary
+import SpecificationProofs.P15Structure
+import SpecificationProofs.P15Hazard
+import SpecificationProofs.P15Covers
+import SpecificationProofs.P15Budget
+import SpecificationProofs.Side24Elementary
+import SpecificationProofs.RNProbability
+import SpecificationProofs.P15Interpolation
+import SpecificationProofs.Side24Analysis
+import SpecificationProofs.Side24Interfaces
+import SpecificationProofs.RNCluster
+import SpecificationProofs.Side24Covariance
+import SpecificationProofs.Side24ConeMoment
+import SpecificationProofs.Side24Images
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Budget.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Budget.lean
new file mode 100644
index 000000000..1bf98aaed
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Budget.lean
@@ -0,0 +1,469 @@
+import Specifications.P15
+import SpecificationProofs.P15Structure
+import SpecificationProofs.P15Elementary
+import SpecificationProofs.P15Hazard
+
+/-!
+# P15 budget proofs: the hazard bound (P8), the restricted transformed-price budget (T1), (T4),
+(T5) and the six-block transformed range
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+Every theorem outside the `Aux` namespace has as its type exactly one registered `Prop` of
+`Specifications/P15.lean` (statement packet `specifications/lean_statements_20261010`, which is
+not modified here). A kernel-checked proof of such a `Prop` is evidence about that `Prop` only:
+it does not make the informal Layer 0 note reviewed, accepted or "verified", it does not
+identify the formal definitions with the informal objects (that alignment is
+PENDING_INDEPENDENT_REVIEW), and it promotes, closes, discharges or reclassifies nothing.
+
+Helper lemmas live in `UniversalLaw.Proofs.P15Budget.Aux`; the gate inventories only the
+theorems outside that namespace. The module assembles the block-local price bounds of
+`P15Hazard` (the marginal bound `prod_{v in S} p_v ≤ q_i` for `|S| ≥ a_i + 1`) and of
+`P15Elementary` (`-log(1-p) ≤ p/(1-p)` and the exponent arithmetic `4^(a+1)/3^n ≤ 16/27`) with
+the cover criterion `fullBlockCoverIff` of `P15Structure` and the factorised hazard
+`sum_i q_i ≤ -log mu_p(D)` of `P15Hazard` into bounds on the infimum `coverCost`: the set of cover
+prices is bounded below by `0`, the cover `{∅}` has price `1`, and the full-block family covers
+the obstruction exactly when `K ≥ K_H(d)`.
+-/
+
+namespace UniversalLaw.Proofs.P15Budget
+
+open UniversalLaw.Spec.P15
+open Finset
+
+namespace Aux
+
+/-! ### Cover prices and the infimum `coverCost` -/
+
+/-- Family prices are nonnegative for nonnegative prices. -/
+theorem famPrice_nonneg {Y : Type} {c : Y → ℝ} (hc : ∀ v, 0 ≤ c v) (G : Finset (Finset Y)) :
+ 0 ≤ famPrice c G :=
+ Finset.sum_nonneg fun _ _ => Finset.prod_nonneg fun v _ => hc v
+
+/-- The set of prices of generator covers is bounded below by `0`. -/
+theorem coverSet_bddBelow {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (K : ℕ)
+ {c : X → ℝ} (hc : ∀ v, 0 ≤ c v) :
+ BddBelow {t : ℝ | ∃ G : Finset (Finset X), IsGeneratorCover F K G ∧ famPrice c G = t} := by
+ refine ⟨0, ?_⟩
+ rintro t ⟨G, -, rfl⟩
+ exact famPrice_nonneg hc G
+
+/-- The infimum is at most the price of any generator cover. -/
+theorem coverCost_le_famPrice {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (K : ℕ) {c : X → ℝ} (hc : ∀ v, 0 ≤ c v) {G : Finset (Finset X)}
+ (hG : IsGeneratorCover F K G) : coverCost F K c ≤ famPrice c G :=
+ csInf_le (coverSet_bddBelow F K hc) ⟨G, hG, rfl⟩
+
+/-- `{∅}` covers every obstruction. -/
+theorem isGeneratorCover_singleton_empty {X : Type} [Fintype X] [DecidableEq X]
+ (F : RealizedData X) (K : ℕ) : IsGeneratorCover F K {∅} :=
+ fun U _ => ⟨∅, Finset.mem_singleton_self _, Finset.empty_subset U⟩
+
+/-- The cover `{∅}` has price `1`. -/
+theorem famPrice_singleton_empty {Y : Type} (c : Y → ℝ) : famPrice c {∅} = 1 := by
+ simp [famPrice, genPrice]
+
+/-- `covercost ≤ 1` (the cover `{∅}`). -/
+theorem coverCost_le_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (K : ℕ)
+ {c : X → ℝ} (hc : ∀ v, 0 ≤ c v) : coverCost F K c ≤ 1 := by
+ have h := coverCost_le_famPrice F K hc (isGeneratorCover_singleton_empty F K)
+ rwa [famPrice_singleton_empty] at h
+
+/-- For `K ≥ K_H(d)` the full blocks cover, so `covercost ≤ sum_i price(X_i)`. -/
+theorem coverCost_le_sum_block {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}
+ (hF : IsRealizedFamily F) {c : X → ℝ} (hc : ∀ v, 0 ≤ c v) {K : ℕ}
+ (hK : paletteNumber F.b F.H F.d ≤ K) :
+ coverCost F K c ≤ ∑ i, genPrice c (block F i) := by
+ have hcover : IsGeneratorCover F K (fullBlockFamily F) :=
+ (P15Structure.fullBlockCoverIff F hF K).2 hK
+ rw [← P15Structure.Aux.famPrice_fullBlockFamily hF c]
+ exact coverCost_le_famPrice F K hc hcover
+
+/-- A quantity at most `1` and, for `m > 0`, at most `ρ (-log m)` is at most the capped hazard. -/
+theorem le_cappedHazard_of {ρ m x : ℝ} (hx1 : x ≤ 1) (hx2 : 0 < m → x ≤ ρ * -Real.log m) :
+ x ≤ cappedHazard ρ m := by
+ unfold cappedHazard
+ split_ifs with h
+ · exact le_min hx1 (hx2 h)
+ · exact hx1
+
+/-- `sum_i q_i ≤ -log mu_p(D)` when `mu_p(D) > 0` (display (P5)/(T6), from `P15Hazard`). -/
+theorem sum_localFailure_le_neg_log_mu {X : Type} [Fintype X] [DecidableEq X]
+ {F : RealizedData X} (hF : IsRealizedFamily F) {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1)
+ (hmu : 0 < mu F p) : ∑ i, localFailure F p i ≤ -Real.log (mu F p) := by
+ have h := (P15Hazard.independentBlockHazard F hF p hp).2 hmu
+ exact h.1.trans h.2
+
+/-! ### The ratio bound of (T3)/(T5) -/
+
+/-- `phi(p) ≤ p/(1-p)` for `0 ≤ p < 1` (display (T2)). -/
+theorem phi_le_div {p : ℝ} (h0 : 0 ≤ p) (h1 : p < 1) : phi p ≤ p / (1 - p) := by
+ unfold phi
+ simp only [h1, ↓reduceIte]
+ exact (min_le_right _ _).trans (P15Elementary.logRatioBound p h0 h1)
+
+/-- The first two steps of (T3): `prod_{X_i} c ≤ prod_{X_i} p/(1-p)`, split along `S ⊆ X_i`. -/
+theorem genPrice_le_ratio {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p c : X → ℝ} (hc : ∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) {i : Fin F.b}
+ (hp : ∀ v ∈ block F i, 0 ≤ p v ∧ p v < 1) {S : Finset X} (hS : S ⊆ block F i) :
+ genPrice c (block F i) ≤
+ (∏ v ∈ S, p v) * ((∏ v ∈ block F i \ S, p v) * ∏ v ∈ block F i, (1 - p v)⁻¹) := by
+ have h1 : genPrice c (block F i) ≤ ∏ v ∈ block F i, p v * (1 - p v)⁻¹ := by
+ unfold genPrice
+ refine Finset.prod_le_prod₀ (fun v _ => (hc v).1) fun v hv => ?_
+ rw [← div_eq_mul_inv]
+ exact (hc v).2.trans (phi_le_div (hp v hv).1 (hp v hv).2)
+ refine h1.trans (le_of_eq ?_)
+ rw [Finset.prod_mul_distrib,
+ show ∏ v ∈ block F i, p v = (∏ v ∈ block F i \ S, p v) * ∏ v ∈ S, p v from
+ (Finset.prod_sdiff hS).symm]
+ ring
+
+/-- A product of coordinates in `[0, B]` is at most `B^|s|`. -/
+theorem prod_le_pow_of_le {X : Type} {s : Finset X} {p : X → ℝ} {B : ℝ}
+ (hp : ∀ v ∈ s, 0 ≤ p v ∧ p v ≤ B) : ∏ v ∈ s, p v ≤ B ^ s.card := by
+ rw [← Finset.prod_const]
+ exact Finset.prod_le_prod₀ (fun v hv => (hp v hv).1) (fun v hv => (hp v hv).2)
+
+/-- A product of `(1 - p_v)⁻¹` with `p_v ≤ B < 1` is at most `((1 - B)⁻¹)^|s|`. -/
+theorem prod_inv_le_pow {X : Type} {s : Finset X} {p : X → ℝ} {B : ℝ} (hB : B < 1)
+ (hp : ∀ v ∈ s, p v ≤ B) : ∏ v ∈ s, (1 - p v)⁻¹ ≤ ((1 - B)⁻¹) ^ s.card := by
+ rw [← Finset.prod_const]
+ refine Finset.prod_le_prod₀ (fun v hv => ?_) (fun v hv => ?_)
+ · exact inv_nonneg.2 (by linarith [hp v hv])
+ · exact inv_anti₀ (by linarith) (by linarith [hp v hv])
+
+/-- The ratio bound: for `0 ≤ c ≤ phi(p)`, `0 ≤ p ≤ B < 1` on the block and `S ⊆ X_i`,
+`price(X_i) ≤ (prod_{S} p) * B^(n - |S|) * (1 - B)^(-n)`. -/
+theorem genPrice_le_prod_mul_ratio {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p c : X → ℝ} (hc : ∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) {i : Fin F.b} {B : ℝ} (hB0 : 0 ≤ B)
+ (hB : B < 1) (hp : ∀ v ∈ block F i, 0 ≤ p v ∧ p v ≤ B) {S : Finset X}
+ (hS : S ⊆ block F i) :
+ genPrice c (block F i) ≤
+ (∏ v ∈ S, p v) * (B ^ ((block F i).card - S.card) * ((1 - B)⁻¹) ^ (block F i).card) := by
+ have hp' : ∀ v ∈ block F i, 0 ≤ p v ∧ p v < 1 :=
+ fun v hv => ⟨(hp v hv).1, (hp v hv).2.trans_lt hB⟩
+ refine (genPrice_le_ratio F hc hp' hS).trans ?_
+ refine mul_le_mul_of_nonneg_left ?_ (Finset.prod_nonneg fun v hv => (hp v (hS hv)).1)
+ rw [← Finset.card_sdiff_of_subset hS]
+ refine mul_le_mul (prod_le_pow_of_le fun v hv => hp v (mem_sdiff.1 hv).1)
+ (prod_inv_le_pow hB fun v hv => (hp v hv).2)
+ (Finset.prod_nonneg fun v hv => inv_nonneg.2 (by linarith [(hp' v hv).2]))
+ (pow_nonneg hB0 _)
+
+/-- The exponent identity behind (T3): `(1/4)^m (4/3)^(m+k) = 4^k / 3^(m+k)`. -/
+theorem quarter_pow_identity (m k : ℕ) :
+ (1 / 4 : ℝ) ^ m * (4 / 3) ^ (m + k) = 4 ^ k / 3 ^ (m + k) := by
+ rw [div_pow, div_pow, one_pow, pow_add]
+ field_simp
+
+/-- Display (T3) in the form used here: for `a ≥ 1`, `n ≥ 2a + 1`,
+`(1/4)^(n-a-1) (3/4)^(-n) ≤ 16/27`. -/
+theorem quarter_ratio_le {a n : ℕ} (ha : 1 ≤ a) (hn : 2 * a + 1 ≤ n) :
+ (1 / 4 : ℝ) ^ (n - (a + 1)) * ((1 - 1 / 4)⁻¹) ^ n ≤ 16 / 27 := by
+ obtain ⟨m, rfl⟩ : ∃ m, n = m + (a + 1) := ⟨n - (a + 1), (Nat.sub_add_cancel (by omega)).symm⟩
+ rw [Nat.add_sub_cancel, show ((1 : ℝ) - 1 / 4)⁻¹ = 4 / 3 by norm_num, quarter_pow_identity]
+ have h := P15Elementary.ratioExponentBound a (m + (a + 1)) ha hn
+ exact h.1.trans h.2
+
+/-! ### Block-local hypotheses -/
+
+/-- `localGood` depends on `p` only through its values on the block. -/
+theorem localGood_congr {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p p' : X → ℝ} {i : Fin F.b} (h : ∀ v ∈ block F i, p v = p' v) :
+ localGood F p i = localGood F p' i := by
+ unfold localGood
+ refine Finset.sum_congr rfl fun S hS => ?_
+ rw [mem_powerset] at hS
+ have e1 : ∏ v ∈ S, p v = ∏ v ∈ S, p' v := Finset.prod_congr rfl fun v hv => h v (hS hv)
+ have e2 : ∏ v ∈ block F i \ S, (1 - p v) = ∏ v ∈ block F i \ S, (1 - p' v) :=
+ Finset.prod_congr rfl fun v hv => by rw [h v (mem_sdiff.1 hv).1]
+ by_cases hmem : S ∈ downset F
+ · rw [Set.indicator_of_mem hmem, Set.indicator_of_mem hmem, e1, e2]
+ · rw [Set.indicator_of_notMem hmem, Set.indicator_of_notMem hmem]
+
+/-- `localFailure` depends on `p` only through its values on the block. -/
+theorem localFailure_congr {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p p' : X → ℝ} {i : Fin F.b} (h : ∀ v ∈ block F i, p v = p' v) :
+ localFailure F p i = localFailure F p' i := by
+ unfold localFailure
+ rw [localGood_congr F h]
+
+/-- The marginal bound `prod_{v in S} p_v ≤ q_i` of `P15Hazard` under block-local hypotheses
+only (`p` is replaced by its restriction to the block, zero elsewhere). -/
+theorem prod_le_localFailure_of_card_local {X : Type} [Fintype X] [DecidableEq X]
+ (F : RealizedData X) {p : X → ℝ} {i : Fin F.b} (hp : ∀ v ∈ block F i, 0 ≤ p v ∧ p v ≤ 1)
+ {S : Finset X} (hS : S ⊆ block F i) (hcard : F.a i + 1 ≤ S.card) :
+ ∏ v ∈ S, p v ≤ localFailure F p i := by
+ set p' : X → ℝ := fun v => if v ∈ block F i then p v else 0 with hp'def
+ have hagree : ∀ v ∈ block F i, p v = p' v := fun v hv => by simp [hp'def, hv]
+ have hp' : ∀ v, 0 ≤ p' v ∧ p' v ≤ 1 := fun v => by
+ by_cases hv : v ∈ block F i
+ · simp only [hp'def, hv, ↓reduceIte]
+ exact hp v hv
+ · simp only [hp'def, hv, ↓reduceIte]
+ exact ⟨le_rfl, zero_le_one⟩
+ rw [localFailure_congr F hagree, Finset.prod_congr rfl fun v hv => hagree v (hS hv)]
+ exact P15Hazard.Aux.prod_le_localFailure_of_card F hp' hS hcard
+
+/-! ### The local budget (T4) -/
+
+/-- Display (T4), first inequality: for `a_i ≥ 1`, `d_i ≥ 2`, `0 ≤ p ≤ 1/4` and
+`0 ≤ c ≤ phi(p)`, `price(X_i) ≤ (16/27) q_i`. -/
+theorem genPrice_le_budget {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}
+ (hF : IsRealizedFamily F) (hd : ∀ i, 2 ≤ F.d i) {p c : X → ℝ}
+ (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1 / 4) (hc : ∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) (i : Fin F.b) :
+ genPrice c (block F i) ≤ (16 / 27) * localFailure F p i := by
+ have hn : (block F i).card = F.a i * F.d i + 1 := hF.2.2.1 i
+ have ha : 1 ≤ F.a i := hF.1 i
+ have hmul : F.a i * 2 ≤ F.a i * F.d i := Nat.mul_le_mul_left (F.a i) (hd i)
+ have hn2 : 2 * F.a i + 1 ≤ (block F i).card := by rw [hn]; linarith
+ have hcard : F.a i + 1 ≤ (block F i).card := by linarith
+ obtain ⟨S, hS, hScard⟩ := Finset.exists_subset_card_eq hcard
+ have hp1 : ∀ v, 0 ≤ p v ∧ p v ≤ 1 := fun v => ⟨(hp v).1, (hp v).2.trans (by norm_num)⟩
+ have h1 := genPrice_le_prod_mul_ratio F hc (by norm_num : (0 : ℝ) ≤ 1 / 4)
+ (by norm_num : (1 / 4 : ℝ) < 1) (fun v _ => hp v) hS
+ have hprodS : ∏ v ∈ S, p v ≤ localFailure F p i :=
+ P15Hazard.Aux.prod_le_localFailure_of_card F hp1 hS (by rw [hScard])
+ have hprodS0 : 0 ≤ ∏ v ∈ S, p v := Finset.prod_nonneg fun v _ => (hp v).1
+ calc genPrice c (block F i)
+ ≤ (∏ v ∈ S, p v) *
+ ((1 / 4) ^ ((block F i).card - S.card) * ((1 - 1 / 4)⁻¹) ^ (block F i).card) := h1
+ _ ≤ (∏ v ∈ S, p v) * (16 / 27) := by
+ refine mul_le_mul_of_nonneg_left ?_ hprodS0
+ rw [hScard]
+ exact quarter_ratio_le ha hn2
+ _ = (16 / 27) * ∏ v ∈ S, p v := mul_comm _ _
+ _ ≤ (16 / 27) * localFailure F p i := mul_le_mul_of_nonneg_left hprodS (by norm_num)
+
+/-- The summed budget: `sum_i price(X_i) ≤ (16/27) (-log mu_p(D))` when `mu_p(D) > 0`. -/
+theorem sum_genPrice_le_budget {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}
+ (hF : IsRealizedFamily F) (hd : ∀ i, 2 ≤ F.d i) {p c : X → ℝ}
+ (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1 / 4) (hc : ∀ v, 0 ≤ c v ∧ c v ≤ phi (p v))
+ (hmu : 0 < mu F p) :
+ ∑ i, genPrice c (block F i) ≤ (16 / 27) * -Real.log (mu F p) := by
+ have hp1 : ∀ v, 0 ≤ p v ∧ p v ≤ 1 := fun v => ⟨(hp v).1, (hp v).2.trans (by norm_num)⟩
+ calc ∑ i, genPrice c (block F i)
+ ≤ ∑ i, (16 / 27) * localFailure F p i :=
+ Finset.sum_le_sum fun i _ => genPrice_le_budget hF hd hp hc i
+ _ = (16 / 27) * ∑ i, localFailure F p i := by rw [Finset.mul_sum]
+ _ ≤ (16 / 27) * -Real.log (mu F p) :=
+ mul_le_mul_of_nonneg_left (sum_localFailure_le_neg_log_mu hF hp1 hmu) (by norm_num)
+
+/-! ### Positivity of `mu_p(D)` -/
+
+/-- The weight is nonnegative for `p in [0,1]^X`. -/
+theorem weight_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] {p : Y → ℝ}
+ (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (U : Finset Y) : 0 ≤ weight p U := by
+ unfold weight
+ refine mul_nonneg (Finset.prod_nonneg fun v _ => (hp v).1) (Finset.prod_nonneg fun v _ => ?_)
+ linarith [(hp v).2]
+
+/-- The empty set is good when every edge of `H` has at least two elements. -/
+theorem isGood_empty {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}
+ (hH : ∀ e ∈ F.H, 2 ≤ e.card) : IsGood F ∅ := by
+ refine ⟨fun i => by simp, fun e he hsub => ?_⟩
+ have h0 : e = ∅ := subset_empty.1 (by simpa [supp] using hsub)
+ have h2 := hH e he
+ rw [h0, card_empty] at h2
+ omega
+
+/-- `mu_p(D) > 0` for `0 ≤ p < 1` coordinatewise: the empty set is good and has positive weight. -/
+theorem mu_pos {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}
+ (hF : IsRealizedFamily F) {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v < 1) : 0 < mu F p := by
+ have hp1 : ∀ v, 0 ≤ p v ∧ p v ≤ 1 := fun v => ⟨(hp v).1, (hp v).2.le⟩
+ have hterm : ∀ U ∈ (univ : Finset X).powerset, 0 ≤ Set.indicator (downset F) (weight p) U :=
+ fun U _ => Set.indicator_nonneg (fun T _ => weight_nonneg hp1 T) U
+ have hle := Finset.single_le_sum hterm (mem_powerset.2 (empty_subset univ))
+ refine lt_of_lt_of_le ?_ hle
+ rw [Set.indicator_of_mem (show (∅ : Finset X) ∈ downset F from isGood_empty hF.2.2.2.1)]
+ unfold weight
+ rw [prod_empty, one_mul]
+ exact Finset.prod_pos fun v _ => by linarith [(hp v).2]
+
+/-! ### The six-block benchmark at `p = 1/40900` -/
+
+/-- `log(40900/40899) ≤ 1/40899`. -/
+theorem log_benchmark_le : Real.log (40900 / 40899) ≤ 1 / 40899 := by
+ have h := Real.log_le_sub_one_of_pos (by norm_num : (0 : ℝ) < 40900 / 40899)
+ linarith
+
+/-- `phi(1/40900) = log(40900/40899)`. -/
+theorem phi_benchmark : phi (1 / 40900) = Real.log (40900 / 40899) := by
+ have hlt : (1 : ℝ) / 40900 < 1 := by norm_num
+ unfold phi
+ simp only [hlt, ↓reduceIte]
+ rw [show (1 : ℝ) - 1 / 40900 = (40900 / 40899)⁻¹ by norm_num, Real.log_inv, neg_neg]
+ exact min_eq_right (log_benchmark_le.trans (by norm_num))
+
+/-- Each full-block price at `c ≤ log(40900/40899)` is at most `1/40899`. -/
+theorem genPrice_benchmark_le {c : Fin 6 × Fin 409 → ℝ}
+ (hc : ∀ v, 0 ≤ c v ∧ c v ≤ Real.log (40900 / 40899)) (i : Fin benchmark816.b) :
+ genPrice c (block benchmark816 i) ≤ 1 / 40899 := by
+ calc genPrice c (block benchmark816 i)
+ ≤ ∏ _v ∈ block benchmark816 i, (1 / 40899 : ℝ) :=
+ Finset.prod_le_prod₀ (fun v _ => (hc v).1) (fun v _ => (hc v).2.trans log_benchmark_le)
+ _ = (1 / 40899) ^ 409 := by rw [prod_const, P15Structure.Aux.card_block_benchmark816]
+ _ ≤ 1 / 40899 := pow_le_of_le_one (by norm_num) (by norm_num) (by norm_num)
+
+/-- The full-block price at `c ≤ log(40900/40899)` is at most `6/40899 ≤ 1`. -/
+theorem famPrice_benchmark_le_one {c : Fin 6 × Fin 409 → ℝ}
+ (hc : ∀ v, 0 ≤ c v ∧ c v ≤ Real.log (40900 / 40899)) :
+ famPrice c (fullBlockFamily benchmark816) ≤ 1 := by
+ rw [P15Structure.Aux.famPrice_fullBlockFamily P15Structure.Aux.benchmark816_isRealized c]
+ calc ∑ i, genPrice c (block benchmark816 i)
+ ≤ ∑ _i : Fin benchmark816.b, (1 / 40899 : ℝ) :=
+ Finset.sum_le_sum fun i _ => genPrice_benchmark_le hc i
+ _ = 6 * (1 / 40899) := by
+ rw [sum_const, card_univ]
+ change (6 : ℕ) • ((1 : ℝ) / 40899) = 6 * (1 / 40899)
+ rw [nsmul_eq_mul]
+ norm_num
+ _ ≤ 1 := by norm_num
+
+end Aux
+
+/-! ## Inventory theorems -/
+
+/-- Proves: `UniversalLaw.Spec.P15.CoverCostHazardBound` (claim `p15-realized-covers`, display
+(P8)).
+Method: the set of cover prices is bounded below by `0`; the cover `{∅}` has price `1`, so
+`covercost ≤ 1` (`csInf_le`); for `K ≥ K_H(d)` the full blocks cover (`fullBlockCoverIff`), so
+`covercost ≤ sum_i price(X_i) ≤ sum_i q_i` (display (P4), `P15Hazard.localPriceChain`) and, when
+`mu_p(D) > 0`, `sum_i q_i ≤ -log mu_p(D)` (display (P5), `P15Hazard.independentBlockHazard`).
+Does not establish: the informal display (P8) or its review and acceptance; anything for prices
+`c_v > p_v`; attainment of the infimum; the alignment of `coverCost`, `mu`, `localFailure` with
+the source's objects (PENDING_INDEPENDENT_REVIEW); the unrestricted P15 prize or original P15-B;
+the disposition HOLD_WITH_DOMAIN of `p15-realized-covers`, which is transcribed in the register,
+not derived here. -/
+theorem coverCostHazardBound {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.CoverCostHazardBound F := by
+ intro hF p c hp hc K hK
+ have hc0 : ∀ v, 0 ≤ c v := fun v => (hc v).1
+ refine Aux.le_cappedHazard_of (Aux.coverCost_le_one F K hc0) fun hmu => ?_
+ rw [one_mul]
+ calc coverCost F K c ≤ ∑ i, genPrice c (block F i) := Aux.coverCost_le_sum_block hF hc0 hK
+ _ ≤ ∑ i, localFailure F p i := by
+ refine Finset.sum_le_sum fun i _ => ?_
+ have h := P15Hazard.localPriceChain F hF p c hp hc i
+ exact h.1.trans h.2.1
+ _ ≤ -Real.log (mu F p) := Aux.sum_localFailure_le_neg_log_mu hF hp hmu
+
+/-- Proves: `UniversalLaw.Spec.P15.RestrictedLocalBudget` (claim `p15-price-budget-restricted`,
+display (T4)).
+Method: `phi(p) ≤ -log(1-p) ≤ p/(1-p)` (display (T2), `P15Elementary.logRatioBound`); a subset
+`S ⊆ X_i` with `|S| = a_i + 1` exists since `|X_i| = a_i d_i + 1`; `prod_{X_i} c ≤ prod_{X_i}
+p/(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`
+(display (T3), `P15Elementary.ratioExponentBound` with `n ≥ 2a + 1` from `d_i ≥ 2`); `prod_S p ≤
+q_i` (block-local marginal bound of `P15Hazard`); `(16/27) q ≤ q ≤ phi(q)` on `[0, 1]`.
+Does not establish: the informal display (T4) or its review and acceptance; sharpness of the
+range `p_v ≤ 1/4` (the source: "a sufficient range, not an asserted sharp threshold"); anything
+at `d_i = 1` (the source's refutation stands); the alignment of `localFailure`, `phi` with the
+source's objects (PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of
+`p15-price-budget-restricted`, which is transcribed in the register, not derived here. -/
+theorem restrictedLocalBudget {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.RestrictedLocalBudget F := by
+ intro hF hd p c hp hc i
+ have hp1 : ∀ v, 0 ≤ p v ∧ p v ≤ 1 := fun v => ⟨(hp v).1, (hp v).2.trans (by norm_num)⟩
+ refine ⟨Aux.genPrice_le_budget hF hd hp hc i, ?_⟩
+ have hq0 := P15Hazard.Aux.localFailure_nonneg F hp1 i
+ have hq1 := P15Hazard.Aux.localFailure_le_one F hp1 i
+ calc (16 / 27) * localFailure F p i ≤ 1 * localFailure F p i :=
+ mul_le_mul_of_nonneg_right (by norm_num) hq0
+ _ = localFailure F p i := one_mul _
+ _ ≤ phi (localFailure F p i) := P15Hazard.Aux.le_phi_self hq1
+
+/-- Proves: `UniversalLaw.Spec.P15.RhoTestSufficient` (claim `p15-price-budget-restricted`,
+display (T5)).
+Method: the same ratio argument as (T3) with the common bound `p_*`: for `S ⊆ X_i` with
+`|S| = a_i + 1`, `prod_{X_i} c ≤ prod_{X_i} p/(1-p) ≤ (prod_S p) p_*^(n-a-1) (1-p_*)^(-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
+block-local marginal bound (`p` restricted to the block, as only the block's coordinates enter
+`q_i`).
+Does not establish: the informal display (T5) or its review and acceptance; anything when
+`rho > 1` (the source: "rho>1 is not a counterexample and must not be labeled infeasible"); the
+alignment of `localFailure`, `phi`, `rhoTest` with the source's objects
+(PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of `p15-price-budget-restricted`,
+which is transcribed in the register, not derived here. -/
+theorem rhoTestSufficient {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.RhoTestSufficient F := by
+ intro hF p c pBound hB0 hB1 hc i hp hrho
+ have hn : (block F i).card = F.a i * F.d i + 1 := hF.2.2.1 i
+ have hcard : F.a i + 1 ≤ (block F i).card := by
+ rw [hn]
+ have := Nat.le_mul_of_pos_right (F.a i) (hF.2.1 i)
+ omega
+ obtain ⟨S, hS, hScard⟩ := Finset.exists_subset_card_eq hcard
+ have h1 := Aux.genPrice_le_prod_mul_ratio F hc hB0 hB1 hp hS
+ have hprodS0 : 0 ≤ ∏ v ∈ S, p v := Finset.prod_nonneg fun v hv => (hp v (hS hv)).1
+ have hp1 : ∀ v ∈ block F i, 0 ≤ p v ∧ p v ≤ 1 :=
+ fun v hv => ⟨(hp v hv).1, (hp v hv).2.trans hB1.le⟩
+ have hprodS : ∏ v ∈ S, p v ≤ localFailure F p i :=
+ Aux.prod_le_localFailure_of_card_local F hp1 hS (by rw [hScard])
+ have hrho' : pBound ^ ((block F i).card - S.card) * ((1 - pBound)⁻¹) ^ (block F i).card =
+ rhoTest (F.a i) (F.d i) pBound := by
+ rw [hScard, hn, rhoTest, Nat.add_sub_add_right, div_eq_mul_inv, inv_pow]
+ calc genPrice c (block F i)
+ ≤ (∏ v ∈ S, p v) *
+ (pBound ^ ((block F i).card - S.card) * ((1 - pBound)⁻¹) ^ (block F i).card) := h1
+ _ = (∏ v ∈ S, p v) * rhoTest (F.a i) (F.d i) pBound := by rw [hrho']
+ _ ≤ (∏ v ∈ S, p v) * 1 := mul_le_mul_of_nonneg_left hrho hprodS0
+ _ = ∏ v ∈ S, p v := mul_one _
+ _ ≤ localFailure F p i := hprodS
+
+/-- Proves: `UniversalLaw.Spec.P15.RestrictedTransformedPriceBudget` (claim
+`p15-price-budget-restricted`, display (T1)).
+Method: `covercost ≤ 1` by the cover `{∅}`; for `K ≥ K_H(d)` the full blocks cover
+(`fullBlockCoverIff`), so `covercost ≤ sum_i price(X_i) ≤ (16/27) sum_i q_i` (display (T4), the
+local budget of this module) and, when `mu_p(D) > 0`, `sum_i q_i ≤ -log mu_p(D)` (display (T6),
+`P15Hazard.independentBlockHazard`); the capped hazard handles `mu_p(D) = 0` by its convention.
+Does not establish: the informal display (T1) or its review and acceptance; any retraction of the
+demand-one refutation; the unrestricted prize; new classical coloring theory; attainment of the
+infimum; the alignment of `coverCost`, `mu`, `phi` with the source's objects
+(PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of `p15-price-budget-restricted`,
+which is transcribed in the register, not derived here. -/
+theorem restrictedTransformedPriceBudget {X : Type} [Fintype X] [DecidableEq X]
+ (F : RealizedData X) : UniversalLaw.Spec.P15.RestrictedTransformedPriceBudget F := by
+ intro hF hd p c hp hc K hK
+ have hc0 : ∀ v, 0 ≤ c v := fun v => (hc v).1
+ refine Aux.le_cappedHazard_of (Aux.coverCost_le_one F K hc0) fun hmu => ?_
+ exact (Aux.coverCost_le_sum_block hF hc0 hK).trans (Aux.sum_genPrice_le_budget hF hd hp hc hmu)
+
+/-- Proves: `UniversalLaw.Spec.P15.Benchmark816TransformedRange` (claim
+`p15-price-budget-restricted`, Section 4 of price_budget PROOF.md).
+Method: `1 - 1/40900 = (40900/40899)⁻¹`, `Real.log_inv` and `log(40900/40899) ≤ 1/40899 ≤ 1`
+for the value of `phi`; the cover from `fullBlockCoverIff` and `K_H(408, ..., 408) = 816`
+(`P15Structure.benchmark816Palette`); the price bound from six block prices `≤ (1/40899)^409 ≤
+1/40899` and from the summed local budget (T4) at `p_v = 1/40900 ≤ 1/4`, `d_i = 408 ≥ 2`, with
+`mu_p(D) > 0` because the empty set is good with positive weight; the `covercost` bound is
+`RestrictedTransformedPriceBudget` at these data.
+Does not establish: the informal Section 4 or its review and acceptance; optimality of the
+816-label cover; the whole-ground value `818` (a separate `Prop`); the alignment of the formal
+objects with the source's (PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of
+`p15-price-budget-restricted`, which is transcribed in the register, not derived here. -/
+theorem benchmark816TransformedRange : UniversalLaw.Spec.P15.Benchmark816TransformedRange := by
+ have hF := P15Structure.Aux.benchmark816_isRealized
+ have hK : paletteNumber benchmark816.b benchmark816.H benchmark816.d ≤ 816 :=
+ le_of_eq P15Structure.benchmark816Palette
+ have hcover : IsGeneratorCover benchmark816 816 (fullBlockFamily benchmark816) :=
+ (P15Structure.fullBlockCoverIff benchmark816 hF 816).2 hK
+ refine ⟨Aux.phi_benchmark, hcover, fun c hc => ?_⟩
+ have hp : ∀ v : Fin 6 × Fin 409,
+ 0 ≤ (fun _ => (1 : ℝ) / 40900) v ∧ (fun _ => (1 : ℝ) / 40900) v ≤ 1 / 4 :=
+ fun _ => ⟨by norm_num, by norm_num⟩
+ have hc' : ∀ v, 0 ≤ c v ∧ c v ≤ phi ((fun _ => (1 : ℝ) / 40900) v) := fun v => by
+ refine ⟨(hc v).1, ?_⟩
+ show c v ≤ phi (1 / 40900)
+ rw [Aux.phi_benchmark]
+ exact (hc v).2
+ have hd : ∀ i, 2 ≤ benchmark816.d i := fun _ => by
+ show (2 : ℕ) ≤ 408
+ norm_num
+ have hmu : 0 < mu benchmark816 (fun _ => (1 : ℝ) / 40900) :=
+ Aux.mu_pos hF fun _ => ⟨by norm_num, by norm_num⟩
+ refine ⟨Aux.le_cappedHazard_of (Aux.famPrice_benchmark_le_one hc) fun _ => ?_,
+ restrictedTransformedPriceBudget benchmark816 hF hd _ c hp hc' 816 hK⟩
+ rw [P15Structure.Aux.famPrice_fullBlockFamily hF c]
+ exact Aux.sum_genPrice_le_budget hF hd hp hc' hmu
+
+end UniversalLaw.Proofs.P15Budget
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Covers.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Covers.lean
new file mode 100644
index 000000000..70d845d7f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Covers.lean
@@ -0,0 +1,285 @@
+import Specifications.P15
+import SpecificationProofs.P15Structure
+import SpecificationProofs.P15Elementary
+
+/-!
+# P15 realized-cover proofs: the six-block cover, the local restriction, attainment of the
+palette number and the union bound (P11)
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+Every theorem in this module has as its type exactly one registered `Prop` of
+`Specifications/P15.lean` (statement packet `specifications/lean_statements_20261010`, which is
+not modified here). A kernel-checked proof of such a `Prop` is evidence about that `Prop` only:
+it does not make the informal Layer 0 note reviewed, accepted or "verified", it does not
+identify the formal definitions with the informal objects (that alignment is
+PENDING_INDEPENDENT_REVIEW), and it promotes, closes, discharges or reclassifies nothing.
+
+Helper lemmas live in `UniversalLaw.Proofs.P15Covers.Aux`; the gate inventories only the
+theorems outside that namespace. The general lemmas of `Aux` (the marginal identity
+`sum_weight_filter_superset`, the union bound `one_sub_mu_le_sum_prod`, the existence of a
+minimal forbidden subset of a bad set and the cardinality of a transversal) are stated for an
+arbitrary finite ground type so that other modules may reuse them.
+-/
+
+namespace UniversalLaw.Proofs.P15Covers
+
+open UniversalLaw.Spec.P15
+open Finset
+
+namespace Aux
+
+/-! ### The product measure: nonnegative weights and the marginal of a fixed subset -/
+
+/-- Weights are nonnegative for `p` in `[0,1]^Y`. -/
+theorem weight_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] {p : Y → ℝ}
+ (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (U : Finset Y) : 0 ≤ weight p U := by
+ unfold weight
+ exact mul_nonneg (prod_nonneg fun v _ => (hp v).1)
+ (prod_nonneg fun v _ => by linarith [(hp v).2])
+
+/-- The sets containing `M` are exactly the sets `M ∪ T` with `T ⊆ univ \ M`. -/
+theorem filter_superset_eq_image {Y : Type} [Fintype Y] [DecidableEq Y] (M : Finset Y) :
+ (univ : Finset Y).powerset.filter (fun U => M ⊆ U) =
+ ((univ : Finset Y) \ M).powerset.image (fun T => M ∪ T) := by
+ ext U
+ simp only [mem_filter, mem_powerset, subset_univ, true_and, mem_image]
+ constructor
+ · intro hMU
+ exact ⟨U \ M, sdiff_subset_sdiff (subset_univ U) subset_rfl, union_sdiff_of_subset hMU⟩
+ · rintro ⟨T, -, rfl⟩
+ exact subset_union_left
+
+/-- The weight of `M ∪ T` for `T` disjoint from `M` factors as the product of `p` over `M` times
+the weight of `T` relative to the ground set `univ \ M`. -/
+theorem weight_union_of_disjoint {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ)
+ {M T : Finset Y} (h : Disjoint M T) :
+ weight p (M ∪ T) =
+ (∏ v ∈ M, p v) * ((∏ v ∈ T, p v) * ∏ v ∈ ((univ : Finset Y) \ M) \ T, (1 - p v)) := by
+ have hs : (univ : Finset Y) \ (M ∪ T) = ((univ : Finset Y) \ M) \ T := by
+ ext v
+ simp only [mem_sdiff, mem_univ, true_and, mem_union, not_or]
+ unfold weight
+ rw [prod_union h, mul_assoc, hs]
+
+/-- The marginal identity: the total weight of the sets containing a fixed `M` is
+`∏_{v ∈ M} p v`, for any real vector `p` (no range hypothesis is needed). -/
+theorem sum_weight_filter_superset {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ)
+ (M : Finset Y) :
+ ∑ U ∈ (univ : Finset Y).powerset.filter (fun U => M ⊆ U), weight p U = ∏ v ∈ M, p v := by
+ rw [filter_superset_eq_image, sum_image]
+ · have h : ∀ T ∈ ((univ : Finset Y) \ M).powerset, weight p (M ∪ T) =
+ (∏ v ∈ M, p v) * ((∏ v ∈ T, p v) * ∏ v ∈ ((univ : Finset Y) \ M) \ T, (1 - p v)) := by
+ intro T hT
+ rw [mem_powerset] at hT
+ exact weight_union_of_disjoint p (disjoint_of_subset_right hT disjoint_sdiff)
+ rw [sum_congr rfl h, ← mul_sum, ← prod_add p (fun v => 1 - p v)]
+ have h1 : ∏ v ∈ (univ : Finset Y) \ M, (p v + (1 - p v)) = 1 :=
+ prod_eq_one fun v _ => by ring
+ rw [h1, mul_one]
+ · intro T₁ hT₁ T₂ hT₂ h
+ rw [mem_coe, mem_powerset] at hT₁ hT₂
+ have h' : M ∪ T₁ = M ∪ T₂ := h
+ have e₁ := union_sdiff_cancel_left (disjoint_of_subset_right hT₁ disjoint_sdiff (s := M))
+ have e₂ := union_sdiff_cancel_left (disjoint_of_subset_right hT₂ disjoint_sdiff (s := M))
+ rw [← e₁, ← e₂, h']
+
+/-- The same marginal identity with the superset condition written as an `if`. -/
+theorem sum_weight_ite_superset {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ)
+ (M : Finset Y) :
+ ∑ U ∈ (univ : Finset Y).powerset, (if M ⊆ U then weight p U else 0) = ∏ v ∈ M, p v := by
+ rw [← sum_filter, sum_weight_filter_superset]
+
+/-! ### The bad probability and the union bound over a covering family -/
+
+open Classical in
+/-- `1 - mu_p(D)` is the total weight of the bad sets (classical decidability of `IsGood`). -/
+theorem one_sub_mu_eq {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (p : X → ℝ) :
+ 1 - mu F p =
+ ∑ U ∈ (univ : Finset X).powerset, (if IsGood F U then 0 else weight p U) := by
+ classical
+ have hmu : mu F p = ∑ U ∈ (univ : Finset X).powerset, (if IsGood F U then weight p U else 0) := by
+ unfold mu
+ refine sum_congr rfl fun U _ => ?_
+ rw [Set.indicator_apply]
+ exact if_congr Iff.rfl rfl rfl
+ rw [hmu, ← UniversalLaw.Proofs.P15Elementary.Aux.sum_weight_eq_one p, ← sum_sub_distrib]
+ refine sum_congr rfl fun U _ => ?_
+ split_ifs <;> ring
+
+/-- The union bound: if every bad set contains a member of the family `𝓜`, then
+`1 - mu_p(D) ≤ ∑_{M ∈ 𝓜} ∏_{v ∈ M} p v`, for `p` in `[0,1]^X`. -/
+theorem one_sub_mu_le_sum_prod {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (p : X → ℝ) (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (𝓜 : Finset (Finset X))
+ (h𝓜 : ∀ U : Finset X, ¬ IsGood F U → ∃ M ∈ 𝓜, M ⊆ U) :
+ 1 - mu F p ≤ ∑ M ∈ 𝓜, ∏ v ∈ M, p v := by
+ classical
+ have hterm : ∀ U : Finset X, ∀ M : Finset X,
+ 0 ≤ (if M ⊆ U then weight p U else 0) := fun U M => by
+ split_ifs
+ · exact weight_nonneg hp U
+ · exact le_rfl
+ have h2 : ∀ U ∈ (univ : Finset X).powerset, (if IsGood F U then 0 else weight p U) ≤
+ ∑ M ∈ 𝓜, (if M ⊆ U then weight p U else 0) := by
+ intro U _
+ split_ifs with hU
+ · exact sum_nonneg fun M _ => hterm U M
+ · obtain ⟨M, hM, hMU⟩ := h𝓜 U hU
+ calc weight p U = (if M ⊆ U then weight p U else 0) := by simp [hMU]
+ _ ≤ ∑ M ∈ 𝓜, (if M ⊆ U then weight p U else 0) :=
+ single_le_sum (fun M _ => hterm U M) hM
+ rw [one_sub_mu_eq]
+ calc ∑ U ∈ (univ : Finset X).powerset, (if IsGood F U then 0 else weight p U)
+ ≤ ∑ U ∈ (univ : Finset X).powerset, ∑ M ∈ 𝓜, (if M ⊆ U then weight p U else 0) :=
+ sum_le_sum h2
+ _ = ∑ M ∈ 𝓜, ∑ U ∈ (univ : Finset X).powerset, (if M ⊆ U then weight p U else 0) :=
+ sum_comm
+ _ = ∑ M ∈ 𝓜, ∏ v ∈ M, p v := sum_congr rfl fun M _ => sum_weight_ite_superset p M
+
+/-! ### Minimal forbidden subsets of bad sets; the size of a transversal -/
+
+/-- Every bad set contains an inclusion-minimal forbidden set. -/
+theorem exists_minimalForbidden_subset {X : Type} [Fintype X] [DecidableEq X]
+ (F : RealizedData X) (U : Finset X) (hU : ¬ IsGood F U) :
+ ∃ M : Finset X, IsMinimalForbidden F M ∧ M ⊆ U := by
+ induction U using Finset.strongInduction with
+ | H U ih =>
+ by_cases h : ∃ v ∈ U, ¬ IsGood F (U.erase v)
+ · obtain ⟨v, hv, hbad⟩ := h
+ obtain ⟨M, hM, hMU⟩ := ih (U.erase v) (erase_ssubset hv) hbad
+ exact ⟨M, hM, hMU.trans (erase_subset v U)⟩
+ · exact ⟨U, ⟨hU, fun v hv => of_not_not fun hb => h ⟨v, hv, hb⟩⟩, subset_rfl⟩
+
+/-- A transversal of `e` has exactly `|e|` elements (one per block of `e`). -/
+theorem card_of_isTransversal {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}
+ {e : Finset (Fin F.b)} {U : Finset X} (h : IsTransversal F e U) : U.card = e.card := by
+ obtain ⟨hsupp, hone⟩ := h
+ have hU : U = e.biUnion (fun i => U ∩ block F i) := by
+ ext v
+ simp only [mem_biUnion, mem_inter, UniversalLaw.Proofs.P15Structure.Aux.mem_block_iff]
+ constructor
+ · intro hv
+ refine ⟨F.blk v, ?_, hv, rfl⟩
+ rw [← hsupp]
+ exact mem_image_of_mem _ hv
+ · rintro ⟨i, -, hv, -⟩
+ exact hv
+ rw [hU, card_biUnion]
+ · rw [sum_congr rfl hone]
+ simp
+ · intro i _ j _ hij
+ exact (UniversalLaw.Proofs.P15Structure.Aux.block_disjoint F hij).mono
+ inter_subset_right inter_subset_right
+
+/-! ### The six-block benchmark at `p_v = 1/40900` -/
+
+open UniversalLaw.Proofs.P15Structure.Aux in
+/-- Every bad set of the six-block benchmark contains an internal pair or a transversal
+quadruple. -/
+theorem benchmark816_bad_covered (U : Finset (Fin 6 × Fin 409))
+ (hU : ¬ IsGood benchmark816 U) : ∃ M ∈ pairs816 ∪ transAll816, M ⊆ U := by
+ obtain ⟨M, hM, hMU⟩ := exists_minimalForbidden_subset benchmark816 U hU
+ refine ⟨M, ?_, hMU⟩
+ rw [mem_union, mem_pairs816, mem_transAll816]
+ exact (minForb816_iff M).1 hM
+
+-- The style linter `constructorNameAsVariable` (variable names shadowing constructor names)
+-- exhausts the recursion limit on this local context (as in `P15Structure`); it is a naming
+-- linter, not a check.
+set_option linter.constructorNameAsVariable false in
+open UniversalLaw.Proofs.P15Structure.Aux in
+/-- Display (P11), first line: the union bound over the `6 * C(409,2)` pairs and the
+`15 * 409^4` transversal quadruples at `p_v = 1/40900`. -/
+theorem benchmark816_one_sub_mu_le :
+ 1 - mu benchmark816 (fun _ => (1 : ℝ) / 40900) ≤ 500616 / 40900 ^ 2 + 15 / 100 ^ 4 := by
+ have hp : ∀ v : Fin 6 × Fin 409,
+ 0 ≤ (fun _ => (1 : ℝ) / 40900) v ∧ (fun _ => (1 : ℝ) / 40900) v ≤ 1 :=
+ fun _ => by norm_num
+ refine (one_sub_mu_le_sum_prod benchmark816 _ hp _ benchmark816_bad_covered).trans ?_
+ rw [sum_union disjoint_pairs816_transAll816]
+ have hpair : ∀ M ∈ pairs816, ∏ v ∈ M, (fun _ => (1 : ℝ) / 40900) v = (1 / 40900) ^ 2 := by
+ intro M hM
+ obtain ⟨_, -, hcard⟩ := mem_pairs816.1 hM
+ rw [prod_const, hcard]
+ have htrans : ∀ M ∈ transAll816,
+ ∏ v ∈ M, (fun _ => (1 : ℝ) / 40900) v = (1 / 40900) ^ 4 := by
+ intro M hM
+ rw [mem_transAll816] at hM
+ obtain ⟨e, he, hT⟩ := hM
+ rw [prod_const, card_of_isTransversal hT, mem_H_benchmark816 he]
+ rw [sum_congr rfl hpair, sum_congr rfl htrans, sum_const, sum_const, card_pairs816,
+ card_transAll816, nsmul_eq_mul, nsmul_eq_mul]
+ have hc : Nat.choose 409 2 = 83436 := by
+ rw [Nat.choose_two_right]
+ rw [hc]
+ push_cast
+ norm_num
+
+end Aux
+
+/-- Proves: `UniversalLaw.Spec.P15.Benchmark816Cover` (claim `p15-realized-covers`, Section 6 of
+P15_REALIZED_COVERS.md: "At816 colors it covers the obstruction; at815 it does not").
+Method: Proposition P2 (`FullBlockCoverIff`) for the six-block data, which satisfy
+`IsRealizedFamily` (`Benchmark816IsRealized`), reduces both clauses to `816 ≤ K`, and
+`Benchmark816Palette` evaluates the palette number to `816`.
+Does not establish: the informal claim, its review or acceptance; alignment of the formal
+`IsGeneratorCover`/`obstruction` with the informal notions; optimality of any other cover
+(disposition transcribed in the statement: HOLD_WITH_DOMAIN). -/
+theorem benchmark816Cover : UniversalLaw.Spec.P15.Benchmark816Cover := by
+ have h := UniversalLaw.Proofs.P15Structure.fullBlockCoverIff benchmark816
+ UniversalLaw.Proofs.P15Structure.benchmark816IsRealized
+ have hpal : paletteNumber benchmark816.b benchmark816.H benchmark816.d = 816 :=
+ UniversalLaw.Proofs.P15Structure.benchmark816Palette
+ refine ⟨(h 816).2 (by rw [hpal]), fun hc => ?_⟩
+ have h815 := (h 815).1 hc
+ rw [hpal] at h815
+ omega
+
+/-- Proves: `UniversalLaw.Spec.P15.LocalRestriction` (claim `p15-realized-covers`, display (P2) of
+P15_REALIZED_COVERS.md: `D_i = D ∩ 2^(X_i) = {S ⊆ X_i : |S| ≤ a_i}`).
+Method: for `S ⊆ X_i`, `S ∩ X_i = S`, so goodness gives `|S| ≤ a_i`; conversely a subset of one
+block with at most `a_i` elements is good because its support has at most one index and every
+edge has at least two (`P15Structure.Aux.good_of_subset_block`).
+Does not establish: the informal claim, its review or acceptance; alignment of `IsGood` with the
+informal downset `D`. -/
+theorem localRestriction {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.LocalRestriction F := by
+ intro hF i S hS
+ constructor
+ · intro hgood
+ have h := hgood.1 i
+ rwa [inter_eq_left.2 hS] at h
+ · intro hcard
+ exact UniversalLaw.Proofs.P15Structure.Aux.good_of_subset_block hF hS hcard
+
+/-- Proves: `UniversalLaw.Spec.P15.PaletteNumberAttained` (claim `p15-realized-covers`, Section 4
+of P15_REALIZED_COVERS.md: "By discarding excess labels within blocks, one may take |P_i|=d_i";
+the feasible set of palette sizes is nonempty).
+Method: disjoint label intervals of lengths `d_i` form a feasible palette of size `∑ d_i` when
+every edge has at least two indices (`P15Structure.Aux.isPaletteFeasible_paletteNumber`), so the
+infimum over `ℕ` is attained (`csInf_mem` of a nonempty set of naturals).
+Does not establish: the informal claim, its review or acceptance; the value of the palette
+number for any family. -/
+theorem paletteNumberAttained {X : Type} [Fintype X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.PaletteNumberAttained F :=
+ fun hF => UniversalLaw.Proofs.P15Structure.Aux.isPaletteFeasible_paletteNumber F.H F.d hF.2.2.2.1
+
+/-- Proves: `UniversalLaw.Spec.P15.Benchmark816UnionBound` (claim `p15-realized-covers`, display
+(P11) of P15_REALIZED_COVERS.md: `Q = 1 - mu_p(D) ≤ 500616/40900^2 + 15/100^4 =
+2449227/8180000000 < 3/10000` at `p_v = 1/40900`).
+Method: `1 - mu_p(D)` is the total weight of the bad sets; every bad set contains a minimal
+forbidden set, which by Proposition P1 for the six-block data is an internal pair (`6 * C(409,2)`
+of them) or a transversal quadruple (`15 * 409^4`); the union bound exchanges the two sums and the
+marginal identity `∑_{U ⊇ M} w(U) = ∏_{v ∈ M} p_v` evaluates each term to `(1/40900)^|M|`; the
+two rational identities are exact arithmetic (`norm_num`), and the last clause follows from the
+first three by `linarith`.
+Does not establish: the informal claim, its review or acceptance; the exact value of the bad
+probability (the source stresses "only a union bound, not an equality of the global bad
+probability"); alignment of `mu`/`IsGood` with the informal objects. -/
+theorem benchmark816UnionBound : UniversalLaw.Spec.P15.Benchmark816UnionBound := by
+ have h1 := Aux.benchmark816_one_sub_mu_le
+ have h3 : (500616 / 40900 ^ 2 + 15 / 100 ^ 4 : ℝ) < 3 / 10000 := by norm_num
+ refine ⟨h1, by norm_num, by norm_num, ?_⟩
+ linarith
+
+end UniversalLaw.Proofs.P15Covers
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Elementary.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Elementary.lean
new file mode 100644
index 000000000..d68e35e6e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Elementary.lean
@@ -0,0 +1,1015 @@
+import Specifications.P15
+
+/-!
+# P15: kernel-checked proofs of elementary registered `Prop`s (statement module `Specifications.P15`)
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+Every theorem below has as its TYPE a registered `Prop` constant of
+`UniversalLaw.Spec.P15` (statement packet `specifications/lean_statements_20261010`, commit
+pinned there). A kernel-checked proof of such a `Prop` is evidence about that `Prop` only: it
+does not make the informal Layer 0 claim accepted, reviewed or "verified", does not change any
+LANDING_CLAIMS disposition, and does not touch the statement register (the statement module is
+not edited here). Helper lemmas live in the `Aux` namespace and are not inventory items.
+
+Allowed transitive axioms: `propext`, `Classical.choice`, `Quot.sound` only (checked by
+`#print axioms`, see the run receipt). No `sorry`, `native_decide`, `decide` on `ℝ`, or custom
+axioms. The three `decide` calls in this module act on finite `Finset`/`Fin` data (ground sets of
+size at most three) and are kernel-reduced.
+
+Covered (fifteen `Prop`s): `TwoCoordGeneratorPrices`, `LogOnePlusBelowIdentity`, `LogRatioBound`,
+`CapTestAtTwoThirds`, `RatioExponentBound`, `RhoStarBelowSixSevenths`, `SixSeventhsCertificate`,
+`HStarExceedsOne`, `PhiAtPStar`, `OddMajorityIdentity`, `HazardStarPositive`,
+`DemandOneBoundary`, `DemandOneRefutation`, `CapacityWorstCase`, `TriangleNeedsThree`.
+
+Also covered (two further `Prop`s, proved in the final section of this module, so seventeen in
+all): `CapacityHazardIsBinomial`, `SharpnessOfRhoStar`.
+
+Not covered here: `IsProperDownset` (a parametrised predicate, not a concrete-instance `Prop`;
+it is false for the empty family, so no theorem of that type can exist), `ElementaryPaletteFormula`
+(display (P9) quantified over all `b`, `s`, `d`: genuine combinatorics, not a finite statement),
+and everything listed as hard analysis or large-benchmark in the proof-packet contract.
+-/
+
+namespace UniversalLaw.Proofs.P15Elementary
+
+open UniversalLaw.Spec.P15
+
+namespace Aux
+
+/-! ### Real-analytic constants -/
+
+/-- `2 < e` from Mathlib's decimal bound. -/
+theorem two_lt_exp_one : (2 : ℝ) < Real.exp 1 := by
+ have := Real.exp_one_gt_d9; linarith
+
+/-- `3e - 2 > 0`. -/
+theorem three_exp_sub_two_pos : (0 : ℝ) < 3 * Real.exp 1 - 2 := by
+ have := two_lt_exp_one; linarith
+
+/-- `exp 2 = (exp 1)^2`. -/
+theorem exp_two_eq : Real.exp 2 = Real.exp 1 ^ 2 := by
+ rw [← Real.exp_nat_mul]; norm_num
+
+/-- `exp (-2) = (exp (-1))^2`. -/
+theorem exp_neg_two_eq : Real.exp (-2) = Real.exp (-1) ^ 2 := by
+ rw [← Real.exp_nat_mul]; norm_num
+
+/-- `exp (-3) = (exp (-1))^3`. -/
+theorem exp_neg_three_eq : Real.exp (-3) = Real.exp (-1) ^ 3 := by
+ rw [← Real.exp_nat_mul]; norm_num
+
+/-- `log(3e - 2) < 2`, from `3e - 2 < e^2`, i.e. `(e-1)(e-2) > 0`. -/
+theorem log_three_exp_sub_two_lt_two : Real.log (3 * Real.exp 1 - 2) < 2 := by
+ rw [Real.log_lt_iff_lt_exp three_exp_sub_two_pos, exp_two_eq]
+ have := two_lt_exp_one
+ nlinarith
+
+/-- `1 < h_star`. -/
+theorem one_lt_hStar : 1 < hStar := by
+ unfold hStar; have := log_three_exp_sub_two_lt_two; linarith
+
+/-- The Taylor sum of the Section 6 certificate, evaluated exactly. -/
+theorem taylor_sum_eq :
+ (∑ j ∈ Finset.range 6, (11 / 6 : ℝ) ^ j / (Nat.factorial j : ℝ)) =
+ 197 / 32 + 26081 / 933120 := by
+ simp [Finset.sum_range_succ, Nat.factorial]
+ norm_num
+
+/-- `197/32 < exp(11/6)` by the degree-5 Taylor lower bound. -/
+theorem exp_eleven_sixths_gt : (197 / 32 : ℝ) < Real.exp (11 / 6) := by
+ have h := Real.sum_le_exp_of_nonneg (by norm_num : (0 : ℝ) ≤ 11 / 6) 6
+ rw [taylor_sum_eq] at h
+ linarith
+
+/-- `3e - 2 < 197/32` from `e < 2.7182818286`. -/
+theorem three_exp_sub_two_lt : 3 * Real.exp 1 - 2 < (197 / 32 : ℝ) := by
+ have := Real.exp_one_lt_d9; linarith
+
+/-- `log(3e - 2) < 11/6`. -/
+theorem log_three_exp_sub_two_lt : Real.log (3 * Real.exp 1 - 2) < 11 / 6 := by
+ rw [Real.log_lt_iff_lt_exp three_exp_sub_two_pos]
+ exact lt_trans three_exp_sub_two_lt exp_eleven_sixths_gt
+
+/-- `7/6 < h_star`. -/
+theorem seven_sixths_lt_hStar : (7 / 6 : ℝ) < hStar := by
+ unfold hStar; have := log_three_exp_sub_two_lt; linarith
+
+/-- `rho_star < 6/7`. -/
+theorem rhoStar_lt_six_sevenths : rhoStar < 6 / 7 := by
+ unfold rhoStar
+ have h : (7 / 6 : ℝ) < 3 - Real.log (3 * Real.exp 1 - 2) := seven_sixths_lt_hStar
+ rw [div_lt_iff₀ (by linarith)]
+ linarith
+
+/-- `0 < p_star`. -/
+theorem pStar_pos : 0 < pStar := by
+ unfold pStar; have := Real.exp_neg_one_lt_half; linarith
+
+/-- `1/2 < p_star`. -/
+theorem pStar_gt_half : 1 / 2 < pStar := by
+ unfold pStar; have := Real.exp_neg_one_lt_half; linarith
+
+/-- `p_star < 1`. -/
+theorem pStar_lt_one : pStar < 1 := by
+ unfold pStar; have := Real.exp_pos (-1); linarith
+
+/-! ### Product weights -/
+
+/-- The weights of all subsets sum to one (`Finset.prod_add` with `f = p`, `g = 1 - p`). -/
+theorem sum_weight_eq_one {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ) :
+ ∑ U ∈ (Finset.univ : Finset Y).powerset, weight p U = 1 := by
+ have h := Finset.prod_add p (fun v => 1 - p v) (Finset.univ : Finset Y)
+ have hl : ∏ v : Y, (p v + (1 - p v)) = 1 := by simp
+ rw [hl] at h
+ unfold weight
+ exact h.symm
+
+/-! ### Binomial lower tails -/
+
+/-- 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
+`k ≤ n` (Pascal's rule, induction on `k`). -/
+theorem binomTail_succ_left (n k : ℕ) (p : ℝ) (hk : k ≤ n) :
+ binomTail (n + 1) k p =
+ binomTail n k p - (Nat.choose n k : ℝ) * p ^ (k + 1) * (1 - p) ^ (n - k) := by
+ induction k with
+ | zero =>
+ simp [binomTail]
+ ring
+ | succ k ih =>
+ have hk' : k ≤ n := by omega
+ have e1 : binomTail (n + 1) (k + 1) p = binomTail (n + 1) k p +
+ (Nat.choose (n + 1) (k + 1) : ℝ) * p ^ (k + 1) * (1 - p) ^ (n + 1 - (k + 1)) := by
+ unfold binomTail; rw [Finset.sum_range_succ]
+ have e2 : binomTail n (k + 1) p = binomTail n k p +
+ (Nat.choose n (k + 1) : ℝ) * p ^ (k + 1) * (1 - p) ^ (n - (k + 1)) := by
+ unfold binomTail; rw [Finset.sum_range_succ]
+ rw [e1, e2, ih hk', Nat.choose_succ_succ']
+ have h1 : n + 1 - (k + 1) = n - k := by omega
+ have h2 : n - k = (n - (k + 1)) + 1 := by omega
+ rw [h1, h2, pow_succ]
+ push_cast
+ ring
+
+/-- (F9) as an identity: the product measure of the capacity family at a constant vector is the
+binomial lower tail (stated for `a ≤ n`). -/
+theorem muOf_capacityFamily (n a : ℕ) (han : a ≤ n) (c : ℝ) :
+ muOf (capacityFamily n a) (fun _ => c) = binomTail n a c := by
+ unfold muOf capacityFamily binomTail
+ have hw : ∀ U : Finset (Fin n),
+ weight (fun _ : Fin n => c) U = c ^ U.card * (1 - c) ^ (n - U.card) := by
+ intro U; unfold weight; simp [Finset.card_univ_sdiff]
+ rw [Finset.sum_filter]
+ simp_rw [hw]
+ rw [Finset.sum_powerset_apply_card (fun m => if m ≤ a then c ^ m * (1 - c) ^ (n - m) else 0)]
+ simp only [Finset.card_univ, Fintype.card_fin, nsmul_eq_mul, mul_ite, mul_zero]
+ rw [← Finset.sum_filter]
+ have hr : (Finset.range (n + 1)).filter (fun m => m ≤ a) = Finset.range (a + 1) := by
+ ext m; simp; omega
+ rw [hr]
+ exact Finset.sum_congr rfl (fun j _ => by ring)
+
+/-- The lower tail decreases when one trial is added (`a ≤ n`, `0 ≤ c ≤ 1`). -/
+theorem binomTail_antitone_step (n a : ℕ) (han : a ≤ n) (c : ℝ) (h0 : 0 ≤ c) (h1 : c ≤ 1) :
+ binomTail (n + 1) a c ≤ binomTail n a c := by
+ rw [binomTail_succ_left n a c han]
+ have : 0 ≤ (Nat.choose n a : ℝ) * c ^ (a + 1) * (1 - c) ^ (n - a) :=
+ mul_nonneg (mul_nonneg (Nat.cast_nonneg _) (pow_nonneg h0 _)) (pow_nonneg (by linarith) _)
+ linarith
+
+/-- Monotonicity in the number of trials: `binomTail n a c ≤ binomTail m a c` for `a ≤ m ≤ n`. -/
+theorem binomTail_le_of_le (a m n : ℕ) (hm : a ≤ m) (hmn : m ≤ n) (c : ℝ) (h0 : 0 ≤ c)
+ (h1 : c ≤ 1) : binomTail n a c ≤ binomTail m a c := by
+ induction n, hmn using Nat.le_induction with
+ | base => exact le_refl _
+ | succ k hk ih => exact le_trans (binomTail_antitone_step k a (le_trans hm hk) c h0 h1) ih
+
+/-- The lower tail is positive for `0 ≤ c < 1` (the `j = 0` term is `(1-c)^n > 0`). -/
+theorem binomTail_pos (n a : ℕ) (c : ℝ) (h0 : 0 ≤ c) (h1 : c < 1) : 0 < binomTail n a c := by
+ unfold binomTail
+ rw [Finset.sum_range_succ']
+ have hpos : 0 < (Nat.choose n 0 : ℝ) * c ^ 0 * (1 - c) ^ (n - 0) := by
+ simp
+ exact pow_pos (by linarith) _
+ have hnn : 0 ≤ ∑ j ∈ Finset.range a,
+ (Nat.choose n (j + 1) : ℝ) * c ^ (j + 1) * (1 - c) ^ (n - (j + 1)) :=
+ Finset.sum_nonneg (fun j _ =>
+ mul_nonneg (mul_nonneg (Nat.cast_nonneg _) (pow_nonneg h0 _)) (pow_nonneg (by linarith) _))
+ linarith
+
+/-- `P(Bin(3, p_star) ≤ 1) = 3e^{-2} - 2e^{-3}`. -/
+theorem binomTail_three_one : binomTail 3 1 pStar = 3 * Real.exp (-2) - 2 * Real.exp (-3) := by
+ unfold binomTail pStar
+ simp [Finset.sum_range_succ]
+ rw [exp_neg_two_eq, exp_neg_three_eq]
+ ring
+
+/-! ### One block, no edges, capacity `cap`, demand one, ground set of size `cap + 1` -/
+
+section OneBlock
+
+variable (cap : ℕ)
+
+/-- The single block is the whole ground set. -/
+theorem oneBlock_block (i : Fin 1) : block (demandOneBlock cap) i = Finset.univ := by
+ unfold block
+ rw [Fin.fin_one_eq_zero i]
+ simp [demandOneBlock]
+
+/-- A proper subset of a `(cap+1)`-set has at most `cap` elements. -/
+theorem card_le_of_ne_univ (U : Finset (Fin (cap + 1))) (h : U ≠ Finset.univ) :
+ U.card ≤ cap := by
+ have h1 : U.card ≤ Fintype.card (Fin (cap + 1)) := Finset.card_le_univ U
+ have h2 : U.card ≠ Fintype.card (Fin (cap + 1)) :=
+ fun e => h ((Finset.card_eq_iff_eq_univ U).mp e)
+ rw [Fintype.card_fin] at h1 h2
+ omega
+
+/-- Goodness is the capacity constraint. -/
+theorem oneBlock_isGood (U : Finset (Fin (cap + 1))) :
+ IsGood (demandOneBlock cap) U ↔ U.card ≤ cap := by
+ show (∀ i : Fin 1, (U ∩ block (demandOneBlock cap) i).card ≤ cap) ∧
+ (∀ e ∈ (∅ : Finset (Finset (Fin 1))), ¬ e ⊆ supp (demandOneBlock cap) U) ↔ U.card ≤ cap
+ simp [oneBlock_block]
+
+/-- One-piece decomposability is goodness (for any family). -/
+theorem decomp_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (U : Finset X) :
+ IsKDecomposable F 1 U ↔ IsGood F U := by
+ unfold IsKDecomposable
+ constructor
+ · rintro ⟨parts, hgood, -, hU⟩
+ have : U = parts 0 := by rw [← hU]; simp
+ rw [this]; exact hgood 0
+ · intro h
+ refine ⟨fun _ => U, fun _ => h, fun j j' hjj' => absurd (Subsingleton.elim j j') hjj', ?_⟩
+ simp
+
+/-- At `K = 1` the sole obstruction is the full block. -/
+theorem oneBlock_obstruction (U : Finset (Fin (cap + 1))) :
+ U ∈ obstruction (demandOneBlock cap) 1 ↔ U = Finset.univ := by
+ unfold obstruction
+ change ¬ IsKDecomposable (demandOneBlock cap) 1 U ↔ U = Finset.univ
+ rw [decomp_one, oneBlock_isGood, not_le]
+ constructor
+ · intro h
+ by_contra hne
+ have := card_le_of_ne_univ cap U hne
+ omega
+ · rintro rfl
+ rw [Finset.card_univ, Fintype.card_fin]; omega
+
+/-- The side conditions hold for `cap ≥ 1`. -/
+theorem oneBlock_isRealized (hcap : 1 ≤ cap) : IsRealizedFamily (demandOneBlock cap) := by
+ refine ⟨fun _ => hcap, fun _ => le_refl 1, ?_, ?_, ?_⟩
+ · change ∀ i : Fin 1, (block (demandOneBlock cap) i).card = cap * 1 + 1
+ intro i
+ rw [oneBlock_block]
+ simp
+ · change ∀ e ∈ (∅ : Finset (Finset (Fin 1))), 2 ≤ e.card
+ simp
+ · change ∀ e ∈ (∅ : Finset (Finset (Fin 1))), ∀ f ∈ (∅ : Finset (Finset (Fin 1))),
+ e ⊆ f → e = f
+ simp
+
+/-- `mu_p(D) = 1 - prod_v p_v`: every set but the full block is good. -/
+theorem oneBlock_mu (p : Fin (cap + 1) → ℝ) :
+ mu (demandOneBlock cap) p = 1 - ∏ v, p v := by
+ unfold mu
+ have hmem : (Finset.univ : Finset (Fin (cap + 1))) ∈
+ (Finset.univ : Finset (Fin (cap + 1))).powerset :=
+ Finset.mem_powerset.mpr (subset_refl _)
+ rw [← Finset.add_sum_erase _ _ hmem]
+ have h0 : Set.indicator (downset (demandOneBlock cap)) (weight p) Finset.univ = 0 := by
+ apply Set.indicator_of_notMem
+ show ¬ IsGood (demandOneBlock cap) Finset.univ
+ rw [oneBlock_isGood, Finset.card_univ, Fintype.card_fin]
+ omega
+ rw [h0, zero_add]
+ have h1 : ∀ U ∈ (Finset.univ : Finset (Fin (cap + 1))).powerset.erase Finset.univ,
+ Set.indicator (downset (demandOneBlock cap)) (weight p) U = weight p U := by
+ intro U hU
+ rw [Finset.mem_erase] at hU
+ apply Set.indicator_of_mem
+ show IsGood (demandOneBlock cap) U
+ rw [oneBlock_isGood]
+ exact card_le_of_ne_univ cap U hU.1
+ rw [Finset.sum_congr rfl h1]
+ have h2 := Finset.add_sum_erase (Finset.univ : Finset (Fin (cap + 1))).powerset (weight p) hmem
+ rw [sum_weight_eq_one] at h2
+ have h3 : weight p Finset.univ = ∏ v, p v := by unfold weight; simp
+ linarith
+
+/-- At unit prices every cover of `{X}` costs at least one. -/
+theorem oneBlock_coverCost_ge_one :
+ 1 ≤ coverCost (demandOneBlock cap) 1 (fun _ => (1 : ℝ)) := by
+ unfold coverCost
+ apply le_csInf
+ · refine ⟨1, {Finset.univ}, ?_, ?_⟩
+ · intro U hU
+ rw [oneBlock_obstruction] at hU
+ exact ⟨Finset.univ, Finset.mem_singleton_self _, by rw [hU]⟩
+ · simp [famPrice, genPrice]
+ · rintro t ⟨G, hG, rfl⟩
+ have huniv : Finset.univ ∈ obstruction (demandOneBlock cap) 1 :=
+ (oneBlock_obstruction cap _).mpr rfl
+ obtain ⟨g, hg, -⟩ := hG Finset.univ huniv
+ unfold famPrice
+ calc (1 : ℝ) = genPrice (fun _ => (1 : ℝ)) g := by simp [genPrice]
+ _ ≤ ∑ g ∈ G, genPrice (fun _ => (1 : ℝ)) g :=
+ Finset.single_le_sum (fun g _ => by simp [genPrice]) hg
+
+end OneBlock
+
+/-- The two-coordinate record of the price boundary is the `cap = 1` demand-one block. -/
+theorem twoCoord_eq : twoCoord = demandOneBlock 1 := rfl
+
+/-! ### The triangle palette instance -/
+
+/-- Three singletons are a feasible palette of size three for the triangle. -/
+theorem triangle_feasible3 : IsPaletteFeasible 3 (completeClutter 3 1) (fun _ => 1) 3 := by
+ refine ⟨fun i => {i}, fun i => by simp, ?_⟩
+ decide
+
+/-- No palette of size zero. -/
+theorem triangle_not_feasible0 : ¬ IsPaletteFeasible 3 (completeClutter 3 1) (fun _ => 1) 0 := by
+ rintro ⟨P, hP, -⟩
+ have h1 : 1 ≤ (P 0).card := hP 0
+ have h0 : (P 0).card ≤ Fintype.card (Fin 0) := Finset.card_le_univ _
+ rw [Fintype.card_fin] at h0
+ omega
+
+/-- No palette of size one (finite check). -/
+theorem triangle_not_feasible1 : ¬ IsPaletteFeasible 3 (completeClutter 3 1) (fun _ => 1) 1 := by
+ unfold IsPaletteFeasible
+ decide
+
+/-- No palette of size two (finite check over the `4^3` label-set assignments). -/
+theorem triangle_not_feasible2 : ¬ IsPaletteFeasible 3 (completeClutter 3 1) (fun _ => 1) 2 := by
+ unfold IsPaletteFeasible
+ decide
+
+end Aux
+
+/-! ## Price boundary (demand one) -/
+
+/-- Proves: `UniversalLaw.Spec.P15.TwoCoordGeneratorPrices` (register rows `p15-price-boundary`,
+`math.p15-price-boundary`).
+Method: unfold `genPrice`/`twoCoordC`, evaluate the four finite products with `simp`/`norm_num`.
+Does not establish: the demand-one refutation itself (`DemandOneRefutation`), any review or
+acceptance of P15-PRICE-BOUNDARY-20260924-v1; the disposition EXACT_COUNTEREXAMPLE is
+transcribed in the register, not derived here. -/
+theorem twoCoordGeneratorPrices : UniversalLaw.Spec.P15.TwoCoordGeneratorPrices := by
+ unfold UniversalLaw.Spec.P15.TwoCoordGeneratorPrices
+ refine ⟨?_, ?_, ?_, ?_⟩
+ · simp [genPrice]
+ · simp [genPrice, twoCoordC]
+ · simp [genPrice, twoCoordC]
+ · simp [genPrice, twoCoordC, Finset.prod_const]
+ norm_num
+
+/-- Proves: `UniversalLaw.Spec.P15.LogOnePlusBelowIdentity` (register row `p15-price-boundary`).
+Method: `Real.log_lt_sub_one_of_pos` at `1 + x`.
+Does not establish: anything about the refutation beyond this elementary inequality. -/
+theorem logOnePlusBelowIdentity : UniversalLaw.Spec.P15.LogOnePlusBelowIdentity := by
+ intro x hx
+ have h := Real.log_lt_sub_one_of_pos (by linarith : (0 : ℝ) < 1 + x)
+ (by intro h; linarith : (1 : ℝ) + x ≠ 1)
+ linarith
+
+/-- Proves: `UniversalLaw.Spec.P15.DemandOneRefutation` (register rows `p15-price-boundary`,
+`math.p15-price-boundary`).
+Method: `twoCoord` is definitionally the `cap = 1` demand-one block, so the one-block lemmas
+give the side conditions, the obstruction `{X}` and `mu_p(D) = 1 - (1/2)^2 = 3/4`; `K_H(d) = 1`
+by `Nat.sInf_le`/`le_csInf` (no palette of size `0`); admissibility and `phi(1/2) = log 2` from
+`Real.log_two_gt_d9`/`Real.log_two_lt_d9`; every cover contains a generator `g ⊆ X`, whose price
+`(2/3)^|g| ≥ 4/9`, and `{X}` attains `4/9` (`IsLeast.csInf_eq`); `log(4/3) < 1/3` from
+`Real.log_lt_sub_one_of_pos`.
+Does not establish: that the refutation contradicts original P15-B ("It does not contradict the
+original P15-B amalgamation"), anything at the `408` scale or about the unrestricted prize, the
+source's integral representation of `log 2`, nonauthor review or acceptance; the disposition
+EXACT_COUNTEREXAMPLE is transcribed, not derived. -/
+theorem demandOneRefutation : UniversalLaw.Spec.P15.DemandOneRefutation := by
+ unfold UniversalLaw.Spec.P15.DemandOneRefutation
+ have hlog2 := Real.log_two_gt_d9
+ have hlog2' := Real.log_two_lt_d9
+ have hphi : phi (1 / 2) = Real.log 2 := by
+ unfold phi
+ have h : (1 : ℝ) / 2 < 1 := by norm_num
+ simp only [h, ↓reduceIte]
+ rw [show (1 : ℝ) - 1 / 2 = (2 : ℝ)⁻¹ by norm_num, Real.log_inv, neg_neg]
+ exact min_eq_right (by linarith)
+ have hobs : ∀ U : Finset (Fin 2), U ∈ obstruction twoCoord 1 ↔ U = Finset.univ :=
+ Aux.oneBlock_obstruction 1
+ have hmu : mu twoCoord twoCoordP = 3 / 4 := by
+ have h := Aux.oneBlock_mu 1 twoCoordP
+ rw [show mu twoCoord twoCoordP = mu (demandOneBlock 1) twoCoordP from rfl, h]
+ simp [twoCoordP]
+ norm_num
+ have hlog43 : Real.log (4 / 3) < 1 / 3 := by
+ have h := Real.log_lt_sub_one_of_pos (by norm_num : (0 : ℝ) < 4 / 3) (by norm_num)
+ linarith
+ have hch : cappedHazard 1 (mu twoCoord twoCoordP) = Real.log (4 / 3) := by
+ rw [hmu]
+ unfold cappedHazard
+ have h : (0 : ℝ) < 3 / 4 := by norm_num
+ simp only [h, ↓reduceIte, one_mul]
+ rw [show (3 / 4 : ℝ) = (4 / 3)⁻¹ by norm_num, Real.log_inv, neg_neg]
+ exact min_eq_right (by linarith)
+ have hcover : ∀ G : Finset (Finset (Fin 2)), IsGeneratorCover twoCoord 1 G →
+ 4 / 9 ≤ famPrice twoCoordC G := by
+ intro G hG
+ have huniv : (Finset.univ : Finset (Fin 2)) ∈ obstruction twoCoord 1 := (hobs _).mpr rfl
+ obtain ⟨g, hg, -⟩ := hG _ huniv
+ unfold famPrice
+ have hgp : genPrice twoCoordC g = (2 / 3) ^ g.card := by
+ simp [genPrice, twoCoordC, div_pow]
+ have hcard : g.card ≤ 2 := by
+ have := Finset.card_le_univ g; simpa using this
+ calc (4 / 9 : ℝ) = (2 / 3) ^ 2 := by norm_num
+ _ ≤ (2 / 3) ^ g.card := pow_le_pow_of_le_one (by norm_num) (by norm_num) hcard
+ _ = genPrice twoCoordC g := hgp.symm
+ _ ≤ ∑ g ∈ G, genPrice twoCoordC g :=
+ Finset.single_le_sum (fun g _ => by
+ unfold genPrice
+ exact Finset.prod_nonneg (fun v _ => by unfold twoCoordC; norm_num)) hg
+ have hcc : coverCost twoCoord 1 twoCoordC = 4 / 9 := by
+ unfold coverCost
+ apply IsLeast.csInf_eq
+ refine ⟨⟨{Finset.univ}, ?_, ?_⟩, ?_⟩
+ · intro U hU
+ rw [hobs] at hU
+ exact ⟨Finset.univ, Finset.mem_singleton_self _, by rw [hU]⟩
+ · simp [famPrice, genPrice, twoCoordC]
+ norm_num
+ · rintro t ⟨G, hG, rfl⟩
+ exact hcover G hG
+ have hpal : paletteNumber 1 ∅ (fun _ => 1) = 1 := by
+ unfold paletteNumber
+ have h1 : (1 : ℕ) ∈ {K : ℕ | IsPaletteFeasible 1 ∅ (fun _ => 1) K} := by
+ refine ⟨fun _ => {0}, fun _ => by simp, fun e he => by simp at he⟩
+ apply le_antisymm (Nat.sInf_le h1)
+ apply le_csInf ⟨1, h1⟩
+ intro K hK
+ obtain ⟨P, hP, -⟩ := hK
+ by_contra hlt
+ have hK0 : K = 0 := by omega
+ subst hK0
+ have h1le : 1 ≤ (P 0).card := hP 0
+ have h0 : (P 0).card ≤ Fintype.card (Fin 0) := Finset.card_le_univ _
+ rw [Fintype.card_fin] at h0
+ omega
+ refine ⟨Aux.oneBlock_isRealized 1 le_rfl, hpal, hobs, ?_, hphi, by linarith, hmu, hch, hlog43,
+ hcover, hcc, by norm_num, ?_⟩
+ · intro v
+ show (2 / 3 : ℝ) ≤ phi (1 / 2)
+ rw [hphi]; linarith
+ · rw [hch, hcc]; linarith
+
+/-! ## Restricted price budget: elementary displays -/
+
+/-- Proves: `UniversalLaw.Spec.P15.LogRatioBound` (register row `p15-price-budget-restricted`).
+Method: `Real.log_le_sub_one_of_pos` at `(1 - p)⁻¹` and `Real.log_inv`.
+Does not establish: display (T1) or the restricted budget; the source's integral representation
+of `-log(1-p)` is not formalised. -/
+theorem logRatioBound : UniversalLaw.Spec.P15.LogRatioBound := by
+ intro p hp0 hp1
+ have h1p : 0 < 1 - p := by linarith
+ have h := Real.log_le_sub_one_of_pos (inv_pos.mpr h1p)
+ rw [Real.log_inv] at h
+ have e : (1 - p)⁻¹ - 1 = p / (1 - p) := by
+ field_simp
+ ring
+ linarith
+
+/-- Proves: `UniversalLaw.Spec.P15.CapTestAtTwoThirds` (register row `p15-price-budget-restricted`).
+Method: `log 3 > 1` from `exp 1 < 3` (Mathlib's `Real.exp_one_lt_d9`); for `2/3 ≤ q < 1`,
+`-log(1-q) ≥ log 3 > 1` so the `min` is `1`; at `q = 1` the definition of `phi` gives `1`.
+Does not establish: the checker program of the source's Section 5, nor any budget statement. -/
+theorem capTestAtTwoThirds : UniversalLaw.Spec.P15.CapTestAtTwoThirds := by
+ unfold UniversalLaw.Spec.P15.CapTestAtTwoThirds
+ have hlog3 : 1 < Real.log 3 := by
+ rw [Real.lt_log_iff_exp_lt (by norm_num)]
+ have := Real.exp_one_lt_d9
+ linarith
+ refine ⟨hlog3, ?_⟩
+ intro q hq1 hq2
+ unfold phi
+ rcases lt_or_eq_of_le hq2 with h | h
+ · simp only [h, ↓reduceIte]
+ have h1q : 0 < 1 - q := by linarith
+ have hle : 1 - q ≤ 1 / 3 := by linarith
+ have hl : Real.log (1 - q) ≤ Real.log (1 / 3) := Real.log_le_log h1q hle
+ rw [one_div, Real.log_inv] at hl
+ exact min_eq_left (by linarith)
+ · subst h
+ simp
+
+/-- Proves: `UniversalLaw.Spec.P15.RatioExponentBound` (register row `p15-price-budget-restricted`).
+Method: `3^n ≥ 3^(2a+1)` and the exact identity `4^(a+1)/3^(2a+1) = (4/3)(4/9)^a`; then
+`(4/9)^a ≤ 4/9` for `a ≥ 1`.
+Does not establish: the ratio steps of (T3) preceding the exponent arithmetic, or (T4)/(T1). -/
+theorem ratioExponentBound : UniversalLaw.Spec.P15.RatioExponentBound := by
+ intro a n ha hn
+ constructor
+ · have h3 : (3 : ℝ) ^ (2 * a + 1) ≤ 3 ^ n := pow_le_pow_right₀ (by norm_num) hn
+ have h3pos : (0 : ℝ) < 3 ^ (2 * a + 1) := by positivity
+ calc (4 : ℝ) ^ (a + 1) / 3 ^ n ≤ 4 ^ (a + 1) / 3 ^ (2 * a + 1) :=
+ div_le_div_of_nonneg_left (by positivity) h3pos h3
+ _ = (4 / 3) * (4 / 9) ^ a := by
+ rw [pow_succ, pow_succ, pow_mul, div_pow]
+ norm_num
+ ring
+ · have h : (4 / 9 : ℝ) ^ a ≤ (4 / 9) ^ 1 := pow_le_pow_of_le_one (by norm_num) (by norm_num) ha
+ nlinarith [h]
+
+/-! ## Full price: the constant `rho_star` -/
+
+/-- Proves: `UniversalLaw.Spec.P15.RhoStarBelowSixSevenths` (register row `p15-full-price`).
+Method: `3e - 2 < 197/32 < exp(11/6)` (decimal bound on `e`; degree-5 Taylor lower bound on
+`exp`), hence `h_star > 7/6` and `rho_star = 1/h_star < 6/7`.
+Does not establish: the 20-digit enclosure (F3) (`RhoStarEnclosure`), the budget (F2), or any
+review/acceptance of P15-FULL-TRANSFORMED-PRICE-20260924-v1 (disposition REVIEWED_SCOPED is
+transcribed, not derived). -/
+theorem rhoStarBelowSixSevenths : UniversalLaw.Spec.P15.RhoStarBelowSixSevenths :=
+ Aux.rhoStar_lt_six_sevenths
+
+/-- Proves: `UniversalLaw.Spec.P15.SixSeventhsCertificate` (register row `p15-full-price`).
+Method: `Real.exp_one_lt_d9` for `e < 31967/11760`; `norm_num` for the two rational identities;
+`Real.sum_le_exp_of_nonneg` with six terms for `197/32 < exp(11/6)`; then `log` monotonicity.
+Does not establish: the series and geometric-tail bounds the source uses for `e < 31967/11760`
+(a sharper Mathlib bound is used instead), nor anything about (F2). -/
+theorem sixSeventhsCertificate : UniversalLaw.Spec.P15.SixSeventhsCertificate := by
+ unfold UniversalLaw.Spec.P15.SixSeventhsCertificate
+ have he := Real.exp_one_lt_d9
+ refine ⟨by linarith, by norm_num, by norm_num, ?_, by norm_num, Aux.three_exp_sub_two_lt,
+ Aux.exp_eleven_sixths_gt, Aux.seven_sixths_lt_hStar, Aux.rhoStar_lt_six_sevenths⟩
+ rw [Aux.taylor_sum_eq]
+ norm_num
+
+/-- Proves: `UniversalLaw.Spec.P15.HStarExceedsOne` (register row `p15-full-price`).
+Method: `2 < e` from `Real.exp_one_gt_d9`; `ring` for the factorisation; `u = exp(-1) < 1/2`
+and `u(1-u)(1-2u) > 0` for `3e^{-2} - 2e^{-3} < e^{-1}`; `log(3e-2) < 2` from `3e-2 < e^2`.
+Does not establish: (F11) for general `(n, a)` (that is `CapacityWorstCase`). -/
+theorem hStarExceedsOne : UniversalLaw.Spec.P15.HStarExceedsOne := by
+ unfold UniversalLaw.Spec.P15.HStarExceedsOne
+ have he := Aux.two_lt_exp_one
+ refine ⟨he, by ring, mul_pos (by linarith) (by linarith), ?_, Aux.one_lt_hStar⟩
+ rw [Aux.exp_neg_two_eq, Aux.exp_neg_three_eq]
+ have hu : 0 < Real.exp (-1) := Real.exp_pos _
+ have hu2 : Real.exp (-1) < 1 / 2 := Real.exp_neg_one_lt_half
+ nlinarith [mul_pos (mul_pos hu (by linarith : (0 : ℝ) < 1 - Real.exp (-1)))
+ (by linarith : (0 : ℝ) < 1 - 2 * Real.exp (-1))]
+
+/-- Proves: `UniversalLaw.Spec.P15.PhiAtPStar` (register row `p15-full-price`).
+Method: `p_star < 1`, `1 - p_star = exp(-1)`, `Real.log_exp`.
+Does not establish: equality of the two sides of (F7) (not specified separately). -/
+theorem phiAtPStar : UniversalLaw.Spec.P15.PhiAtPStar := by
+ unfold UniversalLaw.Spec.P15.PhiAtPStar phi pStar
+ have hpos := Real.exp_pos (-1)
+ have hlt : (1 : ℝ) - Real.exp (-1) < 1 := by linarith
+ simp only [hlt, ↓reduceIte]
+ have e : (1 : ℝ) - (1 - Real.exp (-1)) = Real.exp (-1) := by ring
+ rw [e, Real.log_exp]
+ norm_num
+
+/-! ## Full price: hazard positivity, binomial identities, worst case -/
+
+/-- Proves: `UniversalLaw.Spec.P15.HazardStarPositive` (register row `p15-full-price`).
+Method: at the constant vector `p_star ∈ (0,1)` all weights are nonnegative, the empty set
+contributes `(1-p_star)^n > 0`, and since `X ∉ A` the mass is at most `1 - p_star^n < 1`
+(all weights sum to one by `Finset.prod_add`); then `Real.log_neg`.
+Does not establish: the bounds (F5)-(F8) that use `H_A > 0`. -/
+theorem hazardStarPositive : UniversalLaw.Spec.P15.HazardStarPositive := by
+ intro n A _ hA
+ obtain ⟨hempty, huniv, -⟩ := hA
+ unfold hazardStar
+ have hp0 := Aux.pStar_pos
+ have hp1 := Aux.pStar_lt_one
+ have hw_nonneg : ∀ U : Finset (Fin n), 0 ≤ weight (fun _ : Fin n => pStar) U := by
+ intro U; unfold weight
+ apply mul_nonneg
+ · exact Finset.prod_nonneg (fun v _ => hp0.le)
+ · exact Finset.prod_nonneg (fun v _ => by linarith)
+ have hempty_w : 0 < weight (fun _ : Fin n => pStar) (∅ : Finset (Fin n)) := by
+ unfold weight
+ simp
+ exact pow_pos (by linarith) _
+ have hpos : 0 < muOf A (fun _ : Fin n => pStar) := by
+ unfold muOf
+ exact lt_of_lt_of_le hempty_w (Finset.single_le_sum (fun U _ => hw_nonneg U) hempty)
+ have hsub : A ⊆ (Finset.univ : Finset (Fin n)).powerset.erase Finset.univ := by
+ intro U hU
+ rw [Finset.mem_erase]
+ exact ⟨fun h => huniv (h ▸ hU), Finset.mem_powerset.mpr (Finset.subset_univ U)⟩
+ have hle : muOf A (fun _ : Fin n => pStar) ≤
+ ∑ U ∈ (Finset.univ : Finset (Fin n)).powerset.erase Finset.univ,
+ weight (fun _ : Fin n => pStar) U :=
+ Finset.sum_le_sum_of_subset_of_nonneg hsub (fun U _ _ => hw_nonneg U)
+ have hmem : (Finset.univ : Finset (Fin n)) ∈ (Finset.univ : Finset (Fin n)).powerset :=
+ Finset.mem_powerset.mpr (subset_refl _)
+ have hsum := Finset.add_sum_erase (Finset.univ : Finset (Fin n)).powerset
+ (weight (fun _ : Fin n => pStar)) hmem
+ rw [Aux.sum_weight_eq_one] at hsum
+ have huniv_w : 0 < weight (fun _ : Fin n => pStar) (Finset.univ : Finset (Fin n)) := by
+ unfold weight
+ simp
+ exact pow_pos hp0 _
+ have hlt : muOf A (fun _ : Fin n => pStar) < 1 := by linarith
+ have := Real.log_neg hpos hlt
+ linarith
+
+/-- Proves: `UniversalLaw.Spec.P15.OddMajorityIdentity` (register row `p15-full-price`).
+Method: the one-trial recursion `binomTail (n+1) k = binomTail n k - C(n,k) p^(k+1) (1-p)^(n-k)`
+(Pascal's rule, induction on `k`) applied twice, Pascal's rule once more, `ring`; the second
+form by `Nat.choose_symm_half`; negativity from `p(1-2p) < 0` and a positive factor.
+Does not establish: (F11) itself (the chain over `a` is in `CapacityWorstCase`). -/
+theorem oddMajorityIdentity : UniversalLaw.Spec.P15.OddMajorityIdentity := by
+ intro a p
+ have e1 := Aux.binomTail_succ_left (2 * a + 2) (a + 1) p (by omega)
+ have e2 : binomTail (2 * a + 2) (a + 1) p = binomTail (2 * a + 1) (a + 1) p -
+ (Nat.choose (2 * a + 1) (a + 1) : ℝ) * p ^ (a + 1 + 1) * (1 - p) ^ (2 * a + 1 - (a + 1)) :=
+ Aux.binomTail_succ_left (2 * a + 1) (a + 1) p (by omega)
+ have e3 : binomTail (2 * a + 1) (a + 1) p = binomTail (2 * a + 1) a p +
+ (Nat.choose (2 * a + 1) (a + 1) : ℝ) * p ^ (a + 1) * (1 - p) ^ (2 * a + 1 - (a + 1)) := by
+ unfold binomTail; rw [Finset.sum_range_succ]
+ have hc : (Nat.choose (2 * a + 2) (a + 1) : ℝ) =
+ (Nat.choose (2 * a + 1) a : ℝ) + (Nat.choose (2 * a + 1) (a + 1) : ℝ) := by
+ exact_mod_cast Nat.choose_succ_succ' (2 * a + 1) a
+ have x1 : 2 * a + 2 - (a + 1) = a + 1 := by omega
+ have x2 : 2 * a + 1 - (a + 1) = a := by omega
+ have hd : binomTail (2 * a + 3) (a + 1) p - binomTail (2 * a + 1) a p =
+ (1 - p) ^ 2 * ((Nat.choose (2 * a + 1) (a + 1) : ℝ) * p ^ (a + 1) * (1 - p) ^ a) -
+ p ^ 2 * ((Nat.choose (2 * a + 1) a : ℝ) * p ^ a * (1 - p) ^ (a + 1)) := by
+ rw [show 2 * a + 3 = 2 * a + 2 + 1 by omega, e1, e2, e3, hc, x1, x2]
+ ring
+ have hd2 : binomTail (2 * a + 3) (a + 1) p - binomTail (2 * a + 1) a p =
+ p * (1 - 2 * p) * ((Nat.choose (2 * a + 1) a : ℝ) * p ^ a * (1 - p) ^ (a + 1)) := by
+ rw [hd, Nat.choose_symm_half]
+ ring
+ refine ⟨hd, hd2, ?_⟩
+ intro hp1 hp2
+ rw [hd2]
+ have hneg : p * (1 - 2 * p) < 0 := mul_neg_of_pos_of_neg (by linarith) (by linarith)
+ have hpos : 0 < (Nat.choose (2 * a + 1) a : ℝ) * p ^ a * (1 - p) ^ (a + 1) :=
+ mul_pos (mul_pos (Nat.cast_pos.mpr (Nat.choose_pos (by omega))) (pow_pos (by linarith) _))
+ (pow_pos (by linarith) _)
+ exact mul_neg_of_neg_of_pos hneg hpos
+
+namespace Aux
+
+/-- The chain of (F10) at `p ∈ (1/2, 1)`: `P(Bin(2a+1,p) ≤ a) ≤ P(Bin(3,p) ≤ 1)` for `a ≥ 1`. -/
+theorem binomTail_odd_chain (a : ℕ) (ha : 1 ≤ a) (c : ℝ) (hc : 1 / 2 < c) (hc1 : c < 1) :
+ binomTail (2 * a + 1) a c ≤ binomTail 3 1 c := by
+ induction a, ha using Nat.le_induction with
+ | base => exact le_refl _
+ | succ k hk ih =>
+ have h := (oddMajorityIdentity k c).2.2 hc hc1
+ rw [show 2 * (k + 1) + 1 = 2 * k + 3 by ring]
+ linarith
+
+end Aux
+
+/-- Proves: `UniversalLaw.Spec.P15.CapacityWorstCase` (register row `p15-full-price`).
+Method: `mu_{p_star}(capacityFamily n a) = binomTail n a p_star` (`Finset.sum_powerset_apply_card`),
+the tail decreases in `n` (one-trial recursion) and along `a ↦ a+1` at `p_star > 1/2` (F10), so
+`binomTail n a ≤ binomTail 3 1` and `-log` reverses the order; `binomTail 3 1 p_star` evaluates
+to `3e^{-2} - 2e^{-3} = (3e-2)e^{-3}`, whose `-log` is `h_star`; `h_star > 1` as in
+`HStarExceedsOne`.
+Does not establish: the local price bound (F12) or the assembly (F13); the source's remark "it
+is not a finite-grid extrapolation" is a statement about its own proof, not re-derived. -/
+theorem capacityWorstCase : UniversalLaw.Spec.P15.CapacityWorstCase := by
+ unfold UniversalLaw.Spec.P15.CapacityWorstCase
+ have hp0 := Aux.pStar_pos
+ have hp12 := Aux.pStar_gt_half
+ have hp1 := Aux.pStar_lt_one
+ have hid : ∀ n a : ℕ, a ≤ n →
+ hazardStar (capacityFamily n a) = -Real.log (binomTail n a pStar) := by
+ intro n a h; unfold hazardStar; rw [Aux.muOf_capacityFamily n a h]
+ refine ⟨?_, ?_, ?_, Aux.one_lt_hStar⟩
+ · intro a n ha hn
+ rw [hid 3 1 (by norm_num), hid n a (by omega)]
+ have h1 : binomTail n a pStar ≤ binomTail (2 * a + 1) a pStar :=
+ Aux.binomTail_le_of_le a (2 * a + 1) n (by omega) hn pStar hp0.le hp1.le
+ have h2 : binomTail (2 * a + 1) a pStar ≤ binomTail 3 1 pStar :=
+ Aux.binomTail_odd_chain a ha pStar hp12 hp1
+ have hpos := Aux.binomTail_pos n a pStar hp0.le hp1
+ have := Real.log_le_log hpos (le_trans h1 h2)
+ linarith
+ · rw [hid 3 1 (by norm_num), Aux.binomTail_three_one]
+ · unfold hStar
+ have e : 3 * Real.exp (-2) - 2 * Real.exp (-3) = (3 * Real.exp 1 - 2) * Real.exp (-3) := by
+ rw [show Real.exp (-2) = Real.exp 1 * Real.exp (-3) by rw [← Real.exp_add]; norm_num]
+ ring
+ rw [e, Real.log_mul (ne_of_gt Aux.three_exp_sub_two_pos) (Real.exp_pos _).ne', Real.log_exp]
+ ring
+
+/-! ## Full price Section 5: the exact demand boundary -/
+
+/-- Proves: `UniversalLaw.Spec.P15.DemandOneBoundary` (register row `p15-full-price`).
+Method: one-block lemmas (block = ground set, good ⇔ `|U| ≤ cap`, obstruction `{X}` at `K = 1`,
+`mu_p(D) = 1 - prod p_v` via `Finset.prod_add`, unit-price covers cost at least one by
+`le_csInf`); `p_star^(cap+1) < p_star` for `cap ≥ 1`; `Real.log_lt_log`; for `rho ≤ 1` the capped
+hazard is `min(1, rho(-log mu)) ≤ -log mu < 1 ≤ covercost`.
+Does not establish: any retraction of original P15-B ("whose local-budget premise is missing in
+that case"); the equality `covercost = 1` (only the lower bound is needed and stated). -/
+theorem demandOneBoundary : UniversalLaw.Spec.P15.DemandOneBoundary := by
+ intro cap hcap
+ have hp0 := Aux.pStar_pos
+ have hp1 := Aux.pStar_lt_one
+ have h1p : 1 - pStar = Real.exp (-1) := by unfold pStar; ring
+ have hmu : mu (demandOneBlock cap) (fun _ => pStar) = 1 - pStar ^ (cap + 1) := by
+ rw [Aux.oneBlock_mu]; simp
+ have hpow : pStar ^ (cap + 1) < pStar := by
+ calc pStar ^ (cap + 1) ≤ pStar ^ 2 := pow_le_pow_of_le_one hp0.le hp1.le (by omega)
+ _ < pStar := by nlinarith
+ have hexp : Real.exp (-1) < 1 - pStar ^ (cap + 1) := by linarith
+ have hmu_pos : 0 < mu (demandOneBlock cap) (fun _ => pStar) := by
+ rw [hmu]; have := Real.exp_pos (-1); linarith
+ have hmu_lt : mu (demandOneBlock cap) (fun _ => pStar) < 1 := by
+ rw [hmu]; have := pow_pos hp0 (cap + 1); linarith
+ have hlog : -Real.log (mu (demandOneBlock cap) (fun _ => pStar)) < 1 := by
+ rw [hmu]
+ have := Real.log_lt_log (Real.exp_pos _) hexp
+ rw [Real.log_exp] at this
+ linarith
+ have hcc := Aux.oneBlock_coverCost_ge_one cap
+ refine ⟨Aux.oneBlock_isRealized cap hcap, Aux.oneBlock_obstruction cap, hcc, hmu, hexp, hlog,
+ ?_⟩
+ intro ρ hρ
+ unfold cappedHazard
+ simp only [hmu_pos, ↓reduceIte]
+ have hL : 0 < -Real.log (mu (demandOneBlock cap) (fun _ => pStar)) := by
+ have := Real.log_neg hmu_pos hmu_lt; linarith
+ have hmul := mul_le_mul_of_nonneg_right hρ hL.le
+ calc min 1 (ρ * -Real.log (mu (demandOneBlock cap) (fun _ => pStar)))
+ ≤ ρ * -Real.log (mu (demandOneBlock cap) (fun _ => pStar)) := min_le_right _ _
+ _ < 1 := by linarith
+ _ ≤ coverCost (demandOneBlock cap) 1 (fun _ => (1 : ℝ)) := hcc
+
+/-! ## Realized covers Section 5: the triangle -/
+
+/-- Proves: `UniversalLaw.Spec.P15.TriangleNeedsThree` (register row `p15-realized-covers`).
+Method: `K_H(d) = sInf` of the feasible set; three singletons are feasible at `K = 3`
+(`Nat.sInf_le`); sizes `0`, `1`, `2` are infeasible (`K = 0` by cardinality, `K = 1, 2` by
+kernel `decide` over the finitely many label-set assignments), so `le_csInf` gives `3 ≤ sInf`.
+Does not establish: display (P9) (`ElementaryPaletteFormula`), the matroid palette formula, or
+anything about the realized-covers budget (P8). -/
+theorem triangleNeedsThree : UniversalLaw.Spec.P15.TriangleNeedsThree := by
+ unfold UniversalLaw.Spec.P15.TriangleNeedsThree paletteNumber
+ have h3 : (3 : ℕ) ∈ {K : ℕ | IsPaletteFeasible 3 (completeClutter 3 1) (fun _ => 1) K} :=
+ Aux.triangle_feasible3
+ apply le_antisymm (Nat.sInf_le h3)
+ apply le_csInf ⟨3, h3⟩
+ intro K hK
+ by_contra hlt
+ have hK : IsPaletteFeasible 3 (completeClutter 3 1) (fun _ => 1) K := hK
+ interval_cases K
+ · exact Aux.triangle_not_feasible0 hK
+ · exact Aux.triangle_not_feasible1 hK
+ · exact Aux.triangle_not_feasible2 hK
+
+/-! ## Full price Sections 3 and 5: (F9) for every `a`, and the sharpness of `rho_star` -/
+
+namespace Aux
+
+/-- (F9) as an identity for every `a` (no `a ≤ n` hypothesis): the extra terms `j > n` of the
+tail vanish since `Nat.choose n j = 0`. -/
+theorem muOf_capacityFamily_all (n a : ℕ) (c : ℝ) :
+ muOf (capacityFamily n a) (fun _ => c) = binomTail n a c := by
+ unfold muOf capacityFamily binomTail
+ have hw : ∀ U : Finset (Fin n),
+ weight (fun _ : Fin n => c) U = c ^ U.card * (1 - c) ^ (n - U.card) := by
+ intro U; unfold weight; simp [Finset.card_univ_sdiff]
+ rw [Finset.sum_filter]
+ simp_rw [hw]
+ rw [Finset.sum_powerset_apply_card (fun m => if m ≤ a then c ^ m * (1 - c) ^ (n - m) else 0)]
+ simp only [Finset.card_univ, Fintype.card_fin, nsmul_eq_mul, mul_ite, mul_zero]
+ rw [← Finset.sum_filter]
+ have hr : (Finset.range (n + 1)).filter (fun m => m ≤ a) =
+ (Finset.range (a + 1)).filter (fun m => m ≤ n) := by
+ ext m; simp; omega
+ rw [hr, Finset.sum_filter]
+ refine Finset.sum_congr rfl (fun j _ => ?_)
+ split_ifs with h
+ · ring
+ · rw [Nat.choose_eq_zero_of_lt (by omega)]; simp
+
+/-! ### The triple block: one block, `a = 1`, `d = 2`, ground set of size three, no edges -/
+
+/-- The single block is the whole ground set. -/
+theorem tripleBlock_block (i : Fin 1) : block tripleBlock i = Finset.univ := by
+ unfold block
+ rw [Fin.fin_one_eq_zero i]
+ simp [tripleBlock]
+
+/-- Goodness is the capacity constraint `|U| ≤ 1`. -/
+theorem tripleBlock_isGood (U : Finset (Fin 3)) : IsGood tripleBlock U ↔ U.card ≤ 1 := by
+ show (∀ i : Fin 1, (U ∩ block tripleBlock i).card ≤ 1) ∧
+ (∀ e ∈ (∅ : Finset (Finset (Fin 1))), ¬ e ⊆ supp tripleBlock U) ↔ U.card ≤ 1
+ simp [tripleBlock_block]
+
+/-- Two-decomposability is `|U| ≤ 2`: two good parts have at most two elements in all
+(`Finset.card_biUnion_le`), and a set of size `≤ 2` splits into singletons and empties. -/
+theorem tripleBlock_decomp (U : Finset (Fin 3)) :
+ IsKDecomposable tripleBlock 2 U ↔ U.card ≤ 2 := by
+ unfold IsKDecomposable
+ constructor
+ · rintro ⟨parts, hgood, -, hU⟩
+ rw [← hU]
+ calc ((Finset.univ : Finset (Fin 2)).biUnion parts).card
+ ≤ ∑ j : Fin 2, (parts j).card := Finset.card_biUnion_le
+ _ ≤ ∑ _j : Fin 2, 1 := Finset.sum_le_sum (fun j _ => (tripleBlock_isGood _).mp (hgood j))
+ _ = 2 := by simp
+ · intro h
+ have hc : U.card = 0 ∨ U.card = 1 ∨ U.card = 2 := by omega
+ rcases hc with h0 | h1 | h2
+ · rw [Finset.card_eq_zero] at h0
+ subst h0
+ refine ⟨fun _ => ∅, ?_, ?_, ?_⟩
+ · intro j; rw [tripleBlock_isGood]; simp
+ · intro j j' _; exact Finset.disjoint_empty_left _
+ · ext v
+ simp
+ · obtain ⟨x, rfl⟩ := Finset.card_eq_one.mp h1
+ refine ⟨fun j => if j = 0 then {x} else ∅, ?_, ?_, ?_⟩
+ · intro j; rw [tripleBlock_isGood]; dsimp only; split_ifs <;> simp
+ · intro j j' hjj'
+ fin_cases j <;> fin_cases j' <;> simp_all
+ · ext v
+ simp
+ · obtain ⟨x, y, hxy, rfl⟩ := Finset.card_eq_two.mp h2
+ refine ⟨fun j => if j = 0 then {x} else {y}, ?_, ?_, ?_⟩
+ · intro j; rw [tripleBlock_isGood]; dsimp only; split_ifs <;> simp
+ · intro j j' hjj'
+ fin_cases j <;> fin_cases j' <;> simp_all [hxy.symm]
+ · ext v
+ simp
+
+/-- At `K = 2` the sole obstruction is the full triple. -/
+theorem tripleBlock_obstruction (U : Finset (Fin 3)) :
+ U ∈ obstruction tripleBlock 2 ↔ U = Finset.univ := by
+ unfold obstruction
+ change ¬ IsKDecomposable tripleBlock 2 U ↔ U = Finset.univ
+ rw [tripleBlock_decomp, not_le]
+ constructor
+ · intro h
+ by_contra hne
+ have := card_le_of_ne_univ 2 U hne
+ omega
+ · rintro rfl
+ rw [Finset.card_univ, Fintype.card_fin]; omega
+
+/-- The side conditions: `a = 1 ≥ 1`, `d = 2 ≥ 1`, `|X| = 3 = 1 * 2 + 1`, no edges. -/
+theorem tripleBlock_isRealized : IsRealizedFamily tripleBlock := by
+ refine ⟨fun _ => le_rfl, fun _ => by simp [tripleBlock], ?_, ?_, ?_⟩
+ · change ∀ i : Fin 1, (block tripleBlock i).card = 1 * 2 + 1
+ intro i
+ rw [tripleBlock_block]
+ simp
+ · change ∀ e ∈ (∅ : Finset (Finset (Fin 1))), 2 ≤ e.card
+ simp
+ · change ∀ e ∈ (∅ : Finset (Finset (Fin 1))), ∀ f ∈ (∅ : Finset (Finset (Fin 1))),
+ e ⊆ f → e = f
+ simp
+
+/-- The full-block family is `{X}`. -/
+theorem tripleBlock_fullBlockFamily : fullBlockFamily tripleBlock = {Finset.univ} := by
+ ext g
+ simp only [fullBlockFamily, Finset.mem_image, Finset.mem_univ, true_and, Finset.mem_singleton]
+ constructor
+ · rintro ⟨i, rfl⟩
+ exact tripleBlock_block i
+ · rintro rfl
+ exact ⟨(0 : Fin 1), tripleBlock_block 0⟩
+
+/-- `K_H(d) = 2` for one block of demand two and no edges: `{0, 1}` is feasible at `K = 2`, and
+a label set of size `≥ 2` needs `K ≥ 2`. -/
+theorem tripleBlock_palette : paletteNumber 1 ∅ (fun _ => 2) = 2 := by
+ unfold paletteNumber
+ have h2 : (2 : ℕ) ∈ {K : ℕ | IsPaletteFeasible 1 ∅ (fun _ => 2) K} := by
+ refine ⟨fun _ => Finset.univ, fun _ => by simp, fun e he => by simp at he⟩
+ apply le_antisymm (Nat.sInf_le h2)
+ apply le_csInf ⟨2, h2⟩
+ intro K hK
+ obtain ⟨P, hP, -⟩ := hK
+ have h2le : 2 ≤ (P 0).card := hP 0
+ have h0 : (P 0).card ≤ Fintype.card (Fin K) := Finset.card_le_univ _
+ rw [Fintype.card_fin] at h0
+ omega
+
+/-- `mu_p(D)` for the triple block is the mass of the capacity family `(3, 1)`. -/
+theorem tripleBlock_mu (p : Fin 3 → ℝ) : mu tripleBlock p = muOf (capacityFamily 3 1) p := by
+ unfold mu muOf capacityFamily
+ rw [Finset.sum_filter]
+ refine Finset.sum_congr rfl (fun U _ => ?_)
+ by_cases h : U.card ≤ 1
+ · rw [Set.indicator_of_mem (show U ∈ downset tripleBlock from (tripleBlock_isGood U).mpr h)]
+ simp [h]
+ · rw [Set.indicator_of_notMem
+ (show U ∉ downset tripleBlock from fun hm => h ((tripleBlock_isGood U).mp hm))]
+ simp [h]
+
+/-- At unit prices every generator costs one (the empty generator included). -/
+theorem genPrice_one (g : Finset (Fin 3)) : genPrice (fun _ => (1 : ℝ)) g = 1 := by
+ simp [genPrice]
+
+/-- At unit prices every cover of `{X}` costs at least one. -/
+theorem tripleBlock_cover_ge_one (G : Finset (Finset (Fin 3)))
+ (hG : IsGeneratorCover tripleBlock 2 G) : 1 ≤ famPrice (fun _ => (1 : ℝ)) G := by
+ have huniv : (Finset.univ : Finset (Fin 3)) ∈ obstruction tripleBlock 2 :=
+ (tripleBlock_obstruction _).mpr rfl
+ obtain ⟨g, hg, -⟩ := hG Finset.univ huniv
+ unfold famPrice
+ calc (1 : ℝ) = genPrice (fun _ => (1 : ℝ)) g := (genPrice_one g).symm
+ _ ≤ ∑ g ∈ G, genPrice (fun _ => (1 : ℝ)) g :=
+ Finset.single_le_sum (fun g _ => by rw [genPrice_one]; norm_num) hg
+
+/-- The full-block family `{X}` covers the obstruction `{X}`. -/
+theorem tripleBlock_fullBlock_cover :
+ IsGeneratorCover tripleBlock 2 (fullBlockFamily tripleBlock) := by
+ intro U hU
+ rw [tripleBlock_obstruction] at hU
+ rw [tripleBlock_fullBlockFamily]
+ exact ⟨Finset.univ, Finset.mem_singleton_self _, by rw [hU]⟩
+
+/-- The full-block cover costs exactly one at unit prices. -/
+theorem tripleBlock_fullBlock_price :
+ famPrice (fun _ => (1 : ℝ)) (fullBlockFamily tripleBlock) = 1 := by
+ rw [tripleBlock_fullBlockFamily]
+ simp [famPrice, genPrice]
+
+/-- The exact cover cost is one: `{X}` attains the lower bound one. -/
+theorem tripleBlock_coverCost : coverCost tripleBlock 2 (fun _ => (1 : ℝ)) = 1 := by
+ unfold coverCost
+ apply IsLeast.csInf_eq
+ refine ⟨⟨fullBlockFamily tripleBlock, tripleBlock_fullBlock_cover,
+ tripleBlock_fullBlock_price⟩, ?_⟩
+ rintro t ⟨G, hG, rfl⟩
+ exact tripleBlock_cover_ge_one G hG
+
+/-- `mu_{p_star}(D) = P(Bin(3, p_star) ≤ 1) = 3e^{-2} - 2e^{-3}`. -/
+theorem tripleBlock_mu_pStar :
+ mu tripleBlock (fun _ => pStar) = 3 * Real.exp (-2) - 2 * Real.exp (-3) := by
+ rw [tripleBlock_mu, muOf_capacityFamily_all, binomTail_three_one]
+
+/-- The available hazard of the triple block at `p_star` is `h_star`. -/
+theorem tripleBlock_hazard : -Real.log (mu tripleBlock (fun _ => pStar)) = hStar := by
+ rw [tripleBlock_mu_pStar]
+ exact capacityWorstCase.2.2.1
+
+/-- Any `ρ < ρ_star = 1/h_star` makes the capped hazard `min(1, ρ h_star)` strictly less than
+one. -/
+theorem tripleBlock_sharp (ρ : ℝ) (hρ : ρ < rhoStar) :
+ cappedHazard ρ (mu tripleBlock (fun _ => pStar)) < 1 := by
+ have hmu_pos : 0 < mu tripleBlock (fun _ => pStar) := by
+ rw [tripleBlock_mu, muOf_capacityFamily_all]
+ exact binomTail_pos 3 1 pStar pStar_pos.le pStar_lt_one
+ have hlog := tripleBlock_hazard
+ have hh : 0 < hStar := by linarith [one_lt_hStar]
+ have hrho : rhoStar * hStar = 1 := by
+ show 1 / hStar * hStar = 1
+ exact one_div_mul_cancel hh.ne'
+ unfold cappedHazard
+ simp only [hmu_pos, ↓reduceIte]
+ rw [hlog]
+ calc min 1 (ρ * hStar) ≤ ρ * hStar := min_le_right _ _
+ _ < rhoStar * hStar := mul_lt_mul_of_pos_right hρ hh
+ _ = 1 := hrho
+
+end Aux
+
+/-- Proves: `UniversalLaw.Spec.P15.CapacityHazardIsBinomial` (claim `p15-full-price`, display (F9)).
+Method: `hazardStar` unfolds to `-log (muOf (capacityFamily n a) p_star)`, and the mass of the
+capacity family at a constant vector is `binomTail n a` for EVERY `a` (`Finset.sum_powerset_apply_card`
+groups the subsets by cardinality; for `a > n` the extra terms `j > n` vanish since
+`Nat.choose n j = 0`), which extends `Aux.muOf_capacityFamily` beyond `a ≤ n`.
+Does not establish: the informal claim's review or acceptance; the alignment of `capacityFamily` and
+`binomTail` with the source's `A = {S : |S| ≤ a}` and `P(Bin(n, p_star) ≤ a)`
+(PENDING_INDEPENDENT_REVIEW); displays (F10)-(F11) (`CapacityWorstCase`) or anything about the
+budget (F2). -/
+theorem capacityHazardIsBinomial : UniversalLaw.Spec.P15.CapacityHazardIsBinomial := by
+ intro n a
+ unfold hazardStar
+ rw [Aux.muOf_capacityFamily_all n a]
+
+/-- Proves: `UniversalLaw.Spec.P15.SharpnessOfRhoStar` (claim `math.p15-full-price`, full-price note Section 5).
+Method: for `tripleBlock` the single block is the ground set, good sets are those of size `≤ 1`, and a
+set is `2`-decomposable iff it has size `≤ 2` (two singletons/empties; `Finset.card_biUnion_le` for the
+converse), so the obstruction at `K = 2` is `{X}`; `K_H(d) = 2` by `Nat.sInf_le`/`le_csInf`; at unit
+prices every generator costs `1`, every cover of `{X}` costs `≥ 1` (`Finset.single_le_sum`) and the
+full-block cover `{X}` costs `1`, hence `coverCost = 1` (`IsLeast.csInf_eq`); `mu_p(D)` is the mass of
+the capacity family `(3, 1)`, i.e. `binomTail 3 1 p_star = 3e^{-2} - 2e^{-3}`, whose `-log` is `h_star`
+(the identity proved in `capacityWorstCase`); for `ρ < ρ_star = 1/h_star`,
+`min 1 (ρ h_star) ≤ ρ h_star < 1`.
+Does not establish: the informal sharpness claim's review or acceptance; the alignment of the Lean
+`tripleBlock`, `obstruction`, `coverCost` and `cappedHazard` with the source's objects
+(PENDING_INDEPENDENT_REVIEW); sharpness for any family other than the triple block; the budget (F2)
+itself; any necessity claim for multi-block families with some demand one ("other constraints may
+change its budget"). -/
+theorem sharpnessOfRhoStar : UniversalLaw.Spec.P15.SharpnessOfRhoStar :=
+ ⟨Aux.tripleBlock_isRealized, Aux.tripleBlock_palette, Aux.tripleBlock_obstruction, phiAtPStar,
+ Aux.genPrice_one, Aux.tripleBlock_cover_ge_one, Aux.tripleBlock_fullBlock_cover,
+ Aux.tripleBlock_fullBlock_price, Aux.tripleBlock_coverCost, Aux.tripleBlock_hazard,
+ Aux.tripleBlock_sharp⟩
+
+end UniversalLaw.Proofs.P15Elementary
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Hazard.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Hazard.lean
new file mode 100644
index 000000000..37b6a3760
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Hazard.lean
@@ -0,0 +1,404 @@
+import Specifications.P15
+
+/-!
+# P15 hazard proofs: the local price chain (P4), the independent-block hazard (P5) and the
+global assembly (F13)
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+Every theorem outside the `Aux` namespace has as its type exactly one registered `Prop` of
+`Specifications/P15.lean` (statement packet `specifications/lean_statements_20261010`, which is
+not modified here). A kernel-checked proof of such a `Prop` is evidence about that `Prop` only:
+it does not make the informal Layer 0 note reviewed, accepted or "verified", it does not
+identify the formal definitions with the informal objects (that alignment is
+PENDING_INDEPENDENT_REVIEW), and it promotes, closes, discharges or reclassifies nothing.
+
+Helper lemmas live in `UniversalLaw.Proofs.P15Hazard.Aux`; the gate inventories only the
+theorems outside that namespace. The heart of the module is the factorisation
+`Aux.mu_le_prod_localGood`: the product weight of a subset `U` of the ground set factors over
+the blocks as `prod_i w_i(U ∩ X_i)`, a good set has good block restrictions, and the sum over
+`2^X` of a product of block-local quantities is the product of the block-local sums (the
+bijection `U ↦ (i ↦ U ∩ X_i)` onto `prod_i 2^(X_i)`). No independence of crossing events is used
+or asserted. The block-local marginal identity `Aux.sum_blockWeight_filter_supset` and its
+consequence `Aux.prod_le_localFailure_of_card` are exported for the price-budget module.
+-/
+
+namespace UniversalLaw.Proofs.P15Hazard
+
+open UniversalLaw.Spec.P15
+open Finset
+
+namespace Aux
+
+/-! ### The block-local weight -/
+
+/-- The block-restricted weight `w_i(S) = prod_{v in S} p_v prod_{v in X_i \ S} (1 - p_v)`; the
+integrand of `localGood`. -/
+noncomputable def blockWeight {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (p : X → ℝ) (i : Fin F.b) (S : Finset X) : ℝ :=
+ (∏ v ∈ S, p v) * ∏ v ∈ block F i \ S, (1 - p v)
+
+/-- `localGood` is the sum of the indicator of the downset times the block weight. -/
+theorem localGood_eq {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (p : X → ℝ)
+ (i : Fin F.b) :
+ localGood F p i =
+ ∑ S ∈ (block F i).powerset, Set.indicator (downset F) (blockWeight F p i) S := rfl
+
+/-- Block weights are nonnegative for `p in [0,1]^X`. -/
+theorem blockWeight_nonneg {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) (S : Finset X) :
+ 0 ≤ blockWeight F p i S := by
+ unfold blockWeight
+ refine mul_nonneg (Finset.prod_nonneg fun v _ => (hp v).1) (Finset.prod_nonneg fun v _ => ?_)
+ linarith [(hp v).2]
+
+/-- The block weights of all subsets of a block sum to one (`Finset.prod_add`). -/
+theorem sum_blockWeight_eq_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (p : X → ℝ) (i : Fin F.b) :
+ ∑ S ∈ (block F i).powerset, blockWeight F p i S = 1 := by
+ have h := Finset.prod_add p (fun v => 1 - p v) (block F i)
+ have hl : ∏ v ∈ block F i, (p v + (1 - p v)) = 1 := by simp
+ rw [hl] at h
+ unfold blockWeight
+ exact h.symm
+
+/-- The marginal identity: for `S ⊆ X_i`, the block weights of the supersets of `S` inside the
+block sum to `prod_{v in S} p_v` (bijection `T ↦ T \ S` onto `2^(X_i \ S)`). -/
+theorem sum_blockWeight_filter_supset {X : Type} [Fintype X] [DecidableEq X]
+ (F : RealizedData X) (p : X → ℝ) (i : Fin F.b) {S : Finset X} (hS : S ⊆ block F i) :
+ ∑ T ∈ (block F i).powerset with S ⊆ T, blockWeight F p i T = ∏ v ∈ S, p v := by
+ have h1 : ∑ T ∈ (block F i).powerset with S ⊆ T, blockWeight F p i T =
+ ∑ R ∈ (block F i \ S).powerset,
+ (∏ v ∈ S, p v) * ((∏ v ∈ R, p v) * ∏ v ∈ (block F i \ S) \ R, (1 - p v)) := by
+ refine Finset.sum_nbij' (fun T => T \ S) (fun R => R ∪ S) ?_ ?_ ?_ ?_ ?_
+ · intro T hT
+ rw [mem_filter, mem_powerset] at hT
+ exact mem_powerset.2 (sdiff_subset_sdiff hT.1 (subset_refl _))
+ · intro R hR
+ rw [mem_powerset] at hR
+ rw [mem_filter, mem_powerset]
+ exact ⟨union_subset (hR.trans sdiff_subset) hS, subset_union_right⟩
+ · intro T hT
+ rw [mem_filter] at hT
+ exact sdiff_union_of_subset hT.2
+ · intro R hR
+ rw [mem_powerset] at hR
+ exact union_sdiff_cancel_right (sdiff_disjoint.mono_left hR)
+ · intro T hT
+ rw [mem_filter, mem_powerset] at hT
+ unfold blockWeight
+ rw [← prod_sdiff hT.2]
+ have hset : (block F i \ S) \ (T \ S) = block F i \ T := by
+ ext v
+ simp only [mem_sdiff, not_and, not_not]
+ constructor
+ · rintro ⟨⟨hb, hs⟩, h⟩
+ exact ⟨hb, fun ht => hs (h ht)⟩
+ · rintro ⟨hb, ht⟩
+ exact ⟨⟨hb, fun hs => ht (hT.2 hs)⟩, fun ht' => (ht ht').elim⟩
+ rw [hset]
+ ring
+ have h2 := Finset.prod_add p (fun v => 1 - p v) (block F i \ S)
+ have hl : ∏ v ∈ block F i \ S, (p v + (1 - p v)) = 1 := by simp
+ rw [hl] at h2
+ rw [h1, ← Finset.mul_sum, ← h2, mul_one]
+
+/-! ### Bounds on the local good and failure probabilities -/
+
+/-- `0 ≤ mu_p(D_i)`. -/
+theorem localGood_nonneg {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) : 0 ≤ localGood F p i := by
+ rw [localGood_eq]
+ exact Finset.sum_nonneg fun S _ =>
+ Set.indicator_nonneg (fun T _ => blockWeight_nonneg F hp i T) S
+
+/-- `mu_p(D_i) ≤ 1`. -/
+theorem localGood_le_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) : localGood F p i ≤ 1 := by
+ rw [localGood_eq, ← sum_blockWeight_eq_one F p i]
+ exact Finset.sum_le_sum fun S _ =>
+ Set.indicator_apply_le' (fun _ => le_rfl) (fun _ => blockWeight_nonneg F hp i S)
+
+/-- `0 ≤ q_i`. -/
+theorem localFailure_nonneg {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) : 0 ≤ localFailure F p i := by
+ unfold localFailure
+ linarith [localGood_le_one F hp i]
+
+/-- `q_i ≤ 1`. -/
+theorem localFailure_le_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) : localFailure F p i ≤ 1 := by
+ unfold localFailure
+ linarith [localGood_nonneg F hp i]
+
+/-- `1 - q_i = mu_p(D_i)`. -/
+theorem one_sub_localFailure {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (p : X → ℝ) (i : Fin F.b) : 1 - localFailure F p i = localGood F p i := by
+ unfold localFailure
+ ring
+
+/-- Every subset of the block containing `a_i + 1` or more coordinates is bad, so
+`mu_p(D_i) ≤ 1 - prod_{v in S} p_v` for every such `S ⊆ X_i` (marginal identity plus the
+termwise bound `indicator ≤ weight`). -/
+theorem localGood_le_one_sub_prod {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) {i : Fin F.b} {S : Finset X}
+ (hS : S ⊆ block F i) (hcard : F.a i + 1 ≤ S.card) :
+ localGood F p i ≤ 1 - ∏ v ∈ S, p v := by
+ rw [localGood_eq, ← Finset.sum_filter_add_sum_filter_not ((block F i).powerset) (fun T => S ⊆ T)]
+ have h0 : ∑ T ∈ (block F i).powerset with S ⊆ T,
+ Set.indicator (downset F) (blockWeight F p i) T = 0 := by
+ refine Finset.sum_eq_zero fun T hT => ?_
+ rw [mem_filter, mem_powerset] at hT
+ refine Set.indicator_of_notMem (fun hgood => ?_) _
+ have h1 : (T ∩ block F i).card ≤ F.a i := hgood.1 i
+ rw [Finset.inter_eq_left.2 hT.1] at h1
+ have h2 := card_le_card hT.2
+ omega
+ have h3 : ∑ T ∈ (block F i).powerset with ¬ S ⊆ T,
+ Set.indicator (downset F) (blockWeight F p i) T ≤
+ ∑ T ∈ (block F i).powerset with ¬ S ⊆ T, blockWeight F p i T :=
+ Finset.sum_le_sum fun T _ =>
+ Set.indicator_apply_le' (fun _ => le_rfl) (fun _ => blockWeight_nonneg F hp i T)
+ have h4 := Finset.sum_filter_add_sum_filter_not ((block F i).powerset) (fun T => S ⊆ T)
+ (blockWeight F p i)
+ rw [sum_blockWeight_eq_one F p i, sum_blockWeight_filter_supset F p i hS] at h4
+ linarith
+
+/-- The block-local price bound of the (T3)/(T5) arguments: for `S ⊆ X_i` with
+`|S| ≥ a_i + 1`, `prod_{v in S} p_v ≤ q_i`. -/
+theorem prod_le_localFailure_of_card {X : Type} [Fintype X] [DecidableEq X]
+ (F : RealizedData X) {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) {i : Fin F.b}
+ {S : Finset X} (hS : S ⊆ block F i) (hcard : F.a i + 1 ≤ S.card) :
+ ∏ v ∈ S, p v ≤ localFailure F p i := by
+ unfold localFailure
+ linarith [localGood_le_one_sub_prod F hp hS hcard]
+
+/-- The full block has `a_i d_i + 1 ≥ a_i + 1` coordinates, so `prod_{v in X_i} p_v ≤ q_i`. -/
+theorem prod_block_le_localFailure {X : Type} [Fintype X] [DecidableEq X]
+ {F : RealizedData X} (hF : IsRealizedFamily F) {p : X → ℝ}
+ (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) :
+ ∏ v ∈ block F i, p v ≤ localFailure F p i := by
+ refine prod_le_localFailure_of_card F hp (subset_refl _) ?_
+ rw [hF.2.2.1 i]
+ have := Nat.le_mul_of_pos_right (F.a i) (hF.2.1 i)
+ omega
+
+/-! ### The transformed price `phi` -/
+
+/-- `q ≤ -log(1 - q)` for `q < 1` (from `1 - q ≤ exp(-q)`). -/
+theorem neg_log_one_sub_ge {q : ℝ} (hq : q < 1) : q ≤ -Real.log (1 - q) := by
+ have h1 : 1 - q ≤ Real.exp (-q) := by
+ have := Real.add_one_le_exp (-q)
+ linarith
+ have h2 := Real.log_le_log (by linarith : (0 : ℝ) < 1 - q) h1
+ rw [Real.log_exp] at h2
+ linarith
+
+/-- `q ≤ phi(q)` for `q ≤ 1` (in particular on `[0, 1]`). -/
+theorem le_phi_self {q : ℝ} (h1 : q ≤ 1) : q ≤ phi q := by
+ unfold phi
+ split_ifs with h
+ · exact le_min h1 (neg_log_one_sub_ge h)
+ · exact h1
+
+/-! ### Blocks partition the ground set -/
+
+/-- The traces `T ∩ X_i` of a set on the blocks are pairwise disjoint. -/
+theorem pairwiseDisjoint_inter_block {X : Type} [Fintype X] [DecidableEq X]
+ (F : RealizedData X) (T : Finset X) :
+ (↑(univ : Finset (Fin F.b)) : Set (Fin F.b)).PairwiseDisjoint
+ (fun i => T ∩ block F i) := by
+ intro i _ j _ hij
+ show Disjoint (T ∩ block F i) (T ∩ block F j)
+ rw [Finset.disjoint_left]
+ intro v hvi hvj
+ simp only [block, mem_inter, mem_filter, mem_univ, true_and] at hvi hvj
+ exact hij (hvi.2.symm.trans hvj.2)
+
+/-- The traces of a set on the blocks reassemble it. -/
+theorem biUnion_inter_block {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (T : Finset X) : (univ : Finset (Fin F.b)).biUnion (fun i => T ∩ block F i) = T := by
+ ext v
+ simp [block]
+
+/-- A product over a set factors over its traces on the blocks. -/
+theorem prod_eq_prod_blocks {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (f : X → ℝ) (T : Finset X) : ∏ v ∈ T, f v = ∏ i, ∏ v ∈ T ∩ block F i, f v := by
+ calc ∏ v ∈ T, f v = ∏ v ∈ (univ : Finset (Fin F.b)).biUnion (fun i => T ∩ block F i), f v := by
+ rw [biUnion_inter_block]
+ _ = ∏ i, ∏ v ∈ T ∩ block F i, f v := Finset.prod_biUnion (pairwiseDisjoint_inter_block F T)
+
+/-- The complement's trace on a block is the block minus the trace. -/
+theorem compl_inter_block {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (U : Finset X) (i : Fin F.b) : (univ \ U) ∩ block F i = block F i \ (U ∩ block F i) := by
+ ext v
+ simp only [mem_inter, mem_sdiff, mem_univ, true_and, not_and]
+ tauto
+
+/-- The weight of a subset factors over the blocks: `w(U) = prod_i w_i(U ∩ X_i)`. -/
+theorem weight_eq_prod_blockWeight {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (p : X → ℝ) (U : Finset X) : weight p U = ∏ i, blockWeight F p i (U ∩ block F i) := by
+ unfold weight blockWeight
+ rw [show ∏ v ∈ U, p v = ∏ i, ∏ v ∈ U ∩ block F i, p v from prod_eq_prod_blocks F p U,
+ show ∏ v ∈ univ \ U, (1 - p v) = ∏ i, ∏ v ∈ (univ \ U) ∩ block F i, (1 - p v) from
+ prod_eq_prod_blocks F (fun v => 1 - p v) (univ \ U),
+ ← Finset.prod_mul_distrib]
+ refine Finset.prod_congr rfl fun i _ => ?_
+ rw [compl_inter_block]
+
+/-! ### Good sets have good block restrictions -/
+
+/-- `U in D` implies `U ∩ X_i in D`. -/
+theorem isGood_inter_block {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}
+ {U : Finset X} (hU : IsGood F U) (i : Fin F.b) : IsGood F (U ∩ block F i) := by
+ refine ⟨fun j => ?_, fun e he hsub => hU.2 e he (hsub.trans ?_)⟩
+ · exact (card_le_card (inter_subset_inter inter_subset_left (subset_refl _))).trans (hU.1 j)
+ · exact image_subset_image inter_subset_left
+
+/-- Termwise: `1_D(U) w(U) ≤ prod_i 1_D(U ∩ X_i) w_i(U ∩ X_i)`. -/
+theorem indicator_weight_le {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (U : Finset X) :
+ Set.indicator (downset F) (weight p) U ≤
+ ∏ i, Set.indicator (downset F) (blockWeight F p i) (U ∩ block F i) := by
+ by_cases hU : U ∈ downset F
+ · rw [Set.indicator_of_mem hU, weight_eq_prod_blockWeight F p U]
+ refine le_of_eq (Finset.prod_congr rfl fun i _ => ?_)
+ rw [Set.indicator_of_mem (show U ∩ block F i ∈ downset F from isGood_inter_block hU i)]
+ · rw [Set.indicator_of_notMem hU]
+ exact Finset.prod_nonneg fun i _ =>
+ Set.indicator_nonneg (fun T _ => blockWeight_nonneg F hp i T) _
+
+/-! ### The factorisation of a block-local product over `2^X` -/
+
+/-- `sum_{U ⊆ X} prod_i g_i(U ∩ X_i) = prod_i sum_{S ⊆ X_i} g_i(S)`: the bijection
+`U ↦ (i ↦ U ∩ X_i)` from `2^X` onto `prod_i 2^(X_i)` with inverse `x ↦ ⋃_i x_i`. -/
+theorem sum_prod_blocks {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (g : Fin F.b → Finset X → ℝ) :
+ ∑ U ∈ (univ : Finset X).powerset, ∏ i, g i (U ∩ block F i) =
+ ∏ i, ∑ S ∈ (block F i).powerset, g i S := by
+ rw [Finset.prod_univ_sum]
+ refine Finset.sum_nbij' (fun U => fun i => U ∩ block F i) (fun x => univ.biUnion x) ?_ ?_ ?_ ?_
+ ?_
+ · intro U _
+ exact Fintype.mem_piFinset.2 fun i => mem_powerset.2 inter_subset_right
+ · intro x _
+ exact mem_powerset.2 (subset_univ _)
+ · intro U _
+ exact biUnion_inter_block F U
+ · intro x hx
+ have hx' : ∀ j, x j ⊆ block F j := fun j => mem_powerset.1 (Fintype.mem_piFinset.1 hx j)
+ funext i
+ ext v
+ simp only [mem_inter, mem_biUnion, mem_univ, true_and]
+ constructor
+ · rintro ⟨⟨j, hj⟩, hi⟩
+ have h1 : F.blk v = j := by simpa [block] using hx' j hj
+ have h2 : F.blk v = i := by simpa [block] using hi
+ rw [← h2, h1]
+ exact hj
+ · intro hv
+ exact ⟨⟨i, hv⟩, hx' i hv⟩
+ · intro U _
+ rfl
+
+/-- The factorisation `mu_p(D) ≤ prod_i mu_p(D_i)` for `p in [0,1]^X`: termwise domination of
+`1_D(U) w(U)` by the product of block restrictions, then the block-product bijection. -/
+theorem mu_le_prod_localGood {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) : mu F p ≤ ∏ i, localGood F p i := by
+ unfold mu
+ calc ∑ U ∈ (univ : Finset X).powerset, Set.indicator (downset F) (weight p) U
+ ≤ ∑ U ∈ (univ : Finset X).powerset,
+ ∏ i, Set.indicator (downset F) (blockWeight F p i) (U ∩ block F i) :=
+ Finset.sum_le_sum fun U _ => indicator_weight_le F hp U
+ _ = ∏ i, ∑ S ∈ (block F i).powerset, Set.indicator (downset F) (blockWeight F p i) S :=
+ sum_prod_blocks F (fun i S => Set.indicator (downset F) (blockWeight F p i) S)
+ _ = ∏ i, localGood F p i := by
+ refine Finset.prod_congr rfl fun i _ => ?_
+ rw [localGood_eq]
+
+/-- When `mu_p(D) > 0`, every local good probability is positive (a zero factor would zero the
+product that dominates `mu_p(D)`). -/
+theorem localGood_pos_of_mu_pos {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (hmu : 0 < mu F p) (i : Fin F.b) :
+ 0 < localGood F p i := by
+ by_contra h
+ have h0 : localGood F p i = 0 := le_antisymm (not_lt.mp h) (localGood_nonneg F hp i)
+ have := mu_le_prod_localGood F hp
+ rw [Finset.prod_eq_zero (mem_univ i) h0] at this
+ linarith
+
+/-- `-log prod_i mu_p(D_i) = sum_i -log mu_p(D_i)` when `mu_p(D) > 0`. -/
+theorem neg_log_prod_localGood {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (hmu : 0 < mu F p) :
+ -Real.log (∏ i, localGood F p i) = ∑ i, -Real.log (localGood F p i) := by
+ rw [Real.log_prod (fun i _ => (localGood_pos_of_mu_pos F hp hmu i).ne'), Finset.sum_neg_distrib]
+
+/-- `-log prod_i mu_p(D_i) ≤ -log mu_p(D)` when `mu_p(D) > 0`. -/
+theorem neg_log_prod_localGood_le {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (hmu : 0 < mu F p) :
+ -Real.log (∏ i, localGood F p i) ≤ -Real.log (mu F p) :=
+ neg_le_neg (Real.log_le_log hmu (mu_le_prod_localGood F hp))
+
+end Aux
+
+/-! ## Inventory theorems -/
+
+/-- Proves: `UniversalLaw.Spec.P15.LocalPriceChain` (claim `p15-realized-covers`, display (P4)).
+Method: `Finset.prod_le_prod₀` for `0 ≤ c ≤ p`; the block-local marginal bound
+`Aux.prod_le_localFailure_of_card` at `S = X_i` (the full block has `a_i d_i + 1 ≥ a_i + 1`
+coordinates and is therefore bad); `q ≤ phi(q)` on `[0,1]` from `1 - q ≤ exp(-q)`.
+Does not establish: the informal display (P4) or its review and acceptance; the alignment of
+`localFailure` with the source's `q_i` (PENDING_INDEPENDENT_REVIEW); the identification
+`prod p_v = P(U_i = X_i)` as a probabilistic statement; the disposition HOLD_WITH_DOMAIN of
+`p15-realized-covers`, which is transcribed in the register, not derived here. -/
+theorem localPriceChain {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.LocalPriceChain F := by
+ intro hF p c hp hc i
+ refine ⟨?_, Aux.prod_block_le_localFailure hF hp i,
+ Aux.le_phi_self (Aux.localFailure_le_one F hp i)⟩
+ unfold genPrice
+ exact Finset.prod_le_prod₀ (fun v _ => (hc v).1) (fun v _ => (hc v).2)
+
+/-- Proves: `UniversalLaw.Spec.P15.IndependentBlockHazard` (claim `p15-realized-covers`, display
+(P5)).
+Method: `1 - q_i = mu_p(D_i)`; the factorisation `Aux.mu_le_prod_localGood` (block-product
+bijection on `2^X`, no independence assumption); when `mu_p(D) > 0` every `mu_p(D_i) > 0`, so
+`Real.log_prod` turns `-log prod` into `sum -log`, each `q_i ≤ -log(1 - q_i)` by
+`Aux.neg_log_one_sub_ge`, and `-log prod ≤ -log mu` by monotonicity of `log`.
+Does not establish: the informal display (P5) or its review and acceptance; any independence of
+crossing events (none is used); the price bound `sum_i price(G_i) ≤ sum_i q_i` (that is (P4)
+summed, not part of this `Prop`); the alignment of the formal `mu`, `localFailure` with the
+source's objects (PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of
+`p15-realized-covers`. -/
+theorem independentBlockHazard {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.IndependentBlockHazard F := by
+ intro _ p hp
+ have hprod : ∏ i, (1 - localFailure F p i) = ∏ i, localGood F p i :=
+ Finset.prod_congr rfl fun i _ => Aux.one_sub_localFailure F p i
+ rw [hprod]
+ refine ⟨Aux.mu_le_prod_localGood F hp, fun hmu => ⟨?_, Aux.neg_log_prod_localGood_le F hp hmu⟩⟩
+ rw [Aux.neg_log_prod_localGood F hp hmu]
+ refine Finset.sum_le_sum fun i _ => ?_
+ rw [← Aux.one_sub_localFailure F p i]
+ refine Aux.neg_log_one_sub_ge ?_
+ have := Aux.localGood_pos_of_mu_pos F hp hmu i
+ unfold localFailure
+ linarith
+
+/-- Proves: `UniversalLaw.Spec.P15.GlobalAssemblyHazard` (claim `p15-full-price`, display (F13)).
+Method: the factorisation `Aux.mu_le_prod_localGood` (every good set has good block
+restrictions; the weight factors over the blocks; the block-product bijection on `2^X`), then,
+when `mu_p(D) > 0`, every `mu_p(D_i) > 0`, `Real.log_prod` and the monotonicity of `log`.
+Does not establish: the informal display (F13) or its review and acceptance; the local bound
+(F12) or the full-price theorem (F2); any independence of crossing failures (none is used); the
+alignment of the formal `mu`, `localGood` with the source's `mu_p(D)`, `mu_p(D_i)`
+(PENDING_INDEPENDENT_REVIEW); the disposition of `p15-full-price`, which is transcribed in the
+register, not derived here. -/
+theorem globalAssemblyHazard {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.GlobalAssemblyHazard F := by
+ intro _ p hp
+ refine ⟨Aux.mu_le_prod_localGood F hp, fun hmu => ?_⟩
+ rw [← Aux.neg_log_prod_localGood F hp hmu]
+ exact Aux.neg_log_prod_localGood_le F hp hmu
+
+end UniversalLaw.Proofs.P15Hazard
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Interpolation.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Interpolation.lean
new file mode 100644
index 000000000..ff4dbea66
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Interpolation.lean
@@ -0,0 +1,1183 @@
+import Specifications.P15
+import SpecificationProofs.P15Elementary
+import SpecificationProofs.P15Hazard
+import SpecificationProofs.P15Covers
+import SpecificationProofs.P15Budget
+
+/-!
+# P15 interpolation proofs: Theorem F's hazard interpolation (displays (F4)-(F8), (F12), (F2))
+and the (F3) enclosure of `rho_star`
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+Every theorem outside the `Aux` namespace has as its type exactly one registered `Prop` of
+`Specifications/P15.lean` (statement packet `specifications/lean_statements_20261010`, which is
+not modified here). A kernel-checked proof of such a `Prop` is evidence about that `Prop` only:
+it does not make the informal Layer 0 note reviewed, accepted or "verified", it does not
+identify the formal definitions with the informal objects (that alignment is
+PENDING_INDEPENDENT_REVIEW), and it promotes, closes, discharges or reclassifies nothing.
+
+Helper lemmas live in `UniversalLaw.Proofs.P15Interpolation.Aux`, tagged by the display they
+serve (`f3_`, `cc_`, `f6_`, `f7_`, `f8_`, `bi_`, `lp_`, `f2_`); the gate inventories only the
+eight theorems outside that namespace. The mathematics, in the order of the module:
+
+* (F3) `rhoStarLower < rho_star < rhoStarUpper < 6/7`, with `rho_star = 1 / (3 - log(3e - 2))`.
+ Exact rational arithmetic throughout: `rho_star < U` iff `3e - 2 < exp(3 - 1/U)` and
+ `L < rho_star` iff `exp(3 - 1/L) < 3e - 2`; writing `3 - 1/U = 2 + x_U` with `|x_U| < 1/5`,
+ `exp(3 - 1/U) = (exp 1)^2 exp x_U`, and `Real.exp_bound` at degree 26 (for `e`) and degree 16
+ (for `exp x_U`, `exp x_L`) gives rational enclosures that `norm_num` compares against the
+ decimal literals (margins about `1.08 * 10^-20` and `7.53 * 10^-20`).
+* (F4), (F5) The split of `mu_p(A)` at one coordinate: with `p_i` replaced by `x`,
+ `mu(A) = x S_in + (1 - x) S_out`, where `S_in`, `S_out` are the sums, over the members of `A`
+ containing, respectively avoiding, the coordinate, of the weight over the other coordinates.
+ For a downset `S_in ≤ S_out` (erasing the coordinate injects the first family into the second
+ and preserves the reduced weight) and `S_out > 0` once `∅ ∈ A` and every other `p_j < 1`.
+ With `x = 1 - exp(-s)` this is `S_in + (S_out - S_in) exp(-s)`, and `s ↦ -log(a + b exp(-s))`
+ with `a, b ≥ 0`, `a + b > 0` has second derivative `-a b exp(-s) / (a + b exp(-s))^2 ≤ 0`
+ (`concaveOn_of_deriv2_nonpos`): separate coordinatewise concavity of the hazard `F_A`.
+* (F6) The chord inequality of that concavity on `[0,1]`, `f(s) ≥ (1 - s) f(0) + s f(1) ≥ s f(1)`
+ since `f(0) = -log mu ≥ 0`, iterated over the coordinates (`Finset.induction_on`, raising one
+ coordinate to `1` at a time): `(prod_i t_i) H_A ≤ F_A(t)`, as `F_A(1, …, 1) = H_A`.
+* (F7) For `p` in the cube put `t_i := phi(p_i) ∈ [0,1]` and `p'_i := 1 - exp(-t_i) ≤ p_i`;
+ `mu(A)` is antitone in the probability vector for a downset (the same split), so
+ `-log mu_p(A) ≥ -log mu_p'(A) = F_A(t) ≥ (prod_i phi(p_i)) H_A`.
+* (F8) `prod_i c_i ≤ prod_i phi(p_i) ≤ 1` for `0 ≤ c_i ≤ phi(p_i)`, and when `mu_p(A) > 0`,
+ `prod_i phi(p_i) ≤ (1/H_A) [-log mu_p(A)]` by (F7) with `H_A > 0`; the exactness remark: the
+ capped budget at `rho = 1` holds for all admissible `p, c` iff `H_A ≥ 1` (the (⇒) direction
+ instantiates `p ≡ p_star`, `c ≡ 1`, admissible since `phi p_star = 1`).
+* (F12) Each block `X_i` of a realized family is enumerated by `Fin n_i`, `n_i = a_i d_i + 1`;
+ along the enumeration `mu_p(D_i)` is the product measure of the capacity family
+ `{T : |T| ≤ a_i}` (`LocalRestriction`), a proper downset, so (F7) and `CapacityWorstCase`
+ (`h_star ≤ H_{n_i, a_i}`) give `price(X_i) ≤ rho_star [-log mu_p(D_i)]` and `price(X_i) ≤ 1`.
+* (F2) `covercost ≤ 1` (the cover `{∅}`); for `K ≥ K_H(d)` the full blocks cover, so
+ `covercost ≤ sum_i price(X_i) ≤ rho_star sum_i [-log mu_p(D_i)] ≤ rho_star [-log mu_p(D)]`
+ by (F12) and the global assembly (F13), `P15Hazard.globalAssemblyHazard`.
+-/
+
+namespace UniversalLaw.Proofs.P15Interpolation
+
+open UniversalLaw.Spec.P15
+
+namespace Aux
+
+/-! ## (F3) The enclosure of `rho_star`
+
+### A 29-decimal enclosure of `e` from the degree-26 Taylor bound -/
+
+/-- `2.71828182845904523536028746620 < e`: the 26-term Taylor sum of `exp 1` minus the tail bound
+`27 / (26! * 26)` of `Real.exp_bound`, evaluated exactly by `norm_num`. -/
+theorem f3_exp_one_gt : (271828182845904523536028746620 : ℝ) / 10 ^ 29 < Real.exp 1 := by
+ have h := Real.exp_bound (x := (1 : ℝ)) (by simp) (n := 26) (by norm_num)
+ rw [abs_sub_le_iff] at h
+ obtain ⟨-, h2⟩ := h
+ norm_num [Finset.sum_range_succ] at h2
+ linarith
+
+/-- `e < 2.71828182845904523536028747136`: the 26-term Taylor sum of `exp 1` plus the tail bound
+`27 / (26! * 26)` of `Real.exp_bound`, evaluated exactly by `norm_num`. -/
+theorem f3_exp_one_lt : Real.exp 1 < (271828182845904523536028747136 : ℝ) / 10 ^ 29 := by
+ have h := Real.exp_bound (x := (1 : ℝ)) (by simp) (n := 26) (by norm_num)
+ rw [abs_sub_le_iff] at h
+ obtain ⟨h1, -⟩ := h
+ norm_num [Finset.sum_range_succ] at h1
+ linarith
+
+/-! ### Degree-16 Taylor enclosures of `exp x_U` and `exp x_L`
+
+`x_U = 1 - 1/rhoStarUpper = -3863004568775331983 / 21136995431224668017` (reduced) and
+`x_L = 1 - 1/rhoStarLower = -15452018275101327933 / 84547981724898672067`, both about `-0.18276`. -/
+
+/-- Lower bound `0.83296775704110158100003160908803 ≤ exp x_U` from `Real.exp_bound` at degree 16. -/
+theorem f3_exp_xU_ge :
+ (83296775704110158100003160908803 : ℝ) / 10 ^ 32 ≤
+ Real.exp (-3863004568775331983 / 21136995431224668017) := by
+ have hx : |(-3863004568775331983 / 21136995431224668017 : ℝ)| ≤ 1 :=
+ abs_le.mpr ⟨by norm_num, by norm_num⟩
+ have h := Real.exp_bound hx (n := 16) (by norm_num)
+ rw [abs_sub_le_iff] at h
+ obtain ⟨-, h2⟩ := h
+ norm_num [Finset.sum_range_succ] at h2
+ linarith
+
+/-- Upper bound `exp x_L ≤ 0.83296775704110158098837919695330` from `Real.exp_bound` at degree 16. -/
+theorem f3_exp_xL_le :
+ Real.exp (-15452018275101327933 / 84547981724898672067) ≤
+ (83296775704110158098837919695330 : ℝ) / 10 ^ 32 := by
+ have hx : |(-15452018275101327933 / 84547981724898672067 : ℝ)| ≤ 1 :=
+ abs_le.mpr ⟨by norm_num, by norm_num⟩
+ have h := Real.exp_bound hx (n := 16) (by norm_num)
+ rw [abs_sub_le_iff] at h
+ obtain ⟨h1, -⟩ := h
+ norm_num [Finset.sum_range_succ] at h1
+ linarith
+
+/-! ### The two logarithmic inequalities -/
+
+/-- `log(3e - 2) < 2 + x_U = 3 - 1/rhoStarUpper`: equivalently `3e - 2 < (exp 1)^2 * exp x_U`,
+with `e` and `exp x_U` replaced by their rational bounds (`norm_num` margin about `1.08e-20`). -/
+theorem f3_log_lt :
+ Real.log (3 * Real.exp 1 - 2) < 2 + (-3863004568775331983 / 21136995431224668017 : ℝ) := by
+ rw [Real.log_lt_iff_lt_exp P15Elementary.Aux.three_exp_sub_two_pos, Real.exp_add,
+ P15Elementary.Aux.exp_two_eq]
+ have he_lo := f3_exp_one_gt
+ have he_hi := f3_exp_one_lt
+ have hx := f3_exp_xU_ge
+ have hsq : ((271828182845904523536028746620 : ℝ) / 10 ^ 29) ^ 2 ≤ Real.exp 1 ^ 2 :=
+ pow_le_pow_left₀ (by norm_num) he_lo.le 2
+ have hprod : ((271828182845904523536028746620 : ℝ) / 10 ^ 29) ^ 2 *
+ ((83296775704110158100003160908803 : ℝ) / 10 ^ 32) ≤
+ Real.exp 1 ^ 2 * Real.exp (-3863004568775331983 / 21136995431224668017) :=
+ mul_le_mul hsq hx (by norm_num) (sq_nonneg _)
+ have key : 3 * ((271828182845904523536028747136 : ℝ) / 10 ^ 29) - 2 <
+ ((271828182845904523536028746620 : ℝ) / 10 ^ 29) ^ 2 *
+ ((83296775704110158100003160908803 : ℝ) / 10 ^ 32) := by
+ norm_num
+ linarith
+
+/-- `2 + x_L = 3 - 1/rhoStarLower < log(3e - 2)`: equivalently `(exp 1)^2 * exp x_L < 3e - 2`,
+with `e` and `exp x_L` replaced by their rational bounds (`norm_num` margin about `7.53e-20`). -/
+theorem f3_lt_log :
+ 2 + (-15452018275101327933 / 84547981724898672067 : ℝ) < Real.log (3 * Real.exp 1 - 2) := by
+ rw [Real.lt_log_iff_exp_lt P15Elementary.Aux.three_exp_sub_two_pos, Real.exp_add,
+ P15Elementary.Aux.exp_two_eq]
+ have he_lo := f3_exp_one_gt
+ have he_hi := f3_exp_one_lt
+ have hx := f3_exp_xL_le
+ have hsq : Real.exp 1 ^ 2 ≤ ((271828182845904523536028747136 : ℝ) / 10 ^ 29) ^ 2 :=
+ pow_le_pow_left₀ (Real.exp_pos 1).le he_hi.le 2
+ have hprod : Real.exp 1 ^ 2 * Real.exp (-15452018275101327933 / 84547981724898672067) ≤
+ ((271828182845904523536028747136 : ℝ) / 10 ^ 29) ^ 2 *
+ ((83296775704110158098837919695330 : ℝ) / 10 ^ 32) :=
+ mul_le_mul hsq hx (Real.exp_pos _).le (by norm_num)
+ have key : ((271828182845904523536028747136 : ℝ) / 10 ^ 29) ^ 2 *
+ ((83296775704110158098837919695330 : ℝ) / 10 ^ 32) <
+ 3 * ((271828182845904523536028746620 : ℝ) / 10 ^ 29) - 2 := by
+ norm_num
+ linarith
+
+/-! ### The three conjuncts of (F3) -/
+
+/-- `0 < h_star` written out, from `one_lt_hStar`. -/
+theorem f3_hStar_pos : (0 : ℝ) < 3 - Real.log (3 * Real.exp 1 - 2) := by
+ have h := P15Elementary.Aux.one_lt_hStar
+ unfold hStar at h
+ linarith
+
+/-- `rho_star < rhoStarUpper`. -/
+theorem f3_rhoStar_lt_upper : rhoStar < rhoStarUpper := by
+ unfold rhoStar rhoStarUpper
+ rw [div_lt_iff₀ f3_hStar_pos]
+ have h := f3_log_lt
+ linarith
+
+/-- `rhoStarLower < rho_star`. -/
+theorem f3_lower_lt_rhoStar : rhoStarLower < rhoStar := by
+ unfold rhoStar rhoStarLower
+ rw [lt_div_iff₀ f3_hStar_pos]
+ have h := f3_lt_log
+ linarith
+
+/-- `rhoStarUpper < 6/7`, a rational inequality. -/
+theorem f3_upper_lt_six_sevenths : rhoStarUpper < 6 / 7 := by
+ unfold rhoStarUpper
+ norm_num
+
+open Finset
+
+/-! ## (F4), (F5) The split of the product weight at one coordinate and separate concavity -/
+
+/-- The weight of `U` over the coordinates other than `i`: `prod_{v in U, v ≠ i} p_v *
+prod_{v notin U, v ≠ i} (1 - p_v)`. -/
+noncomputable def cc_wOther {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ) (i : Y)
+ (U : Finset Y) : ℝ :=
+ (∏ v ∈ U.erase i, p v) * ∏ v ∈ (univ \ U).erase i, (1 - p v)
+
+/-- The reduced weight is nonnegative when every `p_v` lies in `[0, 1]`. -/
+theorem cc_wOther_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] {p : Y → ℝ}
+ (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Y) (U : Finset Y) : 0 ≤ cc_wOther p i U := by
+ unfold cc_wOther
+ refine mul_nonneg (Finset.prod_nonneg fun v _ => (hp v).1) (Finset.prod_nonneg fun v _ => ?_)
+ linarith [(hp v).2]
+
+/-- The reduced weight of the empty set is positive when every `p_v < 1`. -/
+theorem cc_wOther_empty_pos {Y : Type} [Fintype Y] [DecidableEq Y] {p : Y → ℝ}
+ (hp : ∀ v, p v < 1) (i : Y) : 0 < cc_wOther p i ∅ := by
+ unfold cc_wOther
+ rw [Finset.erase_empty, Finset.prod_empty, one_mul]
+ exact Finset.prod_pos fun v _ => by linarith [hp v]
+
+/-- Erasing the distinguished coordinate does not change the reduced weight. -/
+theorem cc_wOther_erase {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ) (i : Y)
+ (U : Finset Y) : cc_wOther p i (U.erase i) = cc_wOther p i U := by
+ unfold cc_wOther
+ have h1 : (U.erase i).erase i = U.erase i := Finset.erase_idem
+ have h2 : (univ \ U.erase i).erase i = (univ \ U).erase i := by
+ ext v
+ simp only [mem_erase, mem_sdiff, mem_univ, true_and]
+ tauto
+ rw [h1, h2]
+
+/-- A finite product splits off the factor at `i` when `i` belongs to the index set. -/
+theorem cc_prod_split_at {Y : Type} [DecidableEq Y] (s : Finset Y) (f : Y → ℝ) (i : Y) :
+ ∏ v ∈ s, f v = (if i ∈ s then f i else 1) * ∏ v ∈ s.erase i, f v := by
+ by_cases h : i ∈ s
+ · rw [ite_eq_left h, Finset.mul_prod_erase s f h]
+ · rw [ite_eq_right h, one_mul, Finset.erase_eq_of_notMem h]
+
+/-- The weight of `U` under `p` with coordinate `i` replaced by `x`: the factor at `i` is
+`x` or `1 - x` according to `i ∈ U`, times the reduced weight. -/
+theorem cc_weight_update {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ) (i : Y) (x : ℝ)
+ (U : Finset Y) :
+ weight (Function.update p i x) U = (if i ∈ U then x else 1 - x) * cc_wOther p i U := by
+ unfold weight cc_wOther
+ have h1 := cc_prod_split_at U (Function.update p i x) i
+ have h2 := cc_prod_split_at (univ \ U) (fun v => 1 - Function.update p i x v) i
+ simp only [Function.update_self] at h1 h2
+ have e1 : ∏ v ∈ U.erase i, Function.update p i x v = ∏ v ∈ U.erase i, p v :=
+ Finset.prod_congr rfl (fun v hv => Function.update_of_ne (ne_of_mem_erase hv) x p)
+ have e2 : ∏ v ∈ (univ \ U).erase i, (1 - Function.update p i x v)
+ = ∏ v ∈ (univ \ U).erase i, (1 - p v) :=
+ Finset.prod_congr rfl (fun v hv => by rw [Function.update_of_ne (ne_of_mem_erase hv)])
+ rw [h1, h2, e1, e2]
+ by_cases hi : i ∈ U
+ · have hi' : i ∉ univ \ U := by simp [hi]
+ rw [ite_eq_left hi, ite_eq_right hi', ite_eq_left hi]
+ ring
+ · have hi' : i ∈ univ \ U := by simp [hi]
+ rw [ite_eq_right hi, ite_eq_left hi', ite_eq_right hi]
+ ring
+
+/-- Display (F4): the split of `mu_p(A)` at coordinate `i`, for any family `A` (general finite
+ground type). -/
+theorem cc_muOf_update {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))
+ (p : Y → ℝ) (i : Y) (x : ℝ) :
+ muOf A (Function.update p i x) =
+ x * ∑ U ∈ A.filter (fun U => i ∈ U), cc_wOther p i U
+ + (1 - x) * ∑ U ∈ A.filter (fun U => i ∉ U), cc_wOther p i U := by
+ unfold muOf
+ simp only [cc_weight_update, ite_mul]
+ rw [Finset.sum_ite, Finset.mul_sum, Finset.mul_sum]
+
+/-- For a downset, the sum over the members containing `i` is at most the sum over the members
+avoiding `i` (`U ↦ U.erase i` injects the first into the second and preserves `cc_wOther`). -/
+theorem cc_sum_in_le_sum_out {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}
+ (hA : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A) {p : Y → ℝ}
+ (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Y) :
+ ∑ U ∈ A.filter (fun U => i ∈ U), cc_wOther p i U
+ ≤ ∑ U ∈ A.filter (fun U => i ∉ U), cc_wOther p i U := by
+ have hinj : Set.InjOn (fun U : Finset Y => U.erase i)
+ (A.filter (fun U => i ∈ U) : Set (Finset Y)) := by
+ intro U hU V hV hUV
+ have hU' : i ∈ U := (Finset.mem_filter.1 (Finset.mem_coe.1 hU)).2
+ have hV' : i ∈ V := (Finset.mem_filter.1 (Finset.mem_coe.1 hV)).2
+ exact Finset.erase_injOn' i hU' hV' hUV
+ have himg : (A.filter (fun U => i ∈ U)).image (fun U => U.erase i)
+ ⊆ A.filter (fun U => i ∉ U) := by
+ intro V hV
+ rw [Finset.mem_image] at hV
+ obtain ⟨U, hU, rfl⟩ := hV
+ rw [Finset.mem_filter] at hU ⊢
+ exact ⟨hA U hU.1 _ (Finset.erase_subset i U), Finset.notMem_erase i U⟩
+ calc ∑ U ∈ A.filter (fun U => i ∈ U), cc_wOther p i U
+ = ∑ U ∈ A.filter (fun U => i ∈ U), cc_wOther p i (U.erase i) :=
+ Finset.sum_congr rfl (fun U _ => (cc_wOther_erase p i U).symm)
+ _ = ∑ V ∈ (A.filter (fun U => i ∈ U)).image (fun U => U.erase i), cc_wOther p i V :=
+ (Finset.sum_image hinj).symm
+ _ ≤ ∑ U ∈ A.filter (fun U => i ∉ U), cc_wOther p i U :=
+ Finset.sum_le_sum_of_subset_of_nonneg himg (fun U _ _ => cc_wOther_nonneg hp i U)
+
+/-- The sum over the members avoiding `i` is positive once `∅ ∈ A` and every `p_v < 1`. -/
+theorem cc_sum_out_pos {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}
+ (h0 : ∅ ∈ A) {p : Y → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v < 1) (i : Y) :
+ 0 < ∑ U ∈ A.filter (fun U => i ∉ U), cc_wOther p i U := by
+ have hmem : ∅ ∈ A.filter (fun U => i ∉ U) :=
+ Finset.mem_filter.2 ⟨h0, Finset.notMem_empty i⟩
+ have hp1 : ∀ v, 0 ≤ p v ∧ p v ≤ 1 := fun v => ⟨(hp v).1, (hp v).2.le⟩
+ exact lt_of_lt_of_le (cc_wOther_empty_pos (fun v => (hp v).2) i)
+ (Finset.single_le_sum (fun U _ => cc_wOther_nonneg hp1 i U) hmem)
+
+/-- `mu_p(A)` is antitone in each coordinate for a downset and `p` in the cube. -/
+theorem cc_muOf_update_antitone {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}
+ (hA : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A) {p : Y → ℝ}
+ (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Y) {x y : ℝ} (hxy : x ≤ y) :
+ muOf A (Function.update p i y) ≤ muOf A (Function.update p i x) := by
+ rw [cc_muOf_update, cc_muOf_update]
+ have h := cc_sum_in_le_sum_out hA hp i
+ nlinarith [mul_nonneg (sub_nonneg.2 hxy) (sub_nonneg.2 h)]
+
+/-! ### The one-variable function `s ↦ -log(a + b exp(-s))` (display (F5)) -/
+
+/-- `a + b exp(-s) > 0` for `a, b ≥ 0` with `a + b > 0`. -/
+theorem cc_affineExp_pos {a b : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (hab : 0 < a + b) (s : ℝ) :
+ 0 < a + b * Real.exp (-s) := by
+ have he := Real.exp_pos (-s)
+ rcases lt_or_eq_of_le ha with ha' | ha'
+ · have : 0 ≤ b * Real.exp (-s) := mul_nonneg hb he.le
+ linarith
+ · have hb' : 0 < b := by linarith
+ have := mul_pos hb' he
+ linarith
+
+/-- First derivative: `d/ds (-log(a + b e^{-s})) = b e^{-s} / (a + b e^{-s})`. -/
+theorem cc_hasDerivAt_negLog {a b : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (hab : 0 < a + b) (s : ℝ) :
+ HasDerivAt (fun x => -Real.log (a + b * Real.exp (-x)))
+ (b * Real.exp (-s) / (a + b * Real.exp (-s))) s := by
+ have hpos := cc_affineExp_pos ha hb hab s
+ have h1 : HasDerivAt (fun x : ℝ => a + b * Real.exp (-x)) (b * (Real.exp (-s) * -1)) s :=
+ ((hasDerivAt_neg' (x := s)).exp.const_mul b).const_add a
+ have h2 := (h1.log hpos.ne').neg
+ exact h2.congr_deriv (by ring)
+
+/-- Second derivative: `d/ds (b e^{-s} / (a + b e^{-s})) = -a b e^{-s} / (a + b e^{-s})^2`. -/
+theorem cc_hasDerivAt_ratio {a b : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (hab : 0 < a + b) (s : ℝ) :
+ HasDerivAt (fun x => b * Real.exp (-x) / (a + b * Real.exp (-x)))
+ (-(a * b * Real.exp (-s)) / (a + b * Real.exp (-s)) ^ 2) s := by
+ have hpos := cc_affineExp_pos ha hb hab s
+ have hnum : HasDerivAt (fun x : ℝ => b * Real.exp (-x)) (b * (Real.exp (-s) * -1)) s :=
+ (hasDerivAt_neg' (x := s)).exp.const_mul b
+ have hden : HasDerivAt (fun x : ℝ => a + b * Real.exp (-x)) (b * (Real.exp (-s) * -1)) s :=
+ hnum.const_add a
+ have h := hnum.div hden hpos.ne'
+ exact h.congr_deriv (by ring)
+
+/-- Display (F5), one variable: `s ↦ -log(a + b exp(-s))` is concave on `[0, 1]` for
+`a, b ≥ 0`, `a + b > 0` (`concaveOn_of_deriv2_nonpos`). -/
+theorem cc_concaveOn_negLog {a b : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (hab : 0 < a + b) :
+ ConcaveOn ℝ (Set.Icc (0 : ℝ) 1) (fun s => -Real.log (a + b * Real.exp (-s))) := by
+ have hd1 := cc_hasDerivAt_negLog ha hb hab
+ have hd2 := cc_hasDerivAt_ratio ha hb hab
+ have hderiv : deriv (fun s => -Real.log (a + b * Real.exp (-s)))
+ = fun s => b * Real.exp (-s) / (a + b * Real.exp (-s)) := by
+ funext s
+ exact (hd1 s).deriv
+ refine concaveOn_of_deriv2_nonpos (convex_Icc 0 1) ?_ ?_ ?_ ?_
+ · exact fun s _ => (hd1 s).continuousAt.continuousWithinAt
+ · exact fun s _ => (hd1 s).differentiableAt.differentiableWithinAt
+ · rw [hderiv]
+ exact fun s _ => (hd2 s).differentiableAt.differentiableWithinAt
+ · intro s _
+ show deriv (deriv (fun s => -Real.log (a + b * Real.exp (-s)))) s ≤ 0
+ rw [hderiv, (hd2 s).deriv]
+ apply div_nonpos_of_nonpos_of_nonneg
+ · have : 0 ≤ a * b * Real.exp (-s) := mul_nonneg (mul_nonneg ha hb) (Real.exp_pos _).le
+ linarith
+ · exact sq_nonneg _
+
+/-! ### Assembly of (F5) -/
+
+/-- `F_A(t[i := s])` is `-log mu(A)` at `p(t)` with coordinate `i` replaced by `1 - exp(-s)`. -/
+theorem cc_hazardCoord_update_eq {Y : Type} [Fintype Y] [DecidableEq Y]
+ (A : Finset (Finset Y)) (t : Y → ℝ) (i : Y) (s : ℝ) :
+ hazardCoord A (Function.update t i s) =
+ -Real.log (muOf A (Function.update (fun j => 1 - Real.exp (-t j)) i
+ (1 - Real.exp (-s)))) := by
+ unfold hazardCoord
+ have h : (fun j => 1 - Real.exp (-(Function.update t i s j)))
+ = Function.update (fun j => 1 - Real.exp (-t j)) i (1 - Real.exp (-s)) := by
+ funext j
+ by_cases hj : j = i
+ · subst hj
+ simp
+ · rw [Function.update_of_ne hj, Function.update_of_ne hj]
+ rw [h]
+
+/-- Display (F5) on a general finite ground type: for a downset containing `∅` and `t` in the
+cube, `s ↦ F_A(t[i := s])` is concave on `[0, 1]`. -/
+theorem cc_concaveOn_hazardCoord_update {Y : Type} [Fintype Y] [DecidableEq Y]
+ {A : Finset (Finset Y)} (h0 : ∅ ∈ A) (hdown : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A)
+ (i : Y) (t : Y → ℝ) (ht : ∀ j, 0 ≤ t j ∧ t j ≤ 1) :
+ ConcaveOn ℝ (Set.Icc (0 : ℝ) 1) (fun s : ℝ => hazardCoord A (Function.update t i s)) := by
+ obtain ⟨p, hp_def⟩ : ∃ p : Y → ℝ, p = fun j => 1 - Real.exp (-t j) := ⟨_, rfl⟩
+ have hp : ∀ v, 0 ≤ p v ∧ p v < 1 := by
+ intro v
+ rw [hp_def]
+ show 0 ≤ 1 - Real.exp (-t v) ∧ 1 - Real.exp (-t v) < 1
+ have h1 := (ht v).1
+ have he : Real.exp (-t v) ≤ 1 := by
+ rw [Real.exp_le_one_iff]
+ linarith
+ have he' : 0 < Real.exp (-t v) := Real.exp_pos _
+ constructor <;> linarith
+ have hp1 : ∀ v, 0 ≤ p v ∧ p v ≤ 1 := fun v => ⟨(hp v).1, (hp v).2.le⟩
+ have hle := cc_sum_in_le_sum_out hdown hp1 i
+ have hpos := cc_sum_out_pos h0 hp i
+ have hSin0 : 0 ≤ ∑ U ∈ A.filter (fun U => i ∈ U), cc_wOther p i U :=
+ Finset.sum_nonneg fun U _ => cc_wOther_nonneg hp1 i U
+ have hfun : (fun s : ℝ => hazardCoord A (Function.update t i s)) =
+ fun s => -Real.log ((∑ U ∈ A.filter (fun U => i ∈ U), cc_wOther p i U)
+ + ((∑ U ∈ A.filter (fun U => i ∉ U), cc_wOther p i U)
+ - ∑ U ∈ A.filter (fun U => i ∈ U), cc_wOther p i U) * Real.exp (-s)) := by
+ funext s
+ rw [cc_hazardCoord_update_eq, ← hp_def, cc_muOf_update]
+ rw [show ∀ x Sin Sout : ℝ, (1 - x) * Sin + (1 - (1 - x)) * Sout = Sin + (Sout - Sin) * x
+ from fun x Sin Sout => by ring]
+ rw [hfun]
+ exact cc_concaveOn_negLog hSin0 (sub_nonneg.2 hle) (by linarith)
+
+/-! ## (F6) The hazard product bound `F_A(t) ≥ (prod_i t_i) H_A`
+
+### Elementary bounds on `mu_p(A)` and on the hazard `F_A` -/
+
+/-- `mu_p(A) ≤ 1` for `p` in the cube: `A ⊆ univ.powerset`, the weights are nonnegative
+(`weight_nonneg`) and all of them sum to one (`sum_weight_eq_one`). -/
+theorem f6_muOf_le_one {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))
+ {p : Y → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) : muOf A p ≤ 1 := by
+ unfold muOf
+ rw [← UniversalLaw.Proofs.P15Elementary.Aux.sum_weight_eq_one p]
+ exact Finset.sum_le_sum_of_subset_of_nonneg
+ (fun U _ => Finset.mem_powerset.2 (Finset.subset_univ U))
+ (fun U _ _ => UniversalLaw.Proofs.P15Budget.Aux.weight_nonneg hp U)
+
+/-- `0 ≤ mu_p(A)` for `p` in the cube. -/
+theorem f6_muOf_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))
+ {p : Y → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) : 0 ≤ muOf A p :=
+ Finset.sum_nonneg fun U _ => UniversalLaw.Proofs.P15Budget.Aux.weight_nonneg hp U
+
+/-- `1 - exp(-u) ∈ [0, 1]` for `u ∈ [0, 1]` (indeed for every `u ≥ 0`). -/
+theorem f6_one_sub_exp_neg_mem {u : ℝ} (hu : 0 ≤ u ∧ u ≤ 1) :
+ 0 ≤ 1 - Real.exp (-u) ∧ 1 - Real.exp (-u) ≤ 1 := by
+ constructor
+ · have h : Real.exp (-u) ≤ 1 := Real.exp_le_one_iff.2 (by linarith [hu.1])
+ linarith
+ · have h := Real.exp_pos (-u)
+ linarith
+
+/-- The coordinates `p_j(u) = 1 - exp(-u_j)` lie in the cube when `u` does. -/
+theorem f6_coords_mem {Y : Type} {u : Y → ℝ} (hu : ∀ j, 0 ≤ u j ∧ u j ≤ 1) :
+ ∀ v, 0 ≤ 1 - Real.exp (-u v) ∧ 1 - Real.exp (-u v) ≤ 1 :=
+ fun v => f6_one_sub_exp_neg_mem (hu v)
+
+/-- `0 ≤ F_A(u)` on the cube: `-log m ≥ 0` for `0 ≤ m ≤ 1` (`Real.log_nonpos`; `log 0 = 0`, so
+no positivity of `mu` is needed). -/
+theorem f6_hazardCoord_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))
+ {u : Y → ℝ} (hu : ∀ j, 0 ≤ u j ∧ u j ≤ 1) : 0 ≤ hazardCoord A u := by
+ unfold hazardCoord
+ have hp := f6_coords_mem hu
+ have h := Real.log_nonpos (f6_muOf_nonneg A hp) (f6_muOf_le_one A hp)
+ linarith
+
+/-- `F_A(1, …, 1) = H_A`, since `1 - exp(-1) = p_star`. -/
+theorem f6_hazardCoord_one {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y)) :
+ hazardCoord A (fun _ => (1 : ℝ)) = hazardStar A := by
+ unfold hazardCoord hazardStar pStar
+ rfl
+
+/-! ### The chord inequality and its iteration -/
+
+/-- Chord inequality at one coordinate: if `s ↦ F_A(update u i s)` is concave on `[0, 1]` and
+`u` lies in the cube, then `u_i · F_A(update u i 1) ≤ F_A(u)`. -/
+theorem f6_chord {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y)) (i : Y)
+ (u : Y → ℝ) (hu : ∀ j, 0 ≤ u j ∧ u j ≤ 1)
+ (hconc : ConcaveOn ℝ (Set.Icc (0 : ℝ) 1)
+ (fun s : ℝ => hazardCoord A (Function.update u i s))) :
+ u i * hazardCoord A (Function.update u i 1) ≤ hazardCoord A u := by
+ have h0 : (0 : ℝ) ∈ Set.Icc (0 : ℝ) 1 := Set.left_mem_Icc.2 zero_le_one
+ have h1 : (1 : ℝ) ∈ Set.Icc (0 : ℝ) 1 := Set.right_mem_Icc.2 zero_le_one
+ have hs := hu i
+ have hc := hconc.2 h0 h1 (by linarith [hs.2] : (0 : ℝ) ≤ 1 - u i) hs.1 (by ring)
+ simp only [smul_eq_mul, mul_zero, zero_add, mul_one, Function.update_eq_self] at hc
+ have hf0 : 0 ≤ hazardCoord A (Function.update u i 0) := by
+ apply f6_hazardCoord_nonneg
+ intro j
+ rcases eq_or_ne j i with rfl | hj
+ · simp
+ · rw [Function.update_of_ne hj]
+ exact hu j
+ have hprod := mul_nonneg (sub_nonneg.2 hs.2) hf0
+ linarith
+
+/-- The vector `u_s` which equals `1` on `s` and `t` elsewhere lies in the cube when `t` does. -/
+theorem f6_raised_mem {Y : Type} [DecidableEq Y] {t : Y → ℝ} (ht : ∀ j, 0 ≤ t j ∧ t j ≤ 1)
+ (s : Finset Y) :
+ ∀ j, 0 ≤ (if j ∈ s then (1 : ℝ) else t j) ∧ (if j ∈ s then (1 : ℝ) else t j) ≤ 1 := by
+ intro j
+ split_ifs
+ · exact ⟨zero_le_one, le_refl 1⟩
+ · exact ht j
+
+/-- Raising one more coordinate: `u_{insert a s} = update u_s a 1`. -/
+theorem f6_raised_insert {Y : Type} [DecidableEq Y] (t : Y → ℝ) (a : Y) (s : Finset Y) :
+ (fun j => if j ∈ insert a s then (1 : ℝ) else t j) =
+ Function.update (fun j => if j ∈ s then (1 : ℝ) else t j) a 1 := by
+ funext j
+ by_cases hj : j = a
+ · subst hj
+ simp
+ · simp [Finset.mem_insert, hj]
+
+/-- Iterated chord inequality: for every finite set `s` of coordinates,
+`(prod_{j ∈ s} t_j) · F_A(u_s) ≤ F_A(t)`, where `u_s` is `t` with the coordinates in `s` raised
+to `1`. Induction over `s` (`Finset.induction_on`) with `f6_chord` at each step. -/
+theorem f6_prod_hazardCoord_le {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))
+ (hconc : ∀ (i : Y) (u : Y → ℝ), (∀ j, 0 ≤ u j ∧ u j ≤ 1) →
+ ConcaveOn ℝ (Set.Icc (0 : ℝ) 1) (fun s : ℝ => hazardCoord A (Function.update u i s)))
+ (t : Y → ℝ) (ht : ∀ j, 0 ≤ t j ∧ t j ≤ 1) (s : Finset Y) :
+ (∏ j ∈ s, t j) * hazardCoord A (fun j => if j ∈ s then (1 : ℝ) else t j) ≤
+ hazardCoord A t := by
+ induction s using Finset.induction_on with
+ | empty => simp
+ | insert a s ha ih =>
+ have hus := f6_raised_mem ht s
+ have hchord := f6_chord A a (fun j => if j ∈ s then (1 : ℝ) else t j) hus (hconc a _ hus)
+ simp only [ite_eq_right ha] at hchord
+ have hprod : 0 ≤ ∏ j ∈ s, t j := Finset.prod_nonneg fun j _ => (ht j).1
+ rw [Finset.prod_insert ha, f6_raised_insert t a s]
+ calc t a * (∏ j ∈ s, t j) *
+ hazardCoord A (Function.update (fun j => if j ∈ s then (1 : ℝ) else t j) a 1)
+ = (∏ j ∈ s, t j) *
+ (t a * hazardCoord A (Function.update (fun j => if j ∈ s then (1 : ℝ) else t j) a 1)) := by
+ ring
+ _ ≤ (∏ j ∈ s, t j) * hazardCoord A (fun j => if j ∈ s then (1 : ℝ) else t j) :=
+ mul_le_mul_of_nonneg_left hchord hprod
+ _ ≤ hazardCoord A t := ih
+
+/-- Display (F6) from display (F5): assuming `CoordinatewiseConcavity`, the hazard product bound
+holds. Takes `s = univ` in `f6_prod_hazardCoord_le`, where `u_univ = (1, …, 1)` and
+`F_A(1, …, 1) = H_A` (`f6_hazardCoord_one`). -/
+theorem f6_hazardProductBound_of_concavity (h5 : UniversalLaw.Spec.P15.CoordinatewiseConcavity) :
+ UniversalLaw.Spec.P15.HazardProductBound := by
+ intro n A hn hA t ht
+ have hconc : ∀ (i : Fin n) (u : Fin n → ℝ), (∀ j, 0 ≤ u j ∧ u j ≤ 1) →
+ ConcaveOn ℝ (Set.Icc (0 : ℝ) 1) (fun s : ℝ => hazardCoord A (Function.update u i s)) :=
+ fun i u hu => h5 n A hn hA i u hu
+ have key := f6_prod_hazardCoord_le A hconc t ht (univ : Finset (Fin n))
+ have hfun : (fun j : Fin n => if j ∈ (univ : Finset (Fin n)) then (1 : ℝ) else t j) =
+ fun _ => (1 : ℝ) := by
+ funext j
+ simp
+ rw [hfun, f6_hazardCoord_one] at key
+ exact key
+
+/-! ## (F7) The hazard `phi` bound `-log mu_p(A) ≥ H_A prod_i phi(p_i)`
+
+### (a) The transformed price `phi` maps `[0,1]` into `[0,1]` -/
+
+/-- `0 ≤ phi x` for `x ≥ 0`: when `x < 1`, `-log(1 - x) ≥ 0` since `0 < 1 - x ≤ 1`. -/
+theorem f7_phi_nonneg {x : ℝ} (hx : 0 ≤ x) : 0 ≤ phi x := by
+ unfold phi
+ split_ifs with h
+ · refine le_min zero_le_one ?_
+ have hlog : Real.log (1 - x) ≤ 0 := Real.log_nonpos (by linarith) (by linarith)
+ linarith
+ · exact zero_le_one
+
+/-- `phi x ≤ 1` for every real `x`. -/
+theorem f7_phi_le_one (x : ℝ) : phi x ≤ 1 := by
+ unfold phi
+ split_ifs with h
+ · exact min_le_left _ _
+ · exact le_refl 1
+
+/-- `phi` maps `[0,1]` into `[0,1]`. -/
+theorem f7_phi_mem {x : ℝ} (hx : 0 ≤ x ∧ x ≤ 1) : 0 ≤ phi x ∧ phi x ≤ 1 :=
+ ⟨f7_phi_nonneg hx.1, f7_phi_le_one x⟩
+
+/-! ### (b) `p' = 1 - exp(-phi p)` lies in `[0, p]` -/
+
+/-- `0 ≤ 1 - exp(-phi x)` for `x ≥ 0` (since `phi x ≥ 0`). -/
+theorem f7_one_sub_exp_neg_phi_nonneg {x : ℝ} (hx : 0 ≤ x) : 0 ≤ 1 - Real.exp (-phi x) := by
+ have h : Real.exp (-phi x) ≤ 1 := Real.exp_le_one_iff.2 (by linarith [f7_phi_nonneg hx])
+ linarith
+
+/-- `1 - exp(-phi x) ≤ x` on `[0,1]`: for `x < 1`, `phi x ≤ -log(1 - x)` so
+`exp(-phi x) ≥ exp(log(1 - x)) = 1 - x`; for `x = 1`, `1 - exp(-1) ≤ 1`. -/
+theorem f7_one_sub_exp_neg_phi_le {x : ℝ} (hx : 0 ≤ x ∧ x ≤ 1) :
+ 1 - Real.exp (-phi x) ≤ x := by
+ by_cases h : x < 1
+ · have hphi : phi x ≤ -Real.log (1 - x) := by
+ unfold phi
+ rw [ite_eq_left h]
+ exact min_le_right _ _
+ have hpos : 0 < 1 - x := by linarith
+ have h1 : Real.exp (Real.log (1 - x)) ≤ Real.exp (-phi x) :=
+ Real.exp_le_exp.2 (by linarith)
+ rw [Real.exp_log hpos] at h1
+ linarith
+ · have hx1 : x = 1 := le_antisymm hx.2 (not_lt.1 h)
+ have hphi : phi x = 1 := by
+ unfold phi
+ rw [ite_eq_right h]
+ rw [hphi, hx1]
+ have := Real.exp_pos (-1 : ℝ)
+ linarith
+
+/-! ### (c) Antitonicity of `mu_p(A)` in the probability vector (from the split (F4)) -/
+
+/-- The interpolating vector `r_s` (`q` on `s`, `p` elsewhere) lies in the cube when both do. -/
+theorem f7_mix_mem {Y : Type} [DecidableEq Y] {p q : Y → ℝ} (hp : ∀ j, 0 ≤ p j ∧ p j ≤ 1)
+ (hq : ∀ j, 0 ≤ q j ∧ q j ≤ 1) (s : Finset Y) :
+ ∀ j, 0 ≤ (if j ∈ s then q j else p j) ∧ (if j ∈ s then q j else p j) ≤ 1 := by
+ intro j
+ split_ifs
+ · exact hq j
+ · exact hp j
+
+/-- Switching one more coordinate to `q`: `r_{insert a s} = update r_s a (q a)`. -/
+theorem f7_mix_insert {Y : Type} [DecidableEq Y] (p q : Y → ℝ) (a : Y) (s : Finset Y) :
+ (fun j => if j ∈ insert a s then q j else p j) =
+ Function.update (fun j => if j ∈ s then q j else p j) a (q a) := by
+ funext j
+ by_cases hj : j = a
+ · subst hj
+ simp
+ · simp [Finset.mem_insert, hj]
+
+/-- For `a ∉ s`, `r_s` is its own update at `a` by `p a`. -/
+theorem f7_mix_eq_update_self {Y : Type} [DecidableEq Y] (p q : Y → ℝ) (a : Y) (s : Finset Y)
+ (ha : a ∉ s) :
+ (fun j => if j ∈ s then q j else p j) =
+ Function.update (fun j => if j ∈ s then q j else p j) a (p a) := by
+ funext j
+ by_cases hj : j = a
+ · subst hj
+ simp [ha]
+ · simp [hj]
+
+/-- Moving from `p` down to `q` one coordinate at a time: for every finite set `s` of
+coordinates, `mu_p(A) ≤ mu_(r_s)(A)` (induction over `s`, `cc_muOf_update_antitone` at each
+step). -/
+theorem f7_muOf_le_mix {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}
+ (hA : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A) {p q : Y → ℝ}
+ (hp : ∀ j, 0 ≤ p j ∧ p j ≤ 1) (hq : ∀ j, 0 ≤ q j ∧ q j ≤ 1) (hqp : ∀ j, q j ≤ p j)
+ (s : Finset Y) :
+ muOf A p ≤ muOf A (fun j => if j ∈ s then q j else p j) := by
+ induction s using Finset.induction_on with
+ | empty => simp
+ | insert a s ha ih =>
+ have hmem := f7_mix_mem hp hq s
+ have hstep := cc_muOf_update_antitone hA hmem a (hqp a)
+ rw [← f7_mix_eq_update_self p q a s ha] at hstep
+ rw [f7_mix_insert p q a s]
+ exact ih.trans hstep
+
+/-- Antitonicity of `mu(A)` in the probability vector for a downset: `q ≤ p` pointwise, both in
+the cube, gives `mu_p(A) ≤ mu_q(A)`. -/
+theorem f7_muOf_antitone {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}
+ (hA : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A) {p q : Y → ℝ}
+ (hp : ∀ j, 0 ≤ p j ∧ p j ≤ 1) (hq : ∀ j, 0 ≤ q j ∧ q j ≤ 1) (hqp : ∀ j, q j ≤ p j) :
+ muOf A p ≤ muOf A q := by
+ have h := f7_muOf_le_mix hA hp hq hqp (univ : Finset Y)
+ have hfun : (fun j : Y => if j ∈ (univ : Finset Y) then q j else p j) = q := by
+ funext j
+ simp
+ rw [hfun] at h
+ exact h
+
+/-! ### (d) Display (F7) from display (F6) -/
+
+/-- Display (F7) from display (F6): assuming `HazardProductBound`, the hazard `phi` bound holds.
+With `t_i := phi(p_i) ∈ [0,1]` and `p'_i := 1 - exp(-t_i) ∈ [0, p_i]`, antitonicity gives
+`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`. -/
+theorem f7_hazardPhiBound_of_productBound (h6 : UniversalLaw.Spec.P15.HazardProductBound) :
+ UniversalLaw.Spec.P15.HazardPhiBound := by
+ intro n A hn hA p hp hpos
+ have hdown : ∀ U ∈ A, ∀ V : Finset (Fin n), V ⊆ U → V ∈ A := hA.2.2
+ have ht : ∀ j, 0 ≤ phi (p j) ∧ phi (p j) ≤ 1 := fun j => f7_phi_mem (hp j)
+ have hp' : ∀ j, 0 ≤ 1 - Real.exp (-phi (p j)) ∧ 1 - Real.exp (-phi (p j)) ≤ 1 :=
+ fun j => ⟨f7_one_sub_exp_neg_phi_nonneg (hp j).1,
+ (f7_one_sub_exp_neg_phi_le (hp j)).trans (hp j).2⟩
+ have hle : muOf A p ≤ muOf A (fun j => 1 - Real.exp (-phi (p j))) :=
+ f7_muOf_antitone hdown hp hp' (fun j => f7_one_sub_exp_neg_phi_le (hp j))
+ have hlog : -Real.log (muOf A (fun j => 1 - Real.exp (-phi (p j)))) ≤ -Real.log (muOf A p) :=
+ neg_le_neg (Real.log_le_log hpos hle)
+ have h6' := h6 n A hn hA (fun j => phi (p j)) ht
+ have hcoord : hazardCoord A (fun j => phi (p j)) =
+ -Real.log (muOf A (fun j => 1 - Real.exp (-phi (p j)))) := rfl
+ rw [hcoord] at h6'
+ calc hazardStar A * ∏ i, phi (p i) = (∏ i, phi (p i)) * hazardStar A := mul_comm _ _
+ _ ≤ -Real.log (muOf A (fun j => 1 - Real.exp (-phi (p j)))) := h6'
+ _ ≤ -Real.log (muOf A p) := hlog
+
+/-! ## (F8) The full-ground price bound -/
+
+/-- `prod_i phi(p_i) ≤ 1` for `p ∈ [0, 1]^n`, from `0 ≤ phi ≤ 1` on `[0, 1]`
+(`Finset.prod_le_one₀`). -/
+theorem f8_prod_phi_le_one {n : ℕ} (p : Fin n → ℝ) (hp : ∀ j, 0 ≤ p j ∧ p j ≤ 1) :
+ ∏ i, phi (p i) ≤ 1 :=
+ Finset.prod_le_one₀ (fun i _ => f7_phi_nonneg (hp i).1) (fun i _ => f7_phi_le_one (p i))
+
+/-- `prod_i c_i ≤ prod_i phi(p_i)` for `0 ≤ c_i ≤ phi(p_i)` (`Finset.prod_le_prod₀`). -/
+theorem f8_prod_le_prod_phi {n : ℕ} (p c : Fin n → ℝ) (hc : ∀ j, 0 ≤ c j ∧ c j ≤ phi (p j)) :
+ ∏ i, c i ≤ ∏ i, phi (p i) :=
+ Finset.prod_le_prod₀ (fun i _ => (hc i).1) (fun i _ => (hc i).2)
+
+/-- Display (F8) from display (F7): given `HazardPhiBound`, the full-ground price bound holds.
+Fix `n`, a proper downset `A` on `Fin n`, `p ∈ [0, 1]^n` and `0 ≤ c ≤ phi ∘ p`. The cap `1` is
+`f8_prod_le_prod_phi` and `f8_prod_phi_le_one`; when `0 < mu_p(A)`, (F7) gives
+`H_A prod_i phi(p_i) ≤ -log mu_p(A)` and `0 < H_A` (`P15Elementary.hazardStarPositive`), so
+`prod_i phi(p_i) = H_A⁻¹ (H_A prod_i phi(p_i)) ≤ H_A⁻¹ [-log mu_p(A)]` (`inv_mul_cancel_left₀`,
+`mul_le_mul_of_nonneg_left`); `P15Budget.Aux.le_cappedHazard_of` reaches the capped hazard. -/
+theorem f8_fullGroundPriceBound_of_phiBound (h7 : UniversalLaw.Spec.P15.HazardPhiBound) :
+ UniversalLaw.Spec.P15.FullGroundPriceBound := by
+ intro n A hn hA p c hp hc
+ have hprod : ∏ i, c i ≤ ∏ i, phi (p i) := f8_prod_le_prod_phi p c hc
+ have hphi1 : ∏ i, phi (p i) ≤ 1 := f8_prod_phi_le_one p hp
+ refine UniversalLaw.Proofs.P15Budget.Aux.le_cappedHazard_of (hprod.trans hphi1) fun hm => ?_
+ have hH : 0 < hazardStar A := UniversalLaw.Proofs.P15Elementary.hazardStarPositive n A hn hA
+ have hne : hazardStar A ≠ 0 := hH.ne'
+ have h7' : hazardStar A * ∏ i, phi (p i) ≤ -Real.log (muOf A p) := h7 n A hn hA p hp hm
+ calc ∏ i, c i ≤ ∏ i, phi (p i) := hprod
+ _ = (hazardStar A)⁻¹ * (hazardStar A * ∏ i, phi (p i)) :=
+ (inv_mul_cancel_left₀ hne _).symm
+ _ ≤ (hazardStar A)⁻¹ * -Real.log (muOf A p) :=
+ mul_le_mul_of_nonneg_left h7' (inv_nonneg.mpr hH.le)
+ _ = 1 / hazardStar A * -Real.log (muOf A p) := by rw [one_div]
+
+/-! ## (F8), exactness remark: the full-ground budget equivalence -/
+
+/-- `0 ≤ prod_i phi(p_i)` for `p ∈ [0, 1]^n` (`Finset.prod_nonneg`). -/
+theorem bi_prod_phi_nonneg {n : ℕ} (p : Fin n → ℝ) (hp : ∀ j, 0 ≤ p j ∧ p j ≤ 1) :
+ 0 ≤ ∏ i, phi (p i) :=
+ Finset.prod_nonneg fun i _ => f7_phi_nonneg (hp i).1
+
+/-- The (⇐) direction, display (F8) with `rho = 1`: given display (F7) and `1 ≤ H_A`, every
+`p ∈ [0, 1]^n` and `0 ≤ c ≤ phi ∘ p` satisfy `prod_i c_i ≤ cappedHazard 1 (mu_p(A))`. The cap
+`1` is `f8_prod_le_prod_phi` and `f8_prod_phi_le_one`; when `0 < mu_p(A)`,
+`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)`
+and `1 ≤ H_A`) and `H_A prod_i phi(p_i) ≤ -log mu_p(A)` by (F7);
+`P15Budget.Aux.le_cappedHazard_of` reaches the capped hazard. -/
+theorem bi_budget_of_one_le_hazardStar (h7 : UniversalLaw.Spec.P15.HazardPhiBound) {n : ℕ}
+ {A : Finset (Finset (Fin n))} (hn : 1 ≤ n) (hA : IsProperDownset A)
+ (h1 : 1 ≤ hazardStar A) (p c : Fin n → ℝ) (hp : ∀ j, 0 ≤ p j ∧ p j ≤ 1)
+ (hc : ∀ j, 0 ≤ c j ∧ c j ≤ phi (p j)) :
+ ∏ i, c i ≤ cappedHazard 1 (muOf A p) := by
+ have hprod : ∏ i, c i ≤ ∏ i, phi (p i) := f8_prod_le_prod_phi p c hc
+ have hphi1 : ∏ i, phi (p i) ≤ 1 := f8_prod_phi_le_one p hp
+ refine UniversalLaw.Proofs.P15Budget.Aux.le_cappedHazard_of (hprod.trans hphi1) fun hm => ?_
+ have hphi0 : 0 ≤ ∏ i, phi (p i) := bi_prod_phi_nonneg p hp
+ have h7' : hazardStar A * ∏ i, phi (p i) ≤ -Real.log (muOf A p) := h7 n A hn hA p hp hm
+ calc ∏ i, c i ≤ ∏ i, phi (p i) := hprod
+ _ ≤ hazardStar A * ∏ i, phi (p i) := le_mul_of_one_le_left hphi0 h1
+ _ ≤ -Real.log (muOf A p) := h7'
+ _ = 1 * -Real.log (muOf A p) := (one_mul _).symm
+
+/-- `0 < mu_{p_star}(A)` for a proper downset `A`: every weight at the constant vector
+`p_star ∈ (0, 1)` is nonnegative (`P15Budget.Aux.weight_nonneg`), and the member `∅ ∈ A`
+contributes `prod_{v} (1 - p_star) > 0` (`Finset.prod_pos`), so `Finset.single_le_sum` gives
+the claim. -/
+theorem bi_muOf_pStar_pos {n : ℕ} {A : Finset (Finset (Fin n))} (hA : IsProperDownset A) :
+ 0 < muOf A (fun _ => pStar) := by
+ have hp0 : 0 < pStar := UniversalLaw.Proofs.P15Elementary.Aux.pStar_pos
+ have hp1 : pStar < 1 := UniversalLaw.Proofs.P15Elementary.Aux.pStar_lt_one
+ have hw_nonneg : ∀ U : Finset (Fin n), 0 ≤ weight (fun _ : Fin n => pStar) U :=
+ fun U => UniversalLaw.Proofs.P15Budget.Aux.weight_nonneg (fun _ => ⟨hp0.le, hp1.le⟩) U
+ have hempty_w : 0 < weight (fun _ : Fin n => pStar) (∅ : Finset (Fin n)) := by
+ unfold weight
+ rw [prod_empty, one_mul]
+ exact Finset.prod_pos fun v _ => by
+ show (0 : ℝ) < 1 - pStar
+ linarith
+ unfold muOf
+ exact lt_of_lt_of_le hempty_w (Finset.single_le_sum (fun U _ => hw_nonneg U) hA.1)
+
+/-- The (⇒) direction: if every `p ∈ [0, 1]^n` and `0 ≤ c ≤ phi ∘ p` satisfy
+`prod_i c_i ≤ cappedHazard 1 (mu_p(A))`, then `1 ≤ H_A`. Instantiate at `p ≡ p_star`, `c ≡ 1`,
+admissible since `0 ≤ p_star ≤ 1` and `phi p_star = 1` (`P15Elementary.phiAtPStar`); then
+`prod_i 1 = 1` (`Finset.prod_const_one`), `0 < mu_{p_star}(A)` (`bi_muOf_pStar_pos`) selects
+the branch `min 1 (1 * -log mu_{p_star}(A))` of `cappedHazard`, and `le_min_iff` extracts
+`1 ≤ -log mu_{p_star}(A)`, which is `hazardStar A` by definition. -/
+theorem bi_one_le_hazardStar_of_budget {n : ℕ} {A : Finset (Finset (Fin n))}
+ (hA : IsProperDownset A)
+ (hall : ∀ (p c : Fin n → ℝ), (∀ j, 0 ≤ p j ∧ p j ≤ 1) → (∀ j, 0 ≤ c j ∧ c j ≤ phi (p j)) →
+ ∏ i, c i ≤ cappedHazard 1 (muOf A p)) :
+ 1 ≤ hazardStar A := by
+ have hp0 : 0 < pStar := UniversalLaw.Proofs.P15Elementary.Aux.pStar_pos
+ have hp1 : pStar < 1 := UniversalLaw.Proofs.P15Elementary.Aux.pStar_lt_one
+ have hphi : phi pStar = 1 := UniversalLaw.Proofs.P15Elementary.phiAtPStar
+ have hp : ∀ j : Fin n, 0 ≤ (fun _ : Fin n => pStar) j ∧ (fun _ : Fin n => pStar) j ≤ 1 :=
+ fun _ => ⟨hp0.le, hp1.le⟩
+ have hc : ∀ j : Fin n, 0 ≤ (fun _ : Fin n => (1 : ℝ)) j ∧
+ (fun _ : Fin n => (1 : ℝ)) j ≤ phi ((fun _ : Fin n => pStar) j) :=
+ fun _ => ⟨zero_le_one, hphi.symm.le⟩
+ have h := hall (fun _ => pStar) (fun _ => (1 : ℝ)) hp hc
+ simp only [Finset.prod_const_one] at h
+ have hm : 0 < muOf A (fun _ => pStar) := bi_muOf_pStar_pos hA
+ unfold cappedHazard at h
+ simp only [hm, ↓reduceIte, one_mul] at h
+ unfold hazardStar
+ exact (le_min_iff.1 h).2
+
+/-- The budget equivalence from display (F7): given `HazardPhiBound`, for `n ≥ 1` and a proper
+downset `A` on `Fin n`, the universal capped budget at `rho = 1` holds iff `1 ≤ H_A`. The two
+directions are `bi_one_le_hazardStar_of_budget` and `bi_budget_of_one_le_hazardStar`. -/
+theorem bi_fullGroundBudgetIff_of_phiBound (h7 : UniversalLaw.Spec.P15.HazardPhiBound) :
+ UniversalLaw.Spec.P15.FullGroundBudgetIff := by
+ intro n A hn hA
+ constructor
+ · intro hall
+ exact bi_one_le_hazardStar_of_budget hA hall
+ · intro h1 p c hp hc
+ exact bi_budget_of_one_le_hazardStar h7 hn hA h1 p c hp hc
+
+/-! ## (F12) The local price bound
+
+### Elementary facts -/
+
+/-- The capacity family `{T ⊆ Fin n : |T| ≤ a}` is a proper downset when `a < n`: it contains
+the empty set, misses `univ` (of size `n > a`), and is closed under taking subsets. -/
+theorem lp_capacityFamily_properDownset (n a : ℕ) (h : a < n) :
+ IsProperDownset (capacityFamily n a) := by
+ refine ⟨?_, ?_, ?_⟩
+ · show ∅ ∈ (univ : Finset (Fin n)).powerset.filter (fun U => U.card ≤ a)
+ rw [mem_filter, mem_powerset, card_empty]
+ exact ⟨empty_subset _, Nat.zero_le _⟩
+ · intro huniv
+ have hcard : (univ : Finset (Fin n)).card ≤ a := (mem_filter.mp huniv).2
+ rw [card_univ, Fintype.card_fin] at hcard
+ exact absurd hcard (not_le.mpr h)
+ · intro U hU V hVU
+ have hU' : U.card ≤ a := (mem_filter.mp hU).2
+ exact mem_filter.mpr ⟨mem_powerset.mpr (subset_univ V), le_trans (card_le_card hVU) hU'⟩
+
+/-! ### Enumerating a finite set by `Fin (card)` -/
+
+/-- Every `B : Finset X` is enumerated injectively by `Fin B.card`, with range exactly `B`. -/
+theorem lp_exists_enum {X : Type} (B : Finset X) :
+ ∃ e : Fin B.card → X, Function.Injective e ∧ ∀ v, v ∈ B ↔ ∃ k, e k = v := by
+ refine ⟨fun k => (B.equivFin.symm k).1, ?_, ?_⟩
+ · intro k₁ k₂ h
+ exact B.equivFin.symm.injective (Subtype.ext h)
+ · intro v
+ constructor
+ · intro hv
+ exact ⟨B.equivFin ⟨v, hv⟩, by simp⟩
+ · rintro ⟨k, rfl⟩
+ exact (B.equivFin.symm k).2
+
+/-- An injection `e : Fin n → X` with range `B` maps `univ` onto `B`. -/
+theorem lp_map_univ_eq {X : Type} {B : Finset X} {n : ℕ} (e : Fin n → X)
+ (he : Function.Injective e) (hrange : ∀ v, v ∈ B ↔ ∃ k, e k = v) :
+ (univ : Finset (Fin n)).map ⟨e, he⟩ = B := by
+ ext v
+ rw [hrange v]
+ simp only [mem_map, mem_univ, true_and, Function.Embedding.coeFn_mk]
+
+/-- Products over `B` are products over `Fin n` along the enumeration. -/
+theorem lp_prod_univ_eq {X : Type} {B : Finset X} {n : ℕ} (e : Fin n → X)
+ (he : Function.Injective e) (hrange : ∀ v, v ∈ B ↔ ∃ k, e k = v) (f : X → ℝ) :
+ ∏ k, f (e k) = ∏ v ∈ B, f v := by
+ rw [← lp_map_univ_eq e he hrange, Finset.prod_map]
+ rfl
+
+/-- For `S ⊆ B`, the image of the preimage `{k : e k ∈ S}` is `S`. -/
+theorem lp_map_filter_eq {X : Type} [DecidableEq X] {B : Finset X} {n : ℕ} (e : Fin n → X)
+ (he : Function.Injective e) (hrange : ∀ v, v ∈ B ↔ ∃ k, e k = v) {S : Finset X}
+ (hS : S ⊆ B) :
+ ((univ : Finset (Fin n)).filter (fun k => e k ∈ S)).map ⟨e, he⟩ = S := by
+ ext v
+ simp only [mem_map, mem_filter, mem_univ, true_and, Function.Embedding.coeFn_mk]
+ constructor
+ · rintro ⟨k, hk, rfl⟩
+ exact hk
+ · intro hv
+ obtain ⟨k, rfl⟩ := (hrange v).mp (hS hv)
+ exact ⟨k, hv, rfl⟩
+
+/-- The preimage of the image of `T` is `T` (injectivity of the enumeration). -/
+theorem lp_filter_map_eq {X : Type} [DecidableEq X] {n : ℕ} (e : Fin n → X)
+ (he : Function.Injective e) (T : Finset (Fin n)) :
+ (univ : Finset (Fin n)).filter (fun k => e k ∈ T.map ⟨e, he⟩) = T := by
+ ext k
+ simp only [mem_filter, mem_univ, true_and, mem_map, Function.Embedding.coeFn_mk]
+ constructor
+ · rintro ⟨a, ha, hak⟩
+ rwa [he hak] at ha
+ · intro hk
+ exact ⟨k, hk, rfl⟩
+
+/-! ### Transport of the local good probability to the capacity family -/
+
+/-- Along an enumeration `e : Fin n → X` of the block `X_i`, the local good probability
+`mu_p(D_i)` is the product measure of the capacity family `{T : |T| ≤ a_i}` on `Fin n` under
+the transported vector `p ∘ e`. Uses `LocalRestriction` (a block subset is good iff its size is
+at most `a_i`) and the bijection `T ↦ T.map e` between subsets of `Fin n` and subsets of the
+block, which preserves size and matches the two weight products. -/
+theorem lp_localGood_eq_muOf {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}
+ (hF : IsRealizedFamily F) (p : X → ℝ) (i : Fin F.b) {n : ℕ} (e : Fin n → X)
+ (he : Function.Injective e) (hrange : ∀ v, v ∈ block F i ↔ ∃ k, e k = v) :
+ localGood F p i = muOf (capacityFamily n (F.a i)) (fun k => p (e k)) := by
+ have hLR := UniversalLaw.Proofs.P15Covers.localRestriction F hF i
+ have hmapuniv := lp_map_univ_eq e he hrange
+ have hind : ∀ S ∈ (block F i).powerset,
+ Set.indicator (downset F)
+ (fun S => (∏ v ∈ S, p v) * ∏ v ∈ block F i \ S, (1 - p v)) S =
+ if S.card ≤ F.a i then (∏ v ∈ S, p v) * ∏ v ∈ block F i \ S, (1 - p v) else 0 := by
+ intro S hS
+ have hgood : S ∈ downset F ↔ S.card ≤ F.a i := by
+ show IsGood F S ↔ S.card ≤ F.a i
+ exact hLR S (mem_powerset.mp hS)
+ by_cases h : S.card ≤ F.a i
+ · rw [Set.indicator_of_mem (hgood.mpr h), ite_eq_left h]
+ · rw [Set.indicator_of_notMem (fun h' => h (hgood.mp h')), ite_eq_right h]
+ unfold localGood
+ rw [Finset.sum_congr rfl hind, ← Finset.sum_filter]
+ unfold muOf capacityFamily
+ symm
+ refine Finset.sum_nbij' (fun T => T.map ⟨e, he⟩)
+ (fun S => (univ : Finset (Fin n)).filter (fun k => e k ∈ S)) ?_ ?_ ?_ ?_ ?_
+ · intro T hT
+ rw [mem_filter, mem_powerset] at hT
+ rw [mem_filter, mem_powerset]
+ refine ⟨?_, ?_⟩
+ · rw [← hmapuniv]
+ exact map_subset_map.mpr hT.1
+ · rw [card_map]
+ exact hT.2
+ · intro S hS
+ rw [mem_filter, mem_powerset] at hS
+ rw [mem_filter, mem_powerset]
+ refine ⟨subset_univ _, ?_⟩
+ rw [← card_map ⟨e, he⟩, lp_map_filter_eq e he hrange hS.1]
+ exact hS.2
+ · intro T _
+ exact lp_filter_map_eq e he T
+ · intro S hS
+ rw [mem_filter, mem_powerset] at hS
+ exact lp_map_filter_eq e he hrange hS.1
+ · intro T _
+ show weight (fun k => p (e k)) T =
+ (∏ v ∈ T.map ⟨e, he⟩, p v) * ∏ v ∈ block F i \ T.map ⟨e, he⟩, (1 - p v)
+ unfold weight
+ rw [Finset.prod_map, ← hmapuniv, ← Finset.map_sdiff, Finset.prod_map]
+ rfl
+
+/-! ### Display (F12) in hypothesis form -/
+
+/-- Display (F12) under the hypothesis `HazardPhiBound` (display (F7)): for every realized
+family with `d_i ≥ 2`, every `p ∈ [0,1]^X`, every `0 ≤ c_v ≤ phi(p_v)` and every block with
+`mu_p(D_i) > 0`, `price(X_i) ≤ rho_star · (-log mu_p(D_i))` and `price(X_i) ≤ 1`. -/
+theorem lp_localPriceBoundFull_of_phiBound (h7 : UniversalLaw.Spec.P15.HazardPhiBound)
+ {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.LocalPriceBoundFull F := by
+ intro hF hd p c hp hc i hpos
+ obtain ⟨e, he, hrange⟩ := lp_exists_enum (block F i)
+ have hcard : (block F i).card = F.a i * F.d i + 1 := hF.2.2.1 i
+ have ha1 : 1 ≤ F.a i := hF.1 i
+ have hd2 : 2 ≤ F.d i := hd i
+ have hmul : F.a i * 2 ≤ F.a i * F.d i := Nat.mul_le_mul_left (F.a i) hd2
+ have hn1 : 1 ≤ (block F i).card := by rw [hcard]; omega
+ have hlt : F.a i < (block F i).card := by rw [hcard]; omega
+ have h2a : 2 * F.a i + 1 ≤ (block F i).card := by rw [hcard]; omega
+ -- transport to the capacity family on `Fin n`
+ have htrans : localGood F p i =
+ muOf (capacityFamily (block F i).card (F.a i)) (fun k => p (e k)) :=
+ lp_localGood_eq_muOf hF p i e he hrange
+ have hproper : IsProperDownset (capacityFamily (block F i).card (F.a i)) :=
+ lp_capacityFamily_properDownset _ _ hlt
+ have hpos' : 0 < muOf (capacityFamily (block F i).card (F.a i)) (fun k => p (e k)) := by
+ rw [← htrans]
+ exact hpos
+ -- display (F7) on the transported vector
+ have h7' : hazardStar (capacityFamily (block F i).card (F.a i)) * ∏ k, phi (p (e k)) ≤
+ -Real.log (muOf (capacityFamily (block F i).card (F.a i)) (fun k => p (e k))) :=
+ h7 _ _ hn1 hproper (fun k => p (e k)) (fun k => hp (e k)) hpos'
+ rw [← htrans] at h7'
+ have hprod : ∏ k, phi (p (e k)) = ∏ v ∈ block F i, phi (p v) :=
+ lp_prod_univ_eq e he hrange (fun v => phi (p v))
+ -- the sharp worst case (F11): `h_star ≤ H_{n,a}` and `0 < h_star`
+ obtain ⟨hmono, heq1, heq2, hgt1⟩ := UniversalLaw.Proofs.P15Elementary.capacityWorstCase
+ have hHstar : hStar ≤ hazardStar (capacityFamily (block F i).card (F.a i)) := by
+ have := hmono (F.a i) _ ha1 h2a
+ rwa [heq1, heq2] at this
+ have hhpos : 0 < hStar := lt_trans zero_lt_one hgt1
+ have hH0 : 0 ≤ hazardStar (capacityFamily (block F i).card (F.a i)) :=
+ le_of_lt (lt_of_lt_of_le hhpos hHstar)
+ -- the price
+ have hG0 : 0 ≤ genPrice c (block F i) := Finset.prod_nonneg (fun v _ => (hc v).1)
+ have hGP : genPrice c (block F i) ≤ ∏ v ∈ block F i, phi (p v) :=
+ Finset.prod_le_prod₀ (fun v _ => (hc v).1) (fun v _ => (hc v).2)
+ have hG1 : genPrice c (block F i) ≤ 1 :=
+ Finset.prod_le_one₀ (fun v _ => (hc v).1) (fun v _ => (hc v).2.trans (f7_phi_le_one _))
+ refine ⟨?_, hG1⟩
+ have key : hStar * genPrice c (block F i) ≤ -Real.log (localGood F p i) := by
+ calc hStar * genPrice c (block F i)
+ ≤ hazardStar (capacityFamily (block F i).card (F.a i)) * genPrice c (block F i) :=
+ mul_le_mul_of_nonneg_right hHstar hG0
+ _ ≤ hazardStar (capacityFamily (block F i).card (F.a i)) * ∏ v ∈ block F i, phi (p v) :=
+ mul_le_mul_of_nonneg_left hGP hH0
+ _ = hazardStar (capacityFamily (block F i).card (F.a i)) * ∏ k, phi (p (e k)) := by
+ rw [hprod]
+ _ ≤ -Real.log (localGood F p i) := h7'
+ have hrho : rhoStar = 1 / hStar := rfl
+ rw [hrho, one_div, inv_mul_eq_div, le_div_iff₀ hhpos, mul_comm]
+ exact key
+
+/-! ## (F2) The full transformed-price budget -/
+
+/-- `0 ≤ rho_star`: `rho_star = 1 / (3 - log(3e - 2))` is definitionally `1 / h_star`, and
+`1 < h_star` (`P15Elementary.Aux.one_lt_hStar`). -/
+theorem f2_rhoStar_nonneg : 0 ≤ rhoStar := by
+ have h : (1 : ℝ) < 3 - Real.log (3 * Real.exp 1 - 2) :=
+ UniversalLaw.Proofs.P15Elementary.Aux.one_lt_hStar
+ unfold rhoStar
+ exact div_nonneg zero_le_one (by linarith)
+
+/-- Display (F2) from display (F12): given the local price bound for every realized family, the
+full transformed-price budget holds for every realized family. The hypothesis `h12` is the
+registered `Prop` `LocalPriceBoundFull`, quantified over the ground type so that it can be
+discharged by the inventory theorem `localPriceBoundFull`. -/
+theorem f2_fullTransformedPriceBudget_of_local
+ (h12 : ∀ {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X),
+ UniversalLaw.Spec.P15.LocalPriceBoundFull F)
+ {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.FullTransformedPriceBudget F := by
+ intro hF hd p c hp hc K hK
+ have hc0 : ∀ v, 0 ≤ c v := fun v => (hc v).1
+ refine UniversalLaw.Proofs.P15Budget.Aux.le_cappedHazard_of
+ (UniversalLaw.Proofs.P15Budget.Aux.coverCost_le_one F K hc0) fun hmu => ?_
+ calc coverCost F K c
+ ≤ ∑ i, genPrice c (block F i) :=
+ UniversalLaw.Proofs.P15Budget.Aux.coverCost_le_sum_block hF hc0 hK
+ _ ≤ ∑ i, rhoStar * (-Real.log (localGood F p i)) := by
+ refine Finset.sum_le_sum fun i _ => ?_
+ have hpos : 0 < localGood F p i :=
+ UniversalLaw.Proofs.P15Hazard.Aux.localGood_pos_of_mu_pos F hp hmu i
+ exact (h12 F hF hd p c hp hc i hpos).1
+ _ = rhoStar * ∑ i, -Real.log (localGood F p i) := by
+ rw [Finset.mul_sum]
+ _ ≤ rhoStar * -Real.log (mu F p) :=
+ mul_le_mul_of_nonneg_left
+ ((UniversalLaw.Proofs.P15Hazard.globalAssemblyHazard F hF p hp).2 hmu)
+ f2_rhoStar_nonneg
+
+end Aux
+
+/-! ## Inventory theorems
+
+Each theorem below has as its type exactly one registered `Prop`; the chain is
+`coordinatewiseConcavity → hazardProductBound → hazardPhiBound → fullGroundPriceBound,
+fullGroundBudgetIff, localPriceBoundFull → fullTransformedPriceBudget`, and `rhoStarEnclosure`
+is independent of it. -/
+
+/-- Proves: `UniversalLaw.Spec.P15.RhoStarEnclosure` (claim `p15-full-price`, display (F3)).
+Method: `rho_star < U` iff `3e - 2 < exp(3 - 1/U)` and `L < rho_star` iff `exp(3 - 1/L) < 3e - 2`
+(`Real.log_lt_iff_lt_exp`, `Real.lt_log_iff_exp_lt`, `div_lt_iff₀`, `lt_div_iff₀`); with
+`3 - 1/U = 2 + x_U`, `exp(3 - 1/U) = (exp 1)^2 * exp x_U` (`Real.exp_add`, `exp_two_eq`), and
+`Real.exp_bound` at degree 26 for `e` and degree 16 for `exp x_U`, `exp x_L` gives exact rational
+enclosures (`Aux.f3_exp_one_gt/lt`, `Aux.f3_exp_xU_ge`, `Aux.f3_exp_xL_le`) that `norm_num`
+compares in `Aux.f3_log_lt`, `Aux.f3_lt_log`; `rhoStarUpper < 6/7` is `norm_num` on rationals.
+Does not establish: the informal display (F3) or its review and acceptance; the alignment of the
+formal objects with the source's (PENDING_INDEPENDENT_REVIEW); the source's `full_price.py`
+Fraction procedure (not specified and not reproduced here: the route above is a different
+certificate of the same enclosure), nor any change to the `specified` status that main's
+`docs/FORMAL_VERIFICATION_ROLLOUT_20260927.md` records for this target; the disposition of
+`p15-full-price`, which is transcribed in the register, not derived here. -/
+theorem rhoStarEnclosure : UniversalLaw.Spec.P15.RhoStarEnclosure := by
+ unfold UniversalLaw.Spec.P15.RhoStarEnclosure
+ exact ⟨Aux.f3_lower_lt_rhoStar, Aux.f3_rhoStar_lt_upper, Aux.f3_upper_lt_six_sevenths⟩
+
+/-- Proves: `UniversalLaw.Spec.P15.CoordinatewiseConcavity` (claim `p15-full-price`, display (F5)).
+Method: split `mu_p(A)` at the coordinate `i` (display (F4), `Aux.cc_muOf_update`): with
+`p_i = 1 - exp(-s)` it equals `S_in + (S_out - S_in) exp(-s)`, where `0 ≤ S_in ≤ S_out` for a
+downset (`Aux.cc_sum_in_le_sum_out`, the injection `U ↦ U.erase i`) and `S_out > 0` since `∅ ∈ A`
+and every `p_j(t) < 1` on the cube (`Aux.cc_sum_out_pos`); then `s ↦ -log(a + b exp(-s))` with
+`a, b ≥ 0`, `a + b > 0` is concave by `concaveOn_of_deriv2_nonpos`, its second derivative being
+`-a b exp(-s) / (a + b exp(-s))^2 ≤ 0` (`Aux.cc_concaveOn_negLog`, via `HasDerivAt.log`,
+`HasDerivAt.div`, `HasDerivAt.deriv`).
+Does not establish: the informal display (F5) or its review and acceptance; the alignment of the
+formal objects with the source's (PENDING_INDEPENDENT_REVIEW); joint concavity, or the derivative
+formulas (F4)-(F5) themselves as registered statements (not specified; concavity is their
+consequence); the disposition of `p15-full-price`, which is transcribed in the register, not
+derived here. -/
+theorem coordinatewiseConcavity : UniversalLaw.Spec.P15.CoordinatewiseConcavity := by
+ intro n A _ hA i t ht
+ obtain ⟨h0, -, hdown⟩ := hA
+ exact Aux.cc_concaveOn_hazardCoord_update h0 hdown i t ht
+
+/-- Proves: `UniversalLaw.Spec.P15.HazardProductBound` (claim `p15-full-price`, display (F6)).
+Method: chord inequality of the separate coordinatewise concavity `coordinatewiseConcavity`
+(display (F5)) on `[0,1]`: `f(s) ≥ (1-s) f(0) + s f(1) ≥ s f(1)` since `f(0) = -log mu ≥ 0`
+(`Aux.f6_hazardCoord_nonneg`, from `mu_p(A) ≤ 1` by `sum_weight_eq_one` and `weight_nonneg`);
+iterate over the coordinates with `Finset.induction_on` (`Aux.f6_prod_hazardCoord_le`), raising
+one coordinate to `1` at each step (`Aux.f6_chord`), and identify `F_A(1, …, 1) = H_A`
+(`Aux.f6_hazardCoord_one`, since `1 - exp(-1) = p_star`).
+Does not establish: the informal display (F6) or its review and acceptance; the alignment of the
+formal objects with the source's (PENDING_INDEPENDENT_REVIEW); the inequality as an informal
+statement (the Prop is statement only); the disposition of `p15-full-price`, which is
+transcribed in the register, not derived here. -/
+theorem hazardProductBound : UniversalLaw.Spec.P15.HazardProductBound :=
+ Aux.f6_hazardProductBound_of_concavity coordinatewiseConcavity
+
+/-- Proves: `UniversalLaw.Spec.P15.HazardPhiBound` (claim `p15-full-price`, display (F7)).
+Method: put `t_i := phi(p_i) ∈ [0,1]` (`Aux.f7_phi_mem`) and `p'_i := 1 - exp(-t_i) ∈ [0, p_i]`
+(`Aux.f7_one_sub_exp_neg_phi_le`, from `phi p ≤ -log(1-p)` and `Real.exp_log`); for a downset
+`mu(A)` is antitone in the probability vector (`Aux.f7_muOf_antitone`, built from the
+one-coordinate split `Aux.cc_muOf_update` of display (F4) with `S_in ≤ S_out` by
+`Finset.sum_image` along `U ↦ U.erase i`, iterated by `Finset.induction_on`), so
+`0 < mu_p(A) ≤ mu_p'(A)` and `Real.log_le_log` give `-log mu_p(A) ≥ -log mu_p'(A) = F_A(t)`;
+display (F6) `hazardProductBound` then gives `F_A(t) ≥ (prod_i t_i) H_A`, and `mul_comm`
+matches the Prop's order.
+Does not establish: the informal display (F7) or its review and acceptance; the alignment of the
+formal objects with the source's (PENDING_INDEPENDENT_REVIEW); the inequality as an informal
+statement (the Prop is statement only), nor anything at `mu_p(A) = 0`, where the source reads
+the inequality as an extended one and the Prop states nothing; the disposition of
+`p15-full-price`, which is transcribed in the register, not derived here. -/
+theorem hazardPhiBound : UniversalLaw.Spec.P15.HazardPhiBound :=
+ Aux.f7_hazardPhiBound_of_productBound hazardProductBound
+
+/-- Proves: `UniversalLaw.Spec.P15.FullGroundPriceBound` (claim `p15-full-price`, display (F8)).
+Method: `prod_i c_i ≤ prod_i phi(p_i)` for `0 ≤ c_i ≤ phi(p_i)` (`Finset.prod_le_prod₀`) and
+`prod_i phi(p_i) ≤ 1` from `0 ≤ phi ≤ 1` on `[0,1]` (`Finset.prod_le_one₀`, `Real.log_nonpos`)
+give the cap; when `mu_p(A) > 0`, display (F7), `hazardPhiBound`, gives
+`H_A prod_i phi(p_i) ≤ -log mu_p(A)` and `H_A > 0` (`P15Elementary.hazardStarPositive`), so
+`prod_i phi(p_i) ≤ (1/H_A) [-log mu_p(A)]` (`inv_mul_cancel_left₀`, `mul_le_mul_of_nonneg_left`);
+`P15Budget.Aux.le_cappedHazard_of` reaches the capped hazard.
+Does not establish: the informal display (F8) or its review and acceptance; the alignment of the
+formal objects with the source's (PENDING_INDEPENDENT_REVIEW); that the full-ground generator
+covers any obstruction (the source: "It does not assert that this generator alone covers an
+arbitrary obstruction"); the disposition of `p15-full-price`, which is transcribed in the
+register, not derived here. -/
+theorem fullGroundPriceBound : UniversalLaw.Spec.P15.FullGroundPriceBound :=
+ Aux.f8_fullGroundPriceBound_of_phiBound hazardPhiBound
+
+/-- Proves: `UniversalLaw.Spec.P15.FullGroundBudgetIff` (claim `p15-full-price`, display (F8), the
+exactness remark following it).
+Method: (⇐) is display (F8) with `rho = 1`: `prod_i c_i ≤ prod_i phi(p_i) ≤ 1`
+(`Finset.prod_le_prod₀`, `Finset.prod_le_one₀`) and, when `mu_p(A) > 0`,
+`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`)
+and display (F7), `hazardPhiBound`, reaching the cap by `P15Budget.Aux.le_cappedHazard_of`.
+(⇒) instantiates the budget at `p ≡ p_star`, `c ≡ 1` (admissible by `P15Elementary.Aux.pStar_pos`,
+`pStar_lt_one` and `phi p_star = 1`, `P15Elementary.phiAtPStar`); `mu_{p_star}(A) > 0` since
+`∅ ∈ A` contributes `(1 - p_star)^n > 0` (`Finset.single_le_sum`, `P15Budget.Aux.weight_nonneg`),
+so `1 ≤ min 1 (-log mu_{p_star}(A))` and `le_min_iff` gives `1 ≤ H_A`.
+Does not establish: the informal display (F8) or its review and acceptance; the alignment of the
+formal objects with the source's (PENDING_INDEPENDENT_REVIEW); coverage of arbitrary `A` (the
+source: "it does not infer coverage of arbitrary A"); the disposition of `p15-full-price`, which
+is transcribed in the register, not derived here. -/
+theorem fullGroundBudgetIff : UniversalLaw.Spec.P15.FullGroundBudgetIff :=
+ Aux.bi_fullGroundBudgetIff_of_phiBound hazardPhiBound
+
+/-- Proves: `UniversalLaw.Spec.P15.LocalPriceBoundFull` (claim `p15-full-price`, display (F12)).
+Method: enumerate the block by `Fin n_i` (`Aux.lp_exists_enum`), transport `mu_p(D_i)` to the
+capacity family `{|T| ≤ a_i}` via `LocalRestriction` (`Aux.lp_localGood_eq_muOf`), apply
+`hazardPhiBound` (display (F7)) to that proper downset (`Aux.lp_capacityFamily_properDownset`),
+bound `h_star ≤ H_{n_i,a_i}` by `CapacityWorstCase` and `∏ c ≤ ∏ phi ≤ 1` by
+`Finset.prod_le_prod₀`, `Finset.prod_le_one₀`; `rho_star = 1 / h_star` is definitional.
+Does not establish: the informal display (F12) or its review and acceptance; the alignment of the
+formal objects with the source's (PENDING_INDEPENDENT_REVIEW); the stronger inequality
+`price ≤ q_i` ("The inequality price<=q_i is NOT required and is in general stronger than what
+is proved here"); the disposition of `p15-full-price`, which is transcribed in the register, not
+derived here. -/
+theorem localPriceBoundFull {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.LocalPriceBoundFull F :=
+ Aux.lp_localPriceBoundFull_of_phiBound hazardPhiBound F
+
+/-- Proves: `UniversalLaw.Spec.P15.FullTransformedPriceBudget` (claim `p15-full-price`, display (F2)).
+Method: `covercost ≤ 1` by the cover `{∅}` (`P15Budget.Aux.coverCost_le_one`); for `K ≥ K_H(d)`
+the full blocks cover, so `covercost ≤ sum_i price(X_i)` (`P15Budget.Aux.coverCost_le_sum_block`);
+when `mu_p(D) > 0` every `mu_p(D_i) > 0` (`P15Hazard.Aux.localGood_pos_of_mu_pos`) and the local
+bound (F12), `localPriceBoundFull`, gives `price(X_i) ≤ rho_star [-log mu_p(D_i)]`;
+`Finset.sum_le_sum`, `Finset.mul_sum` and the global assembly (F13),
+`P15Hazard.globalAssemblyHazard`, give `sum_i price(X_i) ≤ rho_star [-log mu_p(D)]` with
+`rho_star ≥ 0`; `P15Budget.Aux.le_cappedHazard_of` reaches the capped hazard.
+Does not establish: the informal display (F2) or its review and acceptance; the alignment of the
+formal objects with the source's (PENDING_INDEPENDENT_REVIEW); 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_CLAIMS
+(REVIEWED_SCOPED), which is not reproduced or extended here; the disposition of
+`p15-full-price`, which is transcribed in the register, not derived here. -/
+theorem fullTransformedPriceBudget {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.FullTransformedPriceBudget F :=
+ Aux.f2_fullTransformedPriceBudget_of_local (fun F => localPriceBoundFull F) F
+
+end UniversalLaw.Proofs.P15Interpolation
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Structure.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Structure.lean
new file mode 100644
index 000000000..22fbee548
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Structure.lean
@@ -0,0 +1,1278 @@
+import Specifications.P15
+
+/-!
+# P15 finite-structure proofs (benchmark instance and general finite statements)
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+Every theorem in this module has as its type exactly one registered `Prop` of
+`Specifications/P15.lean` (statement packet `specifications/lean_statements_20261010`, which is
+not modified here). A kernel-checked proof of such a `Prop` is evidence about that `Prop` only:
+it does not make the informal Layer 0 note reviewed, accepted or "verified", it does not
+identify the formal definitions with the informal objects (that alignment is
+PENDING_INDEPENDENT_REVIEW), and it promotes, closes, discharges or reclassifies nothing.
+
+Helper lemmas live in `UniversalLaw.Proofs.P15Structure.Aux`; the gate inventories only the
+theorems outside that namespace.
+-/
+
+namespace UniversalLaw.Proofs.P15Structure
+
+open UniversalLaw.Spec.P15
+open Finset
+
+namespace Aux
+
+/-! ### Blocks of a realized family -/
+
+/-- The blocks of a realized family are nonempty (they have `a_i d_i + 1 ≥ 1` elements). -/
+theorem block_nonempty {X : Type} [Fintype X] {F : RealizedData X} (hF : IsRealizedFamily F)
+ (i : Fin F.b) : (block F i).Nonempty := by
+ rw [← Finset.card_pos, hF.2.2.1 i]
+ exact Nat.succ_pos _
+
+/-- An element of `block F i` has block index `i`. -/
+theorem blk_eq_of_mem_block {X : Type} [Fintype X] {F : RealizedData X} {i : Fin F.b} {v : X}
+ (hv : v ∈ block F i) : F.blk v = i := by
+ simpa [block] using hv
+
+/-- Membership in a block. -/
+theorem mem_block_iff {X : Type} [Fintype X] {F : RealizedData X} {i : Fin F.b} {v : X} :
+ v ∈ block F i ↔ F.blk v = i := by
+ simp [block]
+
+/-- The block map of a realized family is injective (blocks are nonempty fibres). -/
+theorem block_injective {X : Type} [Fintype X] {F : RealizedData X}
+ (hF : IsRealizedFamily F) : Function.Injective (block F) := by
+ intro i j hij
+ obtain ⟨v, hv⟩ := block_nonempty hF i
+ have hvj : v ∈ block F j := hij ▸ hv
+ rw [← blk_eq_of_mem_block hv, blk_eq_of_mem_block hvj]
+
+/-- The price of the full-block family is the sum of the block prices. -/
+theorem famPrice_fullBlockFamily {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}
+ (hF : IsRealizedFamily F) (c : X → ℝ) :
+ famPrice c (fullBlockFamily F) = ∑ i, genPrice c (block F i) := by
+ unfold famPrice fullBlockFamily
+ rw [Finset.sum_image (fun i _ j _ h => block_injective hF h)]
+
+/-! ### The six-block benchmark -/
+
+theorem block_benchmark816 (i : Fin 6) :
+ block benchmark816 i = {i} ×ˢ (univ : Finset (Fin 409)) := by
+ ext ⟨x, y⟩
+ simp only [block, mem_filter, mem_univ, true_and, mem_product, mem_singleton, and_true]
+ exact Iff.rfl
+
+theorem card_block_benchmark816' (i : Fin 6) : (block benchmark816 i).card = 409 := by
+ rw [block_benchmark816 i, card_product, card_singleton, card_univ, Fintype.card_fin]
+
+/-- The same statement at the dependent index type `Fin benchmark816.b` (definitionally `Fin 6`),
+so that it can be used by `rw` on goals produced from the general definitions. -/
+theorem card_block_benchmark816 (i : Fin benchmark816.b) : (block benchmark816 i).card = 409 :=
+ card_block_benchmark816' i
+
+theorem mem_H_benchmark816' {e : Finset (Fin 6)} (he : e ∈ completeClutter 6 3) : e.card = 4 := by
+ rw [completeClutter, mem_powersetCard] at he
+ exact he.2
+
+theorem mem_H_benchmark816 {e : Finset (Fin benchmark816.b)} (he : e ∈ benchmark816.H) :
+ e.card = 4 :=
+ mem_H_benchmark816' he
+
+theorem benchmark816_isRealized : IsRealizedFamily benchmark816 := by
+ refine ⟨fun _ => le_rfl, fun _ => ?_, fun i => ?_, fun e he => ?_, fun e he f hf hef => ?_⟩
+ · change (1 : ℕ) ≤ 408
+ norm_num
+ · change (block benchmark816 i).card = 1 * 408 + 1
+ rw [card_block_benchmark816 i]
+ · rw [mem_H_benchmark816 he]
+ norm_num
+ · exact eq_of_subset_of_card_le hef (by rw [mem_H_benchmark816 he, mem_H_benchmark816 hf])
+
+/-- The price of the six full blocks at a constant price vector. -/
+theorem famPrice_const_benchmark816 (r : ℝ) :
+ famPrice (fun _ => r) (fullBlockFamily benchmark816) = 6 * r ^ 409 := by
+ rw [famPrice_fullBlockFamily benchmark816_isRealized]
+ have h : ∀ i : Fin benchmark816.b, genPrice (fun _ => r) (block benchmark816 i) = r ^ 409 :=
+ fun i => by rw [genPrice, prod_const, card_block_benchmark816 i]
+ rw [Finset.sum_congr rfl (fun i _ => h i), sum_const, card_univ]
+ change (6 : ℕ) • r ^ 409 = 6 * r ^ 409
+ rw [nsmul_eq_mul]
+ norm_num
+
+/-- Lower bound on `-log(1 - x)` from the Taylor estimate of Mathlib with three terms. -/
+theorem neg_log_one_sub_gt (x : ℝ) (hx0 : 0 < x) (hx1 : x < 1 / 4) :
+ x + x ^ 2 / 2 < -Real.log (1 - x) := by
+ have habs : |x| < 1 := by rw [abs_of_pos hx0]; linarith
+ have h := Real.abs_log_sub_add_sum_range_le habs 3
+ rw [abs_of_pos hx0] at h
+ simp only [Finset.sum_range_succ, Finset.sum_range_zero] at h
+ rw [abs_le] at h
+ obtain ⟨_, h2⟩ := h
+ have hpos : 0 < 1 - x := by linarith
+ have key : x ^ 4 / (1 - x) < x ^ 3 / 3 := by
+ rw [div_lt_div_iff₀ hpos (by norm_num)]
+ nlinarith [pow_pos hx0 3]
+ norm_num at h2
+ linarith [h2, key]
+
+
+/-! ### Palette numbers of complete clutters -/
+
+/-- For the clutter of all `(s+1)`-subsets, the edge condition of a palette says exactly that every
+label lies in at most `s` of the label sets. -/
+theorem completeClutter_edge_iff (b s : ℕ) {K : ℕ} (P : Fin b → Finset (Fin K)) :
+ (∀ e ∈ completeClutter b s, ∀ ℓ : Fin K, ∃ i ∈ e, ℓ ∉ P i) ↔
+ ∀ ℓ : Fin K, (univ.filter (fun i => ℓ ∈ P i)).card ≤ s := by
+ constructor
+ · intro h ℓ
+ by_contra hlt
+ rw [not_le] at hlt
+ obtain ⟨e, he, hecard⟩ := exists_subset_card_eq (Nat.succ_le_of_lt hlt)
+ have hmem : e ∈ completeClutter b s := by
+ rw [completeClutter, mem_powersetCard]
+ exact ⟨subset_univ _, hecard⟩
+ obtain ⟨i, hi, hni⟩ := h e hmem ℓ
+ exact hni (mem_filter.1 (he hi)).2
+ · intro h e he ℓ
+ rw [completeClutter, mem_powersetCard] at he
+ by_contra hcon
+ simp only [not_exists, not_and, not_not] at hcon
+ have hsub : e ⊆ univ.filter (fun i => ℓ ∈ P i) :=
+ fun i hi => mem_filter.2 ⟨mem_univ _, hcon i hi⟩
+ have := card_le_card hsub
+ have := h ℓ
+ omega
+
+/-- Double counting: the total size of the label sets is the sum over labels of their
+multiplicities. -/
+theorem sum_card_eq_sum_fiber {b K : ℕ} (P : Fin b → Finset (Fin K)) :
+ ∑ i, (P i).card = ∑ ℓ : Fin K, (univ.filter (fun i => ℓ ∈ P i)).card := by
+ have h1 : ∀ i, (P i).card = ∑ ℓ : Fin K, if ℓ ∈ P i then 1 else 0 := fun i => by
+ rw [sum_boole, Nat.cast_id]
+ congr 1
+ ext ℓ
+ simp
+ simp_rw [h1, card_filter]
+ exact sum_comm
+
+/-- The two necessary conditions for a feasible palette of the complete clutter. -/
+theorem palette_lower_bounds {b s K : ℕ} {d : Fin b → ℕ}
+ (hK : IsPaletteFeasible b (completeClutter b s) d K) :
+ (∀ i, d i ≤ K) ∧ ∑ i, d i ≤ s * K := by
+ obtain ⟨P, hPd, hPe⟩ := hK
+ rw [completeClutter_edge_iff] at hPe
+ refine ⟨fun i => (hPd i).trans (card_finset_fin_le _), ?_⟩
+ calc ∑ i, d i ≤ ∑ i, (P i).card := sum_le_sum (fun i _ => hPd i)
+ _ = ∑ ℓ : Fin K, (univ.filter (fun i => ℓ ∈ P i)).card := sum_card_eq_sum_fiber P
+ _ ≤ ∑ _ℓ : Fin K, s := sum_le_sum (fun ℓ _ => hPe ℓ)
+ _ = s * K := by rw [sum_const, card_univ, Fintype.card_fin, smul_eq_mul, mul_comm]
+
+/-- Prefix sums of the demands: `c_i = sum_{j < i} d_j`. -/
+def prefixSum {b : ℕ} (d : Fin b → ℕ) (i : Fin b) : ℕ :=
+ ∑ j ∈ univ.filter (fun j => j < i), d j
+
+theorem prefixSum_add_le_of_lt {b : ℕ} (d : Fin b → ℕ) {i i' : Fin b} (h : i < i') :
+ prefixSum d i + d i ≤ prefixSum d i' := by
+ unfold prefixSum
+ have hnot : i ∉ univ.filter (fun j => j < i) := by simp
+ rw [add_comm, ← sum_insert hnot]
+ apply sum_le_sum_of_subset
+ intro j hj
+ simp only [mem_insert, mem_filter, mem_univ, true_and] at hj ⊢
+ rcases hj with rfl | hj
+ · exact h
+ · exact hj.trans h
+
+theorem prefixSum_add_le {b : ℕ} (d : Fin b → ℕ) (i : Fin b) :
+ prefixSum d i + d i ≤ ∑ j, d j := by
+ unfold prefixSum
+ have hnot : i ∉ univ.filter (fun j => j < i) := by simp
+ rw [add_comm, ← sum_insert hnot]
+ exact sum_le_sum_of_subset (subset_univ _)
+
+/-- The cyclic label of a position. -/
+def cycLabel (K : ℕ) (hK : 0 < K) (n : ℕ) : Fin K := ⟨n % K, Nat.mod_lt _ hK⟩
+
+/-- The cyclic palette: block `i` receives the labels of the positions `c_i, ..., c_i + d_i - 1`
+reduced modulo `K`. -/
+def cycPalette {b : ℕ} (d : Fin b → ℕ) (K : ℕ) (hK : 0 < K) (i : Fin b) : Finset (Fin K) :=
+ (Ico (prefixSum d i) (prefixSum d i + d i)).image (cycLabel K hK)
+
+theorem mem_cycPalette {b : ℕ} (d : Fin b → ℕ) (K : ℕ) (hK : 0 < K) (i : Fin b) (ℓ : Fin K) :
+ ℓ ∈ cycPalette d K hK i ↔
+ ∃ n, n ∈ Ico (prefixSum d i) (prefixSum d i + d i) ∧ n % K = ℓ.val := by
+ unfold cycPalette cycLabel
+ simp only [mem_image, Fin.ext_iff]
+
+theorem card_cycPalette {b : ℕ} (d : Fin b → ℕ) (K : ℕ) (hK : 0 < K) (i : Fin b)
+ (hd : d i ≤ K) : (cycPalette d K hK i).card = d i := by
+ unfold cycPalette
+ rw [card_image_of_injOn, Nat.card_Ico, Nat.add_sub_cancel_left]
+ intro n hn n' hn' hnn'
+ simp only [coe_Ico, Set.mem_Ico] at hn hn'
+ simp only [cycLabel, Fin.mk.injEq] at hnn'
+ rcases le_total n n' with h | h
+ · have h1 := Nat.sub_mod_eq_zero_of_mod_eq hnn'.symm
+ have h2 : n' - n < K := by omega
+ rw [Nat.mod_eq_of_lt h2] at h1
+ omega
+ · have h1 := Nat.sub_mod_eq_zero_of_mod_eq hnn'
+ have h2 : n - n' < K := by omega
+ rw [Nat.mod_eq_of_lt h2] at h1
+ omega
+
+open Classical in
+/-- The first position of block `i` carrying the label `ℓ` (or `0` if there is none). -/
+noncomputable def firstPos {b : ℕ} (d : Fin b → ℕ) (K ℓ : ℕ) (i : Fin b) : ℕ :=
+ if h : ∃ n, n ∈ Ico (prefixSum d i) (prefixSum d i + d i) ∧ n % K = ℓ then Nat.find h else 0
+
+theorem firstPos_spec {b : ℕ} (d : Fin b → ℕ) (K ℓ : ℕ) (i : Fin b)
+ (hex : ∃ n, n ∈ Ico (prefixSum d i) (prefixSum d i + d i) ∧ n % K = ℓ) :
+ firstPos d K ℓ i ∈ Ico (prefixSum d i) (prefixSum d i + d i) ∧ firstPos d K ℓ i % K = ℓ := by
+ unfold firstPos
+ split_ifs
+ exact Nat.find_spec hex
+
+/-- At most `s` positions below `s * K` carry a given residue modulo `K`. -/
+theorem card_residue_le {K s D : ℕ} (hK : 0 < K) (hD : D ≤ s * K) (ℓ : ℕ) :
+ ((range D).filter (fun n => n % K = ℓ)).card ≤ s := by
+ calc ((range D).filter (fun n => n % K = ℓ)).card ≤ (range s).card :=
+ card_le_card_of_injOn (fun n => n / K) ?_ ?_
+ _ = s := card_range s
+ · intro n hn
+ simp only [mem_coe, mem_filter, mem_range] at hn ⊢
+ exact (Nat.div_lt_iff_lt_mul hK).2 (hn.1.trans_le hD)
+ · intro n hn n' hn' h
+ simp only [mem_coe, mem_filter, mem_range] at hn hn'
+ have h' : n / K = n' / K := h
+ calc n = K * (n / K) + n % K := (Nat.div_add_mod n K).symm
+ _ = K * (n' / K) + n' % K := by rw [h', hn.2, hn'.2]
+ _ = n' := Nat.div_add_mod n' K
+
+/-- The cyclic palette is feasible for the complete clutter whenever the two necessary conditions
+hold. -/
+theorem palette_witness {b s K : ℕ} (d : Fin b → ℕ) (hdK : ∀ i, d i ≤ K)
+ (hsum : ∑ i, d i ≤ s * K) : IsPaletteFeasible b (completeClutter b s) d K := by
+ rcases Nat.eq_zero_or_pos K with hK0 | hK
+ · subst hK0
+ refine ⟨fun _ => ∅, fun i => by simpa using hdK i, fun e _ ℓ => ℓ.elim0⟩
+ · refine ⟨cycPalette d K hK, fun i => (card_cycPalette d K hK i (hdK i)).ge, ?_⟩
+ rw [completeClutter_edge_iff]
+ intro ℓ
+ calc (univ.filter (fun i => ℓ ∈ cycPalette d K hK i)).card
+ ≤ ((range (∑ i, d i)).filter (fun n => n % K = ℓ.val)).card :=
+ card_le_card_of_injOn (firstPos d K ℓ.val) ?_ ?_
+ _ ≤ s := card_residue_le hK hsum ℓ.val
+ · intro i hi
+ simp only [mem_coe, mem_filter, mem_univ, true_and, mem_cycPalette] at hi
+ obtain ⟨h1, h2⟩ := firstPos_spec d K ℓ.val i hi
+ simp only [mem_coe, mem_filter, mem_range]
+ refine ⟨?_, h2⟩
+ have := (mem_Ico.1 h1).2
+ have := prefixSum_add_le d i
+ omega
+ · intro i hi i' hi' hii'
+ simp only [mem_coe, mem_filter, mem_univ, true_and, mem_cycPalette] at hi hi'
+ have h1 := mem_Ico.1 (firstPos_spec d K ℓ.val i hi).1
+ have h2 := mem_Ico.1 (firstPos_spec d K ℓ.val i' hi').1
+ rw [hii'] at h1
+ by_contra hne
+ rcases lt_or_gt_of_ne hne with hlt | hlt
+ · have := prefixSum_add_le_of_lt d hlt
+ omega
+ · have := prefixSum_add_le_of_lt d hlt
+ omega
+
+/-- The palette number of the complete clutter, display (P9), in expanded form. -/
+theorem paletteNumber_completeClutter (b s : ℕ) (d : Fin b → ℕ) (hs : 1 ≤ s) :
+ paletteNumber b (completeClutter b s) d =
+ max (univ.sup d) ⌈((∑ i, d i : ℕ) : ℚ) / (s : ℚ)⌉₊ := by
+ have hs' : (0 : ℚ) < s := by exact_mod_cast hs
+ apply IsLeast.csInf_eq
+ constructor
+ · show IsPaletteFeasible b (completeClutter b s) d _
+ apply palette_witness
+ · intro i
+ exact (le_sup (mem_univ i)).trans (le_max_left _ _)
+ · have h1 : ((∑ i, d i : ℕ) : ℚ) / s ≤ ⌈((∑ i, d i : ℕ) : ℚ) / s⌉₊ := Nat.le_ceil _
+ have h2 : (⌈((∑ i, d i : ℕ) : ℚ) / s⌉₊ : ℚ) ≤
+ (max (univ.sup d) ⌈((∑ i, d i : ℕ) : ℚ) / (s : ℚ)⌉₊ : ℕ) := by
+ exact_mod_cast le_max_right _ _
+ rw [div_le_iff₀ hs'] at h1
+ have h3 : ((∑ i, d i : ℕ) : ℚ) ≤
+ (s : ℚ) * (max (univ.sup d) ⌈((∑ i, d i : ℕ) : ℚ) / (s : ℚ)⌉₊ : ℕ) := by
+ calc ((∑ i, d i : ℕ) : ℚ) ≤ (⌈((∑ i, d i : ℕ) : ℚ) / s⌉₊ : ℚ) * s := h1
+ _ ≤ (max (univ.sup d) ⌈((∑ i, d i : ℕ) : ℚ) / (s : ℚ)⌉₊ : ℕ) * s :=
+ mul_le_mul_of_nonneg_right h2 hs'.le
+ _ = _ := mul_comm _ _
+ exact_mod_cast h3
+ · intro K hK
+ obtain ⟨h1, h2⟩ := palette_lower_bounds hK
+ apply max_le
+ · exact Finset.sup_le (fun i _ => h1 i)
+ · rw [Nat.ceil_le, div_le_iff₀ hs']
+ exact_mod_cast (by rw [mul_comm]; exact h2 : ∑ i, d i ≤ K * s)
+
+
+/-! ### Palettes exist and are upward closed -/
+
+/-- Disjoint label intervals give a feasible palette of size `sum d_i` for any clutter whose edges
+have at least two elements. -/
+theorem isPaletteFeasible_sum {b : ℕ} (H : Finset (Finset (Fin b))) (d : Fin b → ℕ)
+ (hH : ∀ e ∈ H, 2 ≤ e.card) : IsPaletteFeasible b H d (∑ i, d i) := by
+ refine ⟨fun i => (Ico (prefixSum d i) (prefixSum d i + d i)).attachFin
+ (fun m hm => lt_of_lt_of_le (mem_Ico.1 hm).2 (prefixSum_add_le d i)), fun i => ?_, ?_⟩
+ · rw [card_attachFin, Nat.card_Ico, Nat.add_sub_cancel_left]
+ · intro e he ℓ
+ by_contra hcon
+ simp only [not_exists, not_and, mem_attachFin, mem_Ico] at hcon
+ have h2 := hH e he
+ obtain ⟨i, hi⟩ : e.Nonempty := card_pos.1 (by omega)
+ obtain ⟨j, hj, hji⟩ := exists_mem_ne (by omega : 1 < e.card) i
+ have h1 := hcon i hi
+ have h2 := hcon j hj
+ rcases lt_or_gt_of_ne hji with hlt | hlt
+ · have := prefixSum_add_le_of_lt d hlt
+ omega
+ · have := prefixSum_add_le_of_lt d hlt
+ omega
+
+/-- Feasibility is upward closed in the palette size (for clutters with edges of size `≥ 2`). -/
+theorem isPaletteFeasible_mono {b : ℕ} (H : Finset (Finset (Fin b))) (d : Fin b → ℕ)
+ (hH : ∀ e ∈ H, 2 ≤ e.card) {K K' : ℕ} (hKK' : K ≤ K')
+ (h : IsPaletteFeasible b H d K) : IsPaletteFeasible b H d K' := by
+ obtain ⟨P, hPd, hPe⟩ := h
+ refine ⟨fun i => (P i).map (Fin.castLEEmb hKK'), fun i => ?_, ?_⟩
+ · rw [card_map]
+ exact hPd i
+ · intro e he ℓ
+ by_cases hℓ : ℓ.val < K
+ · obtain ⟨i, hi, hni⟩ := hPe e he ⟨ℓ.val, hℓ⟩
+ refine ⟨i, hi, fun hmem => hni ?_⟩
+ rw [mem_map] at hmem
+ obtain ⟨ℓ', hℓ', hcast⟩ := hmem
+ have : ℓ' = ⟨ℓ.val, hℓ⟩ := by
+ apply Fin.ext
+ have := congrArg Fin.val hcast
+ simpa using this
+ rw [← this]
+ exact hℓ'
+ · have h2 := hH e he
+ obtain ⟨i, hi⟩ : e.Nonempty := card_pos.1 (by omega)
+ refine ⟨i, hi, fun hmem => hℓ ?_⟩
+ rw [mem_map] at hmem
+ obtain ⟨ℓ', _, hcast⟩ := hmem
+ rw [← hcast]
+ simp
+
+/-- The palette number is attained and bounded by `sum d_i` when every edge has size `≥ 2`. -/
+theorem isPaletteFeasible_paletteNumber {b : ℕ} (H : Finset (Finset (Fin b))) (d : Fin b → ℕ)
+ (hH : ∀ e ∈ H, 2 ≤ e.card) : IsPaletteFeasible b H d (paletteNumber b H d) := by
+ have h : sInf {K : ℕ | IsPaletteFeasible b H d K} ∈ {K : ℕ | IsPaletteFeasible b H d K} :=
+ csInf_mem ⟨∑ i, d i, isPaletteFeasible_sum H d hH⟩
+ exact h
+
+theorem isPaletteFeasible_of_paletteNumber_le {b : ℕ} (H : Finset (Finset (Fin b)))
+ (d : Fin b → ℕ) (hH : ∀ e ∈ H, 2 ≤ e.card) {K : ℕ} (hK : paletteNumber b H d ≤ K) :
+ IsPaletteFeasible b H d K :=
+ isPaletteFeasible_mono H d hH hK (isPaletteFeasible_paletteNumber H d hH)
+
+theorem paletteNumber_le_of_feasible {b : ℕ} (H : Finset (Finset (Fin b))) (d : Fin b → ℕ)
+ {K : ℕ} (hK : IsPaletteFeasible b H d K) : paletteNumber b H d ≤ K :=
+ csInf_le' (show K ∈ {K : ℕ | IsPaletteFeasible b H d K} from hK)
+
+/-! ### Decompositions of a set into good parts versus palettes -/
+
+section Decomp
+
+variable {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}
+
+/-- A `K`-decomposition of `U` yields a palette with `|U ∩ X_i| ≤ a_i |P_i|`: `P_i` is the set of
+parts meeting `X_i`. -/
+theorem palette_of_decomposable {K : ℕ} {U : Finset X} (h : IsKDecomposable F K U) :
+ ∃ P : Fin F.b → Finset (Fin K), (∀ i, (U ∩ block F i).card ≤ F.a i * (P i).card) ∧
+ ∀ e ∈ F.H, ∀ ℓ : Fin K, ∃ i ∈ e, ℓ ∉ P i := by
+ obtain ⟨parts, hgood, -, hunion⟩ := h
+ refine ⟨fun i => univ.filter (fun ℓ => (parts ℓ ∩ block F i).Nonempty), fun i => ?_, ?_⟩
+ · set S := univ.filter (fun ℓ => (parts ℓ ∩ block F i).Nonempty) with hS
+ have hU : U ∩ block F i = S.biUnion (fun ℓ => parts ℓ ∩ block F i) := by
+ ext v
+ simp only [hS, mem_inter, mem_biUnion, mem_filter, mem_univ, true_and]
+ constructor
+ · rintro ⟨hvU, hvb⟩
+ rw [← hunion, mem_biUnion] at hvU
+ obtain ⟨ℓ, -, hvℓ⟩ := hvU
+ exact ⟨ℓ, ⟨v, mem_inter.2 ⟨hvℓ, hvb⟩⟩, hvℓ, hvb⟩
+ · rintro ⟨ℓ, -, hvℓ, hvb⟩
+ refine ⟨?_, hvb⟩
+ rw [← hunion, mem_biUnion]
+ exact ⟨ℓ, mem_univ _, hvℓ⟩
+ rw [hU]
+ calc (S.biUnion (fun ℓ => parts ℓ ∩ block F i)).card
+ ≤ ∑ ℓ ∈ S, (parts ℓ ∩ block F i).card := card_biUnion_le
+ _ ≤ ∑ _ℓ ∈ S, F.a i := sum_le_sum (fun ℓ _ => (hgood ℓ).1 i)
+ _ = F.a i * S.card := by rw [sum_const, smul_eq_mul, mul_comm]
+ · intro e he ℓ
+ by_contra hcon
+ simp only [not_exists, not_and, not_not, mem_filter, mem_univ, true_and] at hcon
+ apply (hgood ℓ).2 e he
+ intro i hi
+ obtain ⟨v, hv⟩ := hcon i hi
+ rw [mem_inter] at hv
+ rw [supp, mem_image]
+ exact ⟨v, hv.1, blk_eq_of_mem_block hv.2⟩
+
+/-- The index of `v` within `U ∩ X_i` (`0` if `v` is not there). -/
+noncomputable def idxIn (F : RealizedData X) (U : Finset X) (i : Fin F.b) (v : X) : ℕ :=
+ if h : v ∈ U ∩ block F i then ((U ∩ block F i).equivFin ⟨v, h⟩).val else 0
+
+theorem idxIn_lt (F : RealizedData X) (U : Finset X) (i : Fin F.b) {v : X}
+ (hv : v ∈ U ∩ block F i) : idxIn F U i v < (U ∩ block F i).card := by
+ unfold idxIn
+ split_ifs
+ exact Fin.isLt _
+
+theorem idxIn_inj (F : RealizedData X) (U : Finset X) (i : Fin F.b) {v w : X}
+ (hv : v ∈ U ∩ block F i) (hw : w ∈ U ∩ block F i) (h : idxIn F U i v = idxIn F U i w) :
+ v = w := by
+ unfold idxIn at h
+ split_ifs at h
+ have := (U ∩ block F i).equivFin.injective (Fin.ext h)
+ exact congrArg Subtype.val this
+
+/-- The `r`-th label of `P_i`, as an `Option`. -/
+noncomputable def labOf {b K : ℕ} (P : Fin b → Finset (Fin K)) (i : Fin b) (r : ℕ) :
+ Option (Fin K) :=
+ if h : r < (P i).card then some ((P i).orderEmbOfFin rfl ⟨r, h⟩) else none
+
+theorem labOf_mem {b K : ℕ} (P : Fin b → Finset (Fin K)) (i : Fin b) (r : ℕ) (ℓ : Fin K)
+ (h : labOf P i r = some ℓ) : ℓ ∈ P i := by
+ unfold labOf at h
+ split_ifs at h with hr
+ rw [Option.some_inj] at h
+ rw [← h]
+ exact orderEmbOfFin_mem _ _ _
+
+theorem labOf_inj {b K : ℕ} (P : Fin b → Finset (Fin K)) (i : Fin b) {r r' : ℕ} {ℓ : Fin K}
+ (h : labOf P i r = some ℓ) (h' : labOf P i r' = some ℓ) : r = r' := by
+ unfold labOf at h h'
+ split_ifs at h h' with hr hr'
+ rw [Option.some_inj] at h h'
+ have := ((P i).orderEmbOfFin rfl).injective (h.trans h'.symm)
+ exact Fin.mk.inj_iff.1 this
+
+theorem labOf_isSome {b K : ℕ} (P : Fin b → Finset (Fin K)) (i : Fin b) {r : ℕ}
+ (hr : r < (P i).card) : ∃ ℓ, labOf P i r = some ℓ := by
+ unfold labOf
+ split_ifs
+ exact ⟨_, rfl⟩
+
+/-- The colour of `v`: the `(idx v / a_i)`-th label of `P_{blk v}`. -/
+noncomputable def colOf (F : RealizedData X) (U : Finset X) {K : ℕ}
+ (P : Fin F.b → Finset (Fin K)) (v : X) : Option (Fin K) :=
+ labOf P (F.blk v) (idxIn F U (F.blk v) v / F.a (F.blk v))
+
+/-- The colour class of `ℓ` inside `U`. -/
+noncomputable def partOf (F : RealizedData X) (U : Finset X) {K : ℕ}
+ (P : Fin F.b → Finset (Fin K)) (ℓ : Fin K) : Finset X :=
+ U.filter (fun v => colOf F U P v = some ℓ)
+
+theorem colOf_isSome (hF : IsRealizedFamily F) {U : Finset X} {K : ℕ}
+ {P : Fin F.b → Finset (Fin K)} (hcard : ∀ i, (U ∩ block F i).card ≤ F.a i * (P i).card)
+ {v : X} (hv : v ∈ U) : ∃ ℓ, colOf F U P v = some ℓ := by
+ apply labOf_isSome
+ have hvi : v ∈ U ∩ block F (F.blk v) := mem_inter.2 ⟨hv, mem_block_iff.2 rfl⟩
+ have h1 := idxIn_lt F U (F.blk v) hvi
+ have h2 := hcard (F.blk v)
+ have ha : 0 < F.a (F.blk v) := hF.1 (F.blk v)
+ rw [Nat.div_lt_iff_lt_mul ha]
+ calc idxIn F U (F.blk v) v < (U ∩ block F (F.blk v)).card := h1
+ _ ≤ F.a (F.blk v) * (P (F.blk v)).card := h2
+ _ = (P (F.blk v)).card * F.a (F.blk v) := mul_comm _ _
+
+theorem partOf_good (hF : IsRealizedFamily F) {U : Finset X} {K : ℕ}
+ {P : Fin F.b → Finset (Fin K)}
+ (hedge : ∀ e ∈ F.H, ∀ ℓ : Fin K, ∃ i ∈ e, ℓ ∉ P i) (ℓ : Fin K) :
+ IsGood F (partOf F U P ℓ) := by
+ refine ⟨fun i => ?_, fun e he hsub => ?_⟩
+ · by_cases hne : (partOf F U P ℓ ∩ block F i).Nonempty
+ · obtain ⟨v₀, hv₀⟩ := hne
+ have ha : 0 < F.a i := hF.1 i
+ have hr : ∀ v ∈ partOf F U P ℓ ∩ block F i,
+ idxIn F U i v / F.a i = idxIn F U i v₀ / F.a i := by
+ intro v hv
+ rw [mem_inter, partOf, mem_filter] at hv hv₀
+ have hbv := blk_eq_of_mem_block hv.2
+ have hbv₀ := blk_eq_of_mem_block hv₀.2
+ have h1 := hv.1.2
+ have h2 := hv₀.1.2
+ unfold colOf at h1 h2
+ rw [hbv] at h1
+ rw [hbv₀] at h2
+ exact labOf_inj P i h1 h2
+ calc (partOf F U P ℓ ∩ block F i).card
+ ≤ (Ico (idxIn F U i v₀ / F.a i * F.a i)
+ ((idxIn F U i v₀ / F.a i + 1) * F.a i)).card :=
+ card_le_card_of_injOn (idxIn F U i) ?_ ?_
+ _ = F.a i := by rw [Nat.card_Ico, add_mul, one_mul, Nat.add_sub_cancel_left]
+ · intro v hv
+ rw [mem_coe] at hv
+ have hr' := hr v hv
+ rw [mem_coe, mem_Ico]
+ constructor
+ · exact (Nat.le_div_iff_mul_le ha).1 hr'.ge
+ · have : idxIn F U i v / F.a i < idxIn F U i v₀ / F.a i + 1 := by
+ rw [hr']
+ exact Nat.lt_succ_self _
+ exact (Nat.div_lt_iff_lt_mul ha).1 this
+ · intro v hv w hw hvw
+ rw [mem_coe, mem_inter, partOf, mem_filter] at hv hw
+ exact idxIn_inj F U i (mem_inter.2 ⟨hv.1.1, hv.2⟩) (mem_inter.2 ⟨hw.1.1, hw.2⟩) hvw
+ · rw [not_nonempty_iff_eq_empty] at hne
+ rw [hne, card_empty]
+ exact Nat.zero_le _
+ · obtain ⟨i, hi, hni⟩ := hedge e he ℓ
+ have := hsub hi
+ rw [supp, mem_image] at this
+ obtain ⟨v, hv, hbv⟩ := this
+ rw [partOf, mem_filter] at hv
+ have h1 := hv.2
+ unfold colOf at h1
+ rw [hbv] at h1
+ exact hni (labOf_mem P i _ ℓ h1)
+
+theorem partOf_disjoint (F : RealizedData X) (U : Finset X) {K : ℕ}
+ (P : Fin F.b → Finset (Fin K)) {ℓ ℓ' : Fin K} (h : ℓ ≠ ℓ') :
+ Disjoint (partOf F U P ℓ) (partOf F U P ℓ') := by
+ rw [disjoint_left]
+ intro v hv hv'
+ rw [partOf, mem_filter] at hv hv'
+ apply h
+ rw [← Option.some_inj, ← hv.2, ← hv'.2]
+
+theorem biUnion_partOf (hF : IsRealizedFamily F) {U : Finset X} {K : ℕ}
+ {P : Fin F.b → Finset (Fin K)} (hcard : ∀ i, (U ∩ block F i).card ≤ F.a i * (P i).card) :
+ (univ : Finset (Fin K)).biUnion (partOf F U P) = U := by
+ ext v
+ rw [mem_biUnion]
+ constructor
+ · rintro ⟨ℓ, -, hv⟩
+ exact (mem_filter.1 hv).1
+ · intro hv
+ obtain ⟨ℓ, hℓ⟩ := colOf_isSome hF hcard hv
+ exact ⟨ℓ, mem_univ _, mem_filter.2 ⟨hv, hℓ⟩⟩
+
+/-- A palette with `|U ∩ X_i| ≤ a_i |P_i|` yields a `K`-decomposition of `U`. -/
+theorem decomposable_of_palette (hF : IsRealizedFamily F) {K : ℕ} {U : Finset X}
+ (P : Fin F.b → Finset (Fin K)) (hcard : ∀ i, (U ∩ block F i).card ≤ F.a i * (P i).card)
+ (hedge : ∀ e ∈ F.H, ∀ ℓ : Fin K, ∃ i ∈ e, ℓ ∉ P i) : IsKDecomposable F K U :=
+ ⟨partOf F U P, fun ℓ => partOf_good hF hedge ℓ, fun _ _ h => partOf_disjoint F U P h,
+ biUnion_partOf hF hcard⟩
+
+omit [DecidableEq X] in
+/-- Blocks are pairwise disjoint. -/
+theorem block_disjoint (F : RealizedData X) {i j : Fin F.b} (h : i ≠ j) :
+ Disjoint (block F i) (block F j) := by
+ rw [disjoint_left]
+ intro v hv hv'
+ exact h ((blk_eq_of_mem_block hv).symm.trans (blk_eq_of_mem_block hv'))
+
+/-- Section 3: `I_k(D_i) = {S : |S| ≤ a_i k}`, in expanded form. -/
+theorem localDecomposability_expanded (hF : IsRealizedFamily F) (i : Fin F.b) (k : ℕ)
+ (S : Finset X) (hS : S ⊆ block F i) : IsKDecomposable F k S ↔ S.card ≤ F.a i * k := by
+ constructor
+ · intro h
+ obtain ⟨P, hcard, -⟩ := palette_of_decomposable h
+ have := hcard i
+ rw [inter_eq_left.2 hS] at this
+ exact this.trans (Nat.mul_le_mul_left _ (card_finset_fin_le _))
+ · intro h
+ classical
+ apply decomposable_of_palette hF (fun j => if j = i then univ else ∅)
+ · intro j
+ by_cases hj : j = i
+ · subst hj
+ rw [inter_eq_left.2 hS, ite_eq_left rfl, card_univ, Fintype.card_fin]
+ exact h
+ · rw [ite_eq_right hj]
+ have : S ∩ block F j = ∅ := by
+ rw [← disjoint_iff_inter_eq_empty]
+ exact (block_disjoint F (Ne.symm hj)).mono_left hS
+ rw [this, card_empty, card_empty]
+ exact Nat.zero_le _
+ · intro e he ℓ
+ have h2 := hF.2.2.2.1 e he
+ obtain ⟨j, hj, hji⟩ := exists_mem_ne (by omega : 1 < e.card) i
+ refine ⟨j, hj, ?_⟩
+ rw [ite_eq_right hji]
+ exact notMem_empty _
+
+end Decomp
+
+
+/-! ### Minimal forbidden sets -/
+
+section MinForb
+
+variable {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}
+
+omit [Fintype X] [DecidableEq X] in
+theorem mem_supp_iff {U : Finset X} {i : Fin F.b} : i ∈ supp F U ↔ ∃ v ∈ U, F.blk v = i := by
+ rw [supp, mem_image]
+
+/-- A subset of one block with at most `a_i` elements is good. -/
+theorem good_of_subset_block (hF : IsRealizedFamily F) {i : Fin F.b} {S : Finset X}
+ (hS : S ⊆ block F i) (hcard : S.card ≤ F.a i) : IsGood F S := by
+ refine ⟨fun j => ?_, fun e he hsub => ?_⟩
+ · by_cases hj : j = i
+ · subst hj
+ rw [inter_eq_left.2 hS]
+ exact hcard
+ · have : S ∩ block F j = ∅ := by
+ rw [← disjoint_iff_inter_eq_empty]
+ exact (block_disjoint F (Ne.symm hj)).mono_left hS
+ rw [this, card_empty]
+ exact Nat.zero_le _
+ · have hsupp : supp F S ⊆ {i} := by
+ intro j hj
+ obtain ⟨v, hv, rfl⟩ := mem_supp_iff.1 hj
+ rw [mem_singleton]
+ exact blk_eq_of_mem_block (hS hv)
+ have h1 := card_le_card (hsub.trans hsupp)
+ have h2 := hF.2.2.2.1 e he
+ rw [card_singleton] at h1
+ omega
+
+/-- Removing an element outside `X_i` does not change the intersection with `X_i`. -/
+theorem erase_inter_block_of_blk_ne {U : Finset X} {v : X} {i : Fin F.b} (h : F.blk v ≠ i) :
+ U.erase v ∩ block F i = U ∩ block F i := by
+ ext w
+ simp only [mem_inter, mem_erase, mem_block_iff]
+ constructor
+ · rintro ⟨⟨-, hw⟩, hb⟩
+ exact ⟨hw, hb⟩
+ · rintro ⟨hw, hb⟩
+ refine ⟨⟨fun hwv => h (hwv ▸ hb), hw⟩, hb⟩
+
+/-- Proposition P1 in expanded form. -/
+theorem minimalForbidden_iff (hF : IsRealizedFamily F) (U : Finset X) :
+ IsMinimalForbidden F U ↔
+ ((∃ i, U ⊆ block F i ∧ U.card = F.a i + 1) ∨ ∃ e ∈ F.H, IsTransversal F e U) := by
+ constructor
+ · rintro ⟨hbad, hmin⟩
+ by_cases hcap : ∃ i, F.a i < (U ∩ block F i).card
+ · obtain ⟨i, hi⟩ := hcap
+ left
+ have hsub : U ⊆ block F i := by
+ intro v hv
+ by_contra hvb
+ have hne : F.blk v ≠ i := fun h => hvb (mem_block_iff.2 h)
+ have := (hmin v hv).1 i
+ rw [erase_inter_block_of_blk_ne hne] at this
+ omega
+ refine ⟨i, hsub, ?_⟩
+ rw [inter_eq_left.2 hsub] at hi
+ by_contra hne
+ have hgt : F.a i + 1 < U.card := by omega
+ obtain ⟨v, hv⟩ : U.Nonempty := card_pos.1 (by omega)
+ have := (hmin v hv).1 i
+ rw [inter_eq_left.2 ((erase_subset _ _).trans hsub), card_erase_of_mem hv] at this
+ omega
+ · right
+ have hcap' : ∀ i, (U ∩ block F i).card ≤ F.a i := by
+ intro i
+ by_contra h
+ exact hcap ⟨i, by omega⟩
+ have hex : ¬ ∀ e ∈ F.H, ¬ e ⊆ supp F U := fun hB => hbad ⟨hcap', hB⟩
+ simp only [not_forall, not_not] at hex
+ obtain ⟨e, he, hsub⟩ := hex
+ -- every element of `U` is alone in its block, and its block lies in `e`
+ have key : ∀ v ∈ U, F.blk v ∈ e ∧ ∀ w ∈ U, F.blk w = F.blk v → w = v := by
+ intro v hv
+ have hgood := (hmin v hv).2 e he
+ have : ∃ i ∈ e, i ∉ supp F (U.erase v) := by
+ by_contra hall
+ simp only [not_exists, not_and, not_not] at hall
+ exact hgood (fun i hi => hall i hi)
+ obtain ⟨i, hi, hni⟩ := this
+ obtain ⟨w, hw, hwi⟩ := mem_supp_iff.1 (hsub hi)
+ have hwv : w = v := by
+ by_contra hwv
+ exact hni (mem_supp_iff.2 ⟨w, mem_erase.2 ⟨hwv, hw⟩, hwi⟩)
+ subst hwv
+ refine ⟨hwi ▸ hi, fun u hu hub => ?_⟩
+ by_contra huw
+ exact hni (mem_supp_iff.2 ⟨u, mem_erase.2 ⟨huw, hu⟩, hub.trans hwi⟩)
+ refine ⟨e, he, ?_, fun i hi => ?_⟩
+ · apply Subset.antisymm
+ · intro i hi
+ obtain ⟨v, hv, rfl⟩ := mem_supp_iff.1 hi
+ exact (key v hv).1
+ · exact hsub
+ · obtain ⟨v, hv, hvi⟩ := mem_supp_iff.1 (hsub hi)
+ rw [card_eq_one]
+ refine ⟨v, ?_⟩
+ ext w
+ simp only [mem_inter, mem_block_iff, mem_singleton]
+ constructor
+ · rintro ⟨hw, hwi⟩
+ exact (key v hv).2 w hw (hwi.trans hvi.symm)
+ · rintro rfl
+ exact ⟨hv, hvi⟩
+ · rintro (⟨i, hU, hcard⟩ | ⟨e, he, hsupp, hone⟩)
+ · refine ⟨fun hg => ?_, fun v hv => ?_⟩
+ · have := hg.1 i
+ rw [inter_eq_left.2 hU] at this
+ omega
+ · apply good_of_subset_block hF ((erase_subset _ _).trans hU)
+ rw [card_erase_of_mem hv, hcard]
+ exact Nat.le_refl _
+ · refine ⟨fun hg => hg.2 e he (by rw [hsupp]), fun v hv => ⟨fun i => ?_, fun f hf hsub => ?_⟩⟩
+ · refine (card_le_card (inter_subset_inter_right (erase_subset v U))).trans ?_
+ by_cases hi : i ∈ e
+ · rw [hone i hi]
+ exact hF.1 i
+ · have : U ∩ block F i = ∅ := by
+ rw [eq_empty_iff_forall_notMem]
+ intro w hw
+ rw [mem_inter, mem_block_iff] at hw
+ exact hi (hsupp ▸ mem_supp_iff.2 ⟨w, hw.1, hw.2⟩)
+ rw [this, card_empty]
+ exact Nat.zero_le _
+ · have hbv : F.blk v ∈ e := hsupp ▸ mem_supp_iff.2 ⟨v, hv, rfl⟩
+ have hsub' : supp F (U.erase v) ⊆ e.erase (F.blk v) := by
+ intro j hj
+ obtain ⟨w, hw, rfl⟩ := mem_supp_iff.1 hj
+ rw [mem_erase] at hw
+ rw [mem_erase]
+ refine ⟨fun hwv => hw.1 ?_, hsupp ▸ mem_supp_iff.2 ⟨w, hw.2, rfl⟩⟩
+ have hle : (U ∩ block F (F.blk v)).card ≤ 1 := by rw [hone (F.blk v) hbv]
+ rw [card_le_one] at hle
+ exact hle w (mem_inter.2 ⟨hw.2, mem_block_iff.2 hwv⟩) v
+ (mem_inter.2 ⟨hv, mem_block_iff.2 rfl⟩)
+ have hfe : f ⊆ e := hsub.trans (hsub'.trans (erase_subset _ _))
+ have := hF.2.2.2.2 f hf e he hfe
+ subst this
+ exact notMem_erase (F.blk v) f (hsub'.trans' hsub hbv)
+
+end MinForb
+
+
+/-! ### Counting the minimal forbidden sets of the six-block benchmark -/
+
+section Count816
+
+/-- Proposition P1 for the six-block data (`a_i = 1`). -/
+theorem minForb816_iff (U : Finset (Fin 6 × Fin 409)) :
+ IsMinimalForbidden benchmark816 U ↔
+ ((∃ i, U ⊆ block benchmark816 i ∧ U.card = 2) ∨
+ ∃ e ∈ benchmark816.H, IsTransversal benchmark816 e U) :=
+ minimalForbidden_iff benchmark816_isRealized U
+
+theorem supp_eq_singleton_of_pair {U : Finset (Fin 6 × Fin 409)} {i : Fin benchmark816.b}
+ (hU : U ⊆ block benchmark816 i) (hcard : U.card = 2) : supp benchmark816 U = {i} := by
+ apply Subset.antisymm
+ · intro j hj
+ obtain ⟨v, hv, rfl⟩ := mem_supp_iff.1 hj
+ rw [mem_singleton]
+ exact blk_eq_of_mem_block (hU hv)
+ · intro j hj
+ rw [mem_singleton] at hj
+ subst hj
+ obtain ⟨v, hv⟩ : U.Nonempty := card_pos.1 (by omega)
+ exact mem_supp_iff.2 ⟨v, hv, blk_eq_of_mem_block (hU hv)⟩
+
+/-- The pairs inside a single block. -/
+def pairs816 : Finset (Finset (Fin 6 × Fin 409)) :=
+ (univ : Finset (Fin benchmark816.b)).biUnion (fun i => (block benchmark816 i).powersetCard 2)
+
+theorem mem_pairs816 {U : Finset (Fin 6 × Fin 409)} :
+ U ∈ pairs816 ↔ ∃ i, U ⊆ block benchmark816 i ∧ U.card = 2 := by
+ simp only [pairs816, mem_biUnion, mem_univ, true_and, mem_powersetCard]
+
+theorem card_pairs816 : pairs816.card = 6 * Nat.choose 409 2 := by
+ unfold pairs816
+ rw [card_biUnion]
+ · have h : ∀ i : Fin benchmark816.b,
+ ((block benchmark816 i).powersetCard 2).card = Nat.choose 409 2 := fun i => by
+ rw [card_powersetCard, card_block_benchmark816 i]
+ rw [Finset.sum_congr rfl (fun i _ => h i), sum_const, card_univ, Fintype.card_fin]
+ have hb : benchmark816.b = 6 := rfl
+ rw [hb, smul_eq_mul]
+ · intro i _ j _ hij
+ rw [Function.onFun, disjoint_left]
+ intro U hUi hUj
+ rw [mem_powersetCard] at hUi hUj
+ obtain ⟨v, hv⟩ : U.Nonempty := card_pos.1 (by omega)
+ exact hij ((blk_eq_of_mem_block (hUi.1 hv)).symm.trans (blk_eq_of_mem_block (hUj.1 hv)))
+
+end Count816
+
+section Transversals
+
+variable {ι β : Type} [Fintype ι] [DecidableEq ι] [Fintype β] [DecidableEq β]
+
+/-- The candidate transversals of `e` in a product ground type: the images of `e` under
+`i ↦ (σ i, g i)` for `g` ranging over a product set (`b₀` is a dummy value off `e`). -/
+def transOf (F : RealizedData (ι × β)) (σ : Fin F.b → ι) (b₀ : β) (e : Finset (Fin F.b)) :
+ Finset (Finset (ι × β)) :=
+ (Fintype.piFinset (fun i : Fin F.b => if i ∈ e then (univ : Finset β) else {b₀})).image
+ (fun g => e.image (fun i => (σ i, g i)))
+
+omit [Fintype ι] [DecidableEq ι] [Fintype β] [DecidableEq β] in
+theorem sigma_injective {F : RealizedData (ι × β)} {σ : Fin F.b → ι} (b₀ : β)
+ (hσ : ∀ (v : ι × β) (i : Fin F.b), F.blk v = i ↔ v.1 = σ i) : Function.Injective σ := by
+ intro i j h
+ have hi : F.blk (σ i, b₀) = i := (hσ _ _).2 rfl
+ have hj : F.blk (σ i, b₀) = j := (hσ _ _).2 h
+ exact hi.symm.trans hj
+
+theorem mem_transOf {F : RealizedData (ι × β)} {σ : Fin F.b → ι} {b₀ : β}
+ (hσ : ∀ (v : ι × β) (i : Fin F.b), F.blk v = i ↔ v.1 = σ i) (e : Finset (Fin F.b))
+ (U : Finset (ι × β)) : U ∈ transOf F σ b₀ e ↔ IsTransversal F e U := by
+ have hinj := sigma_injective b₀ hσ
+ constructor
+ · intro hU
+ rw [transOf, mem_image] at hU
+ obtain ⟨g, -, rfl⟩ := hU
+ refine ⟨?_, fun i hi => ?_⟩
+ · ext j
+ rw [mem_supp_iff]
+ constructor
+ · rintro ⟨v, hv, hvj⟩
+ rw [mem_image] at hv
+ obtain ⟨i, hi, rfl⟩ := hv
+ rw [hσ] at hvj
+ exact hinj hvj ▸ hi
+ · intro hj
+ exact ⟨(σ j, g j), mem_image.2 ⟨j, hj, rfl⟩, (hσ _ _).2 rfl⟩
+ · rw [card_eq_one]
+ refine ⟨(σ i, g i), ?_⟩
+ ext v
+ rw [mem_inter, mem_block_iff, mem_singleton, mem_image]
+ constructor
+ · rintro ⟨⟨j, hj, rfl⟩, hji⟩
+ rw [hσ] at hji
+ have := hinj hji
+ subst this
+ rfl
+ · rintro rfl
+ exact ⟨⟨i, hi, rfl⟩, (hσ _ _).2 rfl⟩
+ · rintro ⟨hsupp, hone⟩
+ classical
+ rw [transOf, mem_image]
+ let g : Fin F.b → β := fun i => if h : ∃ y, (σ i, y) ∈ U then Classical.choose h else b₀
+ have hg : ∀ i ∈ e, (σ i, g i) ∈ U := by
+ intro i hi
+ obtain ⟨v, hv, hvi⟩ := mem_supp_iff.1 (hsupp ▸ hi)
+ rw [hσ] at hvi
+ have hex : ∃ y, (σ i, y) ∈ U := ⟨v.2, by rw [← hvi]; exact hv⟩
+ show (σ i, if h : ∃ y, (σ i, y) ∈ U then Classical.choose h else b₀) ∈ U
+ rw [dite_eq_left hex]
+ exact Classical.choose_spec hex
+ refine ⟨g, ?_, ?_⟩
+ · rw [Fintype.mem_piFinset]
+ intro i
+ by_cases hi : i ∈ e
+ · rw [ite_eq_left hi]
+ exact mem_univ _
+ · rw [ite_eq_right hi, mem_singleton]
+ have hex : ¬ ∃ y, (σ i, y) ∈ U := by
+ rintro ⟨y, hy⟩
+ exact hi (hsupp ▸ mem_supp_iff.2 ⟨(σ i, y), hy, (hσ _ _).2 rfl⟩)
+ show (if h : ∃ y, (σ i, y) ∈ U then Classical.choose h else b₀) = b₀
+ rw [dite_eq_right hex]
+ · apply Subset.antisymm
+ · intro v hv
+ rw [mem_image] at hv
+ obtain ⟨i, hi, rfl⟩ := hv
+ exact hg i hi
+ · intro v hv
+ have hv1 : F.blk v ∈ e := hsupp ▸ mem_supp_iff.2 ⟨v, hv, rfl⟩
+ have hle : (U ∩ block F (F.blk v)).card ≤ 1 := by rw [hone _ hv1]
+ rw [card_le_one] at hle
+ have := hle v (mem_inter.2 ⟨hv, mem_block_iff.2 rfl⟩) (σ (F.blk v), g (F.blk v))
+ (mem_inter.2 ⟨hg _ hv1, mem_block_iff.2 ((hσ _ _).2 rfl)⟩)
+ rw [mem_image]
+ exact ⟨F.blk v, hv1, this.symm⟩
+
+omit [Fintype ι] in
+theorem card_transOf {F : RealizedData (ι × β)} {σ : Fin F.b → ι} {b₀ : β}
+ (hσ : ∀ (v : ι × β) (i : Fin F.b), F.blk v = i ↔ v.1 = σ i) (e : Finset (Fin F.b)) :
+ (transOf F σ b₀ e).card = Fintype.card β ^ e.card := by
+ have hinj := sigma_injective b₀ hσ
+ unfold transOf
+ rw [card_image_of_injOn]
+ · rw [Fintype.card_piFinset]
+ have h : ∀ i : Fin F.b,
+ (if i ∈ e then (univ : Finset β) else {b₀}).card = if i ∈ e then Fintype.card β else 1 := by
+ intro i
+ split_ifs
+ · rw [card_univ]
+ · rw [card_singleton]
+ rw [Finset.prod_congr rfl (fun i _ => h i), prod_ite_mem, univ_inter, prod_const]
+ · intro g hg g' hg' hgg'
+ rw [mem_coe, Fintype.mem_piFinset] at hg hg'
+ have hgg'' : e.image (fun i => (σ i, g i)) = e.image (fun i => (σ i, g' i)) := hgg'
+ funext i
+ by_cases hi : i ∈ e
+ · have : (σ i, g i) ∈ e.image (fun i => (σ i, g' i)) := by
+ rw [← hgg'', mem_image]
+ exact ⟨i, hi, rfl⟩
+ rw [mem_image] at this
+ obtain ⟨j, -, hj⟩ := this
+ have h1 := congrArg Prod.fst hj
+ have h2 := congrArg Prod.snd hj
+ simp only at h1 h2
+ have := hinj h1
+ subst this
+ exact h2.symm
+ · have h1 := hg i
+ have h2 := hg' i
+ rw [ite_eq_right hi, mem_singleton] at h1 h2
+ rw [h1, h2]
+
+end Transversals
+
+section Count816b
+
+/-- The index map of the six-block benchmark is the identity (definitionally). -/
+theorem hσ816 : ∀ (v : Fin 6 × Fin 409) (i : Fin benchmark816.b),
+ benchmark816.blk v = i ↔ v.1 = (fun i => i : Fin benchmark816.b → Fin 6) i :=
+ fun _ _ => Iff.rfl
+
+/-- All transversals of all edges. -/
+def transAll816 : Finset (Finset (Fin 6 × Fin 409)) :=
+ benchmark816.H.biUnion (transOf benchmark816 (fun i => i) 0)
+
+theorem mem_transAll816 {U : Finset (Fin 6 × Fin 409)} :
+ U ∈ transAll816 ↔ ∃ e ∈ benchmark816.H, IsTransversal benchmark816 e U := by
+ simp only [transAll816, mem_biUnion, mem_transOf hσ816]
+
+theorem card_H816 : benchmark816.H.card = 15 := by
+ change (completeClutter 6 3).card = 15
+ rw [completeClutter, card_powersetCard, card_univ, Fintype.card_fin]
+ rfl
+
+theorem card_transAll816 : transAll816.card = 15 * 409 ^ 4 := by
+ unfold transAll816
+ rw [card_biUnion]
+ · have h : ∀ e ∈ benchmark816.H, (transOf benchmark816 (fun i => i) 0 e).card = 409 ^ 4 :=
+ fun e he => by rw [card_transOf hσ816, Fintype.card_fin, mem_H_benchmark816 he]
+ rw [Finset.sum_congr rfl h, sum_const, card_H816, smul_eq_mul]
+ · intro e _ e' _ hee'
+ rw [Function.onFun, disjoint_left]
+ intro U hU hU'
+ rw [mem_transOf hσ816] at hU hU'
+ exact hee' (hU.1.symm.trans hU'.1)
+
+-- The style linter `constructorNameAsVariable` (variable names shadowing constructor names)
+-- exhausts the recursion limit on this local context; it is a naming linter, not a check.
+set_option linter.constructorNameAsVariable false in
+theorem disjoint_pairs816_transAll816 : Disjoint pairs816 transAll816 := by
+ rw [disjoint_left]
+ intro U hU hU'
+ rw [mem_pairs816] at hU
+ rw [mem_transAll816] at hU'
+ obtain ⟨i, hUi, hcard⟩ := hU
+ obtain ⟨e, he, hsupp, -⟩ := hU'
+ have h1 := supp_eq_singleton_of_pair hUi hcard
+ have h2 := mem_H_benchmark816 he
+ rw [hsupp] at h1
+ rw [h1, card_singleton] at h2
+ exact absurd h2 (by norm_num)
+
+theorem minForbSet_eq :
+ {U : Finset (Fin 6 × Fin 409) | IsMinimalForbidden benchmark816 U} =
+ ↑(pairs816 ∪ transAll816) := by
+ ext U
+ simp only [Set.mem_ofPred_eq, coe_union, Set.mem_union, mem_coe, mem_pairs816, mem_transAll816]
+ exact minForb816_iff U
+
+theorem minForbSet1_eq :
+ {U : Finset (Fin 6 × Fin 409) |
+ IsMinimalForbidden benchmark816 U ∧ (supp benchmark816 U).card = 1} = ↑pairs816 := by
+ ext U
+ simp only [Set.mem_ofPred_eq, mem_coe, mem_pairs816, minForb816_iff]
+ constructor
+ · rintro ⟨h | ⟨e, he, hsupp, -⟩, hcard⟩
+ · exact h
+ · exfalso
+ rw [hsupp, mem_H_benchmark816 he] at hcard
+ omega
+ · rintro ⟨i, hUi, hcard⟩
+ refine ⟨Or.inl ⟨i, hUi, hcard⟩, ?_⟩
+ rw [supp_eq_singleton_of_pair hUi hcard, card_singleton]
+
+theorem minForbSet4_eq :
+ {U : Finset (Fin 6 × Fin 409) |
+ IsMinimalForbidden benchmark816 U ∧ (supp benchmark816 U).card = 4} = ↑transAll816 := by
+ ext U
+ simp only [Set.mem_ofPred_eq, mem_coe, mem_transAll816, minForb816_iff]
+ constructor
+ · rintro ⟨⟨i, hUi, hcard⟩ | h, hcard4⟩
+ · exfalso
+ rw [supp_eq_singleton_of_pair hUi hcard, card_singleton] at hcard4
+ omega
+ · exact h
+ · rintro ⟨e, he, hsupp, hone⟩
+ refine ⟨Or.inr ⟨e, he, hsupp, hone⟩, ?_⟩
+ rw [hsupp, mem_H_benchmark816 he]
+
+end Count816b
+
+end Aux
+
+/-- Proves: `UniversalLaw.Spec.P15.Benchmark816IsRealized` (claim `p15-realized-covers`, Section 6
+of P15_REALIZED_COVERS.md: six blocks of `409` coordinates with `a_i = 1`, `d_i = 408`, `H` all
+four-block subsets).
+Method: block cardinality `1 * 409 = 409` via the product decomposition of the fibre; clutter
+property of `powersetCard 4` by `eq_of_subset_of_card_le`.
+Does not establish: anything about the informal six-block realization beyond this data record
+satisfying the formal side conditions; no review, acceptance or alignment. -/
+theorem benchmark816IsRealized : UniversalLaw.Spec.P15.Benchmark816IsRealized :=
+ Aux.benchmark816_isRealized
+
+/-- Proves: `UniversalLaw.Spec.P15.Benchmark816Price` (claim `p15-realized-covers`, Section 6:
+"6/(40900^409)>0").
+Method: the full-block family is the image of the injective block map, so its price is the sum
+of six block prices `(1/40900)^409`.
+Does not establish: that this cover is optimal or that it covers the obstruction
+(`Benchmark816Cover` is a separate `Prop`); no review or acceptance. -/
+theorem benchmark816Price : UniversalLaw.Spec.P15.Benchmark816Price := by
+ refine ⟨?_, by positivity⟩
+ rw [Aux.famPrice_const_benchmark816, one_div, div_eq_mul_inv, ← inv_pow]
+
+/-- Proves: `UniversalLaw.Spec.P15.Benchmark816RationalPrice` (claim `p15-price-budget-restricted`,
+display (T7) and the explicit rational price of Section 4 of price_budget PROOF.md).
+Method: `log x ≤ x - 1` for the upper bound; Mathlib's Taylor estimate
+`Real.abs_log_sub_add_sum_range_le` with three terms for `p + p^2/2 < -log(1 - p)`; exact
+rational arithmetic by `norm_num`; the full-block price as six equal block prices.
+Does not establish: the (T1) budget itself, admissibility of any other price vector, or the
+informal claim; no review or acceptance. -/
+theorem benchmark816RationalPrice : UniversalLaw.Spec.P15.Benchmark816RationalPrice := by
+ refine ⟨?_, by norm_num, ?_, ?_⟩
+ · have hpos : (0 : ℝ) < 40900 / 40899 := by norm_num
+ have hlog_le : Real.log (40900 / 40899) ≤ 1 / 40899 := by
+ have := Real.log_le_sub_one_of_pos hpos
+ linarith
+ have hlog_nn : 0 ≤ Real.log (40900 / 40899) := Real.log_nonneg (by norm_num)
+ have hpow := pow_le_pow_left₀ hlog_nn hlog_le 409
+ calc 6 * Real.log (40900 / 40899) ^ 409 ≤ 6 * (1 / 40899 : ℝ) ^ 409 :=
+ mul_le_mul_of_nonneg_left hpow (by norm_num)
+ _ = 6 / 40899 ^ 409 := by rw [one_div, div_eq_mul_inv, ← inv_pow]
+ · unfold phi
+ split_ifs with h
+ · apply lt_min (by norm_num)
+ have := Aux.neg_log_one_sub_gt (1 / 40900) (by norm_num) (by norm_num)
+ linarith
+ · exfalso
+ exact h (by norm_num)
+ · exact Aux.famPrice_const_benchmark816 _
+
+/-- Proves: `UniversalLaw.Spec.P15.ElementaryPaletteFormula` (claim `p15-realized-covers`, display
+(P9) of P15_REALIZED_COVERS.md: for `H` all `(s+1)`-subsets, `K_H(d) = max(max_i d_i,
+ceil(sum_i d_i / s))`).
+Method: for the complete clutter the edge condition says each label lies in at most `s` label
+sets; double counting gives the two necessary conditions `d_i ≤ K` and `sum d_i ≤ s K`; the
+cyclic palette (block `i` takes positions `c_i, …, c_i + d_i - 1` reduced modulo `K`) realizes
+them; `IsLeast.csInf_eq` identifies `sInf`.
+Does not establish: the matroid palette formula of Section 5, anything about non-complete
+clutters, or the informal claim; the hypotheses `s ≤ b` and `1 ≤ d_i` of the `Prop` are not
+needed by this proof and are simply carried; no review or acceptance. -/
+theorem elementaryPaletteFormula : UniversalLaw.Spec.P15.ElementaryPaletteFormula :=
+ fun b s d hs _ _ => Aux.paletteNumber_completeClutter b s d hs
+
+/-- Proves: `UniversalLaw.Spec.P15.TriangleNeedsThree` (claim `p15-realized-covers`, Section 5:
+the triangle at unit demands needs `3` colors).
+Method: the complete-clutter formula at `b = 3`, `s = 1`, `d = 1`: `max 1 ⌈3/1⌉₊ = 3`.
+Does not establish: the informal remark about "size-two edge loads"; no review or acceptance. -/
+theorem triangleNeedsThree : UniversalLaw.Spec.P15.TriangleNeedsThree := by
+ unfold UniversalLaw.Spec.P15.TriangleNeedsThree
+ rw [Aux.paletteNumber_completeClutter 3 1 (fun _ => 1) le_rfl]
+ rw [sup_const univ_nonempty, sum_const, card_univ, Fintype.card_fin, smul_eq_mul]
+ norm_num
+
+/-- Proves: `UniversalLaw.Spec.P15.Benchmark816Palette` (claim `p15-realized-covers`, Section 6:
+`K_H(408,...,408) = 816`).
+Method: the complete-clutter formula at `b = 6`, `s = 3`, `d = 408`: `max 408 ⌈2448/3⌉₊ = 816`.
+Does not establish: that the full blocks cover the obstruction (`Benchmark816Cover`), or the
+informal claim; no review or acceptance. -/
+theorem benchmark816Palette : UniversalLaw.Spec.P15.Benchmark816Palette := by
+ unfold UniversalLaw.Spec.P15.Benchmark816Palette
+ rw [Aux.paletteNumber_completeClutter 6 3 (fun _ => 408) (by norm_num)]
+ rw [sup_const univ_nonempty, sum_const, card_univ, Fintype.card_fin, smul_eq_mul]
+ norm_num
+
+/-- Proves: `UniversalLaw.Spec.P15.LocalDecomposability` (claim `p15-realized-covers`, Section 3 of
+P15_REALIZED_COVERS.md: `I_k(D_i) = {S : |S| <= a_i k}`).
+Method: a decomposition of `S ⊆ X_i` into `k` good parts has parts of size `≤ a_i`; conversely
+the chunks of size `≤ a_i` of an enumeration of `S` are good (one block, support of size `≤ 1`
+contains no edge of size `≥ 2`), via the general palette/decomposition correspondence.
+Does not establish: the informal claim or its review; alignment of `IsKDecomposable` with the
+informal `I_k`. -/
+theorem localDecomposability {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.LocalDecomposability F :=
+ fun hF i k S hS => Aux.localDecomposability_expanded hF i k S hS
+
+/-- Proves: `UniversalLaw.Spec.P15.LocalObstructionIsFullBlock` (claim `p15-realized-covers`,
+display (P3): the only `d_i`-obstructed subset of `X_i` is `X_i`).
+Method: `LocalDecomposability` at `k = d_i` and `|X_i| = a_i d_i + 1`.
+Does not establish: the informal claim or its review. -/
+theorem localObstructionIsFullBlock {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.LocalObstructionIsFullBlock F := by
+ intro hF i S hS
+ rw [Aux.localDecomposability_expanded hF i (F.d i) S hS, not_le]
+ have hcard := hF.2.2.1 i
+ constructor
+ · intro h
+ exact eq_of_subset_of_card_le hS (by omega)
+ · intro h
+ rw [h, hcard]
+ exact Nat.lt_succ_self _
+
+/-- Proves: `UniversalLaw.Spec.P15.FullBlockCoverIff` (claim `p15-realized-covers`, Proposition
+P2, display (P7): the family of full blocks covers `O_K(D)` iff `K >= K_H(d)`).
+Method: a set containing no full block has `|U ∩ X_i| ≤ a_i d_i`, so a palette for `d` at `K`
+colours it; conversely the set missing one chosen vertex per block is `K`-decomposable, and the
+parts meeting each block form a feasible palette, so `K_H(d) ≤ K`. Attainment of `K_H(d)` and
+upward closure of feasibility are proved via disjoint label intervals.
+Does not establish: optimality of other covers, the unrestricted prize, the informal claim or
+its review (disposition transcribed in the statement: HOLD_WITH_DOMAIN). -/
+theorem fullBlockCoverIff {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.FullBlockCoverIff F := by
+ intro hF K
+ have hH : ∀ e ∈ F.H, 2 ≤ e.card := hF.2.2.2.1
+ constructor
+ · intro hcover
+ classical
+ -- one chosen vertex per block
+ let pick : Fin F.b → X := fun i => (Aux.block_nonempty hF i).choose
+ have hpick : ∀ i, pick i ∈ block F i := fun i => (Aux.block_nonempty hF i).choose_spec
+ let U : Finset X := univ.filter (fun v => v ≠ pick (F.blk v))
+ have hUdec : IsKDecomposable F K U := by
+ by_contra hobs
+ obtain ⟨g, hg, hgU⟩ := hcover U hobs
+ rw [fullBlockFamily, mem_image] at hg
+ obtain ⟨i, -, rfl⟩ := hg
+ have := hgU (hpick i)
+ simp only [U, mem_filter, mem_univ, true_and] at this
+ exact this (by rw [Aux.blk_eq_of_mem_block (hpick i)])
+ obtain ⟨P, hcard, hedge⟩ := Aux.palette_of_decomposable hUdec
+ apply Aux.paletteNumber_le_of_feasible
+ refine ⟨P, fun i => ?_, hedge⟩
+ have h1 := hcard i
+ have h2 : U ∩ block F i = (block F i).erase (pick i) := by
+ ext v
+ simp only [U, mem_inter, mem_filter, mem_univ, true_and, mem_erase]
+ constructor
+ · rintro ⟨hne, hv⟩
+ exact ⟨by rwa [Aux.blk_eq_of_mem_block hv] at hne, hv⟩
+ · rintro ⟨hne, hv⟩
+ exact ⟨by rwa [Aux.blk_eq_of_mem_block hv], hv⟩
+ rw [h2, card_erase_of_mem (hpick i), hF.2.2.1 i, Nat.add_sub_cancel] at h1
+ exact Nat.le_of_mul_le_mul_left h1 (hF.1 i)
+ · intro hK U hU
+ obtain ⟨P, hPd, hPe⟩ := Aux.isPaletteFeasible_of_paletteNumber_le F.H F.d hH hK
+ by_contra hnone
+ simp only [not_exists, not_and] at hnone
+ apply hU
+ apply Aux.decomposable_of_palette hF P _ hPe
+ intro i
+ have hsub : U ∩ block F i ⊆ block F i := inter_subset_right
+ have hne : U ∩ block F i ≠ block F i := by
+ intro heq
+ apply hnone (block F i) (mem_image_of_mem _ (mem_univ i))
+ intro v hv
+ rw [← heq] at hv
+ exact (mem_inter.1 hv).1
+ have hlt := card_lt_card (Finset.ssubset_iff_subset_ne.2 ⟨hsub, hne⟩)
+ rw [hF.2.2.1 i] at hlt
+ calc (U ∩ block F i).card ≤ F.a i * F.d i := by omega
+ _ ≤ F.a i * (P i).card := Nat.mul_le_mul_left _ (hPd i)
+
+/-- Proves: `UniversalLaw.Spec.P15.WholeGroundChromaticNumber` (claim `p15-realized-covers`,
+Section 4: the chromatic number of the entire ground set is `K_H(d+1)`).
+Method: the palette/decomposition correspondence with `|X_i| = a_i d_i + 1`, which lies in
+`(a_i d_i, a_i (d_i + 1)]`, so the demands are exactly `d_i + 1`.
+Does not establish: the informal claim or its review. -/
+theorem wholeGroundChromaticNumber {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ UniversalLaw.Spec.P15.WholeGroundChromaticNumber F := by
+ intro hF K
+ have hH : ∀ e ∈ F.H, 2 ≤ e.card := hF.2.2.2.1
+ constructor
+ · intro h
+ obtain ⟨P, hcard, hedge⟩ := Aux.palette_of_decomposable h
+ apply Aux.paletteNumber_le_of_feasible
+ refine ⟨P, fun i => ?_, hedge⟩
+ have h1 := hcard i
+ rw [univ_inter, hF.2.2.1 i] at h1
+ show F.d i + 1 ≤ (P i).card
+ by_contra hlt
+ rw [not_le] at hlt
+ have hle : (P i).card ≤ F.d i := Nat.lt_succ_iff.1 hlt
+ have : F.a i * (P i).card ≤ F.a i * F.d i := Nat.mul_le_mul_left _ hle
+ omega
+ · intro hK
+ obtain ⟨P, hPd, hPe⟩ :=
+ Aux.isPaletteFeasible_of_paletteNumber_le F.H (fun i => F.d i + 1) hH hK
+ apply Aux.decomposable_of_palette hF P _ hPe
+ intro i
+ rw [univ_inter, hF.2.2.1 i]
+ have ha := hF.1 i
+ calc F.a i * F.d i + 1 ≤ F.a i * (F.d i + 1) := by rw [mul_add, mul_one]; omega
+ _ ≤ F.a i * (P i).card := Nat.mul_le_mul_left _ (hPd i)
+
+/-- Proves: `UniversalLaw.Spec.P15.Benchmark816WholeGround` (claim `p15-realized-covers`, Section
+6: the whole ground set needs `818` colors).
+Method: `WholeGroundChromaticNumber` for the six-block data and the complete-clutter palette
+formula at demands `409`: `max 409 ⌈2454/3⌉₊ = 818`.
+Does not establish: the informal claim or its review. -/
+theorem benchmark816WholeGround : UniversalLaw.Spec.P15.Benchmark816WholeGround := by
+ have h := wholeGroundChromaticNumber benchmark816 Aux.benchmark816_isRealized
+ have hpal : paletteNumber benchmark816.b benchmark816.H (fun i => benchmark816.d i + 1) = 818 := by
+ change paletteNumber 6 (completeClutter 6 3) (fun _ => 409) = 818
+ rw [Aux.paletteNumber_completeClutter 6 3 (fun _ => 409) (by norm_num)]
+ rw [sup_const univ_nonempty, sum_const, card_univ, Fintype.card_fin, smul_eq_mul]
+ norm_num
+ constructor
+ · rw [h 818, hpal]
+ · rw [h 817, hpal]
+ norm_num
+
+/-- Proves: `UniversalLaw.Spec.P15.MinimalForbiddenCharacterisation` (claim `p15-realized-covers`,
+Proposition P1 of P15_REALIZED_COVERS.md: the inclusion-minimal forbidden sets are exactly the
+`(a_i+1)`-subsets of a single block and the transversals of the edges).
+Method: a capacity violation in block `i` forces `U ⊆ X_i` with `|U| = a_i + 1` (removing any
+outside vertex or any vertex keeps the violation); otherwise an edge `e ⊆ supp U` forces each
+vertex to be alone in its block with its block in `e`. Conversely both families are forbidden
+and every one-vertex deletion is good (one-block sets of size `≤ a_i`; the clutter property for
+transversals).
+Does not establish: the informal claim or its review; alignment of `IsMinimalForbidden` with the
+informal notion. -/
+theorem minimalForbiddenCharacterisation {X : Type} [Fintype X] [DecidableEq X]
+ (F : RealizedData X) : UniversalLaw.Spec.P15.MinimalForbiddenCharacterisation F :=
+ fun hF U => Aux.minimalForbidden_iff hF U
+
+/-- Proves: `UniversalLaw.Spec.P15.Benchmark816MinimalForbiddenCounts` (claim
+`p15-realized-covers`, display (P10): `6 * binom(409,2)` internal pairs, `15 * 409^4` crossing
+transversal quadruples, and nothing else).
+Method: Proposition P1 (`MinimalForbiddenCharacterisation`) for the six-block data; the pairs
+are the disjoint union over the six blocks of `powersetCard 2`; the transversals of a four-edge
+are the images of `e` under `i ↦ (i, g i)` for `g` in a product set of size `409^4`, counted by
+`card_image_of_injOn` and `Fintype.card_piFinset`; the two families are disjoint by the size of
+the support. No enumeration of subsets is performed.
+Does not establish: the informal claim or its review; the evaluations `500616` and
+`419743994415` (core-Lean targets on main). -/
+theorem benchmark816MinimalForbiddenCounts :
+ UniversalLaw.Spec.P15.Benchmark816MinimalForbiddenCounts := by
+ refine ⟨?_, ?_, ?_⟩
+ · rw [Aux.minForbSet1_eq, Set.ncard_coe_finset, Aux.card_pairs816]
+ · rw [Aux.minForbSet4_eq, Set.ncard_coe_finset, Aux.card_transAll816]
+ · rw [Aux.minForbSet_eq, Set.ncard_coe_finset,
+ card_union_of_disjoint Aux.disjoint_pairs816_transAll816, Aux.card_pairs816,
+ Aux.card_transAll816]
+
+end UniversalLaw.Proofs.P15Structure
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/RNCluster.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/RNCluster.lean
new file mode 100644
index 000000000..405e6071c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/RNCluster.lean
@@ -0,0 +1,335 @@
+import Specifications.RN
+
+/-!
+# RN: kernel-checked proof of the abstract rare-cluster Poisson obstruction
+(`RareClusterPoissonObstructionO`, statement module `Specifications.RN`)
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+The theorem outside the `Aux` namespace has as its type exactly one registered `Prop` of
+`Specifications/RN.lean` (statement packet `specifications/lean_statements_20261010`, which is
+not modified here), applied to its own parameters `μ a A`. A kernel-checked proof of such a
+`Prop` is evidence about that `Prop` only: it does not make the informal Layer 0 note
+(OA-C6-RARE-CLUSTER-20260929-v1, Theorem O of c6_rare_cluster_laws_20260929/PROOF.md) reviewed,
+accepted or "verified", it does not identify the formal objects (`pmfTV`, `poissonPMF`, the
+family `μ`) with the source's (that alignment is PENDING_INDEPENDENT_REVIEW), it says nothing
+about whether (H1) or (H2) hold for any Gaussian window count, and it promotes, closes,
+discharges or reclassifies nothing. The Radon-Nikodym uniformity lemma `D3-LEMMA-RN-UNIF` and the
+five validity premises of Theorem D1 v2.2(2) are untouched and remain OPEN.
+
+Provenance: this `Prop` was selected by the round-4 triage (workflow `wf_a3531fd8-891`) of the
+registered `Prop`s still without a theorem; the proof was written and verified in its own lane
+and is placed here unchanged. Helper lemmas live in `UniversalLaw.Proofs.RNCluster.Aux` (prefix
+`rc_`); the gate inventories only the one theorem outside that namespace.
+
+The route is the source's, with the thresholds rearranged so that no `A^2` appears:
+* the antecedents at `r = r0` give `2 a r0^3 ≤ 2 (1 - μ 0 - μ 1) ≤ ∑ n μ n ≤ A r0^3`, hence
+ `2a ≤ A` and in particular `A > 0`;
+* `rStar := min r0 (min (a/2) (min (1/(a + 2A)) (1/2)))`;
+* upper half, witness `lam = 0`: `poissonPMF 0 = δ_0`, so `pmfTV (μ r) (poissonPMF 0) = 1 - μ r 0
+ = ∑_{n ≥ 1} μ r n ≤ ∑ n μ r n ≤ A r^3`;
+* lower half, `lam ≥ 0`: half the `l^1` distance dominates the difference of the masses of every
+ tail event `{n ≥ k}` (for two summable families of total mass one). For `lam ≤ r^2` the tail
+ `{n ≥ 2}` gives `pmfTV ≥ (1 - μ 0 - μ 1) - (1 - e^{-lam} - lam e^{-lam}) ≥ a r^3 - lam^2 ≥
+ a r^3 - r^4 ≥ (a/2) r^3`; for `lam > r^2` the tail `{n ≥ 1}` gives `pmfTV ≥ (1 - e^{-lam}) -
+ (1 - μ 0) ≥ (1 - e^{-r^2}) - A r^3 ≥ r^2/2 - A r^3 ≥ (a/2) r^3`, using `x/2 ≤ 1 - e^{-x}` on
+ `[0, 1/2]` and `r (a + 2A) ≤ 1`.
+Total mass one of `poissonPMF lam` for `lam ≥ 0` is Mathlib's
+`ProbabilityTheory.hasSum_one_poissonMeasure`.
+
+Remark recorded by the lane, for the maintainers: a theorem of this `Prop` kernel-checks only the
+abstract implication (H1) ∧ (H2) ⇒ (3.1), which is what the source claims for Theorem O; the
+hypotheses imply `2a ≤ A`, so the `Prop` is not vacuous. The claim row keeps its register labels.
+-/
+
+namespace UniversalLaw.Proofs.RNCluster
+
+open UniversalLaw.Spec.RN
+
+namespace Aux
+
+/-! ### (a) Tails of a probability mass function on `ℕ` -/
+
+/-- `∑_{n ≥ 1} μ n = 1 - μ 0` for a summable family of total mass one. -/
+theorem rc_tail_one_eq (μ : ℕ → ℝ) (hs : Summable μ) (h1 : ∑' n, μ n = 1) :
+ ∑' n : ℕ, μ (n + 1) = 1 - μ 0 := by
+ have h := Summable.sum_add_tsum_nat_add 1 hs
+ rw [h1, Finset.sum_range_one] at h
+ linarith
+
+/-- `∑_{n ≥ 2} μ n = 1 - μ 0 - μ 1` for a summable family of total mass one. -/
+theorem rc_tail_two_eq (μ : ℕ → ℝ) (hs : Summable μ) (h1 : ∑' n, μ n = 1) :
+ ∑' n : ℕ, μ (n + 2) = 1 - μ 0 - μ 1 := by
+ have h := Summable.sum_add_tsum_nat_add 2 hs
+ rw [h1] at h
+ simp only [Finset.sum_range_succ, Finset.sum_range_zero, zero_add] at h
+ linarith
+
+/-- Markov for the mean: `∑_{n ≥ 1} μ n ≤ ∑ n μ n` for a nonnegative family with summable
+mean. -/
+theorem rc_tail_one_le_mean (μ : ℕ → ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)
+ (hm : Summable (fun n : ℕ => (n : ℝ) * μ n)) :
+ ∑' n : ℕ, μ (n + 1) ≤ ∑' n : ℕ, (n : ℝ) * μ n := by
+ have hs1 : Summable (fun n : ℕ => μ (n + 1)) := (summable_nat_add_iff 1).mpr hs
+ have hm1 : Summable (fun n : ℕ => ((n + 1 : ℕ) : ℝ) * μ (n + 1)) :=
+ (summable_nat_add_iff 1).mpr hm
+ calc ∑' n : ℕ, μ (n + 1) ≤ ∑' n : ℕ, ((n + 1 : ℕ) : ℝ) * μ (n + 1) := by
+ refine hs1.tsum_le_tsum (fun n => ?_) hm1
+ have : (1 : ℝ) ≤ ((n + 1 : ℕ) : ℝ) := by exact_mod_cast Nat.succ_le_succ (Nat.zero_le n)
+ nlinarith [h0 (n + 1)]
+ _ ≤ ∑' n : ℕ, (n : ℝ) * μ n := by
+ have h2 := Summable.sum_add_tsum_nat_add 1 hm
+ simp only [Finset.sum_range_one, Nat.cast_zero, zero_mul, zero_add] at h2
+ exact le_of_eq h2
+
+/-- `1 - μ 0 ≤ ∑ n μ n` for a probability mass function with summable mean. -/
+theorem rc_one_sub_head_le_mean (μ : ℕ → ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)
+ (h1 : ∑' n, μ n = 1) (hm : Summable (fun n : ℕ => (n : ℝ) * μ n)) :
+ 1 - μ 0 ≤ ∑' n : ℕ, (n : ℝ) * μ n := by
+ have h := rc_tail_one_le_mean μ h0 hs hm
+ rwa [rc_tail_one_eq μ hs h1] at h
+
+/-- `2 (1 - μ 0 - μ 1) ≤ ∑ n μ n`: the mean dominates twice the mass of `{n ≥ 2}` (this is the
+source's remark `2a ≤ A`, before dividing by `r^3`). -/
+theorem rc_two_mul_tail_two_le_mean (μ : ℕ → ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)
+ (h1 : ∑' n, μ n = 1) (hm : Summable (fun n : ℕ => (n : ℝ) * μ n)) :
+ 2 * (1 - μ 0 - μ 1) ≤ ∑' n : ℕ, (n : ℝ) * μ n := by
+ have hs2 : Summable (fun n : ℕ => μ (n + 2)) := (summable_nat_add_iff 2).mpr hs
+ have hm2 : Summable (fun n : ℕ => ((n + 2 : ℕ) : ℝ) * μ (n + 2)) :=
+ (summable_nat_add_iff 2).mpr hm
+ have htail : ∑' n : ℕ, μ (n + 2) = 1 - μ 0 - μ 1 := rc_tail_two_eq μ hs h1
+ have hsplit := Summable.sum_add_tsum_nat_add 2 hm
+ have hhead : ∑ i ∈ Finset.range 2, (i : ℝ) * μ i = μ 1 := by
+ simp [Finset.sum_range_succ]
+ rw [hhead] at hsplit
+ have hle : ∑' n : ℕ, 2 * μ (n + 2) ≤ ∑' n : ℕ, ((n + 2 : ℕ) : ℝ) * μ (n + 2) := by
+ refine (hs2.mul_left 2).tsum_le_tsum (fun n => ?_) hm2
+ have : (2 : ℝ) ≤ ((n + 2 : ℕ) : ℝ) := by exact_mod_cast Nat.le_add_left 2 n
+ exact mul_le_mul_of_nonneg_right this (h0 _)
+ rw [tsum_mul_left, htail] at hle
+ linarith [h0 1]
+
+/-! ### (b) The Poisson family -/
+
+/-- `poissonPMF lam` has total mass one for `lam ≥ 0` (Mathlib's
+`ProbabilityTheory.hasSum_one_poissonMeasure`, whose summand is definitionally
+`poissonPMF lam n`). -/
+theorem rc_hasSum_poissonPMF (lam : ℝ) (hl : 0 ≤ lam) : HasSum (poissonPMF lam) 1 := by
+ have h : HasSum (fun n : ℕ => Real.exp (-lam) * lam ^ n / (Nat.factorial n : ℝ)) 1 :=
+ ProbabilityTheory.hasSum_one_poissonMeasure ⟨lam, hl⟩
+ exact h
+
+/-- `poissonPMF lam 0 = e^{-lam}`. -/
+theorem rc_poissonPMF_zero (lam : ℝ) : poissonPMF lam 0 = Real.exp (-lam) := by
+ simp [poissonPMF]
+
+/-- `poissonPMF lam 1 = e^{-lam} lam`. -/
+theorem rc_poissonPMF_one (lam : ℝ) : poissonPMF lam 1 = Real.exp (-lam) * lam := by
+ simp [poissonPMF]
+
+/-- The Poisson tail `∑_{n ≥ 1} Pois(lam)(n) = 1 - e^{-lam}` for `lam ≥ 0`. -/
+theorem rc_poisson_tail_one (lam : ℝ) (hl : 0 ≤ lam) :
+ ∑' n : ℕ, poissonPMF lam (n + 1) = 1 - Real.exp (-lam) := by
+ have hsum := rc_hasSum_poissonPMF lam hl
+ have h := Summable.sum_add_tsum_nat_add 1 hsum.summable
+ rw [hsum.tsum_eq, Finset.sum_range_one, rc_poissonPMF_zero] at h
+ linarith
+
+/-- The Poisson tail `∑_{n ≥ 2} Pois(lam)(n) = 1 - e^{-lam} - lam e^{-lam}` for `lam ≥ 0`. -/
+theorem rc_poisson_tail_two (lam : ℝ) (hl : 0 ≤ lam) :
+ ∑' n : ℕ, poissonPMF lam (n + 2) = 1 - Real.exp (-lam) - lam * Real.exp (-lam) := by
+ have hsum := rc_hasSum_poissonPMF lam hl
+ have h := Summable.sum_add_tsum_nat_add 2 hsum.summable
+ rw [hsum.tsum_eq] at h
+ simp only [Finset.sum_range_succ, Finset.sum_range_zero, zero_add] at h
+ rw [rc_poissonPMF_zero, rc_poissonPMF_one] at h
+ linarith
+
+/-- `x/2 ≤ 1 - e^{-x}` for `0 ≤ x ≤ 1/2`, from `|e^y - 1 - y| ≤ y^2` on `|y| ≤ 1`. -/
+theorem rc_half_le_one_sub_exp (x : ℝ) (h0 : 0 ≤ x) (h1 : x ≤ 1 / 2) :
+ x / 2 ≤ 1 - Real.exp (-x) := by
+ have h := Real.abs_exp_sub_one_sub_id_le (x := -x) (by rw [abs_neg, abs_of_nonneg h0]; linarith)
+ rw [abs_le] at h
+ nlinarith [h.1, h.2]
+
+/-- `Pois(lam)(n ≥ 2) = 1 - e^{-lam} - lam e^{-lam} ≤ lam^2` for `lam ≥ 0`, from
+`1 + y ≤ e^y` multiplied by `1 + lam ≥ 0`. -/
+theorem rc_poisson_tail_two_le_sq (lam : ℝ) (h0 : 0 ≤ lam) :
+ 1 - Real.exp (-lam) - lam * Real.exp (-lam) ≤ lam ^ 2 := by
+ have h := Real.add_one_le_exp (-lam)
+ have hprod := mul_nonneg (sub_nonneg.mpr h) (show (0 : ℝ) ≤ 1 + lam by linarith)
+ nlinarith [hprod, Real.exp_pos (-lam)]
+
+/-! ### (c) Total variation against `δ_0` and against tail events -/
+
+/-- The upper half's witness: `pmfTV μ (poissonPMF 0) = 1 - μ 0` for a probability mass
+function `μ` (`poissonPMF 0 = δ_0`). -/
+theorem rc_pmfTV_poissonPMF_zero (μ : ℕ → ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)
+ (h1 : ∑' n, μ n = 1) : pmfTV μ (poissonPMF 0) = 1 - μ 0 := by
+ unfold pmfTV
+ have hμ1 : μ 0 ≤ 1 := by
+ rw [← h1]; exact hs.le_tsum 0 (fun j _ => h0 j)
+ have hterm : ∀ n, |μ n - poissonPMF 0 n| = if n = 0 then 1 - μ 0 else μ n := by
+ intro n
+ unfold poissonPMF
+ rcases n with _ | n
+ · simp
+ rw [abs_sub_comm, abs_of_nonneg (by linarith)]
+ · simp [abs_of_nonneg (h0 _)]
+ simp_rw [hterm]
+ have hsum : Summable (fun n : ℕ => if n = 0 then 1 - μ 0 else μ n) := by
+ rw [← summable_nat_add_iff 1]
+ simpa using (summable_nat_add_iff 1).mpr hs
+ rw [hsum.tsum_eq_zero_add]
+ have htail : ∑' n : ℕ, (if n + 1 = 0 then 1 - μ 0 else μ (n + 1)) = ∑' n : ℕ, μ (n + 1) :=
+ tsum_congr (fun n => by simp)
+ rw [htail, ite_eq_left rfl, rc_tail_one_eq μ hs h1]
+ ring
+
+/-- Half the `l^1` distance dominates the difference of the masses of every tail event
+`{n ≥ k}`, for two summable families of total mass one: the head and the tail of `μ - ν` sum to
+zero, so the tail difference is bounded by the head's `l^1` mass and by its own. -/
+theorem rc_abs_tail_sub_le_pmfTV (μ ν : ℕ → ℝ) (hμ : Summable μ) (hν : Summable ν)
+ (h1 : ∑' n, μ n = 1) (h1' : ∑' n, ν n = 1) (k : ℕ) :
+ |(∑' n : ℕ, μ (n + k)) - ∑' n : ℕ, ν (n + k)| ≤ pmfTV μ ν := by
+ have hμk : Summable (fun n : ℕ => μ (n + k)) := (summable_nat_add_iff k).mpr hμ
+ have hνk : Summable (fun n : ℕ => ν (n + k)) := (summable_nat_add_iff k).mpr hν
+ rw [← hμk.tsum_sub hνk]
+ unfold pmfTV
+ have hfs : Summable (fun n => μ n - ν n) := hμ.sub hν
+ have hfabs : Summable (fun n => |μ n - ν n|) := hfs.abs
+ have htot : ∑' n, (μ n - ν n) = 0 := by rw [hμ.tsum_sub hν, h1, h1']; ring
+ have hsplit := Summable.sum_add_tsum_nat_add k hfs
+ rw [htot] at hsplit
+ have hsplit_abs := Summable.sum_add_tsum_nat_add k hfabs
+ have hhead : |∑ i ∈ Finset.range k, (μ i - ν i)| ≤ ∑ i ∈ Finset.range k, |μ i - ν i| :=
+ Finset.abs_sum_le_sum_abs _ _
+ have htail : |∑' i : ℕ, (μ (i + k) - ν (i + k))| ≤ ∑' i : ℕ, |μ (i + k) - ν (i + k)| := by
+ have := norm_tsum_le_tsum_norm (f := fun i : ℕ => μ (i + k) - ν (i + k)) ?_
+ · simpa only [Real.norm_eq_abs] using this
+ · simpa only [Real.norm_eq_abs] using (summable_nat_add_iff k).mpr hfabs
+ have heq : ∑ i ∈ Finset.range k, (μ i - ν i) = -∑' i : ℕ, (μ (i + k) - ν (i + k)) := by
+ linarith
+ rw [heq, abs_neg] at hhead
+ linarith
+
+/-- The tail `{n ≥ 2}` against `Pois(lam)`:
+`|(1 - μ 0 - μ 1) - (1 - e^{-lam} - lam e^{-lam})| ≤ pmfTV μ (poissonPMF lam)`. -/
+theorem rc_tail_two_bound (μ : ℕ → ℝ) (hs : Summable μ) (h1 : ∑' n, μ n = 1) (lam : ℝ)
+ (hl : 0 ≤ lam) :
+ |(1 - μ 0 - μ 1) - (1 - Real.exp (-lam) - lam * Real.exp (-lam))| ≤
+ pmfTV μ (poissonPMF lam) := by
+ have hP := rc_hasSum_poissonPMF lam hl
+ have h := rc_abs_tail_sub_le_pmfTV μ (poissonPMF lam) hs hP.summable h1 hP.tsum_eq 2
+ rwa [rc_tail_two_eq μ hs h1, rc_poisson_tail_two lam hl] at h
+
+/-- The tail `{n ≥ 1}` against `Pois(lam)`:
+`|(1 - μ 0) - (1 - e^{-lam})| ≤ pmfTV μ (poissonPMF lam)`. -/
+theorem rc_tail_one_bound (μ : ℕ → ℝ) (hs : Summable μ) (h1 : ∑' n, μ n = 1) (lam : ℝ)
+ (hl : 0 ≤ lam) :
+ |(1 - μ 0) - (1 - Real.exp (-lam))| ≤ pmfTV μ (poissonPMF lam) := by
+ have hP := rc_hasSum_poissonPMF lam hl
+ have h := rc_abs_tail_sub_le_pmfTV μ (poissonPMF lam) hs hP.summable h1 hP.tsum_eq 1
+ rwa [rc_tail_one_eq μ hs h1, rc_poisson_tail_one lam hl] at h
+
+/-! ### (d) The two halves at a fixed `r` -/
+
+/-- The lower half at a fixed `r` with `0 < r ≤ min (a/2) (min (1/(a + 2A)) (1/2))`, for a
+probability mass function `μ` with summable mean satisfying (H1) and (H2) at `r`: every
+`lam ≥ 0` is at distance at least `(a/2) r^3`. -/
+theorem rc_lower_half (μ : ℕ → ℝ) (a A r : ℝ) (hA : 0 < A) (hr : 0 < r)
+ (hr_a : r ≤ a / 2) (hr_A : r ≤ 1 / (a + 2 * A)) (hr_half : r ≤ 1 / 2)
+ (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ) (h1 : ∑' n, μ n = 1)
+ (hm : Summable (fun n : ℕ => (n : ℝ) * μ n)) (hmean : ∑' n : ℕ, (n : ℝ) * μ n ≤ A * r ^ 3)
+ (hH2 : a * r ^ 3 ≤ 1 - μ 0 - μ 1) (lam : ℝ) (hlam : 0 ≤ lam) :
+ (a / 2) * r ^ 3 ≤ pmfTV μ (poissonPMF lam) := by
+ have hr3 : 0 ≤ r ^ 3 := pow_nonneg hr.le 3
+ have hr2 : r ^ 2 ≤ 1 / 2 := by
+ have h := pow_le_pow_left₀ hr.le hr_half 2
+ norm_num at h
+ linarith
+ rcases le_or_gt lam (r ^ 2) with hcase | hcase
+ · -- `lam ≤ r^2`: test the tail `{n ≥ 2}`
+ have hk2 := abs_le.mp (rc_tail_two_bound μ hs h1 lam hlam)
+ have hsq := rc_poisson_tail_two_le_sq lam hlam
+ have hlam2 : lam ^ 2 ≤ (a / 2) * r ^ 3 := by
+ calc lam ^ 2 ≤ (r ^ 2) ^ 2 := pow_le_pow_left₀ hlam hcase 2
+ _ = r * r ^ 3 := by ring
+ _ ≤ (a / 2) * r ^ 3 := mul_le_mul_of_nonneg_right hr_a hr3
+ linarith [hk2.2]
+ · -- `lam > r^2`: test the tail `{n ≥ 1}`
+ have hk1 := abs_le.mp (rc_tail_one_bound μ hs h1 lam hlam)
+ have hexp : Real.exp (-lam) ≤ Real.exp (-(r ^ 2)) :=
+ Real.exp_le_exp.mpr (neg_le_neg hcase.le)
+ have hhalf := rc_half_le_one_sub_exp (r ^ 2) (sq_nonneg r) hr2
+ have hμ0 : 1 - μ 0 ≤ A * r ^ 3 := (rc_one_sub_head_le_mean μ h0 hs h1 hm).trans hmean
+ have hrA : r * (a + 2 * A) ≤ 1 := by
+ have hpos : 0 < a + 2 * A := by linarith
+ exact (le_div_iff₀ hpos).mp hr_A
+ have hkey : (a / 2) * r ^ 3 ≤ r ^ 2 / 2 - A * r ^ 3 := by
+ have hprod := mul_nonneg (div_nonneg (sq_nonneg r) (show (0 : ℝ) ≤ 2 by norm_num))
+ (sub_nonneg.mpr hrA)
+ nlinarith [hprod]
+ linarith [hk1.1]
+
+/-- The upper half at a fixed `r`, witness `lam = 0`: `pmfTV μ (poissonPMF 0) = 1 - μ 0 ≤
+∑ n μ n ≤ A r^3`. -/
+theorem rc_upper_half (μ : ℕ → ℝ) (A r : ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)
+ (h1 : ∑' n, μ n = 1) (hm : Summable (fun n : ℕ => (n : ℝ) * μ n))
+ (hmean : ∑' n : ℕ, (n : ℝ) * μ n ≤ A * r ^ 3) :
+ pmfTV μ (poissonPMF 0) ≤ A * r ^ 3 := by
+ rw [rc_pmfTV_poissonPMF_zero μ h0 hs h1]
+ exact (rc_one_sub_head_le_mean μ h0 hs h1 hm).trans hmean
+
+end Aux
+
+/-! ## Theorem O's shape: the abstract implication (H1) ∧ (H2) ⇒ (3.1) -/
+
+/-- Proves: `UniversalLaw.Spec.RN.RareClusterPoissonObstructionO` (claim `OA-C6-RARE-CLUSTER-20260929-v1`).
+Method: the antecedents at `r0` give `2a ≤ A` (`Aux.rc_two_mul_tail_two_le_mean`,
+`le_of_mul_le_mul_right`), so `rStar := min r0 (min (a/2) (min (1/(a + 2A)) (1/2)))` is positive;
+the upper half is the witness `lam = 0` with `pmfTV (μ r) (poissonPMF 0) = 1 - μ r 0 ≤ ∑ n μ r n`
+(`Aux.rc_upper_half`, from `Aux.rc_pmfTV_poissonPMF_zero` and `Aux.rc_one_sub_head_le_mean`);
+the lower half tests the tail `{n ≥ 2}` when `lam ≤ r^2` and the tail `{n ≥ 1}` when
+`lam > r^2` (`Aux.rc_lower_half`, from `Aux.rc_abs_tail_sub_le_pmfTV`, the Poisson tails via
+`ProbabilityTheory.hasSum_one_poissonMeasure`, `Real.add_one_le_exp` and
+`Real.abs_exp_sub_one_sub_id_le`).
+Does not establish: the informal Theorem O (3.1) of the source as the source's statement (the
+alignment of `pmfTV`, `poissonPMF` and the family `μ` with the source's `dTV`, `Pois(lambda)` and
+`Law N_r` is PENDING_INDEPENDENT_REVIEW); the result (Theorem O) or its proof as a reviewed fact;
+`2a ≤ A` as a registered statement (it is derived internally from the antecedents at `r0`, as in
+the source, and is neither a hypothesis nor a conclusion of the Prop); 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 (the Prop's existential form with witness `lam = 0` is
+what is proved); the statement module's own `Does not claim:` text (the statement packet is not
+edited here); the disposition of `OA-C6-RARE-CLUSTER-20260929-v1`, for which the register row
+transcribes none (`disposition_transcribed: null`; title: PROOF_INDEX reviewed scoped result,
+conditional packet) and which is in any case transcribed there, not derived here; nonauthor
+review or acceptance of OA-C6-RARE-CLUSTER-20260929-v1. -/
+theorem rareClusterPoissonObstructionO (μ : ℝ → ℕ → ℝ) (a A : ℝ) :
+ UniversalLaw.Spec.RN.RareClusterPoissonObstructionO μ a A := by
+ intro ha hex
+ obtain ⟨r0, hr0, H⟩ := hex
+ -- the antecedents at `r0` force `2a ≤ A`, hence `A > 0`
+ have hA2 : 2 * a ≤ A := by
+ obtain ⟨h0, hs, h1, hm, hmean, hH2⟩ := H r0 hr0 le_rfl
+ have hmid := Aux.rc_two_mul_tail_two_le_mean (μ r0) h0 hs h1 hm
+ have hr3 : 0 < r0 ^ 3 := pow_pos hr0 3
+ have hmul : 2 * a * r0 ^ 3 ≤ A * r0 ^ 3 := by linarith
+ exact le_of_mul_le_mul_right hmul hr3
+ have hA : 0 < A := by linarith
+ have hpos : 0 < a + 2 * A := by linarith
+ refine ⟨min r0 (min (a / 2) (min (1 / (a + 2 * A)) (1 / 2))), ?_, ?_⟩
+ · exact lt_min hr0 (lt_min (by linarith) (lt_min (div_pos one_pos hpos) (by norm_num)))
+ · intro r hr hrle
+ rw [le_min_iff, le_min_iff, le_min_iff] at hrle
+ obtain ⟨hr_r0, hr_a, hr_A, hr_half⟩ := hrle
+ obtain ⟨h0, hs, h1, hm, hmean, hH2⟩ := H r hr hr_r0
+ refine ⟨?_, ⟨0, le_rfl, ?_⟩⟩
+ · intro lam hlam
+ exact Aux.rc_lower_half (μ r) a A r hA hr hr_a hr_A hr_half h0 hs h1 hm hmean hH2 lam hlam
+ · exact Aux.rc_upper_half (μ r) A r h0 hs h1 hm hmean
+
+end UniversalLaw.Proofs.RNCluster
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/RNProbability.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/RNProbability.lean
new file mode 100644
index 000000000..198cad8b0
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/RNProbability.lean
@@ -0,0 +1,363 @@
+import Specifications.RN
+
+/-!
+# RN: kernel-checked proofs of the abstract probability `Prop`s (N1)-(N5) (statement module
+# `Specifications.RN`)
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+Every theorem below has as its TYPE a registered `Prop` constant of `UniversalLaw.Spec.RN`
+(statement packet `specifications/lean_statements_20261010`, commit pinned there). A
+kernel-checked proof of such a `Prop` is evidence about that `Prop` only: it does not make the
+informal Layer 0 claim (RN_COUNT_INTERFACE.md, Theorem N) accepted, reviewed or "verified",
+does not change its LANDING_CLAIMS disposition (HOLD_WITH_DOMAIN, transcribed by the register),
+says nothing about any count of the Gaussian model, and does not touch the statement register
+(the statement module is not edited here). Helper lemmas live in the `Aux` namespace and are not
+inventory items.
+
+Allowed transitive axioms: `propext`, `Classical.choice`, `Quot.sound` only (checked by
+`#print axioms`, see the run receipt). No `sorry`, `native_decide`, `decide` on `ℝ`, or custom
+axioms.
+
+Covered (five `Prop`s): `HolderCountBoundN1`, `HolderConsequenceN2`,
+`ConditionalMeanIdentityN3`, `UniformCounterexampleN4`, `ExponentialTailLayerCakeN5`.
+-/
+
+namespace UniversalLaw.Proofs.RNProbability
+
+open MeasureTheory UniversalLaw.Spec.RN
+
+namespace Aux
+
+/-- `N · 1_E = 1_E · N` pointwise. -/
+theorem mul_indicator_one_eq {Ω : Type} (Ev : Set Ω) (N : Ω → ℕ) (ω : Ω) :
+ (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω = Ev.indicator (fun ω => (N ω : ℝ)) ω := by
+ by_cases h : ω ∈ Ev
+ · simp [h]
+ · simp [h]
+
+end Aux
+
+/-- Proves: `UniversalLaw.Spec.RN.ConditionalMeanIdentityN3` (register claims
+`rn-count-interface`, `math.rn-count-interface`).
+Method: unfold `ProbabilityTheory.cond = (P E)⁻¹ • P.restrict E`, `integral_smul_measure`,
+`integral_indicator`, cancel `P(E) · P(E)⁻¹`.
+Does not establish: the informal Theorem N, the bounded-conditional-mean equivalence, the lower
+comparison `q ≥ c r^3`, anything about the Gaussian model, review or acceptance. -/
+theorem conditionalMeanIdentityN3 : ConditionalMeanIdentityN3 := by
+ intro Ω _ P _ Ev N hEv hpos _hint
+ simp_rw [Aux.mul_indicator_one_eq]
+ rw [integral_indicator hEv, ProbabilityTheory.cond, integral_smul_measure, smul_eq_mul,
+ ENNReal.toReal_inv, ← mul_assoc, mul_inv_cancel₀ hpos.ne', one_mul]
+
+/-- Proves: `UniversalLaw.Spec.RN.HolderCountBoundN1` (register claims `rn-count-interface`,
+`math.rn-count-interface`).
+Method: Mathlib's Hölder inequality `integral_mul_le_Lp_mul_Lq_of_nonneg` with the conjugate
+exponent `q = p/(p-1)`, `MemLp` of `N` recovered from the integrability of `N^p`, and
+`∫ 1_E^q = P(E)`.
+Does not establish: the informal Theorem N, that any Gaussian count satisfies the moment
+hypothesis, any rate in `r`, review or acceptance. -/
+theorem holderCountBoundN1 : HolderCountBoundN1 := by
+ intro Ω _ P _ Ev N p hEv hp hint
+ have hpq : p.HolderConjugate (Real.conjExponent p) := Real.HolderConjugate.conjExponent hp
+ have hp0 : 0 < p := by linarith
+ have hq0 : 0 < Real.conjExponent p := hpq.symm.pos
+ have hNmeas : AEStronglyMeasurable (fun ω => (N ω : ℝ)) P := by
+ have h1 : AEStronglyMeasurable (fun ω => (N ω : ℝ) ^ p) P := hint.aestronglyMeasurable
+ have h2 : (fun ω => (N ω : ℝ)) = fun ω => ((N ω : ℝ) ^ p) ^ p⁻¹ := by
+ funext ω; rw [Real.rpow_rpow_inv (Nat.cast_nonneg _) hp0.ne']
+ rw [h2]
+ exact (Real.continuous_rpow_const (inv_nonneg.mpr hp0.le)).comp_aestronglyMeasurable h1
+ have hfLp : MemLp (fun ω => (N ω : ℝ)) (ENNReal.ofReal p) P := by
+ have hne : ENNReal.ofReal p ≠ 0 := by
+ rw [ne_eq, ENNReal.ofReal_eq_zero]; exact not_le.mpr hp0
+ have hnt : ENNReal.ofReal p ≠ ⊤ := ENNReal.ofReal_ne_top
+ rw [← memLp_norm_rpow_iff hNmeas hne hnt, ENNReal.div_self hne hnt, memLp_one_iff_integrable]
+ have : (fun ω => ‖(N ω : ℝ)‖ ^ (ENNReal.ofReal p).toReal) = fun ω => (N ω : ℝ) ^ p := by
+ funext ω
+ rw [Real.norm_of_nonneg (Nat.cast_nonneg _), ENNReal.toReal_ofReal hp0.le]
+ rw [this]
+ exact hint
+ have hgLp : MemLp (Ev.indicator fun _ => (1 : ℝ)) (ENNReal.ofReal (Real.conjExponent p)) P :=
+ memLp_indicator_const _ hEv 1 (Or.inr (measure_ne_top P Ev))
+ have hfnn : 0 ≤ᵐ[P] fun ω => (N ω : ℝ) := ae_of_all _ (fun ω => Nat.cast_nonneg _)
+ have hgnn : 0 ≤ᵐ[P] Ev.indicator fun _ => (1 : ℝ) :=
+ ae_of_all _ (fun ω => Set.indicator_nonneg (fun _ _ => zero_le_one) ω)
+ have key := integral_mul_le_Lp_mul_Lq_of_nonneg hpq hfnn hgnn hfLp hgLp
+ have hind : (fun a => Ev.indicator (fun _ => (1 : ℝ)) a ^ Real.conjExponent p) =
+ Ev.indicator (fun _ => (1 : ℝ)) := by
+ funext a
+ by_cases h : a ∈ Ev
+ · simp [h]
+ · simp [h, Real.zero_rpow hq0.ne']
+ rw [hind, integral_indicator_const (1 : ℝ) hEv, measureReal_def, smul_eq_mul, mul_one] at key
+ have h1q : 1 / Real.conjExponent p = 1 - 1 / p := by
+ rw [one_div, one_div, hpq.one_sub_inv]
+ rw [h1q] at key
+ exact key
+
+/-- Proves: `UniversalLaw.Spec.RN.HolderConsequenceN2` (register claims `rn-count-interface`,
+`math.rn-count-interface`).
+Method: `holderCountBoundN1`, then monotonicity of `x ↦ x^(1/p)` and `x ↦ x^(1-1/p)` on
+`[0, ∞)` and the rpow algebra `(A r^(-β))^(1/p) (C r^3)^(1-1/p) = A^(1/p) C^(1-1/p)
+r^((3(p-1)-β)/p)`.
+Does not establish: the informal Theorem N, that the exponent can be rounded up to `3`, that
+any Gaussian count satisfies the hypotheses, review or acceptance. -/
+theorem holderConsequenceN2 : HolderConsequenceN2 := by
+ intro Ω _ P _ Ev N p A β C r hEv hp hA hC hr hint hmom hprob
+ have h1 := holderCountBoundN1 Ω P Ev N p hEv hp hint
+ have hp0 : 0 < p := by linarith
+ have h1p : 0 ≤ 1 / p := by positivity
+ have h1p' : 0 ≤ 1 - 1 / p := by
+ rw [sub_nonneg, div_le_one hp0]; exact hp.le
+ have hI : 0 ≤ ∫ ω, (N ω : ℝ) ^ p ∂P :=
+ integral_nonneg (fun ω => Real.rpow_nonneg (Nat.cast_nonneg _) p)
+ have h2 : (∫ ω, (N ω : ℝ) ^ p ∂P) ^ (1 / p) ≤ (A * r ^ (-β)) ^ (1 / p) :=
+ Real.rpow_le_rpow hI hmom h1p
+ have h3 : (P Ev).toReal ^ (1 - 1 / p) ≤ (C * r ^ 3) ^ (1 - 1 / p) :=
+ Real.rpow_le_rpow ENNReal.toReal_nonneg hprob h1p'
+ have hrb : 0 ≤ r ^ (-β) := Real.rpow_nonneg hr.le _
+ have hr3 : 0 ≤ r ^ 3 := pow_nonneg hr.le 3
+ have hexp : r ^ (-β * (1 / p)) * r ^ ((3 : ℝ) * (1 - 1 / p)) = r ^ ((3 * (p - 1) - β) / p) := by
+ rw [← Real.rpow_add hr]; congr 1; field_simp; ring
+ calc ∫ ω, (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω ∂P
+ ≤ (∫ ω, (N ω : ℝ) ^ p ∂P) ^ (1 / p) * (P Ev).toReal ^ (1 - 1 / p) := h1
+ _ ≤ (A * r ^ (-β)) ^ (1 / p) * (C * r ^ 3) ^ (1 - 1 / p) :=
+ mul_le_mul h2 h3 (Real.rpow_nonneg ENNReal.toReal_nonneg _)
+ (Real.rpow_nonneg (mul_nonneg hA hrb) _)
+ _ = A ^ (1 / p) * r ^ (-β * (1 / p)) * (C ^ (1 - 1 / p) * r ^ ((3 : ℝ) * (1 - 1 / p))) := by
+ rw [Real.mul_rpow hA hrb, Real.mul_rpow hC hr3, ← Real.rpow_mul hr.le,
+ ← Real.rpow_natCast r 3, ← Real.rpow_mul hr.le]
+ push_cast
+ ring
+ _ = A ^ (1 / p) * C ^ (1 - 1 / p) * r ^ ((3 * (p - 1) - β) / p) := by
+ rw [← hexp]; ring
+
+namespace Aux
+
+/-- The uniform law of `Iic a` for `0 ≤ a ≤ 1` is `a`. -/
+theorem uniformLaw_Iic {a : ℝ} (ha0 : 0 ≤ a) (ha1 : a ≤ 1) :
+ (uniformLaw (Set.Iic a)).toReal = a := by
+ rw [uniformLaw, Measure.restrict_apply measurableSet_Iic]
+ have : Set.Iic a ∩ Set.Icc 0 1 = Set.Icc 0 a := by
+ ext x
+ simp only [Set.mem_inter_iff, Set.mem_Iic, Set.mem_Icc]
+ constructor
+ · rintro ⟨h1, h2, _⟩; exact ⟨h2, h1⟩
+ · rintro ⟨h1, h2⟩; exact ⟨h2, h1, h2.trans ha1⟩
+ rw [this, Real.volume_Icc, sub_zero, ENNReal.toReal_ofReal ha0]
+
+/-- `∫ N_r dU = ceil(log(1/r)) · U(E_r)`. -/
+theorem integral_counterCount (r : ℝ) :
+ ∫ u, counterCount r u ∂uniformLaw =
+ (⌈Real.log (1 / r)⌉₊ : ℝ) * (uniformLaw (Set.Iic (r ^ 3))).toReal := by
+ unfold counterCount
+ rw [integral_const_mul, integral_indicator_const (1 : ℝ) measurableSet_Iic, measureReal_def,
+ smul_eq_mul, mul_one]
+
+/-- `∫ N_r^p dU = ceil(log(1/r))^p · U(E_r)` for `p ≠ 0`. -/
+theorem integral_counterCount_rpow (r : ℝ) {p : ℝ} (hp : p ≠ 0) :
+ ∫ u, counterCount r u ^ p ∂uniformLaw =
+ (⌈Real.log (1 / r)⌉₊ : ℝ) ^ p * (uniformLaw (Set.Iic (r ^ 3))).toReal := by
+ have : (fun u => counterCount r u ^ p) =
+ (Set.Iic (r ^ 3)).indicator (fun _ => (⌈Real.log (1 / r)⌉₊ : ℝ) ^ p) := by
+ funext u
+ unfold counterCount
+ by_cases h : u ∈ Set.Iic (r ^ 3)
+ · simp [h]
+ · simp [h, Real.zero_rpow hp]
+ rw [this, integral_indicator_const _ measurableSet_Iic, measureReal_def, smul_eq_mul, mul_comm]
+
+/-- The two displays of (N4) for a fixed `0 < r ≤ e^(-1)`. -/
+theorem n4_fixed (r : ℝ) (hr : 0 < r) (hre : r ≤ Real.exp (-1)) :
+ (uniformLaw (Set.Iic (r ^ 3))).toReal = r ^ 3 ∧
+ (∫ u, counterCount r u ∂uniformLaw) / r ^ 3 = (⌈Real.log (1 / r)⌉₊ : ℝ) := by
+ have hr3 : 0 < r ^ 3 := pow_pos hr 3
+ have hr1 : r ≤ 1 := hre.trans (Real.exp_lt_one_iff.mpr (by norm_num)).le
+ have hr31 : r ^ 3 ≤ 1 := pow_le_one₀ hr.le hr1
+ have hmeas : (uniformLaw (Set.Iic (r ^ 3))).toReal = r ^ 3 := uniformLaw_Iic hr3.le hr31
+ refine ⟨hmeas, ?_⟩
+ rw [integral_counterCount, hmeas, mul_div_assoc, div_self hr3.ne', mul_one]
+
+/-- `log (1/r) ≥ 1` for `0 < r ≤ e^(-1)`. -/
+theorem one_le_log_one_div {r : ℝ} (hr : 0 < r) (hre : r ≤ Real.exp (-1)) :
+ 1 ≤ Real.log (1 / r) := by
+ rw [Real.le_log_iff_exp_le (by positivity), le_one_div (Real.exp_pos _) hr, one_div,
+ ← Real.exp_neg]
+ exact hre
+
+/-- `r^3 = exp(-3 log(1/r))` for `r > 0`. -/
+theorem pow_three_eq_exp {r : ℝ} (hr : 0 < r) :
+ r ^ 3 = Real.exp (-(3 * Real.log (1 / r))) := by
+ have : r = Real.exp (-Real.log (1 / r)) := by
+ rw [Real.exp_neg, Real.exp_log (by positivity), one_div, inv_inv]
+ conv_lhs => rw [this]
+ rw [← Real.exp_nat_mul]
+ congr 1
+ push_cast
+ ring
+
+/-- `∫_0^∞ exp(-s/B) ds = B` for `B > 0`. -/
+theorem integral_exp_neg_div_Ioi_zero {B : ℝ} (hB : 0 < B) :
+ ∫ s in Set.Ioi (0 : ℝ), Real.exp (-s / B) = B := by
+ have h := integral_comp_mul_left_Ioi (fun x => Real.exp (-x)) 0 (inv_pos.mpr hB)
+ simp only [mul_zero, inv_inv, smul_eq_mul, integral_exp_neg_Ioi_zero, mul_one] at h
+ have hfun : (fun s : ℝ => Real.exp (-s / B)) = fun x => Real.exp (-(B⁻¹ * x)) := by
+ funext s; congr 1; ring
+ rw [hfun]
+ exact h
+
+end Aux
+
+/-- Proves: `UniversalLaw.Spec.RN.UniformCounterexampleN4` (register claims
+`rn-count-interface`, `math.rn-count-interface`).
+Method: `U(E_r) = r^3` from `volume.restrict` on `Icc 0 1`; `∫ N_r dU = ceil(log(1/r)) r^3`
+by `integral_indicator_const`; the limit from `log ∘ inv → ∞` on `𝓝[>] 0` and
+`x ≤ ⌈x⌉₊`; the moment bound with the explicit constant `A_p = 2^n n!`, `n = ⌈p⌉₊`, via
+`⌈t⌉₊^p ≤ (2t)^n` for `t = log(1/r) ≥ 1` and `t^n ≤ n! e^t`.
+Does not establish: the source's sharper bound `sup_(t>=1) e^(-3t)(t+1)^p`, the one-`p`
+sharpness construction, anything about the Gaussian field, the informal Theorem N, review or
+acceptance. -/
+theorem uniformCounterexampleN4 : UniformCounterexampleN4 := by
+ refine ⟨fun r hr hre => Aux.n4_fixed r hr hre, ?_, ?_⟩
+ · have hev : (fun r : ℝ => (⌈Real.log (1 / r)⌉₊ : ℝ)) =ᶠ[nhdsWithin (0 : ℝ) (Set.Ioi 0)]
+ fun r => (∫ u, counterCount r u ∂uniformLaw) / r ^ 3 := by
+ have h1 : ∀ᶠ r in nhdsWithin (0 : ℝ) (Set.Ioi 0), 0 < r := self_mem_nhdsWithin
+ have h2 : ∀ᶠ r in nhdsWithin (0 : ℝ) (Set.Ioi 0), r < Real.exp (-1) :=
+ nhdsWithin_le_nhds (Iio_mem_nhds (Real.exp_pos _))
+ filter_upwards [h1, h2] with r hr hre
+ exact ((Aux.n4_fixed r hr hre.le).2).symm
+ refine Filter.Tendsto.congr' hev ?_
+ refine Filter.tendsto_atTop_mono (fun r => Nat.le_ceil (Real.log (1 / r))) ?_
+ have : (fun r : ℝ => Real.log (1 / r)) = Real.log ∘ (fun r : ℝ => r⁻¹) := by
+ funext r; simp [one_div]
+ rw [this]
+ exact Real.tendsto_log_atTop.comp tendsto_inv_nhdsGT_zero
+ · intro p hp
+ refine ⟨2 ^ ⌈p⌉₊ * ((⌈p⌉₊).factorial : ℝ), ?_⟩
+ intro r hr hre
+ have hp0 : p ≠ 0 := by linarith
+ rw [Aux.integral_counterCount_rpow r hp0, (Aux.n4_fixed r hr hre).1]
+ set n := ⌈p⌉₊ with hn
+ set t := Real.log (1 / r) with ht
+ have ht1 : 1 ≤ t := Aux.one_le_log_one_div hr hre
+ have hc1 : (1 : ℝ) ≤ (⌈t⌉₊ : ℝ) := by
+ exact_mod_cast Nat.one_le_ceil_iff.mpr (by linarith)
+ have hc2 : (⌈t⌉₊ : ℝ) ≤ 2 * t := by
+ have := Nat.ceil_lt_add_one (by linarith : (0 : ℝ) ≤ t); linarith
+ have hr3 : r ^ 3 = Real.exp (-(3 * t)) := Aux.pow_three_eq_exp hr
+ have hcp : (⌈t⌉₊ : ℝ) ^ p ≤ (⌈t⌉₊ : ℝ) ^ n := by
+ rw [← Real.rpow_natCast]
+ exact Real.rpow_le_rpow_of_exponent_le hc1 (Nat.le_ceil p)
+ have hcn : (⌈t⌉₊ : ℝ) ^ n ≤ (2 * t) ^ n := pow_le_pow_left₀ (by linarith) hc2 n
+ have hexp : t ^ n ≤ (n.factorial : ℝ) * Real.exp t := by
+ have := Real.pow_div_factorial_le_exp t (by linarith) n
+ rw [div_le_iff₀ (by positivity)] at this
+ linarith
+ have hexp2 : Real.exp (-(2 * t)) ≤ 1 := Real.exp_le_one_iff.mpr (by linarith)
+ calc (⌈t⌉₊ : ℝ) ^ p * r ^ 3 ≤ (2 * t) ^ n * Real.exp (-(3 * t)) := by
+ rw [hr3]
+ exact mul_le_mul (hcp.trans hcn) le_rfl (Real.exp_pos _).le (by positivity)
+ _ = 2 ^ n * (t ^ n * Real.exp (-(3 * t))) := by rw [mul_pow]; ring
+ _ ≤ 2 ^ n * ((n.factorial : ℝ) * Real.exp t * Real.exp (-(3 * t))) := by
+ apply mul_le_mul_of_nonneg_left _ (by positivity)
+ exact mul_le_mul_of_nonneg_right hexp (Real.exp_pos _).le
+ _ = 2 ^ n * (n.factorial : ℝ) * Real.exp (-(2 * t)) := by
+ have : Real.exp t * Real.exp (-(3 * t)) = Real.exp (-(2 * t)) := by
+ rw [← Real.exp_add]; congr 1; ring
+ rw [mul_assoc ((n.factorial : ℝ)), this]; ring
+ _ ≤ 2 ^ n * (n.factorial : ℝ) := mul_le_of_le_one_right (by positivity) hexp2
+
+/-- Proves: `UniversalLaw.Spec.RN.ExponentialTailLayerCakeN5` (register claims
+`rn-count-interface`, `math.rn-count-interface`).
+Method: with `t₀ = B log(A/q) ≥ 0`, the pointwise bound `N 1_E ≤ t₀ 1_E + (N - t₀)⁺`; the
+layer-cake formula `Integrable.integral_eq_integral_meas_lt` for `(N - t₀)⁺`; the tail
+hypothesis at `t = s + t₀`; and `∫_0^∞ A e^(-(s+t₀)/B) ds = A B e^(-t₀/B) = B q`
+(`integral_comp_mul_left_Ioi`, `integral_exp_neg_Ioi_zero`).
+Does not establish: the source's intermediate identity `∫_0^∞ min(q, A e^(-t/B)) dt`, that
+the logarithmic loss is attained, anything about the Gaussian model, the informal Theorem N,
+review or acceptance. -/
+theorem exponentialTailLayerCakeN5 : ExponentialTailLayerCakeN5 := by
+ intro Ω _ P _ Ev N A B hEv hA hB hq hint htail
+ set q : ℝ := (P Ev).toReal with hqdef
+ set t₀ : ℝ := B * Real.log (A / q) with ht₀
+ have hq1 : q ≤ 1 := by
+ rw [hqdef, ← measureReal_def]; exact measureReal_le_one
+ have hAq : 1 ≤ A / q := by rw [le_div_iff₀ hq]; linarith
+ have hlog : 0 ≤ Real.log (A / q) := Real.log_nonneg hAq
+ have ht₀0 : 0 ≤ t₀ := mul_nonneg hB.le hlog
+ -- pointwise: N 1_E ≤ t₀ 1_E + (N - t₀)⁺
+ have hpt : ∀ ω, (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω ≤
+ Ev.indicator (fun _ => t₀) ω + max ((N ω : ℝ) - t₀) 0 := by
+ intro ω
+ by_cases h : ω ∈ Ev
+ · simp only [Set.indicator_of_mem h, mul_one]
+ have := le_max_left ((N ω : ℝ) - t₀) 0
+ linarith
+ · simp only [Set.indicator_of_notMem h, mul_zero, zero_add]
+ exact le_max_right _ _
+ have hint_t : Integrable (Ev.indicator (fun _ => t₀)) P := (integrable_const t₀).indicator hEv
+ have hint_pos : Integrable (fun ω => max ((N ω : ℝ) - t₀) 0) P :=
+ (hint.sub (integrable_const t₀)).pos_part
+ have step1 : ∫ ω, (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω ∂P ≤
+ t₀ * q + ∫ ω, max ((N ω : ℝ) - t₀) 0 ∂P := by
+ calc ∫ ω, (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω ∂P
+ ≤ ∫ ω, (Ev.indicator (fun _ => t₀) ω + max ((N ω : ℝ) - t₀) 0) ∂P := by
+ apply integral_mono_of_nonneg
+ · exact ae_of_all _ (fun ω => mul_nonneg (Nat.cast_nonneg _)
+ (Set.indicator_nonneg (fun _ _ => zero_le_one) ω))
+ · exact hint_t.add hint_pos
+ · exact ae_of_all _ hpt
+ _ = t₀ * q + ∫ ω, max ((N ω : ℝ) - t₀) 0 ∂P := by
+ rw [integral_add hint_t hint_pos, integral_indicator_const _ hEv, measureReal_def,
+ smul_eq_mul, mul_comm]
+ -- layer cake for (N - t₀)⁺
+ have hnn : 0 ≤ᵐ[P] fun ω => max ((N ω : ℝ) - t₀) 0 := ae_of_all _ (fun ω => le_max_right _ _)
+ have hlc := hint_pos.integral_eq_integral_meas_lt hnn
+ have hbound : ∀ s ∈ Set.Ioi (0 : ℝ), P.real {a | s < max ((N a : ℝ) - t₀) 0} ≤
+ A * Real.exp (-t₀ / B) * Real.exp (-s / B) := by
+ intro s hs
+ have hs' : 0 < s := hs
+ have hsub : {a | s < max ((N a : ℝ) - t₀) 0} ⊆ {ω | (s + t₀) < (N ω : ℝ)} := by
+ intro a ha
+ have ha' : s < max ((N a : ℝ) - t₀) 0 := ha
+ show s + t₀ < (N a : ℝ)
+ rcases lt_max_iff.mp ha' with h | h
+ · linarith
+ · exact absurd h (not_lt.mpr hs'.le)
+ calc P.real {a | s < max ((N a : ℝ) - t₀) 0} ≤ P.real {ω | (s + t₀) < (N ω : ℝ)} :=
+ measureReal_mono hsub (measure_ne_top _ _)
+ _ ≤ A * Real.exp (-(s + t₀) / B) := htail (s + t₀) (by linarith)
+ _ = A * Real.exp (-t₀ / B) * Real.exp (-s / B) := by
+ rw [mul_assoc, ← Real.exp_add]; congr 2; ring
+ have hint_g : IntegrableOn (fun s : ℝ => A * Real.exp (-t₀ / B) * Real.exp (-s / B))
+ (Set.Ioi 0) := by
+ have h0 := exp_neg_integrableOn_Ioi 0 (inv_pos.mpr hB)
+ have h2 : (fun s : ℝ => A * Real.exp (-t₀ / B) * Real.exp (-s / B)) =
+ fun s => A * Real.exp (-t₀ / B) * Real.exp (-B⁻¹ * s) := by
+ funext s; congr 2; ring
+ rw [h2]
+ exact h0.const_mul _
+ have step2 : ∫ ω, max ((N ω : ℝ) - t₀) 0 ∂P ≤ B * q := by
+ rw [hlc]
+ have hexp : Real.exp (-t₀ / B) = q / A := by
+ have h1 : -t₀ / B = -Real.log (A / q) := by rw [ht₀]; field_simp
+ rw [h1, Real.exp_neg, Real.exp_log (by positivity), inv_div]
+ calc ∫ s in Set.Ioi 0, P.real {a | s < max ((N a : ℝ) - t₀) 0}
+ ≤ ∫ s in Set.Ioi 0, A * Real.exp (-t₀ / B) * Real.exp (-s / B) := by
+ apply integral_mono_of_nonneg
+ · exact ae_of_all _ (fun s => measureReal_nonneg)
+ · exact hint_g
+ · exact ae_restrict_of_forall_mem measurableSet_Ioi hbound
+ _ = A * Real.exp (-t₀ / B) * ∫ s in Set.Ioi 0, Real.exp (-s / B) := integral_const_mul _ _
+ _ = A * Real.exp (-t₀ / B) * B := by rw [Aux.integral_exp_neg_div_Ioi_zero hB]
+ _ = B * q := by
+ rw [hexp]
+ have hA0 : A ≠ 0 := by linarith
+ field_simp
+ calc ∫ ω, (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω ∂P
+ ≤ t₀ * q + ∫ ω, max ((N ω : ℝ) - t₀) 0 ∂P := step1
+ _ ≤ t₀ * q + B * q := by linarith [step2]
+ _ = B * q * (1 + Real.log (A / q)) := by rw [ht₀]; ring
+
+end UniversalLaw.Proofs.RNProbability
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Analysis.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Analysis.lean
new file mode 100644
index 000000000..64caafbc8
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Analysis.lean
@@ -0,0 +1,1639 @@
+import Specifications.Side24
+import SpecificationProofs.Side24Elementary
+
+/-!
+# SIDE24 analysis proofs: the theta family, the Section 2 derivative bounds and lattice sum,
+the Section 1 reference blocks and pin density, the Section 4 ratio and density comparison
+(statement module `Specifications.Side24`)
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+Every theorem outside the `Aux` namespace has as its type exactly one registered `Prop` of
+`Specifications/Side24.lean` (statement packet `specifications/lean_statements_20261010`, which
+is not modified here). A kernel-checked proof of such a `Prop` is evidence about that `Prop`
+only: it does not make the informal Layer 0 note (SIDE24-COEFFICIENT-D23-20260924-v1, register
+row `side24-coefficient`) reviewed, accepted or "verified", it does not identify the formal
+definitions with the informal objects (that alignment is PENDING_INDEPENDENT_REVIEW), it does
+not enclose the coefficient `c_{d,24}`, and it promotes, closes, discharges or reclassifies
+nothing. The disposition of `side24-coefficient` (REVIEWED_SCOPED) is transcribed in the
+register, not derived here.
+
+Provenance: the nine `Prop`s proved here were selected by the round-4 triage (workflow
+`wf_a3531fd8-891`) of the registered `Prop`s still without a theorem; each proof was written and
+verified in its own lane (one file per `Prop`) and the lane files were merged into this module,
+with the developments the lanes reproduced from one another removed, call sites repointed to the
+sibling inventory theorems, and the lanes' helper tags kept. Helper lemmas live in
+`UniversalLaw.Proofs.Side24Analysis.Aux`, tagged by the `Prop` they serve (`th_`, `dp_`, `d1_`,
+`d0_`, `rb_`, `rp_`, `ir_`, `li_`, `dc_`); the gate inventories only the nine theorems outside
+that namespace. The mathematics, in the order of the module:
+
+* `ThetaSummable d` (`th_`): `‖24 n‖^2 = 576 ∑ n_i^2`, the shift bound
+ `exp(-‖z + v‖^2/2) ≤ exp(‖z‖^2/2) exp(-‖v‖^2/4)`, `Real.exp_sum`, the one-dimensional
+ summability of `m ↦ exp(-c m^2)` on `ℤ` (`HurwitzKernelBounds.summable_f_int`) and a
+ `Fintype.piFinset` product bound for `n ↦ ∏ i, g (n i)` over `Fin d → ℤ`;
+ `Summable.of_nonneg_of_le` assembles the `Prop` for every `d`.
+* `DerivativePairingBound` (`dp_`): no closed form for the iterated Fréchet derivative of the
+ Gaussian is used; the operator norms `b_q = ‖iteratedFDeriv ℝ q (Kinf d) x‖` satisfy the
+ Hermite-type recursion `b_{q+2} ≤ ‖x‖ b_{q+1} + (q+1) b_q` (`norm_iteratedFDeriv_fderiv`,
+ `fderiv ℝ (Kinf d) y = Kinf d y • (-(innerSL ℝ y))`, the Leibniz bound
+ `norm_iteratedFDeriv_smul_le`), `b_0 = Kinf d x`, `b_1 = Kinf d x ‖x‖`, and the orders `q ≤ 6`
+ match the unfolded `pairingSum`; `ContinuousMultilinearMap.le_opNorm` at a unit tuple.
+* `DerivativeBoundAtLeastOne` (`d1_`) and `DerivativeBoundAtZero` (`d0_`): consequences of the
+ pairing bound through hypothesis-form helpers, with `pairingSum q r ≤ 76 r^6` for `r ≥ 1` and
+ `pairingSum q 0 ≤ 15`.
+* `ReferenceOddAndPinBlocks` (`rb_`): the contractions of `Kinf d` at `0` are evaluated by
+ peeling one direction at a time (`iteratedFDeriv_succ_apply_right`,
+ `iteratedFDeriv_clm_apply_const_apply`) with explicit `HasFDerivAt` closed forms of the
+ intermediate functions, giving `-⟪a, b⟫`, the three pairings at order four and `-15 ⟪u, u⟫^3`
+ at order six; in an orthonormal frame the five blocks follow.
+* `ReferencePinDensityProduct` (`rp_`): the two block identities of the previous `Prop` and the
+ density algebra `(2π)^(-d/2) (2π)^(-d/2) 3^(-1/2) = (2π)^(-d) / √3`.
+* `IntegrandRatioBounds` (`ir_`): pure real arithmetic in `epsilon = 10^(-108)`; Bernoulli's
+ inequality, exponent monotonicity of the real power and two exact rational inequalities of
+ degree five decided by `norm_num`.
+* `LatticeImageSumBound` (`li_`): a uniform bound on the finite partial sums via a power-mean
+ inequality, `Real.exp_sum`, the `Fintype.piFinset` factorisation and one-dimensional sums over
+ `ℤ` compared with the geometric series through the registered `SuccessiveTermRatio`
+ (`SpecificationProofs.Side24Elementary.successiveTermRatio`, whence the import); the bound
+ obtained is `432 exp(-288) ≤ 1458 exp(-288)`.
+* `DensityComparison` (`dc_`): real matrix analysis; Loewner antitonicity of the inverse and
+ monotonicity of the determinant (through `CFC.sqrt`, `Matrix.PosSemidef.conjTranspose_mul_mul_same`,
+ `Matrix.IsHermitian.det_eq_prod_eigenvalues`), determinant scaling and real-power bookkeeping.
+
+Remarks recorded by the lanes, for the maintainers (nothing below is edited here): the
+proof-packet README rows "Side24 derivative bounds" ("Mathlib has no closed form for the iterated
+Fréchet derivatives of a Gaussian"), "Side24 lattice sums" ("Mathlib's Jacobi-theta results are
+one-dimensional") and "Side24 covariance and density" ("the evaluation of the Fréchet derivatives
+is not available"; `IntegrandRatioBounds` grouped as "built on the derivative contractions") give
+informal reasons that these proofs show are not load-bearing for the `Prop`s proved here; the
+statement module's docstring for `ThetaSummable` reads "Does not claim: that the family is summable
+(true, but not shown here)". Each is a remark about an informal reason or a statement-packet text,
+not about any claim; no register label changes.
+-/
+
+namespace UniversalLaw.Proofs.Side24Analysis
+
+open UniversalLaw.Spec.Side24
+open scoped ContDiff
+open scoped RealInnerProductSpace
+open scoped MatrixOrder
+open scoped Pointwise
+
+namespace Aux
+
+/-! ## `th_`: the theta family (`ThetaSummable`) -/
+
+/-! ### (a) Coordinates and squared norm of the lattice vector `24 n` -/
+
+/-- The `i`-th coordinate of `latticeVec d n` is `24 n_i`. -/
+theorem th_latticeVec_apply (d : ℕ) (n : Fin d → ℤ) (i : Fin d) :
+ latticeVec d n i = 24 * (n i : ℝ) := by
+ simp [latticeVec]
+
+/-- `‖24 n‖^2 = 576 * ∑ i, n_i^2` (`EuclideanSpace.norm_sq_eq`, coordinatewise). -/
+theorem th_norm_latticeVec_sq (d : ℕ) (n : Fin d → ℤ) :
+ ‖latticeVec d n‖ ^ 2 = 576 * intNormSq d n := by
+ rw [EuclideanSpace.norm_sq_eq, intNormSq, Finset.mul_sum]
+ refine Finset.sum_congr rfl fun i _ => ?_
+ rw [th_latticeVec_apply, Real.norm_eq_abs, sq_abs]
+ ring
+
+/-- `exp(-‖24 n‖^2/4) = ∏ i, exp(-144 n_i^2)`, by `Real.exp_sum` and the previous lemma. -/
+theorem th_exp_neg_norm_latticeVec_sq (d : ℕ) (n : Fin d → ℤ) :
+ Real.exp (-(‖latticeVec d n‖ ^ 2) / 4) = ∏ i, Real.exp (-144 * ((n i : ℤ) : ℝ) ^ 2) := by
+ rw [← Real.exp_sum, th_norm_latticeVec_sq, intNormSq, Finset.mul_sum, neg_div,
+ Finset.sum_div, ← Finset.sum_neg_distrib]
+ congr 1
+ refine Finset.sum_congr rfl fun i _ => ?_
+ ring
+
+/-! ### (b) One-dimensional Gaussian summability on `ℤ` -/
+
+/-- `m ↦ exp(-c m^2)` is summable on `ℤ` for `c > 0`: Mathlib's
+`HurwitzKernelBounds.summable_f_int 0 0` at `t = c/π` after `-π m^2 (c/π) = -c m^2`. -/
+theorem th_summable_gauss_int (c : ℝ) (hc : 0 < c) :
+ Summable (fun m : ℤ => Real.exp (-c * (m : ℝ) ^ 2)) := by
+ have h := HurwitzKernelBounds.summable_f_int 0 0 (t := c / Real.pi) (by positivity)
+ refine h.congr fun m => ?_
+ simp only [HurwitzKernelBounds.f_int, add_zero, pow_zero, one_mul]
+ congr 1
+ field_simp
+
+/-! ### (c) Products of a summable nonnegative function over `Fin d → ℤ` -/
+
+/-- For a nonnegative summable `g : ℤ → ℝ`, the product `n ↦ ∏ i, g (n i)` is summable over
+`Fin d → ℤ`: a finite set `s` of lattice points lies in the box `Fintype.piFinset t` with
+`t i = s.image (· i)`, over which the sum factors as `∏ i, ∑ m ∈ t i, g m ≤ (∑' m, g m)^d`. -/
+theorem th_summable_pi_prod (d : ℕ) (g : ℤ → ℝ) (hg0 : ∀ m, 0 ≤ g m) (hg : Summable g) :
+ Summable (fun n : Fin d → ℤ => ∏ i, g (n i)) := by
+ refine summable_of_sum_le (c := (∑' m, g m) ^ d)
+ (fun n => Finset.prod_nonneg fun i _ => hg0 _) fun s => ?_
+ set t : Fin d → Finset ℤ := fun i => s.image (fun n => n i)
+ have hsub : s ⊆ Fintype.piFinset t := fun n hn => by
+ rw [Fintype.mem_piFinset]
+ intro i
+ exact Finset.mem_image_of_mem _ hn
+ have hle : ∀ i, ∑ m ∈ t i, g m ≤ ∑' m, g m := fun i =>
+ hg.sum_le_tsum (t i) (fun m _ => hg0 m)
+ calc ∑ n ∈ s, ∏ i, g (n i) ≤ ∑ n ∈ Fintype.piFinset t, ∏ i, g (n i) :=
+ Finset.sum_le_sum_of_subset_of_nonneg hsub fun n _ _ => Finset.prod_nonneg fun i _ => hg0 _
+ _ = ∏ i, ∑ m ∈ t i, g m := (Finset.prod_univ_sum t fun _ m => g m).symm
+ _ ≤ ∏ _i : Fin d, ∑' m, g m :=
+ Finset.prod_le_prod₀ (fun i _ => Finset.sum_nonneg fun m _ => hg0 m) (fun i _ => hle i)
+ _ = (∑' m, g m) ^ d := by simp
+
+/-! ### (d) The pointwise shift bound -/
+
+/-- `exp(-‖z + v‖^2/2) ≤ exp(‖z‖^2/2) exp(-‖v‖^2/4)`: from `‖v‖ ≤ ‖z + v‖ + ‖z‖` one has
+`‖v‖^2/4 ≤ (‖z + v‖ + ‖z‖)^2/4 ≤ ‖z + v‖^2/2 + ‖z‖^2/2`. -/
+theorem th_exp_shift_le (d : ℕ) (z v : E d) :
+ Real.exp (-(‖z + v‖ ^ 2) / 2) ≤ Real.exp (‖z‖ ^ 2 / 2) * Real.exp (-(‖v‖ ^ 2) / 4) := by
+ rw [← Real.exp_add, Real.exp_le_exp]
+ have h1 : ‖v‖ ≤ ‖z + v‖ + ‖z‖ := by
+ calc ‖v‖ = ‖(z + v) - z‖ := by rw [add_sub_cancel_left]
+ _ ≤ ‖z + v‖ + ‖z‖ := norm_sub_le _ _
+ have h2 : 0 ≤ ‖z + v‖ := norm_nonneg _
+ have h3 : 0 ≤ ‖z‖ := norm_nonneg _
+ have h4 : 0 ≤ ‖v‖ := norm_nonneg _
+ nlinarith [sq_nonneg (‖z + v‖ - ‖z‖)]
+
+/-- The dominating family `n ↦ exp(‖z‖^2/2) ∏ i, exp(-144 n_i^2)` is summable over
+`Fin d → ℤ`. -/
+theorem th_summable_dominant (d : ℕ) (z : E d) :
+ Summable (fun n : Fin d → ℤ =>
+ Real.exp (‖z‖ ^ 2 / 2) * ∏ i, Real.exp (-144 * ((n i : ℤ) : ℝ) ^ 2)) :=
+ (th_summable_pi_prod d _ (fun m => (Real.exp_pos _).le)
+ (th_summable_gauss_int 144 (by norm_num))).mul_left _
+
+/-- Each theta term is bounded by the corresponding dominating term. -/
+theorem th_term_le_dominant (d : ℕ) (z : E d) (n : Fin d → ℤ) :
+ Real.exp (-(‖z + latticeVec d n‖ ^ 2) / 2) ≤
+ Real.exp (‖z‖ ^ 2 / 2) * ∏ i, Real.exp (-144 * ((n i : ℤ) : ℝ) ^ 2) := by
+ calc Real.exp (-(‖z + latticeVec d n‖ ^ 2) / 2)
+ ≤ Real.exp (‖z‖ ^ 2 / 2) * Real.exp (-(‖latticeVec d n‖ ^ 2) / 4) := th_exp_shift_le d z _
+ _ = Real.exp (‖z‖ ^ 2 / 2) * ∏ i, Real.exp (-144 * ((n i : ℤ) : ℝ) ^ 2) := by
+ rw [th_exp_neg_norm_latticeVec_sq]
+
+/-! ## `dp_`: the derivative pairing bound (`DerivativePairingBound`) -/
+
+/-! ### Smoothness and first derivative of the reference kernel `Kinf` -/
+
+/-- `Kinf d = exp (-‖·‖^2 / 2)` is `C^∞` on `E d`. -/
+theorem dp_contDiff_Kinf (d : ℕ) : ContDiff ℝ ∞ (Kinf d) := by
+ unfold Kinf
+ have h : ContDiff ℝ ∞ (fun x : E d => -(‖x‖ ^ 2) / 2) :=
+ (contDiff_norm_sq ℝ (E := E d)).neg.div_const 2
+ exact Real.contDiff_exp.comp h
+
+/-- The first derivative of `Kinf d` at `x` is `Kinf d x • (-(innerSL ℝ x))`, i.e.
+`v ↦ -⟪x, v⟫ Kinf d x`. -/
+theorem dp_hasFDerivAt_Kinf (d : ℕ) (x : E d) :
+ HasFDerivAt (Kinf d) (Kinf d x • (-(innerSL ℝ x))) x := by
+ have h0 : HasFDerivAt (fun y : E d => ‖y‖ ^ 2) ((2 : ℕ) • innerSL ℝ x) x :=
+ (hasStrictFDerivAt_norm_sq x).hasFDerivAt
+ have h1 := (h0.const_smul (-(1 / 2 : ℝ))).exp
+ convert h1 using 1
+ · funext y
+ simp only [Kinf, Pi.smul_apply, smul_eq_mul]
+ ring_nf
+ · ext v
+ simp [Kinf]
+ left
+ ring
+
+/-- The derivative function of `Kinf d`. -/
+theorem dp_fderiv_Kinf (d : ℕ) :
+ fderiv ℝ (Kinf d) = fun y => Kinf d y • (-(innerSL ℝ y)) :=
+ funext fun y => (dp_hasFDerivAt_Kinf d y).fderiv
+
+/-! ### The operator-valued factor `g y = -(innerSL ℝ y)` -/
+
+/-- `y ↦ -(innerSL ℝ y)` is `C^∞` (it is a continuous linear map). -/
+theorem dp_contDiff_g (d : ℕ) : ContDiff ℝ ∞ (fun y : E d => -(innerSL ℝ y)) :=
+ (ContinuousLinearMap.contDiff (innerSL ℝ)).neg
+
+/-- The factor as the coercion of the continuous linear map `-(innerSL ℝ)`. -/
+theorem dp_g_eq (d : ℕ) :
+ (fun y : E d => -(innerSL ℝ y)) = ⇑(-(innerSL ℝ (E := E d))) := by
+ funext y
+ simp
+
+/-- Order zero: `‖g x‖ = ‖x‖` (`innerSL_apply_norm`). -/
+theorem dp_norm_g_zero (d : ℕ) (x : E d) :
+ ‖iteratedFDeriv ℝ 0 (fun y : E d => -(innerSL ℝ y)) x‖ = ‖x‖ := by
+ rw [norm_iteratedFDeriv_zero, norm_neg, innerSL_apply_norm]
+
+/-- Order one: `‖D g x‖ = ‖innerSL ℝ‖ ≤ 1` (`norm_innerSL_le`). -/
+theorem dp_norm_g_one (d : ℕ) (x : E d) :
+ ‖iteratedFDeriv ℝ 1 (fun y : E d => -(innerSL ℝ y)) x‖ ≤ 1 := by
+ rw [norm_iteratedFDeriv_one, dp_g_eq, ContinuousLinearMap.fderiv, norm_neg]
+ exact norm_innerSL_le ℝ
+
+/-- Orders `k ≥ 2` of the linear factor vanish. -/
+theorem dp_g_higher (d : ℕ) (x : E d) (k : ℕ) (hk : 2 ≤ k) :
+ iteratedFDeriv ℝ k (fun y : E d => -(innerSL ℝ y)) x = 0 := by
+ obtain ⟨j, rfl⟩ : ∃ j, k = j + 1 := ⟨k - 1, by omega⟩
+ rw [dp_g_eq, iteratedFDeriv_succ_eq_comp_right]
+ have hconst : fderiv ℝ ⇑(-(innerSL ℝ (E := E d))) = fun _ => -(innerSL ℝ (E := E d)) :=
+ funext fun y => (-(innerSL ℝ (E := E d))).fderiv
+ simp only [Function.comp_apply, hconst, iteratedFDeriv_const_of_ne (show j ≠ 0 by omega),
+ Pi.zero_apply]
+ exact LinearIsometryEquiv.map_zero _
+
+/-! ### The Hermite-type recursion for the operator norms -/
+
+/-- Hermite-type recursion for `b_q = ‖D^q Kinf (x)‖`:
+`b_{q+2} ≤ ‖x‖ b_{q+1} + (q+1) b_q`, from `norm_iteratedFDeriv_fderiv`, the explicit first
+derivative, and the Leibniz bound `norm_iteratedFDeriv_smul_le` in which only the terms
+`i = q` and `i = q + 1` of the binomial sum survive. -/
+theorem dp_recursion (d : ℕ) (x : E d) (q : ℕ) :
+ ‖iteratedFDeriv ℝ (q + 2) (Kinf d) x‖ ≤
+ ‖x‖ * ‖iteratedFDeriv ℝ (q + 1) (Kinf d) x‖ +
+ (q + 1) * ‖iteratedFDeriv ℝ q (Kinf d) x‖ := by
+ rw [← norm_iteratedFDeriv_fderiv, dp_fderiv_Kinf]
+ have h := norm_iteratedFDeriv_smul_le (dp_contDiff_Kinf d) (dp_contDiff_g d) x
+ (n := q + 1) (WithTop.coe_le_coe.mpr le_top)
+ refine h.trans ?_
+ rw [Finset.sum_range_succ, Finset.sum_range_succ]
+ have hz : ∑ i ∈ Finset.range q, ((q + 1).choose i : ℝ) * ‖iteratedFDeriv ℝ i (Kinf d) x‖ *
+ ‖iteratedFDeriv ℝ (q + 1 - i) (fun y : E d => -(innerSL ℝ y)) x‖ = 0 := by
+ refine Finset.sum_eq_zero fun i hi => ?_
+ rw [Finset.mem_range] at hi
+ rw [dp_g_higher d x _ (by omega), norm_zero, mul_zero]
+ rw [hz, zero_add, Nat.choose_self, Nat.choose_succ_self_right, Nat.add_sub_cancel_left,
+ Nat.sub_self, dp_norm_g_zero]
+ have h1 := dp_norm_g_one d x
+ have hb : 0 ≤ ‖iteratedFDeriv ℝ q (Kinf d) x‖ := norm_nonneg _
+ push_cast
+ nlinarith [mul_le_mul_of_nonneg_left h1 (mul_nonneg (by positivity : (0 : ℝ) ≤ (q : ℝ) + 1) hb)]
+
+/-! ### The seven explicit orders -/
+
+/-- `Kinf d x > 0`. -/
+theorem dp_Kinf_pos (d : ℕ) (x : E d) : 0 < Kinf d x := Real.exp_pos _
+
+/-- `b_0 = Kinf d x`. -/
+theorem dp_b0 (d : ℕ) (x : E d) : ‖iteratedFDeriv ℝ 0 (Kinf d) x‖ = Kinf d x := by
+ rw [norm_iteratedFDeriv_zero, Real.norm_eq_abs, abs_of_pos (dp_Kinf_pos d x)]
+
+/-- `b_1 = Kinf d x * ‖x‖`. -/
+theorem dp_b1 (d : ℕ) (x : E d) : ‖iteratedFDeriv ℝ 1 (Kinf d) x‖ = Kinf d x * ‖x‖ := by
+ rw [norm_iteratedFDeriv_one, dp_fderiv_Kinf, norm_smul, norm_neg, innerSL_apply_norm,
+ Real.norm_eq_abs, abs_of_pos (dp_Kinf_pos d x)]
+
+/-- `b_2 ≤ Kinf d x * (‖x‖^2 + 1)`. -/
+theorem dp_b2 (d : ℕ) (x : E d) :
+ ‖iteratedFDeriv ℝ 2 (Kinf d) x‖ ≤ Kinf d x * (‖x‖ ^ 2 + 1) := by
+ have h := dp_recursion d x 0
+ rw [dp_b1, dp_b0] at h
+ push_cast at h
+ nlinarith [h]
+
+/-- `b_3 ≤ Kinf d x * (‖x‖^3 + 3 ‖x‖)`. -/
+theorem dp_b3 (d : ℕ) (x : E d) :
+ ‖iteratedFDeriv ℝ 3 (Kinf d) x‖ ≤ Kinf d x * (‖x‖ ^ 3 + 3 * ‖x‖) := by
+ have h := dp_recursion d x 1
+ have h2 := dp_b2 d x
+ have h1 := dp_b1 d x
+ have hr : 0 ≤ ‖x‖ := norm_nonneg _
+ push_cast at h
+ nlinarith [mul_le_mul_of_nonneg_left h2 hr]
+
+/-- `b_4 ≤ Kinf d x * (‖x‖^4 + 6 ‖x‖^2 + 3)`. -/
+theorem dp_b4 (d : ℕ) (x : E d) :
+ ‖iteratedFDeriv ℝ 4 (Kinf d) x‖ ≤ Kinf d x * (‖x‖ ^ 4 + 6 * ‖x‖ ^ 2 + 3) := by
+ have h := dp_recursion d x 2
+ have h3 := dp_b3 d x
+ have h2 := dp_b2 d x
+ have hr : 0 ≤ ‖x‖ := norm_nonneg _
+ push_cast at h
+ nlinarith [mul_le_mul_of_nonneg_left h3 hr]
+
+/-- `b_5 ≤ Kinf d x * (‖x‖^5 + 10 ‖x‖^3 + 15 ‖x‖)`. -/
+theorem dp_b5 (d : ℕ) (x : E d) :
+ ‖iteratedFDeriv ℝ 5 (Kinf d) x‖ ≤ Kinf d x * (‖x‖ ^ 5 + 10 * ‖x‖ ^ 3 + 15 * ‖x‖) := by
+ have h := dp_recursion d x 3
+ have h4 := dp_b4 d x
+ have h3 := dp_b3 d x
+ have hr : 0 ≤ ‖x‖ := norm_nonneg _
+ push_cast at h
+ nlinarith [mul_le_mul_of_nonneg_left h4 hr]
+
+/-- `b_6 ≤ Kinf d x * (‖x‖^6 + 15 ‖x‖^4 + 45 ‖x‖^2 + 15)`. -/
+theorem dp_b6 (d : ℕ) (x : E d) :
+ ‖iteratedFDeriv ℝ 6 (Kinf d) x‖ ≤
+ Kinf d x * (‖x‖ ^ 6 + 15 * ‖x‖ ^ 4 + 45 * ‖x‖ ^ 2 + 15) := by
+ have h := dp_recursion d x 4
+ have h5 := dp_b5 d x
+ have h4 := dp_b4 d x
+ have hr : 0 ≤ ‖x‖ := norm_nonneg _
+ push_cast at h
+ nlinarith [mul_le_mul_of_nonneg_left h5 hr]
+
+/-- For `q ≤ 6`, `b_q ≤ Kinf d x * pairingSum q ‖x‖`: the explicit bounds `dp_b0` to `dp_b6`
+match the unfolded pairing sums (`Finset.sum_range_succ`, `Nat.factorial`). -/
+theorem dp_pairing_all (d : ℕ) (x : E d) (q : ℕ) (hq : q ≤ 6) :
+ ‖iteratedFDeriv ℝ q (Kinf d) x‖ ≤ Kinf d x * pairingSum q ‖x‖ := by
+ interval_cases q
+ · rw [dp_b0]
+ simp [pairingSum]
+ · rw [dp_b1]
+ simp [pairingSum]
+ · refine (dp_b2 d x).trans (le_of_eq ?_)
+ congr 1
+ simp [pairingSum, Finset.sum_range_succ, Nat.factorial]
+ try ring
+ · refine (dp_b3 d x).trans (le_of_eq ?_)
+ congr 1
+ simp [pairingSum, Finset.sum_range_succ, Nat.factorial]
+ try ring
+ · refine (dp_b4 d x).trans (le_of_eq ?_)
+ congr 1
+ simp [pairingSum, Finset.sum_range_succ, Nat.factorial]
+ try ring
+ · refine (dp_b5 d x).trans (le_of_eq ?_)
+ congr 1
+ simp [pairingSum, Finset.sum_range_succ, Nat.factorial]
+ try ring
+ · refine (dp_b6 d x).trans (le_of_eq ?_)
+ congr 1
+ simp [pairingSum, Finset.sum_range_succ, Nat.factorial]
+ try ring
+
+/-! ### Contraction at a unit tuple -/
+
+/-- At a unit tuple the contraction is bounded by the operator norm
+(`ContinuousMultilinearMap.le_opNorm` with `∏ ‖u i‖ = 1`). -/
+theorem dp_abs_le_opNorm (d q : ℕ) (x : E d) (u : Fin q → E d) (hu : IsUnitTuple d q u) :
+ |iteratedFDeriv ℝ q (Kinf d) x u| ≤ ‖iteratedFDeriv ℝ q (Kinf d) x‖ := by
+ have h := (iteratedFDeriv ℝ q (Kinf d) x).le_opNorm u
+ have hp : ∏ i, ‖u i‖ = 1 := Finset.prod_eq_one (fun i _ => hu i)
+ rw [hp, mul_one] at h
+ simpa [Real.norm_eq_abs] using h
+
+/-! ## `d1_`: the derivative bound at `|x| ≥ 1` (`DerivativeBoundAtLeastOne`) -/
+
+/-! ### The elementary pairing-sum bound at `r ≥ 1` -/
+
+/-- For `q ≤ 6` and `1 ≤ r`, `pairingSum q r ≤ 76 r^6`. Each pairing sum unfolds
+(`Finset.sum_range_succ`, `Nat.factorial`) to a polynomial with nonnegative coefficients summing
+to `1, 1, 2, 4, 10, 26, 76` for `q = 0, …, 6`; every monomial `r^k`, `k ≤ 6`, is at most `r^6`
+(`pow_le_pow_right₀`, `one_le_pow₀`). -/
+theorem d1_pairingSum_le_of_one_le (q : ℕ) (hq : q ≤ 6) (r : ℝ) (hr : 1 ≤ r) :
+ pairingSum q r ≤ 76 * r ^ 6 := by
+ have h0 : 1 ≤ r ^ 6 := one_le_pow₀ hr
+ have h1 : r ≤ r ^ 6 := by
+ simpa using pow_le_pow_right₀ hr (show 1 ≤ 6 by norm_num)
+ have h2 : r ^ 2 ≤ r ^ 6 := pow_le_pow_right₀ hr (by norm_num)
+ have h3 : r ^ 3 ≤ r ^ 6 := pow_le_pow_right₀ hr (by norm_num)
+ have h4 : r ^ 4 ≤ r ^ 6 := pow_le_pow_right₀ hr (by norm_num)
+ have h5 : r ^ 5 ≤ r ^ 6 := pow_le_pow_right₀ hr (by norm_num)
+ interval_cases q <;> simp only [pairingSum, Finset.sum_range_succ, Finset.sum_range_zero,
+ Nat.factorial] <;> norm_num <;> nlinarith [h0, h1, h2, h3, h4, h5, hr]
+
+/-! ### Hypothesis form: the Prop from `DerivativePairingBound` -/
+
+/-- `DerivativeBoundAtLeastOne` from `DerivativePairingBound`: at `1 ≤ ‖x‖` the pairing bound
+`|D^q Kinf (x) u| ≤ exp(-‖x‖²/2) · pairingSum q ‖x‖` and `pairingSum q ‖x‖ ≤ 76 ‖x‖^6`
+(`d1_pairingSum_le_of_one_le`) give the Prop by `mul_le_mul_of_nonneg_left` with
+`0 ≤ exp(-‖x‖²/2)` (`Real.exp_pos`). -/
+theorem d1_derivativeBoundAtLeastOne_of_derivativePairingBound
+ (h : UniversalLaw.Spec.Side24.DerivativePairingBound) :
+ UniversalLaw.Spec.Side24.DerivativeBoundAtLeastOne := by
+ intro d q hq x hx u hu
+ have hpair : |iteratedFDeriv ℝ q (Kinf d) x u| ≤
+ Real.exp (-(‖x‖ ^ 2) / 2) * pairingSum q ‖x‖ := h d q hq x u hu
+ have hps : pairingSum q ‖x‖ ≤ 76 * ‖x‖ ^ 6 := d1_pairingSum_le_of_one_le q hq ‖x‖ hx
+ have hexp : 0 ≤ Real.exp (-(‖x‖ ^ 2) / 2) := (Real.exp_pos _).le
+ calc |iteratedFDeriv ℝ q (Kinf d) x u|
+ ≤ Real.exp (-(‖x‖ ^ 2) / 2) * pairingSum q ‖x‖ := hpair
+ _ ≤ Real.exp (-(‖x‖ ^ 2) / 2) * (76 * ‖x‖ ^ 6) := mul_le_mul_of_nonneg_left hps hexp
+ _ = 76 * ‖x‖ ^ 6 * Real.exp (-(‖x‖ ^ 2) / 2) := by ring
+
+/-! ## `d0_`: the derivative bound at the origin (`DerivativeBoundAtZero`) -/
+
+/-! ### The pairing sums at the origin -/
+
+/-- At `r = 0` the pairing sums of order `q ≤ 6` are `1, 0, 1, 0, 3, 0, 15` (only the `j = q/2`
+term of an even order survives, `0 ^ 0 = 1`), hence at most `15`. -/
+theorem d0_pairingSum_zero_le (q : ℕ) (hq : q ≤ 6) : pairingSum q 0 ≤ 15 := by
+ interval_cases q <;> simp [pairingSum, Finset.sum_range_succ, Nat.factorial] <;> norm_num
+
+/-! ### The hypothesis form: the bound at the origin from the pairing bound -/
+
+/-- `DerivativeBoundAtZero` from `DerivativePairingBound` taken as a hypothesis: specialise the
+pairing bound to `x = 0`, where `‖0‖ = 0` and `exp (-(0 ^ 2) / 2) = 1`, and bound
+`pairingSum q 0 ≤ 15` by `d0_pairingSum_zero_le`. -/
+theorem d0_derivativeBoundAtZero_of_derivativePairingBound
+ (h : UniversalLaw.Spec.Side24.DerivativePairingBound) :
+ UniversalLaw.Spec.Side24.DerivativeBoundAtZero := by
+ intro d q hq u hu
+ have h0 := h d q hq 0 u hu
+ have hx : Real.exp (-(‖(0 : E d)‖ ^ 2) / 2) * pairingSum q ‖(0 : E d)‖ = pairingSum q 0 := by
+ simp
+ rw [hx] at h0
+ exact h0.trans (d0_pairingSum_zero_le q hq)
+
+/-! ## `rb_`: the Section 1 reference blocks (`ReferenceOddAndPinBlocks`) -/
+
+/-! ### (a) Smoothness and first derivative of the reference kernel -/
+
+/-- `Kinf d = exp (-‖·‖^2 / 2)` is `C^∞` (`contDiff_norm_sq`, `ContDiff.exp`). -/
+theorem rb_kinf_contDiff {d : ℕ} : ContDiff ℝ (⊤ : ℕ∞) (Kinf d) := by
+ unfold Kinf
+ exact ContDiff.exp (ContDiff.div_const (ContDiff.neg (contDiff_norm_sq ℝ)) 2)
+
+/-- The Fréchet derivative of `Kinf d` at `y`, as `HasFDerivAt` (chain rule through
+`hasStrictFDerivAt_norm_sq` and `HasFDerivAt.exp`). -/
+theorem rb_hasFDerivAt_kinf {d : ℕ} (y : E d) :
+ HasFDerivAt (Kinf d)
+ (Real.exp (-(‖y‖ ^ 2) / 2) • ((2 : ℝ)⁻¹ • -((2 : ℕ) • innerSL ℝ y))) y := by
+ have h1 : HasFDerivAt (fun z : E d => -(‖z‖ ^ 2) / 2)
+ ((2 : ℝ)⁻¹ • -((2 : ℕ) • innerSL ℝ y)) y := by
+ have := (hasStrictFDerivAt_norm_sq y).hasFDerivAt.neg.mul_const (2 : ℝ)⁻¹
+ refine this.congr_of_eventuallyEq (Filter.Eventually.of_forall fun z => ?_)
+ simp [div_eq_mul_inv]
+ exact h1.exp
+
+/-- `fderiv ℝ (Kinf d) y v = -(⟪y, v⟫ * Kinf d y)`. -/
+theorem rb_fderiv_kinf {d : ℕ} (y v : E d) :
+ fderiv ℝ (Kinf d) y v = -(⟪y, v⟫ * Kinf d y) := by
+ rw [(rb_hasFDerivAt_kinf y).fderiv]
+ simp [Kinf, two_smul, innerSL_apply_apply]
+ ring
+
+/-! ### (b) Peeling one direction off an iterated derivative -/
+
+/-- 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]`
+(`iteratedFDeriv_succ_apply_right` with `iteratedFDeriv_clm_apply_const_apply`). -/
+theorem rb_peel {d : ℕ} (f : E d → ℝ) (hf : ContDiff ℝ (⊤ : ℕ∞) f) (n : ℕ) (x : E d)
+ (m : Fin (n + 1) → E d) :
+ iteratedFDeriv ℝ (n + 1) f x m =
+ iteratedFDeriv ℝ n (fun y => fderiv ℝ f y (m (Fin.last n))) x (Fin.init m) := by
+ rw [iteratedFDeriv_succ_apply_right]
+ rw [iteratedFDeriv_clm_apply_const_apply (contDiff_infty_iff_fderiv.mp hf).2
+ (mod_cast le_top)]
+
+/-- `y ↦ ⟪y, v⟫` is `C^∞`. -/
+theorem rb_inner_contDiff {d : ℕ} (v : E d) : ContDiff ℝ (⊤ : ℕ∞) (fun y : E d => ⟪y, v⟫) :=
+ contDiff_id.inner ℝ contDiff_const
+
+/-! ### (c) Level one: `g₁ y = -(⟪y, v⟫ Kinf d y)` -/
+
+/-- Smoothness of the level-one function. -/
+theorem rb_g1_contDiff {d : ℕ} (v : E d) :
+ ContDiff ℝ (⊤ : ℕ∞) (fun y : E d => -(⟪y, v⟫ * Kinf d y)) :=
+ ((rb_inner_contDiff v).mul rb_kinf_contDiff).neg
+
+/-- Derivative of the level-one function in direction `w`. -/
+theorem rb_fderiv_g1 {d : ℕ} (v y w : E d) :
+ fderiv ℝ (fun y : E d => -(⟪y, v⟫ * Kinf d y)) y w =
+ -(⟪w, v⟫ * Kinf d y) + ⟪y, v⟫ * ⟪y, w⟫ * Kinf d y := by
+ have h : HasFDerivAt (fun y : E d => -(⟪y, v⟫ * Kinf d y)) _ y :=
+ (((hasFDerivAt_id y).inner ℝ (hasFDerivAt_const v y)).mul (rb_hasFDerivAt_kinf y)).neg
+ rw [h.fderiv]
+ simp [Kinf, two_smul, innerSL_apply_apply, fderivInnerCLM_apply]
+ ring
+
+/-! ### (d) Level two: `g₂ y = -(⟪w, v⟫ Kinf d y) + ⟪y, v⟫ ⟪y, w⟫ Kinf d y` -/
+
+/-- Smoothness of the level-two function. -/
+theorem rb_g2_contDiff {d : ℕ} (v w : E d) :
+ ContDiff ℝ (⊤ : ℕ∞) (fun y : E d => -(⟪w, v⟫ * Kinf d y) + ⟪y, v⟫ * ⟪y, w⟫ * Kinf d y) :=
+ ((contDiff_const.mul rb_kinf_contDiff).neg.add
+ (((rb_inner_contDiff v).mul (rb_inner_contDiff w)).mul rb_kinf_contDiff))
+
+/-- Derivative of the level-two function in direction `a`. -/
+theorem rb_fderiv_g2 {d : ℕ} (v w y a : E d) :
+ fderiv ℝ (fun y : E d => -(⟪w, v⟫ * Kinf d y) + ⟪y, v⟫ * ⟪y, w⟫ * Kinf d y) y a =
+ ⟪w, v⟫ * ⟪y, a⟫ * Kinf d y + (⟪a, v⟫ * ⟪y, w⟫ + ⟪y, v⟫ * ⟪a, w⟫) * Kinf d y
+ - ⟪y, v⟫ * ⟪y, w⟫ * ⟪y, a⟫ * Kinf d y := by
+ have h : HasFDerivAt
+ (fun y : E d => -(⟪w, v⟫ * Kinf d y) + ⟪y, v⟫ * ⟪y, w⟫ * Kinf d y) _ y :=
+ (((rb_hasFDerivAt_kinf y).const_mul _).neg).add
+ ((((hasFDerivAt_id y).inner ℝ (hasFDerivAt_const v y)).mul
+ ((hasFDerivAt_id y).inner ℝ (hasFDerivAt_const w y))).mul (rb_hasFDerivAt_kinf y))
+ rw [h.fderiv]
+ simp [Kinf, two_smul, innerSL_apply_apply, fderivInnerCLM_apply]
+ ring
+
+/-! ### (e) Level three at the origin, general directions -/
+
+/-- Derivative at `0` of the level-three function in direction `c`: the three pairings. -/
+theorem rb_fderiv_g3_zero {d : ℕ} (v w a c : E d) :
+ fderiv ℝ (fun y : E d => ⟪w, v⟫ * ⟪y, a⟫ * Kinf d y
+ + (⟪a, v⟫ * ⟪y, w⟫ + ⟪y, v⟫ * ⟪a, w⟫) * Kinf d y
+ - ⟪y, v⟫ * ⟪y, w⟫ * ⟪y, a⟫ * Kinf d y) 0 c =
+ ⟪w, v⟫ * ⟪c, a⟫ + ⟪a, v⟫ * ⟪c, w⟫ + ⟪c, v⟫ * ⟪a, w⟫ := by
+ have h : HasFDerivAt (fun y : E d => ⟪w, v⟫ * ⟪y, a⟫ * Kinf d y
+ + (⟪a, v⟫ * ⟪y, w⟫ + ⟪y, v⟫ * ⟪a, w⟫) * Kinf d y
+ - ⟪y, v⟫ * ⟪y, w⟫ * ⟪y, a⟫ * Kinf d y) _ 0 :=
+ (((((hasFDerivAt_id (0 : E d)).inner ℝ (hasFDerivAt_const a 0)).const_mul _).mul
+ (rb_hasFDerivAt_kinf 0)).add
+ ((((((hasFDerivAt_id (0 : E d)).inner ℝ (hasFDerivAt_const w 0)).const_mul _).add
+ (((hasFDerivAt_id (0 : E d)).inner ℝ (hasFDerivAt_const v 0)).mul_const _))).mul
+ (rb_hasFDerivAt_kinf 0))).sub
+ (((((hasFDerivAt_id (0 : E d)).inner ℝ (hasFDerivAt_const v 0)).mul
+ ((hasFDerivAt_id (0 : E d)).inner ℝ (hasFDerivAt_const w 0))).mul
+ ((hasFDerivAt_id (0 : E d)).inner ℝ (hasFDerivAt_const a 0))).mul
+ (rb_hasFDerivAt_kinf 0))
+ rw [h.fderiv]
+ simp [Kinf, fderivInnerCLM_apply]
+ ring
+
+/-- Fourth-order contraction of `Kinf d` at `0`: `D^4 Kinf 0 [c, a, w, v]` is the sum of the
+three pairings `⟪w, v⟫⟪c, a⟫ + ⟪a, v⟫⟪c, w⟫ + ⟪c, v⟫⟪a, w⟫`. -/
+theorem rb_order_four {d : ℕ} (c a w v : E d) :
+ derivContraction d (Kinf d) 0 [c, a, w, v] =
+ ⟪w, v⟫ * ⟪c, a⟫ + ⟪a, v⟫ * ⟪c, w⟫ + ⟪c, v⟫ * ⟪a, w⟫ := by
+ show iteratedFDeriv ℝ 4 (Kinf d) 0 (fun i => [c, a, w, v].get i) = _
+ rw [rb_peel _ rb_kinf_contDiff]
+ simp only [rb_fderiv_kinf]
+ show iteratedFDeriv ℝ 3 (fun y => -(⟪y, v⟫ * Kinf d y)) 0
+ (Fin.init fun i => [c, a, w, v].get i) = _
+ rw [rb_peel _ (rb_g1_contDiff v)]
+ simp only [rb_fderiv_g1]
+ show iteratedFDeriv ℝ 2 (fun y => -(⟪w, v⟫ * Kinf d y) + ⟪y, v⟫ * ⟪y, w⟫ * Kinf d y) 0
+ (Fin.init (Fin.init fun i => [c, a, w, v].get i)) = _
+ rw [rb_peel _ (rb_g2_contDiff v w)]
+ simp only [rb_fderiv_g2]
+ show iteratedFDeriv ℝ 1 (fun y => ⟪w, v⟫ * ⟪y, a⟫ * Kinf d y
+ + (⟪a, v⟫ * ⟪y, w⟫ + ⟪y, v⟫ * ⟪a, w⟫) * Kinf d y
+ - ⟪y, v⟫ * ⟪y, w⟫ * ⟪y, a⟫ * Kinf d y) 0
+ (Fin.init (Fin.init (Fin.init fun i => [c, a, w, v].get i))) = _
+ rw [iteratedFDeriv_one_apply]
+ show fderiv ℝ (fun y : E d => ⟪w, v⟫ * ⟪y, a⟫ * Kinf d y
+ + (⟪a, v⟫ * ⟪y, w⟫ + ⟪y, v⟫ * ⟪a, w⟫) * Kinf d y
+ - ⟪y, v⟫ * ⟪y, w⟫ * ⟪y, a⟫ * Kinf d y) 0 c = _
+ exact rb_fderiv_g3_zero v w a c
+
+/-! ### (f) Levels three to five along one direction `u` (Hermite forms) -/
+
+/-- Smoothness of `(3 ⟪u,u⟫ ⟪y,u⟫ - ⟪y,u⟫^3) Kinf d y`. -/
+theorem rb_P3_contDiff {d : ℕ} (u : E d) : ContDiff ℝ (⊤ : ℕ∞)
+ (fun y : E d => (3 * ⟪u, u⟫ * ⟪y, u⟫ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) :=
+ ((contDiff_const.mul (rb_inner_contDiff u)).sub
+ (((rb_inner_contDiff u).mul (rb_inner_contDiff u)).mul (rb_inner_contDiff u))).mul
+ rb_kinf_contDiff
+
+/-- Derivative along `u` of the level-three Hermite form. -/
+theorem rb_fderiv_P3 {d : ℕ} (u y : E d) :
+ fderiv ℝ (fun y : E d => (3 * ⟪u, u⟫ * ⟪y, u⟫ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) y u =
+ (3 * ⟪u, u⟫ * ⟪u, u⟫ - 6 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫)
+ + ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y := by
+ have hin : HasFDerivAt (fun y : E d => ⟪y, u⟫) _ y :=
+ (hasFDerivAt_id y).inner ℝ (hasFDerivAt_const u y)
+ have h : HasFDerivAt
+ (fun y : E d => (3 * ⟪u, u⟫ * ⟪y, u⟫ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) _ y :=
+ ((hin.const_mul _).sub ((hin.mul hin).mul hin)).mul (rb_hasFDerivAt_kinf y)
+ rw [h.fderiv]
+ simp [Kinf, two_smul, innerSL_apply_apply, fderivInnerCLM_apply]
+ ring
+
+/-- Smoothness of the level-four Hermite form. -/
+theorem rb_P4_contDiff {d : ℕ} (u : E d) : ContDiff ℝ (⊤ : ℕ∞)
+ (fun y : E d => (3 * ⟪u, u⟫ * ⟪u, u⟫ - 6 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫)
+ + ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) :=
+ ((contDiff_const.sub
+ (contDiff_const.mul ((rb_inner_contDiff u).mul (rb_inner_contDiff u)))).add
+ ((((rb_inner_contDiff u).mul (rb_inner_contDiff u)).mul (rb_inner_contDiff u)).mul
+ (rb_inner_contDiff u))).mul rb_kinf_contDiff
+
+/-- Derivative along `u` of the level-four Hermite form. -/
+theorem rb_fderiv_P4 {d : ℕ} (u y : E d) :
+ fderiv ℝ (fun y : E d => (3 * ⟪u, u⟫ * ⟪u, u⟫ - 6 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫)
+ + ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) y u =
+ (-15 * (⟪u, u⟫ * ⟪u, u⟫) * ⟪y, u⟫ + 10 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫)
+ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y := by
+ have hin : HasFDerivAt (fun y : E d => ⟪y, u⟫) _ y :=
+ (hasFDerivAt_id y).inner ℝ (hasFDerivAt_const u y)
+ have h : HasFDerivAt (fun y : E d => (3 * ⟪u, u⟫ * ⟪u, u⟫ - 6 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫)
+ + ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) _ y :=
+ (((hasFDerivAt_const _ y).sub ((hin.mul hin).const_mul _)).add
+ (((hin.mul hin).mul hin).mul hin)).mul (rb_hasFDerivAt_kinf y)
+ rw [h.fderiv]
+ simp [Kinf, two_smul, innerSL_apply_apply, fderivInnerCLM_apply]
+ ring
+
+/-- Derivative at `0` along `u` of the level-five Hermite form: `-15 ⟪u, u⟫^3`. -/
+theorem rb_fderiv_P5_zero {d : ℕ} (u : E d) :
+ fderiv ℝ (fun y : E d => (-15 * (⟪u, u⟫ * ⟪u, u⟫) * ⟪y, u⟫
+ + 10 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫)
+ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) 0 u =
+ -15 * (⟪u, u⟫ * ⟪u, u⟫ * ⟪u, u⟫) := by
+ have hin : HasFDerivAt (fun y : E d => ⟪y, u⟫) _ (0 : E d) :=
+ (hasFDerivAt_id (0 : E d)).inner ℝ (hasFDerivAt_const u 0)
+ have h : HasFDerivAt (fun y : E d => (-15 * (⟪u, u⟫ * ⟪u, u⟫) * ⟪y, u⟫
+ + 10 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫)
+ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) _ 0 :=
+ (((hin.const_mul _).add (((hin.mul hin).mul hin).const_mul _)).sub
+ ((((hin.mul hin).mul hin).mul hin).mul hin)).mul (rb_hasFDerivAt_kinf 0)
+ rw [h.fderiv]
+ simp [Kinf, fderivInnerCLM_apply]
+ ring
+
+/-- Sixth-order contraction of `Kinf d` at `0` along one direction: `-15 ⟪u, u⟫^3`. -/
+theorem rb_order_six {d : ℕ} (u : E d) :
+ derivContraction d (Kinf d) 0 [u, u, u, u, u, u] = -15 * (⟪u, u⟫ * ⟪u, u⟫ * ⟪u, u⟫) := by
+ show iteratedFDeriv ℝ 6 (Kinf d) 0 (fun i => [u, u, u, u, u, u].get i) = _
+ rw [rb_peel _ rb_kinf_contDiff]
+ simp only [rb_fderiv_kinf]
+ show iteratedFDeriv ℝ 5 (fun y => -(⟪y, u⟫ * Kinf d y)) 0 _ = _
+ rw [rb_peel _ (rb_g1_contDiff u)]
+ simp only [rb_fderiv_g1]
+ show iteratedFDeriv ℝ 4 (fun y => -(⟪u, u⟫ * Kinf d y) + ⟪y, u⟫ * ⟪y, u⟫ * Kinf d y) 0 _ = _
+ rw [rb_peel _ (rb_g2_contDiff u u)]
+ simp only [rb_fderiv_g2]
+ show iteratedFDeriv ℝ 3 (fun y => ⟪u, u⟫ * ⟪y, u⟫ * Kinf d y
+ + (⟪u, u⟫ * ⟪y, u⟫ + ⟪y, u⟫ * ⟪u, u⟫) * Kinf d y
+ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * Kinf d y) 0 _ = _
+ rw [show (fun y : E d => ⟪u, u⟫ * ⟪y, u⟫ * Kinf d y
+ + (⟪u, u⟫ * ⟪y, u⟫ + ⟪y, u⟫ * ⟪u, u⟫) * Kinf d y
+ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * Kinf d y) =
+ fun y : E d => (3 * ⟪u, u⟫ * ⟪y, u⟫ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y from
+ funext fun y => by ring]
+ rw [rb_peel _ (rb_P3_contDiff u)]
+ show iteratedFDeriv ℝ 2 (fun y => fderiv ℝ (fun y : E d =>
+ (3 * ⟪u, u⟫ * ⟪y, u⟫ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) y u) 0 _ = _
+ simp only [rb_fderiv_P3]
+ show iteratedFDeriv ℝ 2 (fun y : E d => (3 * ⟪u, u⟫ * ⟪u, u⟫ - 6 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫)
+ + ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) 0 _ = _
+ rw [rb_peel _ (rb_P4_contDiff u)]
+ show iteratedFDeriv ℝ 1 (fun y => fderiv ℝ (fun y : E d =>
+ (3 * ⟪u, u⟫ * ⟪u, u⟫ - 6 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫)
+ + ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) y u) 0 _ = _
+ simp only [rb_fderiv_P4]
+ show iteratedFDeriv ℝ 1 (fun y : E d => (-15 * (⟪u, u⟫ * ⟪u, u⟫) * ⟪y, u⟫
+ + 10 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫)
+ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) 0 _ = _
+ rw [iteratedFDeriv_one_apply]
+ show fderiv ℝ (fun y : E d => (-15 * (⟪u, u⟫ * ⟪u, u⟫) * ⟪y, u⟫
+ + 10 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫)
+ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) 0 u = _
+ exact rb_fderiv_P5_zero u
+
+/-! ### (g) Second-order contraction and the blocks in an orthonormal frame -/
+
+/-- Second-order contraction of `Kinf d` at `0`: `D^2 Kinf 0 [a, b] = -⟪a, b⟫`. -/
+theorem rb_order_two {d : ℕ} (a b : E d) : derivContraction d (Kinf d) 0 [a, b] = -⟪a, b⟫ := by
+ show iteratedFDeriv ℝ 2 (Kinf d) 0 (fun i => [a, b].get i) = -⟪a, b⟫
+ rw [rb_peel _ rb_kinf_contDiff, iteratedFDeriv_one_apply]
+ simp only [rb_fderiv_kinf]
+ show fderiv ℝ (fun y : E d => -(⟪y, b⟫ * Kinf d y)) 0 a = -⟪a, b⟫
+ rw [rb_fderiv_g1]
+ simp [Kinf]
+
+/-- The gradient block of `Kinf d` in an orthonormal frame is the identity. -/
+theorem rb_gradCov {d : ℕ} (R : Fin d → E d) (hR : Orthonormal ℝ R) :
+ gradCov d (Kinf d) R = 1 := by
+ ext i j
+ simp only [gradCov, Matrix.of_apply, rb_order_two, neg_neg, Matrix.one_apply]
+ exact orthonormal_iff_ite.mp hR i j
+
+/-- The pin block of `Kinf d` with `u = R 0` in an orthonormal frame is `diagonal (3, 1, …, 1)`. -/
+theorem rb_pinCov {d : ℕ} (hd : 0 < d) (R : Fin d → E d) (hR : Orthonormal ℝ R) :
+ pinCov d (Kinf d) (R ⟨0, hd⟩) R =
+ Matrix.diagonal (fun i => if i = ⟨0, hd⟩ then 3 else 1) := by
+ have hite := orthonormal_iff_ite.mp hR
+ ext i j
+ simp only [pinCov, Matrix.of_apply, rb_order_four, hite, Matrix.diagonal_apply]
+ by_cases hi : i = ⟨0, hd⟩
+ · subst hi
+ by_cases hj : j = ⟨0, hd⟩
+ · subst hj
+ norm_num
+ · simp [Ne.symm hj]
+ · by_cases hj : j = ⟨0, hd⟩
+ · subst hj
+ simp [hi, Ne.symm hi]
+ · simp [hi, Ne.symm hi, Ne.symm hj]
+
+/-- The third-derivative/gradient covariance vector of `Kinf d` with `u = R 0` is
+`(-3, 0, …, 0)`. -/
+theorem rb_thirdGradCov {d : ℕ} (hd : 0 < d) (R : Fin d → E d) (hR : Orthonormal ℝ R) :
+ thirdGradCov d (Kinf d) (R ⟨0, hd⟩) R = fun j => if j = ⟨0, hd⟩ then -3 else 0 := by
+ have hite := orthonormal_iff_ite.mp hR
+ funext j
+ simp only [thirdGradCov, rb_order_four, hite]
+ by_cases hj : j = ⟨0, hd⟩
+ · simp [hj]; norm_num
+ · have hj' : ¬ ((⟨0, hd⟩ : Fin d) = j) := fun h => hj h.symm
+ simp [hj, hj']
+
+/-- The third-derivative variance of `Kinf d` along a unit vector `u = R 0` is `15`. -/
+theorem rb_thirdVar {d : ℕ} (hd : 0 < d) (R : Fin d → E d) (hR : Orthonormal ℝ R) :
+ thirdVar d (Kinf d) (R ⟨0, hd⟩) = 15 := by
+ have hite := orthonormal_iff_ite.mp hR
+ simp only [thirdVar, rb_order_six, hite]
+ simp
+
+/-- The Schur complement `condThirdVariance` of `Kinf d` in an orthonormal frame is `15 - 9 = 6`. -/
+theorem rb_condThirdVariance {d : ℕ} (hd : 0 < d) (R : Fin d → E d) (hR : Orthonormal ℝ R) :
+ condThirdVariance d (Kinf d) (R ⟨0, hd⟩) R = 6 := by
+ unfold condThirdVariance
+ rw [rb_thirdVar hd R hR, rb_gradCov R hR, rb_thirdGradCov hd R hR, inv_one,
+ Matrix.one_mulVec]
+ simp [dotProduct, ite_mul, Finset.sum_ite_eq']
+ norm_num
+
+/-! ## `rp_`: the reference pin-density product (`ReferencePinDensityProduct`) -/
+
+/-! ### The density algebra at the reference blocks -/
+
+/-- `det (diagonal (3, 1, …, 1)) = 3` (the single `3` sits at the coordinate `0`). -/
+theorem rp_det_pinDiagonal (d : ℕ) (hd : 0 < d) :
+ (Matrix.diagonal fun i : Fin d => if i = ⟨0, hd⟩ then (3 : ℝ) else 1).det = 3 := by
+ rw [Matrix.det_diagonal, Finset.prod_ite_eq']
+ simp
+
+/-- The product of the two centred Gaussian densities at `0`, for the covariance blocks `1` and
+`diagonal (3, 1, …, 1)`: `(2π)^(-d/2) · (2π)^(-d/2) · 3^(-1/2) = (2π)^(-d) / √3`. -/
+theorem rp_density_algebra (d : ℕ) (hd : 0 < d) :
+ gaussDensity d 1 0 *
+ gaussDensity d (Matrix.diagonal fun i : Fin d => if i = ⟨0, hd⟩ then (3 : ℝ) else 1) 0 =
+ (2 * Real.pi) ^ (-(d : ℝ)) / Real.sqrt 3 := by
+ have hpi : (0 : ℝ) < 2 * Real.pi := by positivity
+ simp only [gaussDensity, rp_det_pinDiagonal d hd, Matrix.det_one, Matrix.mulVec_zero,
+ dotProduct_zero, neg_zero, zero_div, Real.exp_zero, mul_one, Real.one_rpow]
+ rw [← mul_assoc, ← Real.rpow_add hpi, show -(d : ℝ) / 2 + -(d : ℝ) / 2 = -(d : ℝ) by ring,
+ show (-1 : ℝ) / 2 = -(1 / 2) by norm_num, Real.rpow_neg (by norm_num : (0 : ℝ) ≤ 3),
+ Real.sqrt_eq_rpow]
+ exact (div_eq_mul_inv _ _).symm
+
+/-! ### The common core: the Prop from the two block identities -/
+
+/-- `ReferencePinDensityProduct` from the two block identities `gradCov d (Kinf d) R = 1` and
+`pinCov d (Kinf d) (R 0) R = diagonal (3, 1, …, 1)` (for `d ∈ {2, 3}` and orthonormal `R`), by
+rewriting the blocks and `rp_density_algebra`. -/
+theorem rp_referencePinDensityProduct_of_blockIdentities
+ (hblk : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ gradCov d (Kinf d) R = 1 ∧
+ pinCov d (Kinf d) (R ⟨0, hd⟩) R = Matrix.diagonal (fun i => if i = ⟨0, hd⟩ then 3 else 1)) :
+ UniversalLaw.Spec.Side24.ReferencePinDensityProduct := by
+ intro d hd23 hd R hR
+ obtain ⟨hG, hV⟩ := hblk d hd23 hd R hR
+ rw [hG, hV]
+ exact rp_density_algebra d hd
+
+/-! ### The hypothesis form: the Prop from `ReferenceOddAndPinBlocks` -/
+
+/-- `ReferencePinDensityProduct` from `ReferenceOddAndPinBlocks` taken as a hypothesis: only its
+first conjunct (`gradCov d (Kinf d) R = 1`) and fourth conjunct
+(`pinCov d (Kinf d) (R 0) R = diagonal (3, 1, …, 1)`) are used. -/
+theorem rp_referencePinDensityProduct_of_referenceOddAndPinBlocks
+ (h : UniversalLaw.Spec.Side24.ReferenceOddAndPinBlocks) :
+ UniversalLaw.Spec.Side24.ReferencePinDensityProduct := by
+ apply rp_referencePinDensityProduct_of_blockIdentities
+ intro d hd23 hd R hR
+ obtain ⟨hG, -, -, hV, -⟩ := h d hd23 hd R hR
+ exact ⟨hG, hV⟩
+
+/-! ## `ir_`: the Section 4 integrand-ratio bounds (`IntegrandRatioBounds`) -/
+
+/-! ### (a) Elementary facts about `epsilon = 10^(-108)` -/
+
+/-- `0 < epsilon`. -/
+theorem ir_epsilon_pos : (0 : ℝ) < epsilon := by
+ unfold epsilon
+ positivity
+
+/-- `epsilon < 1/100`: a crude upper bound sufficient for every sign condition below. -/
+theorem ir_epsilon_lt : epsilon < (1 / 100 : ℝ) := by
+ unfold epsilon
+ norm_num
+
+/-- `0 < 1 - epsilon`. -/
+theorem ir_one_sub_epsilon_pos : (0 : ℝ) < 1 - epsilon := by
+ have := ir_epsilon_lt
+ linarith
+
+/-- `1 ≤ 1 + epsilon`. -/
+theorem ir_one_le_one_add_epsilon : (1 : ℝ) ≤ 1 + epsilon := by
+ have := ir_epsilon_pos
+ linarith
+
+/-! ### (b) The two one-sided power estimates -/
+
+/-- For a real exponent `b ≤ 5`, `(1 + epsilon)^b ≤ (1 + epsilon)^5`: monotonicity of the real
+power in the exponent for a base `≥ 1` (`Real.rpow_le_rpow_of_exponent_le`), with the natural
+power on the right via `Real.rpow_natCast`. -/
+theorem ir_rpow_le_pow_five (b : ℝ) (hb : b ≤ 5) :
+ (1 + epsilon) ^ b ≤ (1 + epsilon) ^ 5 := by
+ have h := Real.rpow_le_rpow_of_exponent_le ir_one_le_one_add_epsilon hb
+ rwa [show (5 : ℝ) = ((5 : ℕ) : ℝ) by norm_num, Real.rpow_natCast] at h
+
+/-- Bernoulli's inequality at `s = -epsilon`: for a real exponent `a ≥ 1`,
+`1 - a epsilon ≤ (1 - epsilon)^a` (`one_add_mul_self_le_rpow_one_add`). -/
+theorem ir_bernoulli (a : ℝ) (ha : 1 ≤ a) : 1 - a * epsilon ≤ (1 - epsilon) ^ a := by
+ have hε := ir_epsilon_lt
+ have h := one_add_mul_self_le_rpow_one_add (show (-1 : ℝ) ≤ -epsilon by linarith) ha
+ rw [show (1 : ℝ) + -epsilon = 1 - epsilon by ring] at h
+ linarith
+
+/-! ### (c) The two exact rational inequalities (degree five in `epsilon`) -/
+
+/-- `(1 - 13 epsilon)(1 + epsilon)^5 ≤ 1 - 5 epsilon`, exact rational arithmetic. -/
+theorem ir_lower_rational : (1 - 13 * epsilon) * (1 + epsilon) ^ 5 ≤ 1 - 5 * epsilon := by
+ unfold epsilon
+ norm_num
+
+/-- `(1 + epsilon)^5 ≤ (1 + 28 epsilon)(1 - 5 epsilon)`, exact rational arithmetic. -/
+theorem ir_upper_rational : (1 + epsilon) ^ 5 ≤ (1 + 28 * epsilon) * (1 - 5 * epsilon) := by
+ unfold epsilon
+ norm_num
+
+/-! ### (d) The ratio bounds for arbitrary exponents in `[1, 5]` -/
+
+/-- Lower bound: for `1 ≤ a ≤ 5` and `1 ≤ b ≤ 5`,
+`1 - 13 epsilon ≤ (1 - epsilon)^a / (1 + epsilon)^b`. -/
+theorem ir_lower_bound (a b : ℝ) (ha1 : 1 ≤ a) (ha5 : a ≤ 5) (hb5 : b ≤ 5) :
+ 1 - 13 * epsilon ≤ (1 - epsilon) ^ a / (1 + epsilon) ^ b := by
+ have hε := ir_epsilon_pos
+ have hε1 := ir_epsilon_lt
+ have hpb : 0 < (1 + epsilon) ^ b := Real.rpow_pos_of_pos (by linarith) _
+ have hae : a * epsilon ≤ 5 * epsilon := mul_le_mul_of_nonneg_right ha5 hε.le
+ rw [le_div_iff₀ hpb]
+ calc (1 - 13 * epsilon) * (1 + epsilon) ^ b
+ ≤ (1 - 13 * epsilon) * (1 + epsilon) ^ 5 :=
+ mul_le_mul_of_nonneg_left (ir_rpow_le_pow_five b hb5) (by linarith)
+ _ ≤ 1 - 5 * epsilon := ir_lower_rational
+ _ ≤ 1 - a * epsilon := by linarith
+ _ ≤ (1 - epsilon) ^ a := ir_bernoulli a ha1
+
+/-- Upper bound: for `a ≤ 5` and `1 ≤ b ≤ 5`,
+`(1 + epsilon)^a / (1 - epsilon)^b ≤ 1 + 28 epsilon`. -/
+theorem ir_upper_bound (a b : ℝ) (ha5 : a ≤ 5) (hb1 : 1 ≤ b) (hb5 : b ≤ 5) :
+ (1 + epsilon) ^ a / (1 - epsilon) ^ b ≤ 1 + 28 * epsilon := by
+ have hε := ir_epsilon_pos
+ have hqb : 0 < (1 - epsilon) ^ b := Real.rpow_pos_of_pos ir_one_sub_epsilon_pos _
+ have hbe : b * epsilon ≤ 5 * epsilon := mul_le_mul_of_nonneg_right hb5 hε.le
+ rw [div_le_iff₀ hqb]
+ calc (1 + epsilon) ^ a ≤ (1 + epsilon) ^ 5 := ir_rpow_le_pow_five a ha5
+ _ ≤ (1 + 28 * epsilon) * (1 - 5 * epsilon) := ir_upper_rational
+ _ ≤ (1 + 28 * epsilon) * (1 - b * epsilon) :=
+ mul_le_mul_of_nonneg_left (by linarith) (by linarith)
+ _ ≤ (1 + 28 * epsilon) * (1 - epsilon) ^ b :=
+ mul_le_mul_of_nonneg_left (ir_bernoulli b hb1) (by linarith)
+
+/-- Both ratio bounds together, for `1 ≤ a ≤ 5` and `1 ≤ b ≤ 5`. -/
+theorem ir_ratio_bounds (a b : ℝ) (ha1 : 1 ≤ a) (ha5 : a ≤ 5) (hb1 : 1 ≤ b) (hb5 : b ≤ 5) :
+ 1 - 13 * epsilon ≤ (1 - epsilon) ^ a / (1 + epsilon) ^ b ∧
+ (1 + epsilon) ^ a / (1 - epsilon) ^ b ≤ 1 + 28 * epsilon :=
+ ⟨ir_lower_bound a b ha1 ha5 hb5, ir_upper_bound a b ha5 hb1 hb5⟩
+
+/-! ### (e) The exponents in dimensions two and three -/
+
+/-- `exponentA 2 = 13/6` (`m = 1`, `n = 1`: `1 + 2/3 + 1/2`). -/
+theorem ir_exponentA_two : exponentA 2 = 13 / 6 := by
+ simp [exponentA, symCoordDim]
+ norm_num
+
+/-- `exponentB 2 = 5/2` (`d = 2`, `n = 1`: `2 + 1/2`). -/
+theorem ir_exponentB_two : exponentB 2 = 5 / 2 := by
+ simp [exponentB, symCoordDim]
+ norm_num
+
+/-- `exponentA 3 = 25/6` (`m = 2`, `n = 3`: `2 + 2/3 + 3/2`). -/
+theorem ir_exponentA_three : exponentA 3 = 25 / 6 := by
+ simp [exponentA, symCoordDim]
+ norm_num
+
+/-- `exponentB 3 = 9/2` (`d = 3`, `n = 3`: `3 + 3/2`). -/
+theorem ir_exponentB_three : exponentB 3 = 9 / 2 := by
+ simp [exponentB, symCoordDim]
+ norm_num
+
+/-! ## `li_`: the lattice-image sum bound (`LatticeImageSumBound`) -/
+
+/-! ### (a) The geometric tail `(n+1)^9 exp(-288 (n+1)^2) ≤ exp(-288) (1/2)^n` -/
+
+/-- Induction on `n` from the registered successive-term ratio: the ratio of consecutive terms
+`j^9 exp(-288 j^2)` is at most `512 exp(-864) < 1/2`
+(`UniversalLaw.Proofs.Side24Elementary.successiveTermRatio`). -/
+theorem li_geom_tail (n : ℕ) :
+ ((n : ℝ) + 1) ^ 9 * Real.exp (-288 * ((n : ℝ) + 1) ^ 2) ≤ Real.exp (-288) * (1 / 2) ^ n := by
+ induction n with
+ | zero => norm_num
+ | succ n ih =>
+ have h1 := (UniversalLaw.Proofs.Side24Elementary.successiveTermRatio).1 (n + 1) (by omega)
+ have h2 := UniversalLaw.Proofs.Side24Elementary.Aux.ratio_const_lt_half
+ have hnn : 0 ≤ ((n : ℝ) + 1) ^ 9 * Real.exp (-288 * ((n : ℝ) + 1) ^ 2) := by positivity
+ push_cast at h1 ⊢
+ rw [pow_succ]
+ calc _ ≤ 512 * Real.exp (-864) * (((n : ℝ) + 1) ^ 9 * Real.exp (-288 * ((n : ℝ) + 1) ^ 2)) :=
+ h1
+ _ ≤ (1 / 2) * (Real.exp (-288) * (1 / 2) ^ n) := mul_le_mul h2.le ih hnn (by norm_num)
+ _ = Real.exp (-288) * ((1 / 2) ^ n * (1 / 2)) := by ring
+
+/-- `(n+1)^6 exp(-288 (n+1)^2) ≤ exp(-288) (1/2)^n`: the sixth power is at most the ninth. -/
+theorem li_pow6_succ_le (n : ℕ) :
+ ((n : ℝ) + 1) ^ 6 * Real.exp (-288 * ((n : ℝ) + 1) ^ 2) ≤ Real.exp (-288) * (1 / 2) ^ n := by
+ refine le_trans ?_ (li_geom_tail n)
+ have h0 : (0 : ℝ) ≤ n := by positivity
+ have h1 : (1 : ℝ) ≤ (n : ℝ) + 1 := by linarith
+ exact mul_le_mul_of_nonneg_right (pow_le_pow_right₀ h1 (by norm_num)) (Real.exp_pos _).le
+
+/-- `exp(-288 (n+1)^2) ≤ exp(-288) (1/2)^n`: `1 ≤ (n+1)^9`. -/
+theorem li_exp_succ_le (n : ℕ) :
+ Real.exp (-288 * ((n : ℝ) + 1) ^ 2) ≤ Real.exp (-288) * (1 / 2) ^ n := by
+ refine le_trans ?_ (li_geom_tail n)
+ have h0 : (0 : ℝ) ≤ n := by positivity
+ have h1 : (1 : ℝ) ≤ ((n : ℝ) + 1) ^ 9 := one_le_pow₀ (by linarith)
+ exact le_mul_of_one_le_left (Real.exp_pos _).le h1
+
+/-! ### (b) One-dimensional sums over `ℤ` -/
+
+/-- A nonnegative `φ : ℤ → ℝ` whose values at `n+1` and at `-(n+1)` are at most
+`exp(-288) (1/2)^n` is summable over `ℤ`, with `∑' φ ≤ φ 0 + 4 exp(-288)`: split `ℤ` into `ℕ`
+and the negatives (`tsum_of_nat_of_neg_add_one`), peel off `φ 0` (`Summable.tsum_eq_zero_add`)
+and compare both tails with the geometric series (`tsum_geometric_two`). -/
+theorem li_summable_int_tsum_le (φ : ℤ → ℝ) (h0 : ∀ m, 0 ≤ φ m)
+ (hpos : ∀ n : ℕ, φ ((n : ℤ) + 1) ≤ Real.exp (-288) * (1 / 2) ^ n)
+ (hneg : ∀ n : ℕ, φ (-((n : ℤ) + 1)) ≤ Real.exp (-288) * (1 / 2) ^ n) :
+ Summable φ ∧ ∑' m : ℤ, φ m ≤ φ 0 + 4 * Real.exp (-288) := by
+ have hgeo : Summable (fun n : ℕ => Real.exp (-288) * (1 / 2 : ℝ) ^ n) :=
+ summable_geometric_two.mul_left _
+ have hgeo_sum : ∑' n : ℕ, Real.exp (-288) * (1 / 2 : ℝ) ^ n = 2 * Real.exp (-288) := by
+ rw [tsum_mul_left, tsum_geometric_two]
+ ring
+ have hs1 : Summable (fun n : ℕ => φ ((n : ℤ) + 1)) :=
+ Summable.of_nonneg_of_le (fun n => h0 _) hpos hgeo
+ have hs2 : Summable (fun n : ℕ => φ (-((n : ℤ) + 1))) :=
+ Summable.of_nonneg_of_le (fun n => h0 _) hneg hgeo
+ have hs0 : Summable (fun n : ℕ => φ (n : ℤ)) := by
+ refine (summable_nat_add_iff 1).mp ?_
+ refine hs1.congr fun n => ?_
+ norm_cast
+ have hsum0 : ∑' n : ℕ, φ (n : ℤ) ≤ φ 0 + 2 * Real.exp (-288) := by
+ rw [hs0.tsum_eq_zero_add, Nat.cast_zero]
+ have htail : ∑' n : ℕ, φ (((n + 1 : ℕ) : ℤ)) ≤ 2 * Real.exp (-288) := by
+ rw [← hgeo_sum]
+ refine ((summable_nat_add_iff 1).mpr hs0).tsum_le_tsum (fun n => ?_) hgeo
+ rw [Nat.cast_succ]
+ exact hpos n
+ linarith
+ have hsum2 : ∑' n : ℕ, φ (-((n : ℤ) + 1)) ≤ 2 * Real.exp (-288) := by
+ rw [← hgeo_sum]
+ exact hs2.tsum_le_tsum hneg hgeo
+ refine ⟨Summable.of_nat_of_neg_add_one hs0 hs2, ?_⟩
+ rw [tsum_of_nat_of_neg_add_one hs0 hs2]
+ linarith
+
+/-- The Gaussian weight `m ↦ exp(-288 m^2)` is summable over `ℤ` with sum `A ≤ 2`
+(`A ≤ 1 + 4 exp(-288)` and `exp(-288) < 10^(-125)`). -/
+theorem li_gauss_int :
+ Summable (fun m : ℤ => Real.exp (-288 * ((m : ℤ) : ℝ) ^ 2)) ∧
+ ∑' m : ℤ, Real.exp (-288 * ((m : ℤ) : ℝ) ^ 2) ≤ 2 := by
+ have h := li_summable_int_tsum_le (fun m : ℤ => Real.exp (-288 * ((m : ℤ) : ℝ) ^ 2))
+ (fun m => (Real.exp_pos _).le)
+ (fun n => by
+ push_cast
+ exact li_exp_succ_le n)
+ (fun n => by
+ push_cast
+ rw [neg_sq]
+ exact li_exp_succ_le n)
+ refine ⟨h.1, h.2.trans ?_⟩
+ have he := UniversalLaw.Proofs.Side24Elementary.Aux.exp_neg_lt
+ have hp : (1 : ℝ) / 10 ^ 125 ≤ 1 / 4 := by norm_num
+ have h0 : Real.exp (-288 * ((0 : ℤ) : ℝ) ^ 2) = 1 := by simp
+ simp only [h0]
+ linarith
+
+/-- The weight `m ↦ m^6 exp(-288 m^2)` is summable over `ℤ` with sum `B ≤ 4 exp(-288)`. -/
+theorem li_pow_gauss_int :
+ Summable (fun m : ℤ => ((m : ℤ) : ℝ) ^ 6 * Real.exp (-288 * ((m : ℤ) : ℝ) ^ 2)) ∧
+ ∑' m : ℤ, ((m : ℤ) : ℝ) ^ 6 * Real.exp (-288 * ((m : ℤ) : ℝ) ^ 2) ≤
+ 4 * Real.exp (-288) := by
+ have h := li_summable_int_tsum_le
+ (fun m : ℤ => ((m : ℤ) : ℝ) ^ 6 * Real.exp (-288 * ((m : ℤ) : ℝ) ^ 2))
+ (fun m => mul_nonneg (by positivity) (Real.exp_pos _).le)
+ (fun n => by
+ push_cast
+ exact li_pow6_succ_le n)
+ (fun n => by
+ push_cast
+ rw [neg_sq, Even.neg_pow (by decide : Even 6)]
+ exact li_pow6_succ_le n)
+ refine ⟨h.1, h.2.trans ?_⟩
+ simp
+
+/-! ### (c) Finite sums of products over `Fin d → ℤ` -/
+
+/-- For `h : Fin d → ℤ → ℝ` nonnegative and summable in each coordinate, the sum of
+`∏ k, h k (n k)` over a finite set `s` of lattice points is at most `∏ k, ∑' m, h k m`: `s` lies
+in the box `Fintype.piFinset (fun k => s.image (· k))`, over which the sum factors
+(`Finset.prod_univ_sum`), and each factor is a partial sum of a nonnegative summable family
+(`Summable.sum_le_tsum`). -/
+theorem li_sum_prod_le (d : ℕ) (h : Fin d → ℤ → ℝ) (h0 : ∀ k m, 0 ≤ h k m)
+ (hs : ∀ k, Summable (h k)) (s : Finset (Fin d → ℤ)) :
+ ∑ n ∈ s, ∏ k, h k (n k) ≤ ∏ k, ∑' m, h k m := by
+ set t : Fin d → Finset ℤ := fun k => s.image (fun n => n k)
+ have hsub : s ⊆ Fintype.piFinset t := fun n hn => by
+ rw [Fintype.mem_piFinset]
+ intro k
+ exact Finset.mem_image_of_mem _ hn
+ have hle : ∀ k, ∑ m ∈ t k, h k m ≤ ∑' m, h k m := fun k =>
+ (hs k).sum_le_tsum (t k) (fun m _ => h0 k m)
+ calc ∑ n ∈ s, ∏ k, h k (n k) ≤ ∑ n ∈ Fintype.piFinset t, ∏ k, h k (n k) :=
+ Finset.sum_le_sum_of_subset_of_nonneg hsub fun n _ _ => Finset.prod_nonneg fun k _ => h0 _ _
+ _ = ∏ k, ∑ m ∈ t k, h k m := (Finset.prod_univ_sum t fun k m => h k m).symm
+ _ ≤ ∏ k, ∑' m, h k m :=
+ Finset.prod_le_prod₀ (fun k _ => Finset.sum_nonneg fun m _ => h0 k m) (fun k _ => hle k)
+
+/-- A product over `Fin d` with one distinguished factor:
+`∏ k, (if k = i then F k else G k) = F i * ∏ k ∈ univ.erase i, G k`. -/
+theorem li_prod_ite_eq (d : ℕ) (i : Fin d) (F G : Fin d → ℝ) :
+ (∏ k : Fin d, if k = i then F k else G k) = F i * ∏ k ∈ Finset.univ.erase i, G k := by
+ rw [← Finset.mul_prod_erase Finset.univ (fun k => if k = i then F k else G k)
+ (Finset.mem_univ i), ite_eq_left rfl]
+ congr 1
+ exact Finset.prod_congr rfl fun k hk => ite_eq_right (Finset.ne_of_mem_erase hk)
+
+/-- `∏ k, exp(-288 n_k^2) = exp(-288 |n|^2)` (`Real.exp_sum`). -/
+theorem li_prod_exp (d : ℕ) (n : Fin d → ℤ) :
+ ∏ k : Fin d, Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2) = Real.exp (-288 * intNormSq d n) := by
+ rw [← Real.exp_sum, intNormSq, Finset.mul_sum]
+
+/-! ### (d) The pointwise domination for `d ≤ 3` -/
+
+/-- Power mean for at most three nonnegative terms: `(∑ a_i)^3 ≤ 9 ∑ a_i^3` for `d ≤ 3`
+(Jensen's `pow_sum_div_card_le_sum_pow` with `d^2 ≤ 9`; the case `d = 0` is `0 ≤ 0`). -/
+theorem li_sum_cube_le (d : ℕ) (hd : d ≤ 3) (a : Fin d → ℝ) (ha : ∀ i, 0 ≤ a i) :
+ (∑ i, a i) ^ 3 ≤ 9 * ∑ i, a i ^ 3 := by
+ rcases Nat.eq_zero_or_pos d with hd0 | hdpos
+ · subst hd0
+ simp
+ · have hdR : (0 : ℝ) < d := by exact_mod_cast hdpos
+ have h := pow_sum_div_card_le_sum_pow (s := Finset.univ) (f := a) (fun i _ => ha i) 2
+ rw [Finset.card_univ, Fintype.card_fin, div_le_iff₀ (pow_pos hdR 2)] at h
+ have hd' : (d : ℝ) ≤ 3 := by exact_mod_cast hd
+ have hsum : 0 ≤ ∑ i, a i ^ 3 := Finset.sum_nonneg fun i _ => pow_nonneg (ha i) 3
+ calc (∑ i, a i) ^ 3 ≤ (∑ i, a i ^ 3) * (d : ℝ) ^ 2 := h
+ _ ≤ (∑ i, a i ^ 3) * 9 := by
+ apply mul_le_mul_of_nonneg_left _ hsum
+ nlinarith
+ _ = 9 * ∑ i, a i ^ 3 := by ring
+
+/-- `imageTerm d n ≥ 0`. -/
+theorem li_imageTerm_nonneg (d : ℕ) (n : Fin d → ℤ) : 0 ≤ imageTerm d n := by
+ unfold imageTerm
+ split_ifs
+ · exact le_rfl
+ · exact mul_nonneg (pow_nonneg (Finset.sum_nonneg fun i _ => sq_nonneg _) 3) (Real.exp_pos _).le
+
+/-- Pointwise domination for `d ≤ 3`: `imageTerm d n ≤ 9 ∑ i, ∏ k, h_i k (n k)`, where
+`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_i^2)^3 exp(-288 |n|^2)` (`li_prod_ite_eq`, `li_prod_exp`), and `(∑ n_k^2)^3 ≤ 9 ∑ (n_i^2)^3`
+is `li_sum_cube_le`. -/
+theorem li_imageTerm_le (d : ℕ) (hd : d ≤ 3) (n : Fin d → ℤ) :
+ imageTerm d n ≤ 9 * ∑ i : Fin d, ∏ k : Fin d,
+ (if k = i then ((n k : ℤ) : ℝ) ^ 6 * Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2)
+ else Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2)) := by
+ have hprod : ∀ i : Fin d, (∏ k : Fin d,
+ (if k = i then ((n k : ℤ) : ℝ) ^ 6 * Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2)
+ else Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2))) =
+ (((n i : ℤ) : ℝ) ^ 2) ^ 3 * Real.exp (-288 * intNormSq d n) := by
+ intro i
+ rw [li_prod_ite_eq d i (fun k => ((n k : ℤ) : ℝ) ^ 6 * Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2))
+ (fun k => Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2)), ← li_prod_exp d n,
+ ← Finset.mul_prod_erase Finset.univ (fun k => Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2))
+ (Finset.mem_univ i)]
+ ring
+ rw [Finset.sum_congr rfl (fun i _ => hprod i), ← Finset.sum_mul]
+ unfold imageTerm
+ split_ifs
+ · positivity
+ · have h := li_sum_cube_le d hd (fun i => ((n i : ℤ) : ℝ) ^ 2) (fun i => sq_nonneg _)
+ unfold intNormSq
+ calc (∑ i, ((n i : ℤ) : ℝ) ^ 2) ^ 3 * Real.exp (-288 * ∑ i, ((n i : ℤ) : ℝ) ^ 2)
+ ≤ (9 * ∑ i, (((n i : ℤ) : ℝ) ^ 2) ^ 3) * Real.exp (-288 * ∑ i, ((n i : ℤ) : ℝ) ^ 2) :=
+ mul_le_mul_of_nonneg_right h (Real.exp_pos _).le
+ _ = 9 * ((∑ i, (((n i : ℤ) : ℝ) ^ 2) ^ 3) * Real.exp (-288 * ∑ i, ((n i : ℤ) : ℝ) ^ 2)) := by
+ ring
+
+/-! ### (e) The uniform partial-sum bound -/
+
+/-- For `d ≤ 3` and every finite `s`, `∑ n ∈ s, imageTerm d n ≤ 1458 exp(-288)`: the pointwise
+bound `li_imageTerm_le`, the box bound `li_sum_prod_le` for each `i`, the one-dimensional sums
+`A ≤ 2` and `B ≤ 4 exp(-288)` (`li_gauss_int`, `li_pow_gauss_int`), and
+`9 · d · B · A^(d-1) ≤ 9 · 3 · 4 exp(-288) · 4 = 432 exp(-288)`. -/
+theorem li_partial_sum_le (d : ℕ) (hd : d ≤ 3) (s : Finset (Fin d → ℤ)) :
+ ∑ n ∈ s, imageTerm d n ≤ 1458 * Real.exp (-288) := by
+ obtain ⟨hgs, hgle⟩ := li_gauss_int
+ obtain ⟨hfs, hfle⟩ := li_pow_gauss_int
+ have hA0 : 0 ≤ ∑' m : ℤ, Real.exp (-288 * ((m : ℤ) : ℝ) ^ 2) :=
+ tsum_nonneg fun m => (Real.exp_pos _).le
+ have hexp : 0 ≤ Real.exp (-288) := (Real.exp_pos _).le
+ set A : ℝ := ∑' m : ℤ, Real.exp (-288 * ((m : ℤ) : ℝ) ^ 2) with hA
+ set B : ℝ := ∑' m : ℤ, ((m : ℤ) : ℝ) ^ 6 * Real.exp (-288 * ((m : ℤ) : ℝ) ^ 2) with hB
+ have hidx : ∀ i : Fin d, ∑ n ∈ s, ∏ k : Fin d,
+ (if k = i then ((n k : ℤ) : ℝ) ^ 6 * Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2)
+ else Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2)) ≤ 16 * Real.exp (-288) := by
+ intro i
+ have h1 := li_sum_prod_le d
+ (fun k m => if k = i then ((m : ℤ) : ℝ) ^ 6 * Real.exp (-288 * ((m : ℤ) : ℝ) ^ 2)
+ else Real.exp (-288 * ((m : ℤ) : ℝ) ^ 2))
+ (fun k m => by
+ split_ifs
+ · positivity
+ · positivity)
+ (fun k => by
+ by_cases hk : k = i
+ · simp only [hk, ite_true]
+ exact hfs
+ · simp only [hk, ite_false]
+ exact hgs)
+ s
+ have h2 : ∀ k : Fin d, ∑' m : ℤ,
+ (if k = i then ((m : ℤ) : ℝ) ^ 6 * Real.exp (-288 * ((m : ℤ) : ℝ) ^ 2)
+ else Real.exp (-288 * ((m : ℤ) : ℝ) ^ 2)) = if k = i then B else A := by
+ intro k
+ by_cases hk : k = i
+ · simp only [hk, ite_true, hB]
+ · simp only [hk, ite_false, hA]
+ calc _ ≤ _ := h1
+ _ = ∏ k : Fin d, (if k = i then B else A) := Finset.prod_congr rfl fun k _ => h2 k
+ _ = B * ∏ _k ∈ Finset.univ.erase i, A := li_prod_ite_eq d i (fun _ => B) (fun _ => A)
+ _ = B * A ^ (d - 1) := by
+ rw [Finset.prod_const, Finset.card_erase_of_mem (Finset.mem_univ i), Finset.card_univ,
+ Fintype.card_fin]
+ _ ≤ (4 * Real.exp (-288)) * 2 ^ (d - 1) :=
+ mul_le_mul hfle (pow_le_pow_left₀ hA0 hgle _) (pow_nonneg hA0 _) (by positivity)
+ _ ≤ (4 * Real.exp (-288)) * 2 ^ 2 := by
+ apply mul_le_mul_of_nonneg_left _ (by positivity)
+ exact pow_le_pow_right₀ (by norm_num) (by omega)
+ _ = 16 * Real.exp (-288) := by ring
+ calc ∑ n ∈ s, imageTerm d n
+ ≤ ∑ n ∈ s, 9 * ∑ i : Fin d, ∏ k : Fin d,
+ (if k = i then ((n k : ℤ) : ℝ) ^ 6 * Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2)
+ else Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2)) :=
+ Finset.sum_le_sum fun n _ => li_imageTerm_le d hd n
+ _ = 9 * ∑ i : Fin d, ∑ n ∈ s, ∏ k : Fin d,
+ (if k = i then ((n k : ℤ) : ℝ) ^ 6 * Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2)
+ else Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2)) := by
+ rw [← Finset.mul_sum, Finset.sum_comm]
+ _ ≤ 9 * ∑ _i : Fin d, 16 * Real.exp (-288) :=
+ mul_le_mul_of_nonneg_left (Finset.sum_le_sum fun i _ => hidx i) (by norm_num)
+ _ = 9 * ((d : ℝ) * (16 * Real.exp (-288))) := by
+ rw [Finset.sum_const, Finset.card_univ, Fintype.card_fin, nsmul_eq_mul]
+ _ ≤ 9 * (3 * (16 * Real.exp (-288))) := by
+ have hd' : (d : ℝ) ≤ 3 := by exact_mod_cast hd
+ gcongr
+ _ ≤ 1458 * Real.exp (-288) := by linarith
+
+/-! ## `dc_`: the Section 4 Gaussian density comparison (`DensityComparison`) -/
+
+/-! ### (a) Elementary facts about `epsilon = 10^(-108)`
+
+`0 < epsilon` and `0 < 1 - epsilon` are `ir_epsilon_pos` and `ir_one_sub_epsilon_pos` above
+(the `dc_` copies were removed at integration); only `0 < 1 + epsilon` is added here. -/
+
+/-- `0 < 1 + epsilon`. -/
+theorem dc_one_add_epsilon_pos : (0 : ℝ) < 1 + epsilon := by
+ have := ir_epsilon_pos
+ linarith
+
+/-! ### (b) Loewner order: antitonicity of the inverse (L1) -/
+
+/-- The expansion identity `(C - A) A⁻¹ (C - A) + (C - A) = C A⁻¹ C - C` for an invertible `A`. -/
+theorem dc_expand_identity {k : ℕ} (A C : Matrix (Fin k) (Fin k) ℝ) (hA : IsUnit A.det) :
+ (C - A) * A⁻¹ * (C - A) + (C - A) = C * A⁻¹ * C - C := by
+ have h1 : A * A⁻¹ = 1 := Matrix.mul_nonsing_inv A hA
+ have h2 : A⁻¹ * A = 1 := Matrix.nonsing_inv_mul A hA
+ calc (C - A) * A⁻¹ * (C - A) + (C - A)
+ = C * A⁻¹ * C - C * (A⁻¹ * A) - (A * A⁻¹) * C + (A * A⁻¹) * A + (C - A) := by
+ noncomm_ring
+ _ = C * A⁻¹ * C - C := by
+ rw [h1, h2]
+ simp only [Matrix.mul_one, Matrix.one_mul]
+ abel
+
+/-- The conjugation identity `C⁻¹ (C A⁻¹ C - C) C⁻¹ = A⁻¹ - C⁻¹` for an invertible `C`. -/
+theorem dc_conj_identity {k : ℕ} (A C : Matrix (Fin k) (Fin k) ℝ) (hC : IsUnit C.det) :
+ C⁻¹ * (C * A⁻¹ * C - C) * C⁻¹ = A⁻¹ - C⁻¹ := by
+ have h1 : C * C⁻¹ = 1 := Matrix.mul_nonsing_inv C hC
+ have h2 : C⁻¹ * C = 1 := Matrix.nonsing_inv_mul C hC
+ calc C⁻¹ * (C * A⁻¹ * C - C) * C⁻¹
+ = (C⁻¹ * C) * A⁻¹ * (C * C⁻¹) - C⁻¹ * (C * C⁻¹) := by
+ noncomm_ring
+ _ = A⁻¹ - C⁻¹ := by
+ rw [h1, h2]
+ simp only [Matrix.mul_one, Matrix.one_mul]
+
+/-- (L1) For real matrices: `A` positive definite, `C` positive definite and `C - A` positive
+semidefinite give `A⁻¹ - C⁻¹` positive semidefinite, i.e. `C⁻¹ ≤ A⁻¹` in the Loewner order. -/
+theorem dc_inv_sub_inv_posSemidef {k : ℕ} {A C : Matrix (Fin k) (Fin k) ℝ}
+ (hA : A.PosDef) (hC : C.PosDef) (hAC : (C - A).PosSemidef) :
+ (A⁻¹ - C⁻¹).PosSemidef := by
+ have hAu : IsUnit A.det := isUnit_iff_ne_zero.mpr hA.det_pos.ne'
+ have hCu : IsUnit C.det := isUnit_iff_ne_zero.mpr hC.det_pos.ne'
+ have hP : (C * A⁻¹ * C - C).PosSemidef := by
+ have h1 : ((C - A).conjTranspose * A⁻¹ * (C - A)).PosSemidef :=
+ hA.inv.posSemidef.conjTranspose_mul_mul_same (C - A)
+ rw [hAC.isHermitian.eq] at h1
+ have h2 := h1.add hAC
+ rwa [dc_expand_identity A C hAu] at h2
+ have h3 : ((C⁻¹).conjTranspose * (C * A⁻¹ * C - C) * C⁻¹).PosSemidef :=
+ hP.conjTranspose_mul_mul_same C⁻¹
+ rw [hC.inv.isHermitian.eq] at h3
+ rwa [dc_conj_identity A C hCu] at h3
+
+/-- The quadratic-form consequence of (L1): `x ⬝ C⁻¹ x ≤ x ⬝ A⁻¹ x`. -/
+theorem dc_quad_le {k : ℕ} {A C : Matrix (Fin k) (Fin k) ℝ}
+ (hA : A.PosDef) (hC : C.PosDef) (hAC : (C - A).PosSemidef) (x : Fin k → ℝ) :
+ dotProduct x (Matrix.mulVec C⁻¹ x) ≤ dotProduct x (Matrix.mulVec A⁻¹ x) := by
+ have h := (dc_inv_sub_inv_posSemidef hA hC hAC).dotProduct_mulVec_nonneg x
+ simp only [star_trivial, Matrix.sub_mulVec, dotProduct_sub] at h
+ linarith
+
+/-! ### (c) Loewner order: monotonicity of the determinant (L2) -/
+
+/-- A real matrix `M` with `M - 1` positive semidefinite has determinant at least one: every
+eigenvalue of `M` lies in `spectrum ℝ M`, so every eigenvalue minus one lies in
+`spectrum ℝ (M - 1) ⊆ [0, ∞)`, and `det M` is the product of the eigenvalues. -/
+theorem dc_one_le_det {k : ℕ} {M : Matrix (Fin k) (Fin k) ℝ} (hM : (M - 1).PosSemidef) :
+ 1 ≤ M.det := by
+ have hherm : M.IsHermitian := by
+ have h := hM.isHermitian.add (Matrix.isHermitian_one (n := Fin k) (α := ℝ))
+ simpa using h
+ rw [hherm.det_eq_prod_eigenvalues]
+ apply Finset.one_le_prod₀
+ intro i _
+ have hspec := (Matrix.posSemidef_iff_isHermitian_and_spectrum_nonneg.mp hM).2
+ have hmem : hherm.eigenvalues i ∈ spectrum ℝ M := hherm.eigenvalues_mem_spectrum_real i
+ have hmem' : hherm.eigenvalues i - 1 ∈ spectrum ℝ (M - 1) := by
+ have h : hherm.eigenvalues i - 1 ∈ spectrum ℝ M - ({1} : Set ℝ) :=
+ Set.sub_mem_sub hmem (Set.mem_singleton (1 : ℝ))
+ rw [spectrum.sub_singleton_eq] at h
+ simpa using h
+ have h0 : (0 : ℝ) ≤ hherm.eigenvalues i - 1 := hspec hmem'
+ simp only [RCLike.ofReal_real_eq_id, id]
+ linarith
+
+/-- (L2) For real matrices: `A` positive definite and `C - A` positive semidefinite give
+`det A ≤ det C`, through the square root `S = CFC.sqrt A` and `M = S⁻¹ C S⁻¹ ≥ 1`. -/
+theorem dc_det_le_det {k : ℕ} {A C : Matrix (Fin k) (Fin k) ℝ}
+ (hA : A.PosDef) (hAC : (C - A).PosSemidef) : A.det ≤ C.det := by
+ obtain ⟨S, hSS, hSpsd⟩ : ∃ S : Matrix (Fin k) (Fin k) ℝ, S * S = A ∧ S.PosSemidef :=
+ ⟨CFC.sqrt A, CFC.sqrt_mul_sqrt_self A hA.posSemidef.nonneg,
+ Matrix.nonneg_iff_posSemidef.mp (CFC.sqrt_nonneg A)⟩
+ have hSherm : S.conjTranspose = S := hSpsd.isHermitian.eq
+ have hdetA : A.det = S.det * S.det := by
+ rw [← hSS, Matrix.det_mul]
+ have hSdet : S.det ≠ 0 := by
+ intro h
+ have h0 : A.det = 0 := by
+ rw [hdetA, h, mul_zero]
+ exact hA.det_pos.ne' h0
+ have hSu : IsUnit S.det := isUnit_iff_ne_zero.mpr hSdet
+ have hSinv : (S⁻¹).conjTranspose = S⁻¹ := by
+ rw [Matrix.conjTranspose_nonsing_inv, hSherm]
+ have h1 : S * S⁻¹ = 1 := Matrix.mul_nonsing_inv S hSu
+ have h2 : S⁻¹ * S = 1 := Matrix.nonsing_inv_mul S hSu
+ have hM : (S⁻¹ * C * S⁻¹ - 1).PosSemidef := by
+ have h3 : ((S⁻¹).conjTranspose * (C - A) * S⁻¹).PosSemidef :=
+ hAC.conjTranspose_mul_mul_same S⁻¹
+ rw [hSinv] at h3
+ have h4 : S⁻¹ * (C - A) * S⁻¹ = S⁻¹ * C * S⁻¹ - 1 := by
+ rw [← hSS]
+ calc S⁻¹ * (C - S * S) * S⁻¹
+ = S⁻¹ * C * S⁻¹ - (S⁻¹ * S) * (S * S⁻¹) := by
+ noncomm_ring
+ _ = S⁻¹ * C * S⁻¹ - 1 := by
+ rw [h1, h2, Matrix.mul_one]
+ rwa [h4] at h3
+ have hdetM : 1 ≤ (S⁻¹ * C * S⁻¹).det := dc_one_le_det hM
+ have hCeq : S * (S⁻¹ * C * S⁻¹) * S = C := by
+ calc S * (S⁻¹ * C * S⁻¹) * S = (S * S⁻¹) * C * (S⁻¹ * S) := by
+ noncomm_ring
+ _ = C := by
+ rw [h1, h2, Matrix.one_mul, Matrix.mul_one]
+ have hdetC : C.det = S.det * S.det * (S⁻¹ * C * S⁻¹).det := by
+ calc C.det = (S * (S⁻¹ * C * S⁻¹) * S).det := by
+ rw [hCeq]
+ _ = S.det * (S⁻¹ * C * S⁻¹).det * S.det := by
+ rw [Matrix.det_mul, Matrix.det_mul]
+ _ = S.det * S.det * (S⁻¹ * C * S⁻¹).det := by
+ ring
+ have hSS2 : 0 ≤ S.det * S.det := mul_self_nonneg _
+ calc A.det = S.det * S.det := hdetA
+ _ = S.det * S.det * 1 := (mul_one _).symm
+ _ ≤ S.det * S.det * (S⁻¹ * C * S⁻¹).det := mul_le_mul_of_nonneg_left hdetM hSS2
+ _ = C.det := hdetC.symm
+
+/-! ### (d) Determinant scaling and real-power bookkeeping -/
+
+/-- `det (c • C) = c ^ k * det C` for a `k × k` real matrix. -/
+theorem dc_det_smul {k : ℕ} (C : Matrix (Fin k) (Fin k) ℝ) (c : ℝ) :
+ (c • C).det = c ^ k * C.det := by
+ rw [Matrix.det_smul, Fintype.card_fin]
+
+/-- The scaling identity `(a / b)^(k/2) · (a^k D)^(-1/2) = (b^k D)^(-1/2)` for `a, b, D > 0`. -/
+theorem dc_scale_identity (a b D : ℝ) (ha : 0 < a) (hb : 0 < b) (hD : 0 < D) (k : ℕ) :
+ (a / b) ^ ((k : ℝ) / 2) * (a ^ k * D) ^ (-(1 : ℝ) / 2) = (b ^ k * D) ^ (-(1 : ℝ) / 2) := by
+ have hak : (a ^ k) ^ (-(1 : ℝ) / 2) = (a ^ ((k : ℝ) / 2))⁻¹ := by
+ rw [← Real.rpow_natCast, ← Real.rpow_mul ha.le, ← Real.rpow_neg ha.le]
+ congr 1
+ ring
+ have hbk : (b ^ k) ^ (-(1 : ℝ) / 2) = (b ^ ((k : ℝ) / 2))⁻¹ := by
+ rw [← Real.rpow_natCast, ← Real.rpow_mul hb.le, ← Real.rpow_neg hb.le]
+ congr 1
+ ring
+ have hapos : a ^ ((k : ℝ) / 2) ≠ 0 := (Real.rpow_pos_of_pos ha _).ne'
+ have hbpos : b ^ ((k : ℝ) / 2) ≠ 0 := (Real.rpow_pos_of_pos hb _).ne'
+ rw [Real.div_rpow ha.le hb.le, Real.mul_rpow (pow_nonneg ha.le k) hD.le,
+ Real.mul_rpow (pow_nonneg hb.le k) hD.le, hak, hbk]
+ field_simp
+
+/-! ### (e) Assembly of the two pointwise inequalities from abstract real factors -/
+
+/-- Lower assembly: `s * dA = dB`, `dB ≤ dC`, `eA ≤ eC` give `s (P dA eA) ≤ P dC eC`. -/
+theorem dc_assemble_lower (P s dA dB dC eA eC : ℝ) (hP : 0 ≤ P) (hs : s * dA = dB)
+ (hd : dB ≤ dC) (hdC : 0 ≤ dC) (he : eA ≤ eC) (heA : 0 ≤ eA) :
+ s * (P * dA * eA) ≤ P * dC * eC := by
+ calc s * (P * dA * eA) = P * (s * dA) * eA := by ring
+ _ = P * dB * eA := by rw [hs]
+ _ ≤ P * dC * eC := mul_le_mul (mul_le_mul_of_nonneg_left hd hP) he heA (mul_nonneg hP hdC)
+
+/-- Upper assembly: `s * dB = dA`, `dC ≤ dA`, `eC ≤ eB` give `P dC eC ≤ s (P dB eB)`. -/
+theorem dc_assemble_upper (P s dA dB dC eB eC : ℝ) (hP : 0 ≤ P) (hs : s * dB = dA)
+ (hd : dC ≤ dA) (hdA : 0 ≤ dA) (he : eC ≤ eB) (heC : 0 ≤ eC) :
+ P * dC * eC ≤ s * (P * dB * eB) := by
+ calc P * dC * eC ≤ P * dA * eB :=
+ mul_le_mul (mul_le_mul_of_nonneg_left hd hP) he heC (mul_nonneg hP hdA)
+ _ = P * (s * dB) * eB := by rw [hs]
+ _ = s * (P * dB * eB) := by ring
+
+end Aux
+
+/-! ## The theta family is summable at every point, in every dimension -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.ThetaSummable` (claim `side24-coefficient`).
+Method: comparison `Summable.of_nonneg_of_le` with the dominating family
+`exp(‖z‖^2/2) ∏ i, exp(-144 n_i^2)` (`Aux.th_term_le_dominant`, from `‖24 n‖^2 = 576 ∑ n_i^2`
+and `Real.exp_sum`); that family is summable (`Aux.th_summable_dominant`) because
+`m ↦ exp(-144 m^2)` is summable on `ℤ` (`HurwitzKernelBounds.summable_f_int`) and products of
+a nonnegative summable function are summable over `Fin d → ℤ` (`Aux.th_summable_pi_prod`, via
+`Fintype.piFinset`, `Finset.prod_univ_sum` and `summable_of_sum_le`).
+Does not establish: the informal convergence statement of the source as the source's object
+(the alignment of `E d`, `latticeVec` and this family with the source's `R^d`, `24 Z^d` and
+`K_24` is PENDING_INDEPENDENT_REVIEW); any value, positivity, smoothness or Poisson-summation
+property of `thetaSum24` or `K24`; `ImageBound`, `LatticeImageSumBound` or the derivative
+bounds of Section 2; any enclosure of the coefficient; the statement module's own
+`Does not claim:` text (the statement packet is not edited here); 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. -/
+theorem thetaSummable (d : ℕ) : UniversalLaw.Spec.Side24.ThetaSummable d := by
+ intro z
+ exact Summable.of_nonneg_of_le (fun n => (Real.exp_pos _).le)
+ (fun n => Aux.th_term_le_dominant d z n) (Aux.th_summable_dominant d z)
+
+/-! ## Inventory theorem -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.DerivativePairingBound` (register row `side24-coefficient`,
+Section 2 first display of SIDE24-COEFFICIENT-D23-20260924-v1).
+Method: the contraction at a unit tuple is at most the operator norm `‖iteratedFDeriv ℝ q (Kinf d) x‖`
+(`Aux.dp_abs_le_opNorm`, from `ContinuousMultilinearMap.le_opNorm`); the operator norms satisfy the
+Hermite-type recursion `b_{q+2} ≤ ‖x‖ b_{q+1} + (q+1) b_q` (`Aux.dp_recursion`, from
+`norm_iteratedFDeriv_fderiv`, the explicit derivative `fderiv ℝ (Kinf d) y = Kinf d y • (-(innerSL ℝ y))`
+and the Leibniz bound `norm_iteratedFDeriv_smul_le`, the linear factor's derivatives of order `≥ 2`
+vanishing), and with `b_0 = Kinf d x`, `b_1 = Kinf d x ‖x‖` the orders `q ≤ 6` are matched to the
+unfolded `pairingSum q ‖x‖` (`Aux.dp_pairing_all`, `interval_cases`, `nlinarith`).
+Does not establish: the informal Section 2 display or its review and acceptance; the alignment of the
+formal objects (`Kinf`, `IsUnitTuple`, `pairingSum`, Mathlib's `iteratedFDeriv ℝ q`) with the source's
+(PENDING_INDEPENDENT_REVIEW); validity for `q > 6` (the Prop restricts to `q ≤ 6`, as the source does,
+and nothing beyond it is stated or proved here); any enclosure of the coefficient `c_{d,24}`; the
+disposition of `side24-coefficient`, which is REVIEWED_SCOPED as transcribed in the register, not
+derived here. -/
+theorem derivativePairingBound : UniversalLaw.Spec.Side24.DerivativePairingBound := by
+ intro d q hq x u hu
+ exact (Aux.dp_abs_le_opNorm d q x u hu).trans (Aux.dp_pairing_all d x q hq)
+
+/-! ## The Section 2 derivative bound at `|x| ≥ 1` -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.DerivativeBoundAtLeastOne` (register row `side24-coefficient`,
+Section 2 of SIDE24-COEFFICIENT-D23-20260924-v1, "At |x|>=1 this is at most 76 |x|^6 e^(-|x|^2/2)").
+Method: the Section 2 pairing bound `|D^q Kinf (x) u| ≤ exp(-‖x‖²/2) · pairingSum q ‖x‖` is the
+inventory theorem `derivativePairingBound` of this module (the Hermite-type recursion
+`b_{q+2} ≤ ‖x‖ b_{q+1} + (q+1) b_q` for the operator norms, `Aux.dp_recursion`, with
+`ContinuousMultilinearMap.le_opNorm` at a unit tuple); the hypothesis-form helper
+`Aux.d1_derivativeBoundAtLeastOne_of_derivativePairingBound` combines it with the elementary
+inequality `pairingSum q r ≤ 76 r^6` for `1 ≤ r`, `q ≤ 6` (`Aux.d1_pairingSum_le_of_one_le`:
+`interval_cases`, `Finset.sum_range_succ`, `Nat.factorial`, `norm_num`, and the monomial bounds
+`r^k ≤ r^6` from `pow_le_pow_right₀`, `one_le_pow₀`), by `mul_le_mul_of_nonneg_left` with
+`0 ≤ exp(-‖x‖²/2)`.
+Does not establish: the informal Section 2 display or its review and acceptance; the alignment of the
+formal objects (`Kinf`, `IsUnitTuple`, `pairingSum`, Mathlib's `iteratedFDeriv ℝ q`) with the source's
+(PENDING_INDEPENDENT_REVIEW); any identification with the main-branch targets
+`UniversalLaw.Side24.pairing_sum_six` and `pairing_sum_le_six`, which kernel-check the coefficient
+arithmetic `1+15+45+15=76` and `76` bounding the smaller orders there, not here; validity for `q > 6` or
+for `‖x‖ < 1` (the Prop restricts to `q ≤ 6` and `1 ≤ ‖x‖`, as the source does); any enclosure of the
+coefficient `c_{d,24}`; the disposition of `side24-coefficient`, which is REVIEWED_SCOPED as transcribed
+in the register, not derived here. -/
+theorem derivativeBoundAtLeastOne : UniversalLaw.Spec.Side24.DerivativeBoundAtLeastOne :=
+ Aux.d1_derivativeBoundAtLeastOne_of_derivativePairingBound derivativePairingBound
+
+/-! ## The Section 2 derivative bound at the origin -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.DerivativeBoundAtZero` (register row `side24-coefficient`,
+Section 2 of SIDE24-COEFFICIENT-D23-20260924-v1, "contraction has absolute value at most 15").
+Method: the hypothesis-form helper `Aux.d0_derivativeBoundAtZero_of_derivativePairingBound`
+specialises the pairing bound `DerivativePairingBound` to `x = 0`, where `‖0‖ = 0`,
+`exp (-(0 ^ 2) / 2) = 1` and `pairingSum q 0 ≤ 15` for `q ≤ 6` (`Aux.d0_pairingSum_zero_le`:
+the values are `1, 0, 1, 0, 3, 0, 15`, by `interval_cases`, `Finset.sum_range_succ`, `norm_num`);
+the pairing bound itself is the inventory theorem `derivativePairingBound` of this module
+(`Aux.dp_recursion`, `Aux.dp_pairing_all`, `Aux.dp_abs_le_opNorm`).
+Does not establish: the informal Section 2 display or its review and acceptance; the alignment of
+the formal objects (`Kinf`, `IsUnitTuple`, `pairingSum`, Mathlib's `iteratedFDeriv ℝ q` at `0`) with
+the source's (PENDING_INDEPENDENT_REVIEW); the double-factorial identity `5!! = 15` as such, which
+is kernel-checked on main (`UniversalLaw.Side24.sixth_moment_double_factorial`) and is neither
+re-proved nor cited here (only `pairingSum 6 0 = 15` is computed); validity for `q > 6` (the Prop
+restricts to `q ≤ 6`, as the source does); any value of a contraction (only an upper bound on its
+absolute value); any enclosure of the coefficient `c_{d,24}`; the disposition of
+`side24-coefficient`, which is REVIEWED_SCOPED as transcribed in the register, not derived here. -/
+theorem derivativeBoundAtZero : UniversalLaw.Spec.Side24.DerivativeBoundAtZero :=
+ Aux.d0_derivativeBoundAtZero_of_derivativePairingBound derivativePairingBound
+
+/-! ## The Section 1 reference blocks of `K_infty` in every orthonormal frame -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.ReferenceOddAndPinBlocks` (claim `side24-coefficient`).
+Method: the derivative contractions of `Kinf d` at `0` are evaluated by peeling one direction
+at a time (`Aux.rb_peel`, from `iteratedFDeriv_succ_apply_right` and
+`iteratedFDeriv_clm_apply_const_apply`) with explicit `HasFDerivAt` closed forms of the
+intermediate functions (`Aux.rb_fderiv_kinf`, `rb_fderiv_g1`, `rb_fderiv_g2`,
+`rb_fderiv_g3_zero`, `rb_fderiv_P3`, `rb_fderiv_P4`, `rb_fderiv_P5_zero`), giving
+`Aux.rb_order_two` (`-⟪a, b⟫`), `Aux.rb_order_four` (the three pairings) and `Aux.rb_order_six`
+(`-15 ⟪u, u⟫^3`); in an orthonormal frame (`orthonormal_iff_ite`) the five blocks follow
+(`Aux.rb_gradCov`, `rb_thirdVar`, `rb_thirdGradCov`, `rb_pinCov`, `rb_condThirdVariance`,
+the last with `inv_one`, `Matrix.one_mulVec` and `Finset.sum_ite_eq'`).
+Does not establish: the informal Section 1 block values of the source as the source's objects
+(the alignment of `E d`, `Kinf`, `derivContraction`, `gradCov`, `pinCov`, `thirdGradCov`,
+`thirdVar` and `condThirdVariance` with the source's `R^d`, `K_infty`, covariances and
+conditional variance is PENDING_INDEPENDENT_REVIEW); that any of these matrices is the
+covariance of a random vector or field (none is constructed in the statement module); the
+statement module's own `Does not claim:` text ("the identities (statement only); `15 - 9 = 6` is
+kernel-checked on main (`UniversalLaw.Side24.conditional_third_derivative_variance`), not
+here"), which describes the statement packet, is not edited here, and main's theorem is neither
+cited nor relied on; `ReferencePinDensityProduct`, `CovarianceOrdering`,
+`EntrywiseCovarianceBound` or any other Prop of the module; 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. -/
+theorem referenceOddAndPinBlocks : UniversalLaw.Spec.Side24.ReferenceOddAndPinBlocks := by
+ intro d _ hd R hR
+ exact ⟨Aux.rb_gradCov R hR, Aux.rb_thirdVar hd R hR, Aux.rb_thirdGradCov hd R hR,
+ Aux.rb_pinCov hd R hR, Aux.rb_condThirdVariance hd R hR⟩
+
+/-! ## The Section 1 reference pin-density product -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.ReferencePinDensityProduct` (register row `side24-coefficient`,
+Section 1 of SIDE24-COEFFICIENT-D23-20260924-v1, "p_G(0) p_V(0) = (2pi)^(-d) / sqrt(3)").
+Method: the hypothesis form `Aux.rp_referencePinDensityProduct_of_referenceOddAndPinBlocks` takes
+the inventory theorem `referenceOddAndPinBlocks` of this module and uses only its first conjunct
+`gradCov d (Kinf d) R = 1` and fourth conjunct `pinCov d (Kinf d) (R 0) R = diagonal (3, 1, …, 1)`
+(both from the contractions `Aux.rb_order_two`, `Aux.rb_order_four` in an orthonormal frame); the
+common core `Aux.rp_referencePinDensityProduct_of_blockIdentities` rewrites the two blocks and
+finishes with the density algebra `Aux.rp_density_algebra` (`Matrix.det_one`, `Matrix.det_diagonal`,
+`Finset.prod_ite_eq'`, `Matrix.mulVec_zero`, `Real.rpow_add`, `Real.rpow_neg`, `Real.sqrt_eq_rpow`).
+Does not establish: the informal Section 1 display or its review and acceptance; the alignment of
+the formal objects (`gaussDensity`, `gradCov`, `pinCov`, `derivContraction` through Mathlib's
+`iteratedFDeriv ℝ` at `0`, `Orthonormal ℝ R`) with the source's (PENDING_INDEPENDENT_REVIEW); the
+determinant identity `det diag(3,1,…,1) = 3` as the main-branch target
+`UniversalLaw.Side24.pin_determinant_and_joint_dimension`, which is kernel-checked on main and is
+neither cited nor re-used here (the determinant is recomputed by `Matrix.det_diagonal` in
+`Aux.rp_det_pinDiagonal`); that `gaussDensity` is the density of any random vector or that any field
+is constructed; the remaining conjuncts of `ReferenceOddAndPinBlocks` (`Var(t) = 15`,
+`Cov(t, G) = (-3, 0, …, 0)`, `tau^2 = 6`), which this theorem does not use; the value for
+`d ∉ {2, 3}` (the Prop restricts to `d = 2 ∨ d = 3`, as the source does); any enclosure of the
+coefficient `c_{d,24}`; the disposition of `side24-coefficient`, which is REVIEWED_SCOPED as
+transcribed in the register, not derived here. -/
+theorem referencePinDensityProduct : UniversalLaw.Spec.Side24.ReferencePinDensityProduct :=
+ Aux.rp_referencePinDensityProduct_of_referenceOddAndPinBlocks referenceOddAndPinBlocks
+
+/-! ## The Section 4 integrand-ratio bounds in dimensions two and three -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.IntegrandRatioBounds` (claim `side24-coefficient`).
+Method: case split `d = 2`, `d = 3`, where the exponents evaluate to `a = 13/6, b = 5/2` and
+`a = 25/6, b = 9/2` (`Aux.ir_exponentA_two`, `Aux.ir_exponentB_two`, `Aux.ir_exponentA_three`,
+`Aux.ir_exponentB_three`); for arbitrary `1 ≤ a, b ≤ 5` both bounds follow
+(`Aux.ir_ratio_bounds`) from Bernoulli's inequality `1 - a epsilon ≤ (1 - epsilon)^a`
+(`one_add_mul_self_le_rpow_one_add`, `Aux.ir_bernoulli`), exponent monotonicity
+`(1 + epsilon)^b ≤ (1 + epsilon)^5` (`Real.rpow_le_rpow_of_exponent_le`,
+`Aux.ir_rpow_le_pow_five`), `le_div_iff₀` / `div_le_iff₀`, and the two exact rational
+inequalities `(1 - 13 epsilon)(1 + epsilon)^5 ≤ 1 - 5 epsilon` and
+`(1 + epsilon)^5 ≤ (1 + 28 epsilon)(1 - 5 epsilon)` decided by `norm_num`
+(`Aux.ir_lower_rational`, `Aux.ir_upper_rational`).
+Does not establish: the informal Section 4 display of the source as the source's object (the
+alignment of `epsilon`, `exponentA`, `exponentB` and these power quotients with the source's
+`epsilon`, `a`, `b` and integrand ratio is PENDING_INDEPENDENT_REVIEW); that the integrand ratio
+of the source equals these power quotients (not specified in the statement packet); the
+arithmetic `13 ≤ 32`, `28 ≤ 32` and `32*10^(-108) < 10^(-106)` (kernel-checked on main in
+`UniversalLaw.Side24.ratio_constant_ordering` and `density_comparison_below_reported`, not
+here); `DensityComparison` or any covariance ordering; any enclosure of the coefficient; the
+statement module's own `Does not claim:` text (the statement packet is not edited here); 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. -/
+theorem integrandRatioBounds : UniversalLaw.Spec.Side24.IntegrandRatioBounds := by
+ intro d hd
+ rcases hd with rfl | rfl
+ · rw [Aux.ir_exponentA_two, Aux.ir_exponentB_two]
+ exact Aux.ir_ratio_bounds _ _ (by norm_num) (by norm_num) (by norm_num) (by norm_num)
+ · rw [Aux.ir_exponentA_three, Aux.ir_exponentB_three]
+ exact Aux.ir_ratio_bounds _ _ (by norm_num) (by norm_num) (by norm_num) (by norm_num)
+
+/-! ## The lattice-image sum bound for `d ≤ 3` -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.LatticeImageSumBound` (claim `side24-coefficient`).
+Method: both conjuncts from the uniform partial-sum bound `Aux.li_partial_sum_le` via
+`summable_of_sum_le` and `Real.tsum_le_of_sum_le` (terms nonnegative, `Aux.li_imageTerm_nonneg`);
+the partial sums are dominated pointwise by `9 ∑ i, ∏ k, h_i k (n k)` (`Aux.li_imageTerm_le`,
+from the power mean `pow_sum_div_card_le_sum_pow` and `Real.exp_sum`), each finite sum of
+products sits in a `Fintype.piFinset` box and factors (`Aux.li_sum_prod_le`, via
+`Finset.prod_univ_sum` and `Summable.sum_le_tsum`), and the one-dimensional sums over `ℤ` are
+bounded by `2` and `4 exp(-288)` (`Aux.li_gauss_int`, `Aux.li_pow_gauss_int`) through
+`tsum_of_nat_of_neg_add_one`, the geometric series `tsum_geometric_two` and the registered
+`SuccessiveTermRatio` (`SpecificationProofs.Side24Elementary.successiveTermRatio`), giving
+`432 exp(-288) ≤ 1458 exp(-288)`.
+Does not establish: the informal Section 2 lattice display of the source as the source's object
+(the alignment of `intNormSq`, `imageTerm` and this `tsum` over `Fin d → ℤ` with the source's
+`sum_{n ≠ 0} |n|^6 e^(-288|n|^2)` is PENDING_INDEPENDENT_REVIEW); the intermediate shell count
+`729 ∑_j j^9 e^(-288 j^2)` of the source, which the Prop does not specify and this proof does not
+reproduce; the arithmetic `27·27 = 729`, `729·2 = 1458` kernel-checked on main, not here;
+`ImageBound`, the derivative bounds of Section 2 or 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. -/
+theorem latticeImageSumBound : UniversalLaw.Spec.Side24.LatticeImageSumBound := by
+ intro d hd
+ exact ⟨summable_of_sum_le (fun n => Aux.li_imageTerm_nonneg d n) (Aux.li_partial_sum_le d hd),
+ Real.tsum_le_of_sum_le (fun n => Aux.li_imageTerm_nonneg d n) (Aux.li_partial_sum_le d hd)⟩
+
+/-! ## The Section 4 Gaussian density comparison -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.DensityComparison` (claim `side24-coefficient`).
+Method: with `A = (1 - epsilon) • C0` and `B = (1 + epsilon) • C0` (positive definite by
+`Matrix.PosDef.smul`), the Loewner lemmas `Aux.dc_det_le_det` (`det A ≤ det C ≤ det B`, via
+`CFC.sqrt`, `Matrix.PosSemidef.conjTranspose_mul_mul_same`,
+`Matrix.posSemidef_iff_isHermitian_and_spectrum_nonneg` and
+`Matrix.IsHermitian.det_eq_prod_eigenvalues`) and `Aux.dc_quad_le`
+(`x ⬝ B⁻¹ x ≤ x ⬝ C⁻¹ x ≤ x ⬝ A⁻¹ x`, via `Aux.dc_inv_sub_inv_posSemidef`) give the two
+determinant and exponent comparisons; `Aux.dc_scale_identity` with `Matrix.det_smul` turns
+`((1 ∓ epsilon)/(1 ± epsilon))^(n/2) · det((1 ∓ epsilon) • C0)^(-1/2)` into
+`det((1 ± epsilon) • C0)^(-1/2)`; `Real.rpow_le_rpow_of_nonpos`, `Real.exp_le_exp` and
+`Aux.dc_assemble_lower` / `Aux.dc_assemble_upper` finish after unfolding `gaussDensity`.
+Does not establish: the informal Section 4 display of the source as the source's object (the
+alignment of `gaussDensity`, `symCoordDim`, `epsilon` and the positive-semidefinite hypotheses
+with the source's densities, `n = m(m+1)/2`, `epsilon` and ordering is
+PENDING_INDEPENDENT_REVIEW); the cone-moment consequence `(1 ± epsilon)^m D0` and the scaling
+`a^m` of `h(A) = det(A)^2 1{A<0}` (not specified in the statement packet); that
+`(1 ± epsilon) • C0` or `C` are covariances of any random object; `CovarianceOrdering` or any
+ordering of `C24` against `Cref`; any enclosure of the coefficient; the statement module's own
+`Does not claim:` text (the statement packet is not edited here); 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. -/
+theorem densityComparison : UniversalLaw.Spec.Side24.DensityComparison := by
+ intro m C0 C hC0 hC hlow hup x
+ have ha : (0 : ℝ) < 1 - epsilon := Aux.ir_one_sub_epsilon_pos
+ have hb : (0 : ℝ) < 1 + epsilon := Aux.dc_one_add_epsilon_pos
+ have hA : ((1 - epsilon) • C0).PosDef := hC0.smul ha
+ have hB : ((1 + epsilon) • C0).PosDef := hC0.smul hb
+ have hD : 0 < C0.det := hC0.det_pos
+ have hdetC : 0 < C.det := hC.det_pos
+ have hdetApos : 0 < ((1 - epsilon) • C0).det := hA.det_pos
+ have hdetAC : ((1 - epsilon) • C0).det ≤ C.det := Aux.dc_det_le_det hA hlow
+ have hdetCB : C.det ≤ ((1 + epsilon) • C0).det := Aux.dc_det_le_det hC hup
+ have hqAC : dotProduct x (Matrix.mulVec C⁻¹ x) ≤
+ dotProduct x (Matrix.mulVec ((1 - epsilon) • C0)⁻¹ x) := Aux.dc_quad_le hA hC hlow x
+ have hqCB : dotProduct x (Matrix.mulVec ((1 + epsilon) • C0)⁻¹ x) ≤
+ dotProduct x (Matrix.mulVec C⁻¹ x) := Aux.dc_quad_le hC hB hup x
+ have hdetA : ((1 - epsilon) • C0).det = (1 - epsilon) ^ symCoordDim m * C0.det :=
+ Aux.dc_det_smul C0 _
+ have hdetB : ((1 + epsilon) • C0).det = (1 + epsilon) ^ symCoordDim m * C0.det :=
+ Aux.dc_det_smul C0 _
+ have hscale1 : ((1 - epsilon) / (1 + epsilon)) ^ ((symCoordDim m : ℝ) / 2) *
+ ((1 - epsilon) • C0).det ^ (-(1 : ℝ) / 2) = ((1 + epsilon) • C0).det ^ (-(1 : ℝ) / 2) := by
+ rw [hdetA, hdetB]
+ exact Aux.dc_scale_identity _ _ _ ha hb hD _
+ have hscale2 : ((1 + epsilon) / (1 - epsilon)) ^ ((symCoordDim m : ℝ) / 2) *
+ ((1 + epsilon) • C0).det ^ (-(1 : ℝ) / 2) = ((1 - epsilon) • C0).det ^ (-(1 : ℝ) / 2) := by
+ rw [hdetA, hdetB]
+ exact Aux.dc_scale_identity _ _ _ hb ha hD _
+ have hP : (0 : ℝ) ≤ (2 * Real.pi) ^ (-(symCoordDim m : ℝ) / 2) :=
+ (Real.rpow_pos_of_pos (by positivity) _).le
+ have hrB : ((1 + epsilon) • C0).det ^ (-(1 : ℝ) / 2) ≤ C.det ^ (-(1 : ℝ) / 2) :=
+ Real.rpow_le_rpow_of_nonpos hdetC hdetCB (by norm_num)
+ have hrA : C.det ^ (-(1 : ℝ) / 2) ≤ ((1 - epsilon) • C0).det ^ (-(1 : ℝ) / 2) :=
+ Real.rpow_le_rpow_of_nonpos hdetApos hdetAC (by norm_num)
+ have heA : Real.exp (-(dotProduct x (Matrix.mulVec ((1 - epsilon) • C0)⁻¹ x)) / 2) ≤
+ Real.exp (-(dotProduct x (Matrix.mulVec C⁻¹ x)) / 2) :=
+ Real.exp_le_exp.mpr (by linarith)
+ have heB : Real.exp (-(dotProduct x (Matrix.mulVec C⁻¹ x)) / 2) ≤
+ Real.exp (-(dotProduct x (Matrix.mulVec ((1 + epsilon) • C0)⁻¹ x)) / 2) :=
+ Real.exp_le_exp.mpr (by linarith)
+ unfold gaussDensity
+ constructor
+ · exact Aux.dc_assemble_lower _ _ _ _ _ _ _ hP hscale1 hrB (Real.rpow_nonneg hdetC.le _) heA
+ (Real.exp_pos _).le
+ · exact Aux.dc_assemble_upper _ _ _ _ _ _ _ hP hscale2 hrA (Real.rpow_nonneg hdetApos.le _) heB
+ (Real.exp_pos _).le
+
+end UniversalLaw.Proofs.Side24Analysis
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24ConeMoment.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24ConeMoment.lean
new file mode 100644
index 000000000..ec1a96b2d
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24ConeMoment.lean
@@ -0,0 +1,485 @@
+import Specifications.Side24
+import SpecificationProofs.Side24Interfaces
+import SpecificationProofs.Side24Elementary
+
+/-!
+# SIDE24 cone moment: the `m = 2` identity `ConeMomentD2Identity` over `ConeMomentInterface`
+(statement module `Specifications.Side24`)
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+The one theorem outside the `Aux` namespace has as its type exactly the registered `Prop`
+`UniversalLaw.Spec.Side24.ConeMomentD2Identity` of `Specifications/Side24.lean` (statement packet
+`specifications/lean_statements_20261010`, which is not modified here), applied to its own
+parameter `I : ConeMomentInterface`. A kernel-checked proof of that `Prop` is evidence about that
+`Prop` only, for the formal objects it names (`ConeMomentInterface`, `transverseMatrix`,
+`NegDefCone`, `coneIntegrand`, Mathlib's `gaussianReal` and Bochner integral): it is not evidence
+about the informal Layer 0 note (SIDE24-COEFFICIENT-D23-20260924-v1, register row
+`side24-coefficient`), which it does not make reviewed, accepted or "verified"; it does not
+identify the formal definitions with the informal objects (that alignment is
+PENDING_INDEPENDENT_REVIEW); it does not enclose the coefficient `c_{d,24}`; and it promotes,
+closes, discharges or reclassifies nothing. Nothing here constructs an inhabitant of
+`ConeMomentInterface` or derives its law fields; the theorem holds for every inhabitant and uses
+only the law field `sxy_law` and the instances `mΩ`, `isProb` (the latter through
+`tm_aemeasurable_triple`); the fields `A` and `A_law` are not used.
+
+Provenance: round-5 lane for `ConeMomentD2Identity`, selected by the round-4 triage. Helper lemmas
+live in `UniversalLaw.Proofs.Side24ConeMoment.Aux` with the tag `cm_`; the gate inventories only
+the theorem outside that namespace. The module reuses, without restating them, the public helpers
+of the round-4 module `SpecificationProofs.Side24Interfaces` (`tm_aemeasurable_triple`,
+`tm_fourth_moment`, `tm_exp_moment`, `c1_second_moment_gaussianReal`,
+`c1_integrable_sq_gaussianReal`, `rl_pdf_mul`, `rl_measurableSet_radial`, `rl_Ioi_inter_eq`,
+`rl_angular_integral`) and the inventory theorem `elementaryConeIntegral` of
+`SpecificationProofs.Side24Elementary`. The mathematics:
+
+* Cone identification (`cm_cone_iff`): `NegDefCone (s, x, y)` holds iff `s < 0` and
+ `x^2 + y^2 < s^2`. Forward: `det (-A) = det A = s^2 - x^2 - y^2 > 0` (`Matrix.PosDef.det_pos`,
+ `cm_det_transverse`) and the diagonal entries `-s - x`, `-s + x` are positive
+ (`Matrix.PosDef.diag_pos`). Converse: `-A` is symmetric and its quadratic form at `v = (a, b)`
+ is `-s (a^2 + b^2) - x (a^2 - b^2) - 2 y a b`, which is positive for `v ≠ 0` by the Lagrange
+ identity `(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`
+ (`Matrix.PosDef.of_dotProduct_mulVec_pos`, `cm_quad_pos`). Hence `coneIntegrand` is the
+ indicator of `{s < 0 ∧ x^2 + y^2 < s^2}` times `(s^2 - x^2 - y^2)^2`
+ (`cm_coneIntegrand_eq`), a measurable function bounded by `s^4`.
+* Transport and Fubini: the triple `(s, x, y)` is a.e.-measurable (`tm_aemeasurable_triple`), so
+ `integral_map` and the law field `sxy_law` move the integral to
+ `N(0, 5/3) ⊗ (N(0, 1) ⊗ N(0, 1))`; the integrand is integrable there (bound `s^4`,
+ `memLp_id_gaussianReal'`, `Integrable.comp_fst`), so `integral_prod` gives an iterated integral.
+* Inner integral (`cm_inner`): for `s ≥ 0` the slice is `0`; for `s < 0` the slice equals the
+ closed-disk integrand `1{x^2 + y^2 ≤ s^2} (s^2 - x^2 - y^2)^2` (equal on the circle, where the
+ square vanishes), whose planar Gaussian integral is `a^2 - 4a + 8 - 8 exp (-a/2)` at `a = s^2`
+ (`cm_gauss2_integral`): the product of the two `withDensity` laws is `withDensity` of the
+ product density (`prod_withDensity`, `integral_withDensity_eq_integral_toReal_smul`), polar
+ coordinates (`integral_comp_polarCoord_symm`, `setIntegral_prod_mul`), the angular integral
+ `2π`, and the radial integral by the substitution `z = r^2`
+ (`intervalIntegral.integral_comp_mul_deriv`) onto `elementaryConeIntegral`.
+* Outer integral: the bracket `t^4 - 4t^2 + 8 - 8 exp (-t^2/2)` is even and integrable under
+ `N(0, 5/3)`, so its integral over `t < 0` is half its full integral (`gaussianReal_map_neg`,
+ `integral_add_compl`, `integral_Ici_eq_integral_Ioi`; `cm_setIntegral_Iio_even`), and the full
+ integral is `25/3 - 4 (5/3) + 8 - 8 sqrt (3/8)` from the moments `∫ t^4 = 25/3`,
+ `∫ t^2 = 5/3`, `∫ exp (-t^2/2) = sqrt (3/8)` (`cm_integral_bracket`).
+
+Remark recorded by the lane, for the maintainers: for the formal objects, the proof follows the
+shape of the source's Section 1 computation for `m = 2`: the cone as `s < -R`, in the form
+`s < 0 ∧ x^2 + y^2 < s^2` (`cm_cone_iff`); the truncated integral of `(a - z)^2` against the
+density `e^(-z/2)/2` (`cm_radial_integral`, evaluated by `elementaryConeIntegral`, whose
+registered anchor is the source's display of that integral); symmetry in `s`
+(`cm_setIntegral_Iio_even`); and the three moments of `s` (`cm_integral_bracket`). It does not
+invoke the registered `RayleighSquareLaw` or any statement of the law of `R^2`: the
+`R^2`-density integral is obtained inline, by polar coordinates and the substitution `z = r^2`
+(`cm_disk_integral`, `cm_radial_integral`), and is then evaluated by `elementaryConeIntegral`.
+It also writes out steps the source does not write out (the transport along `sxy_law`, Fubini with
+its integrability, and the closed disk in place of the open one, which changes nothing because
+the integrand vanishes on the circle `x^2 + y^2 = s^2`). It is therefore not a cross-check of the
+source's Rayleigh cone integration by a different route. Being authored by Anthropic / Claude at
+organizational-independence credit 0, it is also not the nonauthor review that the source asks
+for. That these formal steps are the source's steps is not established (alignment
+PENDING_INDEPENDENT_REVIEW). This is a remark about a route, not about any claim; no register
+label changes.
+-/
+
+namespace UniversalLaw.Proofs.Side24ConeMoment
+
+open MeasureTheory ProbabilityTheory UniversalLaw.Spec.Side24
+
+namespace Aux
+
+open UniversalLaw.Proofs.Side24Interfaces.Aux
+
+/-! ## `cm_` (a): the negative-definite cone of the `m = 2` transverse matrix -/
+
+/-- `det [[s + x, y], [y, s - x]] = s^2 - x^2 - y^2` (`Matrix.det_fin_two_of`). -/
+theorem cm_det_transverse (s x y : ℝ) :
+ (transverseMatrix s x y).det = s ^ 2 - x ^ 2 - y ^ 2 := by
+ unfold transverseMatrix
+ rw [Matrix.det_fin_two_of]
+ ring
+
+/-- Forward direction of the cone characterisation: positive definiteness of `-A` gives `s < 0`
+(the two diagonal entries `-s - x`, `-s + x` are positive, `Matrix.PosDef.diag_pos`) and
+`x^2 + y^2 < s^2` (`det (-A) = det A > 0`, `Matrix.PosDef.det_pos`, `Matrix.det_neg`). -/
+theorem cm_cone_forward (s x y : ℝ) (h : NegDefCone (s, x, y)) :
+ s < 0 ∧ x ^ 2 + y ^ 2 < s ^ 2 := by
+ unfold NegDefCone at h
+ have hdet := h.det_pos
+ rw [Matrix.det_neg, cm_det_transverse] at hdet
+ have hdiag := h.diag_pos (i := 0)
+ have hdiag' := h.diag_pos (i := 1)
+ simp [transverseMatrix] at hdiag hdiag'
+ simp only [Fintype.card_fin, even_two, Even.neg_pow, one_pow, one_mul] at hdet
+ constructor
+ · linarith
+ · linarith
+
+/-- A nonzero vector of `Fin 2 → ℝ` has positive squared norm `v 0 ^ 2 + v 1 ^ 2`. -/
+theorem cm_sq_add_sq_pos (v : Fin 2 → ℝ) (hv : v ≠ 0) : 0 < v 0 ^ 2 + v 1 ^ 2 := by
+ by_contra hle
+ rw [not_lt] at hle
+ have h0 : v 0 = 0 := by nlinarith [sq_nonneg (v 0), sq_nonneg (v 1)]
+ have h1 : v 1 = 0 := by nlinarith [sq_nonneg (v 0), sq_nonneg (v 1)]
+ apply hv
+ funext i
+ fin_cases i
+ · exact h0
+ · exact h1
+
+/-- The quadratic form of `-A` at `(a, b) ≠ 0` is positive inside the cone: by the Lagrange
+identity `(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`,
+`|x (a^2 - b^2) + 2 y a b| ≤ sqrt (x^2 + y^2) (a^2 + b^2) < -s (a^2 + b^2)` (`nlinarith`). -/
+theorem cm_quad_pos (s x y a b : ℝ) (hs : s < 0) (hr : x ^ 2 + y ^ 2 < s ^ 2)
+ (hab : 0 < a ^ 2 + b ^ 2) :
+ 0 < -s * (a ^ 2 + b ^ 2) - x * (a ^ 2 - b ^ 2) - 2 * y * a * b := by
+ have key : (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 := by ring
+ by_contra hle
+ rw [not_lt] at hle
+ have hL : -s * (a ^ 2 + b ^ 2) ≤ x * (a ^ 2 - b ^ 2) + 2 * y * a * b := by linarith
+ have hc : 0 < -s * (a ^ 2 + b ^ 2) := by nlinarith
+ have h1 : (-s * (a ^ 2 + b ^ 2)) ^ 2 ≤ (x * (a ^ 2 - b ^ 2) + 2 * y * a * b) ^ 2 := by
+ nlinarith
+ have h2 : (x ^ 2 + y ^ 2) * (a ^ 2 + b ^ 2) ^ 2 < s ^ 2 * (a ^ 2 + b ^ 2) ^ 2 := by
+ have : 0 < (a ^ 2 + b ^ 2) ^ 2 := by positivity
+ nlinarith
+ nlinarith [sq_nonneg (2 * x * a * b - y * (a ^ 2 - b ^ 2))]
+
+/-- Converse direction of the cone characterisation: for `s < 0` and `x^2 + y^2 < s^2`, `-A` is
+symmetric and its quadratic form is positive on nonzero vectors
+(`Matrix.PosDef.of_dotProduct_mulVec_pos`, `cm_quad_pos`). -/
+theorem cm_cone_backward (s x y : ℝ) (hs : s < 0) (hr : x ^ 2 + y ^ 2 < s ^ 2) :
+ NegDefCone (s, x, y) := by
+ unfold NegDefCone
+ refine Matrix.PosDef.of_dotProduct_mulVec_pos ?_ ?_
+ · ext i j
+ fin_cases i <;> fin_cases j <;> simp [transverseMatrix]
+ · intro v hv
+ have hab := cm_sq_add_sq_pos v hv
+ have := cm_quad_pos s x y (v 0) (v 1) hs hr hab
+ simp [transverseMatrix, dotProduct, Matrix.mulVec, Fin.sum_univ_two]
+ nlinarith
+
+/-- The formal cone `NegDefCone q` is `q.1 < 0 ∧ q.2.1^2 + q.2.2^2 < q.1^2` (both directions
+above). A statement about the formal definition only. -/
+theorem cm_cone_iff (q : ℝ × ℝ × ℝ) :
+ NegDefCone q ↔ q.1 < 0 ∧ q.2.1 ^ 2 + q.2.2 ^ 2 < q.1 ^ 2 :=
+ ⟨fun h => cm_cone_forward q.1 q.2.1 q.2.2 h,
+ fun h => cm_cone_backward q.1 q.2.1 q.2.2 h.1 h.2⟩
+
+/-! ## `cm_` (b): the planar Gaussian integral of the disk integrand -/
+
+/-- The radial integral `∫_0^{sqrt a} r (a - r^2)^2 (2π)⁻¹ exp (-r^2/2) dr =
+(2π)⁻¹ (a^2 - 4a + 8 - 8 exp (-a/2))`: the substitution `z = r^2`
+(`intervalIntegral.integral_comp_mul_deriv`) turns it into `(2π)⁻¹` times the interval integral
+of `ElementaryConeIntegral`, which `Side24Elementary.elementaryConeIntegral` evaluates. -/
+theorem cm_radial_integral (a : ℝ) (ha : 0 ≤ a) :
+ ∫ r in (0 : ℝ)..Real.sqrt a,
+ r * ((a - r ^ 2) ^ 2 * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2))) =
+ (2 * Real.pi)⁻¹ * (a ^ 2 - 4 * a + 8 - 8 * Real.exp (-a / 2)) := by
+ have hderiv : ∀ r ∈ Set.uIcc (0 : ℝ) (Real.sqrt a),
+ HasDerivAt (fun r : ℝ => r ^ 2) (2 * r) r := by
+ intro r _
+ simpa using hasDerivAt_pow 2 r
+ have hcv := intervalIntegral.integral_comp_mul_deriv (a := 0) (b := Real.sqrt a)
+ (f := fun r : ℝ => r ^ 2) (f' := fun r => 2 * r)
+ (g := fun z : ℝ => (2 * Real.pi)⁻¹ * ((a - z) ^ 2 * Real.exp (-z / 2) / 2)) hderiv
+ (by fun_prop) (by fun_prop)
+ beta_reduce at hcv
+ have hpt : (fun r : ℝ => r * ((a - r ^ 2) ^ 2 * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2)))) =
+ fun r => ((fun z : ℝ => (2 * Real.pi)⁻¹ * ((a - z) ^ 2 * Real.exp (-z / 2) / 2)) ∘
+ (fun r : ℝ => r ^ 2)) r * (2 * r) := by
+ funext r
+ simp only [Function.comp]
+ ring
+ rw [hpt, hcv, Real.sq_sqrt ha, show ((0 : ℝ)) ^ 2 = 0 by norm_num,
+ intervalIntegral.integral_const_mul,
+ UniversalLaw.Proofs.Side24Elementary.elementaryConeIntegral a ha]
+
+/-- In polar coordinates the disk integrand `p.1 • 1_D (a - |q|^2)^2 φ(q.1) φ(q.2)` at
+`q = polarCoord.symm p` is the radial function `1_{r^2 ≤ a} r (a - r^2)^2 (2π)⁻¹ exp (-r^2/2)` of
+`p.1` times the constant `1` of `p.2` (`rl_pdf_mul`, `cos^2 + sin^2 = 1`). -/
+theorem cm_polar_integrand (a : ℝ) (p : ℝ × ℝ) :
+ p.1 • Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}
+ (fun q => (a - q.1 ^ 2 - q.2 ^ 2) ^ 2 *
+ (gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2)) (polarCoord.symm p) =
+ Set.indicator {r : ℝ | r ^ 2 ≤ a}
+ (fun r => r * ((a - r ^ 2) ^ 2 * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2)))) p.1 *
+ (fun _ : ℝ => (1 : ℝ)) p.2 := by
+ have hsq : (p.1 * Real.cos p.2) ^ 2 + (p.1 * Real.sin p.2) ^ 2 = p.1 ^ 2 := by
+ rw [mul_pow, mul_pow, ← mul_add, Real.cos_sq_add_sin_sq, mul_one]
+ have hsq' : a - (p.1 * Real.cos p.2) ^ 2 - (p.1 * Real.sin p.2) ^ 2 = a - p.1 ^ 2 := by
+ rw [sub_sub, hsq]
+ simp only [polarCoord_symm_apply, Set.indicator, Set.mem_ofPred_eq, rl_pdf_mul, hsq, hsq',
+ smul_eq_mul, mul_one]
+ split_ifs <;> simp
+
+/-- The Lebesgue integral over the plane of `1{|q|^2 ≤ a} (a - |q|^2)^2 φ(q.1) φ(q.2)` (`φ` the
+standard Gaussian density) is `a^2 - 4a + 8 - 8 exp (-a/2)`: polar coordinates
+(`integral_comp_polarCoord_symm`), separation of variables (`setIntegral_prod_mul`), the angular
+integral `2π` (`rl_angular_integral`) and the radial integral `cm_radial_integral`. -/
+theorem cm_disk_integral (a : ℝ) (ha : 0 ≤ a) :
+ ∫ p, Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}
+ (fun q => (a - q.1 ^ 2 - q.2 ^ 2) ^ 2 *
+ (gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2)) p =
+ a ^ 2 - 4 * a + 8 - 8 * Real.exp (-a / 2) := by
+ have h2 : ∫ p, Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}
+ (fun q => (a - q.1 ^ 2 - q.2 ^ 2) ^ 2 *
+ (gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2)) p =
+ ∫ p in polarCoord.target, p.1 • Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}
+ (fun q => (a - q.1 ^ 2 - q.2 ^ 2) ^ 2 *
+ (gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2)) (polarCoord.symm p) :=
+ (integral_comp_polarCoord_symm _).symm
+ have h3 : ∫ p in polarCoord.target, p.1 • Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}
+ (fun q => (a - q.1 ^ 2 - q.2 ^ 2) ^ 2 *
+ (gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2)) (polarCoord.symm p) =
+ ∫ p in Set.Ioi (0 : ℝ) ×ˢ Set.Ioo (-Real.pi) Real.pi,
+ Set.indicator {r : ℝ | r ^ 2 ≤ a}
+ (fun r => r * ((a - r ^ 2) ^ 2 * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2)))) p.1 *
+ (fun _ : ℝ => (1 : ℝ)) p.2 := by
+ rw [polarCoord_target]
+ exact integral_congr_ae (Filter.Eventually.of_forall (fun p => cm_polar_integrand a p))
+ have h4 := setIntegral_prod_mul (μ := (volume : Measure ℝ)) (ν := (volume : Measure ℝ))
+ (Set.indicator {r : ℝ | r ^ 2 ≤ a}
+ (fun r => r * ((a - r ^ 2) ^ 2 * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2)))))
+ (fun _ : ℝ => (1 : ℝ)) (Set.Ioi (0 : ℝ)) (Set.Ioo (-Real.pi) Real.pi)
+ have h5 : ∫ r in Set.Ioi (0 : ℝ), Set.indicator {r : ℝ | r ^ 2 ≤ a}
+ (fun r => r * ((a - r ^ 2) ^ 2 * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2)))) r =
+ (2 * Real.pi)⁻¹ * (a ^ 2 - 4 * a + 8 - 8 * Real.exp (-a / 2)) := by
+ rw [setIntegral_indicator (rl_measurableSet_radial a), rl_Ioi_inter_eq a ha,
+ ← intervalIntegral.integral_of_le (Real.sqrt_nonneg a), cm_radial_integral a ha]
+ rw [h2, h3]
+ refine h4.trans ?_
+ rw [h5, rl_angular_integral]
+ field_simp
+
+/-- Under the standard planar Gaussian `gaussianReal 0 1 ⊗ gaussianReal 0 1`, the integral of
+`1{|q|^2 ≤ a} (a - |q|^2)^2` is `a^2 - 4a + 8 - 8 exp (-a/2)`: the product of the two
+`withDensity` laws is `withDensity` of the product density (`prod_withDensity`), the integral
+against it is the Lebesgue integral of the density times the integrand
+(`integral_withDensity_eq_integral_toReal_smul`, `toReal_gaussianPDF`), and `cm_disk_integral`. -/
+theorem cm_gauss2_integral (a : ℝ) (ha : 0 ≤ a) :
+ ∫ p, Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a} (fun q => (a - q.1 ^ 2 - q.2 ^ 2) ^ 2) p
+ ∂((gaussianReal 0 1).prod (gaussianReal 0 1)) =
+ a ^ 2 - 4 * a + 8 - 8 * Real.exp (-a / 2) := by
+ have hmeas : Measurable (fun z : ℝ × ℝ => gaussianPDF 0 1 z.1 * gaussianPDF 0 1 z.2) :=
+ ((measurable_gaussianPDF 0 1).comp measurable_fst).mul
+ ((measurable_gaussianPDF 0 1).comp measurable_snd)
+ rw [gaussianReal_of_var_ne_zero 0 one_ne_zero,
+ prod_withDensity (measurable_gaussianPDF 0 1) (measurable_gaussianPDF 0 1),
+ ← Measure.volume_eq_prod ℝ ℝ,
+ integral_withDensity_eq_integral_toReal_smul hmeas
+ (Filter.Eventually.of_forall (fun _ => ENNReal.mul_lt_top gaussianPDF_lt_top gaussianPDF_lt_top)),
+ ← cm_disk_integral a ha]
+ congr 1
+ funext p
+ simp only [ENNReal.toReal_mul, toReal_gaussianPDF, Set.indicator, Set.mem_ofPred_eq, smul_eq_mul]
+ split_ifs <;> ring
+
+/-! ## `cm_` (c): the bracket `t^4 - 4t^2 + 8 - 8 exp (-t^2/2)` under `N(0, 5/3)` -/
+
+/-- `t ↦ t^4` is integrable against `gaussianReal 0 v` (`memLp_id_gaussianReal'` at `p = 4`,
+`MemLp.integrable_norm_pow`, `|t|^4 = t^4`). -/
+theorem cm_integrable_pow_four (v : NNReal) :
+ Integrable (fun t : ℝ => t ^ 4) (gaussianReal 0 v) := by
+ have h := (memLp_id_gaussianReal' (μ := 0) (v := v) ((4 : ℕ) : ENNReal) (by simp)).integrable_norm_pow
+ (by norm_num)
+ refine h.congr (Filter.Eventually.of_forall fun x => ?_)
+ change ‖x‖ ^ 4 = x ^ 4
+ rw [Real.norm_eq_abs, pow_abs, abs_of_nonneg (by positivity)]
+
+/-- `t ↦ exp (-t^2/2)` is integrable against `gaussianReal 0 v`: measurable and bounded by `1`
+under a probability measure (`Integrable.mono'`). -/
+theorem cm_integrable_exp (v : NNReal) :
+ Integrable (fun t : ℝ => Real.exp (-(t ^ 2) / 2)) (gaussianReal 0 v) := by
+ refine (integrable_const (1 : ℝ)).mono' (by fun_prop : Measurable fun t : ℝ =>
+ Real.exp (-(t ^ 2) / 2)).aestronglyMeasurable (Filter.Eventually.of_forall fun t => ?_)
+ rw [Real.norm_eq_abs, abs_of_pos (Real.exp_pos _), Real.exp_le_one_iff]
+ have : 0 ≤ t ^ 2 := sq_nonneg t
+ linarith
+
+/-- The bracket `t^4 - 4t^2 + 8 - 8 exp (-t^2/2)` is integrable against `gaussianReal 0 v`
+(sums and scalar multiples of integrable functions). -/
+theorem cm_integrable_bracket (v : NNReal) :
+ Integrable (fun t : ℝ => t ^ 4 - 4 * t ^ 2 + 8 - 8 * Real.exp (-(t ^ 2) / 2))
+ (gaussianReal 0 v) :=
+ ((((cm_integrable_pow_four v).sub ((c1_integrable_sq_gaussianReal v).const_mul 4)).add
+ (integrable_const 8)).sub ((cm_integrable_exp v).const_mul 8))
+
+/-- The integral of the bracket against `gaussianReal 0 (5/3)` is
+`25/3 - 20/3 + 8 - 8 sqrt (3/8)`: linearity, then the moments `∫ t^4 = 3 (5/3)^2`
+(`tm_fourth_moment`), `∫ t^2 = 5/3` (`c1_second_moment_gaussianReal`) and
+`∫ exp (-t^2/2) = sqrt (3/8)` (`tm_exp_moment`). -/
+theorem cm_integral_bracket :
+ ∫ t, (t ^ 4 - 4 * t ^ 2 + 8 - 8 * Real.exp (-(t ^ 2) / 2)) ∂(gaussianReal 0 (5 / 3 : NNReal)) =
+ 25 / 3 - 20 / 3 + 8 - 8 * Real.sqrt (3 / 8) := by
+ have h4 := cm_integrable_pow_four (5 / 3 : NNReal)
+ have h2 := c1_integrable_sq_gaussianReal (5 / 3 : NNReal)
+ have he := cm_integrable_exp (5 / 3 : NNReal)
+ have hA : Integrable (fun t : ℝ => t ^ 4 - 4 * t ^ 2) (gaussianReal 0 (5 / 3 : NNReal)) :=
+ h4.sub (h2.const_mul 4)
+ have hB : Integrable (fun t : ℝ => t ^ 4 - 4 * t ^ 2 + 8) (gaussianReal 0 (5 / 3 : NNReal)) :=
+ hA.add (integrable_const 8)
+ have hC : Integrable (fun t : ℝ => 8 * Real.exp (-(t ^ 2) / 2))
+ (gaussianReal 0 (5 / 3 : NNReal)) :=
+ he.const_mul 8
+ have hD : Integrable (fun t : ℝ => 4 * t ^ 2) (gaussianReal 0 (5 / 3 : NNReal)) :=
+ h2.const_mul 4
+ rw [integral_sub hB hC, integral_add hA (integrable_const 8), integral_sub h4 hD,
+ integral_const_mul, integral_const_mul, integral_const,
+ tm_fourth_moment, c1_second_moment_gaussianReal, tm_exp_moment]
+ simp
+ norm_num
+
+/-- For an even, measurable, integrable `h` and `v ≠ 0`, the integral of `1_{Iio 0} h` against
+`gaussianReal 0 v` is half the integral of `h`: the change of variables `t ↦ -t`
+(`gaussianReal_map_neg`, `integral_map`) equates the integrals over `Iio 0` and `Ioi 0`, and
+`integral_add_compl` with `integral_Ici_eq_integral_Ioi` (no atoms) adds them to the whole. -/
+theorem cm_setIntegral_Iio_even (v : NNReal) (hv : v ≠ 0) (h : ℝ → ℝ) (hm : Measurable h)
+ (heven : ∀ t, h (-t) = h t) (hint : Integrable h (gaussianReal 0 v)) :
+ ∫ t, Set.indicator (Set.Iio 0) h t ∂(gaussianReal 0 v) =
+ (1 / 2) * ∫ t, h t ∂(gaussianReal 0 v) := by
+ have : NullSingletonClass (gaussianReal 0 v) := nullSingletonClass_gaussianReal hv
+ set γ := gaussianReal 0 v with hγ
+ have hneg : γ.map (fun x => -x) = γ := by rw [hγ, gaussianReal_map_neg, neg_zero]
+ have hsym : ∫ t in Set.Iio (0 : ℝ), h t ∂γ = ∫ t in Set.Ioi (0 : ℝ), h t ∂γ := by
+ calc ∫ t in Set.Iio (0 : ℝ), h t ∂γ
+ = ∫ t, Set.indicator (Set.Iio (0 : ℝ)) h t ∂γ :=
+ (integral_indicator measurableSet_Iio).symm
+ _ = ∫ t, Set.indicator (Set.Iio (0 : ℝ)) h t ∂(γ.map (fun x => -x)) := by rw [hneg]
+ _ = ∫ t, Set.indicator (Set.Iio (0 : ℝ)) h (-t) ∂γ :=
+ integral_map measurable_neg.aemeasurable
+ (hm.indicator measurableSet_Iio).aestronglyMeasurable
+ _ = ∫ t, Set.indicator (Set.Ioi (0 : ℝ)) h t ∂γ := by
+ congr 1
+ funext t
+ simp only [Set.indicator, Set.mem_Iio, Set.mem_Ioi, neg_lt_zero, heven]
+ _ = ∫ t in Set.Ioi (0 : ℝ), h t ∂γ := integral_indicator measurableSet_Ioi
+ have hsplit := integral_add_compl (μ := γ) (s := Set.Iio (0 : ℝ)) measurableSet_Iio hint
+ rw [Set.compl_Iio, integral_Ici_eq_integral_Ioi, ← hsym] at hsplit
+ rw [integral_indicator measurableSet_Iio]
+ linarith
+
+/-! ## `cm_` (d): the cone integrand on the product space -/
+
+/-- `coneIntegrand q` is the indicator of `{q.1 < 0 ∧ q.2.1^2 + q.2.2^2 < q.1^2}` applied to
+`(q.1^2 - q.2.1^2 - q.2.2^2)^2` (`cm_cone_iff`, `cm_det_transverse`). -/
+theorem cm_coneIntegrand_eq (q : ℝ × ℝ × ℝ) :
+ coneIntegrand q = Set.indicator {q : ℝ × ℝ × ℝ | q.1 < 0 ∧ q.2.1 ^ 2 + q.2.2 ^ 2 < q.1 ^ 2}
+ (fun q => (q.1 ^ 2 - q.2.1 ^ 2 - q.2.2 ^ 2) ^ 2) q := by
+ unfold coneIntegrand
+ simp only [Set.indicator, Set.mem_ofPred_eq, cm_cone_iff, cm_det_transverse]
+
+/-- `coneIntegrand` is measurable: by `cm_coneIntegrand_eq` it is a polynomial times the
+indicator of a measurable set (`measurableSet_lt`, `Measurable.indicator`). -/
+theorem cm_measurable_coneIntegrand : Measurable coneIntegrand := by
+ have e : coneIntegrand = fun q => Set.indicator
+ {q : ℝ × ℝ × ℝ | q.1 < 0 ∧ q.2.1 ^ 2 + q.2.2 ^ 2 < q.1 ^ 2}
+ (fun q => (q.1 ^ 2 - q.2.1 ^ 2 - q.2.2 ^ 2) ^ 2) q := funext cm_coneIntegrand_eq
+ rw [e]
+ have h1 : MeasurableSet {q : ℝ × ℝ × ℝ | q.1 < 0} :=
+ measurableSet_lt measurable_fst measurable_const
+ have h2 : MeasurableSet {q : ℝ × ℝ × ℝ | q.2.1 ^ 2 + q.2.2 ^ 2 < q.1 ^ 2} :=
+ measurableSet_lt (by fun_prop) (by fun_prop)
+ exact Measurable.indicator (by fun_prop) (h1.inter h2)
+
+/-- `|coneIntegrand q| ≤ q.1^4`: inside the cone `0 ≤ q.1^2 - q.2.1^2 - q.2.2^2 ≤ q.1^2`,
+outside it the integrand is `0`. -/
+theorem cm_coneIntegrand_bound (q : ℝ × ℝ × ℝ) : ‖coneIntegrand q‖ ≤ q.1 ^ 4 := by
+ rw [cm_coneIntegrand_eq]
+ by_cases h : q.1 < 0 ∧ q.2.1 ^ 2 + q.2.2 ^ 2 < q.1 ^ 2
+ · rw [Set.indicator_of_mem
+ (show q ∈ {q : ℝ × ℝ × ℝ | q.1 < 0 ∧ q.2.1 ^ 2 + q.2.2 ^ 2 < q.1 ^ 2} from h), Real.norm_eq_abs,
+ abs_of_nonneg (sq_nonneg _)]
+ have h0 : 0 ≤ q.1 ^ 2 - q.2.1 ^ 2 - q.2.2 ^ 2 := by linarith [h.2]
+ have h1 : q.1 ^ 2 - q.2.1 ^ 2 - q.2.2 ^ 2 ≤ q.1 ^ 2 := by
+ nlinarith [sq_nonneg q.2.1, sq_nonneg q.2.2]
+ calc (q.1 ^ 2 - q.2.1 ^ 2 - q.2.2 ^ 2) ^ 2 ≤ (q.1 ^ 2) ^ 2 := pow_le_pow_left₀ h0 h1 2
+ _ = q.1 ^ 4 := by ring
+ · rw [Set.indicator_of_notMem
+ (show q ∉ {q : ℝ × ℝ × ℝ | q.1 < 0 ∧ q.2.1 ^ 2 + q.2.2 ^ 2 < q.1 ^ 2} from h), norm_zero]
+ positivity
+
+/-- `coneIntegrand` is integrable against `N(0, 5/3) ⊗ (N(0, 1) ⊗ N(0, 1))`: it is dominated by
+`q ↦ q.1^4`, integrable as a function of the first coordinate (`cm_integrable_pow_four`,
+`Integrable.comp_fst`, `Integrable.mono'`). -/
+theorem cm_integrable_coneIntegrand :
+ Integrable coneIntegrand ((gaussianReal 0 (5 / 3 : NNReal)).prod
+ ((gaussianReal 0 1).prod (gaussianReal 0 1))) :=
+ Integrable.mono' ((cm_integrable_pow_four (5 / 3 : NNReal)).comp_fst _)
+ cm_measurable_coneIntegrand.aestronglyMeasurable
+ (Filter.Eventually.of_forall cm_coneIntegrand_bound)
+
+/-- For `s < 0` the slice `p ↦ coneIntegrand (s, p)` is the closed-disk integrand
+`1{|p|^2 ≤ s^2} (s^2 - |p|^2)^2` (on the circle `|p|^2 = s^2` both sides vanish). -/
+theorem cm_coneIntegrand_neg (s : ℝ) (p : ℝ × ℝ) (hs : s < 0) :
+ coneIntegrand (s, p) = Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ s ^ 2}
+ (fun q => (s ^ 2 - q.1 ^ 2 - q.2 ^ 2) ^ 2) p := by
+ rw [cm_coneIntegrand_eq]
+ simp only [Set.indicator, Set.mem_ofPred_eq]
+ split_ifs with h1 h2 h2
+ · rfl
+ · exact absurd h1.2.le h2
+ · have he : p.1 ^ 2 + p.2 ^ 2 = s ^ 2 := le_antisymm h2 (not_lt.mp (fun h => h1 ⟨hs, h⟩))
+ have he' : s ^ 2 - p.1 ^ 2 - p.2 ^ 2 = 0 := by linarith
+ rw [he']
+ norm_num
+ · rfl
+
+/-- For `s ≥ 0` the slice `p ↦ coneIntegrand (s, p)` vanishes (the cone needs `s < 0`). -/
+theorem cm_coneIntegrand_nonneg (s : ℝ) (p : ℝ × ℝ) (hs : 0 ≤ s) : coneIntegrand (s, p) = 0 := by
+ rw [cm_coneIntegrand_eq, Set.indicator_of_notMem]
+ simp only [Set.mem_ofPred_eq, not_and]
+ intro h
+ linarith
+
+/-- The inner integral: `∫ coneIntegrand (s, ·) d(N(0, 1) ⊗ N(0, 1))` is
+`1_{Iio 0}(s) (s^4 - 4s^2 + 8 - 8 exp (-s^2/2))` (`cm_coneIntegrand_neg` with
+`cm_gauss2_integral` at `a = s^2`, and `cm_coneIntegrand_nonneg`). -/
+theorem cm_inner (s : ℝ) :
+ ∫ p, coneIntegrand (s, p) ∂((gaussianReal 0 1).prod (gaussianReal 0 1)) =
+ Set.indicator (Set.Iio 0)
+ (fun t : ℝ => t ^ 4 - 4 * t ^ 2 + 8 - 8 * Real.exp (-(t ^ 2) / 2)) s := by
+ rcases lt_or_ge s 0 with hs | hs
+ · rw [Set.indicator_of_mem (Set.mem_Iio.mpr hs)]
+ refine (integral_congr_ae (Filter.Eventually.of_forall
+ (fun p => cm_coneIntegrand_neg s p hs))).trans ?_
+ rw [cm_gauss2_integral (s ^ 2) (sq_nonneg s)]
+ ring
+ · rw [Set.indicator_of_notMem (by simpa using hs)]
+ refine (integral_congr_ae (Filter.Eventually.of_forall
+ (fun p => cm_coneIntegrand_nonneg s p hs))).trans ?_
+ simp
+
+end Aux
+
+/-! ## The `m = 2` cone moment identity for every inhabitant of the interface -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.ConeMomentD2Identity` (claim `side24-coefficient`), for every inhabitant `I : ConeMomentInterface`.
+Method: 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`).
+Does 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. -/
+theorem coneMomentD2Identity (I : ConeMomentInterface) : UniversalLaw.Spec.Side24.ConeMomentD2Identity I := by
+ unfold UniversalLaw.Spec.Side24.ConeMomentD2Identity
+ let := I.mΩ
+ have := I.isProb
+ calc ∫ ω, coneIntegrand (I.s ω, I.x ω, I.y ω) ∂I.P
+ = ∫ q, coneIntegrand q ∂(Measure.map (fun ω => (I.s ω, I.x ω, I.y ω)) I.P) :=
+ (integral_map (UniversalLaw.Proofs.Side24Interfaces.Aux.tm_aemeasurable_triple I)
+ Aux.cm_measurable_coneIntegrand.aestronglyMeasurable).symm
+ _ = ∫ q, coneIntegrand q ∂((gaussianReal 0 (5 / 3 : NNReal)).prod
+ ((gaussianReal 0 1).prod (gaussianReal 0 1))) := by rw [I.sxy_law]
+ _ = ∫ s, ∫ p, coneIntegrand (s, p) ∂((gaussianReal 0 1).prod (gaussianReal 0 1))
+ ∂(gaussianReal 0 (5 / 3 : NNReal)) :=
+ integral_prod _ Aux.cm_integrable_coneIntegrand
+ _ = ∫ s, Set.indicator (Set.Iio 0)
+ (fun t : ℝ => t ^ 4 - 4 * t ^ 2 + 8 - 8 * Real.exp (-(t ^ 2) / 2)) s
+ ∂(gaussianReal 0 (5 / 3 : NNReal)) := by
+ congr 1
+ funext s
+ exact Aux.cm_inner s
+ _ = (1 / 2) * ∫ t, (t ^ 4 - 4 * t ^ 2 + 8 - 8 * Real.exp (-(t ^ 2) / 2))
+ ∂(gaussianReal 0 (5 / 3 : NNReal)) :=
+ Aux.cm_setIntegral_Iio_even (5 / 3 : NNReal) (by norm_num) _ (by fun_prop)
+ (fun t => by simp only [neg_sq, show (-t) ^ 4 = t ^ 4 by ring])
+ (Aux.cm_integrable_bracket _)
+ _ = (1 / 2) * (25 / 3 - 20 / 3 + 8 - 8 * Real.sqrt (3 / 8)) := by
+ rw [Aux.cm_integral_bracket]
+
+end UniversalLaw.Proofs.Side24ConeMoment
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Covariance.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Covariance.lean
new file mode 100644
index 000000000..46303750e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Covariance.lean
@@ -0,0 +1,282 @@
+import Specifications.Side24
+import SpecificationProofs.Side24Analysis
+
+/-!
+# SIDE24 reference covariance lower bound: `C_ref - I/3` is positive semidefinite
+(statement module `Specifications.Side24`)
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+The one theorem outside the `Aux` namespace has as its type exactly the registered `Prop`
+`UniversalLaw.Spec.Side24.ReferenceCovarianceLowerBound` of `Specifications/Side24.lean`
+(statement packet `specifications/lean_statements_20261010`, which is not modified here). A
+kernel-checked proof of that `Prop` is evidence about that `Prop` only, for the formal objects
+(`E d`, `Kinf`, `derivContraction`, `jetDirs`, `svecScale`, `jointCov`, `Cref`, and Mathlib's
+`Matrix.PosSemidef`, which includes `IsHermitian`): it does not make the informal Layer 0 note
+(SIDE24-COEFFICIENT-D23-20260924-v1, register row `side24-coefficient`) reviewed, accepted or
+"verified", it does not identify the formal definitions with the informal objects (that
+alignment is PENDING_INDEPENDENT_REVIEW), it does not show that `Cref` is the covariance of any
+random vector (no field is constructed), it says nothing about `C_24`, `CovarianceOrdering` or
+`EntrywiseCovarianceBound`, it does not enclose the coefficient `c_{d,24}`, and it promotes,
+closes, discharges or reclassifies nothing.
+
+Provenance: the round-5 lane for `ReferenceCovarianceLowerBound`, the `Prop` that the round-4
+triage (workflow `wf_a3531fd8-891`) classified PROVABLE_WITH_WORK. The contraction values of
+orders two, four and six are the round-4 helpers `Side24Analysis.Aux.rb_order_two`,
+`rb_order_four`, `rb_order_six`, imported, not re-proved. Helper lemmas live in
+`UniversalLaw.Proofs.Side24Covariance.Aux`, tagged `cv_`; the gate inventories only the theorem
+outside that namespace. The mathematics:
+
+* Odd orders vanish at `0` (`cv_iteratedFDeriv_odd`, `cv_odd_zero`): `Kinf d` is even, i.e.
+ `Kinf d ∘ (-id) = Kinf d`, so `ContinuousLinearMap.iteratedFDeriv_comp_right` gives
+ `D^n Kinf 0 [m] = D^n Kinf 0 [-m_1, …, -m_n] = (-1)^n D^n Kinf 0 [m]`
+ (`ContinuousMultilinearMap.map_smul_univ`), hence `0` for odd `n`, in arbitrary directions. No
+ general-direction evaluation of order three or five is needed.
+* The entries of `Cref d u R` (`cv_GG`, `cv_Gt`, `cv_tG`, `cv_tt`, `cv_GH`, `cv_HG`, `cv_tH`,
+ `cv_Ht`, `cv_HH`), read off `jointCov` with the sign `(-1)^{|b|}` and the `svec` scaling: gradient
+ block `⟪R i, R j⟫`; `Cov(G_i, t) = Cov(t, G_i) = -3 ⟪u, u⟫ ⟪R i, u⟫`; `Var(t) = 15 ⟪u, u⟫^3`;
+ every gradient/Hessian and `t`/Hessian entry is an odd-order contraction, hence `0`; the
+ Hessian block is `s_p s_q` times the three pairings of order four.
+* In an orthonormal frame with `u = R 0` (`cv_decomp`), entrywise,
+ `Cref - (1/3) I = diagonal δ + (2/3) v vᵀ + w wᵀ` with `δ = 0` at `G_0`, `2/3` at `G_i`
+ (`i ≠ 0`), `7/6` at `t`, `5/3` at every `svec` coordinate; `v = e_{G_0} - (9/2) e_t`; `w` the
+ indicator of the diagonal Hessian coordinates. On the odd block this reads as the certificate
+ `(2/3) a^2 - 6 a b + (44/3) b^2 = (2/3) (a - (9/2) b)^2 + (7/6) b^2` (an informal reading of
+ the entries, not a separate lemma). The minors `2/3` and `7/9` named in the statement-packet
+ docstring are quoted for comparison only (`7/6 = (7/9)/(2/3)`): main's
+ `UniversalLaw.Side24.odd_block_eigenvalues`, `odd_block_shifted_minors` and
+ `smaller_eigenvalue_exceeds_third` are neither imported, cited nor relied on; the entry
+ arithmetic (`15 - 1/3 = 7/6 + (2/3) (9/2)^2`, `-3 = (2/3) (-9/2)`) is discharged inline by
+ `simp`/`norm_num` in `cv_decomp`, and no minor, no eigenvalue `8 ± sqrt 58` and no comparison
+ of an eigenvalue with `1/3` is computed or stated here. On the Hessian block the decomposition
+ is `J + 2 I - I/3` on the diagonal coordinates and `2 - 1/3` on the off-diagonal ones (the `√2`
+ scaling squares to `2`).
+* Each summand is positive semidefinite (`Matrix.PosSemidef.diagonal`,
+ `Matrix.posSemidef_vecMulVec_self_star`, `Matrix.PosSemidef.smul`, `Matrix.PosSemidef.add`), so
+ `cv_psd` holds for every `d` with `0 < d`; the inventory theorem specialises it, and the
+ hypothesis `d = 2 ∨ d = 3` of the `Prop` is not used by the proof (a remark about the formal
+ statement, not a change of it). The symmetry the `Prop` requires (the `IsHermitian` half of
+ `PosSemidef`, of `Cref d (R ⟨0, hd⟩) R - (1/3) • 1` for orthonormal `R` and `0 < d`) follows
+ from the entrywise decomposition `cv_decomp` into symmetric summands, not from any symmetry of
+ `iteratedFDeriv`. Symmetry of `Cref d u R` for general `u` and `R` is not stated here.
+
+Remark recorded by the lane, for the maintainers (nothing below is edited here): the proof-packet
+README row "Side24 covariance and density" says, of this `Prop`, that "order 5 needs one more
+general-direction level of the peeling" and names `Matrix.posSemidef_iff_dotProduct_mulVec` as the
+route; neither is load-bearing here (the evenness argument above replaces the order-five level,
+and the decomposition into manifestly positive semidefinite summands replaces the quadratic-form
+expansion over the index type). This is a remark about an informal reason, not about any claim;
+no register label changes.
+-/
+
+namespace UniversalLaw.Proofs.Side24Covariance
+
+open UniversalLaw.Spec.Side24
+open scoped RealInnerProductSpace
+
+namespace Aux
+
+/-! ## `cv_`: odd orders of `Kinf d` vanish at the origin -/
+
+/-- `Kinf d` is even: `Kinf d ∘ (-id) = Kinf d` (`norm_neg`). -/
+theorem cv_kinf_comp_neg {d : ℕ} :
+ (Kinf d ∘ (-ContinuousLinearMap.id ℝ (E d))) = Kinf d := by
+ funext x
+ simp [Kinf]
+
+/-- Every odd-order iterated derivative of `Kinf d` at `0` vanishes, in arbitrary directions:
+`ContinuousLinearMap.iteratedFDeriv_comp_right` with the evenness `cv_kinf_comp_neg` gives
+`D^n Kinf 0 [m] = (-1)^n D^n Kinf 0 [m]` (`ContinuousMultilinearMap.map_smul_univ`). -/
+theorem cv_iteratedFDeriv_odd {d : ℕ} (n : ℕ) (hn : Odd n) (m : Fin n → E d) :
+ iteratedFDeriv ℝ n (Kinf d) 0 m = 0 := by
+ have h := (-ContinuousLinearMap.id ℝ (E d)).iteratedFDeriv_comp_right
+ (Side24Analysis.Aux.rb_kinf_contDiff (d := d)) (0 : E d) (i := n) (mod_cast le_top)
+ rw [cv_kinf_comp_neg] at h
+ have h2 := congrArg (fun T => T m) h
+ simp only [ContinuousMultilinearMap.compContinuousLinearMap_apply, map_zero] at h2
+ have h3 : (fun i => (-ContinuousLinearMap.id ℝ (E d)) (m i)) = fun i => (-1 : ℝ) • m i := by
+ funext i
+ simp
+ rw [h3, ContinuousMultilinearMap.map_smul_univ] at h2
+ simp only [Finset.prod_const, Finset.card_univ, Fintype.card_fin, hn.neg_one_pow] at h2
+ simp at h2
+ linarith
+
+/-- A contraction of `Kinf d` at `0` against a list of odd length vanishes. -/
+theorem cv_odd_zero {d : ℕ} (l : List (E d)) (hl : Odd l.length) :
+ derivContraction d (Kinf d) 0 l = 0 :=
+ cv_iteratedFDeriv_odd _ hl _
+
+/-! ## `cv_`: the entries of `Cref d u R` in a general frame -/
+
+/-- Gradient/gradient entry: `(-1)^1 · (-⟪R i, R j⟫) = ⟪R i, R j⟫`. -/
+theorem cv_GG {d : ℕ} (u : E d) (R : Fin d → E d) (i j : Fin d) :
+ Cref d u R (Sum.inl i) (Sum.inl j) = ⟪R i, R j⟫ := by
+ simp [Cref, jointCov, svecScale, jetDirs, Side24Analysis.Aux.rb_order_two]
+
+/-- Gradient/`t` entry: `(-1)^3 · D^4 Kinf 0 [R i, u, u, u] = -3 ⟪u, u⟫ ⟪R i, u⟫`. -/
+theorem cv_Gt {d : ℕ} (u : E d) (R : Fin d → E d) (i : Fin d) (t : Unit) :
+ Cref d u R (Sum.inl i) (Sum.inr (Sum.inl t)) = -(3 * (⟪u, u⟫ * ⟪R i, u⟫)) := by
+ simp [Cref, jointCov, svecScale, jetDirs, Side24Analysis.Aux.rb_order_four]
+ ring
+
+/-- `t`/gradient entry: `(-1)^1 · D^4 Kinf 0 [u, u, u, R j] = -3 ⟪u, u⟫ ⟪u, R j⟫`. -/
+theorem cv_tG {d : ℕ} (u : E d) (R : Fin d → E d) (j : Fin d) (t : Unit) :
+ Cref d u R (Sum.inr (Sum.inl t)) (Sum.inl j) = -(3 * (⟪u, u⟫ * ⟪u, R j⟫)) := by
+ simp [Cref, jointCov, svecScale, jetDirs, Side24Analysis.Aux.rb_order_four]
+ ring
+
+/-- `t`/`t` entry: `(-1)^3 · D^6 Kinf 0 [u, …, u] = 15 ⟪u, u⟫^3`. -/
+theorem cv_tt {d : ℕ} (u : E d) (R : Fin d → E d) (t t' : Unit) :
+ Cref d u R (Sum.inr (Sum.inl t)) (Sum.inr (Sum.inl t')) =
+ 15 * (⟪u, u⟫ * ⟪u, u⟫ * ⟪u, u⟫) := by
+ simp [Cref, jointCov, svecScale, jetDirs, Side24Analysis.Aux.rb_order_six]
+ ring
+
+/-- Gradient/Hessian entry: an order-three contraction, hence `0`. -/
+theorem cv_GH {d : ℕ} (u : E d) (R : Fin d → E d) (i : Fin d) (q : SymIndex d) :
+ Cref d u R (Sum.inl i) (Sum.inr (Sum.inr q)) = 0 := by
+ simp only [Cref, jointCov, Matrix.of_apply, jetDirs, List.cons_append, List.nil_append]
+ rw [cv_odd_zero _ ⟨1, rfl⟩, mul_zero]
+
+/-- Hessian/gradient entry: an order-three contraction, hence `0`. -/
+theorem cv_HG {d : ℕ} (u : E d) (R : Fin d → E d) (p : SymIndex d) (j : Fin d) :
+ Cref d u R (Sum.inr (Sum.inr p)) (Sum.inl j) = 0 := by
+ simp only [Cref, jointCov, Matrix.of_apply, jetDirs, List.cons_append, List.nil_append]
+ rw [cv_odd_zero _ ⟨1, rfl⟩, mul_zero]
+
+/-- `t`/Hessian entry: an order-five contraction, hence `0`. -/
+theorem cv_tH {d : ℕ} (u : E d) (R : Fin d → E d) (t : Unit) (q : SymIndex d) :
+ Cref d u R (Sum.inr (Sum.inl t)) (Sum.inr (Sum.inr q)) = 0 := by
+ simp only [Cref, jointCov, Matrix.of_apply, jetDirs, List.cons_append, List.nil_append]
+ rw [cv_odd_zero _ ⟨2, rfl⟩, mul_zero]
+
+/-- Hessian/`t` entry: an order-five contraction, hence `0`. -/
+theorem cv_Ht {d : ℕ} (u : E d) (R : Fin d → E d) (p : SymIndex d) (t : Unit) :
+ Cref d u R (Sum.inr (Sum.inr p)) (Sum.inr (Sum.inl t)) = 0 := by
+ simp only [Cref, jointCov, Matrix.of_apply, jetDirs, List.cons_append, List.nil_append]
+ rw [cv_odd_zero _ ⟨2, rfl⟩, mul_zero]
+
+/-- Hessian/Hessian entry: `s_p s_q (-1)^2` times the three pairings of
+`D^4 Kinf 0 [R p₁, R p₂, R q₁, R q₂]`. -/
+theorem cv_HH {d : ℕ} (u : E d) (R : Fin d → E d) (p q : SymIndex d) :
+ Cref d u R (Sum.inr (Sum.inr p)) (Sum.inr (Sum.inr q)) =
+ svecScale d (Sum.inr (Sum.inr p)) * svecScale d (Sum.inr (Sum.inr q)) *
+ (⟪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⟫
+ + ⟪R p.1.1, R q.1.2⟫ * ⟪R p.1.2, R q.1.1⟫) := by
+ simp only [Cref, jointCov, Matrix.of_apply, jetDirs, List.cons_append, List.nil_append,
+ Side24Analysis.Aux.rb_order_four]
+ simp
+
+/-! ## `cv_`: the decomposition into positive semidefinite summands -/
+
+/-- In an orthonormal frame with `u = R 0`, `Cref - (1/3) I` is, entrywise, a nonnegative
+diagonal matrix plus `(2/3) v vᵀ` with `v = e_{G_0} - (9/2) e_t` plus `w wᵀ` with `w` the
+indicator of the diagonal Hessian coordinates. -/
+theorem cv_decomp {d : ℕ} (hd : 0 < d) (R : Fin d → E d) (hR : Orthonormal ℝ R) :
+ Cref d (R ⟨0, hd⟩) R - (1 / 3 : ℝ) • (1 : Matrix (JointIndex d) (JointIndex d) ℝ) =
+ Matrix.diagonal (Sum.elim (fun i : Fin d => if i = ⟨0, hd⟩ then (0 : ℝ) else 2 / 3)
+ (Sum.elim (fun _ : Unit => (7 / 6 : ℝ)) (fun _ : SymIndex d => (5 / 3 : ℝ))))
+ + (2 / 3 : ℝ) • Matrix.vecMulVec
+ (Sum.elim (fun i : Fin d => if i = ⟨0, hd⟩ then (1 : ℝ) else 0)
+ (Sum.elim (fun _ : Unit => (-9 / 2 : ℝ)) (fun _ : SymIndex d => (0 : ℝ))))
+ (Sum.elim (fun i : Fin d => if i = ⟨0, hd⟩ then (1 : ℝ) else 0)
+ (Sum.elim (fun _ : Unit => (-9 / 2 : ℝ)) (fun _ : SymIndex d => (0 : ℝ))))
+ + Matrix.vecMulVec
+ (Sum.elim (fun _ : Fin d => (0 : ℝ))
+ (Sum.elim (fun _ : Unit => (0 : ℝ))
+ (fun p : SymIndex d => if p.1.1 = p.1.2 then (1 : ℝ) else 0)))
+ (Sum.elim (fun _ : Fin d => (0 : ℝ))
+ (Sum.elim (fun _ : Unit => (0 : ℝ))
+ (fun p : SymIndex d => if p.1.1 = p.1.2 then (1 : ℝ) else 0))) := by
+ have hite := orthonormal_iff_ite.mp hR
+ ext a b
+ rcases a with i | t | p <;> rcases b with j | t' | q
+ · simp only [Matrix.sub_apply, Matrix.add_apply, Matrix.smul_apply, Matrix.one_apply,
+ Matrix.diagonal_apply, Matrix.vecMulVec_apply, cv_GG, hite, Sum.inl.injEq, Sum.elim_inl,
+ smul_eq_mul]
+ split_ifs <;> simp_all <;> norm_num
+ · rw [Matrix.sub_apply, cv_Gt, hite, hite]
+ simp [Matrix.add_apply, Matrix.smul_apply, Matrix.vecMulVec_apply]
+ split_ifs <;> norm_num
+ · simp [Matrix.sub_apply, Matrix.add_apply, Matrix.smul_apply, Matrix.vecMulVec_apply, cv_GH]
+ · rw [Matrix.sub_apply, cv_tG, hite, hite]
+ simp [Matrix.add_apply, Matrix.smul_apply, Matrix.vecMulVec_apply]
+ by_cases hj : j = ⟨0, hd⟩
+ · subst hj
+ norm_num
+ · simp [hj, Ne.symm hj]
+ · rw [Matrix.sub_apply, cv_tt, hite]
+ simp [Matrix.add_apply, Matrix.smul_apply, Matrix.vecMulVec_apply]
+ norm_num
+ · simp [Matrix.sub_apply, Matrix.add_apply, Matrix.smul_apply, Matrix.vecMulVec_apply, cv_tH]
+ · simp [Matrix.sub_apply, Matrix.add_apply, Matrix.smul_apply, Matrix.vecMulVec_apply, cv_HG]
+ · simp [Matrix.sub_apply, Matrix.add_apply, Matrix.smul_apply, Matrix.vecMulVec_apply, cv_Ht]
+ · obtain ⟨⟨i, j⟩, hij⟩ := p
+ obtain ⟨⟨k, l⟩, hkl⟩ := q
+ simp [Matrix.sub_apply, Matrix.add_apply, Matrix.smul_apply, Matrix.one_apply,
+ Matrix.diagonal_apply, Matrix.vecMulVec_apply, cv_HH, hite, svecScale]
+ rw [Fin.le_def] at hij hkl
+ split_ifs <;> simp_all [Fin.ext_iff] <;> first | omega | norm_num
+
+/-- `Cref - (1/3) I` is positive semidefinite in every orthonormal frame with `u = R 0`, for every
+`d > 0`: the three summands of `cv_decomp` are positive semidefinite. -/
+theorem cv_psd {d : ℕ} (hd : 0 < d) (R : Fin d → E d) (hR : Orthonormal ℝ R) :
+ (Cref d (R ⟨0, hd⟩) R -
+ (1 / 3 : ℝ) • (1 : Matrix (JointIndex d) (JointIndex d) ℝ)).PosSemidef := by
+ rw [cv_decomp hd R hR]
+ refine Matrix.PosSemidef.add (Matrix.PosSemidef.add ?_ ?_) ?_
+ · refine Matrix.PosSemidef.diagonal fun a => ?_
+ rcases a with i | t | p
+ · simp only [Sum.elim_inl, Pi.zero_apply]
+ split_ifs <;> norm_num
+ · simp only [Sum.elim_inr, Sum.elim_inl, Pi.zero_apply]
+ norm_num
+ · simp only [Sum.elim_inr, Pi.zero_apply]
+ norm_num
+ · refine Matrix.PosSemidef.smul ?_ (by norm_num)
+ simpa using Matrix.posSemidef_vecMulVec_self_star
+ (Sum.elim (fun i : Fin d => if i = ⟨0, hd⟩ then (1 : ℝ) else 0)
+ (Sum.elim (fun _ : Unit => (-9 / 2 : ℝ)) (fun _ : SymIndex d => (0 : ℝ))))
+ · simpa using Matrix.posSemidef_vecMulVec_self_star
+ (Sum.elim (fun _ : Fin d => (0 : ℝ))
+ (Sum.elim (fun _ : Unit => (0 : ℝ))
+ (fun p : SymIndex d => if p.1.1 = p.1.2 then (1 : ℝ) else 0)))
+
+end Aux
+
+/-- Proves: `UniversalLaw.Spec.Side24.ReferenceCovarianceLowerBound` (claim
+`side24-coefficient`), for the formal `Cref` of `Specifications.Side24`.
+Method: odd-order contractions of the even kernel `Kinf d` vanish at `0` (`Aux.cv_odd_zero`,
+via `ContinuousLinearMap.iteratedFDeriv_comp_right` and `ContinuousMultilinearMap.map_smul_univ`);
+the orders two, four and six are the round-4 helpers `Side24Analysis.Aux.rb_order_two`,
+`rb_order_four`, `rb_order_six`; in an orthonormal frame with `u = R 0`,
+`Cref - I/3 = diagonal (0, 2/3, …, 2/3; 7/6; 5/3, …, 5/3) + (2/3) v vᵀ + w wᵀ` entrywise
+(`Aux.cv_decomp`, `v = e_{G_0} - (9/2) e_t`, `w` the indicator of the diagonal Hessian
+coordinates), and each summand is positive semidefinite (`Aux.cv_psd`, which holds for every
+`d > 0`; the hypothesis `d = 2 ∨ d = 3` of the `Prop` is not used by the proof).
+Does not establish: the informal Section 3 display "C_ref >= I/3" of the source as the source's
+object (the alignment of `E d`, `Kinf`, `derivContraction`, `jetDirs`, `svecScale`, `jointCov` and
+`Cref` with the source's `R^d`, `K_infty`, jet and joint covariance, and of Mathlib's
+`Matrix.PosSemidef` (which includes `IsHermitian`) with the source's `>=` order, is
+PENDING_INDEPENDENT_REVIEW); that `Cref` is the covariance of any random vector (no field is
+constructed); symmetry of `Cref d u R` for general `u` or a general frame (only the `IsHermitian`
+half of the `Prop`'s `PosSemidef`, at `u = R 0` in an orthonormal frame with `0 < d`, is proved);
+the statement module's own `Does not claim:` text ("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_minors`,
+`smaller_eigenvalue_exceeds_third`), not here"), which describes the statement packet and is not
+edited here; main's `UniversalLaw.Side24.odd_block_eigenvalues`, `odd_block_shifted_minors` and
+`smaller_eigenvalue_exceeds_third` are neither imported, cited nor relied on (the certificate's
+entry arithmetic is discharged inline by `simp`/`norm_num` in `Aux.cv_decomp`), and no minor
+(in particular not `7/9`), no eigenvalue `8 ± sqrt 58` and no comparison of the smaller
+eigenvalue with `1/3` is computed or stated here; anything about `C_24`, `CovarianceOrdering` or
+`EntrywiseCovarianceBound`; any enclosure of the coefficient `c_{d,24}`; 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. It promotes, closes,
+discharges or reclassifies nothing. -/
+theorem referenceCovarianceLowerBound : UniversalLaw.Spec.Side24.ReferenceCovarianceLowerBound := by
+ intro d _ hd R hR
+ exact Aux.cv_psd hd R hR
+
+end UniversalLaw.Proofs.Side24Covariance
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Elementary.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Elementary.lean
new file mode 100644
index 000000000..9d4d045c8
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Elementary.lean
@@ -0,0 +1,212 @@
+import Specifications.Side24
+
+/-!
+# SIDE24: kernel-checked proofs of elementary registered `Prop`s (statement module `Specifications.Side24`)
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+Every theorem below has as its TYPE a registered `Prop` constant of
+`UniversalLaw.Spec.Side24` (statement packet `specifications/lean_statements_20261010`, commit
+pinned there). A kernel-checked proof of such a `Prop` is evidence about that `Prop` only: it
+does not make the informal Layer 0 claim (SIDE24-COEFFICIENT-D23-20260924-v1) accepted,
+reviewed or "verified", does not change its LANDING_CLAIMS disposition (REVIEWED_SCOPED,
+transcribed), does not enclose the coefficient `c_{d,24}`, and does not touch the statement
+register (the statement module is not edited here). Helper lemmas live in the `Aux` namespace
+and are not inventory items.
+
+Allowed transitive axioms: `propext`, `Classical.choice`, `Quot.sound` only (checked by
+`#print axioms`, see the run receipt). No `sorry`, `native_decide`, `decide` on `ℝ`, or custom
+axioms.
+
+Covered (five `Prop`s): `ExponentialBounds`, `SuccessiveTermRatio`, `ConeMomentD2Algebra`,
+`ReferenceCoefficientIdentity`, `ElementaryConeIntegral`.
+
+Not covered here: `TraceMoments`, `ConeMomentD1Identity`, `ConeMomentD2Identity`,
+`RayleighSquareLaw` (Gaussian moment integrals over an interface measure, not algebra);
+`ReferenceOddAndPinBlocks`, `DerivativeBoundAtZero`, `DerivativePairingBound`,
+`DerivativeBoundAtLeastOne` (explicit `iteratedFDeriv` of the Gaussian kernel on
+`EuclideanSpace` through order six); `LatticeImageSumBound` (a `tsum` over `Fin d → ℤ` with a
+shell decomposition); and every interface-level or analytic statement of the module.
+-/
+
+namespace UniversalLaw.Proofs.Side24Elementary
+
+open UniversalLaw.Spec.Side24
+
+namespace Aux
+
+/-! ### Exponential bounds -/
+
+/-- The degree-nine Taylor polynomial of `exp` at `288/125` exceeds `10` (exact rational
+arithmetic). -/
+theorem ten_lt_taylor_sum :
+ (10 : ℝ) < ∑ i ∈ Finset.range 10, (288 / 125 : ℝ) ^ i / (Nat.factorial i : ℝ) := by
+ simp [Finset.sum_range_succ, Nat.factorial]
+ norm_num
+
+/-- `10 < exp (288/125)` by the Taylor lower bound `Real.sum_le_exp_of_nonneg`. -/
+theorem ten_lt_exp : (10 : ℝ) < Real.exp (288 / 125) := by
+ have h := Real.sum_le_exp_of_nonneg (by norm_num : (0 : ℝ) ≤ 288 / 125) 10
+ exact lt_of_lt_of_le ten_lt_taylor_sum h
+
+/-- `10^125 < exp 288`, raising the previous bound to the `125`-th power. -/
+theorem pow_ten_lt_exp : (10 : ℝ) ^ 125 < Real.exp 288 := by
+ have h : Real.exp 288 = Real.exp (288 / 125) ^ 125 := by
+ rw [← Real.exp_nat_mul]; norm_num
+ rw [h]
+ exact pow_lt_pow_left₀ ten_lt_exp (by norm_num) (by norm_num)
+
+/-- `exp (-288) < 1 / 10^125`. -/
+theorem exp_neg_lt : Real.exp (-288) < 1 / 10 ^ 125 := by
+ rw [Real.exp_neg, one_div]
+ exact inv_strictAnti₀ (by positivity) pow_ten_lt_exp
+
+/-- `1024 < exp 864` by the quadratic lower bound. -/
+theorem big_lt_exp : (1024 : ℝ) < Real.exp 864 := by
+ have := Real.quadratic_le_exp_of_nonneg (by norm_num : (0 : ℝ) ≤ 864)
+ linarith
+
+/-- The geometric-ratio constant: `512 exp (-864) < 1/2`. -/
+theorem ratio_const_lt_half : 512 * Real.exp (-864) < (1 / 2 : ℝ) := by
+ rw [Real.exp_neg, mul_inv_lt_iff₀ (Real.exp_pos _)]
+ have := big_lt_exp
+ linarith
+
+/-- The term ratio for `j ≥ 1`: `(j+1)^9 ≤ 512 j^9` since `j + 1 ≤ 2 j`. -/
+theorem pow_succ_le (j : ℕ) (hj : 1 ≤ j) : ((j : ℝ) + 1) ^ 9 ≤ 512 * (j : ℝ) ^ 9 := by
+ have hj' : (1 : ℝ) ≤ j := by exact_mod_cast hj
+ have h : ((j : ℝ) + 1) ≤ 2 * j := by linarith
+ calc ((j : ℝ) + 1) ^ 9 ≤ (2 * j) ^ 9 := pow_le_pow_left₀ (by linarith) h 9
+ _ = 512 * (j : ℝ) ^ 9 := by ring
+
+/-- The exponential factor for `j ≥ 1`: `exp (-288 (j+1)^2) ≤ exp (-864) exp (-288 j^2)`. -/
+theorem exp_succ_le (j : ℕ) (hj : 1 ≤ j) :
+ Real.exp (-288 * ((j : ℝ) + 1) ^ 2) ≤ Real.exp (-864) * Real.exp (-288 * (j : ℝ) ^ 2) := by
+ have hj' : (1 : ℝ) ≤ j := by exact_mod_cast hj
+ rw [← Real.exp_add, Real.exp_le_exp]
+ nlinarith
+
+/-! ### Square-root algebra -/
+
+/-- `sqrt (3/8) = sqrt 6 / 4`. -/
+theorem sqrt_three_eighths : Real.sqrt (3 / 8) = Real.sqrt 6 / 4 := by
+ rw [show (3 / 8 : ℝ) = 6 / 4 ^ 2 by norm_num, Real.sqrt_div' _ (by norm_num),
+ Real.sqrt_sq (by norm_num)]
+
+/-- `(sqrt 6)^(4/3) = 24^(1/3) (3/2)^(1/3)`, i.e. `6^(2/3) = 36^(1/3)` and `24 * 3/2 = 36`. -/
+theorem sqrt_six_rpow : (Real.sqrt 6) ^ ((4 : ℝ) / 3) =
+ (24 : ℝ) ^ ((1 : ℝ) / 3) * (3 / 2 : ℝ) ^ ((1 : ℝ) / 3) := by
+ rw [← Real.mul_rpow (by norm_num) (by norm_num), Real.sqrt_eq_rpow,
+ ← Real.rpow_mul (by norm_num), show (1 / (2 : ℝ)) * (4 / 3) = 2 * (1 / 3) by norm_num,
+ Real.rpow_mul (by norm_num), Real.rpow_two]
+ norm_num
+
+/-! ### The elementary cone integral -/
+
+/-- The antiderivative `F z = -((a-z)^2 - 4(a-z) + 8) exp (-z/2)` of
+`(a-z)^2 exp (-z/2) / 2`. -/
+theorem hasDerivAt_antideriv (a z : ℝ) :
+ HasDerivAt (fun z : ℝ => -(((a - z) ^ 2 - 4 * (a - z) + 8) * Real.exp (-z / 2)))
+ ((a - z) ^ 2 * Real.exp (-z / 2) / 2) z := by
+ have h1 : HasDerivAt (fun z : ℝ => a - z) (-1) z :=
+ (hasDerivAt_id' z).const_sub a
+ have h2 : HasDerivAt (fun z : ℝ => (a - z) ^ 2) (((2 : ℕ) : ℝ) * (a - z) ^ (2 - 1) * (-1)) z :=
+ h1.fun_pow 2
+ have h3 : HasDerivAt (fun z : ℝ => 4 * (a - z)) (4 * (-1)) z := h1.const_mul 4
+ have h4 : HasDerivAt (fun z : ℝ => (a - z) ^ 2 - 4 * (a - z) + 8)
+ (((2 : ℕ) : ℝ) * (a - z) ^ (2 - 1) * (-1) - 4 * (-1) + 0) z :=
+ (h2.sub h3).add (hasDerivAt_const z (8 : ℝ))
+ have h5 : HasDerivAt (fun z : ℝ => -z / 2) (-1 / 2) z :=
+ ((hasDerivAt_id' z).neg).div_const 2
+ have h6 : HasDerivAt (fun z : ℝ => Real.exp (-z / 2)) (Real.exp (-z / 2) * (-1 / 2)) z := h5.exp
+ have h7 := (h4.mul h6).neg
+ convert h7 using 1
+ push_cast
+ ring
+
+end Aux
+
+/-! ## Section 2 exponential and ratio facts -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.ExponentialBounds` (register row `side24-coefficient`).
+Method: degree-nine Taylor lower bound `Real.sum_le_exp_of_nonneg` at `288/125` evaluated in
+exact rational arithmetic, then `exp 288 = exp (288/125)^125 > 10^125` and inversion.
+Does not establish: the lattice-image bound or display (2) of the source, any enclosure of the
+coefficient, nonauthor review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. -/
+theorem exponentialBounds : UniversalLaw.Spec.Side24.ExponentialBounds :=
+ ⟨Aux.ten_lt_exp, Aux.exp_neg_lt⟩
+
+/-- Proves: `UniversalLaw.Spec.Side24.SuccessiveTermRatio` (register row `side24-coefficient`).
+Method: `(j+1)^9 ≤ (2j)^9 = 512 j^9` and `-288 (j+1)^2 ≤ -864 - 288 j^2` for `j ≥ 1`;
+`512 exp (-864) < 1/2` from the quadratic lower bound `1 + 864 + 864^2/2 ≤ exp 864`.
+Does not establish: the lattice-image sum bound `LatticeImageSumBound` (the geometric
+summation itself is not performed here), any enclosure of the coefficient, nonauthor review
+or acceptance. -/
+theorem successiveTermRatio : UniversalLaw.Spec.Side24.SuccessiveTermRatio := by
+ refine ⟨fun j hj => ?_, Aux.ratio_const_lt_half⟩
+ calc ((j : ℝ) + 1) ^ 9 * Real.exp (-288 * ((j : ℝ) + 1) ^ 2)
+ ≤ (512 * (j : ℝ) ^ 9) * (Real.exp (-864) * Real.exp (-288 * (j : ℝ) ^ 2)) :=
+ mul_le_mul (Aux.pow_succ_le j hj) (Aux.exp_succ_le j hj) (Real.exp_pos _).le
+ (by positivity)
+ _ = 512 * Real.exp (-864) * ((j : ℝ) ^ 9 * Real.exp (-288 * (j : ℝ) ^ 2)) := by ring
+
+/-! ## Section 1 algebra -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.ConeMomentD2Algebra` (register row `side24-coefficient`).
+Method: `sqrt (3/8) = sqrt 6 / 4` (`Real.sqrt_div'`, `Real.sqrt_sq`), then `ring`.
+Does not establish: the Gaussian identity `ConeMomentD2Identity` (that `D_2` is the cone
+expectation), any enclosure of the coefficient, nonauthor review or acceptance. -/
+theorem coneMomentD2Algebra : UniversalLaw.Spec.Side24.ConeMomentD2Algebra := by
+ unfold UniversalLaw.Spec.Side24.ConeMomentD2Algebra coneMomentD2
+ rw [Aux.sqrt_three_eighths]
+ ring
+
+/-- Proves: `UniversalLaw.Spec.Side24.ReferenceCoefficientIdentity` (register row
+`side24-coefficient`).
+Method: case split `d = 2`, `d = 3`; `(sqrt 6)^(4/3) = 24^(1/3) (3/2)^(1/3)` through
+`Real.sqrt_eq_rpow`, `Real.rpow_mul`, `Real.mul_rpow`; `(2 pi)^(-d)` through `Real.rpow_neg`
+and `Real.rpow_natCast`; then `field_simp` and `ring` with `pi`, `sqrt pi`, `sqrt 3`,
+`24^(1/3)` nonzero.
+Does not establish: that the left side is the parent formula (15.2) evaluated at the reference
+law (rotational invariance of `K_infty` is not specified), the value of `Gamma (7/6)`, equality
+of the periodic and reference coefficients (the source says it is NOT claimed), any enclosure
+of the coefficient, nonauthor review or acceptance. -/
+theorem referenceCoefficientIdentity : UniversalLaw.Spec.Side24.ReferenceCoefficientIdentity := by
+ intro d hd
+ have hpi := Real.pi_pos
+ have hsqpi : 0 < Real.sqrt Real.pi := Real.sqrt_pos.mpr hpi
+ have hsq3 : 0 < Real.sqrt 3 := Real.sqrt_pos.mpr (by norm_num)
+ have h24 : 0 < (24 : ℝ) ^ ((1 : ℝ) / 3) := Real.rpow_pos_of_pos (by norm_num) _
+ have h32 : 0 < (3 / 2 : ℝ) ^ ((1 : ℝ) / 3) := Real.rpow_pos_of_pos (by norm_num) _
+ have hG := Real.Gamma_pos_of_pos (by norm_num : (0 : ℝ) < 7 / 6)
+ rw [Aux.sqrt_six_rpow, Real.rpow_neg (by positivity), Real.rpow_natCast]
+ rcases hd with rfl | rfl
+ · simp only [cRef, sphereArea, coneMomentRef]
+ norm_num
+ field_simp
+ · simp only [cRef, sphereArea, coneMomentRef]
+ norm_num
+ field_simp
+ ring
+
+/-- Proves: `UniversalLaw.Spec.Side24.ElementaryConeIntegral` (register row
+`side24-coefficient`).
+Method: fundamental theorem of calculus `intervalIntegral.integral_eq_sub_of_hasDerivAt` with
+the explicit antiderivative `-((a-z)^2 - 4(a-z) + 8) exp (-z/2)` (derivative rules
+`HasDerivAt.fun_pow`, `.mul`, `.exp`), integrability from continuity (`fun_prop`).
+Does not establish: the Rayleigh law of `R^2` (`RayleighSquareLaw`), the cone-moment identity
+`ConeMomentD2Identity`, any enclosure of the coefficient, nonauthor review or acceptance. -/
+theorem elementaryConeIntegral : UniversalLaw.Spec.Side24.ElementaryConeIntegral := by
+ intro a _
+ have hderiv : ∀ z ∈ Set.uIcc (0 : ℝ) a,
+ HasDerivAt (fun z : ℝ => -(((a - z) ^ 2 - 4 * (a - z) + 8) * Real.exp (-z / 2)))
+ ((a - z) ^ 2 * Real.exp (-z / 2) / 2) z :=
+ fun z _ => Aux.hasDerivAt_antideriv a z
+ have hint : IntervalIntegrable (fun z : ℝ => (a - z) ^ 2 * Real.exp (-z / 2) / 2)
+ MeasureTheory.volume 0 a :=
+ (by fun_prop : Continuous fun z : ℝ => (a - z) ^ 2 * Real.exp (-z / 2) / 2).intervalIntegrable 0 a
+ rw [intervalIntegral.integral_eq_sub_of_hasDerivAt hderiv hint]
+ simp
+ ring
+
+end UniversalLaw.Proofs.Side24Elementary
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Images.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Images.lean
new file mode 100644
index 000000000..595eb11f6
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Images.lean
@@ -0,0 +1,862 @@
+import Specifications.Side24
+import SpecificationProofs.Side24Elementary
+import SpecificationProofs.Side24Analysis
+import SpecificationProofs.Side24Covariance
+
+/-!
+# SIDE24 lattice images and the covariance ordering (statement module `Specifications.Side24`)
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+Each of the three theorems outside the `Aux` namespace has as its type exactly one registered
+`Prop` of `Specifications/Side24.lean`: `ImageBound` (display (2)), `EntrywiseCovarianceBound`
+(the Section 3 entrywise sentence) and `CovarianceOrdering` (display (3)). A kernel-checked proof
+of one of them is evidence about that `Prop`, for the formal objects of the statement module,
+only: it does not make the informal note reviewed or accepted, it does not identify the formal
+objects with the informal ones (alignment is PENDING_INDEPENDENT_REVIEW), it does not enclose the
+coefficient `c_{d,24}`, and it promotes, closes, discharges or reclassifies nothing.
+
+Method. Mathlib's `iteratedFDeriv_tsum` needs summable bounds on the derivatives of the summands
+uniform over the whole space, which the lattice translates `z ↦ Kinf d (z + 24 n)` do not have;
+`Aux.ib_iteratedFDeriv_tsum_of_isOpen` is its local version on an open preconnected set, proved by
+the same induction from `hasFDerivAt_tsum_of_isPreconnected` (present at the packet's Mathlib pin
+`d13f23b7`; first order). On the unit ball the translates have summable bounds (the operator-norm
+pairing bound of round 4, `pairingSum q r ≤ 76 (1 + r)^6`, `(1 + r)^6 ≤ 720 e^(1 + r)`,
+`r - r^2/4 ≤ 1`, the shift bound `exp(-‖z + v‖^2/4) ≤ exp(‖z‖^2/4) exp(-‖v‖^2/8)` and the product
+form of the Gaussian over `Fin d → ℤ`). So, for `q ≤ 6`, `D^q K_24(0) = θ(0)⁻¹ ∑_n D^q K_∞(24 n)`,
+and the difference with `D^q K_∞(0)` is `θ(0)⁻¹ (∑_{n ≠ 0} D^q K_∞(24 n) - (θ(0) - 1) D^q K_∞(0))`, bounded
+through the packet's theorems of `DerivativeBoundAtLeastOne` (`76`), `DerivativeBoundAtZero`
+(`15`), `LatticeImageSumBound` (`1458 e^(-288)`) and `ExponentialBounds` (`e^(-288) < 10^(-125)`)
+by `1458 (76·24^6 + 15) e^(-288) < imageConstE`. The entrywise bound follows with the factor
+`|svecScale a · svecScale b · (-1)^|b|| ≤ 2`. For the ordering, `C_24` is symmetric: a
+contraction of `K_24` at `0` of total order at most `6` (each joint coordinate carries at most three
+directions) is `θ(0)⁻¹ ∑_n` of contractions of the analytic `Kinf d` at `24 n`, which are invariant
+under the block swap (`ContDiffAt.iteratedFDeriv_comp_perm`,
+`Mathlib/Analysis/Analytic/IteratedFDeriv.lean`, present at Mathlib `d13f23b7`; it needs
+`ContDiffAt ℝ ω`, i.e. analyticity), and odd total orders vanish because
+`D^q Kinf(-y) = (-1)^q D^q Kinf(y)` (`Aux.co_kinf_neg_apply`, from the evenness of `Kinf d`, the
+round-5 helper `Side24Covariance.Aux.cv_kinf_comp_neg`) and the lattice sum is invariant under
+`n ↦ -n`; `C_ref` is symmetric with `C_ref - I/3 ≥ 0` by the round-5 theorem; Cauchy-Schwarz over
+at most `13` coordinates gives `|x ⬝ (C_24 - C_ref) x| ≤ 26 imageConstE (x ⬝ x)`, and
+`78 imageConstE ≤ epsilon`.
+
+Provenance: the round-6 lane for `ImageBound`, `EntrywiseCovarianceBound` and `CovarianceOrdering`,
+the three `Prop`s the round-4 triage (workflow `wf_a3531fd8-891`) classified BLOCKED_MISSING_MATHLIB;
+that verdict is the historical record, transcribed in the register and not altered here. Imported,
+not re-proved: the theorems `Side24Analysis.thetaSummable`, `derivativeBoundAtLeastOne`,
+`derivativeBoundAtZero`, `latticeImageSumBound` (round 4), `Side24Elementary.exponentialBounds`
+(round 1) and `Side24Covariance.referenceCovarianceLowerBound` (round 5); the round-4 helpers
+`Side24Analysis.Aux.dp_pairing_all`, `d1_pairingSum_le_of_one_le`, `dp_contDiff_Kinf`,
+`rb_kinf_contDiff`, `th_norm_latticeVec_sq`, `th_summable_pi_prod`, `th_summable_gauss_int`; the
+round-5 helper `Side24Covariance.Aux.cv_kinf_comp_neg` (evenness of `Kinf d`). Helper lemmas live in
+`UniversalLaw.Proofs.Side24Images.Aux`, tagged `ib_` (`ImageBound`), `ec_`
+(`EntrywiseCovarianceBound`) and `co_` (`CovarianceOrdering`), with one auxiliary definition, the
+block rotation `Aux.co_rot`.
+
+Remark recorded by the lane, for the maintainers (nothing below is edited here): the proof-packet
+README rows "Side24 lattice sums" and "Side24 covariance and density" gave, for these three `Prop`s,
+the reasons that local term-wise iterated differentiation of the lattice sum is missing from Mathlib
+`d13f23b7` (its only local result, `hasFDerivAt_tsum_of_isPreconnected`, being first order) and,
+for `CovarianceOrdering`, (ii) that symmetry of `iteratedFDeriv` beyond order two is missing
+("Mathlib has `isSymmSndFDerivAt_iff_iteratedFDeriv` only"). Neither is load-bearing here: the
+first is supplied inside this module by `Aux.ib_iteratedFDeriv_tsum_of_isOpen`, by induction from
+that first-order result; for the second, the analytic case, which is all the proof needs (`Kinf d`
+is analytic), is present at the pin as `ContDiffAt.iteratedFDeriv_comp_perm`, while the general
+version for finitely smooth functions beyond order two is indeed absent at `d13f23b7`. This is a
+remark about informal reasons, not a statement defect and not about any claim.
+-/
+
+namespace UniversalLaw.Proofs.Side24Images
+
+open UniversalLaw.Spec.Side24
+open scoped ContDiff Topology Matrix
+
+namespace Aux
+
+/-! ## `ib_`: helpers for `ImageBound` -/
+
+/-- Local version of Mathlib's `iteratedFDeriv_tsum`: for summands that are each `C^N` on the whole
+space, summable bounds over an open preconnected set `U` on their derivatives of every order `≤ N`
+give, for every `k ≤ N`, the term-wise `k`-th iterated derivative at every point of `U`. Same
+induction as Mathlib's global lemma, with the local `hasFDerivAt_tsum_of_isPreconnected` and
+`Filter.EventuallyEq.fderiv_eq` on `U`. -/
+theorem ib_iteratedFDeriv_tsum_of_isOpen {α E F : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
+ [NormedAddCommGroup F] [CompleteSpace F] [NormedSpace ℝ F]
+ {f : α → E → F} {v : ℕ → α → ℝ} {N : ℕ∞} {U : Set E}
+ (hU : IsOpen U) (hU' : IsPreconnected U)
+ (hf : ∀ i, ContDiff ℝ N (f i))
+ (hv : ∀ k : ℕ, (k : ℕ∞) ≤ N → Summable (v k))
+ (h'f : ∀ (k : ℕ) (i : α) (x : E), (k : ℕ∞) ≤ N → x ∈ U →
+ ‖iteratedFDeriv ℝ k (f i) x‖ ≤ v k i)
+ {k : ℕ} (hk : (k : ℕ∞) ≤ N) {x : E} (hx : x ∈ U) :
+ iteratedFDeriv ℝ k (fun y => ∑' n, f n y) x = ∑' n, iteratedFDeriv ℝ k (f n) x := by
+ induction k generalizing x with
+ | zero =>
+ simp_rw [iteratedFDeriv_zero_eq_comp]
+ exact (continuousMultilinearCurryFin0 ℝ E F).symm.toContinuousLinearEquiv.map_tsum
+ | succ k IH =>
+ have h'k : (k : ℕ∞) < N := lt_of_lt_of_le (WithTop.coe_lt_coe.2 (Nat.lt_succ_self _)) hk
+ have hEq : (iteratedFDeriv ℝ k fun y => ∑' n, f n y) =ᶠ[𝓝 x]
+ fun y => ∑' n, iteratedFDeriv ℝ k (f n) y :=
+ Filter.eventually_of_mem (hU.mem_nhds hx) fun y hy => IH h'k.le hy
+ have hD : HasFDerivAt (fun y => ∑' n, iteratedFDeriv ℝ k (f n) y)
+ (∑' n, fderiv ℝ (iteratedFDeriv ℝ k (f n)) x) x := by
+ refine hasFDerivAt_tsum_of_isPreconnected (hv (k + 1) hk) hU hU' (fun n y _ => ?_)
+ (fun n y hy => ?_) hx ?_ hx
+ · exact ((hf n).differentiable_iteratedFDeriv (mod_cast h'k) y).hasFDerivAt
+ · rw [norm_fderiv_iteratedFDeriv]
+ exact h'f (k + 1) n y hk hy
+ · exact .of_norm_bounded (hv k h'k.le) fun n => h'f k n x h'k.le hx
+ rw [iteratedFDeriv_succ_eq_comp_left, Function.comp_apply, hEq.fderiv_eq, hD.fderiv]
+ simp_rw [iteratedFDeriv_succ_eq_comp_left, Function.comp_apply]
+ exact (continuousMultilinearCurryLeftEquiv ℝ
+ (fun _ : Fin (k + 1) => E) F).symm.toContinuousLinearEquiv.map_tsum
+
+/-- The pairing sums are monotone in `r ≥ 0`: every term is a nonnegative multiple of `r^m`. -/
+theorem ib_pairingSum_mono (q : ℕ) {r s : ℝ} (hr : 0 ≤ r) (hrs : r ≤ s) :
+ pairingSum q r ≤ pairingSum q s := by
+ unfold pairingSum
+ refine Finset.sum_le_sum fun j _ => ?_
+ have hden : 0 ≤ (2 : ℝ) ^ j * (Nat.factorial j : ℝ) * (Nat.factorial (q - 2 * j) : ℝ) := by
+ positivity
+ exact div_le_div_of_nonneg_right
+ (mul_le_mul_of_nonneg_left (pow_le_pow_left₀ hr hrs _) (by positivity)) hden
+
+/-- For `q ≤ 6` and `r ≥ 0`, `pairingSum q r ≤ 76 (1 + r)^6`. -/
+theorem ib_pairingSum_le (q : ℕ) (hq : q ≤ 6) {r : ℝ} (hr : 0 ≤ r) :
+ pairingSum q r ≤ 76 * (1 + r) ^ 6 := by
+ have h1 : (1 : ℝ) ≤ 1 + r := by linarith
+ calc pairingSum q r ≤ pairingSum q (1 + r) := ib_pairingSum_mono q hr (by linarith)
+ _ ≤ 76 * (1 + r) ^ 6 := Side24Analysis.Aux.d1_pairingSum_le_of_one_le q hq _ h1
+
+/-- `(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
+`1 + r - r^2/2 ≤ 2 - r^2/4`, that is `(r - 2)^2 ≥ 0`. -/
+theorem ib_poly_gauss_le {r : ℝ} (hr : 0 ≤ r) :
+ (1 + r) ^ 6 * Real.exp (-(r ^ 2) / 2) ≤ 720 * Real.exp 2 * Real.exp (-(r ^ 2) / 4) := by
+ have h1 : (1 + r) ^ 6 / (Nat.factorial 6 : ℝ) ≤ Real.exp (1 + r) :=
+ Real.pow_div_factorial_le_exp (1 + r) (by linarith) 6
+ have h6 : (Nat.factorial 6 : ℝ) = 720 := by norm_num [Nat.factorial]
+ rw [h6, div_le_iff₀ (by norm_num)] at h1
+ have h2 : Real.exp (1 + r) * Real.exp (-(r ^ 2) / 2) ≤ Real.exp 2 * Real.exp (-(r ^ 2) / 4) := by
+ rw [← Real.exp_add, ← Real.exp_add, Real.exp_le_exp]
+ nlinarith [sq_nonneg (r - 2)]
+ calc (1 + r) ^ 6 * Real.exp (-(r ^ 2) / 2)
+ ≤ (Real.exp (1 + r) * 720) * Real.exp (-(r ^ 2) / 2) :=
+ mul_le_mul_of_nonneg_right h1 (Real.exp_pos _).le
+ _ = 720 * (Real.exp (1 + r) * Real.exp (-(r ^ 2) / 2)) := by ring
+ _ ≤ 720 * (Real.exp 2 * Real.exp (-(r ^ 2) / 4)) := by gcongr
+ _ = 720 * Real.exp 2 * Real.exp (-(r ^ 2) / 4) := by ring
+
+/-- `exp(-‖z + v‖^2/4) ≤ exp(‖z‖^2/4) exp(-‖v‖^2/8)`, from `‖v‖ ≤ ‖z + v‖ + ‖z‖`. -/
+theorem ib_exp_shift_le {d : ℕ} (z v : E d) :
+ Real.exp (-(‖z + v‖ ^ 2) / 4) ≤ Real.exp (‖z‖ ^ 2 / 4) * Real.exp (-(‖v‖ ^ 2) / 8) := by
+ rw [← Real.exp_add, Real.exp_le_exp]
+ have h1 : ‖v‖ ≤ ‖z + v‖ + ‖z‖ := by
+ calc ‖v‖ = ‖(z + v) - z‖ := by rw [add_sub_cancel_left]
+ _ ≤ ‖z + v‖ + ‖z‖ := norm_sub_le _ _
+ have h2 : 0 ≤ ‖z + v‖ := norm_nonneg _
+ have h3 : 0 ≤ ‖z‖ := norm_nonneg _
+ have h4 : 0 ≤ ‖v‖ := norm_nonneg _
+ nlinarith [sq_nonneg (‖z + v‖ - ‖z‖)]
+
+/-- `exp(-‖24 n‖^2/8) = ∏ i, exp(-72 n_i^2)`. -/
+theorem ib_exp_lattice_eighth (d : ℕ) (n : Fin d → ℤ) :
+ Real.exp (-(‖latticeVec d n‖ ^ 2) / 8) = ∏ i, Real.exp (-72 * ((n i : ℤ) : ℝ) ^ 2) := by
+ rw [← Real.exp_sum, Side24Analysis.Aux.th_norm_latticeVec_sq, intNormSq, Finset.mul_sum, neg_div,
+ Finset.sum_div, ← Finset.sum_neg_distrib]
+ congr 1
+ refine Finset.sum_congr rfl fun i _ => ?_
+ ring
+
+/-- On the unit ball, every derivative of order `k ≤ 6` of a lattice translate of `Kinf d` is
+bounded by the summable family `C ∏ i, exp(-72 n_i^2)`. -/
+theorem ib_translate_bound {d : ℕ} (k : ℕ) (hk : k ≤ 6) (n : Fin d → ℤ) {z : E d}
+ (hz : z ∈ Metric.ball (0 : E d) 1) :
+ ‖iteratedFDeriv ℝ k (Kinf d) (z + latticeVec d n)‖ ≤
+ 76 * (720 * Real.exp 2) * Real.exp (1 / 4) * ∏ i, Real.exp (-72 * ((n i : ℤ) : ℝ) ^ 2) := by
+ set y := z + latticeVec d n
+ have hr : 0 ≤ ‖y‖ := norm_nonneg _
+ have hz1 : ‖z‖ < 1 := by simpa using hz
+ have hb := Side24Analysis.Aux.dp_pairing_all d y k hk
+ have hp := ib_pairingSum_le k hk hr
+ have hg := ib_poly_gauss_le hr
+ have hs := ib_exp_shift_le z (latticeVec d n)
+ have hK : Kinf d y = Real.exp (-(‖y‖ ^ 2) / 2) := rfl
+ have hzz : Real.exp (‖z‖ ^ 2 / 4) ≤ Real.exp (1 / 4) := by
+ rw [Real.exp_le_exp]
+ have : ‖z‖ ^ 2 ≤ 1 := by nlinarith [norm_nonneg z]
+ linarith
+ rw [ib_exp_lattice_eighth] at hs
+ calc ‖iteratedFDeriv ℝ k (Kinf d) y‖ ≤ Kinf d y * pairingSum k ‖y‖ := hb
+ _ ≤ Real.exp (-(‖y‖ ^ 2) / 2) * (76 * (1 + ‖y‖) ^ 6) := by
+ rw [hK]; exact mul_le_mul_of_nonneg_left hp (Real.exp_pos _).le
+ _ = 76 * ((1 + ‖y‖) ^ 6 * Real.exp (-(‖y‖ ^ 2) / 2)) := by ring
+ _ ≤ 76 * (720 * Real.exp 2 * Real.exp (-(‖y‖ ^ 2) / 4)) := by gcongr
+ _ ≤ 76 * (720 * Real.exp 2 * (Real.exp (‖z‖ ^ 2 / 4) *
+ ∏ i, Real.exp (-72 * ((n i : ℤ) : ℝ) ^ 2))) := by gcongr
+ _ ≤ 76 * (720 * Real.exp 2 * (Real.exp (1 / 4) *
+ ∏ i, Real.exp (-72 * ((n i : ℤ) : ℝ) ^ 2))) := by
+ gcongr
+ _ = 76 * (720 * Real.exp 2) * Real.exp (1 / 4) *
+ ∏ i, Real.exp (-72 * ((n i : ℤ) : ℝ) ^ 2) := by ring
+
+/-- `latticeVec d 0 = 0`. -/
+theorem ib_latticeVec_zero (d : ℕ) : latticeVec d 0 = 0 := by
+ ext i
+ simp [latticeVec]
+
+/-- `θ(0) = ∑_n exp(-‖24 n‖^2/2) ≥ 1`: the summand at `n = 0` is `1` and the others are positive. -/
+theorem ib_theta0_ge_one (d : ℕ) : 1 ≤ thetaSum24 d 0 := by
+ have hs := Side24Analysis.thetaSummable d 0
+ have h := hs.le_tsum 0 (fun j _ => (Real.exp_pos _).le)
+ simpa [thetaSum24, ib_latticeVec_zero] using h
+
+/-- `K_24` as a sum of scaled lattice translates of `Kinf d`. -/
+theorem ib_K24_eq (d : ℕ) :
+ K24 d = fun z => ∑' n : Fin d → ℤ, (thetaSum24 d 0)⁻¹ • Kinf d (z + latticeVec d n) := by
+ funext z
+ simp only [smul_eq_mul]
+ rw [tsum_mul_left, K24, div_eq_inv_mul]
+ rfl
+
+/-- Each scaled translate is `C^∞`. -/
+theorem ib_contDiff_term (d : ℕ) (c : ℝ) (n : Fin d → ℤ) :
+ ContDiff ℝ ∞ (fun z : E d => c • Kinf d (z + latticeVec d n)) :=
+ ((Side24Analysis.Aux.dp_contDiff_Kinf d).comp (contDiff_id.add contDiff_const)).const_smul c
+
+/-- The iterated derivative of a scaled translate. -/
+theorem ib_iteratedFDeriv_term (d k : ℕ) (c : ℝ) (n : Fin d → ℤ) (z : E d) :
+ iteratedFDeriv ℝ k (fun z : E d => c • Kinf d (z + latticeVec d n)) z =
+ c • iteratedFDeriv ℝ k (Kinf d) (z + latticeVec d n) := by
+ have hg : ContDiff ℝ ∞ (fun z : E d => Kinf d (z + latticeVec d n)) :=
+ (Side24Analysis.Aux.dp_contDiff_Kinf d).comp (contDiff_id.add contDiff_const)
+ have h := iteratedFDeriv_const_smul_apply (a := c) (i := k) (x := z)
+ ((hg.of_le (by exact_mod_cast le_top)).contDiffAt)
+ have he : (fun z : E d => c • Kinf d (z + latticeVec d n)) =
+ c • (fun z : E d => Kinf d (z + latticeVec d n)) := rfl
+ rw [he, h, iteratedFDeriv_comp_add_right]
+
+/-- The summable bound family is summable. -/
+theorem ib_summable_bound (d : ℕ) :
+ Summable (fun n : Fin d → ℤ =>
+ 76 * (720 * Real.exp 2) * Real.exp (1 / 4) * ∏ i, Real.exp (-72 * ((n i : ℤ) : ℝ) ^ 2)) :=
+ (Side24Analysis.Aux.th_summable_pi_prod d _ (fun m => (Real.exp_pos _).le)
+ (Side24Analysis.Aux.th_summable_gauss_int 72 (by norm_num))).mul_left _
+
+/-- The derivative bound of a scaled translate on the unit ball, for a scale `0 ≤ c ≤ 1`. -/
+theorem ib_term_bound {d : ℕ} {c : ℝ} (hc0 : 0 ≤ c) (hc1 : c ≤ 1) (k : ℕ) (hk : k ≤ 6)
+ (n : Fin d → ℤ) {z : E d} (hz : z ∈ Metric.ball (0 : E d) 1) :
+ ‖iteratedFDeriv ℝ k (fun z : E d => c • Kinf d (z + latticeVec d n)) z‖ ≤
+ 76 * (720 * Real.exp 2) * Real.exp (1 / 4) * ∏ i, Real.exp (-72 * ((n i : ℤ) : ℝ) ^ 2) := by
+ rw [ib_iteratedFDeriv_term, norm_smul, Real.norm_eq_abs, abs_of_nonneg hc0]
+ calc c * ‖iteratedFDeriv ℝ k (Kinf d) (z + latticeVec d n)‖
+ ≤ 1 * ‖iteratedFDeriv ℝ k (Kinf d) (z + latticeVec d n)‖ :=
+ mul_le_mul_of_nonneg_right hc1 (norm_nonneg _)
+ _ = ‖iteratedFDeriv ℝ k (Kinf d) (z + latticeVec d n)‖ := one_mul _
+ _ ≤ _ := ib_translate_bound k hk n hz
+
+/-- The term-wise iterated derivative of `K_24` at `0`, as continuous multilinear maps. -/
+theorem ib_K24_deriv (d q : ℕ) (hq : q ≤ 6) :
+ iteratedFDeriv ℝ q (K24 d) 0 =
+ ∑' n : Fin d → ℤ, (thetaSum24 d 0)⁻¹ • iteratedFDeriv ℝ q (Kinf d) (latticeVec d n) := by
+ have hΘ := ib_theta0_ge_one d
+ have hc0 : 0 ≤ (thetaSum24 d 0)⁻¹ := inv_nonneg.2 (by linarith)
+ have hc1 : (thetaSum24 d 0)⁻¹ ≤ 1 := inv_le_one_of_one_le₀ hΘ
+ have h6 : ((6 : ℕ∞) : WithTop ℕ∞) ≤ ∞ := WithTop.coe_le_coe.2 le_top
+ have hq' : ((q : ℕ) : ℕ∞) ≤ 6 := by exact_mod_cast hq
+ have key := ib_iteratedFDeriv_tsum_of_isOpen (α := Fin d → ℤ) (E := E d) (F := ℝ)
+ (f := fun n z => (thetaSum24 d 0)⁻¹ • Kinf d (z + latticeVec d n)) (N := 6)
+ (U := Metric.ball (0 : E d) 1)
+ (v := fun _ n => 76 * (720 * Real.exp 2) * Real.exp (1 / 4) *
+ ∏ i, Real.exp (-72 * ((n i : ℤ) : ℝ) ^ 2))
+ Metric.isOpen_ball (convex_ball (0 : E d) 1).isPreconnected
+ (fun n => (ib_contDiff_term d _ n).of_le h6)
+ (fun k _ => ib_summable_bound d)
+ (fun k n z hk hz => ib_term_bound hc0 hc1 k (by exact_mod_cast hk) n hz)
+ hq' (Metric.mem_ball_self one_pos)
+ rw [ib_K24_eq, key]
+ refine tsum_congr fun n => ?_
+ rw [ib_iteratedFDeriv_term, zero_add]
+
+/-- Nonzero integer vectors have `intNormSq d n ≥ 1`. -/
+theorem ib_intNormSq_ge_one {d : ℕ} {n : Fin d → ℤ} (hn : n ≠ 0) : 1 ≤ intNormSq d n := by
+ obtain ⟨i, hi⟩ := Function.ne_iff.1 hn
+ have h1 : (1 : ℝ) ≤ ((n i : ℤ) : ℝ) ^ 2 := by
+ have : (1 : ℤ) ≤ |n i| := Int.one_le_abs hi
+ have h' : (1 : ℝ) ≤ |((n i : ℤ) : ℝ)| := by exact_mod_cast this
+ nlinarith [abs_nonneg ((n i : ℤ) : ℝ), sq_abs ((n i : ℤ) : ℝ)]
+ unfold intNormSq
+ calc (1 : ℝ) ≤ ((n i : ℤ) : ℝ) ^ 2 := h1
+ _ ≤ ∑ j, ((n j : ℤ) : ℝ) ^ 2 :=
+ Finset.single_le_sum (f := fun j => ((n j : ℤ) : ℝ) ^ 2) (fun j _ => sq_nonneg _)
+ (Finset.mem_univ i)
+
+/-- For `n ≠ 0`: `‖24 n‖^6 exp(-‖24 n‖^2/2) = 24^6 imageTerm d n`. -/
+theorem ib_lattice_term (d : ℕ) {n : Fin d → ℤ} (hn : n ≠ 0) :
+ ‖latticeVec d n‖ ^ 6 * Real.exp (-(‖latticeVec d n‖ ^ 2) / 2) = 24 ^ 6 * imageTerm d n := by
+ have h2 := Side24Analysis.Aux.th_norm_latticeVec_sq d n
+ have h6 : ‖latticeVec d n‖ ^ 6 = (‖latticeVec d n‖ ^ 2) ^ 3 := by ring
+ rw [h6, h2, imageTerm, ite_eq_right hn]
+ have he : -(576 * intNormSq d n) / 2 = -288 * intNormSq d n := by ring
+ rw [he]
+ ring
+
+/-- For `n ≠ 0`: `exp(-‖24 n‖^2/2) ≤ imageTerm d n` (the factor `|n|^6 ≥ 1`). -/
+theorem ib_gauss_le_image (d : ℕ) {n : Fin d → ℤ} (hn : n ≠ 0) :
+ Real.exp (-(‖(0 : E d) + latticeVec d n‖ ^ 2) / 2) ≤ imageTerm d n := by
+ have h1 := ib_intNormSq_ge_one hn
+ have h2 := Side24Analysis.Aux.th_norm_latticeVec_sq d n
+ rw [zero_add, h2, imageTerm, ite_eq_right hn]
+ have he : -(576 * intNormSq d n) / 2 = -288 * intNormSq d n := by ring
+ rw [he]
+ have h3 : (1 : ℝ) ≤ intNormSq d n ^ 3 := one_le_pow₀ h1
+ calc Real.exp (-288 * intNormSq d n) = 1 * Real.exp (-288 * intNormSq d n) := (one_mul _).symm
+ _ ≤ intNormSq d n ^ 3 * Real.exp (-288 * intNormSq d n) :=
+ mul_le_mul_of_nonneg_right h3 (Real.exp_pos _).le
+
+/-- The image bound's constant: `1458 (76 · 24^6 + 15) e^(-288) < imageConstE`. -/
+theorem ib_final_constant :
+ 1458 * (76 * 24 ^ 6 + 15) * Real.exp (-288) < imageConstE := by
+ have h := (UniversalLaw.Proofs.Side24Elementary.exponentialBounds).2
+ have hpos : (0 : ℝ) < 1458 * (76 * 24 ^ 6 + 15) := by norm_num
+ calc 1458 * (76 * 24 ^ 6 + 15) * Real.exp (-288)
+ < 1458 * (76 * 24 ^ 6 + 15) * (1 / 10 ^ 125) := mul_lt_mul_of_pos_left h hpos
+ _ = imageConstE := by norm_num [imageConstE]
+
+/-! ## `ec_`: helpers for `EntrywiseCovarianceBound` (`ec_length_jetDirs_le` also serves `co_C24_symm`) -/
+
+/-- When `u` is itself a frame vector (`hu : ∃ j, u = R j`), every direction attached to a joint
+coordinate is a frame vector `R j`. -/
+theorem ec_mem_jetDirs {d : ℕ} {u : E d} {R : Fin d → E d} (hu : ∃ j, u = R j)
+ (x : JointIndex d) {v : E d} (hv : v ∈ jetDirs d u R x) : ∃ j, v = R j := by
+ rcases x with i | (_ | p)
+ · simp only [jetDirs, List.mem_singleton] at hv
+ exact ⟨i, hv⟩
+ · simp only [jetDirs, List.mem_cons, List.not_mem_nil, or_false] at hv
+ rcases hv with h | h | h <;> (subst h; exact hu)
+ · simp only [jetDirs, List.mem_cons, List.not_mem_nil, or_false] at hv
+ rcases hv with h | h
+ · exact ⟨p.1.1, h⟩
+ · exact ⟨p.1.2, h⟩
+
+/-- Each joint coordinate carries at most three directions. -/
+theorem ec_length_jetDirs_le {d : ℕ} (u : E d) (R : Fin d → E d) (x : JointIndex d) :
+ (jetDirs d u R x).length ≤ 3 := by
+ rcases x with i | (_ | p) <;> simp [jetDirs]
+
+/-- The `svec` scale is `1` or `√2`: nonnegative and at most `√2`. -/
+theorem ec_svecScale_bounds {d : ℕ} (x : JointIndex d) :
+ 0 ≤ svecScale d x ∧ svecScale d x ≤ Real.sqrt 2 := by
+ have h1 : (1 : ℝ) ≤ Real.sqrt 2 := by
+ rw [show (1 : ℝ) = Real.sqrt 1 from Real.sqrt_one.symm]
+ exact Real.sqrt_le_sqrt (by norm_num)
+ rcases x with i | (_ | p)
+ · simp only [svecScale]; exact ⟨zero_le_one, h1⟩
+ · simp only [svecScale]; exact ⟨zero_le_one, h1⟩
+ · simp only [svecScale]
+ split_ifs
+ · exact ⟨zero_le_one, h1⟩
+ · exact ⟨Real.sqrt_nonneg _, le_rfl⟩
+
+/-- `|svecScale a · svecScale b · (-1)^n| ≤ 2`. -/
+theorem ec_scale_le {d : ℕ} (a b : JointIndex d) (n : ℕ) :
+ |svecScale d a * svecScale d b * (-1 : ℝ) ^ n| ≤ 2 := by
+ obtain ⟨ha0, ha⟩ := ec_svecScale_bounds a
+ obtain ⟨hb0, hb⟩ := ec_svecScale_bounds b
+ rw [abs_mul, abs_mul, abs_pow, abs_neg, abs_one, one_pow, mul_one, abs_of_nonneg ha0,
+ abs_of_nonneg hb0]
+ calc svecScale d a * svecScale d b ≤ Real.sqrt 2 * Real.sqrt 2 := mul_le_mul ha hb hb0 (Real.sqrt_nonneg _)
+ _ = 2 := Real.mul_self_sqrt (by norm_num)
+
+/-! ## `co_`: helpers for `CovarianceOrdering` -/
+
+/-- `Kinf d` is analytic (`C^ω`): the exponential of a polynomial. -/
+theorem co_kinf_analytic (d : ℕ) : ContDiff ℝ ω (Kinf d) := by
+ unfold Kinf
+ exact Real.contDiff_exp.comp ((contDiff_norm_sq ℝ).neg.div_const 2)
+
+/-- The iterated derivatives of `Kinf d` are symmetric at every point (analyticity and
+`ContDiffAt.iteratedFDeriv_comp_perm`). -/
+theorem co_kinf_perm {d n : ℕ} (y : E d) (v : Fin n → E d) (σ : Equiv.Perm (Fin n)) :
+ iteratedFDeriv ℝ n (Kinf d) y (v ∘ σ) = iteratedFDeriv ℝ n (Kinf d) y v :=
+ (co_kinf_analytic d).contDiffAt.iteratedFDeriv_comp_perm v σ
+
+/-- Evenness of `Kinf d` at a general point: `D^q Kinf (-y) v = (-1)^q D^q Kinf y v`. -/
+theorem co_kinf_neg_apply {d : ℕ} (q : ℕ) (y : E d) (v : Fin q → E d) :
+ iteratedFDeriv ℝ q (Kinf d) (-y) v = (-1 : ℝ) ^ q * iteratedFDeriv ℝ q (Kinf d) y v := by
+ have h := (-ContinuousLinearMap.id ℝ (E d)).iteratedFDeriv_comp_right
+ (Side24Analysis.Aux.rb_kinf_contDiff (d := d)) y (i := q) (mod_cast le_top)
+ rw [Side24Covariance.Aux.cv_kinf_comp_neg] at h
+ have h2 := congrArg (fun T => T v) h
+ simp only [ContinuousMultilinearMap.compContinuousLinearMap_apply] at h2
+ have h3 : (fun i => (-ContinuousLinearMap.id ℝ (E d)) (v i)) = fun i => (-1 : ℝ) • v i := by
+ funext i
+ simp
+ rw [h3, ContinuousMultilinearMap.map_smul_univ] at h2
+ simp only [Finset.prod_const, Finset.card_univ, Fintype.card_fin, smul_eq_mul] at h2
+ have hy : (-ContinuousLinearMap.id ℝ (E d)) y = -y := by simp
+ rw [hy] at h2
+ rw [h2, ← mul_assoc, ← pow_add, ← two_mul, pow_mul]
+ simp
+
+/-- `latticeVec d (-n) = -latticeVec d n`. -/
+theorem co_latticeVec_neg (d : ℕ) (n : Fin d → ℤ) : latticeVec d (-n) = -latticeVec d n := by
+ ext i
+ simp [latticeVec]
+
+/-- The term-wise derivative of `K_24` at `0`, evaluated at a tuple. -/
+theorem co_K24_apply (d q : ℕ) (hq : q ≤ 6) (v : Fin q → E d) :
+ iteratedFDeriv ℝ q (K24 d) 0 v =
+ (thetaSum24 d 0)⁻¹ * ∑' n : Fin d → ℤ, iteratedFDeriv ℝ q (Kinf d) (latticeVec d n) v := by
+ have hΘ := ib_theta0_ge_one d
+ have hΘpos : 0 < thetaSum24 d 0 := by linarith
+ have hAs : Summable (fun n : Fin d → ℤ =>
+ (thetaSum24 d 0)⁻¹ • iteratedFDeriv ℝ q (Kinf d) (latticeVec d n)) := by
+ refine .of_norm_bounded (ib_summable_bound d) fun n => ?_
+ have h := ib_term_bound (inv_nonneg.2 hΘpos.le) (inv_le_one_of_one_le₀ hΘ) q hq n
+ (Metric.mem_ball_self one_pos)
+ rwa [ib_iteratedFDeriv_term, zero_add] at h
+ rw [ib_K24_deriv d q hq]
+ have h := (ContinuousMultilinearMap.apply ℝ (fun _ : Fin q => E d) ℝ v).map_tsum hAs
+ simp only [ContinuousMultilinearMap.apply_apply] at h
+ rw [h, show (∑' n : Fin d → ℤ, ((thetaSum24 d 0)⁻¹ •
+ iteratedFDeriv ℝ q (Kinf d) (latticeVec d n)) v) =
+ ∑' n : Fin d → ℤ, (thetaSum24 d 0)⁻¹ * iteratedFDeriv ℝ q (Kinf d) (latticeVec d n) v
+ from tsum_congr fun n => rfl, tsum_mul_left]
+
+/-- Odd-order derivatives of `K_24` at `0` of order at most `6` vanish (reindex the lattice sum by
+`n ↦ -n`, with `co_kinf_neg_apply`). -/
+theorem co_K24_odd (d q : ℕ) (hq : q ≤ 6) (hodd : Odd q) (v : Fin q → E d) :
+ iteratedFDeriv ℝ q (K24 d) 0 v = 0 := by
+ rw [co_K24_apply d q hq]
+ set f : (Fin d → ℤ) → ℝ := fun n => iteratedFDeriv ℝ q (Kinf d) (latticeVec d n) v with hf
+ have hneg : ∀ n, f (-n) = -f n := fun n => by
+ simp only [hf, co_latticeVec_neg, co_kinf_neg_apply, hodd.neg_one_pow]
+ ring
+ have hS : ∑' n, f n = -∑' n, f n := by
+ calc ∑' n, f n = ∑' n, f ((Equiv.neg (Fin d → ℤ)) n) := ((Equiv.neg _).tsum_eq f).symm
+ _ = ∑' n, -f n := tsum_congr fun n => hneg n
+ _ = -∑' n, f n := tsum_neg
+ have h0 : ∑' n, f n = 0 := by linarith
+ rw [h0, mul_zero]
+
+/-- `derivContraction` through a length cast. -/
+theorem co_derivContraction_cast {d : ℕ} (K : E d → ℝ) (x : E d) (l : List (E d)) (n : ℕ)
+ (h : l.length = n) :
+ derivContraction d K x l = iteratedFDeriv ℝ n K x (fun i => l.get (Fin.cast h.symm i)) := by
+ subst h
+ rfl
+
+/-- The block rotation `i ↦ i + m` (mod `m + k`) of `Fin (m + k)`. -/
+def co_rot (m k : ℕ) : Equiv.Perm (Fin (m + k)) where
+ toFun i := if h : i.val + m < m + k then ⟨i.val + m, h⟩ else ⟨i.val + m - (m + k), by omega⟩
+ invFun j := if h : j.val + k < m + k then ⟨j.val + k, h⟩ else ⟨j.val + k - (m + k), by omega⟩
+ left_inv i := by
+ apply Fin.ext
+ by_cases h1 : i.val + m < m + k
+ · simp only [h1, dite_true]
+ split_ifs with h2 <;> simp <;> omega
+ · simp only [h1, dite_false]
+ split_ifs with h2 <;> simp <;> omega
+ right_inv j := by
+ apply Fin.ext
+ by_cases h1 : j.val + k < m + k
+ · simp only [h1, dite_true]
+ split_ifs with h2 <;> simp <;> omega
+ · simp only [h1, dite_false]
+ split_ifs with h2 <;> simp <;> omega
+
+/-- Swapping the two blocks of a contraction list does not change a contraction of `Kinf d`. -/
+theorem co_kinf_swap {d : ℕ} (x : E d) (l₁ l₂ : List (E d)) :
+ derivContraction d (Kinf d) x (l₁ ++ l₂) = derivContraction d (Kinf d) x (l₂ ++ l₁) := by
+ set m := l₁.length
+ set k := l₂.length
+ have h₁ : (l₁ ++ l₂).length = m + k := List.length_append
+ have h₂ : (l₂ ++ l₁).length = m + k := by rw [List.length_append]; omega
+ rw [co_derivContraction_cast _ x _ (m + k) h₁, co_derivContraction_cast _ x _ (m + k) h₂]
+ rw [← co_kinf_perm x (fun i => (l₁ ++ l₂).get (Fin.cast h₁.symm i)) (co_rot m k)]
+ congr 1
+ funext j
+ simp only [Function.comp_apply, co_rot, Equiv.coe_fn_mk, List.get_eq_getElem, Fin.val_cast]
+ by_cases hj : j.val + m < m + k
+ · simp only [hj, dite_true]
+ rw [List.getElem_append_right (by omega), List.getElem_append_left (by omega)]
+ congr 1
+ omega
+ · simp only [hj, dite_false]
+ rw [List.getElem_append_left (by omega), List.getElem_append_right (by omega)]
+ congr 1
+ omega
+
+/-- The same block swap for `K_24` at `0`, for lists of total length at most `6`. -/
+theorem co_K24_swap {d : ℕ} (l₁ l₂ : List (E d)) (hl : (l₁ ++ l₂).length ≤ 6) :
+ derivContraction d (K24 d) 0 (l₁ ++ l₂) = derivContraction d (K24 d) 0 (l₂ ++ l₁) := by
+ have hl' : (l₂ ++ l₁).length ≤ 6 := by
+ rw [List.length_append] at hl ⊢; omega
+ unfold derivContraction
+ rw [co_K24_apply d _ hl, co_K24_apply d _ hl']
+ congr 1
+ refine tsum_congr fun n => ?_
+ exact co_kinf_swap (latticeVec d n) l₁ l₂
+
+/-- A contraction of `K_24` at `0` against a list of odd length at most `6` vanishes. -/
+theorem co_K24_odd_list {d : ℕ} (l : List (E d)) (hl : l.length ≤ 6) (hodd : Odd l.length) :
+ derivContraction d (K24 d) 0 l = 0 :=
+ co_K24_odd d _ hl hodd _
+
+/-- `C_24` is symmetric, for every `u` and every `R`. -/
+theorem co_C24_symm {d : ℕ} (u : E d) (R : Fin d → E d) (a b : JointIndex d) :
+ C24 d u R a b = C24 d u R b a := by
+ have ha := ec_length_jetDirs_le u R a
+ have hb := ec_length_jetDirs_le u R b
+ have hab : (jetDirs d u R a ++ jetDirs d u R b).length ≤ 6 := by
+ rw [List.length_append]; omega
+ have hba : (jetDirs d u R b ++ jetDirs d u R a).length ≤ 6 := by
+ rw [List.length_append]; omega
+ simp only [C24, jointCov, Matrix.of_apply]
+ rw [co_K24_swap _ _ hab]
+ rcases Nat.even_or_odd ((jetDirs d u R a).length + (jetDirs d u R b).length) with he | ho
+ · have hpar : (-1 : ℝ) ^ (jetDirs d u R a).length = (-1 : ℝ) ^ (jetDirs d u R b).length := by
+ rcases Nat.even_or_odd (jetDirs d u R a).length with h1 | h1
+ · have h2 : Even (jetDirs d u R b).length := by
+ have := (Nat.even_add.1 he).1 h1; exact this
+ rw [h1.neg_one_pow, h2.neg_one_pow]
+ · have h2 : Odd (jetDirs d u R b).length := by
+ rcases Nat.even_or_odd (jetDirs d u R b).length with h3 | h3
+ · exact absurd ((Nat.even_add.1 he).2 h3) (Nat.not_even_iff_odd.2 h1)
+ · exact h3
+ rw [h1.neg_one_pow, h2.neg_one_pow]
+ rw [hpar]
+ ring
+ · have hodd : Odd (jetDirs d u R b ++ jetDirs d u R a).length := by
+ rw [List.length_append, add_comm]; exact ho
+ rw [co_K24_odd_list _ hba hodd]
+ ring
+
+/-- `C_24` is Hermitian (real symmetric). -/
+theorem co_C24_hermitian {d : ℕ} (u : E d) (R : Fin d → E d) : (C24 d u R).IsHermitian :=
+ Matrix.IsHermitian.ext fun i j => by simp [co_C24_symm u R i j]
+
+/-- An entrywise bound `|A i j| ≤ c` bounds the quadratic form by `c · card · (x ⬝ᵥ x)`. -/
+theorem co_quad_le {ι : Type*} [Fintype ι] (A : Matrix ι ι ℝ) {c : ℝ} (hc : 0 ≤ c)
+ (hA : ∀ i j, |A i j| ≤ c) (x : ι → ℝ) :
+ |x ⬝ᵥ (A *ᵥ x)| ≤ c * Fintype.card ι * (x ⬝ᵥ x) := by
+ have h1 : |x ⬝ᵥ (A *ᵥ x)| ≤ ∑ i, |x i| * ∑ j, |A i j| * |x j| := by
+ unfold dotProduct Matrix.mulVec
+ refine (Finset.abs_sum_le_sum_abs _ _).trans (Finset.sum_le_sum fun i _ => ?_)
+ rw [abs_mul]
+ refine mul_le_mul_of_nonneg_left ?_ (abs_nonneg _)
+ unfold dotProduct
+ refine (Finset.abs_sum_le_sum_abs _ _).trans (le_of_eq ?_)
+ exact Finset.sum_congr rfl fun j _ => abs_mul _ _
+ have h2 : ∑ i, |x i| * ∑ j, |A i j| * |x j| ≤ c * (∑ i, |x i|) ^ 2 := by
+ calc ∑ i, |x i| * ∑ j, |A i j| * |x j| ≤ ∑ i, |x i| * ∑ j, c * |x j| :=
+ Finset.sum_le_sum fun i _ => mul_le_mul_of_nonneg_left
+ (Finset.sum_le_sum fun j _ => mul_le_mul_of_nonneg_right (hA i j) (abs_nonneg _))
+ (abs_nonneg _)
+ _ = c * (∑ i, |x i|) ^ 2 := by
+ have hS : ∀ i, |x i| * ∑ j, c * |x j| = |x i| * (c * ∑ j, |x j|) := fun i => by
+ simp only [Finset.mul_sum]
+ rw [Finset.sum_congr rfl fun i _ => hS i, ← Finset.sum_mul]
+ ring
+ have h3 : (∑ i, |x i|) ^ 2 ≤ Fintype.card ι * ∑ i, |x i| ^ 2 := by
+ have := sq_sum_le_card_mul_sum_sq (s := Finset.univ) (f := fun i => |x i|)
+ simpa using this
+ have h4 : ∑ i, |x i| ^ 2 = x ⬝ᵥ x := by
+ unfold dotProduct
+ exact Finset.sum_congr rfl fun i _ => by rw [sq_abs, sq]
+ calc |x ⬝ᵥ (A *ᵥ x)| ≤ c * (∑ i, |x i|) ^ 2 := h1.trans h2
+ _ ≤ c * (Fintype.card ι * ∑ i, |x i| ^ 2) := mul_le_mul_of_nonneg_left h3 hc
+ _ = c * Fintype.card ι * (x ⬝ᵥ x) := by rw [h4]; ring
+
+/-- `card (JointIndex d) ≤ 13` for `d ≤ 3`. -/
+theorem co_card_le {d : ℕ} (hd : d ≤ 3) : Fintype.card (JointIndex d) ≤ 13 := by
+ have h1 : Fintype.card (SymIndex d) ≤ d * d := by
+ have := Fintype.card_subtype_le (fun p : Fin d × Fin d => p.1 ≤ p.2)
+ simpa [Fintype.card_prod] using this
+ have h2 : Fintype.card (JointIndex d) = d + (1 + Fintype.card (SymIndex d)) := by
+ simp [JointIndex, Fintype.card_sum]
+ rw [h2]
+ have : d * d ≤ 9 := by nlinarith
+ omega
+
+/-- The margin: `2 imageConstE · 13 ≤ epsilon / 3`. -/
+theorem co_margin : 2 * imageConstE * 13 ≤ epsilon / 3 := by
+ norm_num [imageConstE, epsilon]
+
+end Aux
+
+open Aux
+
+/-- Proves: `UniversalLaw.Spec.Side24.ImageBound` (claim `side24-coefficient`), for the formal
+`K24`, `Kinf` and `thetaSum24` of `Specifications.Side24`: for `d ∈ {2, 3}`, every order `q ≤ 6`
+and every unit tuple `u`, `|D^q K_24(0) u - D^q K_∞(0) u| < imageConstE`.
+Method: `D^q K_24(0) = θ(0)⁻¹ ∑_n D^q K_∞(24 n)` by the local term-wise derivative on the unit
+ball (`Aux.ib_K24_deriv`, from `Aux.ib_iteratedFDeriv_tsum_of_isOpen`); splitting off `n = 0` in
+both sums gives `θ(0)⁻¹ (∑_{n ≠ 0} D^q K_∞(24 n) u - (θ(0) - 1) D^q K_∞(0) u)`, bounded, with
+`θ(0) ≥ 1` (`Aux.ib_theta0_ge_one`) and `0 ≤ θ(0) - 1 ≤ ∑_{n ≠ 0} imageTerm d n` (`|n|^6 ≥ 1`,
+`Aux.ib_gauss_le_image`), by `76 · 24^6 · 1458 e^(-288) + 15 · 1458 e^(-288)` through the packet's
+theorems
+`Side24Analysis.derivativeBoundAtLeastOne`, `derivativeBoundAtZero` and `latticeImageSumBound`,
+and `1458 (76 · 24^6 + 15) e^(-288) < imageConstE` through `Side24Elementary.exponentialBounds`.
+Does not establish: display (2) of the source as the source's object (the alignment of `E d`,
+`Kinf`, `K24`, `thetaSum24`, `IsUnitTuple` and Mathlib's `iteratedFDeriv` with the source's
+`R^d`, `K_infty`, `K_24`, unit directions and derivatives is PENDING_INDEPENDENT_REVIEW); any
+bound for `q > 6` or `d ∉ {2, 3}`; differentiability of `K24` as a statement (it is used inside the
+proof, on the unit ball, through the helper `Aux.ib_iteratedFDeriv_tsum_of_isOpen`, which is a
+helper of this module, not an inventory theorem and not a Mathlib result); the Prop's hypothesis
+`ThetaSummable d` is not used (the packet's `thetaSummable` proves it for every `d`); the
+statement module's own `Does not claim:` text, which describes the statement packet and is not
+edited here; the round-4 triage verdict on `ImageBound` (BLOCKED_MISSING_MATHLIB), which is
+transcribed in the register and not altered here; any enclosure of the coefficient `c_{d,24}`;
+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. It
+promotes, closes, discharges or reclassifies nothing. -/
+theorem imageBound : UniversalLaw.Spec.Side24.ImageBound := by
+ intro d hd _ q hq u hu
+ have hd3 : d ≤ 3 := by rcases hd with rfl | rfl <;> norm_num
+ set Θ := thetaSum24 d 0 with hΘeq
+ have hΘ : 1 ≤ Θ := ib_theta0_ge_one d
+ have hΘpos : 0 < Θ := by linarith
+ -- the evaluation at `u` and the term-wise derivative
+ set A : (Fin d → ℤ) → ContinuousMultilinearMap ℝ (fun _ : Fin q => E d) ℝ :=
+ fun n => iteratedFDeriv ℝ q (Kinf d) (latticeVec d n) with hAdef
+ set a : (Fin d → ℤ) → ℝ := fun n => A n u with hadef
+ have hAs : Summable (fun n => Θ⁻¹ • A n) := by
+ refine .of_norm_bounded (ib_summable_bound d) fun n => ?_
+ have h := ib_term_bound (inv_nonneg.2 hΘpos.le) (inv_le_one_of_one_le₀ hΘ) q hq n
+ (Metric.mem_ball_self one_pos)
+ rwa [ib_iteratedFDeriv_term, zero_add] at h
+ have hK : iteratedFDeriv ℝ q (K24 d) 0 u = Θ⁻¹ * ∑' n, a n := by
+ rw [ib_K24_deriv d q hq]
+ have h := (ContinuousMultilinearMap.apply ℝ (fun _ : Fin q => E d) ℝ u).map_tsum hAs
+ simp only [ContinuousMultilinearMap.apply_apply] at h
+ rw [h, show (∑' n, (Θ⁻¹ • A n) u) = ∑' n, Θ⁻¹ * a n from tsum_congr fun n => rfl,
+ tsum_mul_left]
+ have has : Summable a := by
+ have h := (hAs.mapL (ContinuousMultilinearMap.apply ℝ (fun _ : Fin q => E d) ℝ u)).mul_left Θ
+ refine h.congr fun n => ?_
+ simp [hadef, hAdef, smul_eq_mul, ← mul_assoc, mul_inv_cancel₀ hΘpos.ne']
+ -- the theta family
+ set g : (Fin d → ℤ) → ℝ := fun n => Real.exp (-(‖(0 : E d) + latticeVec d n‖ ^ 2) / 2) with hgdef
+ have hgs : Summable g := Side24Analysis.thetaSummable d 0
+ have hΘg : Θ = ∑' n, g n := rfl
+ -- split off `n = 0`
+ have ha0 : a 0 = iteratedFDeriv ℝ q (Kinf d) 0 u := by
+ simp [hadef, hAdef, ib_latticeVec_zero]
+ have hg0 : g 0 = 1 := by simp [hgdef, ib_latticeVec_zero]
+ have hsplit_a := has.tsum_eq_add_tsum_ite 0
+ have hsplit_g := hgs.tsum_eq_add_tsum_ite 0
+ set A' := ∑' n, (if n = 0 then 0 else a n) with hA'def
+ set G' := ∑' n, (if n = 0 then 0 else g n) with hG'def
+ -- the lattice-image family
+ obtain ⟨hTs, hT⟩ := Side24Analysis.latticeImageSumBound d hd3
+ set T := ∑' n, imageTerm d n with hTdef
+ have hT0 : 0 ≤ T := tsum_nonneg fun n => by
+ unfold imageTerm; split_ifs
+ · exact le_rfl
+ · exact mul_nonneg (pow_nonneg (Finset.sum_nonneg fun i _ => sq_nonneg _) 3) (Real.exp_pos _).le
+ have himg0 : ∀ n, 0 ≤ imageTerm d n := fun n => by
+ unfold imageTerm; split_ifs
+ · exact le_rfl
+ · exact mul_nonneg (pow_nonneg (Finset.sum_nonneg fun i _ => sq_nonneg _) 3) (Real.exp_pos _).le
+ -- |A'| ≤ 76 · 24^6 · T
+ have hbound_a : ∀ n, ‖(if n = 0 then 0 else a n)‖ ≤ 76 * 24 ^ 6 * imageTerm d n := fun n => by
+ split_ifs with hn
+ · simp only [norm_zero]; exact mul_nonneg (by norm_num) (himg0 n)
+ · have h1 : 1 ≤ ‖latticeVec d n‖ := by
+ have h2 := Side24Analysis.Aux.th_norm_latticeVec_sq d n
+ have h3 := ib_intNormSq_ge_one hn
+ nlinarith [norm_nonneg (latticeVec d n)]
+ have h := Side24Analysis.derivativeBoundAtLeastOne d q hq (latticeVec d n) h1 u hu
+ rw [Real.norm_eq_abs]
+ calc |a n| ≤ 76 * ‖latticeVec d n‖ ^ 6 * Real.exp (-(‖latticeVec d n‖ ^ 2) / 2) := h
+ _ = 76 * (‖latticeVec d n‖ ^ 6 * Real.exp (-(‖latticeVec d n‖ ^ 2) / 2)) := by ring
+ _ = 76 * (24 ^ 6 * imageTerm d n) := by rw [ib_lattice_term d hn]
+ _ = 76 * 24 ^ 6 * imageTerm d n := by ring
+ have hA' : |A'| ≤ 76 * 24 ^ 6 * T := by
+ have hs : Summable (fun n => ‖(if n = 0 then 0 else a n)‖) :=
+ .of_nonneg_of_le (fun n => norm_nonneg _) hbound_a (hTs.mul_left _)
+ calc |A'| = ‖A'‖ := (Real.norm_eq_abs _).symm
+ _ ≤ ∑' n, ‖(if n = 0 then 0 else a n)‖ := norm_tsum_le_tsum_norm hs
+ _ ≤ ∑' n, 76 * 24 ^ 6 * imageTerm d n := hs.tsum_le_tsum hbound_a (hTs.mul_left _)
+ _ = 76 * 24 ^ 6 * T := tsum_mul_left
+ -- 0 ≤ G' ≤ T
+ have hbound_g : ∀ n, (if n = 0 then 0 else g n) ≤ imageTerm d n := fun n => by
+ split_ifs with hn
+ · exact himg0 n
+ · exact ib_gauss_le_image d hn
+ have hG'0 : 0 ≤ G' := tsum_nonneg fun n => by
+ split_ifs
+ · exact le_rfl
+ · exact (Real.exp_pos _).le
+ have hG' : G' ≤ T := by
+ have hs : Summable (fun n => (if n = 0 then 0 else g n)) :=
+ .of_nonneg_of_le (fun n => by split_ifs; exacts [le_rfl, (Real.exp_pos _).le]) hbound_g hTs
+ exact hs.tsum_le_tsum hbound_g hTs
+ have ha0b : |a 0| ≤ 15 := by
+ rw [ha0]; exact Side24Analysis.derivativeBoundAtZero d q hq u hu
+ -- assemble
+ have hdiff : iteratedFDeriv ℝ q (K24 d) 0 u - iteratedFDeriv ℝ q (Kinf d) 0 u =
+ Θ⁻¹ * (A' - G' * a 0) := by
+ rw [hK, ← ha0, hsplit_a]
+ have hΘ' : Θ = 1 + G' := by rw [hΘg, hsplit_g, hg0]
+ field_simp
+ rw [hΘ']
+ ring
+ rw [hdiff, abs_mul, abs_of_pos (inv_pos.2 hΘpos)]
+ have hinv : Θ⁻¹ ≤ 1 := inv_le_one_of_one_le₀ hΘ
+ have hnum : |A' - G' * a 0| ≤ 76 * 24 ^ 6 * T + T * 15 := by
+ calc |A' - G' * a 0| ≤ |A'| + |G' * a 0| := abs_sub _ _
+ _ = |A'| + G' * |a 0| := by rw [abs_mul, abs_of_nonneg hG'0]
+ _ ≤ 76 * 24 ^ 6 * T + T * 15 := by
+ gcongr
+ have hTb : 76 * 24 ^ 6 * T + T * 15 ≤ 1458 * (76 * 24 ^ 6 + 15) * Real.exp (-288) := by
+ nlinarith [hT, hT0]
+ calc Θ⁻¹ * |A' - G' * a 0| ≤ 1 * |A' - G' * a 0| :=
+ mul_le_mul_of_nonneg_right hinv (abs_nonneg _)
+ _ = |A' - G' * a 0| := one_mul _
+ _ ≤ 1458 * (76 * 24 ^ 6 + 15) * Real.exp (-288) := hnum.trans hTb
+ _ < imageConstE := ib_final_constant
+
+/-- Proves: `UniversalLaw.Spec.Side24.EntrywiseCovarianceBound` (claim `side24-coefficient`),
+for the formal `C24` and `Cref` of `Specifications.Side24`: for `d ∈ {2, 3}` and every
+orthonormal frame `R` with `u = R 0`, `|C_24 a b - C_ref a b| ≤ 2 imageConstE` for every pair of
+joint coordinates.
+Method: the two entries share the factor `svecScale a · svecScale b · (-1)^|b|`, of absolute value
+at most `2`, and their derivative contractions are along the list `jetDirs a ++ jetDirs b` of at
+most six frame vectors, each of norm one; `imageBound` bounds the difference of the contractions
+by `imageConstE` (strictly).
+Does not establish: the source's Section 3 sentence as the source's object (the alignment of
+`jetDirs`, `svecScale`, `jointCov`, `C24` and `Cref` with the source's jet, `svec` scaling and
+joint covariances is PENDING_INDEPENDENT_REVIEW); that `C24` or `Cref` is the covariance of any
+random vector (no field is constructed); the spectral-norm bound `20E` (not specified); the
+ordering `CovarianceOrdering` (a separate theorem of this module); the Prop's hypothesis
+`ThetaSummable d` is passed to `imageBound`, which does not use it; the round-4 triage verdict on
+`EntrywiseCovarianceBound` (BLOCKED_MISSING_MATHLIB), which is transcribed in the register and not
+altered here; any enclosure of the coefficient `c_{d,24}`; the disposition of
+`side24-coefficient` (REVIEWED_SCOPED); nonauthor review or acceptance of
+SIDE24-COEFFICIENT-D23-20260924-v1. It promotes, closes, discharges or reclassifies nothing. -/
+theorem entrywiseCovarianceBound : UniversalLaw.Spec.Side24.EntrywiseCovarianceBound := by
+ intro d hd hθ hd0 R hR a b
+ set u := R ⟨0, hd0⟩
+ set l := jetDirs d u R a ++ jetDirs d u R b with hldef
+ have hu : ∃ j, u = R j := ⟨⟨0, hd0⟩, rfl⟩
+ have hl : l.length ≤ 6 := by
+ rw [hldef, List.length_append]
+ have := ec_length_jetDirs_le u R a
+ have := ec_length_jetDirs_le u R b
+ omega
+ have hunit : IsUnitTuple d l.length (fun i => l.get i) := by
+ intro i
+ have hmem : l.get i ∈ jetDirs d u R a ++ jetDirs d u R b := List.get_mem l i
+ obtain ⟨j, hj⟩ : ∃ j, l.get i = R j := by
+ rcases List.mem_append.1 hmem with h | h
+ · exact ec_mem_jetDirs hu a h
+ · exact ec_mem_jetDirs hu b h
+ show ‖l.get i‖ = 1
+ rw [hj]
+ exact hR.1 j
+ have himg := imageBound d hd hθ l.length hl (fun i => l.get i) hunit
+ simp only [C24, Cref, jointCov, Matrix.of_apply, derivContraction]
+ rw [← mul_sub, abs_mul]
+ calc |svecScale d a * svecScale d b * (-1 : ℝ) ^ (jetDirs d u R b).length| *
+ |iteratedFDeriv ℝ l.length (K24 d) 0 (fun i => l.get i) -
+ iteratedFDeriv ℝ l.length (Kinf d) 0 (fun i => l.get i)|
+ ≤ 2 * imageConstE :=
+ mul_le_mul (ec_scale_le a b _) himg.le (abs_nonneg _) (by norm_num)
+
+/-- Proves: `UniversalLaw.Spec.Side24.CovarianceOrdering` (claim `side24-coefficient`), for the
+formal `C24` and `Cref` of `Specifications.Side24`: for `d ∈ {2, 3}` and every orthonormal frame
+`R` with `u = R 0`, `C_24 - (1 - epsilon) C_ref` and `(1 + epsilon) C_ref - C_24` are positive
+semidefinite in Mathlib's sense (`Matrix.PosSemidef`, which includes `IsHermitian`).
+Method: `C_24` is symmetric (`Aux.co_C24_hermitian`): by the term-wise derivative a contraction of
+`K_24` at `0` of total order at most `6` is `θ(0)⁻¹ ∑_n` of contractions of the analytic `Kinf d`
+at `24 n`, which are
+invariant under the block swap (`ContDiffAt.iteratedFDeriv_comp_perm`), and odd total orders
+vanish by reindexing `n ↦ -n` together with `D^q Kinf(-y) = (-1)^q D^q Kinf(y)`
+(`Aux.co_kinf_neg_apply`, from the round-5 helper `Side24Covariance.Aux.cv_kinf_comp_neg`), so the
+sign `(-1)^|b|` may be replaced by `(-1)^|a|`. `C_ref` is
+symmetric and `C_ref - I/3` positive semidefinite by `Side24Covariance.referenceCovarianceLowerBound`.
+With `Δ = C_24 - C_ref`, `|Δ a b| ≤ 2 imageConstE` (`entrywiseCovarianceBound`), so
+`|x ⬝ Δ x| ≤ 2 imageConstE · card · (x ⬝ x)` (Cauchy-Schwarz), the cardinality of the joint index
+is at most `d + 1 + d^2 ≤ 13` for `d ≤ 3` (its exact value `6` or `10` is not used), and
+`26 imageConstE (x ⬝ x) ≤ (epsilon / 3) (x ⬝ x) ≤ epsilon (x ⬝ C_ref x)` (`Aux.co_margin` and
+`C_ref - I/3 ≥ 0`), which gives both orderings.
+Does not establish: display (3) of the source as the source's object (the alignment of `C24`,
+`Cref` and Mathlib's `Matrix.PosSemidef`, `IsHermitian` included, with the source's covariances and
+positive-semidefinite order is PENDING_INDEPENDENT_REVIEW); that `C24` or `Cref` is the
+covariance of any random vector (no field is constructed); the passage to marginal and
+conditional covariances (not specified); the source's route through the spectral-norm bound `20E`
+and `60E < epsilon` (not reproduced: the proof uses the cruder `2E` times at most `13` coordinates
+and `26E ≤ epsilon / 3`, that is `78E ≤ epsilon`, decided by `norm_num` in the helper
+`Aux.co_margin`; main's `UniversalLaw.Side24.covariance_relative_bound` is neither imported, cited
+nor relied on);
+symmetry of `Cref d u R` for a general `u` or frame (it is taken from the round-5 theorem at
+`u = R 0` in an orthonormal frame; the helper `Aux.co_C24_hermitian`, stated for every `d`, `u`
+and `R`, is a helper, not an inventory theorem); the Prop's hypothesis `ThetaSummable d` is only
+forwarded, through `entrywiseCovarianceBound`, to `imageBound`, which does not use it; the round-4
+triage verdict on `CovarianceOrdering` (BLOCKED_MISSING_MATHLIB), which is transcribed in the
+register and not altered here; any enclosure of the coefficient `c_{d,24}`; the disposition of
+`side24-coefficient` (REVIEWED_SCOPED); nonauthor review or acceptance of
+SIDE24-COEFFICIENT-D23-20260924-v1. It promotes, closes, discharges or reclassifies nothing. -/
+theorem covarianceOrdering : UniversalLaw.Spec.Side24.CovarianceOrdering := by
+ intro d hd hθ hd0 R hR
+ have hd3 : d ≤ 3 := by rcases hd with rfl | rfl <;> norm_num
+ set u := R ⟨0, hd0⟩
+ set C := C24 d u R
+ set M := Cref d u R
+ have hMpsd := Side24Covariance.referenceCovarianceLowerBound d hd hd0 R hR
+ have hMh : M.IsHermitian := by
+ have h1 := hMpsd.isHermitian
+ have h2 : ((1 / 3 : ℝ) • (1 : Matrix (JointIndex d) (JointIndex d) ℝ)).IsHermitian :=
+ Matrix.isHermitian_one.smul (by simp [IsSelfAdjoint])
+ simpa using h1.add h2
+ have hCh : C.IsHermitian := co_C24_hermitian u R
+ have hΔ : ∀ a b, |(C - M) a b| ≤ 2 * imageConstE := fun a b => by
+ simpa [Matrix.sub_apply] using entrywiseCovarianceBound d hd hθ hd0 R hR a b
+ have hcard := co_card_le hd3
+ have hM3 : ∀ x : JointIndex d → ℝ, (1 / 3) * (x ⬝ᵥ x) ≤ x ⬝ᵥ (M *ᵥ x) := fun x => by
+ have h := hMpsd.dotProduct_mulVec_nonneg x
+ simp only [star_trivial, Matrix.sub_mulVec, Matrix.smul_mulVec, Matrix.one_mulVec,
+ dotProduct_sub, dotProduct_smul, smul_eq_mul] at h
+ linarith
+ have hquad : ∀ x : JointIndex d → ℝ,
+ |x ⬝ᵥ ((C - M) *ᵥ x)| ≤ epsilon * (1 / 3) * (x ⬝ᵥ x) := fun x => by
+ have hE : 0 ≤ 2 * imageConstE := by norm_num [imageConstE]
+ have h1 := co_quad_le (C - M) hE hΔ x
+ have hxx : 0 ≤ x ⬝ᵥ x := by
+ unfold dotProduct; exact Finset.sum_nonneg fun i _ => mul_self_nonneg _
+ have h2 : 2 * imageConstE * (Fintype.card (JointIndex d) : ℝ) ≤ 2 * imageConstE * 13 :=
+ mul_le_mul_of_nonneg_left (by exact_mod_cast hcard) hE
+ calc |x ⬝ᵥ ((C - M) *ᵥ x)| ≤ 2 * imageConstE * Fintype.card (JointIndex d) * (x ⬝ᵥ x) := h1
+ _ ≤ 2 * imageConstE * 13 * (x ⬝ᵥ x) := mul_le_mul_of_nonneg_right h2 hxx
+ _ ≤ epsilon / 3 * (x ⬝ᵥ x) := mul_le_mul_of_nonneg_right co_margin hxx
+ _ = epsilon * (1 / 3) * (x ⬝ᵥ x) := by ring
+ have heps : 0 ≤ epsilon := by norm_num [epsilon]
+ refine ⟨Matrix.PosSemidef.of_dotProduct_mulVec_nonneg
+ (hCh.sub (hMh.smul (by simp [IsSelfAdjoint]))) fun x => ?_,
+ Matrix.PosSemidef.of_dotProduct_mulVec_nonneg
+ ((hMh.smul (by simp [IsSelfAdjoint])).sub hCh) fun x => ?_⟩
+ · have hq := hquad x
+ have hm := hM3 x
+ have hsplit : star x ⬝ᵥ ((C - (1 - epsilon) • M) *ᵥ x) =
+ x ⬝ᵥ ((C - M) *ᵥ x) + epsilon * (x ⬝ᵥ (M *ᵥ x)) := by
+ simp only [star_trivial, Matrix.sub_mulVec, Matrix.smul_mulVec, dotProduct_sub,
+ dotProduct_smul, smul_eq_mul]
+ ring
+ rw [hsplit]
+ have := neg_abs_le (x ⬝ᵥ ((C - M) *ᵥ x))
+ nlinarith
+ · have hq := hquad x
+ have hm := hM3 x
+ have hsplit : star x ⬝ᵥ (((1 + epsilon) • M - C) *ᵥ x) =
+ epsilon * (x ⬝ᵥ (M *ᵥ x)) - x ⬝ᵥ ((C - M) *ᵥ x) := by
+ simp only [star_trivial, Matrix.sub_mulVec, Matrix.smul_mulVec, dotProduct_sub,
+ dotProduct_smul, smul_eq_mul]
+ ring
+ rw [hsplit]
+ have := le_abs_self (x ⬝ᵥ ((C - M) *ᵥ x))
+ nlinarith
+
+end UniversalLaw.Proofs.Side24Images
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Interfaces.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Interfaces.lean
new file mode 100644
index 000000000..4b2dd98c9
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Interfaces.lean
@@ -0,0 +1,632 @@
+import Specifications.Side24
+
+/-!
+# SIDE24 interface proofs: the `m = 1` cone moment identity, the trace moments and the law of
+`R^2 = x^2 + y^2` over `ConeMomentInterface` (statement module `Specifications.Side24`)
+
+Scientific effect: NONE. Organizational-independence credit: 0 (Anthropic / Claude).
+
+Every theorem outside the `Aux` namespace has as its type exactly one registered `Prop` of
+`Specifications/Side24.lean` (statement packet `specifications/lean_statements_20261010`, which
+is not modified here), applied to its own parameter `I : ConeMomentInterface`. A kernel-checked
+proof of such a `Prop` is evidence about that `Prop` only: it does not make the informal Layer 0
+note (SIDE24-COEFFICIENT-D23-20260924-v1, register row `side24-coefficient`) reviewed, accepted
+or "verified", it does not identify the formal definitions with the informal objects (that
+alignment is PENDING_INDEPENDENT_REVIEW), it does not enclose the coefficient `c_{d,24}`, and it
+promotes, closes, discharges or reclassifies nothing. Nothing here constructs an inhabitant of
+`ConeMomentInterface` or derives its law fields from any field; the theorems hold for every
+inhabitant and use only the law fields `A_law`, `sxy_law` and the instance `isProb`.
+
+Provenance: the three `Prop`s proved here were selected by the round-4 triage (workflow
+`wf_a3531fd8-891`) of the registered `Prop`s still without a theorem; each proof was written and
+verified in its own lane and the lane files were merged into this module, with the helpers the
+lanes proved twice removed (one copy kept, call sites repointed) and the lanes' tags kept. Helper
+lemmas live in `UniversalLaw.Proofs.Side24Interfaces.Aux`, tagged `c1_`, `tm_`, `rl_`; the gate
+inventories only the three theorems outside that namespace. The mathematics:
+
+* The common step: a map whose image measure under a probability measure is a non-degenerate
+ Gaussian (or a product of them) is a.e.-measurable, because at this Mathlib revision the image
+ measure of a non-a.e.-measurable map under a nonzero measure is a Dirac measure
+ (`Measure.map_of_not_aemeasurable_of_ne_zero`), which charges a singleton, while the Gaussian
+ law has `NullSingletonClass` (`c1_aemeasurable_of_map_eq_gaussian` for `A`,
+ `tm_aemeasurable_triple` for `(s, x, y)`). Integrals are then transported along the laws by
+ `integral_map`, and probabilities by `Measure.map_apply_of_aemeasurable`.
+* `ConeMomentD1Identity I` (`c1_`): the negative half of the second moment of
+ `gaussianReal 0 (8/3)` is `(8/3)/2 = 4/3` (`gaussianReal_map_neg`, `integral_add_compl`,
+ `integral_Ici_eq_integral_Ioi`, `variance_fun_id_gaussianReal`).
+* `TraceMoments I` (`tm_`): the first marginal of `sxy_law` is `gaussianReal 0 (5/3)`
+ (`Measure.map_fst_prod`); `∫ t^2 = 5/3`, `∫ t^4 = 3 (5/3)^2 = 25/3` (`iteratedDeriv_mgf_zero`
+ with the explicit fourth derivative of `exp (c t^2/2)` at `0`), `∫ exp(-t^2/2) = √(3/8)`
+ (`integral_gaussianReal_eq_integral_smul`, `integral_gaussian`).
+* `RayleighSquareLaw I` (`rl_`): the second marginal of `sxy_law` is
+ `gaussianReal 0 1 ⊗ gaussianReal 0 1` (`Measure.map_snd_prod`); the measure of the closed disk of
+ radius `√a` is computed by hand (Mathlib has no Rayleigh or chi-squared law): `prod_withDensity`,
+ `withDensity_apply`, `ofReal_integral_eq_lintegral_ofReal`, polar coordinates
+ (`integral_comp_polarCoord_symm`, `setIntegral_prod_mul`), the angular integral `2π` and the
+ radial integral by the fundamental theorem of calculus; the right-hand side
+ `∫_0^a exp(-z/2)/2 dz = 1 - exp(-a/2)` is the same elementary integral.
+
+Remark recorded by the lanes, for the maintainers (not edited here): the proof-packet README row
+"Side24 interface statements" gives as its informal reason that the Gaussian moment identities
+"need the conditional law `A_u | V_u = 0` built in Mathlib's Gaussian measure theory"; for the three
+`Prop`s proved here the interface's law fields suffice. This is a remark about an informal reason,
+not about any claim; no register label changes.
+-/
+
+namespace UniversalLaw.Proofs.Side24Interfaces
+
+open MeasureTheory ProbabilityTheory UniversalLaw.Spec.Side24
+
+namespace Aux
+
+/-! ## `c1_`: the `m = 1` cone moment identity (`ConeMomentD1Identity`) -/
+
+/-! ### (a) A map with a non-degenerate Gaussian law is a.e.-measurable -/
+
+/-- If `Measure.map A P` is the Gaussian `gaussianReal 0 v` with `v ≠ 0`, then `A` is
+a.e.-measurable: otherwise the image measure would be a Dirac measure
+(`Measure.map_of_not_aemeasurable_of_ne_zero`), giving a singleton of measure one, whereas the
+Gaussian charges no singleton (`nullSingletonClass_gaussianReal`). -/
+theorem c1_aemeasurable_of_map_eq_gaussian {Ω : Type} [MeasurableSpace Ω] (P : Measure Ω)
+ [IsProbabilityMeasure P] (A : Ω → ℝ) {v : NNReal} (hv : v ≠ 0)
+ (h : Measure.map A P = gaussianReal 0 v) : AEMeasurable A P := by
+ by_contra hA
+ obtain ⟨c, hc⟩ : ∃ c : ℝ, Measure.map A P = Measure.dirac c :=
+ ⟨_, Measure.map_of_not_aemeasurable_of_ne_zero hA (IsProbabilityMeasure.ne_zero P)⟩
+ rw [hc] at h
+ have : NullSingletonClass (gaussianReal 0 v) := nullSingletonClass_gaussianReal hv
+ have h1 : Measure.dirac c {c} = gaussianReal 0 v {c} := by rw [h]
+ rw [Measure.dirac_apply_of_mem (Set.mem_singleton c), measure_singleton] at h1
+ exact one_ne_zero h1
+
+/-! ### (b) Second moments of the centred Gaussian -/
+
+/-- The integrand `a ↦ 1_{Iio 0}(a) a^2` is measurable. -/
+theorem c1_measurable_indicator_sq :
+ Measurable (fun a : ℝ => Set.indicator (Set.Iio (0 : ℝ)) (fun a => a ^ 2) a) :=
+ (measurable_id.pow_const 2).indicator measurableSet_Iio
+
+/-- The second moment of `gaussianReal 0 v` is `v`, from Mathlib's
+`variance_fun_id_gaussianReal` rewritten with `variance_eq_integral` (the mean is `0`). -/
+theorem c1_second_moment_gaussianReal (v : NNReal) :
+ ∫ t, t ^ 2 ∂(gaussianReal 0 v) = (v : ℝ) := by
+ have h := variance_fun_id_gaussianReal (μ := 0) (v := v)
+ rw [variance_eq_integral (by fun_prop)] at h
+ simpa using h
+
+/-- `a ↦ a^2` is integrable against `gaussianReal 0 v` (`memLp_id_gaussianReal` at `p = 2`). -/
+theorem c1_integrable_sq_gaussianReal (v : NNReal) :
+ Integrable (fun a : ℝ => a ^ 2) (gaussianReal 0 v) := by
+ have := (memLp_id_gaussianReal (μ := 0) (v := v) 2).integrable_sq
+ simpa using this
+
+/-- Symmetry of the centred Gaussian: the second moment over `Iio 0` equals the second moment
+over `Ioi 0`, by `gaussianReal_map_neg` and a change of variables `a ↦ -a` (`integral_map`),
+using `neg_lt_zero` and `neg_sq` pointwise. -/
+theorem c1_setIntegral_sq_Iio_eq_Ioi (v : NNReal) :
+ ∫ a in Set.Iio (0 : ℝ), a ^ 2 ∂(gaussianReal 0 v) =
+ ∫ a in Set.Ioi (0 : ℝ), a ^ 2 ∂(gaussianReal 0 v) := by
+ set γ := gaussianReal 0 v with hγ
+ have hneg : γ.map (fun x => -x) = γ := by rw [hγ, gaussianReal_map_neg, neg_zero]
+ calc ∫ a in Set.Iio (0 : ℝ), a ^ 2 ∂γ
+ = ∫ a, Set.indicator (Set.Iio (0 : ℝ)) (fun a => a ^ 2) a ∂γ :=
+ (integral_indicator measurableSet_Iio).symm
+ _ = ∫ a, Set.indicator (Set.Iio (0 : ℝ)) (fun a => a ^ 2) a ∂(γ.map (fun x => -x)) := by
+ rw [hneg]
+ _ = ∫ a, Set.indicator (Set.Iio (0 : ℝ)) (fun a => a ^ 2) (-a) ∂γ :=
+ integral_map measurable_neg.aemeasurable c1_measurable_indicator_sq.aestronglyMeasurable
+ _ = ∫ a, Set.indicator (Set.Ioi (0 : ℝ)) (fun a => a ^ 2) a ∂γ := by
+ congr 1; funext a
+ simp only [Set.indicator, Set.mem_Iio, Set.mem_Ioi, neg_lt_zero, neg_sq]
+ _ = ∫ a in Set.Ioi (0 : ℝ), a ^ 2 ∂γ := integral_indicator measurableSet_Ioi
+
+/-- The negative half of the second moment of `gaussianReal 0 v`, `v ≠ 0`, is `v / 2`:
+`integral_add_compl` over `Iio 0` and its complement `Ici 0`, `integral_Ici_eq_integral_Ioi`
+(the Gaussian charges no singleton), the symmetry lemma, and the full second moment `v`. -/
+theorem c1_setIntegral_sq_Iio (v : NNReal) (hv : v ≠ 0) :
+ ∫ a in Set.Iio (0 : ℝ), a ^ 2 ∂(gaussianReal 0 v) = (v : ℝ) / 2 := by
+ have : NullSingletonClass (gaussianReal 0 v) := nullSingletonClass_gaussianReal hv
+ have hsplit := integral_add_compl (μ := gaussianReal 0 v) (s := Set.Iio (0 : ℝ))
+ measurableSet_Iio (c1_integrable_sq_gaussianReal v)
+ rw [Set.compl_Iio, integral_Ici_eq_integral_Ioi, ← c1_setIntegral_sq_Iio_eq_Ioi,
+ c1_second_moment_gaussianReal] at hsplit
+ linarith
+
+/-! ### (c) Transport along the law of `A` -/
+
+/-- For a map `A` with law `gaussianReal 0 (8/3)` under a probability measure `P`, the integral
+of `1_{Iio 0}(A) A^2` equals the set integral of `a ↦ a^2` over `Iio 0` against
+`gaussianReal 0 (8/3)`: a.e.-measurability of `A` from its law, then `integral_map` and
+`integral_indicator`. Stated for an abstract `(Ω, P, A)` so that the interface's own instance
+fields `I.mΩ`, `I.isProb` are supplied explicitly at the point of use. -/
+theorem c1_integral_indicator_eq {Ω : Type} [MeasurableSpace Ω] (P : Measure Ω)
+ [IsProbabilityMeasure P] (A : Ω → ℝ)
+ (hlaw : Measure.map A P = gaussianReal 0 (8 / 3 : NNReal)) :
+ ∫ ω, Set.indicator (Set.Iio (0 : ℝ)) (fun a => a ^ 2) (A ω) ∂P =
+ ∫ a in Set.Iio (0 : ℝ), a ^ 2 ∂(gaussianReal 0 (8 / 3 : NNReal)) := by
+ have hv : ((8 : NNReal) / 3) ≠ 0 := by norm_num
+ have hA : AEMeasurable A P := c1_aemeasurable_of_map_eq_gaussian P A hv hlaw
+ have e : ∫ ω, Set.indicator (Set.Iio (0 : ℝ)) (fun a => a ^ 2) (A ω) ∂P =
+ ∫ a, Set.indicator (Set.Iio (0 : ℝ)) (fun a => a ^ 2) a ∂(Measure.map A P) :=
+ (integral_map hA c1_measurable_indicator_sq.aestronglyMeasurable).symm
+ rw [e, hlaw, integral_indicator measurableSet_Iio]
+
+/-! ## `tm_`: the trace moments (`TraceMoments`) -/
+
+/-! ### (a) Calculus: the fourth derivative of `exp (c t^2 / 2)` at `0` -/
+
+/-- Derivative of `t ↦ exp (c t^2 / 2)`: `c t exp (c t^2 / 2)` (chain rule through
+`HasDerivAt.exp`). -/
+theorem tm_hasDerivAt_exp_sq (c t : ℝ) :
+ HasDerivAt (fun t : ℝ => Real.exp (c * t ^ 2 / 2)) (c * t * Real.exp (c * t ^ 2 / 2)) t := by
+ have h1 : HasDerivAt (fun t : ℝ => c * t ^ 2 / 2)
+ (c * (((2 : ℕ) : ℝ) * t ^ (2 - 1) * 1) / 2) t :=
+ (((hasDerivAt_id' t).fun_pow 2).const_mul c).div_const 2
+ have h2 := h1.exp
+ convert h2 using 1
+ push_cast
+ ring
+
+/-- The fourth derivative of `t ↦ exp (c t^2 / 2)` at `0` is `3 c^2`: four explicit
+`HasDerivAt` steps, chained through `iteratedDeriv_succ` and `iteratedDeriv_one`. -/
+theorem tm_iteratedDeriv_four (c : ℝ) :
+ iteratedDeriv 4 (fun t : ℝ => Real.exp (c * t ^ 2 / 2)) 0 = 3 * c ^ 2 := by
+ have d1 : deriv (fun t : ℝ => Real.exp (c * t ^ 2 / 2)) =
+ fun t => c * t * Real.exp (c * t ^ 2 / 2) := by
+ funext t
+ exact (tm_hasDerivAt_exp_sq c t).deriv
+ have d2 : deriv (fun t : ℝ => c * t * Real.exp (c * t ^ 2 / 2)) =
+ fun t => (c + c ^ 2 * t ^ 2) * Real.exp (c * t ^ 2 / 2) := by
+ funext t
+ have h := ((hasDerivAt_id' t).const_mul c).mul (tm_hasDerivAt_exp_sq c t)
+ have h' : HasDerivAt (fun t : ℝ => c * t * Real.exp (c * t ^ 2 / 2)) _ t := h
+ rw [h'.deriv]
+ ring
+ have d3 : deriv (fun t : ℝ => (c + c ^ 2 * t ^ 2) * Real.exp (c * t ^ 2 / 2)) =
+ fun t => (3 * c ^ 2 * t + c ^ 3 * t ^ 3) * Real.exp (c * t ^ 2 / 2) := by
+ funext t
+ have h := ((((hasDerivAt_id' t).fun_pow 2).const_mul (c ^ 2)).const_add c).mul
+ (tm_hasDerivAt_exp_sq c t)
+ have h' : HasDerivAt (fun t : ℝ => (c + c ^ 2 * t ^ 2) * Real.exp (c * t ^ 2 / 2)) _ t := h
+ rw [h'.deriv]
+ push_cast
+ ring
+ have d4 : deriv (fun t : ℝ => (3 * c ^ 2 * t + c ^ 3 * t ^ 3) * Real.exp (c * t ^ 2 / 2)) =
+ fun t => (3 * c ^ 2 + 6 * c ^ 3 * t ^ 2 + c ^ 4 * t ^ 4) * Real.exp (c * t ^ 2 / 2) := by
+ funext t
+ have ha := ((hasDerivAt_id' t).const_mul (3 * c ^ 2)).add
+ (((hasDerivAt_id' t).fun_pow 3).const_mul (c ^ 3))
+ have h := ha.mul (tm_hasDerivAt_exp_sq c t)
+ have h' : HasDerivAt (fun t : ℝ => (3 * c ^ 2 * t + c ^ 3 * t ^ 3) * Real.exp (c * t ^ 2 / 2))
+ _ t := h
+ rw [h'.deriv]
+ simp only [Pi.add_apply]
+ push_cast
+ ring
+ have e4 : iteratedDeriv 4 (fun t : ℝ => Real.exp (c * t ^ 2 / 2)) =
+ deriv (iteratedDeriv 3 (fun t : ℝ => Real.exp (c * t ^ 2 / 2))) := iteratedDeriv_succ
+ have e3 : iteratedDeriv 3 (fun t : ℝ => Real.exp (c * t ^ 2 / 2)) =
+ deriv (iteratedDeriv 2 (fun t : ℝ => Real.exp (c * t ^ 2 / 2))) := iteratedDeriv_succ
+ have e2 : iteratedDeriv 2 (fun t : ℝ => Real.exp (c * t ^ 2 / 2)) =
+ deriv (iteratedDeriv 1 (fun t : ℝ => Real.exp (c * t ^ 2 / 2))) := iteratedDeriv_succ
+ rw [e4, e3, e2, iteratedDeriv_one, d1, d2, d3, d4]
+ simp
+
+/-! ### (b) Moments of the centred real Gaussian `gaussianReal 0 v`
+
+The second moment `∫ t^2 = v` is `c1_second_moment_gaussianReal` above (the `tm_` copy was
+removed at integration). -/
+
+/-- Fourth moment of `N(0, v)`: `∫ t^4 = 3 v^2`, from the fourth derivative at `0` of the
+moment generating function `t ↦ exp (v t^2 / 2)` (`iteratedDeriv_mgf_zero`,
+`mgf_fun_id_gaussianReal`, `tm_iteratedDeriv_four`). -/
+theorem tm_fourth_moment (v : NNReal) :
+ ∫ t, t ^ 4 ∂(gaussianReal 0 v) = 3 * (v : ℝ) ^ 2 := by
+ have h := iteratedDeriv_mgf_zero (X := fun x : ℝ => x) (μ := gaussianReal 0 v) (by simp) 4
+ rw [mgf_fun_id_gaussianReal] at h
+ simp only [zero_mul, zero_add] at h
+ rw [tm_iteratedDeriv_four] at h
+ simpa using h.symm
+
+/-- Exponential moment of `N(0, 5/3)`: `∫ exp (-t^2/2) = sqrt (3/8)`. The density
+`(sqrt (10 π / 3))⁻¹ exp (-3 t^2 / 10)` times `exp (-t^2/2)` is
+`(sqrt (10 π / 3))⁻¹ exp (-(4/5) t^2)`, whose Lebesgue integral is `sqrt (π / (4/5))`
+(`integral_gaussian`); the square roots combine to `sqrt (3/8)`. -/
+theorem tm_exp_moment :
+ ∫ t, Real.exp (-(t ^ 2) / 2) ∂(gaussianReal 0 (5 / 3 : NNReal)) = Real.sqrt (3 / 8) := by
+ rw [integral_gaussianReal_eq_integral_smul (by norm_num)]
+ have hpt : ∀ x : ℝ, gaussianPDFReal 0 (5 / 3 : NNReal) x • Real.exp (-(x ^ 2) / 2) =
+ (Real.sqrt (10 * Real.pi / 3))⁻¹ * Real.exp (-(4 / 5) * x ^ 2) := by
+ intro x
+ rw [gaussianPDFReal_def, smul_eq_mul, mul_assoc, ← Real.exp_add]
+ push_cast
+ congr 2
+ · congr 1
+ ring
+ · ring
+ simp_rw [hpt]
+ rw [integral_const_mul, integral_gaussian, ← Real.sqrt_inv, ← Real.sqrt_mul (by positivity)]
+ congr 1
+ field_simp
+ ring
+
+/-! ### (c) The marginal law of `s` from the interface's product law -/
+
+/-- The triple `(s, x, y)` is a.e.-measurable: its image measure under `P` is the product
+Gaussian law (`sxy_law`); were the triple not a.e.-measurable, `Measure.map` would be a Dirac
+mass (`Measure.map_of_not_aemeasurable_of_ne_zero`), which gives a singleton measure `1`,
+whereas the product of non-degenerate Gaussians has `NullSingletonClass`. -/
+theorem tm_aemeasurable_triple (I : ConeMomentInterface) :
+ @AEMeasurable _ _ _ I.mΩ (fun ω => (I.s ω, I.x ω, I.y ω)) I.P := by
+ let := I.mΩ
+ have := I.isProb
+ have hv : ((5 : NNReal) / 3) ≠ 0 := by norm_num
+ have : NullSingletonClass (gaussianReal 0 (5 / 3 : NNReal)) := nullSingletonClass_gaussianReal hv
+ by_contra hT
+ obtain ⟨c, hc⟩ : ∃ c : ℝ × ℝ × ℝ,
+ Measure.map (fun ω => (I.s ω, I.x ω, I.y ω)) I.P = Measure.dirac c :=
+ ⟨_, Measure.map_of_not_aemeasurable_of_ne_zero hT (IsProbabilityMeasure.ne_zero I.P)⟩
+ have h := I.sxy_law
+ rw [hc] at h
+ have h1 : Measure.dirac c {c} =
+ ((gaussianReal 0 (5 / 3)).prod ((gaussianReal 0 1).prod (gaussianReal 0 1))) {c} := by
+ rw [h]
+ rw [Measure.dirac_apply_of_mem (Set.mem_singleton c), measure_singleton] at h1
+ exact one_ne_zero h1
+
+/-- `s` is a.e.-measurable, as the first component of the a.e.-measurable triple. -/
+theorem tm_aemeasurable_s (I : ConeMomentInterface) : @AEMeasurable _ _ _ I.mΩ I.s I.P :=
+ (tm_aemeasurable_triple I).fst
+
+/-- The law of `s` is `N(0, 5/3)`: the first marginal of the product law `sxy_law`
+(`AEMeasurable.map_map_of_aemeasurable`, `Measure.map_fst_prod`; the composite
+`Prod.fst ∘ (s, x, y)` is `s`). -/
+theorem tm_law_s (I : ConeMomentInterface) :
+ @Measure.map _ _ I.mΩ _ I.s I.P = gaussianReal 0 (5 / 3 : NNReal) := by
+ let := I.mΩ
+ have := I.isProb
+ have hT := tm_aemeasurable_triple I
+ have h := AEMeasurable.map_map_of_aemeasurable (measurable_fst.aemeasurable) hT
+ rw [I.sxy_law, Measure.map_fst_prod, measure_univ, one_smul] at h
+ exact h.symm
+
+/-! ### (d) Transport of an integral along `s` to the marginal law -/
+
+/-- For a measurable `f : ℝ → ℝ`, `∫ f (s ω) dP = ∫ f t d(gaussianReal 0 (5/3))`
+(`integral_map` along the a.e.-measurable `s`, then `tm_law_s`). -/
+theorem tm_integral_comp_s (I : ConeMomentInterface) (f : ℝ → ℝ) (hf : Measurable f) :
+ ∫ ω, f (I.s ω) ∂I.P = ∫ t, f t ∂(gaussianReal 0 (5 / 3 : NNReal)) := by
+ let := I.mΩ
+ have := I.isProb
+ rw [← tm_law_s I]
+ exact (integral_map (tm_aemeasurable_s I) hf.aestronglyMeasurable).symm
+
+/-! ## `rl_`: the law of `R^2` (`RayleighSquareLaw`) -/
+
+/-! ### (a) Elementary integrals -/
+
+/-- The right-hand side of `RayleighSquareLaw`: `∫_0^a exp (-z/2)/2 dz = 1 - exp (-a/2)`, by
+the fundamental theorem of calculus with antiderivative `z ↦ -exp (-z/2)`. -/
+theorem rl_rhs_integral (a : ℝ) :
+ ∫ z in (0 : ℝ)..a, Real.exp (-z / 2) / 2 = 1 - Real.exp (-a / 2) := by
+ have hderiv : ∀ z ∈ Set.uIcc (0 : ℝ) a,
+ HasDerivAt (fun z : ℝ => -Real.exp (-z / 2)) (Real.exp (-z / 2) / 2) z := by
+ intro z _
+ have h1 : HasDerivAt (fun z : ℝ => -z / 2) (-1 / 2) z :=
+ ((hasDerivAt_id' z).neg).div_const 2
+ have h2 := h1.exp.neg
+ convert h2 using 1
+ ring
+ have hint : IntervalIntegrable (fun z : ℝ => Real.exp (-z / 2) / 2) volume 0 a :=
+ (by fun_prop : Continuous fun z : ℝ => Real.exp (-z / 2) / 2).intervalIntegrable 0 a
+ rw [intervalIntegral.integral_eq_sub_of_hasDerivAt hderiv hint]
+ simp
+ ring
+
+/-- The radial integral of the planar Gaussian density over the disk of radius `sqrt a`:
+`∫_0^{sqrt a} r (2π)⁻¹ exp (-r^2/2) dr = (2π)⁻¹ (1 - exp (-a/2))`, by the fundamental
+theorem of calculus with antiderivative `r ↦ -(2π)⁻¹ exp (-r^2/2)`. -/
+theorem rl_radial_integral (a : ℝ) (ha : 0 ≤ a) :
+ ∫ r in (0 : ℝ)..Real.sqrt a, r * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2)) =
+ (2 * Real.pi)⁻¹ * (1 - Real.exp (-a / 2)) := by
+ have hderiv : ∀ r ∈ Set.uIcc (0 : ℝ) (Real.sqrt a),
+ HasDerivAt (fun r : ℝ => -((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2)))
+ (r * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2))) r := by
+ intro r _
+ have h1 : HasDerivAt (fun r : ℝ => -(r ^ 2) / 2)
+ (-(((2 : ℕ) : ℝ) * r ^ (2 - 1) * 1) / 2) r :=
+ (((hasDerivAt_id' r).fun_pow 2).neg).div_const 2
+ have h2 := (h1.exp.const_mul ((2 * Real.pi)⁻¹)).neg
+ convert h2 using 1
+ push_cast
+ ring
+ have hcont : Continuous fun r : ℝ => r * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2)) := by
+ fun_prop
+ have hint : IntervalIntegrable (fun r : ℝ => r * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2)))
+ volume 0 (Real.sqrt a) :=
+ hcont.intervalIntegrable 0 (Real.sqrt a)
+ rw [intervalIntegral.integral_eq_sub_of_hasDerivAt hderiv hint, Real.sq_sqrt ha]
+ simp
+ ring
+
+/-- The angular integral: `∫_{Ioo (-π) π} 1 = 2π`. -/
+theorem rl_angular_integral : ∫ _θ in Set.Ioo (-Real.pi) Real.pi, (1 : ℝ) = 2 * Real.pi := by
+ rw [setIntegral_const, smul_eq_mul, mul_one, measureReal_def, Real.volume_Ioo,
+ ENNReal.toReal_ofReal (by linarith [Real.pi_pos])]
+ ring
+
+/-! ### (b) The planar standard Gaussian density -/
+
+/-- The product of two standard Gaussian densities is the planar density
+`(2π)⁻¹ exp (-(x^2 + y^2)/2)`. -/
+theorem rl_pdf_mul (x y : ℝ) :
+ gaussianPDFReal 0 1 x * gaussianPDFReal 0 1 y =
+ (2 * Real.pi)⁻¹ * Real.exp (-(x ^ 2 + y ^ 2) / 2) := by
+ simp only [gaussianPDFReal_def, NNReal.coe_one, mul_one, sub_zero]
+ have hs : (Real.sqrt (2 * Real.pi))⁻¹ * (Real.sqrt (2 * Real.pi))⁻¹ =
+ (2 * Real.pi)⁻¹ := by
+ rw [← mul_inv, Real.mul_self_sqrt (by positivity)]
+ calc (Real.sqrt (2 * Real.pi))⁻¹ * Real.exp (-x ^ 2 / 2) *
+ ((Real.sqrt (2 * Real.pi))⁻¹ * Real.exp (-y ^ 2 / 2))
+ = ((Real.sqrt (2 * Real.pi))⁻¹ * (Real.sqrt (2 * Real.pi))⁻¹) *
+ (Real.exp (-x ^ 2 / 2) * Real.exp (-y ^ 2 / 2)) := by ring
+ _ = (2 * Real.pi)⁻¹ * Real.exp (-(x ^ 2 + y ^ 2) / 2) := by
+ rw [hs, ← Real.exp_add]
+ congr 2
+ ring
+
+/-- The closed disk `{p | p.1^2 + p.2^2 ≤ a}` is measurable. -/
+theorem rl_measurableSet_disk (a : ℝ) :
+ MeasurableSet {p : ℝ × ℝ | p.1 ^ 2 + p.2 ^ 2 ≤ a} :=
+ measurableSet_le (by fun_prop) measurable_const
+
+/-- The set `{r | r^2 ≤ a}` is measurable. -/
+theorem rl_measurableSet_radial (a : ℝ) : MeasurableSet {r : ℝ | r ^ 2 ≤ a} :=
+ measurableSet_le (by fun_prop) measurable_const
+
+/-- In polar coordinates the disk integrand `p.1 • 1_D (density ∘ polarCoord.symm) p` is the
+radial function `1_{r^2 ≤ a} (r (2π)⁻¹ exp (-r^2/2))` of `p.1` times the constant `1` of
+`p.2` (the form `setIntegral_prod_mul` separates). -/
+theorem rl_polar_integrand (a : ℝ) (p : ℝ × ℝ) :
+ p.1 • Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}
+ (fun q => gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2) (polarCoord.symm p) =
+ Set.indicator {r : ℝ | r ^ 2 ≤ a}
+ (fun r => r * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2))) p.1 *
+ (fun _ : ℝ => (1 : ℝ)) p.2 := by
+ have hsq : (p.1 * Real.cos p.2) ^ 2 + (p.1 * Real.sin p.2) ^ 2 = p.1 ^ 2 := by
+ rw [mul_pow, mul_pow, ← mul_add, Real.cos_sq_add_sin_sq, mul_one]
+ simp only [polarCoord_symm_apply, Set.indicator, Set.mem_ofPred_eq, rl_pdf_mul, hsq,
+ smul_eq_mul, mul_one]
+ split_ifs <;> simp
+
+/-- For `a ≥ 0`, `Ioi 0 ∩ {r | r^2 ≤ a} = Ioc 0 (sqrt a)`. -/
+theorem rl_Ioi_inter_eq (a : ℝ) (ha : 0 ≤ a) :
+ Set.Ioi (0 : ℝ) ∩ {r : ℝ | r ^ 2 ≤ a} = Set.Ioc 0 (Real.sqrt a) := by
+ ext r
+ simp only [Set.mem_inter_iff, Set.mem_Ioi, Set.mem_ofPred_eq, Set.mem_Ioc]
+ constructor
+ · rintro ⟨h0, hr⟩
+ exact ⟨h0, (Real.le_sqrt h0.le ha).2 hr⟩
+ · rintro ⟨h0, hr⟩
+ exact ⟨h0, (Real.le_sqrt h0.le ha).1 hr⟩
+
+/-- The Bochner integral of the planar standard Gaussian density over the closed disk of
+radius `sqrt a` is `1 - exp (-a/2)`: polar coordinates (`integral_comp_polarCoord_symm`),
+separation of variables (`setIntegral_prod_mul`), the angular integral `2π` and the radial
+integral `(2π)⁻¹ (1 - exp (-a/2))`. -/
+theorem rl_disk_integral (a : ℝ) (ha : 0 ≤ a) :
+ ∫ p in {p : ℝ × ℝ | p.1 ^ 2 + p.2 ^ 2 ≤ a},
+ gaussianPDFReal 0 1 p.1 * gaussianPDFReal 0 1 p.2 = 1 - Real.exp (-a / 2) := by
+ have h1 : ∫ p in {p : ℝ × ℝ | p.1 ^ 2 + p.2 ^ 2 ≤ a},
+ gaussianPDFReal 0 1 p.1 * gaussianPDFReal 0 1 p.2 =
+ ∫ p, Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}
+ (fun q => gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2) p :=
+ (integral_indicator (rl_measurableSet_disk a)).symm
+ have h2 : ∫ p, Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}
+ (fun q => gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2) p =
+ ∫ p in polarCoord.target, p.1 • Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}
+ (fun q => gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2) (polarCoord.symm p) :=
+ (integral_comp_polarCoord_symm _).symm
+ have h3 : ∫ p in polarCoord.target,
+ p.1 • Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}
+ (fun q => gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2) (polarCoord.symm p) =
+ ∫ p in Set.Ioi (0 : ℝ) ×ˢ Set.Ioo (-Real.pi) Real.pi,
+ Set.indicator {r : ℝ | r ^ 2 ≤ a}
+ (fun r => r * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2))) p.1 *
+ (fun _ : ℝ => (1 : ℝ)) p.2 := by
+ rw [polarCoord_target]
+ exact integral_congr_ae (Filter.Eventually.of_forall (fun p => rl_polar_integrand a p))
+ have h4 := setIntegral_prod_mul (μ := (volume : Measure ℝ)) (ν := (volume : Measure ℝ))
+ (Set.indicator {r : ℝ | r ^ 2 ≤ a}
+ (fun r => r * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2))))
+ (fun _ : ℝ => (1 : ℝ)) (Set.Ioi (0 : ℝ)) (Set.Ioo (-Real.pi) Real.pi)
+ have h5 : ∫ r in Set.Ioi (0 : ℝ), Set.indicator {r : ℝ | r ^ 2 ≤ a}
+ (fun r => r * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2))) r =
+ (2 * Real.pi)⁻¹ * (1 - Real.exp (-a / 2)) := by
+ rw [setIntegral_indicator (rl_measurableSet_radial a), rl_Ioi_inter_eq a ha,
+ ← intervalIntegral.integral_of_le (Real.sqrt_nonneg a), rl_radial_integral a ha]
+ rw [h1, h2, h3]
+ refine h4.trans ?_
+ rw [h5, rl_angular_integral]
+ field_simp
+
+/-- The measure of the closed disk of radius `sqrt a` under the standard planar Gaussian
+`gaussianReal 0 1 ⊗ gaussianReal 0 1` is `1 - exp (-a/2)`: the product of the two
+`withDensity` measures is `withDensity` of the product density (`prod_withDensity`), whose
+value on the (measurable) disk is the `lintegral` of the density there (`withDensity_apply`),
+which is `ENNReal.ofReal` of the Bochner integral `rl_disk_integral`
+(`ofReal_integral_eq_lintegral_ofReal`). -/
+theorem rl_disk_measure (a : ℝ) (ha : 0 ≤ a) :
+ ((gaussianReal 0 1).prod (gaussianReal 0 1)) {p : ℝ × ℝ | p.1 ^ 2 + p.2 ^ 2 ≤ a} =
+ ENNReal.ofReal (1 - Real.exp (-a / 2)) := by
+ have hD := rl_measurableSet_disk a
+ rw [gaussianReal_of_var_ne_zero 0 one_ne_zero,
+ prod_withDensity (measurable_gaussianPDF 0 1) (measurable_gaussianPDF 0 1),
+ ← Measure.volume_eq_prod ℝ ℝ, withDensity_apply _ hD, ← rl_disk_integral a ha]
+ have hint : Integrable (fun p : ℝ × ℝ => gaussianPDFReal 0 1 p.1 * gaussianPDFReal 0 1 p.2)
+ (volume : Measure (ℝ × ℝ)) :=
+ (integrable_gaussianPDFReal 0 1).mul_prod (integrable_gaussianPDFReal 0 1)
+ have hnn : 0 ≤ᵐ[(volume : Measure (ℝ × ℝ)).restrict
+ {p : ℝ × ℝ | p.1 ^ 2 + p.2 ^ 2 ≤ a}]
+ (fun p : ℝ × ℝ => gaussianPDFReal 0 1 p.1 * gaussianPDFReal 0 1 p.2) :=
+ Filter.Eventually.of_forall
+ (fun p => mul_nonneg (gaussianPDFReal_nonneg _ _ _) (gaussianPDFReal_nonneg _ _ _))
+ rw [ofReal_integral_eq_lintegral_ofReal hint.integrableOn hnn]
+ refine setLIntegral_congr_fun hD (fun p _ => ?_)
+ simp only [gaussianPDF]
+ rw [ENNReal.ofReal_mul (gaussianPDFReal_nonneg _ _ _)]
+
+/-! ### (c) The interface: measurability and the law of `(x, y)`
+
+A.e.-measurability of the triple `(s, x, y)` is `tm_aemeasurable_triple` above (the `rl_` copy
+was removed at integration). -/
+
+/-- The pair `(x, y)` is a.e.-measurable, as the second component of the triple. -/
+theorem rl_aemeasurable_xy (I : ConeMomentInterface) :
+ @AEMeasurable _ _ _ I.mΩ (fun ω => (I.x ω, I.y ω)) I.P :=
+ (tm_aemeasurable_triple I).snd
+
+/-- The law of `(x, y)` is `gaussianReal 0 1 ⊗ gaussianReal 0 1`: the second marginal of the
+product law `sxy_law` (`AEMeasurable.map_map_of_aemeasurable`, `Measure.map_snd_prod`; the
+composite `Prod.snd ∘ (s, x, y)` is `(x, y)`). -/
+theorem rl_law_xy (I : ConeMomentInterface) :
+ @Measure.map _ _ I.mΩ _ (fun ω => (I.x ω, I.y ω)) I.P =
+ (gaussianReal 0 1).prod (gaussianReal 0 1) := by
+ let := I.mΩ
+ have := I.isProb
+ have hT := tm_aemeasurable_triple I
+ have h := AEMeasurable.map_map_of_aemeasurable (measurable_snd.aemeasurable) hT
+ rw [I.sxy_law, Measure.map_snd_prod, measure_univ, one_smul] at h
+ exact h.symm
+
+/-- The probability of `{x^2 + y^2 ≤ a}` under `P` is the Gaussian measure of the closed disk: the
+disk is a measurable set and `(x, y)` is a.e.-measurable, so `Measure.map_apply_of_aemeasurable`
+transports the law `rl_law_xy` (a.e.-measurable transport; the sample-space preimage is only
+shown to be null-measurable for `I.P`, which is not assumed complete). -/
+theorem rl_prob_eq_disk_measure (I : ConeMomentInterface) (a : ℝ) :
+ I.P {ω | I.x ω ^ 2 + I.y ω ^ 2 ≤ a} =
+ ((gaussianReal 0 1).prod (gaussianReal 0 1)) {p : ℝ × ℝ | p.1 ^ 2 + p.2 ^ 2 ≤ a} := by
+ let := I.mΩ
+ have := I.isProb
+ rw [← rl_law_xy I,
+ Measure.map_apply_of_aemeasurable (rl_aemeasurable_xy I) (rl_measurableSet_disk a)]
+ rfl
+
+end Aux
+
+/-! ## The `m = 1` cone moment identity for every inhabitant of the interface -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.ConeMomentD1Identity` (claim `side24-coefficient`).
+Method: transport along the law field `I.A_law` (`Aux.c1_integral_indicator_eq`, applied to
+`I.Ω`, `I.mΩ`, `I.P`, `I.isProb`, `I.A`; it uses `integral_map` after a.e.-measurability of
+`I.A` from `Aux.c1_aemeasurable_of_map_eq_gaussian`, the Dirac-versus-`NullSingletonClass`
+argument), then the negative half of the second moment of
+`gaussianReal 0 (8/3)` is `(8/3)/2` (`Aux.c1_setIntegral_sq_Iio`, from `integral_add_compl`,
+`integral_Ici_eq_integral_Ioi`, the symmetry `gaussianReal_map_neg` and the variance
+`variance_fun_id_gaussianReal`), and `push_cast`/`norm_num` give `4/3 = coneMomentD1`.
+Does not establish: the informal identity `D_1 = E[A^2 1{A<0}] = 4/3` of the source as the
+source's object (the alignment of `ConeMomentInterface`, its field `A_law` and `coneMomentD1`
+with the source's `A ~ N(0, 8/3)` and `D_1` is PENDING_INDEPENDENT_REVIEW); that `D_1` 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; any
+enclosure of the coefficient; `ConeMomentD2Identity`, `TraceMoments` or `RayleighSquareLaw`;
+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. -/
+theorem coneMomentD1Identity (I : ConeMomentInterface) :
+ UniversalLaw.Spec.Side24.ConeMomentD1Identity I := by
+ unfold UniversalLaw.Spec.Side24.ConeMomentD1Identity coneMomentD1
+ rw [@Aux.c1_integral_indicator_eq I.Ω I.mΩ I.P I.isProb I.A I.A_law,
+ Aux.c1_setIntegral_sq_Iio (8 / 3 : NNReal) (by norm_num)]
+ push_cast
+ norm_num
+
+/-! ## The Section 1 trace moments for every inhabitant of the interface -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.TraceMoments` (claim `side24-coefficient`).
+Method: the law of `I.s` is `gaussianReal 0 (5/3)` (`Aux.tm_law_s`: the first marginal of the
+interface's product law `sxy_law`, after `Aux.tm_aemeasurable_triple` derives a.e.-measurability
+of the triple from the law by the Dirac-versus-`NullSingletonClass` argument); each of the three
+integrals is transported to that law by `integral_map` (`Aux.tm_integral_comp_s`) and computed
+there: `∫ t^2 = 5/3` (`Aux.c1_second_moment_gaussianReal`, shared with `ConeMomentD1Identity`,
+from `variance_fun_id_gaussianReal`),
+`∫ t^4 = 3 (5/3)^2 = 25/3` (`Aux.tm_fourth_moment`, from `iteratedDeriv_mgf_zero` and the
+explicit fourth derivative `Aux.tm_iteratedDeriv_four`), and `∫ exp (-t^2/2) = sqrt (3/8)`
+(`Aux.tm_exp_moment`, from `integral_gaussianReal_eq_integral_smul` and `integral_gaussian`).
+Does not establish: the informal Section 1 display of the source as the source's object (the
+alignment of the interface fields `s`, `P`, `sxy_law` and of `gaussianReal` with the source's
+`s ~ N(0, 5/3)` is PENDING_INDEPENDENT_REVIEW); that any inhabitant of `ConeMomentInterface`
+exists, or that its laws are the conditional law `A | V = 0` of the reference field (the laws are
+hypothesis fields of the given `I`, not derived here); the main-side constants
+`UniversalLaw.Side24.fourth_moment_of_trace` and `exponential_moment_of_trace`, which
+kernel-check `3 (5/3)^2 = 25/3` and `1 + 5/3 = 8/3` on main and are neither imported nor
+re-stated here (the same arithmetic is discharged inline by `ring`); `ConeMomentD2Identity`,
+`RayleighSquareLaw` or any cone moment; any enclosure of the coefficient; the statement module's
+own `Does not claim:` text (the statement packet is not edited here); 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. -/
+theorem traceMoments (I : ConeMomentInterface) : UniversalLaw.Spec.Side24.TraceMoments I := by
+ unfold UniversalLaw.Spec.Side24.TraceMoments
+ refine ⟨?_, ?_, ?_⟩
+ · have e : ∫ ω, I.s ω ^ 2 ∂I.P = ∫ t, t ^ 2 ∂(gaussianReal 0 (5 / 3 : NNReal)) :=
+ Aux.tm_integral_comp_s I (fun t => t ^ 2) (by fun_prop)
+ rw [e, Aux.c1_second_moment_gaussianReal]
+ push_cast
+ ring
+ · have e : ∫ ω, I.s ω ^ 4 ∂I.P = ∫ t, t ^ 4 ∂(gaussianReal 0 (5 / 3 : NNReal)) :=
+ Aux.tm_integral_comp_s I (fun t => t ^ 4) (by fun_prop)
+ rw [e, Aux.tm_fourth_moment]
+ push_cast
+ ring
+ · have e : ∫ ω, Real.exp (-(I.s ω ^ 2) / 2) ∂I.P =
+ ∫ t, Real.exp (-(t ^ 2) / 2) ∂(gaussianReal 0 (5 / 3 : NNReal)) :=
+ Aux.tm_integral_comp_s I (fun t => Real.exp (-(t ^ 2) / 2)) (by fun_prop)
+ rw [e, Aux.tm_exp_moment]
+
+/-! ## The law of `R^2` for every inhabitant of the interface -/
+
+/-- Proves: `UniversalLaw.Spec.Side24.RayleighSquareLaw` (claim `side24-coefficient`).
+Method: for `a ≥ 0`, `P {x^2 + y^2 ≤ a}` is the measure of the closed disk of radius `sqrt a`
+under `gaussianReal 0 1 ⊗ gaussianReal 0 1` (`Aux.rl_prob_eq_disk_measure`, from the law
+`Aux.rl_law_xy` of `(x, y)` obtained as the second marginal of the interface's product law
+`sxy_law`, after `Aux.tm_aemeasurable_triple`, shared with `TraceMoments`, derives
+a.e.-measurability of the triple from the
+law by the Dirac-versus-`NullSingletonClass` argument); that disk measure is
+`ENNReal.ofReal (1 - exp (-a/2))` (`Aux.rl_disk_measure`: `prod_withDensity`,
+`withDensity_apply`, `ofReal_integral_eq_lintegral_ofReal`, then polar coordinates
+`integral_comp_polarCoord_symm` and `setIntegral_prod_mul` in `Aux.rl_disk_integral`, with the
+angular integral `2π` and the radial integral by the fundamental theorem of calculus); the
+right-hand side `∫_0^a exp (-z/2)/2 dz` is the same number `1 - exp (-a/2)`
+(`Aux.rl_rhs_integral`), and `ENNReal.toReal_ofReal` closes.
+Does not establish: the informal Section 1 display "The variable R^2 has density e^(-z/2)/2" of
+the source as the source's object, nor its review and acceptance (the alignment of the interface
+fields `x`, `y`, `P`, `sxy_law` and of `gaussianReal` with the source's `x, y ~ N(0, 1)` is
+PENDING_INDEPENDENT_REVIEW); from the Prop's own `Does not claim:` line, "the law (statement
+only)": the law is proved here only for the formal objects of the Prop, as the distribution
+function `P(R^2 ≤ a)` for `a ≥ 0`, not as a density and not for the source's variable; and
+"measurability of the event (if the event is not measurable, `P` is its outer measure)":
+the formal event `{x^2 + y^2 ≤ a}` is the preimage of the closed disk, a measurable set
+(`Aux.rl_measurableSet_disk`), under the a.e.-measurable coordinate map `(x, y)`
+(`Aux.rl_aemeasurable_xy`); `Measure.map_apply_of_aemeasurable` transports the measure along that
+map, so `P` of the event equals the disk measure under the law. The preimage is thereby
+null-measurable for `I.P` (`AEMeasurable.nullMeasurableSet_preimage`); `MeasurableSet` of the
+sample-space preimage is not asserted (`ConeMomentInterface` assumes neither that `I.P` is
+complete nor that the coordinate fields are measurable), and nothing is established about any
+other event; that any inhabitant of
+`ConeMomentInterface` exists, or that its laws are the conditional law `A | V = 0` of the
+reference field (the laws are hypothesis fields of the given `I`, not derived here);
+`ConeMomentD2Identity` or any cone moment; any enclosure of the coefficient; the statement
+module's own text (the statement packet is not edited here); 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. -/
+theorem rayleighSquareLaw (I : ConeMomentInterface) : UniversalLaw.Spec.Side24.RayleighSquareLaw I := by
+ unfold UniversalLaw.Spec.Side24.RayleighSquareLaw
+ intro a ha
+ rw [Aux.rl_prob_eq_disk_measure I a, Aux.rl_disk_measure a ha, Aux.rl_rhs_integral,
+ ENNReal.toReal_ofReal]
+ have : Real.exp (-a / 2) ≤ 1 := by
+ rw [Real.exp_le_one_iff]
+ linarith
+ linarith
+
+end UniversalLaw.Proofs.Side24Interfaces
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications.lean
new file mode 100644
index 000000000..e5b750c01
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications.lean
@@ -0,0 +1,5 @@
+import Specifications.Field
+import Specifications.Lifetime
+import Specifications.Side24
+import Specifications.RN
+import Specifications.P15
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Field.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Field.lean
new file mode 100644
index 000000000..cc40e9d19
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Field.lean
@@ -0,0 +1,380 @@
+import Mathlib
+
+/-!
+# Shared objects of the periodized Gaussian lifetime track (statements only)
+
+Scientific effect: NONE. Formal progress of every declaration here: `specified`.
+Organizational-independence credit of this transcription: 0 (Anthropic / Claude).
+
+This module declares, as definitions and interface structures, the objects that the
+Layer 0 texts of the lifetime track share: the periodized Gaussian covariance `K_L`
+(as a quotient of theta sums written with `tsum`), the centred stationary Gaussian field
+on the torus `R^d/(L Z^d)` (an interface: probability space, smooth `L`-periodic sample
+paths, Gaussian law of every finite real linear combination of point evaluations, and the
+covariance identity), critical points, the Hessian form through `iteratedFDeriv`, the
+inertia predicates for nondegenerate maxima and index-(d-1) saddles, ordered
+maximum/saddle pairs with their height gap and scaled gap, the superlevel H0 bar and
+elder-partner interface, and the per-unit-volume expected lifetime density "versions".
+
+What this module does not establish. It consists only of definitions and structures;
+it states nothing as a result and proves nothing. It does not construct the Gaussian
+field (the existence of a process with these finite-dimensional laws and smooth periodic
+sample paths is a hypothesis field), does not prove summability of the theta sums (a
+hypothesis field), does not identify the elder-partner relation with any Kac-Rice or
+persistence-module construction, does not show that lifetime density versions exist,
+does not assert almost-sure Morse genericity, and does not assert that an object
+satisfying an interface here coincides with the object of the source texts. Nothing here
+promotes, reclassifies or discharges any claim, premise or obligation of the registers;
+alignment of these statements with the sources is PENDING_INDEPENDENT_REVIEW.
+
+Primary source (Layer 0, byte-pinned): `d6g8k5htny-coder/Math-` commit
+`c39164254ad1529ed49543743598d5dcb24bab98`, path
+`imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md`,
+sha256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`
+(source id `lifetime-parent`).
+-/
+
+namespace UniversalLaw.Spec.Field
+
+open MeasureTheory
+
+/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised
+by `L`-periodic functions.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.
+Does not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/
+abbrev E (d : ℕ) : Type := EuclideanSpace ℝ (Fin d)
+
+/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: none.
+Does not claim: anything beyond the definition of the vector `L n`. -/
+noncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : E d :=
+ ∑ i, EuclideanSpace.single i (L * (n i : ℝ))
+
+/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,
+written as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;
+summability is a hypothesis field of `GaussianFieldInterface`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.
+Does not claim: convergence of the sum. -/
+noncomputable def thetaSum (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ ∑' n : Fin d → ℤ, Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2)
+
+/-- The periodized Gaussian covariance
+`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta
+sum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the
+summability field is meant to provide this; not shown here).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of both theta sums is the field `GaussianFieldInterface.summable`.
+Does not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/
+noncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ thetaSum d L z / thetaSum d L 0
+
+/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear
+combination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred
+stationary field with covariance `K_L`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.
+Does not claim: positive definiteness (Section 2 of the source). -/
+noncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) : ℝ :=
+ ∑ i, ∑ j, a i * a j * periodicCovariance d L (x i - x j)
+
+/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the defining predicate of a function on the torus.
+Does not claim: anything about the field. -/
+def IsLPeriodic (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ ∀ (x : E d) (n : Fin d → ℤ), g (x + latticeVec d L n) = g x
+
+/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "In particular the field has a smooth version and all finite moments of its global derivative suprema exist."
+Interface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.
+Does not claim: existence of a smooth version, or moment bounds on derivative suprema. -/
+def IsSmooth (d : ℕ) (g : E d → ℝ) : Prop :=
+ ∀ n : ℕ, ContDiff ℝ n g
+
+/-- Interface for the centred stationary Gaussian field of variance one on the torus
+`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample
+paths, their smoothness and periodicity, the Gaussian law of every finite real linear
+combination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic
+form) and the covariance identity are hypothesis fields, as is summability of the theta
+sums. Existence of such an object is not asserted.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: every field of this structure is a given property of the field, never derived.
+Does 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. -/
+structure GaussianFieldInterface (d : ℕ) (L : ℝ) where
+ /-- The underlying probability space (sample space). -/
+ Ω : Type
+ -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not
+ -- registered for typeclass resolution after this declaration; consumers bring it into
+ -- scope with `haveI := G.mΩ`.
+ [mΩ : MeasurableSpace Ω]
+ /-- The probability measure `P`. -/
+ P : Measure Ω
+ -- `P` is a probability measure (square-bracket field).
+ [isProb : IsProbabilityMeasure P]
+ /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/
+ F : Ω → E d → ℝ
+ /-- Section 2 clause: "the field has a smooth version"; every sample path is smooth. -/
+ smooth : ∀ ω, IsSmooth d (F ω)
+ /-- Section 1 clause: the field lives "On the flat torus X = R^d/(L Z^d)"; every sample path
+ is `L`-periodic. -/
+ periodic : ∀ ω, IsLPeriodic d L (F ω)
+ /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/
+ summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))
+ /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/
+ quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a
+ /-- Section 1 clause: "the centered stationary Gaussian field of variance one with covariance"
+ `K_L`; every finite real linear combination of point evaluations has the centred Gaussian
+ law whose variance is the `K_L`-quadratic form. -/
+ gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),
+ Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =
+ ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩
+ /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/
+ covariance : ∀ x y : E d, ∫ ω, F ω x * F ω y ∂P = periodicCovariance d L (x - y)
+
+/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet
+derivative: `hessian d g x v w = D^2 g(x)[v, w]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: symmetry of the form (true for `C^2` functions, not stated here). -/
+noncomputable def hessian (d : ℕ) (g : E d → ℝ) (x v w : E d) : ℝ :=
+ iteratedFDeriv ℝ 2 g x ![v, w]
+
+/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "grad f(M)=grad f(S)=0."
+Interface: none.
+Does not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/
+def IsCriticalPoint (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ fderiv ℝ g x = 0
+
+/-- Sylvester-inertia encoding of "the Hessian at `x` is nondegenerate with exactly `j`
+negative and `d - j` positive eigenvalues": there are complementary subspaces `V`, `W` of
+dimensions `j` and `d - j` on which the Hessian form is negative definite, respectively
+positive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)
+Hessians; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "The index counts negative eigenvalues."
+Interface: none.
+Does not claim: equivalence with an eigenvalue count for a non-symmetric form. -/
+def HessianHasInertia (d : ℕ) (g : E d → ℝ) (x : E d) (j : ℕ) : Prop :=
+ ∃ V W : Submodule ℝ (E d), IsCompl V W ∧
+ Module.finrank ℝ V = j ∧ Module.finrank ℝ W = d - j ∧
+ (∀ v ∈ V, v ≠ 0 → hessian d g x v v < 0) ∧
+ (∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)
+
+/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative
+eigenvalues (negative definite).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/
+def IsNondegMax (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x d
+
+/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one
+positive eigenvalue.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that such a saddle is a merging saddle of any superlevel bar. -/
+def IsIndexSaddle (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x (d - 1)
+
+/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinM (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ -((r / 2) • u)
+
+/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinS (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ (r / 2) • u
+
+/-- Torus distance between two points of `R^d`: the infimum over the lattice of
+`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the
+same torus point; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: that the height gap of an elder pair is the persistence of a bar in any persistence module. -/
+def heightGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=
+ g M - g S
+
+/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: positivity of the height gap (added separately where the source requires it). -/
+def IsCandidatePair (d : ℕ) (L : ℝ) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S
+
+/-- Morse genericity with distinct critical values on the torus: every critical point is
+nondegenerate (has some inertia) and critical points at distinct torus positions have
+distinct critical values.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Countable exhaustion now proves that Q is almost surely Morse with distinct critical values."
+Interface: none; used only as a hypothesis of the elder-partner interface clause.
+Does not claim: that sample paths are almost surely Morse (Section 8 of the source). -/
+def IsMorseDistinct (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ (∀ x : E d, IsCriticalPoint d g x → ∃ j : ℕ, HessianHasInertia d g x j) ∧
+ (∀ x y : E d, IsCriticalPoint d g x → IsCriticalPoint d g y →
+ 0 < torusDist d L x y → g x ≠ g y)
+
+/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:
+the maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary
+elder death partner relation. These are GIVEN relations; the fields transcribe the source
+clauses that characterise them on smooth periodic functions, and the elder relation is
+pinned only on the Morse distinct-value locus, exactly as the source does.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint."
+Interface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.
+Does 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. -/
+structure SuperlevelBarInterface (d : ℕ) (L : ℝ) where
+ /-- Section 8 clause: the maximin connection level
+ `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/
+ deathHeight : (E d → ℝ) → E d → ℝ
+ /-- The essential class: the global maximum, which "has no older endpoint" and whose
+ superlevel H0 bar is not finite. -/
+ IsEssential : (E d → ℝ) → E d → Prop
+ /-- Section 1 clause: "the global ordinary superlevel elder death partner of M is S". -/
+ ElderPartner : (E d → ℝ) → E d → E d → Prop
+ /-- `M` is essential exactly when no point is strictly higher (so the supremum in the
+ maximin is over an empty set, "equal to -infinity"). -/
+ essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M
+ /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly
+ higher point stays strictly above `h`. -/
+ deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,
+ h < deathHeight g M ↔
+ ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)
+ /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, "equality
+ d_f(M)=f(S)" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle "expresses
+ ordinary elder death at S". -/
+ elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →
+ ∀ M S : E d, ElderPartner g M S ↔
+ (IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)
+
+/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`
+(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus
+distance. The essential global-maximum class is excluded because `ElderPartner` requires
+`¬ IsEssential` on the Morse locus.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death."
+Interface: `I : SuperlevelBarInterface d L` is given.
+Does 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. -/
+def IsFiniteBar (d : ℕ) (L : ℝ) (I : SuperlevelBarInterface d L) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S
+
+/-- The set of pairs of a population `Pair` with both points in the fundamental domain and
+lifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of this set (a field of the density-version predicate). -/
+def pairSet (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop) (g : E d → ℝ) (A : Set ℝ) :
+ Set (E d × E d) :=
+ {p | p.1 ∈ FundDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}
+
+/-- Number of pairs of the population with lifetime in `A` and base points in the
+fundamental domain (`Set.ncard`, which is `0` for an infinite set).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of the counted set. -/
+noncomputable def pairCount (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop)
+ (g : E d → ℝ) (A : Set ℝ) : ℕ :=
+ Set.ncard (pairSet d L Pair g A)
+
+/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population
+`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost
+surely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and
+`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.
+The source's densities are only defined up to such versions. The sigma-algebra of the sample
+space is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket
+field of a bundled record is not registered for typeclass resolution after the declaration).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "These densities admit versions with"
+Interface: 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.
+Does 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. -/
+def IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (Pair : (E d → ℝ) → E d → E d → Prop) (ν : ℝ → ℝ) : Prop :=
+ haveI := G.mΩ
+ (∀ ℓ : ℝ, 0 ≤ ν ℓ) ∧ Measurable ν ∧
+ (∀ A : Set ℝ, MeasurableSet A → A ⊆ Set.Ioi 0 →
+ (∀ᵐ ω ∂G.P, (pairSet d L Pair (G.F ω) A).Finite) ∧
+ Integrable (fun ω => ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ)) G.P ∧
+ IntegrableOn ν A ∧
+ ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)
+
+end UniversalLaw.Spec.Field
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Lifetime.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Lifetime.lean
new file mode 100644
index 000000000..f2508f7f2
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Lifetime.lean
@@ -0,0 +1,634 @@
+import Mathlib
+
+/-!
+# Lifetime-track statements: parent Theorems A, B, C, the bounded remainder R and the
+# planar elder lower bound / density gap (statements only)
+
+Scientific effect: NONE. Formal progress of every declaration here: `specified`.
+Organizational-independence credit of this transcription: 0 (Anthropic / Claude).
+
+This module states, as `Prop`-valued definitions, the shapes of the parent lifetime
+results (1.1), (1.2), (1.3) of UNIFORM_MATRIX_CAP_AND_LIFETIME.md, of the bounded
+remainder (R1) of LIFETIME_REMAINDER.md, and of the planar lower bound (E2), the
+two-sided rate (E4) and the compact-window density gap (E11) of
+ELDER_LOWER_AND_DENSITY_GAP.md. Every statement is parametrised by interface objects
+(the Gaussian field, the superlevel-bar / elder-partner relation, and the typed pair law
+probability `p_r(b,k,R)`); it is a statement about whatever objects satisfy those
+interfaces, and the identification of those objects with the objects of the source texts
+is not part of the statement.
+
+This module is self-contained: it imports only Mathlib and re-declares, verbatim up to
+the namespace, the shared objects of `Specifications/Field.lean` (covariance, field
+interface, critical points, Hessian inertia, pairs, superlevel bars, density versions).
+The duplication is deliberate at this layer and is recorded as such.
+
+What this module does not establish. It consists only of definitions and structures;
+it states nothing as a result and proves nothing: none of the parent results, the
+remainder bound or the planar bounds is shown here, and no kernel receipt about them
+exists. It does not transcribe the explicit Gaussian/angular integral (15.2) for the
+leading coefficient `c_{d,L}` (the coefficient is characterised only through the
+leading-term asymptotics of (1.3)); it does not transcribe the regression law
+`Q_{r,b,k,R}`, the typed weight `W_r`, the full normalizer `Z_r` or the marked Kac-Rice
+representation (all informal in the source and taken as the interface field `p`); it
+does not transcribe the reading-rule amendments bound to the parent (congruence erratum,
+Section 9 replacement v1.1, wording W1, embedding radius `r < L/(4 sqrt 2)`), nor the
+marked-cylinder cap support; it asserts no numerical `C`, `r_*`, `z_*`, `ell_*` or
+coefficient value; it does not state Theorem A as consumed by Theorem R; and it does
+not state the compact-window `O(ell^(2/3))` difference for the unrestricted densities.
+The planar statements (E4) and (E11) carry the parent upper bound (1.1), for the same
+typed pair law at `d = 2`, as an explicit hypothesis, as the source does ("If the precise
+Theorem A upper bound in [LP] is consumed"; its Section 4 says the upper half of (E11)
+consumes the parent upper bound already identified there); the direct lower bound (E2) is
+unconditional, as in the source.
+Nothing here promotes, reclassifies or discharges any claim, premise or obligation of
+the registers; the landing disposition `REVIEWED_SCOPED` (lifetime-remainder) and the
+graph classification and review disposition recorded for
+`math.uniform-matrix-cap-lifetime` are transcribed from the registers by the statement
+register, never re-derived here; alignment of these statements with the sources is
+PENDING_INDEPENDENT_REVIEW.
+
+Sources (Layer 0, byte-pinned, `d6g8k5htny-coder/Math-`):
+* `lifetime-parent`: commit `c39164254ad1529ed49543743598d5dcb24bab98`, path
+ `imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md`,
+ sha256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`.
+* `lifetime-remainder`: commit `760340e921ac4ceda296b8118da936f1133e956e`, path
+ `frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md`,
+ sha256 `380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a`.
+* `elder-lower-density-gap`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md`,
+ sha256 `8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c`.
+-/
+
+namespace UniversalLaw.Spec.Lifetime
+
+open MeasureTheory
+
+/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same text, this
+namespace). The duplication is deliberate: modules of this packet import only Mathlib. -/
+
+/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised
+by `L`-periodic functions.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.
+Does not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/
+abbrev E (d : ℕ) : Type := EuclideanSpace ℝ (Fin d)
+
+/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: none.
+Does not claim: anything beyond the definition of the vector `L n`. -/
+noncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : E d :=
+ ∑ i, EuclideanSpace.single i (L * (n i : ℝ))
+
+/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,
+written as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;
+summability is a hypothesis field of `GaussianFieldInterface`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.
+Does not claim: convergence of the sum. -/
+noncomputable def thetaSum (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ ∑' n : Fin d → ℤ, Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2)
+
+/-- The periodized Gaussian covariance
+`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta
+sum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the
+summability field is meant to provide this; not shown here).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of both theta sums is the field `GaussianFieldInterface.summable`.
+Does not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/
+noncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ thetaSum d L z / thetaSum d L 0
+
+/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear
+combination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred
+stationary field with covariance `K_L`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.
+Does not claim: positive definiteness (Section 2 of the source). -/
+noncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) : ℝ :=
+ ∑ i, ∑ j, a i * a j * periodicCovariance d L (x i - x j)
+
+/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the defining predicate of a function on the torus.
+Does not claim: anything about the field. -/
+def IsLPeriodic (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ ∀ (x : E d) (n : Fin d → ℤ), g (x + latticeVec d L n) = g x
+
+/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "In particular the field has a smooth version and all finite moments of its global derivative suprema exist."
+Interface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.
+Does not claim: existence of a smooth version, or moment bounds on derivative suprema. -/
+def IsSmooth (d : ℕ) (g : E d → ℝ) : Prop :=
+ ∀ n : ℕ, ContDiff ℝ n g
+
+/-- Interface for the centred stationary Gaussian field of variance one on the torus
+`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample
+paths, their smoothness and periodicity, the Gaussian law of every finite real linear
+combination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic
+form) and the covariance identity are hypothesis fields, as is summability of the theta
+sums. Existence of such an object is not asserted.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: every field of this structure is a given property of the field, never derived.
+Does 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. -/
+structure GaussianFieldInterface (d : ℕ) (L : ℝ) where
+ /-- The underlying probability space (sample space). -/
+ Ω : Type
+ -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not
+ -- registered for typeclass resolution after this declaration; consumers bring it into
+ -- scope with `haveI := G.mΩ`.
+ [mΩ : MeasurableSpace Ω]
+ /-- The probability measure `P`. -/
+ P : Measure Ω
+ -- `P` is a probability measure (square-bracket field).
+ [isProb : IsProbabilityMeasure P]
+ /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/
+ F : Ω → E d → ℝ
+ /-- Section 2 clause: "the field has a smooth version"; every sample path is smooth. -/
+ smooth : ∀ ω, IsSmooth d (F ω)
+ /-- Section 1 clause: the field lives "On the flat torus X = R^d/(L Z^d)"; every sample path
+ is `L`-periodic. -/
+ periodic : ∀ ω, IsLPeriodic d L (F ω)
+ /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/
+ summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))
+ /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/
+ quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a
+ /-- Section 1 clause: "the centered stationary Gaussian field of variance one with covariance"
+ `K_L`; every finite real linear combination of point evaluations has the centred Gaussian
+ law whose variance is the `K_L`-quadratic form. -/
+ gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),
+ Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =
+ ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩
+ /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/
+ covariance : ∀ x y : E d, ∫ ω, F ω x * F ω y ∂P = periodicCovariance d L (x - y)
+
+/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet
+derivative: `hessian d g x v w = D^2 g(x)[v, w]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: symmetry of the form (true for `C^2` functions, not stated here). -/
+noncomputable def hessian (d : ℕ) (g : E d → ℝ) (x v w : E d) : ℝ :=
+ iteratedFDeriv ℝ 2 g x ![v, w]
+
+/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "grad f(M)=grad f(S)=0."
+Interface: none.
+Does not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/
+def IsCriticalPoint (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ fderiv ℝ g x = 0
+
+/-- Sylvester-inertia encoding of "the Hessian at `x` is nondegenerate with exactly `j`
+negative and `d - j` positive eigenvalues": there are complementary subspaces `V`, `W` of
+dimensions `j` and `d - j` on which the Hessian form is negative definite, respectively
+positive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)
+Hessians; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "The index counts negative eigenvalues."
+Interface: none.
+Does not claim: equivalence with an eigenvalue count for a non-symmetric form. -/
+def HessianHasInertia (d : ℕ) (g : E d → ℝ) (x : E d) (j : ℕ) : Prop :=
+ ∃ V W : Submodule ℝ (E d), IsCompl V W ∧
+ Module.finrank ℝ V = j ∧ Module.finrank ℝ W = d - j ∧
+ (∀ v ∈ V, v ≠ 0 → hessian d g x v v < 0) ∧
+ (∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)
+
+/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative
+eigenvalues (negative definite).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/
+def IsNondegMax (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x d
+
+/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one
+positive eigenvalue.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that such a saddle is a merging saddle of any superlevel bar. -/
+def IsIndexSaddle (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x (d - 1)
+
+/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinM (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ -((r / 2) • u)
+
+/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinS (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ (r / 2) • u
+
+/-- Torus distance between two points of `R^d`: the infimum over the lattice of
+`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the
+same torus point; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: that the height gap of an elder pair is the persistence of a bar in any persistence module. -/
+def heightGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=
+ g M - g S
+
+/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: positivity of the height gap (added separately where the source requires it). -/
+def IsCandidatePair (d : ℕ) (L : ℝ) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S
+
+/-- Morse genericity with distinct critical values on the torus: every critical point is
+nondegenerate (has some inertia) and critical points at distinct torus positions have
+distinct critical values.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Countable exhaustion now proves that Q is almost surely Morse with distinct critical values."
+Interface: none; used only as a hypothesis of the elder-partner interface clause.
+Does not claim: that sample paths are almost surely Morse (Section 8 of the source). -/
+def IsMorseDistinct (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ (∀ x : E d, IsCriticalPoint d g x → ∃ j : ℕ, HessianHasInertia d g x j) ∧
+ (∀ x y : E d, IsCriticalPoint d g x → IsCriticalPoint d g y →
+ 0 < torusDist d L x y → g x ≠ g y)
+
+/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:
+the maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary
+elder death partner relation. These are GIVEN relations; the fields transcribe the source
+clauses that characterise them on smooth periodic functions, and the elder relation is
+pinned only on the Morse distinct-value locus, exactly as the source does.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint."
+Interface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.
+Does 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. -/
+structure SuperlevelBarInterface (d : ℕ) (L : ℝ) where
+ /-- Section 8 clause: the maximin connection level
+ `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/
+ deathHeight : (E d → ℝ) → E d → ℝ
+ /-- The essential class: the global maximum, which "has no older endpoint" and whose
+ superlevel H0 bar is not finite. -/
+ IsEssential : (E d → ℝ) → E d → Prop
+ /-- Section 1 clause: "the global ordinary superlevel elder death partner of M is S". -/
+ ElderPartner : (E d → ℝ) → E d → E d → Prop
+ /-- `M` is essential exactly when no point is strictly higher (so the supremum in the
+ maximin is over an empty set, "equal to -infinity"). -/
+ essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M
+ /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly
+ higher point stays strictly above `h`. -/
+ deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,
+ h < deathHeight g M ↔
+ ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)
+ /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, "equality
+ d_f(M)=f(S)" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle "expresses
+ ordinary elder death at S". -/
+ elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →
+ ∀ M S : E d, ElderPartner g M S ↔
+ (IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)
+
+/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`
+(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus
+distance. The essential global-maximum class is excluded because `ElderPartner` requires
+`¬ IsEssential` on the Morse locus.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death."
+Interface: `I : SuperlevelBarInterface d L` is given.
+Does 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. -/
+def IsFiniteBar (d : ℕ) (L : ℝ) (I : SuperlevelBarInterface d L) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S
+
+/-- The set of pairs of a population `Pair` with both points in the fundamental domain and
+lifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of this set (a field of the density-version predicate). -/
+def pairSet (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop) (g : E d → ℝ) (A : Set ℝ) :
+ Set (E d × E d) :=
+ {p | p.1 ∈ FundDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}
+
+/-- Number of pairs of the population with lifetime in `A` and base points in the
+fundamental domain (`Set.ncard`, which is `0` for an infinite set).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of the counted set. -/
+noncomputable def pairCount (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop)
+ (g : E d → ℝ) (A : Set ℝ) : ℕ :=
+ Set.ncard (pairSet d L Pair g A)
+
+/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population
+`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost
+surely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and
+`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.
+The source's densities are only defined up to such versions. The sigma-algebra of the sample
+space is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket
+field of a bundled record is not registered for typeclass resolution after the declaration).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "These densities admit versions with"
+Interface: 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.
+Does 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. -/
+def IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (Pair : (E d → ℝ) → E d → E d → Prop) (ν : ℝ → ℝ) : Prop :=
+ haveI := G.mΩ
+ (∀ ℓ : ℝ, 0 ≤ ν ℓ) ∧ Measurable ν ∧
+ (∀ A : Set ℝ, MeasurableSet A → A ⊆ Set.Ioi 0 →
+ (∀ᵐ ω ∂G.P, (pairSet d L Pair (G.F ω) A).Finite) ∧
+ Integrable (fun ω => ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ)) G.P ∧
+ IntegrableOn ν A ∧
+ ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)
+
+/-! ### Populations of pairs -/
+
+/-- Compact-window population of Theorem B: ordered maximum / index-(d-1)-saddle pairs with
+`0 < distance <= ρ`, birth `f(M)` in `B = [bLo, bHi]` and scaled gap in `K = [kLo, kHi]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none beyond the shared predicates.
+Does not claim: anything about the off-diagonal (far) population separately (Section 14 of the source). -/
+def IsUnrestrictedPair (d : ℕ) (L : ℝ) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsCandidatePair d L g M S ∧ 0 < heightGap d g M S
+
+/-! ### The typed pair law as an interface -/
+
+/-- Interface for the weighted regression (typed pair) law: the only object consumed by the
+statements is the probability `p_r(b,k,R)` that the global ordinary superlevel elder death
+partner of the pinned maximum `M = -(r/2)u` is the pinned saddle `S = (r/2)u`, under the
+law `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}`.
+That law, its weight, its normalizer and the regression construction are informal in the
+source and are NOT transcribed; `p` is a GIVEN function of radius `r`, birth `b`, gap mark
+`k` and orthonormal frame `R` with values in `[0, 1]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S."
+Interface: `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.
+Does 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). -/
+structure PairLawInterface (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) where
+ /-- Section 1 clause: "Let p_r(b,k,R) be the Q^W probability that the global ordinary
+ superlevel elder death partner of M is S." -/
+ p : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → ℝ
+ /-- `p` is a probability: nonnegative. -/
+ p_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 ≤ p r b k R
+ /-- `p` is a probability: at most one. -/
+ p_le_one : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), p r b k R ≤ 1
+
+/-! ### The parent statements (1.1), (1.2), (1.3) -/
+
+/-- Shape of Theorem A (1.1), uniform selection candidate: for fixed `d ≥ 2`, `L > 0`,
+compact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo ≤ kHi`, there exist `r_* > 0`
+and `C` (quantified OUTSIDE the universal quantifiers over `r`, `b`, `k` and the frame)
+such that `0 <= 1 - p_r(b,k,R) <= C r^3` for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K` and all
+orthonormal frames `R`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "There exist r_*>0 and C 0` and
+windows `B`, `K` of positive length with `kLo > 0`, there are a distance cutoff `r_* > 0`, a
+constant `c_{B,K} > 0` and a constant `C_{B,K}` such that the compact-window candidate and
+elder lifetime densities admit versions `νc`, `νe` with `νc(ℓ) ~ c_{B,K} ℓ^(-1/3)`,
+`νe(ℓ) ~ c_{B,K} ℓ^(-1/3)` as `ℓ ↓ 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and
+`0 ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all sufficiently small `ℓ > 0`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),"
+Interface: `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).
+Does 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. -/
+def ParentCompactWindowDensityB (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo < bHi → 0 < kLo → kLo < kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ c : ℝ, 0 < c ∧ ∃ C : ℝ, ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsWindowPair d L rStar bLo bHi kLo kHi) νc ∧
+ IsLifetimeDensityVersion d L G (IsWindowElderPair d L rStar bLo bHi kLo kHi I) νe ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νc
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ ∃ ℓStar : ℝ, 0 < ℓStar ∧ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3)
+
+/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and
+versions `νc`, `νe` of the unrestricted candidate density and of the finite ordinary
+superlevel H0 bar density satisfy `νc(ℓ) ~ c ℓ^(-1/3)` and `νe(ℓ) ~ c ℓ^(-1/3)` as `ℓ ↓ 0`.
+The essential global-maximum class is excluded from `νe` through `IsFiniteBar`. This is the
+conclusion of (1.3) for a given `c`; it characterises `c_{d,L}` by its leading-term role,
+not by the integral (13.6)/(15.2).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "There is a positive finite constant c_{d,L} such that"
+Interface: `G` and `I` are given; versions are characterised by the integral identity only.
+Does 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. -/
+def IsUnrestrictedLeadingCoefficient (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) (c : ℝ) : Prop :=
+ 0 < c ∧ ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsUnrestrictedPair d L) νc ∧
+ IsLifetimeDensityVersion d L G (IsFiniteBar d L I) νe ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νc
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3))
+
+/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for
+fixed `d ≥ 2` and `L > 0` there is a positive finite constant `c_{d,L}` such that the
+unrestricted candidate density and the finite ordinary superlevel H0 bar density (all birth
+heights, all positive gap marks, all separations; essential global maximum excluded) admit
+versions with `ν(ℓ) ~ c_{d,L} ℓ^(-1/3)` as `ℓ ↓ 0`. Leading term only.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),"
+Interface: `G` and `I` are given; versions are characterised by the integral identity only.
+Does 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. -/
+def ParentUnrestrictedLeadingDensityC (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) : Prop :=
+ 2 ≤ d → 0 < L → ∃ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c
+
+/-! ### The bounded remainder (R1) -/
+
+/-- Shape of Theorem R (R1), bounded unrestricted short-lifetime remainder: for fixed
+`d ≥ 2`, `L > 0` and with `c = c_{d,L}` the parent leading coefficient (characterised here
+by `IsUnrestrictedLeadingCoefficient`), there are `ell_* > 0` and `C` such that versions of
+the unrestricted candidate and finite-bar densities satisfy, for `0 < ℓ ≤ ell_*`,
+`|νc(ℓ) - c ℓ^(-1/3)| ≤ C`, `0 ≤ νc(ℓ) - νe(ℓ) ≤ C` and `|νe(ℓ) - c ℓ^(-1/3)| ≤ C`.
+The `O(1)` remainder is stated with an explicit absolute-value bound.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md sha256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a
+Anchor: "|nu_cand(ell)-c ell^(-1/3)| <= C,"
+Interface: `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).
+Does 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. -/
+def RemainderBoundedR1 (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) : Prop :=
+ 2 ≤ d → 0 < L → ∀ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c →
+ ∃ ℓStar : ℝ, 0 < ℓStar ∧ ∃ C : ℝ, ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsUnrestrictedPair d L) νc ∧
+ IsLifetimeDensityVersion d L G (IsFiniteBar d L I) νe ∧
+ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ |νc ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C ∧
+ 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C ∧
+ |νe ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C
+
+/-! ### Planar elder lower bound and density gap (d = 2) -/
+
+/-- Shape of the planar direct lower bound (E2): on the fixed planar torus (`d = 2`), with
+birth `b` in a fixed compact interval, `k ∈ [kLo, kHi]` with `kLo > 0` and frames ranging
+over `O(2)`, there are `c > 0` and `r_* > 0` such that `1 - p_r(b,k,R) ≥ c r^3` for all
+`0 < r ≤ r_*`, uniformly in `b`, `k` and the frame.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c
+Anchor: "1-p_r(b,k,R) >= c r^3, 0 0` there are a distance cutoff
+`r_* > 0`, constants `c_{B,K} > 0`, `C_{B,K}` and `ell_* > 0` such that versions of the
+compact-window candidate and ordinary elder densities satisfy
+`c_{B,K} ℓ^(2/3) ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all `0 < ℓ ≤ ell_*`. The parent upper
+input is an explicit hypothesis, not folded into the conclusion. The lower half, which the
+source derives from (E2) alone, is stated under the same hypothesis because the source displays
+(E11) as one two-sided inequality; that is a hypothesis the source does not need for the lower
+half, recorded here as such.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c
+Anchor: " <= C_{B,K} ell^(2/3). (E11)"
+Interface: `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.
+Does 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. -/
+def PlanarDensityGapE11 (L : ℝ) (G : GaussianFieldInterface 2 L) (I : SuperlevelBarInterface 2 L)
+ (PL : PairLawInterface 2 L G I) (bLo bHi kLo kHi : ℝ) : Prop :=
+ ParentUniformSelectionA 2 L G I PL bLo bHi kLo kHi →
+ (0 < L → bLo < bHi → 0 < kLo → kLo < kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ c : ℝ, 0 < c ∧ ∃ C : ℝ, ∃ ℓStar : ℝ, 0 < ℓStar ∧
+ ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion 2 L G (IsWindowPair 2 L rStar bLo bHi kLo kHi) νc ∧
+ IsLifetimeDensityVersion 2 L G (IsWindowElderPair 2 L rStar bLo bHi kLo kHi I) νe ∧
+ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ c * ℓ ^ ((2 : ℝ) / 3) ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3))
+
+end UniversalLaw.Spec.Lifetime
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/P15.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/P15.lean
new file mode 100644
index 000000000..3544d4306
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/P15.lean
@@ -0,0 +1,1161 @@
+import Mathlib
+
+/-!
+# P15 realized covers, price boundary, restricted and full transformed-price budgets (statements only)
+
+Scientific effect: NONE. Formal progress of every declaration here: `specified`.
+Organizational-independence credit of this transcription: 0 (Anthropic / Claude).
+
+This module transcribes, as definitions and `Prop`-valued specifications, the finite
+combinatorics of four Layer 0 notes of `d6g8k5htny-coder/Math-` at commit
+`760340e921ac4ceda296b8118da936f1133e956e`:
+
+* `frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md` (P15-REALIZED-COVERS-20260924-v1,
+ source id `p15-realized-covers`): the realized capacity/clutter family, its downset `D` (P1),
+ the actual local restrictions (P2), the local covers (P3)-(P5), the palette demand `K_H(d)`
+ (P6), the full-block cover criterion (P7), the capped hazard bound (P8), the elementary
+ palette formula (P9), and the six-block 816-label realization with its counts (P10) and its
+ union bound (P11);
+* `frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md` (P15-PRICE-BOUNDARY-20260924-v1,
+ source id `p15-price-boundary`): the exact two-coordinate refutation of the same-palette
+ transformed-price extension at demand one;
+* `frontiers/price_budget_20260924/PROOF.md` (P15-TRANSFORMED-PRICE-BUDGET-20260924-v1, source
+ id `p15-price-budget`): the restricted budget (T1) with factor `16/27` for `p_v <= 1/4` and
+ `d_i >= 2`, its local displays (T2)-(T5), and the 816-label consequence (T7);
+* `frontiers/full_price_20260924/PROOF.md` (P15-FULL-TRANSFORMED-PRICE-20260924-v1, source id
+ `p15-full-price`): the full-cube budget (F2) with the constant `rho_star = 1/(3 - log(3e - 2))`,
+ its enclosure (F3), the hazard interpolation bounds (F6)-(F8), the capacity worst case
+ (F9)-(F11), the assembly (F12)-(F13), the sharpness and demand-one boundary of Section 5 and
+ the rational certificates of Section 6.
+
+Because the domain is finite combinatorics, everything is DEFINED rather than given by
+interface fields: a realized family is a data record `RealizedData` (finite ground type,
+block map, capacities, demands, clutter) and its side conditions are one `Prop`
+(`IsRealizedFamily`), so that the concrete realizations of the sources (`benchmark816`,
+`twoCoord`, `tripleBlock`, `demandOneBlock`) are plain definitions without embedded proofs.
+Two conventions are made explicit where the sources use extended arithmetic: the hazard
+`-log 0 = +infinity` is rendered by `cappedHazard`, which returns the cap `1` when the
+probability is zero (the sources: "the trivial price-one cover handles the endpoint"), and
+`phi(1) = 1` is rendered by a guard in `phi`. The palette demand `K_H(d)` is `sInf` of the
+feasible palette sizes; the sources call it "the minimum size K", and that the feasible set is
+nonempty (so that `sInf` is a minimum) is NOT proved here but stated as `PaletteNumberAttained`.
+The cover cost is `sInf` of the prices of all generator covers, a finite nonempty set of reals.
+
+What this module does not establish. It consists only of definitions and `Prop`s; it states
+nothing as a result and proves nothing. It does not establish (P7), (P8), (T1), (F2), the
+enclosure (F3), `rho_star < 6/7`, any count of (P10), the union bound (P11), the refutation of
+the demand-one extension, or any of the displayed inequalities; it does not identify these
+realized families with any earlier abstract P15 benchmark; it does not touch original P15-B
+or the unrestricted P15 prize. The arithmetic skeleton of several displays (the two-coordinate
+prices `9, 6, 6, 4` over `9`, `3/4` over `4`, `1/3 < 4/9`; the counts `500616` and
+`419743994415`; `2449227/8180000000 < 3/10000`; `16/27 < 6/7`; the adjacency of the (F3)
+endpoints and `upper * 7 < 6 * 10^20`) is the target of the core-Lean package
+`formal/UniversalLaw/P15/*` on main and is not re-stated as a result here. Nothing here
+promotes, reclassifies or discharges any claim, premise or obligation of the registers;
+alignment of these statements with the sources is PENDING_INDEPENDENT_REVIEW. Finite
+`Prop`s about the concrete realizations (`twoCoord`, `tripleBlock`, the palette numbers of small
+clutters) are decidable in principle and are future kernel-proof targets; the `Prop`s about
+`benchmark816` quantify over `2^2454` subsets and are finite but not decidable in practice.
+
+Primary sources (Layer 0, byte-pinned): `d6g8k5htny-coder/Math-` commit
+`760340e921ac4ceda296b8118da936f1133e956e`; sha256 of the four paths:
+`c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9` (realized covers),
+`498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b` (price boundary),
+`3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535` (price budget),
+`87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9` (full price).
+-/
+
+namespace UniversalLaw.Spec.P15
+
+/-! ## Product measure, prices, the transformed price `phi` and the capped hazard -/
+
+/-- Independent-coordinate weight of a subset `U` of a finite ground type `Y` under the
+probability vector `p`: `prod_{v in U} p_v * prod_{v notin U} (1 - p_v)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "Select the ORIGINAL coordinates independently with arbitrary probabilities p_v in [0,1], and let 0<=c_v<=p_v."
+Interface: none; `p` is any real vector (the sources take `p_v in [0,1]`, imposed as a hypothesis where used).
+Does not claim: that these weights sum to one over all subsets (not stated separately). -/
+noncomputable def weight {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ) (U : Finset Y) : ℝ :=
+ (∏ v ∈ U, p v) * ∏ v ∈ Finset.univ \ U, (1 - p v)
+
+/-- Product-measure mass `mu_p(A)` of a finite family `A` of subsets of a finite ground type:
+the sum of the weights of its members.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: "F_A(t)=-log mu_(p(t))(A),"
+Interface: none.
+Does not claim: anything; this is the probability that the random set of independently selected coordinates lies in `A`. -/
+noncomputable def muOf {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))
+ (p : Y → ℝ) : ℝ :=
+ ∑ U ∈ A, weight p U
+
+/-- Price of a generator `g`: `product_(v in g) c_v`; the empty generator has price `1`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "A generator's price is product_(v in g)c_v, and family price is the sum of generator prices."
+Interface: none.
+Does not claim: anything. -/
+noncomputable def genPrice {Y : Type} (c : Y → ℝ) (g : Finset Y) : ℝ :=
+ ∏ v ∈ g, c v
+
+/-- Price of a generator family `G`: the sum of its generator prices; the empty family has
+price `0`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "The empty generator has price1; the empty family has price0."
+Interface: none.
+Does not claim: anything. -/
+noncomputable def famPrice {Y : Type} (c : Y → ℝ) (G : Finset (Finset Y)) : ℝ :=
+ ∑ g ∈ G, genPrice c g
+
+/-- The transformed price ceiling `phi(t) = min(1, -log(1 - t))` with `phi(1) = 1`. The guard
+`t < 1` renders the source's convention at `t = 1` (Mathlib's `Real.log 0 = 0` would otherwise
+give `0`); for `t > 1`, outside the source's domain, the value `1` is a placeholder.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "where phi(t)=min(1,-log(1-t)), phi(1)=1."
+Interface: none.
+Does not claim: any value outside `[0, 1]`. -/
+noncomputable def phi (t : ℝ) : ℝ :=
+ if t < 1 then min 1 (-Real.log (1 - t)) else 1
+
+/-- The capped, scaled hazard `min(1, rho * [-log m])` of a probability `m`, with the sources'
+convention that the hazard of a zero probability is `+infinity`, so that the cap `1` applies:
+`cappedHazard rho m = 1` when `m <= 0`. With `rho = 1` this is `min(1, -log mu_p(D))` of (P8);
+with `rho = 16/27` the right side of (T1); with `rho = rho_star` the right side of (F2).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "If some q_i=1 the trivial price-one cover handles the endpoint."
+Interface: none.
+Does not claim: anything; the branch at `m <= 0` is the sources' endpoint convention, not a result. -/
+noncomputable def cappedHazard (ρ m : ℝ) : ℝ :=
+ if 0 < m then min 1 (ρ * (-Real.log m)) else 1
+
+/-! ## The realized capacity/clutter family -/
+
+/-- Data of a realized family on a finite ground type `X`: `b` blocks, the block map `blk`
+(the blocks `X_i` are its fibres, hence disjoint and covering), capacities `a_i`, demands `d_i`
+and the clutter `H` of forbidden block supports. The side conditions of the sources are the
+separate `Prop` `IsRealizedFamily`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "Choose positive integers a_i,d_i and disjoint original-coordinate blocks X_i with"
+Interface: none; every field is a finite datum, nothing is a hypothesis field.
+Does not claim: that the data satisfy the sources' side conditions (that is `IsRealizedFamily`). -/
+structure RealizedData (X : Type) where
+ /-- The number of blocks. -/
+ b : ℕ
+ /-- The block of each original coordinate. -/
+ blk : X → Fin b
+ /-- The capacities `a_i`. -/
+ a : Fin b → ℕ
+ /-- The demands `d_i`. -/
+ d : Fin b → ℕ
+ /-- The clutter `H` of forbidden block supports. -/
+ H : Finset (Finset (Fin b))
+
+/-- The original-coordinate block `X_i = {v : blk v = i}`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "disjoint original-coordinate blocks X_i"
+Interface: none.
+Does not claim: anything. -/
+def block {X : Type} [Fintype X] (F : RealizedData X) (i : Fin F.b) : Finset X :=
+ Finset.univ.filter (fun v => F.blk v = i)
+
+/-- The side conditions of the realized family: `a_i >= 1`, `d_i >= 1` ("positive integers
+a_i,d_i"), `|X_i| = a_i d_i + 1`, every edge of `H` has size at least `2`, and `H` is a clutter
+(no edge properly contains another; edges are distinct as members of a `Finset`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: " n_i=|X_i|=a_i d_i+1."
+Interface: none; this `Prop` IS the interface of the sources, stated for a data record.
+Does not claim: that any particular data record satisfies it. -/
+def IsRealizedFamily {X : Type} [Fintype X] (F : RealizedData X) : Prop :=
+ (∀ i, 1 ≤ F.a i) ∧ (∀ i, 1 ≤ F.d i) ∧ (∀ i, (block F i).card = F.a i * F.d i + 1) ∧
+ (∀ e ∈ F.H, 2 ≤ e.card) ∧ (∀ e ∈ F.H, ∀ f ∈ F.H, e ⊆ f → e = f)
+
+/-- The block support `supp(U) = {i : U intersect X_i is nonempty}`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "supp(U)={i:U intersect X_i is nonempty}. (P1)"
+Interface: none.
+Does not claim: anything. -/
+def supp {X : Type} (F : RealizedData X) (U : Finset X) : Finset (Fin F.b) :=
+ U.image F.blk
+
+/-- Membership in the downset `D` of display (P1): `|U intersect X_i| <= a_i` for every `i`, and
+`supp(U)` contains no edge of `H`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "D={U subset X: |U intersect X_i|<=a_i for every i,"
+Interface: none.
+Does not claim: that `D` is decreasing or contains the empty set (facts of the sources, not stated separately). -/
+def IsGood {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (U : Finset X) : Prop :=
+ (∀ i, (U ∩ block F i).card ≤ F.a i) ∧ ∀ e ∈ F.H, ¬ e ⊆ supp F U
+
+/-- The downset `D` as a set of subsets of `X`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: " supp(U) contains no edge of H},"
+Interface: none.
+Does not claim: anything. -/
+def downset {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) : Set (Finset X) :=
+ {U | IsGood F U}
+
+/-- `U in I_k(D)`: `U` is partitionable into at most `k` members of `D` (a family of `k`
+pairwise disjoint good parts, possibly empty, with union `U`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "write I_k(D) for sets partitionable into at most k members of D"
+Interface: none.
+Does not claim: equivalence with coverings by at most `k` good sets (true for a decreasing family, not stated). -/
+def IsKDecomposable {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (k : ℕ)
+ (U : Finset X) : Prop :=
+ ∃ parts : Fin k → Finset X, (∀ j, IsGood F (parts j)) ∧
+ (∀ j j', j ≠ j' → Disjoint (parts j) (parts j')) ∧
+ (Finset.univ : Finset (Fin k)).biUnion parts = U
+
+/-- The obstruction `O_K(D) = 2^X \ I_K(D)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "O_k(D)=2^X\I_k(D) for its obstruction"
+Interface: none.
+Does not claim: anything. -/
+def obstruction {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (K : ℕ) :
+ Set (Finset X) :=
+ {U | ¬ IsKDecomposable F K U}
+
+/-- `G` is a generator cover of `O_K(D)`: every obstructed set contains some `g in G`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "A generator cover G of O_k(D) means every obstructed set contains some g in G."
+Interface: none.
+Does not claim: anything. -/
+def IsGeneratorCover {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (K : ℕ)
+ (G : Finset (Finset X)) : Prop :=
+ ∀ U : Finset X, U ∈ obstruction F K → ∃ g ∈ G, g ⊆ U
+
+/-- The exact optimal cover price `covercost_c(O_K(D))`: the infimum of the family prices of all
+generator covers of `O_K(D)`. The set of covers is finite and nonempty (`{empty set}` always
+covers), so the infimum is a minimum; that fact is not proved here.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b
+Anchor: "Therefore the EXACT optimal cover price is"
+Interface: none.
+Does 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. -/
+noncomputable def coverCost {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (K : ℕ)
+ (c : X → ℝ) : ℝ :=
+ sInf {t : ℝ | ∃ G : Finset (Finset X), IsGeneratorCover F K G ∧ famPrice c G = t}
+
+/-- The product measure `mu_p(D)` of the downset: the sum over `U in D` of
+`prod_{v in U} p_v prod_{v notin U} (1 - p_v)`, written as a sum over `2^X` of the indicator of
+`D` times the weight.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: "For EVERY independent original probability vector p in [0,1]^X,"
+Interface: none.
+Does not claim: anything. -/
+noncomputable def mu {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (p : X → ℝ) : ℝ :=
+ ∑ U ∈ (Finset.univ : Finset X).powerset, Set.indicator (downset F) (weight p) U
+
+/-- The actual local good probability `mu_p(D_i) = P(U intersect X_i in D)`, with
+`D_i = D intersect 2^(X_i)`: the sum over subsets `S` of the block of the indicator of `D` times
+the block-restricted weight.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535
+Anchor: "Write q_i=P(U intersect X_i notin D_i) for the ACTUAL capacity restriction."
+Interface: none.
+Does not claim: the identification `D_i = {S subset X_i : |S| <= a_i}` (that is `LocalRestriction`). -/
+noncomputable def localGood {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (p : X → ℝ) (i : Fin F.b) : ℝ :=
+ ∑ S ∈ (block F i).powerset,
+ Set.indicator (downset F) (fun S => (∏ v ∈ S, p v) * ∏ v ∈ block F i \ S, (1 - p v)) S
+
+/-- The local failure probability `q_i = P(U_i notin D_i) = 1 - mu_p(D_i)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "With q_i=P(U_i notin D_i),"
+Interface: none.
+Does not claim: anything. -/
+noncomputable def localFailure {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (p : X → ℝ) (i : Fin F.b) : ℝ :=
+ 1 - localGood F p i
+
+/-! ## Palette demand -/
+
+/-- `K` is a feasible palette size for the clutter `H` and demands `d`: there are label sets
+`P_i subset {0, ..., K-1}` with `|P_i| >= d_i` and empty intersection over every `H`-edge
+(no label lies in `P_i` for all `i in e`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: " intersection_(i in e) P_i = empty, for every e in H. (P6)"
+Interface: none.
+Does not claim: upward closure in `K` (true, not stated). -/
+def IsPaletteFeasible (b : ℕ) (H : Finset (Finset (Fin b))) (d : Fin b → ℕ) (K : ℕ) : Prop :=
+ ∃ P : Fin b → Finset (Fin K), (∀ i, d i ≤ (P i).card) ∧
+ ∀ e ∈ H, ∀ ℓ : Fin K, ∃ i ∈ e, ℓ ∉ P i
+
+/-- The palette demand `K_H(d)`: the least feasible palette size, as `sInf` of the feasible set
+(Mathlib's `sInf` on `ℕ` is the least element of a nonempty set and `0` for the empty set). The
+sources define it as "the minimum size K"; nonemptiness of the feasible set is the separate
+`Prop` `PaletteNumberAttained`, not proved here.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "Let K_H(d) be the minimum size K of an integer palette universe admitting subsets P_i with |P_i|>=d_i and"
+Interface: none.
+Does not claim: that the feasible set is nonempty; the source's remark that one may take `|P_i| = d_i`. -/
+noncomputable def paletteNumber (b : ℕ) (H : Finset (Finset (Fin b))) (d : Fin b → ℕ) : ℕ :=
+ sInf {K : ℕ | IsPaletteFeasible b H d K}
+
+/-- The feasible set of palette sizes is nonempty, i.e. `K_H(d)` is itself feasible (the minimum
+is attained), for every realized family.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "By discarding excess labels within blocks, one may take |P_i|=d_i."
+Interface: the family data `F` with `IsRealizedFamily F` as hypothesis.
+Does not claim: the statement (not proved here; disjoint palettes of sizes `d_i` are a witness in the sources' argument). -/
+def PaletteNumberAttained {X : Type} [Fintype X] (F : RealizedData X) : Prop :=
+ IsRealizedFamily F → IsPaletteFeasible F.b F.H F.d (paletteNumber F.b F.H F.d)
+
+/-- The specified cover: the family `G = {X_1, ..., X_b}` of full blocks.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "the fixed family G={X_1,...,X_b} covers O_K(D) if and only if"
+Interface: none.
+Does not claim: anything. -/
+def fullBlockFamily {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ Finset (Finset X) :=
+ (Finset.univ : Finset (Fin F.b)).image (block F)
+
+/-! ## Realized covers: Propositions P1, P2 and the local covers (P3)-(P5) -/
+
+/-- `U` is an inclusion-minimal forbidden set: not good, and every proper subset obtained by
+removing one element is good.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "The inclusion-minimal forbidden ORIGINAL sets are exactly"
+Interface: none.
+Does not claim: anything. -/
+def IsMinimalForbidden {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (U : Finset X) : Prop :=
+ ¬ IsGood F U ∧ ∀ v ∈ U, IsGood F (U.erase v)
+
+/-- `U` is a transversal `{x_i : i in e}` of the edge `e`: its support is `e` and it meets each
+block of `e` in exactly one coordinate.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "(b) for each e in H, EVERY transversal {x_i:i in e}, with x_i in X_i."
+Interface: none.
+Does not claim: anything. -/
+def IsTransversal {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)
+ (e : Finset (Fin F.b)) (U : Finset X) : Prop :=
+ supp F U = e ∧ ∀ i ∈ e, (U ∩ block F i).card = 1
+
+/-- Proposition P1: the inclusion-minimal forbidden sets are exactly (a) the `(a_i+1)`-subsets
+of a single block and (b) the transversals of the edges of `H`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "(a) every (a_i+1)-subset of a single X_i;"
+Interface: the family data `F` with `IsRealizedFamily F` as hypothesis.
+Does not claim: the characterisation (statement only); its completeness clause is what the source calls "completeness, not just existence of some witnesses". -/
+def MinimalForbiddenCharacterisation {X : Type} [Fintype X] [DecidableEq X]
+ (F : RealizedData X) : Prop :=
+ IsRealizedFamily F → ∀ U : Finset X, IsMinimalForbidden F U ↔
+ ((∃ i, U ⊆ block F i ∧ U.card = F.a i + 1) ∨ ∃ e ∈ F.H, IsTransversal F e U)
+
+/-- Display (P2): the actual local restriction is `D_i = D intersect 2^(X_i) = {S subset X_i :
+|S| <= a_i}`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "D_i=D intersect 2^(X_i)={S subset X_i: |S|<=a_i}. (P2)"
+Interface: the family data `F` with `IsRealizedFamily F` as hypothesis.
+Does not claim: the identity (statement only). -/
+def LocalRestriction {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) : Prop :=
+ IsRealizedFamily F → ∀ (i : Fin F.b) (S : Finset X), S ⊆ block F i →
+ (IsGood F S ↔ S.card ≤ F.a i)
+
+/-- Section 3: `I_k(D_i) = {S : |S| <= a_i k}` for subsets `S` of the block `X_i`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: " I_k(D_i)={S:|S|<=a_i k}."
+Interface: the family data `F` with `IsRealizedFamily F` as hypothesis.
+Does not claim: the identity (statement only). -/
+def LocalDecomposability {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) : Prop :=
+ IsRealizedFamily F → ∀ (i : Fin F.b) (k : ℕ) (S : Finset X), S ⊆ block F i →
+ (IsKDecomposable F k S ↔ S.card ≤ F.a i * k)
+
+/-- Display (P3): for `k = d_i` the only obstructed subset of `X_i` is `X_i` itself, so
+`G_i = {X_i}` is an exact local obstruction cover.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: " G_i={X_i} (P3)"
+Interface: the family data `F` with `IsRealizedFamily F` as hypothesis.
+Does not claim: the statement (statement only). -/
+def LocalObstructionIsFullBlock {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ Prop :=
+ IsRealizedFamily F → ∀ (i : Fin F.b) (S : Finset X), S ⊆ block F i →
+ (¬ IsKDecomposable F (F.d i) S ↔ S = block F i)
+
+/-- Display (P4): for `0 <= c_v <= p_v <= 1`, `price(G_i) = prod_{v in X_i} c_v <= prod p_v
+<= q_i <= phi(q_i)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: " =P(U_i=X_i)<=q_i<=phi(q_i), (P4)"
+Interface: the family data `F` with `IsRealizedFamily F` as hypothesis; `p`, `c` with the displayed ranges.
+Does not claim: the chain (statement only); the identity `prod p_v = P(U_i = X_i)` is the definition of the weight. -/
+def LocalPriceChain {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) : Prop :=
+ IsRealizedFamily F → ∀ (p c : X → ℝ), (∀ v, 0 ≤ p v ∧ p v ≤ 1) → (∀ v, 0 ≤ c v ∧ c v ≤ p v) →
+ ∀ i : Fin F.b, genPrice c (block F i) ≤ ∏ v ∈ block F i, p v ∧
+ ∏ v ∈ block F i, p v ≤ localFailure F p i ∧
+ localFailure F p i ≤ phi (localFailure F p i)
+
+/-- Display (P5) (also (T6)): `mu_p(D) <= prod_i (1 - q_i)` and, when `mu_p(D) > 0`,
+`sum_i q_i <= -log prod_i (1 - q_i) <= -log mu_p(D)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: " <=-log(product_i(1-q_i))<=-log mu_p(D). (P5)"
+Interface: the family data `F` with `IsRealizedFamily F` as hypothesis; `p in [0,1]^X`.
+Does not claim: the inequalities (statement only); independence of crossing events ("Crossing events are not declared independent"). -/
+def IndependentBlockHazard {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) : Prop :=
+ IsRealizedFamily F → ∀ p : X → ℝ, (∀ v, 0 ≤ p v ∧ p v ≤ 1) →
+ mu F p ≤ ∏ i, (1 - localFailure F p i) ∧
+ (0 < mu F p →
+ ∑ i, localFailure F p i ≤ -Real.log (∏ i, (1 - localFailure F p i)) ∧
+ -Real.log (∏ i, (1 - localFailure F p i)) ≤ -Real.log (mu F p))
+
+/-! ## Realized covers: the full-block cover criterion (P7) and the hazard bound (P8) -/
+
+/-- Proposition P2, display (P7): the fixed family `G = {X_1, ..., X_b}` covers `O_K(D)` if and
+only if `K >= K_H(d)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: " K>=K_H(d). (P7)"
+Interface: the family data `F` with `IsRealizedFamily F` as hypothesis; `K_H(d)` is `paletteNumber`.
+Does 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. -/
+def FullBlockCoverIff {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) : Prop :=
+ IsRealizedFamily F → ∀ K : ℕ,
+ IsGeneratorCover F K (fullBlockFamily F) ↔ paletteNumber F.b F.H F.d ≤ K
+
+/-- Display (P8): for `0 <= c_v <= p_v <= 1` and `K >= K_H(d)`,
+`covercost_c(O_K(D)) <= min(1, -log mu_p(D))`, with the endpoint convention of `cappedHazard`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "covercost_c(O_K(D)) <= min(1,-log mu_p(D)). (P8)"
+Interface: 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. -/
+def CoverCostHazardBound {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) : Prop :=
+ IsRealizedFamily F → ∀ (p c : X → ℝ), (∀ v, 0 ≤ p v ∧ p v ≤ 1) → (∀ v, 0 ≤ c v ∧ c v ≤ p v) →
+ ∀ K : ℕ, paletteNumber F.b F.H F.d ≤ K → coverCost F K c ≤ cappedHazard 1 (mu F p)
+
+/-- Section 4 comparison: the chromatic number of the ENTIRE ground set `X` (the least `K` with
+`X in I_K(D)`) is `K_H(d+1)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "the chromatic number of the ENTIRE ground set X is K_H(d+1), because ceil(n_i/a_i)=d_i+1."
+Interface: the family data `F` with `IsRealizedFamily F` as hypothesis.
+Does not claim: the statement (statement only). -/
+def WholeGroundChromaticNumber {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ Prop :=
+ IsRealizedFamily F → ∀ K : ℕ,
+ IsKDecomposable F K Finset.univ ↔ paletteNumber F.b F.H (fun i => F.d i + 1) ≤ K
+
+/-! ## Realized covers Section 5: the elementary palette formula (P9) -/
+
+/-- The clutter of all `(s+1)`-subsets of `b` block indices.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "A fully elementary case is H consisting of all (s+1)-subsets of b indices, 1<=s<=b."
+Interface: none.
+Does not claim: anything; for `s = b` the family is empty ("Empty H is allowed"). -/
+def completeClutter (b s : ℕ) : Finset (Finset (Fin b)) :=
+ (Finset.univ : Finset (Fin b)).powersetCard (s + 1)
+
+/-- Display (P9): for `H` all `(s+1)`-subsets of `b` indices, `1 <= s <= b`, and positive
+demands, `K_H(d) = max(max_i d_i, ceil(sum_i d_i / s))`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: " K_H(d)=max(max_i d_i, ceil(sum_i d_i/s)). (P9)"
+Interface: none; the positivity of the demands is the sources' standing assumption ("positive integers a_i,d_i"), added as a hypothesis.
+Does not claim: the formula (statement only); the matroid palette formula of Section 5 (not specified). -/
+def ElementaryPaletteFormula : Prop :=
+ ∀ (b s : ℕ) (d : Fin b → ℕ), 1 ≤ s → s ≤ b → (∀ i, 1 ≤ d i) →
+ paletteNumber b (completeClutter b s) d =
+ max (Finset.univ.sup d) ⌈((∑ i, d i : ℕ) : ℚ) / (s : ℚ)⌉₊
+
+/-- Section 5: the triangle on three block indices (all `2`-subsets) at unit demands needs `3`
+colors.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "at unit demands needs3 colors, although a formula considering only size-two edge loads would give2."
+Interface: none.
+Does not claim: the value (statement only; finite and decidable in principle). -/
+def TriangleNeedsThree : Prop :=
+ paletteNumber 3 (completeClutter 3 1) (fun _ => 1) = 3
+
+/-! ## Realized covers Section 6: the six-block 816-label realization -/
+
+/-- The six-block realization: ground type `Fin 6 × Fin 409` (six blocks of `409` coordinates,
+`2454` in all), block map the first projection, `a_i = 1`, `d_i = 408`, and `H` all `15`
+four-block subsets.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "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."
+Interface: none; a concrete data record.
+Does 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 application had409 vertices per block"). -/
+def benchmark816 : RealizedData (Fin 6 × Fin 409) where
+ b := 6
+ blk := Prod.fst
+ a := fun _ => 1
+ d := fun _ => 408
+ H := completeClutter 6 3
+
+/-- The six-block data satisfy the side conditions of a realized family.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "Every D-color class contains at most one vertex per block and occupies at most three blocks."
+Interface: none.
+Does not claim: the statement (finite, decidable in principle; not proved here). -/
+def Benchmark816IsRealized : Prop :=
+ IsRealizedFamily benchmark816
+
+/-- Section 6: `K_H(408, ..., 408) = 816` for `H` all four-block subsets of six.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: " K_H(408,...,408)=816."
+Interface: none.
+Does not claim: the value (statement only); the arithmetic `max(408, ceil(2448/3)) = 816` is a core-Lean target on main, not here. -/
+def Benchmark816Palette : Prop :=
+ paletteNumber 6 (completeClutter 6 3) (fun _ => 408) = 816
+
+/-- Section 6: the six full blocks cover the obstruction at `816` colors and not at `815`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "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."
+Interface: none.
+Does not claim: the statement (finite over `2^2454` subsets, not decidable in practice); `815*3 < 2448` is a core-Lean target on main. -/
+def Benchmark816Cover : Prop :=
+ IsGeneratorCover benchmark816 816 (fullBlockFamily benchmark816) ∧
+ ¬ IsGeneratorCover benchmark816 815 (fullBlockFamily benchmark816)
+
+/-- Section 6: the whole ground set needs `818` colors (`2454/3 = 818`): it is `818`-decomposable
+and not `817`-decomposable.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: "The whole ground set, unlike the cover-avoiding sets, needs818 colors, since2454/3=818."
+Interface: none.
+Does not claim: the statement (statement only); `2454/3 = 818` is a core-Lean target on main. -/
+def Benchmark816WholeGround : Prop :=
+ IsKDecomposable benchmark816 818 Finset.univ ∧ ¬ IsKDecomposable benchmark816 817 Finset.univ
+
+/-- Display (P10): the minimal forbidden sets of the six-block realization are
+`6 * binom(409, 2)` internal pairs (support of size one) and `15 * 409^4` crossing transversal
+quadruples (support of size four), and nothing else.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: " 15*409^4=419743994415 crossing transversal quadruples. (P10)"
+Interface: none.
+Does 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 that the program enumerated more than four hundred billion sets". -/
+def Benchmark816MinimalForbiddenCounts : Prop :=
+ Set.ncard {U : Finset (Fin 6 × Fin 409) |
+ IsMinimalForbidden benchmark816 U ∧ (supp benchmark816 U).card = 1} = 6 * Nat.choose 409 2 ∧
+ Set.ncard {U : Finset (Fin 6 × Fin 409) |
+ IsMinimalForbidden benchmark816 U ∧ (supp benchmark816 U).card = 4} = 15 * 409 ^ 4 ∧
+ Set.ncard {U : Finset (Fin 6 × Fin 409) | IsMinimalForbidden benchmark816 U} =
+ 6 * Nat.choose 409 2 + 15 * 409 ^ 4
+
+/-- Section 6: at `p_v = c_v = 1/40900` the cover price of the six full blocks is exactly
+`6/(40900^409) > 0`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: " 6/(40900^409)>0."
+Interface: none.
+Does not claim: the identity (statement only; the six blocks are distinct members of the image). -/
+def Benchmark816Price : Prop :=
+ famPrice (fun _ => (1 : ℝ) / 40900) (fullBlockFamily benchmark816) = 6 / 40900 ^ 409 ∧
+ (0 : ℝ) < 6 / 40900 ^ 409
+
+/-- Display (P11): at `p_v = 1/40900`, `Q = 1 - mu_p(D) <= 500616/40900^2 + 15/100^4 =
+2449227/8180000000 < 3/10000`, and the good probability exceeds `0.9997`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9
+Anchor: " =2449227/8180000000 < 3/10000. (P11)"
+Interface: none.
+Does not claim: the bound (statement only; "only a union bound, not an equality of the global bad probability"); the two rational identities are core-Lean targets on main. -/
+def Benchmark816UnionBound : Prop :=
+ 1 - mu benchmark816 (fun _ => (1 : ℝ) / 40900) ≤ 500616 / 40900 ^ 2 + 15 / 100 ^ 4 ∧
+ (500616 / 40900 ^ 2 + 15 / 100 ^ 4 : ℝ) = 2449227 / 8180000000 ∧
+ (2449227 / 8180000000 : ℝ) < 3 / 10000 ∧
+ (9997 / 10000 : ℝ) < mu benchmark816 (fun _ => (1 : ℝ) / 40900)
+
+/-! ## Price boundary: the exact two-coordinate refutation at demand one -/
+
+/-- The smallest one-block member: `X = {x, y}`, `a_1 = d_1 = 1`, no edges.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b
+Anchor: "The prescribed cover is {{x,y}}."
+Interface: none; a concrete data record.
+Does not claim: anything. -/
+def twoCoord : RealizedData (Fin 2) where
+ b := 1
+ blk := fun _ => 0
+ a := fun _ => 1
+ d := fun _ => 1
+ H := ∅
+
+/-- The probabilities `p_x = p_y = 1/2` of the refutation.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b
+Anchor: "Take independent original probabilities p_x=p_y=1/2 and prices c_x=c_y=2/3."
+Interface: none.
+Does not claim: anything. -/
+noncomputable def twoCoordP : Fin 2 → ℝ := fun _ => 1 / 2
+
+/-- The prices `c_x = c_y = 2/3` of the refutation.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b
+Anchor: "These are admissible TRANSFORMED prices: phi(1/2)=log 2>2/3."
+Interface: none.
+Does not claim: admissibility (that is part of `DemandOneRefutation`). -/
+noncomputable def twoCoordC : Fin 2 → ℝ := fun _ => 2 / 3
+
+/-- The four generator costs `1, 2/3, 2/3, 4/9` of the empty set, the two singletons and `X`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b
+Anchor: "The possible generator costs are1,2/3,2/3,4/9 for the empty"
+Interface: none.
+Does not claim: the values (statement only; as integers over `9` they are core-Lean targets on main). -/
+def TwoCoordGeneratorPrices : Prop :=
+ genPrice twoCoordC ∅ = 1 ∧ genPrice twoCoordC {0} = 2 / 3 ∧ genPrice twoCoordC {1} = 2 / 3 ∧
+ genPrice twoCoordC Finset.univ = 4 / 9
+
+/-- The exact refutation: the data are a realized family with `K_H(d) = 1` and one-piece
+obstruction `{X}`; the prices are admissible transformed prices (`phi(1/2) = log 2 > 2/3`);
+`mu_p(D) = 3/4`, `min(1, -log mu_p(D)) = log(4/3) < 1/3`; every cover costs at least `4/9`,
+`covercost_c(O_1(D)) = 4/9 > 1/3 > log(4/3)`; hence the capped hazard is strictly below the
+exact cover cost at the same palette.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b
+Anchor: " covercost_c(O_1(D))=4/9 > 1/3 > log(4/3)."
+Interface: none; everything is concrete.
+Does 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 p15-price-boundary: EXACT_COUNTEREXAMPLE; nonauthor review and acceptance are not claimed here. -/
+def DemandOneRefutation : Prop :=
+ IsRealizedFamily twoCoord ∧
+ paletteNumber 1 ∅ (fun _ => 1) = 1 ∧
+ (∀ U : Finset (Fin 2), U ∈ obstruction twoCoord 1 ↔ U = Finset.univ) ∧
+ (∀ v, twoCoordC v ≤ phi (twoCoordP v)) ∧
+ phi (1 / 2) = Real.log 2 ∧ (2 / 3 : ℝ) < Real.log 2 ∧
+ mu twoCoord twoCoordP = 3 / 4 ∧
+ cappedHazard 1 (mu twoCoord twoCoordP) = Real.log (4 / 3) ∧ Real.log (4 / 3) < (1 / 3 : ℝ) ∧
+ (∀ G : Finset (Finset (Fin 2)), IsGeneratorCover twoCoord 1 G → 4 / 9 ≤ famPrice twoCoordC G) ∧
+ coverCost twoCoord 1 twoCoordC = 4 / 9 ∧ (1 / 3 : ℝ) < 4 / 9 ∧
+ cappedHazard 1 (mu twoCoord twoCoordP) < coverCost twoCoord 1 twoCoordC
+
+/-- The elementary inequality `log(1 + x) < x` for `x > 0` used by the refutation.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b
+Anchor: "using log(1+x)0."
+Interface: none.
+Does not claim: the inequality (statement only; the source proves it, this module does not). -/
+def LogOnePlusBelowIdentity : Prop :=
+ ∀ x : ℝ, 0 < x → Real.log (1 + x) < x
+
+/-! ## Price budget: the restricted transformed-price extension (T1)-(T5), (T7) -/
+
+/-- Display (T2): `-log(1 - p) <= p/(1 - p)` for `0 <= p < 1`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535
+Anchor: " -log(1-p)=integral_0^p dt/(1-t) <= p/(1-p). (T2)"
+Interface: none.
+Does not claim: the inequality (statement only); the integral representation is not specified. -/
+def LogRatioBound : Prop :=
+ ∀ p : ℝ, 0 ≤ p → p < 1 → -Real.log (1 - p) ≤ p / (1 - p)
+
+/-- The exponent arithmetic of display (T3): for `a >= 1` and `n >= 2a + 1`,
+`4^(a+1)/3^n <= (4/3)(4/9)^a <= 16/27`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535
+Anchor: " <= (4/3)*(4/9)^a <=16/27. (T3)"
+Interface: none.
+Does not claim: the inequalities (statement only); the preceding ratio steps of (T3) (price over `prod_{v in S} p_v`) are stated through their consequence `RestrictedLocalBudget`; the case `a = 1, n = 3` giving `16/27` is a core-Lean target on main. -/
+def RatioExponentBound : Prop :=
+ ∀ a n : ℕ, 1 ≤ a → 2 * a + 1 ≤ n →
+ (4 : ℝ) ^ (a + 1) / 3 ^ n ≤ (4 / 3) * (4 / 9) ^ a ∧ (4 / 3 : ℝ) * (4 / 9) ^ a ≤ 16 / 27
+
+/-- Display (T4): under `a_i >= 1`, `d_i >= 2`, `0 <= p_v <= 1/4` and `0 <= c_v <= phi(p_v)`, the
+full-block generator satisfies `price({X_i}) <= (16/27) q_i <= phi(q_i)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535
+Anchor: " price({X}) <= (16/27)q <= phi(q). (T4)"
+Interface: the family data `F` with `IsRealizedFamily F` and `d_i >= 2` as hypotheses.
+Does 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 range, not an asserted sharp threshold". -/
+def RestrictedLocalBudget {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) : Prop :=
+ IsRealizedFamily F → (∀ i, 2 ≤ F.d i) →
+ ∀ (p c : X → ℝ), (∀ v, 0 ≤ p v ∧ p v ≤ 1 / 4) → (∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) →
+ ∀ i : Fin F.b, genPrice c (block F i) ≤ (16 / 27) * localFailure F p i ∧
+ (16 / 27) * localFailure F p i ≤ phi (localFailure F p i)
+
+/-- The restricted transformed-price extension, display (T1): for every realized family with
+`a_i >= 1`, `d_i >= 2`, independent `0 <= p_v <= 1/4`, EVERY `0 <= c_v <= phi(p_v)` and the SAME
+`K >= K_H(d)`, `covercost_c(O_K(D)) <= min(1, (16/27)[-log mu_p(D)])`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535
+Anchor: " covercost_c(O_K(D)) <= min(1,(16/27)*[-log mu_p(D)]). (T1)"
+Interface: 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.
+Does 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 acceptance are not claimed here. -/
+def RestrictedTransformedPriceBudget {X : Type} [Fintype X] [DecidableEq X]
+ (F : RealizedData X) : Prop :=
+ IsRealizedFamily F → (∀ i, 2 ≤ F.d i) →
+ ∀ (p c : X → ℝ), (∀ v, 0 ≤ p v ∧ p v ≤ 1 / 4) → (∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) →
+ ∀ K : ℕ, paletteNumber F.b F.H F.d ≤ K →
+ coverCost F K c ≤ cappedHazard (16 / 27) (mu F p)
+
+/-- The sufficient ratio `rho(a, d, p_*) = p_*^(ad - a) / (1 - p_*)^(ad + 1)` of display (T5).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535
+Anchor: " rho(a,d,p_*)=p_*^(ad-a)/(1-p_*)^(ad+1). (T5)"
+Interface: none; natural-number subtraction `a*d - a` agrees with the source for `d >= 1`.
+Does not claim: anything. -/
+noncomputable def rhoTest (a d : ℕ) (pBound : ℝ) : ℝ :=
+ pBound ^ (a * d - a) / (1 - pBound) ^ (a * d + 1)
+
+/-- Display (T5) as a sufficient test, block by block: if a common upper bound `p_* < 1` has
+`0 <= p_v <= p_*` for every coordinate `v` of the block `X_i` and `rho(a_i, d_i, p_*) <= 1`, then
+for all `0 <= c_v <= phi(p_v)` the full-block price is at most `q_i`. The source: "This is only a
+sufficient test; rho>1 is not a counterexample and must not be labeled infeasible."
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535
+Anchor: "If rho<=1 the same argument proves price({X})<=q for that block."
+Interface: 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).
+Does not claim: the statement (statement only); anything when `rho > 1` (the source: a block with `rho > 1` "must not be labeled infeasible"). -/
+def RhoTestSufficient {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) : Prop :=
+ IsRealizedFamily F → ∀ (p c : X → ℝ) (pBound : ℝ), 0 ≤ pBound → pBound < 1 →
+ (∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) →
+ ∀ i : Fin F.b, (∀ v ∈ block F i, 0 ≤ p v ∧ p v ≤ pBound) →
+ rhoTest (F.a i) (F.d i) pBound ≤ 1 →
+ genPrice c (block F i) ≤ localFailure F p i
+
+/-- Section 5 of the price budget: the cap test `q >= 2/3` gives `phi(q) = 1`, since `log 3 > 1`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535
+Anchor: "or if q>=2/3 (then phi(q)=1, since log3>1)"
+Interface: none.
+Does not claim: the statement (statement only); the integral proof of `log 3 > 1` is not specified; the checker program of that section is not specified. -/
+def CapTestAtTwoThirds : Prop :=
+ 1 < Real.log 3 ∧ ∀ q : ℝ, 2 / 3 ≤ q → q ≤ 1 → phi q = 1
+
+/-- Section 4 of the price budget: for the six-block realization at `p_v = 1/40900`, the SAME
+`816`-label full-block cover is valid for the FULL transformed range
+`0 <= c_v <= log(40900/40899)` (which is `phi(1/40900)`): it covers `O_816(D)` and its price meets
+the (T1) budget `min(1, (16/27)[-log mu_p(D)])`; consequently so does the optimal cover cost.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535
+Anchor: " 0<=c_v<=log(40900/40899),"
+Interface: none; the specified cover is `fullBlockFamily benchmark816`; the last conjunct is the (T1) consequence for the infimum over all covers.
+Does not claim: the statement (statement only); "No large witness enumeration" is involved, nor any claim about earlier P15 inputs. -/
+def Benchmark816TransformedRange : Prop :=
+ phi (1 / 40900) = Real.log (40900 / 40899) ∧
+ IsGeneratorCover benchmark816 816 (fullBlockFamily benchmark816) ∧
+ ∀ c : Fin 6 × Fin 409 → ℝ, (∀ v, 0 ≤ c v ∧ c v ≤ Real.log (40900 / 40899)) →
+ famPrice c (fullBlockFamily benchmark816) ≤
+ cappedHazard (16 / 27) (mu benchmark816 (fun _ => (1 : ℝ) / 40900)) ∧
+ coverCost benchmark816 816 c ≤
+ cappedHazard (16 / 27) (mu benchmark816 (fun _ => (1 : ℝ) / 40900))
+
+/-- Display (T7) and the explicit rational price of Section 4: at maximal equal prices the union
+price is `6 log(40900/40899)^409 <= 6/(40899^409)`; `c = p + p^2/2 = 81801/3345620000` for
+`p = 1/40900` is admissible (`c < phi(p)`) and its cover price is exactly `6 c^409`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535
+Anchor: " 6*log(40900/40899)^409 <=6/(40899^409). (T7)"
+Interface: none.
+Does not claim: the statements (statement only); the rational identity `1/40900 + (1/40900)^2/2 = 81801/3345620000` is exact arithmetic not re-proved here; admissibility rests on `integral_0^p 1/(1-t) dt > integral_0^p (1+t) dt`, which is not specified. -/
+def Benchmark816RationalPrice : Prop :=
+ 6 * Real.log (40900 / 40899) ^ 409 ≤ (6 : ℝ) / 40899 ^ 409 ∧
+ (1 / 40900 : ℝ) + (1 / 40900) ^ 2 / 2 = 81801 / 3345620000 ∧
+ (81801 / 3345620000 : ℝ) < phi (1 / 40900) ∧
+ famPrice (fun _ => (81801 : ℝ) / 3345620000) (fullBlockFamily benchmark816) =
+ 6 * (81801 / 3345620000) ^ 409
+
+/-! ## Full price: constants (F1), the result (F2) and the enclosure (F3) -/
+
+/-- `p_star = 1 - exp(-1)`, display (F1).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " p_star=1-exp(-1),"
+Interface: none.
+Does not claim: anything. -/
+noncomputable def pStar : ℝ := 1 - Real.exp (-1)
+
+/-- `h_star = 3 - log(3e - 2)`, display (F1); ASCII `3e-2` of the source means `3*e - 2`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " h_star=3-log(3e-2),"
+Interface: none.
+Does not claim: `h_star > 1` (that is `HStarExceedsOne`). -/
+noncomputable def hStar : ℝ := 3 - Real.log (3 * Real.exp 1 - 2)
+
+/-- `rho_star = 1/h_star = 1/(3 - log(3e - 2))`, display (F1); written out so that it is
+definitionally `1 / hStar`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " rho_star=1/h_star. (F1)"
+Interface: none.
+Does not claim: the enclosure (F3) or `rho_star < 6/7` (those are `RhoStarEnclosure`, `RhoStarBelowSixSevenths`). -/
+noncomputable def rhoStar : ℝ := 1 / (3 - Real.log (3 * Real.exp 1 - 2))
+
+/-- Lower endpoint `0.84547981724898672067` of display (F3), as a rational over `10^20`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " 0.84547981724898672067 < rho_star"
+Interface: none.
+Does not claim: anything. -/
+noncomputable def rhoStarLower : ℝ := 84547981724898672067 / 10 ^ 20
+
+/-- Upper endpoint `0.84547981724898672068` of display (F3), as a rational over `10^20`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " < 0.84547981724898672068 < 6/7. (F3)"
+Interface: none.
+Does not claim: anything; adjacency of the endpoints and `upper * 7 < 6 * 10^20` are core-Lean targets on main. -/
+noncomputable def rhoStarUpper : ℝ := 84547981724898672068 / 10 ^ 20
+
+/-- The headline result F, display (F2): for every realized family with `a_i >= 1`, `d_i >= 2`,
+EVERY independent `p in [0,1]^X`, every `0 <= c_v <= phi(p_v)` and the SAME `K >= K_H(d)`,
+`covercost_c(O_K(D)) <= min(1, rho_star [-log mu_p(D)])`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " covercost_c(O_K(D)) <= min(1,rho_star[-log mu_p(D)]). (F2)"
+Interface: 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").
+Does 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_CLAIMS (REVIEWED_SCOPED) is not reproduced or extended here. -/
+def FullTransformedPriceBudget {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :
+ Prop :=
+ IsRealizedFamily F → (∀ i, 2 ≤ F.d i) →
+ ∀ (p c : X → ℝ), (∀ v, 0 ≤ p v ∧ p v ≤ 1) → (∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) →
+ ∀ K : ℕ, paletteNumber F.b F.H F.d ≤ K → coverCost F K c ≤ cappedHazard rhoStar (mu F p)
+
+/-- Display (F3): `0.84547981724898672067 < rho_star < 0.84547981724898672068 < 6/7`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " 0.84547981724898672067 < rho_star"
+Interface: none.
+Does not claim: the enclosure (statement only; the source's `full_price.py` Fraction procedure is not a kernel proof and is not specified); this is the next full-result target named in main's `docs/FORMAL_VERIFICATION_ROLLOUT_20260927.md`, still at `specified`. -/
+def RhoStarEnclosure : Prop :=
+ rhoStarLower < rhoStar ∧ rhoStar < rhoStarUpper ∧ rhoStarUpper < 6 / 7
+
+/-- The simpler rational factor: `rho_star < 6/7`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: "Thus 6/7 is a simpler valid rational factor."
+Interface: none.
+Does not claim: the inequality (statement only); `16/27 < 6/7` is a core-Lean target on main. -/
+def RhoStarBelowSixSevenths : Prop :=
+ rhoStar < 6 / 7
+
+/-! ## Full price Section 2: the hazard interpolation bounds (F4)-(F8) -/
+
+/-- `A` is a proper decreasing family containing the empty set: `empty in A`, `X notin A`, and
+`A` is closed under taking subsets.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: "Let A be any proper decreasing family on n>=1 coordinates containing the empty set."
+Interface: none.
+Does not claim: anything. -/
+def IsProperDownset {Y : Type} [Fintype Y] (A : Finset (Finset Y)) : Prop :=
+ ∅ ∈ A ∧ Finset.univ ∉ A ∧ ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A
+
+/-- `F_A(t) = -log mu_(p(t))(A)` with `p_i(t) = 1 - exp(-t_i)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " p_i(t)=1-exp(-t_i), t in [0,1]^n,"
+Interface: none.
+Does not claim: anything. -/
+noncomputable def hazardCoord {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))
+ (t : Y → ℝ) : ℝ :=
+ -Real.log (muOf A (fun i => 1 - Real.exp (-t i)))
+
+/-- `H_A = F_A(1, ..., 1) = -log mu_(p_star, ..., p_star)(A)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " H_A=F_A(1,...,1)>0."
+Interface: none.
+Does not claim: positivity (that is `HazardStarPositive`). -/
+noncomputable def hazardStar {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y)) : ℝ :=
+ -Real.log (muOf A (fun _ => pStar))
+
+/-- `H_A > 0` for every proper decreasing family on `n >= 1` coordinates containing the empty set.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: "The probability is positive on this compact cube because the empty set is admitted and every p_i(t)<1."
+Interface: `A` with `IsProperDownset A` as hypothesis.
+Does not claim: the statement (statement only). -/
+def HazardStarPositive : Prop :=
+ ∀ (n : ℕ) (A : Finset (Finset (Fin n))), 1 ≤ n → IsProperDownset A → 0 < hazardStar A
+
+/-- Display (F5) as separate coordinatewise concavity of `F_A` on `[0,1]` in each coordinate,
+the other coordinates held fixed in `[0,1]`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: "Only SEPARATE coordinatewise concavity is asserted; joint concavity is not needed or claimed."
+Interface: `A` with `IsProperDownset A` as hypothesis.
+Does not claim: the statement (statement only); joint concavity; the derivative formulas (F4)-(F5) themselves (not specified; concavity is their consequence). -/
+def CoordinatewiseConcavity : Prop :=
+ ∀ (n : ℕ) (A : Finset (Finset (Fin n))), 1 ≤ n → IsProperDownset A →
+ ∀ (i : Fin n) (t : Fin n → ℝ), (∀ j, 0 ≤ t j ∧ t j ≤ 1) →
+ ConcaveOn ℝ (Set.Icc (0 : ℝ) 1) (fun s : ℝ => hazardCoord A (Function.update t i s))
+
+/-- Display (F6): `F_A(t) >= (prod_i t_i) H_A` on the cube `[0,1]^n`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " F_A(t) >= (product_i t_i) H_A. (F6)"
+Interface: `A` with `IsProperDownset A` as hypothesis.
+Does not claim: the inequality (statement only). -/
+def HazardProductBound : Prop :=
+ ∀ (n : ℕ) (A : Finset (Finset (Fin n))), 1 ≤ n → IsProperDownset A →
+ ∀ t : Fin n → ℝ, (∀ j, 0 ≤ t j ∧ t j ≤ 1) → (∏ i, t i) * hazardStar A ≤ hazardCoord A t
+
+/-- Display (F7): for `p in [0,1]^n` with `mu_p(A) > 0`, `-log mu_p(A) >= H_A prod_i phi(p_i)`;
+when `mu_p(A) = 0` the source reads the inequality as an extended one and nothing is stated.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " -log mu_p(A) >= H_A product_i phi(p_i). (F7)"
+Interface: `A` with `IsProperDownset A` as hypothesis.
+Does not claim: the inequality (statement only). -/
+def HazardPhiBound : Prop :=
+ ∀ (n : ℕ) (A : Finset (Finset (Fin n))), 1 ≤ n → IsProperDownset A →
+ ∀ p : Fin n → ℝ, (∀ j, 0 ≤ p j ∧ p j ≤ 1) → 0 < muOf A p →
+ hazardStar A * ∏ i, phi (p i) ≤ -Real.log (muOf A p)
+
+/-- Display (F8): for transformed prices `0 <= c_i <= phi(p_i)`,
+`prod_i c_i <= min(1, [-log mu_p(A)]/H_A)`, with the `cappedHazard` endpoint convention.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " product_i c_i <= min(1, [-log mu_p(A)]/H_A). (F8)"
+Interface: `A` with `IsProperDownset A` as hypothesis.
+Does not claim: the inequality (statement only); that the full-ground generator covers any obstruction ("It does not assert that this generator alone covers an arbitrary obstruction"). -/
+def FullGroundPriceBound : Prop :=
+ ∀ (n : ℕ) (A : Finset (Finset (Fin n))), 1 ≤ n → IsProperDownset A →
+ ∀ (p c : Fin n → ℝ), (∀ j, 0 ≤ p j ∧ p j ≤ 1) → (∀ j, 0 ≤ c j ∧ c j ≤ phi (p j)) →
+ ∏ i, c i ≤ cappedHazard (1 / hazardStar A) (muOf A p)
+
+/-- `phi(p_star) = 1`: at the reference vector `p_i = p_star`, `c_i = 1`, the two sides of (F7)
+are equal.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: "at every p_i=p_star and every c_i=1, the two sides of (F7) are equal"
+Interface: none.
+Does not claim: the identity (statement only). -/
+def PhiAtPStar : Prop :=
+ phi pStar = 1
+
+/-- Exactness of `1/H_A`: a full-ground generator universally meets the capped hazard budget
+(for all `p in [0,1]^n` and all transformed prices) precisely when `H_A >= 1`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: "a full-ground generator universally meets the capped hazard budget precisely when H_A>=1"
+Interface: `A` with `IsProperDownset A` as hypothesis.
+Does not claim: the equivalence (statement only); coverage of arbitrary `A` ("it does not infer coverage of arbitrary A"). -/
+def FullGroundBudgetIff : Prop :=
+ ∀ (n : ℕ) (A : Finset (Finset (Fin n))), 1 ≤ n → IsProperDownset A →
+ ((∀ (p c : Fin n → ℝ), (∀ j, 0 ≤ p j ∧ p j ≤ 1) → (∀ j, 0 ≤ c j ∧ c j ≤ phi (p j)) →
+ ∏ i, c i ≤ cappedHazard 1 (muOf A p)) ↔ 1 ≤ hazardStar A)
+
+/-! ## Full price Section 3: capacity families and the sharp worst case (F9)-(F11) -/
+
+/-- The capacity family `{S subset {0, ..., n-1} : |S| <= a}`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: "For a capacity restriction A={S:|S|<=a} on n coordinates,"
+Interface: none.
+Does not claim: anything. -/
+def capacityFamily (n a : ℕ) : Finset (Finset (Fin n)) :=
+ (Finset.univ : Finset (Fin n)).powerset.filter (fun U => U.card ≤ a)
+
+/-- The binomial lower tail `P(Bin(n, p) <= a) = sum_{j <= a} C(n, j) p^j (1 - p)^(n - j)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " H_(n,a)=-log P(Bin(n,p_star)<=a). (F9)"
+Interface: none.
+Does not claim: anything. -/
+noncomputable def binomTail (n a : ℕ) (p : ℝ) : ℝ :=
+ ∑ j ∈ Finset.range (a + 1), (Nat.choose n j : ℝ) * p ^ j * (1 - p) ^ (n - j)
+
+/-- Display (F9): `H_(n,a) = -log P(Bin(n, p_star) <= a)`, i.e. the product measure of the
+capacity family at `p_star` is the binomial tail.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " H_(n,a)=-log P(Bin(n,p_star)<=a). (F9)"
+Interface: none.
+Does not claim: the identity (statement only; a finite identity for each `n`, general in `n`). -/
+def CapacityHazardIsBinomial : Prop :=
+ ∀ n a : ℕ, hazardStar (capacityFamily n a) = -Real.log (binomTail n a pStar)
+
+/-- Display (F10): for `S ~ Bin(2a+1, p)`,
+`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
+this is negative for `1/2 < p < 1` (the source writes `p > 1/2`; at `p = 1` the difference is
+`0`, so the strict inequality is stated for `p < 1`, which covers `p_star`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " =p(1-2p)P(S=a)<0. (F10)"
+Interface: none.
+Does not claim: the identities (statement only; polynomial identities in `p`, a future kernel target for each fixed `a` and by induction in general). -/
+def OddMajorityIdentity : Prop :=
+ ∀ (a : ℕ) (p : ℝ),
+ binomTail (2 * a + 3) (a + 1) p - binomTail (2 * a + 1) a p =
+ (1 - p) ^ 2 * ((Nat.choose (2 * a + 1) (a + 1) : ℝ) * p ^ (a + 1) * (1 - p) ^ a) -
+ p ^ 2 * ((Nat.choose (2 * a + 1) a : ℝ) * p ^ a * (1 - p) ^ (a + 1)) ∧
+ binomTail (2 * a + 3) (a + 1) p - binomTail (2 * a + 1) a p =
+ p * (1 - 2 * p) * ((Nat.choose (2 * a + 1) a : ℝ) * p ^ a * (1 - p) ^ (a + 1)) ∧
+ (1 / 2 < p → p < 1 → binomTail (2 * a + 3) (a + 1) p - binomTail (2 * a + 1) a p < 0)
+
+/-- Display (F11): for `a >= 1` and `n >= 2a + 1`, `H_(n,a) >= H_(3,1) = -log[3exp(-2) - 2exp(-3)]
+= 3 - log(3e - 2) = h_star > 1`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " =3-log(3e-2)=h_star>1. (F11)"
+Interface: none.
+Does not claim: the statements (statement only); the source stresses "it is not a finite-grid extrapolation". -/
+def CapacityWorstCase : Prop :=
+ (∀ a n : ℕ, 1 ≤ a → 2 * a + 1 ≤ n →
+ hazardStar (capacityFamily 3 1) ≤ hazardStar (capacityFamily n a)) ∧
+ hazardStar (capacityFamily 3 1) = -Real.log (3 * Real.exp (-2) - 2 * Real.exp (-3)) ∧
+ -Real.log (3 * Real.exp (-2) - 2 * Real.exp (-3)) = hStar ∧
+ 1 < hStar
+
+/-- The last step of (F11): `e > 2`, `e^2 - (3e - 2) = (e - 1)(e - 2) > 0`, hence
+`3exp(-2) - 2exp(-3) < exp(-1)` and `h_star > 1`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " e^2-(3e-2)=(e-1)(e-2)>0,"
+Interface: none.
+Does not claim: the statements (statement only). -/
+def HStarExceedsOne : Prop :=
+ 2 < Real.exp 1 ∧
+ Real.exp 1 ^ 2 - (3 * Real.exp 1 - 2) = (Real.exp 1 - 1) * (Real.exp 1 - 2) ∧
+ 0 < (Real.exp 1 - 1) * (Real.exp 1 - 2) ∧
+ 3 * Real.exp (-2) - 2 * Real.exp (-3) < Real.exp (-1) ∧
+ 1 < hStar
+
+/-! ## Full price Sections 3-4: local price bound (F12) and global assembly (F13) -/
+
+/-- Display (F12): for each block with `d_i >= 2` and positive local good probability, under
+`0 <= c_v <= phi(p_v)`, `price({X_i}) <= rho_star [-log mu_p(D_i)]`, and the price is at most
+one.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " price({X_i}) <= rho_star [-log mu_p(D_i)], (F12)"
+Interface: the family data `F` with `IsRealizedFamily F` and `d_i >= 2` as hypotheses.
+Does not claim: the bound (statement only); `price <= q_i` ("The inequality price<=q_i is NOT required and is in general stronger than what is proved here"). -/
+def LocalPriceBoundFull {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) : Prop :=
+ IsRealizedFamily F → (∀ i, 2 ≤ F.d i) →
+ ∀ (p c : X → ℝ), (∀ v, 0 ≤ p v ∧ p v ≤ 1) → (∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) →
+ ∀ i : Fin F.b, 0 < localGood F p i →
+ genPrice c (block F i) ≤ rhoStar * (-Real.log (localGood F p i)) ∧
+ genPrice c (block F i) ≤ 1
+
+/-- Display (F13): `mu_p(D) <= prod_i mu_p(D_i)` and, when `mu_p(D) > 0`,
+`sum_i [-log mu_p(D_i)] <= -log mu_p(D)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " sum_i [-log mu_p(D_i)] <= -log mu_p(D). (F13)"
+Interface: the family data `F` with `IsRealizedFamily F` as hypothesis; `p in [0,1]^X`.
+Does not claim: the inequalities (statement only; "without independence of crossing failures"). -/
+def GlobalAssemblyHazard {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) : Prop :=
+ IsRealizedFamily F → ∀ p : X → ℝ, (∀ v, 0 ≤ p v ∧ p v ≤ 1) →
+ mu F p ≤ ∏ i, localGood F p i ∧
+ (0 < mu F p → ∑ i, -Real.log (localGood F p i) ≤ -Real.log (mu F p))
+
+/-! ## Full price Section 5: sharpness and the exact demand boundary -/
+
+/-- One block with `a = 1`, `d = 2`, `n = 3`, no edges.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: "Every proper subset is two-decomposable and the full triple is not."
+Interface: none; a concrete data record.
+Does not claim: anything. -/
+def tripleBlock : RealizedData (Fin 3) where
+ b := 1
+ blk := fun _ => 0
+ a := fun _ => 1
+ d := fun _ => 2
+ H := ∅
+
+/-- Sharpness of `rho_star` even among alternative covers: for the triple block at `K = 2`, the
+obstruction is exactly `{X}`; at `p_i = p_star`, `c_i = 1` (admissible since `phi(p_star) = 1`)
+every generator has price one, every cover of the obstruction costs at least one and the
+one-generator full-block cover `{X}` attains it (so the exact cover cost is one), the hazard is
+`h_star`, and replacing `rho_star` by any smaller constant makes the right side of (F2) strictly
+less than one.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: "Replacing rho_star by any smaller constant in (F2) would make its right side strictly less than one."
+Interface: none; everything is concrete.
+Does not claim: the statements (statement only; the finite parts are decidable in principle); a necessity claim for multi-block families with some demand one (the source: "other constraints may change its budget"). -/
+def SharpnessOfRhoStar : Prop :=
+ IsRealizedFamily tripleBlock ∧
+ paletteNumber 1 ∅ (fun _ => 2) = 2 ∧
+ (∀ U : Finset (Fin 3), U ∈ obstruction tripleBlock 2 ↔ U = Finset.univ) ∧
+ phi pStar = 1 ∧
+ (∀ g : Finset (Fin 3), genPrice (fun _ => (1 : ℝ)) g = 1) ∧
+ (∀ G : Finset (Finset (Fin 3)), IsGeneratorCover tripleBlock 2 G →
+ 1 ≤ famPrice (fun _ => (1 : ℝ)) G) ∧
+ IsGeneratorCover tripleBlock 2 (fullBlockFamily tripleBlock) ∧
+ famPrice (fun _ => (1 : ℝ)) (fullBlockFamily tripleBlock) = 1 ∧
+ coverCost tripleBlock 2 (fun _ => (1 : ℝ)) = 1 ∧
+ -Real.log (mu tripleBlock (fun _ => pStar)) = hStar ∧
+ ∀ ρ : ℝ, ρ < rhoStar → cappedHazard ρ (mu tripleBlock (fun _ => pStar)) < 1
+
+/-- One block with capacity `cap`, demand `1`, `n = cap + 1`, no edges.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: "If d=1, n=a+1 and K=1, the sole obstruction is again the full block."
+Interface: none; a concrete data record for each `cap`.
+Does not claim: anything. -/
+def demandOneBlock (cap : ℕ) : RealizedData (Fin (cap + 1)) where
+ b := 1
+ blk := fun _ => 0
+ a := fun _ => cap
+ d := fun _ => 1
+ H := ∅
+
+/-- The exact demand boundary: for every `a >= 1`, in the demand-one block at `K = 1` the sole
+obstruction is the full block; at `p_i = p_star`, `c_i = 1` every cover costs at least one, but
+`mu_p(D) = 1 - p_star^(a+1) > 1 - p_star = exp(-1)`, so the hazard is less than one and no
+constant `rho <= 1` makes the same-palette transformed-price guarantee hold.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: " mu_p(D)=1-p_star^(a+1)>1-p_star=exp(-1),"
+Interface: none; concrete for each `cap`.
+Does not claim: the statements (statement only); any retraction of original P15-B ("whose local-budget premise is missing in that case"). -/
+def DemandOneBoundary : Prop :=
+ ∀ cap : ℕ, 1 ≤ cap →
+ IsRealizedFamily (demandOneBlock cap) ∧
+ (∀ U : Finset (Fin (cap + 1)), U ∈ obstruction (demandOneBlock cap) 1 ↔ U = Finset.univ) ∧
+ 1 ≤ coverCost (demandOneBlock cap) 1 (fun _ => (1 : ℝ)) ∧
+ mu (demandOneBlock cap) (fun _ => pStar) = 1 - pStar ^ (cap + 1) ∧
+ Real.exp (-1) < 1 - pStar ^ (cap + 1) ∧
+ -Real.log (mu (demandOneBlock cap) (fun _ => pStar)) < 1 ∧
+ ∀ ρ : ℝ, ρ ≤ 1 →
+ cappedHazard ρ (mu (demandOneBlock cap) (fun _ => pStar)) <
+ coverCost (demandOneBlock cap) 1 (fun _ => (1 : ℝ))
+
+/-! ## Full price Section 6: rational certificates for `rho_star < 6/7` -/
+
+/-- The short rational certificate chain of Section 6: `e < 31967/11760 < 87/32`,
+`87/32 - 31967/11760 = 11/23520`, `sum_{j=0}^5 (11/6)^j/j! - 197/32 = 26081/933120 > 0`,
+hence `3e - 2 < 197/32 < exp(11/6)`, `h_star > 7/6` and `rho_star < 6/7`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9
+Anchor: "Therefore 3e-2<197/327/6 and rho_star<6/7."
+Interface: none.
+Does not claim: the statements (statement only); the two exact rational identities are exact arithmetic not re-proved here; the series and geometric-tail bounds behind `e < 31967/11760` are not specified. -/
+def SixSeventhsCertificate : Prop :=
+ Real.exp 1 < 31967 / 11760 ∧ (31967 / 11760 : ℝ) < 87 / 32 ∧
+ (87 / 32 - 31967 / 11760 : ℝ) = 11 / 23520 ∧
+ (∑ j ∈ Finset.range 6, (11 / 6 : ℝ) ^ j / (Nat.factorial j : ℝ)) - 197 / 32 = 26081 / 933120 ∧
+ (0 : ℝ) < 26081 / 933120 ∧
+ 3 * Real.exp 1 - 2 < 197 / 32 ∧ (197 / 32 : ℝ) < Real.exp (11 / 6) ∧
+ 7 / 6 < hStar ∧ rhoStar < 6 / 7
+
+end UniversalLaw.Spec.P15
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/RN.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/RN.lean
new file mode 100644
index 000000000..8af911ef6
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/RN.lean
@@ -0,0 +1,1009 @@
+import Mathlib
+
+/-!
+# RN-track statements: count interface (Theorem N), fixed-remote and fixed-annulus
+# height windows, the D5 reconciliation rows, the dimension lift, the C6 moment
+# bounds, the rare-cluster Poisson obstruction and the open witness-collision target
+# (statements only)
+
+Scientific effect: NONE. Formal progress of every declaration here: `specified`.
+Organizational-independence credit of this transcription: 0 (Anthropic / Claude).
+
+This module states, as `Prop`-valued definitions, the shapes of the RN-track results:
+the abstract probability-to-count interface (N1)-(N5) of RN_COUNT_INTERFACE.md, the
+fixed-remote Theorem A displays (2) and (3) of remote_window_20260924/PROOF.md, the
+fixed-annulus height-window candidate (A2) of FIXED_ANNULUS_CANDIDATE.md, the all-height
+annulus bridge display (2) of rn_annulus_bridge_20260925/PROOF.md, the six reconciled
+rows D5-a ... D5-f of RECONCILIATION.md, the headline displays of Theorems P_d, C_d,
+I_d, G_d of d5_dimension_lift_20260929/PROOF.md, the planar (F4) display of
+c6_fourier_cutoff_20260929/PROOF.md, Theorem Q and Corollary Theta of
+c6_palm_route_20260929/PROOF.md, Theorem O of c6_rare_cluster_laws_20260929/PROOF.md,
+Corollary D of remote_collision_20260928/PROOF.md, and, labelled as an OPEN obligation
+whose Prop is a target and not a result, the regional near-pin witness-collision
+second-moment target of GRAPH node `math.rn-region.witness-collision`.
+
+Every statement about the pinned Gaussian model is parametrised by an interface object
+`PinnedLawInterface`: the sample space, the sample paths, the Gaussian regression law
+`Q_r`, the typed endpoint weight `W_r`, the tilted law `Q_r^W = (W_r/Z_r) Q_r` and the
+contact kernel `Lambda_j` are GIVEN; their Gaussian-regression construction, the
+determinant form of the weight and the Kac-Rice representation of the kernel are informal
+in the sources and are not transcribed. The pin equations, the positivity of the normalizer
+and the exact tilt are required only in the pin regime `0 < r < L`, this module's reading of
+the sources' "For small r>0 the pins are" (for `0 < r < L` the two pins are distinct modulo
+`L Z^d`, so the pin equations are consistent with `L`-periodicity); outside that regime the
+laws are unconstrained given probability measures. The statements are about whatever objects satisfy
+the interface; the identification of those objects with the objects of the source texts is
+not part of any statement.
+
+This module is self-contained: it imports only Mathlib and re-declares, up to the
+namespace, the shared objects of `Specifications/Field.lean` that it needs (ambient space,
+lattice vectors, Hessian form, critical points, inertia, pins, torus distance, fundamental
+domain): the nine bodies are byte-identical to Field.lean's, and so are the docstrings except
+the `Does not claim:` lines of `pinM` and `pinS`, which are module-specific (Field.lean
+records that no statement there consumes the pins; here the interface and the window
+statements consume them). The duplication is deliberate at this layer and is recorded as
+such.
+
+What this module does not establish. It consists only of definitions and structures; it
+states nothing as a result and proves nothing: none of Theorem N, Theorem A, the annulus
+candidates, the D5 rows, the dimension lift, the C6 bounds, the rare-cluster Poisson
+obstruction or the collision target is shown here, and no kernel receipt about them exists. It does not
+construct the Gaussian field or the regression law `Q_r`; it does not transcribe the
+determinant/inertia form of `W_r` (only its sign and typing), the normalizer floor
+`Z_r >= z_* r^2`, the observation transform `U_r`, the coupling estimates, the weighted
+Kac-Rice formulas (N6), (12), (A21), (16), (3.1) or the contact-kernel integral (13); it
+asserts no numerical constant, radius or cutoff; it does not state the two-scale, thin-tube,
+microdisk, collar, intermediate-window or elder sources that the D5 rows consume; it does
+not state Theorem F (F1)-(F2) or Proposition B of the Fourier cutoff note, Corollary P of
+the Palm route, Theorems C and S of the rare-cluster note, or Theorem C / Corollaries E, F
+of the remote-collision note; and it does not assert that the open target is attainable.
+Nothing here promotes, reclassifies or discharges any claim, premise or obligation of the
+registers: the landing dispositions `HOLD_WITH_DOMAIN` (rn-count-interface,
+rn-fixed-remote-window) and `REVIEWED_SCOPED` (rn-fixed-annulus-window), and the GRAPH
+classifications of the `math.rn-region.*` nodes (including `OPEN_ACTIVE` for
+`witness-collision`), are transcribed from the registers by the statement register, never
+re-derived here; alignment of these statements with the sources is
+PENDING_INDEPENDENT_REVIEW.
+
+Sources (Layer 0, byte-pinned, `d6g8k5htny-coder/Math-`):
+* `lifetime-parent` (shared objects): commit `c39164254ad1529ed49543743598d5dcb24bab98`,
+ path `imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md`,
+ sha256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`.
+* `rn-count-interface`: commit `760340e921ac4ceda296b8118da936f1133e956e`, path
+ `frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md`,
+ sha256 `aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab`.
+* `rn-fixed-remote-window`: commit `760340e921ac4ceda296b8118da936f1133e956e`, path
+ `frontiers/remote_window_20260924/PROOF.md`,
+ sha256 `a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7`.
+* `rn-fixed-annulus-window`: commit `760340e921ac4ceda296b8118da936f1133e956e`, path
+ `frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md`,
+ sha256 `1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b`.
+* `rn-annulus-bridge`: commit `760340e921ac4ceda296b8118da936f1133e956e`, path
+ `frontiers/rn_annulus_bridge_20260925/PROOF.md`,
+ sha256 `d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05`.
+* `d5-reconciliation`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `reviews/d5_reconciliation_20260929/RECONCILIATION.md`,
+ sha256 `14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432`.
+* `d5-dimension-lift`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/d5_dimension_lift_20260929/PROOF.md`,
+ sha256 `6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80`.
+* `c6-fourier-cutoff`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/c6_fourier_cutoff_20260929/PROOF.md`,
+ sha256 `c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733`.
+* `c6-palm-route`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/c6_palm_route_20260929/PROOF.md`,
+ sha256 `aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b`.
+* `c6-rare-cluster`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/c6_rare_cluster_laws_20260929/PROOF.md`,
+ sha256 `c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb`.
+* `remote-collision`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/remote_collision_20260928/PROOF.md`,
+ sha256 `b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2`.
+-/
+
+namespace UniversalLaw.Spec.RN
+
+open MeasureTheory
+
+/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same bodies, this
+namespace; see the module header for the two module-specific `Does not claim:` lines). The
+duplication is deliberate: modules of this packet import only Mathlib. -/
+
+/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised
+by `L`-periodic functions.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.
+Does not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/
+abbrev E (d : ℕ) : Type := EuclideanSpace ℝ (Fin d)
+
+/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: none.
+Does not claim: anything beyond the definition of the vector `L n`. -/
+noncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : E d :=
+ ∑ i, EuclideanSpace.single i (L * (n i : ℝ))
+
+/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet
+derivative: `hessian d g x v w = D^2 g(x)[v, w]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: symmetry of the form (true for `C^2` functions, not stated here). -/
+noncomputable def hessian (d : ℕ) (g : E d → ℝ) (x v w : E d) : ℝ :=
+ iteratedFDeriv ℝ 2 g x ![v, w]
+
+/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "grad f(M)=grad f(S)=0."
+Interface: none.
+Does not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/
+def IsCriticalPoint (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ fderiv ℝ g x = 0
+
+/-- Sylvester-inertia encoding of "the Hessian at `x` is nondegenerate with exactly `j`
+negative and `d - j` positive eigenvalues": there are complementary subspaces `V`, `W` of
+dimensions `j` and `d - j` on which the Hessian form is negative definite, respectively
+positive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)
+Hessians; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "The index counts negative eigenvalues."
+Interface: none.
+Does not claim: equivalence with an eigenvalue count for a non-symmetric form. -/
+def HessianHasInertia (d : ℕ) (g : E d → ℝ) (x : E d) (j : ℕ) : Prop :=
+ ∃ V W : Submodule ℝ (E d), IsCompl V W ∧
+ Module.finrank ℝ V = j ∧ Module.finrank ℝ W = d - j ∧
+ (∀ v ∈ V, v ≠ 0 → hessian d g x v v < 0) ∧
+ (∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)
+
+/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does not claim: that `u` is a unit vector (a hypothesis where used). -/
+noncomputable def pinM (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ -((r / 2) • u)
+
+/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does not claim: that `u` is a unit vector (a hypothesis where used). -/
+noncomputable def pinS (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ (r / 2) • u
+
+/-- Torus distance between two points of `R^d`: the infimum over the lattice of
+`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the
+same torus point; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Count ordered maximum/saddle pairs with 0 1`,
+`E[N 1_E] ≤ (E N^p)^(1/p) P(E)^(1-1/p)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "E[N_r 1_Er] <= (E N_r^p)^(1/p) P(E_r)^(1-1/p)."
+Interface: none; the probability space, event and count are universally quantified, integrability of `N^p` is a hypothesis.
+Does 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). -/
+def HolderCountBoundN1 : Prop :=
+ ∀ (Ω : Type) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
+ (Ev : Set Ω) (N : Ω → ℕ) (p : ℝ),
+ MeasurableSet Ev → 1 < p → Integrable (fun ω => (N ω : ℝ) ^ p) P →
+ ∫ ω, (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω ∂P ≤
+ (∫ ω, (N ω : ℝ) ^ p ∂P) ^ (1 / p) * (P Ev).toReal ^ (1 - 1 / p)
+
+/-- Shape of (N2), the consequence of (N1) with a power-law moment bound: if
+`E N^p ≤ A r^(-β)` and `P(E) ≤ C r^3` then
+`E[N 1_E] ≤ A^(1/p) C^(1-1/p) r^((3(p-1)-β)/p)`. The powers refer to the `p`-th MOMENT
+itself, as the source insists.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "E[N_r 1_Er] <= A^(1/p) C^(1-1/p)"
+Interface: none; `A`, `β`, `C`, `p`, `r` and the probability space are universally quantified, the two bounds are hypotheses.
+Does 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). -/
+def HolderConsequenceN2 : Prop :=
+ ∀ (Ω : Type) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
+ (Ev : Set Ω) (N : Ω → ℕ) (p A β C r : ℝ),
+ MeasurableSet Ev → 1 < p → 0 ≤ A → 0 ≤ C → 0 < r →
+ Integrable (fun ω => (N ω : ℝ) ^ p) P →
+ ∫ ω, (N ω : ℝ) ^ p ∂P ≤ A * r ^ (-β) →
+ (P Ev).toReal ≤ C * r ^ 3 →
+ ∫ ω, (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω ∂P ≤
+ A ^ (1 / p) * C ^ (1 - 1 / p) * r ^ ((3 * (p - 1) - β) / p)
+
+/-- Shape of (N3), the exact identity `E[N 1_E] = q E[N | E]` with `q = P(E) > 0`, stated
+with Mathlib's conditional measure `P[|E] = P(E)⁻¹ P|_E` for the conditional expectation.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "E[N_r 1_Er]=q E[N_r | E_r]."
+Interface: none; the probability space, event and count are universally quantified, `P(E) > 0` and integrability of `N` are hypotheses.
+Does 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). -/
+def ConditionalMeanIdentityN3 : Prop :=
+ ∀ (Ω : Type) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
+ (Ev : Set Ω) (N : Ω → ℕ),
+ MeasurableSet Ev → 0 < (P Ev).toReal → Integrable (fun ω => (N ω : ℝ)) P →
+ ∫ ω, (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω ∂P =
+ (P Ev).toReal * ∫ ω, (N ω : ℝ) ∂(ProbabilityTheory.cond P Ev)
+
+/-- The law of `U` uniform on `[0,1]`: Lebesgue measure restricted to `[0, 1]`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "On one space take U uniform on [0,1]."
+Interface: none; an explicit construction.
+Does not claim: that this measure is a probability measure (true, not stated as a result here). -/
+noncomputable def uniformLaw : Measure ℝ := volume.restrict (Set.Icc (0 : ℝ) 1)
+
+/-- The counterexample count `N_r = ceil(log(1/r)) 1_{E_r}` with `E_r = {U ≤ r^3}`, as a
+function of the uniform variable `u`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "N_r=ceil(log(1/r)) 1_Er."
+Interface: none; an explicit construction.
+Does not claim: that this count is a realization of any Gaussian field quantity (the source says it is NOT). -/
+noncomputable def counterCount (r : ℝ) (u : ℝ) : ℝ :=
+ (⌈Real.log (1 / r)⌉₊ : ℝ) * (Set.Iic (r ^ 3)).indicator (fun _ => (1 : ℝ)) u
+
+/-- Shape of the sharp counterexample (N4): for `0 < r ≤ e^(-1)`, `P(E_r) = r^3` and
+`E N_r / r^3 = ceil(log(1/r))`, which tends to infinity as `r ↓ 0`, while for EACH finite
+`p ≥ 1` the `p`-th moments `E N_r^p` are bounded uniformly in `r` (by a constant that may
+depend on `p`). So every finite moment does not preserve the cubic exponent.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "E N_r/r^3=ceil(log(1/r)) -> infinity."
+Interface: none; the construction is explicit (`uniformLaw`, `counterCount`).
+Does 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). -/
+def UniformCounterexampleN4 : Prop :=
+ (∀ r : ℝ, 0 < r → r ≤ Real.exp (-1) →
+ (uniformLaw (Set.Iic (r ^ 3))).toReal = r ^ 3 ∧
+ (∫ u, counterCount r u ∂uniformLaw) / r ^ 3 = (⌈Real.log (1 / r)⌉₊ : ℝ)) ∧
+ Filter.Tendsto (fun r : ℝ => (∫ u, counterCount r u ∂uniformLaw) / r ^ 3)
+ (nhdsWithin (0 : ℝ) (Set.Ioi 0)) Filter.atTop ∧
+ (∀ p : ℝ, 1 ≤ p → ∃ A : ℝ, ∀ r : ℝ, 0 < r → r ≤ Real.exp (-1) →
+ ∫ u, counterCount r u ^ p ∂uniformLaw ≤ A)
+
+/-- Shape of (N5), the exponential-tail layer-cake bound: if `P(N > t) ≤ A exp(-t/B)` for
+all `t ≥ 0` with `A ≥ 1`, `B > 0`, and `q = P(E) > 0`, then
+`E[N 1_E] ≤ B q [1 + log(A/q)]`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "= B q[1+log(A/q)]."
+Interface: none; the probability space, event, count and tail constants are universally quantified, the tail bound is a hypothesis.
+Does 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). -/
+def ExponentialTailLayerCakeN5 : Prop :=
+ ∀ (Ω : Type) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
+ (Ev : Set Ω) (N : Ω → ℕ) (A B : ℝ),
+ MeasurableSet Ev → 1 ≤ A → 0 < B → 0 < (P Ev).toReal →
+ Integrable (fun ω => (N ω : ℝ)) P →
+ (∀ t : ℝ, 0 ≤ t → (P {ω | t < (N ω : ℝ)}).toReal ≤ A * Real.exp (-t / B)) →
+ ∫ ω, (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω ∂P ≤
+ B * (P Ev).toReal * (1 + Real.log (A / (P Ev).toReal))
+
+/-! ### The pinned weighted law as an interface -/
+
+/-- Interface for the pinned Gaussian regression law and its determinant tilt. The sample
+space `Ω` and its sigma-algebra are parameters; the sample paths `F`, the regression law
+`Q_r = Q r b k R` on the `2(d+1)` pin observations at `M = -(r/2)u`, `S = (r/2)u`
+(`u = R e_1`), the typed endpoint weight `W_r`, the tilted law `Q_r^W` and the contact
+kernel `Lambda_j` are GIVEN. The hypothesis fields transcribe: smooth `L`-periodic sample
+paths; `Q_r` is a probability measure under which, in the pin regime `0 < r < L`, the
+`2(d+1)` pin equations hold almost surely; `W_r ≥ 0` vanishes unless `H_M` is negative
+definite and `H_S` has index `d-1`; in the same regime `Z_r = E_(Q_r) W_r > 0` and
+`dQ_r^W = (W_r/Z_r) dQ_r` exactly (`Measure.withDensity`); and `Q_r^W` is a probability
+measure. The regime `0 < r < L` is this module's reading of the source clause "For small r>0
+the pins are": for `0 < r < L` the pins `M`, `S` are distinct modulo `L Z^d` (`‖S - M‖ = r`
+while every nonzero lattice vector has norm at least `L`), so the pin equations are
+consistent with `L`-periodicity; without the gate the structure would have no inhabitant for
+`L > 0` (at `r = L` along a coordinate frame the two pins coincide on the torus, so the pin
+values `b` and `b - k r^3` would be prescribed at one point). The Gaussian-regression
+construction of `Q_r`, the determinant factors `|det H_M| |det H_S|` of `W_r` and the
+Kac-Rice contact representation (13) of `Lambda_j` are informal in the sources and are NOT
+transcribed. Existence of such an object is not asserted (a Dirac mass at one smooth
+`L`-periodic sample path with the prescribed pin values, a nondegenerate maximum at `M` and a
+nondegenerate index-`(d-1)` saddle at `S`, with `W = 1` on that path, would satisfy the gated
+fields; this consistency remark is not a statement of this module).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7
+Anchor: "Q_r denotes continuous Gaussian regression on these 2(d+1) observations."
+Interface: 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.
+Does 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. -/
+structure PinnedLawInterface (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω] where
+ /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/
+ F : Ω → E d → ℝ
+ /-- Section 2 clause: "The real Fourier series therefore has smooth versions"; every
+ sample path is `C^n` for every finite `n`. -/
+ smooth : ∀ (ω : Ω) (n : ℕ), ContDiff ℝ n (F ω)
+ /-- Section 1 clause: the field lives "On X=R^d/(L Z^d)"; every sample path is `L`-periodic. -/
+ periodic : ∀ (ω : Ω) (x : E d) (n : Fin d → ℤ), F ω (x + latticeVec d L n) = F ω x
+ /-- Section 1 clause: "Q_r denotes continuous Gaussian regression on these 2(d+1)
+ observations", indexed by radius `r`, birth `b`, gap mark `k` and frame `R`. -/
+ Q : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → Measure Ω
+ /-- `Q_r` is a probability measure. -/
+ Q_prob : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), IsProbabilityMeasure (Q r b k R)
+ /-- Section 1 clause: the pins "f(M)=b, f(S)=b-k r^3, grad f(M)=grad f(S)=0" hold
+ `Q_r`-almost surely in the pin regime `0 < r < L` (source: "For small r>0 the pins are"). -/
+ Q_pinned : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 < r → r < L →
+ ∀ᵐ ω ∂(Q r b k R),
+ F ω (pinM d r (R 0)) = b ∧ F ω (pinS d r (R 0)) = b - k * r ^ 3 ∧
+ IsCriticalPoint d (F ω) (pinM d r (R 0)) ∧ IsCriticalPoint d (F ω) (pinS d r (R 0))
+ /-- Section 1 clause: the "actual endpoint weight" `W_r=F_d(H_M) F_(d-1)(H_S)`, as a
+ given functional of the sample. -/
+ W : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → Ω → ℝ
+ /-- `W_r ≥ 0` (a product of filtered absolute determinants). -/
+ W_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (ω : Ω), 0 ≤ W r b k R ω
+ /-- Section 1 clause: `F_j(H)=|det H| 1{H has j negative eigenvalues}`, "with value zero
+ on singular matrices"; so `W_r ≠ 0` forces `H_M` negative definite and `H_S` of index
+ `d-1`. -/
+ W_typed : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (ω : Ω), W r b k R ω ≠ 0 →
+ HessianHasInertia d (F ω) (pinM d r (R 0)) d ∧ HessianHasInertia d (F ω) (pinS d r (R 0)) (d - 1)
+ /-- Section 1 clause: the "FULL normalizer" `Z_r=E_(Q_r) W_r` is positive in the pin
+ regime `0 < r < L`. -/
+ Z_pos : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 < r → r < L →
+ 0 < ∫ ω, W r b k R ω ∂(Q r b k R)
+ /-- The tilted law `Q_r^W`. -/
+ QW : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → Measure Ω
+ /-- Section 1 clause: `dQ_r^W=(W_r/Z_r)dQ_r`, exactly, in the pin regime `0 < r < L`. -/
+ QW_eq : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 < r → r < L →
+ QW r b k R = (Q r b k R).withDensity
+ (fun ω => ENNReal.ofReal (W r b k R ω / ∫ ω', W r b k R ω' ∂(Q r b k R)))
+ /-- `Q_r^W` is a probability measure. -/
+ QW_prob : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), IsProbabilityMeasure (QW r b k R)
+ /-- Section 5 clause (13): "The contact kernel is Lambda_j(x;b,k,u)", a given function of
+ the index `j`, birth `b`, gap mark `k`, axial direction `u` and position `x`. -/
+ Λ : ℕ → ℝ → ℝ → E d → E d → ℝ
+
+/-! ### Counts and regions -/
+
+/-- `N_(r,j)(E)`: the number of index-`j` critical points of `g` in `A` with height STRICTLY
+between `b - k r^3` and `b` (`Set.ncard`, which is `0` for an infinite set).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7
+Anchor: "N_(r,j)(E)=#{x in E: grad f(x)=0, index H_x=j,"
+Interface: none.
+Does 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). -/
+noncomputable def windowCount (d : ℕ) (g : E d → ℝ) (b k r : ℝ) (j : ℕ) (A : Set (E d)) : ℕ :=
+ Set.ncard {x : E d | x ∈ A ∧ IsCriticalPoint d g x ∧ HessianHasInertia d g x j ∧
+ b - k * r ^ 3 < g x ∧ g x < b}
+
+/-- All-index window count: the number of critical points of `g` in `A` (degenerate ones
+included) with height strictly between `b - k r^3` and `b`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b
+Anchor: "`N` is the number of critical points of `f` in `X minus {M, S}` with height in `I_r`, all"
+Interface: none.
+Does not claim: finiteness of the counted set; equality with the sum of the index counts (true off the degenerate locus, not stated). -/
+noncomputable def windowCountAll (d : ℕ) (g : E d → ℝ) (b k r : ℝ) (A : Set (E d)) : ℕ :=
+ Set.ncard {x : E d | x ∈ A ∧ IsCriticalPoint d g x ∧ b - k * r ^ 3 < g x ∧ g x < b}
+
+/-- `N(E) = sum_j N_j(E)`: the all-index window count of the remote-collision note, the sum
+over `j = 0, ..., d` of the index-`j` window counts (critical points with nonsingular Hessian
+of index `j`; an index above `d` does not occur in `R^d`).
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/remote_collision_20260928/PROOF.md sha256 b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2
+Anchor: "N(E) = sum_j N_j(E)."
+Interface: none.
+Does not claim: finiteness of the counted sets; equality with `windowCountAll` (the two agree only off the degenerate locus). -/
+noncomputable def windowCountIndexSum (d : ℕ) (g : E d → ℝ) (b k r : ℝ) (A : Set (E d)) : ℕ :=
+ ∑ j ∈ Finset.range (d + 1), windowCount d g b k r j A
+
+/-- `N_j(E)`: the number of index-`j` critical points of `g` in `A` at all heights.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_annulus_bridge_20260925/PROOF.md sha256 d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05
+Anchor: "let N_j(rE) count index-j critical points in rE at **all heights**."
+Interface: none.
+Does not claim: finiteness of the counted set. -/
+noncomputable def allHeightCount (d : ℕ) (g : E d → ℝ) (j : ℕ) (A : Set (E d)) : ℕ :=
+ Set.ncard {x : E d | x ∈ A ∧ IsCriticalPoint d g x ∧ HessianHasInertia d g x j}
+
+/-- The remote region `D_rho = {x : dist_X(x,0) >= rho}`, represented in the fundamental
+domain so that a Borel subset of it carries one representative per torus point.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7
+Anchor: "Fix 0=rho}."
+Interface: none.
+Does not claim: anything about the representation of torus Borel sets beyond this choice. -/
+def remoteRegion (d : ℕ) (L ρ : ℝ) : Set (E d) :=
+ {x : E d | x ∈ FundDomain d L ∧ ρ ≤ torusDist d L x 0}
+
+/-- The torus with the two pins removed, `X minus {M, S}`, represented in the fundamental
+domain: points at positive torus distance from both `M = -(r/2)u` and `S = (r/2)u`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b
+Anchor: "critical points of `f` in `X minus {M, S}`"
+Interface: none.
+Does not claim: anything beyond the definition. -/
+def torusMinusPins (d : ℕ) (L r : ℝ) (u : E d) : Set (E d) :=
+ {x : E d | x ∈ FundDomain d L ∧ 0 < torusDist d L x (pinM d r u) ∧ 0 < torusDist d L x (pinS d r u)}
+
+/-- The torus-wide all-index window count `N` of the C6 notes: critical points other than
+`M, S` with height in `I_r = (b - k r^3, b)`, under the frame `R` (axial direction `R 0`).
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b
+Anchor: "`N` is the number of critical points of `f` in `X minus {M, S}` with height in `I_r`, all"
+Interface: `I : PinnedLawInterface` supplies the sample paths.
+Does not claim: finiteness or measurability of the count as a function of the sample. -/
+noncomputable def torusWindowCount (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (ω : Ω) : ℕ :=
+ windowCountAll d (I.F ω) b k r (torusMinusPins d L r (R 0))
+
+/-- Ordered pairs of distinct window critical points (both in `X minus {M, S}`, both with
+height in `I_r`, at positive torus distance from each other) such that the FIRST witness is
+within torus distance `η` of a pin. All mutual separations are included, down to collision.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "one witness is within fixed `η` of a pin."
+Interface: none.
+Does not claim: finiteness or measurability of the counted set (`Set.ncard` is `0` on an infinite set);
+that an ordered pair whose only near-pin witness is in second position is counted (it is not: it is
+the swap of a counted pair, so in the finite case the source's "at least one witness near a pin"
+count lies between this count and twice it, and a bound `C r^3` on this count is a bound `2 C r^3`
+on the source's; the two functionals are not literally the same). -/
+noncomputable def nearPinPairCount (d : ℕ) (L : ℝ) (g : E d → ℝ) (b k r η : ℝ) (u : E d) : ℕ :=
+ Set.ncard {q : E d × E d |
+ q.1 ∈ torusMinusPins d L r u ∧ q.2 ∈ torusMinusPins d L r u ∧ 0 < torusDist d L q.1 q.2 ∧
+ IsCriticalPoint d g q.1 ∧ IsCriticalPoint d g q.2 ∧
+ b - k * r ^ 3 < g q.1 ∧ g q.1 < b ∧ b - k * r ^ 3 < g q.2 ∧ g q.2 < b ∧
+ (torusDist d L q.1 (pinM d r u) < η ∨ torusDist d L q.1 (pinS d r u) < η)}
+
+/-- The scaled chart `x0 + r E0` read through the frame `R`: the image of a coordinate set
+`E0` (coordinates `p` with `p 0` axial) under `p ↦ x0 + r ∑ p_i R_i`. With `x0 = 0` these
+are the midpoint scaled coordinates `X = r(u, v)`, in which the pins are `(±1/2, 0)`; with
+`x0 = M` they are the endpoint chart `M + r(p, q)`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "Scaled coordinates are `X = r(u, v)` from the midpoint, so the pins are `(±1/2, 0)`."
+Interface: none.
+Does not claim: that the image lies in one fundamental domain (the sources take `r` small enough for the chart to embed in the torus). -/
+noncomputable def scaledAt (d : ℕ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (r : ℝ) (x0 : E d)
+ (E0 : Set (E d)) : Set (E d) :=
+ (fun p : E d => x0 + r • ∑ i, p i • R i) '' E0
+
+/-- The compact collar `C(eta, R)` in midpoint scaled coordinates: the ball of radius `R`
+(boundary included) with the two open balls of radius `eta` about the scaled pins
+`(-1/2, 0)` and `(1/2, 0)` removed.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80
+Anchor: "with the two open balls of radius `eta` about `(-1/2, 0)` and `(1/2, 0)` removed"
+Interface: none.
+Does not claim: anything beyond the definition; RECONCILIATION.md writes the same set `C_{η,R}` without defining it, and this definition is taken from the dimension-lift source. -/
+def collar (d : ℕ) [NeZero d] (η R0 : ℝ) : Set (E d) :=
+ {p : E d | ‖p‖ ≤ R0 ∧ η ≤ ‖p - EuclideanSpace.single (0 : Fin d) (-(1 : ℝ) / 2)‖ ∧
+ η ≤ ‖p - EuclideanSpace.single (0 : Fin d) ((1 : ℝ) / 2)‖}
+
+/-- The weight `omega_d(p, q) = max(|q|, r |p|)^(2-d)` of the endpoint chart, where `p` is
+the axial coordinate (`p 0`) and `q` the transverse part; `omega_2 = 1`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80
+Anchor: "omega_d(p, q) = max(|q|, r |p|)^(2-d)"
+Interface: none.
+Does not claim: integrability of the weight over the punctured ball (part of the Theorem P_d statement). -/
+noncomputable def omegaD (d : ℕ) [NeZero d] (r : ℝ) (p : E d) : ℝ :=
+ (max ‖p - EuclideanSpace.single (0 : Fin d) (p 0)‖ (r * |p 0|)) ^ ((2 : ℝ) - d)
+
+/-- `E_(Q_r^W) N_(r,j)(A)`: the expected index-`j` window count in `A` under the tilted law.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7
+Anchor: "E_(Q_r^W) N_(r,j)(E)"
+Interface: `I : PinnedLawInterface` supplies the sample paths and the tilted law; the Kac-Rice representation (12) of this expectation is NOT used.
+Does not claim: integrability of the count (if it is not integrable the Bochner integral is `0`). -/
+noncomputable def meanWindowCount (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (j : ℕ)
+ (A : Set (E d)) : ℝ :=
+ ∫ ω, (windowCount d (I.F ω) b k r j A : ℝ) ∂(I.QW r b k R)
+
+/-- `E_(Q_r^W) N_j(A)`: the expected index-`j` all-height count in `A` under the tilted law.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_annulus_bridge_20260925/PROOF.md sha256 d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05
+Anchor: "E_(Q_r^W) N_j(rE)"
+Interface: `I : PinnedLawInterface` supplies the sample paths and the tilted law; the weighted Kac-Rice intensity (16) is NOT used.
+Does not claim: integrability of the count. -/
+noncomputable def meanAllHeightCount (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (j : ℕ)
+ (A : Set (E d)) : ℝ :=
+ ∫ ω, (allHeightCount d (I.F ω) j A : ℝ) ∂(I.QW r b k R)
+
+/-! ### Fixed-remote Theorem A, displays (2) and (3) -/
+
+/-- Shape of Theorem A, display (2) (fixed-remote mean measure): for fixed `d ≥ 2`, `L > 0`,
+`0 < ρ < L/4`, compact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `kLo > 0`, there are
+`r_* > 0` and `C` (quantified OUTSIDE the universal quantifiers) such that for all
+`0 < r ≤ r_*`, `b ∈ B`, `k ∈ K`, frames `R`, indices `j ≤ d` and Borel `E ⊆ D_ρ`,
+`| 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
+`Lambda_j` is continuous on `D_ρ`, bounded above and away from zero uniformly on the
+compact parameter sets.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7
+Anchor: "| E_(Q_r^W) N_(r,j)(E)/(k r^3)"
+Interface: `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.
+Does 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). -/
+def FixedRemoteMeanMeasureA2 (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (ρ bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → 0 < ρ → ρ < L / 4 → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ C : ℝ,
+ (∃ cΛ : ℝ, 0 < cΛ ∧ ∃ CΛ : ℝ, ∀ j : ℕ, j ≤ d →
+ ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi, ∀ R : OrthonormalBasis (Fin d) ℝ (E d),
+ ContinuousOn (I.Λ j b k (R 0)) (remoteRegion d L ρ) ∧
+ ∀ x ∈ remoteRegion d L ρ, cΛ ≤ I.Λ j b k (R 0) x ∧ I.Λ j b k (R 0) x ≤ CΛ) ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ ∀ A : Set (E d), MeasurableSet A → A ⊆ remoteRegion d L ρ →
+ |meanWindowCount d L Ω I r b k R j A / (k * r ^ 3) - ∫ x in A, I.Λ j b k (R 0) x| ≤
+ C * r * (volume A).toReal
+
+/-- Shape of Theorem A, display (3) (fixed-remote count and event bounds): with the same
+fixed data and existential `r_* > 0`, `C`, for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K`, frames,
+indices and Borel `E ⊆ D_ρ`, `E_(Q_r^W) N_(r,j)(E) ≤ C k r^3 |E|` and
+`P_(Q_r^W){N_(r,j)(E) ≥ 1} ≤ C k r^3 |E|`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7
+Anchor: "E_(Q_r^W) N_(r,j)(E) <= C k r^3 |E|,"
+Interface: `I` is a given object as in `FixedRemoteMeanMeasureA2`.
+Does 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. -/
+def FixedRemoteCountBoundA3 (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (ρ bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → 0 < ρ → ρ < L / 4 → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ C : ℝ,
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ ∀ A : Set (E d), MeasurableSet A → A ⊆ remoteRegion d L ρ →
+ meanWindowCount d L Ω I r b k R j A ≤ C * k * r ^ 3 * (volume A).toReal ∧
+ ((I.QW r b k R) {ω | 1 ≤ windowCount d (I.F ω) b k r j A}).toReal ≤
+ C * k * r ^ 3 * (volume A).toReal
+
+/-! ### Fixed scaled annulus (d = 2): the height-window candidate (A2) and the all-height
+bridge (2) -/
+
+/-- Shape of the fixed-annulus height-window candidate statement (A2): `d = 2`, fixed `L > 0`,
+compact marks (`b ∈ [bLo, bHi]`, `0 < kLo ≤ k ≤ kHi`), fixed scaled annulus
+`K = {A0 ≤ |(u,t)| ≤ B0}` with `1 < A0 < B0`; there are `C, r_* > 0`, uniform in the frame,
+the marks, the Borel `E0 ⊆ K` and `j ∈ {0,1,2}`, such that
+`E_(Q_r^W) N_j(r E0) ≤ C k r^3 area(E0)` for `0 < r ≤ r_*`, where `N_j(r E0)` counts
+index-`j` critical points in `r E0` with height STRICTLY between `b - k r^3` and `b`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md sha256 1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b
+Anchor: "E_Qr^W N_j(r E0) <= C*k*r^3*area(E0),"
+Interface: `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.
+Does 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). -/
+def FixedAnnulusWindowCandidateA2 (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi A0 B0 : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi → 1 < A0 → A0 < B0 →
+ ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ ∀ E0 : Set (E 2), MeasurableSet E0 → E0 ⊆ {p : E 2 | A0 ≤ ‖p‖ ∧ ‖p‖ ≤ B0} →
+ meanWindowCount 2 L Ω I r b k R j (scaledAt 2 R r 0 E0) ≤
+ C * k * r ^ 3 * (volume E0).toReal
+
+/-- Shape of the all-height fixed-annulus bridge candidate statement, display (2): `d = 2`,
+fixed `L > 0`, compact marks, fixed scaled annulus `K_AB = {A ≤ |(u,v)| ≤ B}` with
+`1 < A < B`; there are `C, r_* > 0`, uniform in the marks, frames, Borel `E ⊆ K_AB` and
+`j ∈ {0,1,2}`, such that `E_(Q_r^W) N_j(rE) ≤ C r^3 area(E)` for `0 < r ≤ r_*`, where
+`N_j(rE)` counts index-`j` critical points in `rE` at ALL heights. The review interfaces
+R1-R7 of the source are the steps of its proof, not parts of this statement.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_annulus_bridge_20260925/PROOF.md sha256 d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05
+Anchor: "E_(Q_r^W) N_j(rE) <= C r^3 area(E), 0 0`, all frames and indices, existential constants) -/
+
+/-- Shape of row D5-a (P2, punctured pin disks): all heights; for Borel
+`E ⊂ {0 < p² + q² ≤ 1/16}` in the endpoint chart, `E_{Q_r^W} N_j(M + rE) ≤ C r³|E|`, and
+the same at `S`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "E_{Q_r^W} N_j(M + rE) ≤ C r³|E|"
+Interface: `I` is a given object; the chart `M + rE` is `scaledAt` based at the pin.
+Does 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. -/
+def D5aPuncturedPinDisks (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ ∀ E0 : Set (E 2), MeasurableSet E0 →
+ E0 ⊆ {p : E 2 | 0 < ‖p‖ ^ 2 ∧ ‖p‖ ^ 2 ≤ (1 : ℝ) / 16} →
+ meanAllHeightCount 2 L Ω I r b k R j (scaledAt 2 R r (pinM 2 r (R 0)) E0) ≤
+ C * r ^ 3 * (volume E0).toReal ∧
+ meanAllHeightCount 2 L Ω I r b k R j (scaledAt 2 R r (pinS 2 r (R 0)) E0) ≤
+ C * r ^ 3 * (volume E0).toReal
+
+/-- Shape of row D5-b (microdisk): all heights; for fixed `κ > 0`, the expected index-`j`
+count in the punctured disk of physical radius `κ r²` about each pin is `O(r⁵)`: there are
+`C, r_* > 0` with `E_{Q_r^W} N_j(disk) ≤ C r^5` for `0 < r ≤ r_*`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "the nested disks of radius `κr²` about each pin, for fixed `κ`: `O(r⁵)`"
+Interface: `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`.
+Does not claim: the P2 source or its nested-disk corollary; any numerical constant; uniformity in `κ`; nonauthor review or acceptance. -/
+def D5bMicrodisk (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∀ κ : ℝ, 0 < κ → ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ meanAllHeightCount 2 L Ω I r b k R j
+ {x : E 2 | 0 < ‖x - pinM 2 r (R 0)‖ ∧ ‖x - pinM 2 r (R 0)‖ ≤ κ * r ^ 2} ≤ C * r ^ 5 ∧
+ meanAllHeightCount 2 L Ω I r b k R j
+ {x : E 2 | 0 < ‖x - pinS 2 r (R 0)‖ ∧ ‖x - pinS 2 r (R 0)‖ ≤ κ * r ^ 2} ≤ C * r ^ 5
+
+/-- Shape of row D5-c (C1, compact collar): all heights; for fixed `R ≥ 1` and
+`0 < η ≤ 1/4`, for Borel `E ⊂ C_{η,R}` in midpoint scaled coordinates,
+`E_{Q_r^W} N_j(rE) ≤ C r³|E|`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "for Borel `E ⊂ C_{η,R}`, `η ≤ 1/4`, fixed `R ≥ 1`"
+Interface: `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).
+Does not claim: the C1 source (COLLAR_PROOF.md) or its proof; the normalizer (P14) it imports; any numerical constant; nonauthor review or acceptance. -/
+def D5cCollarC1 (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∀ η R0 : ℝ, 0 < η → η ≤ (1 : ℝ) / 4 → 1 ≤ R0 → ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ ∀ E0 : Set (E 2), MeasurableSet E0 → E0 ⊆ collar 2 η R0 →
+ meanAllHeightCount 2 L Ω I r b k R j (scaledAt 2 R r 0 E0) ≤
+ C * r ^ 3 * (volume E0).toReal
+
+/-- Shape of row D5-d (C2, the summed pin-neighbourhood bound): all heights; for fixed
+`R ≥ 1`, `E_{Q_r^W} N_j(r B_R ∖ {M,S}) ≤ C_R r³`, the scaled ball of radius `R` with the
+two pins removed.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "E_{Q_r^W} N_j(r B_R ∖ {M,S}) ≤ C_R r³"
+Interface: `I` is a given object.
+Does 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. -/
+def D5dSummedPinNeighbourhoodC2 (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∀ R0 : ℝ, 1 ≤ R0 → ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ meanAllHeightCount 2 L Ω I r b k R j (scaledAt 2 R r 0
+ {p : E 2 | ‖p‖ ≤ R0 ∧ p ≠ EuclideanSpace.single (0 : Fin 2) (-(1 : ℝ) / 2) ∧
+ p ≠ EuclideanSpace.single (0 : Fin 2) ((1 : ℝ) / 2)}) ≤ C * r ^ 3
+
+/-- Shape of row D5-e (I3/I4, intermediate shells): window `I_r`; the dyadic shells and
+`{A_0 r ≤ |X| ≤ ρ}` satisfy `E N ≤ C r³(A_0^{−2} + ρ²)`: there are `C, s_0 > 0` such that
+for `A_0 ≥ 4` and `A_0 r < ρ ≤ s_0` the expected index-`j` window count in
+`{A_0 r ≤ |X| ≤ ρ}` (distance from the midpoint) is at most `C r^3 (A_0^(-2) + ρ^2)`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "E N ≤ C r³(A_0^{−2} + ρ²)"
+Interface: `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.
+Does 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. -/
+def D5eIntermediateShellsI3I4 (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C s0 : ℝ, 0 < C ∧ 0 < s0 ∧
+ ∀ A0 ρ r : ℝ, 4 ≤ A0 → 0 < r → A0 * r < ρ → ρ ≤ s0 →
+ ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ meanWindowCount 2 L Ω I r b k R j {x : E 2 | A0 * r ≤ ‖x‖ ∧ ‖x‖ ≤ ρ} ≤
+ C * r ^ 3 * ((A0 ^ 2)⁻¹ + ρ ^ 2)
+
+/-- Shape of row D5-f (I5, global window first moment and planar event order): window
+`I_r`; `E_{Q_r^W} N_{r,j}(T² ∖ {M,S}) ≤ C r³`, and for the event `A_r` that some critical
+point other than `M, S` has height in `I_r`, `c r³ ≤ P(A_r) ≤ C r³` with `c > 0`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "E_{Q_r^W} N_{r,j}(T² ∖ {M,S}) ≤ C r³"
+Interface: `I` is a given object; `A_r` is the event `{N ≥ 1}` for the all-index torus-wide window count.
+Does 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. -/
+def D5fGlobalWindowFirstMomentI5 (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ (∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ meanWindowCount 2 L Ω I r b k R j (torusMinusPins 2 L r (R 0)) ≤ C * r ^ 3) ∧
+ (∃ c C rStar : ℝ, 0 < c ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2),
+ c * r ^ 3 ≤ ((I.QW r b k R) {ω | 1 ≤ torusWindowCount 2 L Ω I r b k R ω}).toReal ∧
+ ((I.QW r b k R) {ω | 1 ≤ torusWindowCount 2 L Ω I r b k R ω}).toReal ≤ C * r ^ 3)
+
+/-! ### The dimension lift: Theorems P_d, C_d, I_d, G_d (every fixed d ≥ 2) -/
+
+/-- Shape of Theorem P_d (all-height punctured pin ball), display (1.2): fixed `d ≥ 2`,
+`L > 0`, compact marks; there are `C, C', r_* > 0` such that for `0 < r ≤ r_*`, all `b, k, R, j`
+and every Borel `E ⊆ D = {0 < p² + |q|² ≤ 1/16}` in the endpoint chart,
+`E_(Q_r^W) N_j(M + r E) ≤ C r^3 ∫_E omega_d ≤ C' r^3`, and the same about `S`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80
+Anchor: "E_(Q_r^W) N_j(M + r E) <= C r^3 integral_E omega_d(p, q) dp dq <= C' r^3."
+Interface: `I` is a given object; the chart is `scaledAt` based at the pin; the weight is `omegaD`.
+Does 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. -/
+def DimensionLiftPuncturedPinBallP (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C C' rStar : ℝ, 0 < C ∧ 0 < C' ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ ∀ E0 : Set (E d), MeasurableSet E0 →
+ E0 ⊆ {p : E d | 0 < ‖p‖ ^ 2 ∧ ‖p‖ ^ 2 ≤ (1 : ℝ) / 16} →
+ (meanAllHeightCount d L Ω I r b k R j (scaledAt d R r (pinM d r (R 0)) E0) ≤
+ C * r ^ 3 * ∫ p in E0, omegaD d r p ∧
+ C * r ^ 3 * ∫ p in E0, omegaD d r p ≤ C' * r ^ 3) ∧
+ (meanAllHeightCount d L Ω I r b k R j (scaledAt d R r (pinS d r (R 0)) E0) ≤
+ C * r ^ 3 * ∫ p in E0, omegaD d r p ∧
+ C * r ^ 3 * ∫ p in E0, omegaD d r p ≤ C' * r ^ 3)
+
+/-- Shape of Theorem C_d (compact collar), display (1.3): fixed `d ≥ 2`, `L > 0`, compact
+marks, fixed `R ≥ 1` and `0 < η ≤ 1/4`; there are `C, r_* > 0` such that for every Borel
+`E ⊆ C(η, R)`, `E_(Q_r^W) N_j(r E) ≤ C r^3 |E|` for `0 < r ≤ r_*`, all `b, k, R, j`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80
+Anchor: "E_(Q_r^W) N_j(r E) <= C r^3 |E|."
+Interface: `I` is a given object; `C(η, R)` is `collar d η R`.
+Does 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. -/
+def DimensionLiftCompactCollarC (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∀ η R0 : ℝ, 0 < η → η ≤ (1 : ℝ) / 4 → 1 ≤ R0 → ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ ∀ E0 : Set (E d), MeasurableSet E0 → E0 ⊆ collar d η R0 →
+ meanAllHeightCount d L Ω I r b k R j (scaledAt d R r 0 E0) ≤
+ C * r ^ 3 * (volume E0).toReal
+
+/-- Shape of Theorem I_d (intermediate height-window shells), displays (1.5) and (1.6):
+there are `C, s_0 > 0` such that for `0 < r ≤ s/4` and `0 < s ≤ s_0`,
+`E_(Q_r^W) N_(r,j)({ s ≤ |X| ≤ 2 s }) ≤ C r^3 [ (r/s)^2 + s^2 ]`, and hence, uniformly for
+`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)`.
+`|X|` is the distance from the midpoint.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80
+Anchor: "E_(Q_r^W) N_(r,j)({ s <= |X| <= 2 s }) <= C r^3 [ (r/s)^2 + s^2 ],"
+Interface: `I` is a given object.
+Does 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. -/
+def DimensionLiftIntermediateShellsI (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C s0 : ℝ, 0 < C ∧ 0 < s0 ∧
+ (∀ r s : ℝ, 0 < r → r ≤ s / 4 → 0 < s → s ≤ s0 →
+ ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ meanWindowCount d L Ω I r b k R j {x : E d | s ≤ ‖x‖ ∧ ‖x‖ ≤ 2 * s} ≤
+ C * r ^ 3 * ((r / s) ^ 2 + s ^ 2)) ∧
+ (∀ A0 ρ r : ℝ, 4 ≤ A0 → 0 < r → A0 * r < ρ → ρ ≤ s0 →
+ ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ meanWindowCount d L Ω I r b k R j {x : E d | A0 * r ≤ ‖x‖ ∧ ‖x‖ ≤ ρ} ≤
+ C * r ^ 3 * ((A0 ^ 2)⁻¹ + ρ ^ 2))
+
+/-- Shape of Theorem G_d (global height-window first moment), display (1.7): fixed `d ≥ 2`,
+`L > 0`, compact marks; there are `C, r_* > 0` such that
+`E_(Q_r^W) N_(r,j)( X minus {M, S} ) ≤ C r^3` for `0 < r ≤ r_*`, all `b, k, R, j`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80
+Anchor: "E_(Q_r^W) N_(r,j)( X minus {M, S} ) <= C r^3."
+Interface: `I` is a given object.
+Does 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. -/
+def DimensionLiftGlobalWindowG (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ meanWindowCount d L Ω I r b k R j (torusMinusPins d L r (R 0)) ≤ C * r ^ 3
+
+/-! ### C6: Fourier cutoff (F4), Palm route (Theorem Q, Corollary Theta) -/
+
+/-- Shape of the planar Fourier-cutoff consequence (F4): in `d = 2`, GIVEN the
+dimension-matched first-moment hypothesis `G_2` (`E_(Q_r^W) N ≤ C r^3` for small `r`,
+uniformly in the marks and frames), there are `C` and `r_* > 0` such that
+`E_(Q_r^W) N(N-1) ≤ C r^3 log(1/r)` for `0 < r ≤ r_*`, all `b, k, R`. The source derives
+this from Theorem W with `p = 2`; the hypothesis `G_2` is stated as a hypothesis here, not
+discharged.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_fourier_cutoff_20260929/PROOF.md sha256 c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733
+Anchor: "E_Qr^W N(N-1) <= C r^3 log(1/r),"
+Interface: `I` is a given object; `N` is `torusWindowCount`; `(N)_2 = N(N-1)` is `Nat.descFactorial N 2`.
+Does 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. -/
+def FourierCutoffPlanarSecondFactorialF4 (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ (∃ C0 r0 : ℝ, 0 < r0 ∧
+ ∀ r : ℝ, 0 < r → r ≤ r0 → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2),
+ ∫ ω, (torusWindowCount 2 L Ω I r b k R ω : ℝ) ∂(I.QW r b k R) ≤ C0 * r ^ 3) →
+ ∃ C rStar : ℝ, 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2),
+ ∫ ω, (Nat.descFactorial (torusWindowCount 2 L Ω I r b k R ω) 2 : ℝ) ∂(I.QW r b k R) ≤
+ C * r ^ 3 * Real.log (1 / r)
+
+/-- Shape of Theorem Q (Palm route, factorial moments in every fixed dimension): fixed
+`d ≥ 2`, `L > 0`, compact marks; for every fixed integer `q ≥ 2` there are `C_q, r_* > 0`
+such that `E_(Q_r^W)[ (N)_q ] ≤ C_q r^3` for `0 < r ≤ r_*`, all `b, k, R`. The radius
+threshold is allowed to depend on `q` (the source's quantifier order is "There are
+`C_q, r_* > 0` such that for `0 < r ≤ r_*`, all `b, k, R` and every fixed integer `q ≥ 2`";
+the weaker reading with `r_*` after `q` is stated).
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b
+Anchor: "E_(Q_r^W)[ (N)_q ] <= C_q r^3."
+Interface: `I` is a given object; `N` is `torusWindowCount`; `(N)_q` is `Nat.descFactorial N q`.
+Does 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. -/
+def PalmRouteFactorialMomentsQ (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∀ q : ℕ, 2 ≤ q → ∃ Cq rStar : ℝ, 0 < Cq ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d),
+ ∫ ω, (Nat.descFactorial (torusWindowCount d L Ω I r b k R ω) q : ℝ) ∂(I.QW r b k R) ≤
+ Cq * r ^ 3
+
+/-- Shape of Corollary Theta (the C6 order is `r^3`): in every fixed `d ≥ 2`, there are
+`c > 0`, `C` and `r_* > 0` such that `c r^3 ≤ E_(Q_r^W)[ N(N-1) ] ≤ C r^3` and
+`c r^3 ≤ Q_r^W{ N ≥ 2 } ≤ C r^3` for `0 < r ≤ r_*`, all `b, k, R`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b
+Anchor: "c r^3 <= E_(Q_r^W)[ N(N-1) ] <= C r^3,"
+Interface: `I` is a given object; `N` is `torusWindowCount`.
+Does 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. -/
+def PalmRouteSecondFactorialTheta (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ c C rStar : ℝ, 0 < c ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d),
+ c * r ^ 3 ≤
+ ∫ ω, (Nat.descFactorial (torusWindowCount d L Ω I r b k R ω) 2 : ℝ) ∂(I.QW r b k R) ∧
+ ∫ ω, (Nat.descFactorial (torusWindowCount d L Ω I r b k R ω) 2 : ℝ) ∂(I.QW r b k R) ≤
+ C * r ^ 3 ∧
+ c * r ^ 3 ≤ ((I.QW r b k R) {ω | 2 ≤ torusWindowCount d L Ω I r b k R ω}).toReal ∧
+ ((I.QW r b k R) {ω | 2 ≤ torusWindowCount d L Ω I r b k R ω}).toReal ≤ C * r ^ 3
+
+/-! ### C6 rare-cluster consequences: Theorem O (abstract, on laws on ℕ) -/
+
+/-- Total-variation distance between two probability mass functions on `ℕ`: half the `l^1`
+distance (the source's convention; equal to the supremum over events for probability laws).
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_rare_cluster_laws_20260929/PROOF.md sha256 c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb
+Anchor: "For probability laws, dTV is the supremum over measurable events, equivalently half the l1 distance on this countable state space."
+Interface: none; if the `l^1` series is not summable the `tsum` is `0`.
+Does not claim: equality with the event supremum (true for probability laws, not stated). -/
+noncomputable def pmfTV (μ ν : ℕ → ℝ) : ℝ :=
+ (1 / 2) * ∑' n : ℕ, |μ n - ν n|
+
+/-- The Poisson probability mass function `Pois(lam)(n) = exp(-lam) lam^n / n!`
+(for `lam ≥ 0`; `Pois(0) = δ_0`).
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_rare_cluster_laws_20260929/PROOF.md sha256 c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb
+Anchor: "dTV(Law N, Pois(lambda))"
+Interface: none; an explicit formula (the source's `Pois(lambda)`).
+Does not claim: that it sums to one (true for `lam ≥ 0`, not stated). -/
+noncomputable def poissonPMF (lam : ℝ) (n : ℕ) : ℝ :=
+ Real.exp (-lam) * lam ^ n / (Nat.factorial n : ℝ)
+
+/-- Shape of Theorem O (sharp ordinary-Poisson obstruction): for a family of laws
+`μ_r` on `ℕ` (the law of the window count `N_r`) which, for all sufficiently small `r`
+(that is, for `0 < r ≤ r_0` for some `r_0 > 0`), are probability mass functions with
+summable mean satisfying only (H1) `E N_r ≤ A r^3` and (H2) `P(N_r ≥ 2) ≥ a r^3` with
+`a > 0`: then, for all sufficiently small `r`,
+`(a/2) r^3 ≤ inf_{lambda ≥ 0} dTV(Law N_r, Pois(lambda)) ≤ A r^3`: every nonnegative
+intensity is at distance at least `(a/2) r^3`, and some intensity is within `A r^3`. The
+hypotheses are imposed only on `0 < r ≤ r_0`, as in the source ("for all sufficiently small
+r"); imposing (H2) for every `r > 0` would be unsatisfiable (`a r^3 ≤ 1` fails for large
+`r`) and would make the statement hold for every family. The source's remark that the
+premises imply `2a ≤ A` is not taken as a hypothesis.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_rare_cluster_laws_20260929/PROOF.md sha256 c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb
+Anchor: "(a/2) r^3 <= inf_{lambda>=0} dTV(Law N, Pois(lambda)) <= A r^3."
+Interface: 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).
+Does 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) uses Pois(0)=delta_0 and dTV(Law N,delta_0)=p); nonauthor review or acceptance. -/
+def RareClusterPoissonObstructionO (μ : ℝ → ℕ → ℝ) (a A : ℝ) : Prop :=
+ 0 < a →
+ (∃ r0 : ℝ, 0 < r0 ∧ ∀ r : ℝ, 0 < r → r ≤ r0 →
+ (∀ n : ℕ, 0 ≤ μ r n) ∧ Summable (μ r) ∧ ∑' n : ℕ, μ r n = 1 ∧
+ Summable (fun n : ℕ => (n : ℝ) * μ r n) ∧ ∑' n : ℕ, (n : ℝ) * μ r n ≤ A * r ^ 3 ∧
+ a * r ^ 3 ≤ 1 - μ r 0 - μ r 1) →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∀ r : ℝ, 0 < r → r ≤ rStar →
+ (∀ lam : ℝ, 0 ≤ lam → (a / 2) * r ^ 3 ≤ pmfTV (μ r) (poissonPMF lam)) ∧
+ (∃ lam : ℝ, 0 ≤ lam ∧ pmfTV (μ r) (poissonPMF lam) ≤ A * r ^ 3)
+
+/-! ### Remote collision (Corollary D) and the OPEN witness-collision target -/
+
+/-- Shape of Corollary D (second factorial moment in the fixed remote region): fixed `d ≥ 2`,
+`L > 0`, `0 < ρ < L/4`, compact marks; there are `C` and `r_* > 0` such that for
+`0 < r ≤ r_*`, all marks and frames and every Borel `E ⊆ D_ρ`,
+`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(E) = sum_j N_j(E)` is the sum of the index-`j` window counts in `E`
+(`windowCountIndexSum`, the source's definition). Pairs at every mutual separation inside
+`D_ρ`, down to coincidence, are included.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/remote_collision_20260928/PROOF.md sha256 b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2
+Anchor: "E_(Q_r^W) N(E)(N(E)-1) <= C r^5 |E|,"
+Interface: `I` is a given object; the pair Kac-Rice formula (3.1) and the divided-difference coordinates (4.1) are not transcribed.
+Does 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. -/
+def RemoteCollisionSecondFactorialD (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (ρ bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → 0 < ρ → ρ < L / 4 → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C rStar : ℝ, 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d),
+ ∀ A : Set (E d), MeasurableSet A → A ⊆ remoteRegion d L ρ →
+ ∫ ω, (Nat.descFactorial (windowCountIndexSum d (I.F ω) b k r A) 2 : ℝ) ∂(I.QW r b k R) ≤
+ C * r ^ 5 * (volume A).toReal ∧
+ ((I.QW r b k R) {ω | 2 ≤ windowCountIndexSum d (I.F ω) b k r A}).toReal ≤
+ C * r ^ 5 * (volume A).toReal
+
+/-- OPEN OBLIGATION, stated as a TARGET and not as a result. GRAPH node
+`math.rn-region.witness-collision` (classification OPEN_ACTIVE, catalog C6): the regional
+shrinking pin/witness-collision mechanism. The reconciliation describes what is missing as
+a torus-wide second factorial moment of the window count "with pairs where at least one
+witness is within fixed `η` of a pin", at every mutual separation (the fixed-remote `P_η`
+of Corollary D covers only pairs with both witnesses at distance `≥ η` from the pins). The
+Prop below is that target: fixed `d ≥ 2`, `L > 0`, `η > 0`, compact marks; there are `C` and
+`r_* > 0` with `E_(Q_r^W) #{ordered window pairs with the first witness within η of a pin} ≤ C r^3`
+for `0 < r ≤ r_*`, all `b, k, R`. No source in this packet establishes it; its register
+status is OPEN and this declaration does not change that.
+
+Scope note (statement-shape review 5483861746 on Math- PR #419, 2026-10-11, AMEND_SCOPE_NOTE;
+nothing below changes the Prop): (i) the source's §5 states its open obligation for the planar
+case and makes no claim for `d > 2`; the formal target quantifies every `d ≥ 2`, so its instances
+with `d > 2` are a proposed generalisation carried by this packet, not a transcription of the
+source's scope. (ii) `nearPinPairCount` counts ordered pairs whose FIRST witness is within `η` of
+a pin; the source's "at least one witness" set is the union of that set with its swap, so (in the
+finite case) it has between one and two times as many elements, and a bound `C r^3` here is a
+bound `2 C r^3` for the source's count: the orders agree, the functionals do not literally
+coincide. (iii) `Set.ncard` is `0` on an infinite set and `PinnedLawInterface` supplies neither
+almost-sure finiteness nor measurability of the pair population, so an infinite population would
+make the integrand vanish spuriously; reading this Prop as the source's second factorial moment
+needs those two facts about the law, which the interface does not provide and this Prop does not
+assume. The weighted law `I.QW` is a given field, not the source's six-pin regression.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "A torus-wide second factorial moment `E_{Q_r^W} N(N−1)` for the window count, with pairs where at least"
+Interface: `I` is a given object; the pair count is `nearPinPairCount`.
+Does 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. -/
+def WitnessCollisionNearPinPairsTarget (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (η bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → 0 < η → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C rStar : ℝ, 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d),
+ ∫ ω, (nearPinPairCount d L (I.F ω) b k r η (R 0) : ℝ) ∂(I.QW r b k R) ≤ C * r ^ 3
+
+end UniversalLaw.Spec.RN
diff --git a/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Side24.lean b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Side24.lean
new file mode 100644
index 000000000..cf461df95
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Side24.lean
@@ -0,0 +1,1014 @@
+import Mathlib
+
+/-!
+# SIDE24 coefficient in dimensions two and three (statements only)
+
+Scientific effect: NONE. Formal progress of every declaration here: `specified`.
+Organizational-independence credit of this transcription: 0 (Anthropic / Claude).
+
+This module transcribes, as definitions, interface structures and `Prop`-valued
+specifications, the displayed statements of the Layer 0 note
+`coefficients/side24_v1/PROOF.md` (object SIDE24-COEFFICIENT-D23-20260924-v1) and of its
+`ENCLOSURE.json`: the exact cone moments `D_1 = 4/3` and `D_2 = 29/6 - sqrt 6`, the
+reference coefficient `c_{d,ref}` of display (1), the image constant `E` of display (2), the
+relative covariance allowance `epsilon = 10^(-108)` of display (3), the twenty-digit
+published endpoints, the headline two-dimensional and three-dimensional enclosures, the
+reference comparison (4), the Section 2 derivative and lattice-image bounds, the Section 3
+joint-covariance ordering in the positive-semidefinite order, the Section 4 Gaussian density
+comparison and integrand-ratio bounds, and the Section 1 cone-moment identities with the
+Gaussian laws of the displayed variances `8/3`, `5/3`, `1`.
+
+The exact periodic coefficient `c_{d,24}` is "precisely its equation (15.2)" of the parent
+(UNIFORM-MATRIX-CAP-LIFETIME-20260924-v1); that formula involves the Gaussian cone expectation
+`D_u` of (15.1), which this module cannot write without a conditional-Gaussian construction.
+The coefficient is therefore an INTERFACE parameter (`PeriodicCoefficientInterface`): its
+defining property (15.2) is a hypothesis field, the cone moment `D_u` is a given field, and the
+densities and the conditional variance are pinned to derivatives of `K_24` by hypothesis fields.
+
+What this module does not establish. It consists only of definitions and structures; it
+states nothing as a result and proves nothing. It does not enclose the coefficient, does not
+evaluate `Gamma(7/6)`, does not prove any of the displayed inequalities, does not identify an
+object satisfying an interface here with the object of the source, and does not touch the
+parent's results. The Section 5 Stirling/`Gamma(7/6)` remainder procedure is described in the
+source as a method, not displayed as a precise statement, and is NOT specified here. The
+arithmetic skeleton of these displays (pairing counts, the image constant, `60E < epsilon`,
+odd-block minors, exponent inequalities, the `D_2` algebra, endpoint adjacency) is already
+kernel-checked on main as the 31 `UniversalLaw.Side24` targets of `formal/` at origin/main
+`f6deeba7`; nothing here re-proves it and nothing here encloses the coefficient. Nothing here
+promotes, reclassifies or discharges any claim, premise or obligation of the registers;
+alignment of these statements with the source is PENDING_INDEPENDENT_REVIEW.
+
+Primary sources (Layer 0, byte-pinned): `d6g8k5htny-coder/Math-` commit
+`760340e921ac4ceda296b8118da936f1133e956e`, paths `coefficients/side24_v1/PROOF.md`
+(sha256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`, source id
+`side24-proof`) and `coefficients/side24_v1/ENCLOSURE.json` (sha256
+`72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811`, source id
+`side24-enclosure`). Parent clause (15.2) quoted from source id `lifetime-parent`.
+-/
+
+namespace UniversalLaw.Spec.Side24
+
+open MeasureTheory
+
+/-- The ambient Euclidean space `R^d` of the field; `d ∈ {2, 3}` in the source.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Use its centered variance-one field with the exact normalized covariance"
+Interface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.
+Does not claim: anything about the field or the torus `R^d/(24 Z^d)`. -/
+abbrev E (d : ℕ) : Type := EuclideanSpace ℝ (Fin d)
+
+/-! ## Exact constants of the note -/
+
+/-- The cone moment `D_1 = 4/3` of the reference law for `m = d - 1 = 1`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "D_1=E[A^2 1{A<0}]=4/3."
+Interface: none; a rational constant.
+Does 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. -/
+noncomputable def coneMomentD1 : ℝ := 4 / 3
+
+/-- The cone moment `D_2 = 29/6 - sqrt 6` of the reference law for `m = d - 1 = 2`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: " = 29/6-sqrt(6)."
+Interface: none; an explicit real constant.
+Does 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. -/
+noncomputable def coneMomentD2 : ℝ := 29 / 6 - Real.sqrt 6
+
+/-- The reference cone moment `D_m` as a function of `m = d - 1`: `D_1` for `m = 1`, `D_2` for
+`m = 2`, and `0` (unspecified by the source) otherwise.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "c_d,ref = Gamma(7/6)*(3/2)^(1/3)*D_(d-1)"
+Interface: none.
+Does not claim: any value outside `m ∈ {1, 2}`; the value `0` there is a placeholder, not a cone moment. -/
+noncomputable def coneMomentRef (m : ℕ) : ℝ :=
+ if m = 1 then coneMomentD1 else if m = 2 then coneMomentD2 else 0
+
+/-- The nonperiodic reference coefficient of display (1):
+`c_{d,ref} = Gamma(7/6) (3/2)^(1/3) D_{d-1} / [2 sqrt 3 pi^(d-1) sqrt pi]`, `d = 2, 3`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "/ [2sqrt(3)*pi^(d-1)*sqrt(pi)], d=2,3."
+Interface: none; `Real.Gamma`, `Real.sqrt`, `Real.pi` and real powers are Mathlib's.
+Does 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)`. -/
+noncomputable def cRef (d : ℕ) : ℝ :=
+ Real.Gamma (7 / 6) * (3 / 2 : ℝ) ^ ((1 : ℝ) / 3) * coneMomentRef (d - 1) /
+ (2 * Real.sqrt 3 * Real.pi ^ (d - 1) * Real.sqrt Real.pi)
+
+/-- The image constant `E = 21175738586478 * 10^(-125)` of display (2), as a rational over a
+power of ten.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "= 21175738586478 *10^(-125)."
+Interface: none.
+Does not claim: the factorisation `1458*(76*24^6+15) = 21175738586478`, kernel-checked on main (`UniversalLaw.Side24.image_constant_value`), not here. -/
+noncomputable def imageConstE : ℝ := 21175738586478 / 10 ^ 125
+
+/-- The relative covariance allowance `epsilon = 10^(-108)` of display (3).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "epsilon=10^(-108), since60E Real.exp (-(‖z + latticeVec d n‖ ^ 2) / 2))
+
+/-! ## Section 2: the uniform derivative bound and the lattice-image bound -/
+
+/-- A tuple of `q` unit directions in `R^d` (the "unit directional differentiations", mixed
+directions allowed).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "For q<=6 unit directional differentiations of phi(x)=exp(-|x|^2/2), product-rule"
+Interface: none.
+Does not claim: anything. -/
+def IsUnitTuple (d q : ℕ) (u : Fin q → E d) : Prop :=
+ ∀ i, ‖u i‖ = 1
+
+/-- The product-rule pairing sum `sum_{j=0}^{floor(q/2)} q! r^(q-2j) / [2^j j! (q-2j)!]`
+evaluated at `r = |x|`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "q! |x|^(q-2j) / [2^j j! (q-2j)!]."
+Interface: none.
+Does not claim: that the sum of the coefficients at `q = 6` is `76` (kernel-checked on main, `UniversalLaw.Side24.pairing_sum_six`), nor the bound itself (`DerivativePairingBound`). -/
+noncomputable def pairingSum (q : ℕ) (r : ℝ) : ℝ :=
+ ∑ j ∈ Finset.range (q / 2 + 1),
+ (Nat.factorial q : ℝ) * r ^ (q - 2 * j) /
+ ((2 : ℝ) ^ j * (Nat.factorial j : ℝ) * (Nat.factorial (q - 2 * j) : ℝ))
+
+/-- Section 2, first display: for `q ≤ 6` and unit directions, the absolute `q`-th directional
+derivative of `phi(x) = exp(-|x|^2/2)` is at most `exp(-|x|^2/2)` times the pairing sum.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "pairings bound the absolute derivative by"
+Interface: none; the derivative is Mathlib's `iteratedFDeriv ℝ q` applied to the direction tuple.
+Does not claim: the bound (statement only); validity for `q > 6` (the source restricts to `q ≤ 6`); nothing here encloses the coefficient. -/
+def DerivativePairingBound : Prop :=
+ ∀ (d q : ℕ), q ≤ 6 → ∀ (x : E d) (u : Fin q → E d), IsUnitTuple d q u →
+ |iteratedFDeriv ℝ q (Kinf d) x u| ≤ Real.exp (-(‖x‖ ^ 2) / 2) * pairingSum q ‖x‖
+
+/-- Section 2: at `|x| ≥ 1` every unit-direction contraction of order `q ≤ 6` of
+`phi(x) = exp(-|x|^2/2)` is bounded by `76 |x|^6 exp(-|x|^2/2)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "At |x|>=1 this is at most76 |x|^6 e^(-|x|^2/2)."
+Interface: none.
+Does 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 coefficient. -/
+def DerivativeBoundAtLeastOne : Prop :=
+ ∀ (d q : ℕ), q ≤ 6 → ∀ (x : E d), 1 ≤ ‖x‖ → ∀ (u : Fin q → E d), IsUnitTuple d q u →
+ |iteratedFDeriv ℝ q (Kinf d) x u| ≤ 76 * ‖x‖ ^ 6 * Real.exp (-(‖x‖ ^ 2) / 2)
+
+/-- Section 2: at zero every unit-direction contraction of order `q ≤ 6` of `phi` has absolute
+value at most `15`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "contraction has absolute value at most15."
+Interface: none.
+Does not claim: the bound (statement only); `5!! = 15` is kernel-checked on main (`UniversalLaw.Side24.sixth_moment_double_factorial`), not here. -/
+def DerivativeBoundAtZero : Prop :=
+ ∀ (d q : ℕ), q ≤ 6 → ∀ (u : Fin q → E d), IsUnitTuple d q u →
+ |iteratedFDeriv ℝ q (Kinf d) 0 u| ≤ 15
+
+/-- The squared Euclidean length `|n|^2 = sum_i n_i^2` of an integer point.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "sum_{n!=0} |n|^6 e^(-288|n|^2)"
+Interface: none.
+Does not claim: anything. -/
+noncomputable def intNormSq (d : ℕ) (n : Fin d → ℤ) : ℝ :=
+ ∑ i, ((n i : ℤ) : ℝ) ^ 2
+
+/-- The lattice-image term `|n|^6 exp(-288 |n|^2)` for `n ≠ 0`, and `0` at `n = 0`
+(`288 = 24^2/2`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "sum_{n!=0} |n|^6 e^(-288|n|^2)"
+Interface: none.
+Does not claim: `24^2/2 = 288`, kernel-checked on main (`UniversalLaw.Side24.period_exponent`), not here. -/
+noncomputable def imageTerm (d : ℕ) (n : Fin d → ℤ) : ℝ :=
+ if n = 0 then 0 else intNormSq d n ^ 3 * Real.exp (-288 * intNormSq d n)
+
+/-- Section 2 lattice bound: for `d ≤ 3`, the image family is summable and
+`sum_{n ≠ 0} |n|^6 exp(-288|n|^2) ≤ 1458 exp(-288)`. Summability is stated so the `tsum` is
+not the vacuous `0`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "<=1458 e^(-288)."
+Interface: none.
+Does 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_constant`), not here. -/
+def LatticeImageSumBound : Prop :=
+ ∀ d : ℕ, d ≤ 3 →
+ Summable (fun n : Fin d → ℤ => imageTerm d n) ∧
+ (∑' n : Fin d → ℤ, imageTerm d n) ≤ 1458 * Real.exp (-288)
+
+/-- Section 2: successive terms `j^9 exp(-288 j^2)`, `j ≥ 1`, have ratio at most
+`512 exp(-864)`, and that constant is below `1/2`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "successive terms have ratio at most512e^(-864)<1/2."
+Interface: none.
+Does not claim: the bounds (statement only); `2^9 = 512`, `288*3 = 864` are kernel-checked on main (`UniversalLaw.Side24.geometric_ratio_constants`), not here. -/
+def SuccessiveTermRatio : Prop :=
+ (∀ j : ℕ, 1 ≤ j →
+ ((j : ℝ) + 1) ^ 9 * Real.exp (-288 * ((j : ℝ) + 1) ^ 2) ≤
+ 512 * Real.exp (-864) * ((j : ℝ) ^ 9 * Real.exp (-288 * (j : ℝ) ^ 2))) ∧
+ 512 * Real.exp (-864) < 1 / 2
+
+/-- Section 2 exponential facts: `exp(288/125) > 10`, hence `exp(-288) < 10^(-125)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "hence e^(-288)<10^(-125) and the geometric-ratio inequality follows too."
+Interface: none; `Real.exp` is Mathlib's.
+Does 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 in `Ledger.lean`), not here. -/
+def ExponentialBounds : Prop :=
+ 10 < Real.exp (288 / 125) ∧ Real.exp (-288) < 1 / 10 ^ 125
+
+/-- Display (2): for `d ∈ {2, 3}`, every unit-direction contraction through total order `6`,
+mixed directions included, satisfies `|D^q K_24(0) - D^q K_infty(0)| < E`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "|D^q K_24(0)-D^q K_infty(0)|"
+Interface: summability of the theta family is the premise `ThetaSummable d`; derivatives are Mathlib's `iteratedFDeriv ℝ q`.
+Does 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 coefficient; nonauthor review or acceptance. -/
+def ImageBound : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → ThetaSummable d →
+ ∀ q : ℕ, q ≤ 6 → ∀ u : Fin q → E d, IsUnitTuple d q u →
+ |iteratedFDeriv ℝ q (K24 d) 0 u - iteratedFDeriv ℝ q (Kinf d) 0 u| < imageConstE
+
+/-! ## Section 3: the joint covariance of `(G, t, svec H)` in a frame -/
+
+/-- Index set of the `svec` coordinates: ordered pairs `(i, j)` with `i ≤ j`, of cardinality
+`d(d+1)/2` (`3` for `d = 2`, `6` for `d = 3`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Use the joint vector (G,t,svec H), where svec lists diagonal Hessian entries and"
+Interface: none.
+Does not claim: anything. -/
+abbrev SymIndex (d : ℕ) : Type := {p : Fin d × Fin d // p.1 ≤ p.2}
+
+/-- Index set of the joint vector `(G, t, svec H)`: `d` gradient coordinates, one third
+derivative `t`, and `d(d+1)/2` `svec` coordinates; dimension `6` for `d = 2` and `10` for `d = 3`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "sqrt(2) times independent off-diagonal entries. Its dimension is at most10."
+Interface: none.
+Does not claim: the dimension count `6`, `10`, kernel-checked on main (`UniversalLaw.Side24.pin_determinant_and_joint_dimension`), not here. -/
+abbrev JointIndex (d : ℕ) : Type := Fin d ⊕ Unit ⊕ SymIndex d
+
+/-- The list of differentiation directions attached to a joint coordinate, in the orthonormal
+frame `R` with `u = R 0`: `G_i = ∂_{R i} f`, `t = ∂_u^3 f`, `H_{ij} = ∂_{R i} ∂_{R j} f`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Use the joint vector (G,t,svec H), where svec lists diagonal Hessian entries and"
+Interface: none.
+Does not claim: anything. -/
+def jetDirs (d : ℕ) (u : E d) (R : Fin d → E d) : JointIndex d → List (E d)
+ | Sum.inl i => [R i]
+ | Sum.inr (Sum.inl _) => [u, u, u]
+ | Sum.inr (Sum.inr p) => [R p.1.1, R p.1.2]
+
+/-- The `svec` scaling: `1` on gradient, `t` and diagonal Hessian coordinates, `sqrt 2` on
+off-diagonal Hessian coordinates.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "sqrt(2) times independent off-diagonal entries. Its dimension is at most10."
+Interface: none.
+Does not claim: anything. -/
+noncomputable def svecScale (d : ℕ) : JointIndex d → ℝ
+ | Sum.inr (Sum.inr p) => if p.1.1 = p.1.2 then 1 else Real.sqrt 2
+ | _ => 1
+
+/-- The derivative of `K` at `x` contracted against a list of directions:
+`D^{|l|} K(x)[l_1, …, l_{|l|}]`, through Mathlib's `iteratedFDeriv`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Each covariance entry differs from the reference by at most2E, by (2)."
+Interface: none.
+Does not claim: differentiability of `K` (if absent the derivative is `0` in Lean). -/
+noncomputable def derivContraction (d : ℕ) (K : E d → ℝ) (x : E d) (l : List (E d)) : ℝ :=
+ iteratedFDeriv ℝ l.length K x (fun i => l.get i)
+
+/-- The joint covariance matrix of `(G, t, svec H)` at a point of a centred stationary field
+with covariance `K`, in the frame `R` with `u = R 0`, through the stationary rule
+`Cov(∂^α f, ∂^β f) = (-1)^{|β|} ∂^{α+β} K(0)`, with the `svec` scaling. With `K = K_infty`
+this is `C_ref`; with `K = K_24` it is `C_24`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Each covariance entry differs from the reference by at most2E, by (2)."
+Interface: none; the covariance is DEFINED by the derivative rule, no field is constructed.
+Does not claim: that this matrix is the covariance of any random vector (no field is constructed here); symmetry or positive semidefiniteness of the matrix. -/
+noncomputable def jointCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) :
+ Matrix (JointIndex d) (JointIndex d) ℝ :=
+ Matrix.of fun a b =>
+ svecScale d a * svecScale d b * (-1 : ℝ) ^ (jetDirs d u R b).length *
+ derivContraction d K 0 (jetDirs d u R a ++ jetDirs d u R b)
+
+/-- The gradient covariance block `Cov(G_i, G_j) = -∂_{R i} ∂_{R j} K(0)` in the frame `R`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "covariance differentiation gives"
+Interface: none.
+Does not claim: that it equals the identity for `K_infty` (that is `ReferenceOddAndPinBlocks`). -/
+noncomputable def gradCov (d : ℕ) (K : E d → ℝ) (R : Fin d → E d) : Matrix (Fin d) (Fin d) ℝ :=
+ Matrix.of fun i j => - derivContraction d K 0 [R i, R j]
+
+/-- The pin covariance block of `V = H u`, coordinates `V_i = ∂_u ∂_{R i} f`:
+`Cov(V_i, V_j) = ∂_u ∂_{R i} ∂_u ∂_{R j} K(0)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Thus V=Hu has covariance diag(3,1,...,1), tau^2=Var(t|G=0)=6, and"
+Interface: none.
+Does not claim: that it equals `diag(3,1,...,1)` for `K_infty` (that is `ReferenceOddAndPinBlocks`). -/
+noncomputable def pinCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) :
+ Matrix (Fin d) (Fin d) ℝ :=
+ Matrix.of fun i j => derivContraction d K 0 [u, R i, u, R j]
+
+/-- The covariance vector `Cov(t, G_j) = -∂_u^3 ∂_{R j} K(0)` of `t = ∂_u^3 f` with the gradient.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Var(t)=15, Cov(t,G)=(-3,0,...,0),"
+Interface: none.
+Does not claim: its reference value `(-3, 0, …, 0)` (that is `ReferenceOddAndPinBlocks`). -/
+noncomputable def thirdGradCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) : Fin d → ℝ :=
+ fun j => - derivContraction d K 0 [u, u, u, R j]
+
+/-- The variance `Var(t) = -∂_u^6 K(0)` of `t = ∂_u^3 f`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Var(t)=15, Cov(t,G)=(-3,0,...,0),"
+Interface: none.
+Does not claim: its reference value `15` (that is `ReferenceOddAndPinBlocks`). -/
+noncomputable def thirdVar (d : ℕ) (K : E d → ℝ) (u : E d) : ℝ :=
+ - derivContraction d K 0 [u, u, u, u, u, u]
+
+/-- The conditional variance `tau^2 = Var(t | G = 0)` as the Schur complement
+`Var(t) - Cov(t,G) Cov(G)^(-1) Cov(G,t)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "tau^2=Var(t|G=0)=6"
+Interface: none; the Gaussian conditional variance is written as the Schur complement (a standard identity, used here as the definition).
+Does not claim: invertibility of `Cov(G)` (Mathlib's matrix inverse is `0` on a singular matrix); the value `6` (that is `ReferenceOddAndPinBlocks`). -/
+noncomputable def condThirdVariance (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) : ℝ :=
+ thirdVar d K u -
+ dotProduct (thirdGradCov d K u R) (Matrix.mulVec (gradCov d K R)⁻¹ (thirdGradCov d K u R))
+
+/-- The reference joint covariance `C_ref` (kernel `K_infty`) in the frame `R`, `u = R 0`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "(1-epsilon) C_ref <= C_24 <= (1+epsilon) C_ref,"
+Interface: none.
+Does not claim: its displayed block values (`ReferenceOddAndPinBlocks`), or that it is frame independent. -/
+noncomputable def Cref (d : ℕ) (u : E d) (R : Fin d → E d) :
+ Matrix (JointIndex d) (JointIndex d) ℝ :=
+ jointCov d (Kinf d) u R
+
+/-- The exact periodic joint covariance `C_24` (kernel `K_24`) in the frame `R`, `u = R 0`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "(1-epsilon) C_ref <= C_24 <= (1+epsilon) C_ref,"
+Interface: summability of the theta family is a premise wherever this matrix is used.
+Does not claim: rotational invariance (the source asserts none for `C_24`). -/
+noncomputable def C24 (d : ℕ) (u : E d) (R : Fin d → E d) :
+ Matrix (JointIndex d) (JointIndex d) ℝ :=
+ jointCov d (K24 d) u R
+
+/-- Display (3): for `d ∈ {2, 3}`, in every orthonormal frame `R` (with `u = R 0`),
+`(1-epsilon) C_ref ≤ C_24 ≤ (1+epsilon) C_ref` in the positive-semidefinite order.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "The inequalities are in the positive-semidefinite ordering and hold in every"
+Interface: summability of the theta family is the premise `ThetaSummable d`; the matrices are defined by the derivative rule of `jointCov`.
+Does 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 encloses the coefficient; nonauthor review or acceptance. -/
+def CovarianceOrdering : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → ThetaSummable d →
+ ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ (C24 d (R ⟨0, hd⟩) R - (1 - epsilon) • Cref d (R ⟨0, hd⟩) R).PosSemidef ∧
+ ((1 + epsilon) • Cref d (R ⟨0, hd⟩) R - C24 d (R ⟨0, hd⟩) R).PosSemidef
+
+/-- Section 3: each entry of `C_24` differs from the corresponding entry of `C_ref` by at most
+`2E`, in every orthonormal frame.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Each covariance entry differs from the reference by at most2E, by (2)."
+Interface: summability of the theta family is the premise `ThetaSummable d`.
+Does not claim: the bound (statement only); the spectral-norm bound `20E` (not specified); nonauthor review or acceptance. -/
+def EntrywiseCovarianceBound : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → ThetaSummable d →
+ ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ ∀ a b : JointIndex d,
+ |C24 d (R ⟨0, hd⟩) R a b - Cref d (R ⟨0, hd⟩) R a b| ≤ 2 * imageConstE
+
+/-- Section 3: `C_ref ≥ I/3` in the positive-semidefinite order, in every orthonormal frame.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Thus C_ref >= I/3 and"
+Interface: none.
+Does 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_minors`, `smaller_eigenvalue_exceeds_third`), not here. -/
+def ReferenceCovarianceLowerBound : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ (Cref d (R ⟨0, hd⟩) R - (1 / 3 : ℝ) • (1 : Matrix (JointIndex d) (JointIndex d) ℝ)).PosSemidef
+
+/-- Section 1 reference blocks, in every orthonormal frame with `u = R 0`: `Cov(G) = I_d`,
+`Var(t) = 15`, `Cov(t, G) = (-3, 0, …, 0)`, `Cov(V) = diag(3, 1, …, 1)` and `tau^2 = 6`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Var(t)=15, Cov(t,G)=(-3,0,...,0),"
+Interface: none; the blocks are the derivative-rule matrices of `K_infty`.
+Does not claim: the identities (statement only); `15 - 9 = 6` is kernel-checked on main (`UniversalLaw.Side24.conditional_third_derivative_variance`), not here. -/
+def ReferenceOddAndPinBlocks : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ gradCov d (Kinf d) R = 1 ∧
+ thirdVar d (Kinf d) (R ⟨0, hd⟩) = 15 ∧
+ thirdGradCov d (Kinf d) (R ⟨0, hd⟩) R = (fun j => if j = ⟨0, hd⟩ then -3 else 0) ∧
+ pinCov d (Kinf d) (R ⟨0, hd⟩) R = Matrix.diagonal (fun i => if i = ⟨0, hd⟩ then 3 else 1) ∧
+ condThirdVariance d (Kinf d) (R ⟨0, hd⟩) R = 6
+
+/-! ## Section 4: Gaussian density comparison -/
+
+/-- The centred Gaussian density on `R^n` with covariance `C`:
+`(2 pi)^(-n/2) det(C)^(-1/2) exp(-x^T C^(-1) x / 2)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Comparing Gaussian determinants"
+Interface: none.
+Does not claim: that this is a probability density when `C` is singular (the matrix inverse is then `0` in Lean). -/
+noncomputable def gaussDensity (n : ℕ) (C : Matrix (Fin n) (Fin n) ℝ) (x : Fin n → ℝ) : ℝ :=
+ (2 * Real.pi) ^ (-(n : ℝ) / 2) * C.det ^ (-(1 : ℝ) / 2) *
+ Real.exp (-(dotProduct x (Matrix.mulVec C⁻¹ x)) / 2)
+
+/-- The number `n = m(m+1)/2` of independent symmetric-matrix coordinates.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Let C be a centered covariance in n=m(m+1)/2 independent symmetric-matrix"
+Interface: none.
+Does not claim: anything. -/
+def symCoordDim (m : ℕ) : ℕ := m * (m + 1) / 2
+
+/-- Section 4 density comparison: if `(1-epsilon) C0 ≤ C ≤ (1+epsilon) C0` in the
+positive-semidefinite order, with `C0` positive definite, then pointwise
+`[(1-epsilon)/(1+epsilon)]^(n/2) phi_{(1-epsilon)C0} ≤ phi_C ≤ [(1+epsilon)/(1-epsilon)]^(n/2) phi_{(1+epsilon)C0}`,
+`n = m(m+1)/2`, `epsilon = 10^(-108)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "[(1-epsilon)/(1+epsilon)]^(n/2) phi_((1-epsilon)C0)"
+Interface: none; `C.PosDef` is stated as a premise although it follows from `C0.PosDef` and the ordering.
+Does 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); nothing here encloses the coefficient; nonauthor review or acceptance. -/
+def DensityComparison : Prop :=
+ ∀ (m : ℕ) (C0 C : Matrix (Fin (symCoordDim m)) (Fin (symCoordDim m)) ℝ),
+ C0.PosDef → C.PosDef →
+ (C - (1 - epsilon) • C0).PosSemidef → ((1 + epsilon) • C0 - C).PosSemidef →
+ ∀ x : Fin (symCoordDim m) → ℝ,
+ ((1 - epsilon) / (1 + epsilon)) ^ ((symCoordDim m : ℝ) / 2) *
+ gaussDensity (symCoordDim m) ((1 - epsilon) • C0) x ≤
+ gaussDensity (symCoordDim m) C x ∧
+ gaussDensity (symCoordDim m) C x ≤
+ ((1 + epsilon) / (1 - epsilon)) ^ ((symCoordDim m : ℝ) / 2) *
+ gaussDensity (symCoordDim m) ((1 + epsilon) • C0) x
+
+/-- The exponent `a = m + 2/3 + n/2` of Section 4, with `m = d - 1`, `n = m(m+1)/2`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "a=m+2/3+n/2, b=d+n/2."
+Interface: none.
+Does not claim: the values `13/6`, `25/6`, kernel-checked on main (`UniversalLaw.Side24.exponent_values`), not here. -/
+noncomputable def exponentA (d : ℕ) : ℝ :=
+ ((d - 1 : ℕ) : ℝ) + 2 / 3 + (symCoordDim (d - 1) : ℝ) / 2
+
+/-- The exponent `b = d + n/2` of Section 4, with `n = (d-1)d/2`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "a=m+2/3+n/2, b=d+n/2."
+Interface: none.
+Does not claim: the inequalities `a+2b<14`, `2a+b<13`, kernel-checked on main (`UniversalLaw.Side24.exponent_bounds`), not here. -/
+noncomputable def exponentB (d : ℕ) : ℝ :=
+ (d : ℝ) + (symCoordDim (d - 1) : ℝ) / 2
+
+/-- Section 4 ratio bounds: for `d ∈ {2, 3}`,
+`1 - 13 epsilon ≤ (1-epsilon)^a / (1+epsilon)^b` and `(1+epsilon)^a / (1-epsilon)^b ≤ 1 + 28 epsilon`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "ratio between1-13epsilon and"
+Interface: none.
+Does 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.Side24.ratio_constant_ordering`, `density_comparison_below_reported`), not here. -/
+def IntegrandRatioBounds : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 →
+ 1 - 13 * epsilon ≤ (1 - epsilon) ^ exponentA d / (1 + epsilon) ^ exponentB d ∧
+ (1 + epsilon) ^ exponentA d / (1 - epsilon) ^ exponentB d ≤ 1 + 28 * epsilon
+
+/-! ## Section 1: reference densities and the reference coefficient identity -/
+
+/-- Section 1: in every orthonormal frame with `u = R 0`, the reference gradient and pin
+densities at zero satisfy `p_G(0) p_V(0) = (2 pi)^(-d) / sqrt 3`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "p_G(0) p_V(0) = (2pi)^(-d) / sqrt(3)."
+Interface: none; the densities are `gaussDensity` of the derivative-rule blocks of `K_infty`.
+Does not claim: the identity (statement only); `det diag(3,1,…,1) = 3` is kernel-checked on main (`UniversalLaw.Side24.pin_determinant_and_joint_dimension`), not here. -/
+def ReferencePinDensityProduct : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ gaussDensity d (gradCov d (Kinf d) R) 0 *
+ gaussDensity d (pinCov d (Kinf d) (R ⟨0, hd⟩) R) 0 =
+ (2 * Real.pi) ^ (-(d : ℝ)) / Real.sqrt 3
+
+/-- Ordinary sphere area `|S^(d-1)|`: `2 pi` for `d = 2`, `4 pi` for `d = 3`, `0` otherwise.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Substituting these moments and |S^1|=2pi, |S^2|=4pi into the exact parent coefficient"
+Interface: none.
+Does not claim: any value outside `d ∈ {2, 3}`. -/
+noncomputable def sphereArea (d : ℕ) : ℝ :=
+ if d = 2 then 2 * Real.pi else if d = 3 then 4 * Real.pi else 0
+
+/-- Display (1) as an identity: the parent prefactor `Gamma(7/6) / [24^(1/3) sqrt pi]` times
+`p_G(0) p_V(0) = (2 pi)^(-d) / sqrt 3`, times `tau^(4/3)` with `tau = sqrt 6`, times `D_{d-1}`,
+times `|S^(d-1)|`, equals `c_{d,ref}` (using `6^(2/3)/24^(1/3) = (3/2)^(1/3)`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "This eliminates BOTH the angular and cone integrals for the reference expression."
+Interface: none.
+Does 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.Side24.cube_root_simplification`), not here; nonauthor review or acceptance. -/
+def ReferenceCoefficientIdentity : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 →
+ Real.Gamma (7 / 6) / ((24 : ℝ) ^ ((1 : ℝ) / 3) * Real.sqrt Real.pi) *
+ ((2 * Real.pi) ^ (-(d : ℝ)) / Real.sqrt 3) * (Real.sqrt 6) ^ ((4 : ℝ) / 3) *
+ coneMomentRef (d - 1) * sphereArea d =
+ cRef d
+
+/-! ## Section 1: the cone moments as Gaussian expectations -/
+
+/-- Interface for the Gaussian variables of the reference cone moments. GIVEN: a probability
+space; the `m = 1` transverse entry `A` with law `N(0, 8/3)`; the `m = 2` coordinates
+`s, x, y` (shared trace shift and traceless part) jointly independent with laws `N(0, 5/3)`,
+`N(0, 1)`, `N(0, 1)`, stated as a product law. Existence of such variables is not asserted.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Var(s)=5/3 and Var(x)=Var(y)=1. The negative-definite cone is s<-R,"
+Interface: every field is a given property; the laws are `ProbabilityTheory.gaussianReal` with the displayed variances.
+Does 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`). -/
+structure ConeMomentInterface where
+ /-- The sample space. -/
+ Ω : Type
+ /-- Its sigma-algebra. -/
+ [mΩ : MeasurableSpace Ω]
+ /-- The probability measure. -/
+ P : Measure Ω
+ /-- `P` is a probability measure. -/
+ [isProb : IsProbabilityMeasure P]
+ /-- Section 1 clause "For m=1 the variance of A is8/3.": the scalar transverse Hessian. -/
+ A : Ω → ℝ
+ /-- Law of `A`: centred Gaussian of variance `8/3`. -/
+ A_law : Measure.map A P = ProbabilityTheory.gaussianReal 0 (8 / 3)
+ /-- Section 1 clause "write A=[[s+x,y],[y,s-x]]": the shared scalar shift `s`. -/
+ s : Ω → ℝ
+ /-- The traceless coordinate `x`. -/
+ x : Ω → ℝ
+ /-- The traceless coordinate `y`. -/
+ y : Ω → ℝ
+ /-- Section 1 clause "s,x,y are independent, Var(s)=5/3 and Var(x)=Var(y)=1": the joint law
+ of `(s, x, y)` is the product of `N(0,5/3)`, `N(0,1)`, `N(0,1)`. -/
+ sxy_law : Measure.map (fun ω => (s ω, x ω, y ω)) P =
+ (ProbabilityTheory.gaussianReal 0 (5 / 3)).prod
+ ((ProbabilityTheory.gaussianReal 0 1).prod (ProbabilityTheory.gaussianReal 0 1))
+
+/-- The `m = 2` transverse Hessian `A = [[s+x, y], [y, s-x]]`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "For m=2 write A=[[s+x,y],[y,s-x]]. Then s,x,y are independent,"
+Interface: none.
+Does not claim: anything. -/
+noncomputable def transverseMatrix (s x y : ℝ) : Matrix (Fin 2) (Fin 2) ℝ :=
+ Matrix.of ![![s + x, y], ![y, s - x]]
+
+/-- The negative-definite cone `A < 0` for the `m = 2` matrix, as positive definiteness of `-A`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "R=sqrt(x^2+y^2), and det A=s^2-R^2."
+Interface: none.
+Does not claim: the source's reduction of the cone to `s < -R` (not specified; the cone is taken by its definition). -/
+def NegDefCone (q : ℝ × ℝ × ℝ) : Prop :=
+ (-(transverseMatrix q.1 q.2.1 q.2.2)).PosDef
+
+/-- The cone-moment integrand `h(A) = det(A)^2 1{A<0}` for the `m = 2` matrix.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "R=sqrt(x^2+y^2), and det A=s^2-R^2."
+Interface: none.
+Does not claim: the identity `det A = s^2 - R^2` (not specified separately). -/
+noncomputable def coneIntegrand (q : ℝ × ℝ × ℝ) : ℝ :=
+ Set.indicator {q : ℝ × ℝ × ℝ | NegDefCone q}
+ (fun q => (transverseMatrix q.1 q.2.1 q.2.2).det ^ 2) q
+
+/-- Section 1 identity `D_1 = E[A^2 1{A<0}] = 4/3` for `A ~ N(0, 8/3)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "D_1=E[A^2 1{A<0}]=4/3."
+Interface: `I : ConeMomentInterface` is given; the law of `A` is its hypothesis field.
+Does not claim: the identity (statement only); that `D_1` is the parent's cone moment `D_u` of (15.1) for the reference law; nothing here encloses the coefficient. -/
+def ConeMomentD1Identity (I : ConeMomentInterface) : Prop :=
+ ∫ ω, Set.indicator (Set.Iio (0 : ℝ)) (fun a => a ^ 2) (I.A ω) ∂I.P = coneMomentD1
+
+/-- Section 1 identity `D_2 = E[det(A)^2 1{A<0}] = (1/2)[25/3 - 20/3 + 8 - 8 sqrt(3/8)]` for
+`A = [[s+x, y], [y, s-x]]` with the product Gaussian law.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "D_2 = (1/2)[25/3-20/3+8-8sqrt(3/8)]"
+Interface: `I : ConeMomentInterface` is given; the joint law is its hypothesis field.
+Does not claim: the identity (statement only); the Rayleigh integration route; that `D_2` is the parent's `D_u` for the reference law; nothing here encloses the coefficient; nonauthor review or acceptance. -/
+def ConeMomentD2Identity (I : ConeMomentInterface) : Prop :=
+ ∫ ω, coneIntegrand (I.s ω, I.x ω, I.y ω) ∂I.P =
+ (1 / 2) * (25 / 3 - 20 / 3 + 8 - 8 * Real.sqrt (3 / 8))
+
+/-- Section 1 algebra `(1/2)[25/3 - 20/3 + 8 - 8 sqrt(3/8)] = 29/6 - sqrt 6`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: " = 29/6-sqrt(6)."
+Interface: none.
+Does not claim: the identity (statement only); its rational part and `4 sqrt(3/8) = sqrt 6` are kernel-checked on main (`UniversalLaw.Side24.cone_moment_m2_algebra`), not here. -/
+def ConeMomentD2Algebra : Prop :=
+ (1 / 2 : ℝ) * (25 / 3 - 20 / 3 + 8 - 8 * Real.sqrt (3 / 8)) = coneMomentD2
+
+/-- Section 1 moments of the trace shift `s ~ N(0, 5/3)`: `E s^2 = 5/3`, `E s^4 = 25/3`,
+`E exp(-s^2/2) = sqrt(3/8)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "E s^2=5/3, E s^4=25/3 and"
+Interface: `I : ConeMomentInterface` is given.
+Does not claim: the identities (statement only); `3 (5/3)^2 = 25/3` and `1 + 5/3 = 8/3` are kernel-checked on main (`UniversalLaw.Side24.fourth_moment_of_trace`, `exponential_moment_of_trace`), not here. -/
+def TraceMoments (I : ConeMomentInterface) : Prop :=
+ ∫ ω, I.s ω ^ 2 ∂I.P = 5 / 3 ∧
+ ∫ ω, I.s ω ^ 4 ∂I.P = 25 / 3 ∧
+ ∫ ω, Real.exp (-(I.s ω ^ 2) / 2) ∂I.P = Real.sqrt (3 / 8)
+
+/-- Section 1: `R^2 = x^2 + y^2` has density `exp(-z/2)/2` on `(0, ∞)`, written through its
+distribution function `P(R^2 ≤ a) = ∫_0^a exp(-z/2)/2 dz` for `a ≥ 0`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "The variable R^2 has density e^(-z/2)/2."
+Interface: `I : ConeMomentInterface` is given.
+Does not claim: the law (statement only); measurability of the event (if the event is not measurable, `P` is its outer measure). -/
+def RayleighSquareLaw (I : ConeMomentInterface) : Prop :=
+ ∀ a : ℝ, 0 ≤ a →
+ (I.P {ω | I.x ω ^ 2 + I.y ω ^ 2 ≤ a}).toReal = ∫ z in (0 : ℝ)..a, Real.exp (-z / 2) / 2
+
+/-- Section 1 elementary integral: for `a ≥ 0`,
+`∫_0^a (a-z)^2 exp(-z/2) dz/2 = a^2 - 4a + 8 - 8 exp(-a/2)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "integral_0^a (a-z)^2 e^(-z/2) dz/2 = a^2-4a+8-8e^(-a/2)."
+Interface: none; the integral is Mathlib's interval integral against Lebesgue measure.
+Does not claim: the identity (statement only). -/
+def ElementaryConeIntegral : Prop :=
+ ∀ a : ℝ, 0 ≤ a →
+ ∫ z in (0 : ℝ)..a, (a - z) ^ 2 * Real.exp (-z / 2) / 2 =
+ a ^ 2 - 4 * a + 8 - 8 * Real.exp (-a / 2)
+
+/-! ## The exact periodic coefficient as an interface, and the headline statements -/
+
+/-- Interface for the exact periodic coefficient `c_{d,24}`, "precisely its equation (15.2)"
+of the parent. GIVEN: the coefficient `c24`; the ordinary sphere-area measure on `S^(d-1)`;
+the gradient density `p_G(0)`, the pin density `p_{V_u}(0)`, the conditional standard
+deviation `tau_u` and the cone moment `D_u` of the parent's (15.1). Hypothesis fields: the
+sphere measure is carried by the unit sphere with the areas `2 pi`, `4 pi`; the parent's
+positivity clause "Finite-jet rank proves tau_u>0, positive densities p_G(0),p_Vu(0), and
+D_u>0"; the densities and `tau_u^2` agree with the Gaussian density formula and the Schur
+complement of the derivative-rule blocks of `K_24`; summability of the theta family; and
+the parent's display (15.2)
+`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)`
+(source id `lifetime-parent`, Section 15). The cone moment `D_u` is NOT pinned to `K_24`
+here: writing it needs the conditional Gaussian law `A_u | V_u = 0`, which this module does
+not construct.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Let c_d,24 be precisely its equation (15.2), using ordinary sphere area, ordered"
+Interface: every field is a given object or a hypothesis; nothing is derived; in particular `coneMoment` is characterised only by its docstring.
+Does 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). -/
+structure PeriodicCoefficientInterface where
+ /-- The exact periodic coefficient `c_{d,24}`, as a function of the dimension. -/
+ c24 : ℕ → ℝ
+ /-- Scope clause "using ordinary sphere area": the surface measure `sigma` on `S^(d-1)`. -/
+ sphereMeasure : (d : ℕ) → Measure (E d)
+ /-- The sphere measure is carried by the unit sphere. -/
+ sphereMeasure_support : ∀ d : ℕ, sphereMeasure d ((Metric.sphere (0 : E d) 1)ᶜ) = 0
+ /-- Section 1 clause "|S^1|=2pi, |S^2|=4pi": total areas in dimensions `2` and `3`. -/
+ sphereMeasure_area :
+ (sphereMeasure 2 Set.univ).toReal = 2 * Real.pi ∧ (sphereMeasure 3 Set.univ).toReal = 4 * Real.pi
+ /-- Parent (15.2) ingredient: the gradient density at zero `p_G(0)`. -/
+ pG0 : ℕ → ℝ
+ /-- Parent (15.2) ingredient: the pin density at zero `p_{V_u}(0)` for the direction `u`. -/
+ pV0 : (d : ℕ) → E d → ℝ
+ /-- Parent (15.1) ingredient: `tau_u`, with `tau_u^2 = Var(t_u | G = 0)`. -/
+ tau : (d : ℕ) → E d → ℝ
+ /-- Parent (15.1) ingredient: `D_u = E[(det A_u)^2 1{A_u<0} | V_u=0]`, the Gaussian cone
+ expectation under the conditional law of the transverse Hessian; GIVEN, not constructed. -/
+ coneMoment : (d : ℕ) → E d → ℝ
+ /-- Parent clause: positive density `p_G(0)`. -/
+ pG0_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → 0 < pG0 d
+ /-- Parent clause: positive density `p_{V_u}(0)` for every unit direction. -/
+ pV0_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ u : E d, ‖u‖ = 1 → 0 < pV0 d u
+ /-- Parent clause: `tau_u > 0` for every unit direction. -/
+ tau_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ u : E d, ‖u‖ = 1 → 0 < tau d u
+ /-- Parent clause: `D_u > 0` for every unit direction. -/
+ coneMoment_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ u : E d, ‖u‖ = 1 → 0 < coneMoment d u
+ /-- The theta family of `K_24` is summable. -/
+ theta_summable : ∀ d : ℕ, d = 2 ∨ d = 3 → ThetaSummable d
+ /-- `p_G(0)` is the centred Gaussian density at zero with the gradient block of `K_24`, in
+ every orthonormal frame. -/
+ pG0_def : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ R : Fin d → E d, Orthonormal ℝ R →
+ pG0 d = gaussDensity d (gradCov d (K24 d) R) 0
+ /-- `p_{V_u}(0)` is the centred Gaussian density at zero with the pin block of `K_24`, in
+ every orthonormal frame with `u = R 0`. -/
+ pV0_def : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ pV0 d (R ⟨0, hd⟩) = gaussDensity d (pinCov d (K24 d) (R ⟨0, hd⟩) R) 0
+ /-- `tau_u^2` is the Schur complement `Var(t_u) - Cov(t_u,G) Cov(G)^(-1) Cov(G,t_u)` of the
+ derivative-rule blocks of `K_24`, in every orthonormal frame with `u = R 0`. -/
+ tau_sq : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ tau d (R ⟨0, hd⟩) ^ 2 = condThirdVariance d (K24 d) (R ⟨0, hd⟩) R
+ /-- Parent display (15.2), for `d ∈ {2, 3}`. -/
+ eq_15_2 : ∀ d : ℕ, d = 2 ∨ d = 3 →
+ c24 d = Real.Gamma (7 / 6) / ((24 : ℝ) ^ ((1 : ℝ) / 3) * Real.sqrt Real.pi) *
+ ∫ u, pG0 d * pV0 d u * tau d u ^ ((4 : ℝ) / 3) * coneMoment d u ∂(sphereMeasure d)
+
+/-- The headline statement of the source: the two enclosures
+`0.07340691930603427103 < c_{2,24} < 0.07340691930603427104` and
+`0.04177593184059834334 < c_{3,24} < 0.04177593184059834335`, for any coefficient satisfying
+the interface.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "0.07340691930603427103 < c_2,24 < 0.07340691930603427104,"
+Interface: `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.
+Does 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)`) is kernel-checked on main (31 `UniversalLaw.Side24` targets at origin/main f6deeba7), not here; nonauthor review or acceptance. -/
+def CoefficientEnclosure (I : PeriodicCoefficientInterface) : Prop :=
+ d2Lower < I.c24 2 ∧ I.c24 2 < d2Upper ∧ d3Lower < I.c24 3 ∧ I.c24 3 < d3Upper
+
+/-- Display (4): `|c_{d,24} / c_{d,ref} - 1| < 10^(-106)` for `d = 2, 3`, for any coefficient
+satisfying the interface.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "|c_d,24/c_d,ref -1| < 10^(-106), d=2,3."
+Interface: `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.
+Does 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)` is kernel-checked on main (`UniversalLaw.Side24.density_comparison_below_reported`), not here; nothing here encloses the coefficient. -/
+def ReferenceComparison (I : PeriodicCoefficientInterface) : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → |I.c24 d / cRef d - 1| < 1 / 10 ^ 106
+
+/-! ## Round 7: the successor interface that pins the cone moment
+
+Everything above this line is byte-identical to the module at Math- `8acc4856`. The declarations below
+transcribe the parent's (15.1) `D_u = E[(det A_u)^2 1{A_u<0} | V_u=0]` (source id `lifetime-parent`,
+Section 15) for the formal kernel `K_24`: the conditional law of the transverse Hessian block `A_u`
+given the pin `V_u = 0` is written, for a centred Gaussian vector, through the Schur complement of the
+derivative-rule blocks (the SIDE24 note's Section 3 reading of conditioning), and the cone expectation
+is the Lebesgue integral of `det(A)^2 1{A<0}` against Mathlib's `multivariateGaussian` with that
+covariance. The successor `PeriodicCoefficientInterface2` keeps every field of
+`PeriodicCoefficientInterface` and adds the parent's nondegeneracy clause for the pin block and the
+conditional block and the definition of `coneMoment`; the two successor Props restate the headline
+displays over it. Formal progress of every declaration here: `specified`. Nothing here is proved,
+nothing above changes, no label moves, and no inhabitant of either interface is constructed.
+
+What the successor does NOT pin (recorded for the design review, main#307 6137276515): `sphereMeasure` stays a given measure
+constrained only by its support and total area, so `c24` is determined by the fields only up to that
+choice; frame invariance of `coneMomentOf` under transverse-frame changes (the parent asserts it) is
+not a field, so the frame-quantified `coneMoment_def` is a consistency burden on the interface rather
+than a theorem here. The uniform-in-`u` bounds of the source would make the sphere-measure choice immaterial to
+the two successor inequalities, not to the value of `c24`. -/
+
+/-- Transverse coordinates of the frame: the indices `i ≠ 0` (the axial direction is `u = R 0`), the
+`m = d - 1` directions of `u`-perp.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Writing m=d-1 and A for the transverse Hessian, Gaussian conditioning on V=0 gives"
+Interface: none; a subtype of `Fin d`.
+Does not claim: anything. -/
+abbrev TransRow (d : ℕ) : Type := {i : Fin d // 0 < i.val}
+
+/-- Transverse `svec` coordinates: the `svec` indices `(i, j)`, `i ≤ j`, with both entries transverse
+(`0 < i`), of cardinality `m(m+1)/2` (`1` for `d = 2`, `3` for `d = 3`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Use the joint vector (G,t,svec H), where svec lists diagonal Hessian entries and"
+Interface: none; a subtype of `SymIndex d`.
+Does not claim: the cardinalities (not specified). -/
+abbrev TransIndex (d : ℕ) : Type := {p : SymIndex d // 0 < p.1.1.val}
+
+/-- The `svec` scaling restricted to transverse coordinates: `1` on the diagonal, `sqrt 2` off it
+(the restriction of `svecScale` to the Hessian block).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "sqrt(2) times independent off-diagonal entries. Its dimension is at most10."
+Interface: none.
+Does not claim: anything. -/
+noncomputable def transScale (d : ℕ) (a : TransIndex d) : ℝ :=
+ if a.1.1.1 = a.1.1.2 then 1 else Real.sqrt 2
+
+/-- The covariance block of the transverse Hessian entries `A_ij = ∂_{R i} ∂_{R j} f`, `i, j ≠ 0`, by the
+stationary rule `Cov(∂^α f, ∂^β f) = (-1)^{|β|} ∂^{α+β} K(0)` at even total order (sign `+`), with the
+`svec` scaling: the restriction of `jointCov` to the transverse `svec` coordinates.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Cov(H_ij,H_kl)=delta_ij delta_kl+delta_ik delta_jl+delta_il delta_jk,"
+Interface: none; the matrix is DEFINED by the derivative rule, no field is constructed.
+Does not claim: that this matrix is the covariance of any random vector; its reference value (the display is for `K_infty`); symmetry or positive semidefiniteness. -/
+noncomputable def transCov (d : ℕ) (K : E d → ℝ) (R : Fin d → E d) :
+ Matrix (TransIndex d) (TransIndex d) ℝ :=
+ Matrix.of fun a b => transScale d a * transScale d b *
+ derivContraction d K 0 [R a.1.1.1, R a.1.1.2, R b.1.1.1, R b.1.1.2]
+
+/-- The cross-covariance block of the transverse Hessian entries with the pin coordinates
+`V_i = ∂_u ∂_{R i} f`: `Cov(A_ab, V_i) = ∂_{R a} ∂_{R b} ∂_u ∂_{R i} K(0)`, with the `svec` scaling.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Thus V=Hu has covariance diag(3,1,...,1), tau^2=Var(t|G=0)=6, and"
+Interface: none; defined by the derivative rule.
+Does not claim: that this matrix is a covariance; its reference value. -/
+noncomputable def transPinCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) :
+ Matrix (TransIndex d) (Fin d) ℝ :=
+ 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]
+
+/-- The conditional covariance of the transverse Hessian given `V_u = 0`, as the Schur complement
+`Cov(A) - Cov(A,V) Cov(V)^(-1) Cov(V,A)` of the derivative-rule blocks (the same pattern as
+`condThirdVariance`, with `pinCov` as `Cov(V)`): the Gaussian conditional covariance when `Cov(V)` is
+nondegenerate.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "to their conditional covariances. For the latter, the Schur-complement quadratic"
+Interface: none; the Gaussian conditional covariance is written as the Schur complement (a standard identity for a nondegenerate conditioning block, used here as the definition).
+Does 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 constructed); the reference value `(2/3) delta delta + delta delta + delta delta` of Section 1. -/
+noncomputable def condHessianCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) :
+ Matrix (TransIndex d) (TransIndex d) ℝ :=
+ transCov d K R - transPinCov d K u R * (pinCov d K u R)⁻¹ * (transPinCov d K u R).transpose
+
+/-- The symmetric transverse matrix read off an `svec` coordinate vector, undoing the `sqrt 2` scaling
+of the off-diagonal entries: entry `(i, j)` is `v_(i,j)` on the diagonal and `v_(min,max) / sqrt 2` off it.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Let C be a centered covariance in n=m(m+1)/2 independent symmetric-matrix"
+Interface: none.
+Does not claim: anything. -/
+noncomputable def symOf (d : ℕ) (v : EuclideanSpace ℝ (TransIndex d)) :
+ Matrix (TransRow d) (TransRow d) ℝ :=
+ Matrix.of fun i j =>
+ if h : i.1 ≤ j.1 then v ⟨⟨(i.1, j.1), h⟩, i.2⟩ / (if i = j then 1 else Real.sqrt 2)
+ else v ⟨⟨(j.1, i.1), le_of_not_ge h⟩, j.2⟩ / Real.sqrt 2
+
+/-- The cone-moment integrand `h(A) = det(A)^2 1{A<0}` on `svec` coordinates, the negative-definite
+cone taken as positive definiteness of `-A` (as in `NegDefCone`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Integrate the nonnegative function h(A)=det(A)^2 1{A<0}. Under covariance scaling"
+Interface: none.
+Does not claim: measurability or integrability of the integrand (if it is not integrable, Mathlib's integral is `0`). -/
+noncomputable def coneIntegrandTrans (d : ℕ) (v : EuclideanSpace ℝ (TransIndex d)) : ℝ :=
+ Set.indicator {v : EuclideanSpace ℝ (TransIndex d) | (-(symOf d v)).PosDef}
+ (fun v => (symOf d v).det ^ 2) v
+
+/-- The Gaussian cone expectation of the parent's (15.1), `D_u = E[(det A_u)^2 1{A_u<0} | V_u=0]`,
+written for a kernel `K` as the integral of the cone integrand against the centred multivariate
+Gaussian law with the conditional covariance `condHessianCov d K u R`, in the frame `R` with `u = R 0`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "D_u=E[(det A_u)^2 1{A_u<0} | V_u=0]."
+Interface: 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`.
+Does 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 here); its reference values `4/3`, `29/6 - sqrt 6` (those are `ConeMomentD1Identity`, `ConeMomentD2Identity` over `ConeMomentInterface`). -/
+noncomputable def coneMomentOf (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) : ℝ :=
+ ∫ v, coneIntegrandTrans d v ∂(ProbabilityTheory.multivariateGaussian 0 (condHessianCov d K u R))
+
+/-- Successor of `PeriodicCoefficientInterface` (numbered, the predecessor unchanged): every field of
+the predecessor, plus the parent's Section 15 clause that `A_u` conditional on `V_u = 0` is a centred
+NONDEGENERATE Gaussian symmetric matrix (as positive definiteness of the pin block and of the
+conditional block of `K_24`, in every orthonormal frame with `u = R 0`), plus the definition of the
+cone moment: `coneMoment d u` is the Gaussian cone expectation `coneMomentOf d (K24 d) u R`. With these
+fields `coneMoment` is no longer free, so the doubling inhabitant that makes the universal closure of
+`CoefficientEnclosure` and `ReferenceComparison` false is excluded.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Here A_u conditional on V_u=0 is an actual centered nondegenerate Gaussian symmetric matrix"
+Interface: 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).
+Does 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. -/
+structure PeriodicCoefficientInterface2 extends PeriodicCoefficientInterface where
+ /-- Parent clause "an actual centered nondegenerate Gaussian symmetric matrix": the pin block
+ `Cov(V_u)` of `K_24` is positive definite in every orthonormal frame with `u = R 0`. The ordinary-inverse
+ Schur identification of `condHessianCov` with the Gaussian conditional covariance requires an invertible pin
+ block; this field supplies that hypothesis. -/
+ pinCov_posDef : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ (pinCov d (K24 d) (R ⟨0, hd⟩) R).PosDef
+ /-- The same clause for the conditional transverse block: positive definite, so the law in
+ `coneMomentOf` is a nondegenerate Gaussian. For a covariance that is not positive semidefinite, Mathlib's
+ `multivariateGaussian` falls back to the Dirac mass at `0`; a singular positive-semidefinite covariance gives a
+ degenerate Gaussian, including the Dirac mass when the covariance is zero; omitting a PosDef field would not
+ establish singularity. The inherited `coneMoment_pos` with `coneMoment_def` excludes the Dirac case, whose
+ cone moment is `0`. -/
+ condHessianCov_posDef : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ (condHessianCov d (K24 d) (R ⟨0, hd⟩) R).PosDef
+ /-- Parent (15.1): `D_u` is the Gaussian cone expectation under the conditional law of the
+ transverse Hessian of `K_24` given `V_u = 0`, in every orthonormal frame with `u = R 0`. -/
+ coneMoment_def : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ coneMoment d (R ⟨0, hd⟩) = coneMomentOf d (K24 d) (R ⟨0, hd⟩) R
+
+/-- Successor of `CoefficientEnclosure` over the successor interface: the same two enclosures
+`0.07340691930603427103 < c_{2,24} < 0.07340691930603427104` and
+`0.04177593184059834334 < c_{3,24} < 0.04177593184059834335`, for any object satisfying
+`PeriodicCoefficientInterface2`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "0.04177593184059834334 < c_3,24 < 0.04177593184059834335."
+Interface: `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.
+Does 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); existence of an inhabitant; that the formal objects are the source's; anything about `CoefficientEnclosure`, which is unchanged; nonauthor review or acceptance. -/
+def CoefficientEnclosure2 (I : PeriodicCoefficientInterface2) : Prop :=
+ CoefficientEnclosure I.toPeriodicCoefficientInterface
+
+/-- Successor of `ReferenceComparison` over the successor interface: display (4),
+`|c_{d,24} / c_{d,ref} - 1| < 10^(-106)` for `d = 2, 3`, for any object satisfying
+`PeriodicCoefficientInterface2`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "|c_d,24/c_d,ref -1| < 10^(-106), d=2,3. (4)"
+Interface: `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).
+Does 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 periodic and reference constants (the source says it is NOT claimed); anything about `ReferenceComparison`, which is unchanged; nothing here encloses the coefficient. -/
+def ReferenceComparison2 (I : PeriodicCoefficientInterface2) : Prop :=
+ ReferenceComparison I.toPeriodicCoefficientInterface
+
+end UniversalLaw.Spec.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/alignment/ACTUAL_FIELD_WITNESS_PRESENT_BUT_NOT_PARENT.lean b/cbz/evidence/website-foundation-20261029/sources/alignment/ACTUAL_FIELD_WITNESS_PRESENT_BUT_NOT_PARENT.lean
new file mode 100644
index 000000000..a07036a15
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/alignment/ACTUAL_FIELD_WITNESS_PRESENT_BUT_NOT_PARENT.lean
@@ -0,0 +1,92 @@
+import SourceLifetimeGeometry
+import SourceThetaBridge
+
+/-! The actual smooth source fills the unchanged Lifetime Gaussian field interface.
+The only final parameter hypothesis is `0 < L`; theta, Gaussian, covariance and
+smoothness properties are proved from the frozen literal source.
+-/
+
+noncomputable section
+open MeasureTheory ProbabilityTheory
+open UniversalLaw.Spec.Lifetime I4SmoothCarrier I4ThetaBridge
+open scoped BigOperators ENNReal NNReal
+
+namespace I4LifetimeField
+
+theorem actualField_covariance (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (x y : E d) :
+ cov[fun ω => actualField d L ω x, fun ω => actualField d L ω y; smoothLaw d L] =
+ periodicCovariance d L (x - y) := by
+ rw [actualField_covariance_spectral d hL]
+ exact sourceSpectralKernel_eq_periodicCovariance d hL (x - y)
+
+theorem actualField_raw_second_moment (d : ℕ) {L : ℝ} (hL : 0 < L)
+ (x y : E d) :
+ ∫ ω, actualField d L ω x * actualField d L ω y ∂smoothLaw d L =
+ periodicCovariance d L (x - y) := by
+ simpa only [ProbabilityTheory.covariance, actualField_integral_zero d hL, sub_zero]
+ using actualField_covariance d hL x y
+
+theorem actualField_linearCombination_variance (d : ℕ) {L : ℝ} (hL : 0 < L)
+ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :
+ Var[fun ω => ∑ i, a i * actualField d L ω (x i); smoothLaw d L] =
+ covQuadForm d L x a := by
+ let : IsProbabilityMeasure (smoothLaw d L) := smoothLaw_isProbabilityMeasure d hL.ne'
+ rw [variance_fun_sum (fun i =>
+ (actualField_eval_hasGaussianLaw d hL (x i)).memLp_two.const_mul (a i))]
+ simp only [covariance_const_mul_left, covariance_const_mul_right,
+ actualField_covariance d hL, covQuadForm]
+ apply Finset.sum_congr rfl
+ intro i _
+ apply Finset.sum_congr rfl
+ intro j _
+ ring
+
+theorem covQuadForm_nonneg (d : ℕ) {L : ℝ} (hL : 0 < L)
+ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :
+ 0 ≤ covQuadForm d L x a := by
+ rw [← actualField_linearCombination_variance d hL x a]
+ exact variance_nonneg _ _
+
+theorem actualField_linearCombination_map (d : ℕ) {L : ℝ} (hL : 0 < L)
+ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :
+ (smoothLaw d L).map (fun ω => ∑ i, a i * actualField d L ω (x i)) =
+ gaussianReal 0 ⟨covQuadForm d L x a, covQuadForm_nonneg d hL x a⟩ := by
+ rw [(actualField_linearCombination_hasGaussianLaw d hL x a).map_eq_gaussianReal,
+ actualField_linearCombination_integral_zero d hL,
+ actualField_linearCombination_variance d hL]
+ congr 1
+ apply Subtype.ext
+ exact Real.coe_toNNReal _ (covQuadForm_nonneg d hL x a)
+
+/-- The original target on the unchanged coefficient carrier and preserved source law. -/
+def actualGaussianFieldInterface (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ GaussianFieldInterface d L where
+ Ω := SmoothSample d L
+ mΩ := inferInstance
+ P := smoothLaw d L
+ isProb := smoothLaw_isProbabilityMeasure d hL.ne'
+ F := actualField d L
+ smooth := actualField_smooth d hL
+ periodic := actualField_periodic d hL
+ summable := theta_summable d hL
+ quad_nonneg := covQuadForm_nonneg d hL
+ gaussian := actualField_linearCombination_map d hL
+ covariance := actualField_raw_second_moment d hL
+
+theorem actualGaussianFieldInterface_exists (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ Nonempty (GaussianFieldInterface d L) :=
+ ⟨actualGaussianFieldInterface d L hL⟩
+
+@[simp] theorem actualGaussianFieldInterface_carrier (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ (actualGaussianFieldInterface d L hL).Ω = SmoothSample d L := rfl
+
+@[simp] theorem actualGaussianFieldInterface_law (d : ℕ) (L : ℝ) (hL : 0 < L) :
+ (actualGaussianFieldInterface d L hL).P = smoothLaw d L := rfl
+
+@[simp] theorem actualGaussianFieldInterface_field (d : ℕ) (L : ℝ) (hL : 0 < L)
+ (ω : SmoothSample d L) (x : E d) :
+ (actualGaussianFieldInterface d L hL).F ω x =
+ smoothSourceField d L ω (coordinates d x) := rfl
+
+end I4LifetimeField
diff --git a/cbz/evidence/website-foundation-20261029/sources/alignment/MAIN_ARITHMETIC_PARENT_BOUNDARY.lean b/cbz/evidence/website-foundation-20261029/sources/alignment/MAIN_ARITHMETIC_PARENT_BOUNDARY.lean
new file mode 100644
index 000000000..adccc6c2d
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/alignment/MAIN_ARITHMETIC_PARENT_BOUNDARY.lean
@@ -0,0 +1,42 @@
+/-!
+# SIDE24 published endpoints — consistency of the frozen artifact
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/ENCLOSURE.json`,
+1090 bytes, SHA-256 `72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811`.
+
+The published decimal endpoints are transcribed here as integers in units of
+`10^-20`. The kernel checks that each interval is nonempty and exactly one
+`10^-20` step wide, and that the two intervals are disjoint and ordered.
+
+This module does **not** establish that the coefficient lies in either
+interval: that claim needs `Real.Gamma`, `Real.pi`, `Real.exp` and the
+Gaussian cone moments, none of which exist in core Lean. That boundary is
+recorded target by target in `formal/SCOPE.md`; the enclosure itself is not a
+target of this package.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- `0.07340691930603427103` and `0.07340691930603427104` in units of `10^-20`. -/
+def d2Lower : Nat := 7340691930603427103
+def d2Upper : Nat := 7340691930603427104
+
+/-- `0.04177593184059834334` and `0.04177593184059834335` in units of `10^-20`. -/
+def d3Lower : Nat := 4177593184059834334
+def d3Upper : Nat := 4177593184059834335
+
+/-- Source: "0.07340691930603427103 < c_2,24 < 0.07340691930603427104" — the
+published endpoints are distinct and adjacent on the 20-digit grid. -/
+theorem d2_endpoints_adjacent : d2Lower < d2Upper ∧ d2Upper = d2Lower + 1 := by decide
+
+/-- Source: "0.04177593184059834334 < c_3,24 < 0.04177593184059834335". -/
+theorem d3_endpoints_adjacent : d3Lower < d3Upper ∧ d3Upper = d3Lower + 1 := by decide
+
+/-- The published `d = 3` interval lies strictly below the `d = 2` interval. -/
+theorem d3_below_d2 : d3Upper < d2Lower := by decide
+
+/-- Both published intervals lie in `(0, 1/10)`: `10^-20`-units below `10^19`. -/
+theorem endpoints_in_unit_tenth : 0 < d3Lower ∧ d2Upper < 10 ^ 19 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/alignment/NEW_ENDPOINT_AND_WHOLE_CARRIER_PROGRESS.lean b/cbz/evidence/website-foundation-20261029/sources/alignment/NEW_ENDPOINT_AND_WHOLE_CARRIER_PROGRESS.lean
new file mode 100644
index 000000000..62da624fa
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/alignment/NEW_ENDPOINT_AND_WHOLE_CARRIER_PROGRESS.lean
@@ -0,0 +1,329 @@
+import SourceSmoothConditionalKernel
+
+/-!
+# Literal determinant weighting on the actual smooth carrier
+
+The base law is the specified actual whole-carrier kernel at the prescribed
+six-pin value. The weight uses the actual endpoint Hessian entries and strict
+maximum/saddle typing. Exact endpoint pushforward identities transfer the
+proved moment and normalizer estimates to every measurable carrier event.
+
+The normalized density formula below is a probability law on the actual smooth
+carrier. It is not identified here with a geometric critical-point-process Palm
+disintegration, and supplies no Morse, elder, counting or event measurability claim.
+See `SOURCE_SMOOTH_PALM.md` for the frozen source contract.
+-/
+
+noncomputable section
+
+open I4SmoothCarrier I4SourceConfluentPins I4SourceEndpointRegression I4SourceSmoothConditional
+open I4SourceEndpointEstimates I4SourceEndpointParameters
+open MeasureTheory ProbabilityTheory ResearchFormalCoreR1 Matrix Filter
+open scoped BigOperators ENNReal Topology
+
+set_option autoImplicit false
+
+namespace I4SourceSmoothPalm
+
+lemma withDensity_map_comp {Ω E : Type*} [MeasurableSpace Ω] [MeasurableSpace E]
+ (μ : Measure Ω) (F : Ω → E) (w : E → ℝ≥0∞) (hF : Measurable F)
+ (hw : Measurable w) :
+ (μ.withDensity (fun ω => w (F ω))).map F = (μ.map F).withDensity w := by
+ ext s hs
+ rw [Measure.map_apply hF hs, withDensity_apply _ (hs.preimage hF),
+ withDensity_apply _ hs, setLIntegral_map hs hw hF]
+
+/-- Normalized weighting commutes exactly with a measurable pushforward.
+The two normalizers are derived to be equal; no positivity or integrability premise is needed. -/
+theorem prwMeasure_map_comp {Ω E : Type*} [MeasurableSpace Ω] [MeasurableSpace E]
+ (μ : Measure Ω) (F : Ω → E) (W : E → ℝ) (hF : Measurable F)
+ (hW : Measurable W) :
+ (prwMeasure μ (W ∘ F)).map F = prwMeasure (μ.map F) W := by
+ have hnormalizer : (∫ ω, (W ∘ F) ω ∂μ) = ∫ y, W y ∂μ.map F :=
+ (integral_map hF.aemeasurable hW.aestronglyMeasurable).symm
+ unfold prwMeasure
+ rw [hnormalizer]
+ exact withDensity_map_comp μ F (fun y => ENNReal.ofReal (W y / ∫ z, W z ∂μ.map F))
+ hF (by fun_prop)
+
+lemma prwMeasure_absolutelyContinuous {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) : prwMeasure μ W ≪ μ :=
+ withDensity_absolutelyContinuous _ _
+
+lemma prwMeasure_ae_of_ae {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) {p : Ω → Prop} (hp : ∀ᵐ ω ∂μ, p ω) :
+ ∀ᵐ ω ∂prwMeasure μ W, p ω :=
+ (prwMeasure_absolutelyContinuous μ W).ae_le hp
+
+lemma prwMeasure_ae_weight_pos {Ω : Type*} [MeasurableSpace Ω]
+ (μ : Measure Ω) (W : Ω → ℝ) (hW : Measurable W)
+ (hZ : 0 < ∫ ω, W ω ∂μ) :
+ ∀ᵐ ω ∂prwMeasure μ W, 0 < W ω := by
+ unfold prwMeasure
+ rw [ae_withDensity_iff (by fun_prop)]
+ filter_upwards [] with ω hω
+ have hd : 0 < W ω / ∫ x, W x ∂μ := ENNReal.ofReal_pos.mp (pos_iff_ne_zero.mpr hω)
+ exact (div_pos_iff_of_pos_right hZ).mp hd
+
+def sourceSmoothLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ) : Measure (SmoothSample 2 L) :=
+ sourceSmoothKernel hL r (sourcePrescribedPins r b)
+
+instance sourceSmoothLaw_isProbabilityMeasure {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :
+ IsProbabilityMeasure (sourceSmoothLaw hL r b) := by
+ unfold sourceSmoothLaw
+ infer_instance
+
+lemma rawPins_prescribed_iff {L : ℝ} (r b : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :
+ rawPins L r ω = ![b,b-r^3/6,0,0,0,0] ↔
+ sourceConfluentPinsAt L r ω = sourcePrescribedPins r b := by
+ change _ ↔ confluentEquiv r hr (rawPins L r ω) = _
+ rw [← show confluentEquiv r hr ![b,b-r^3/6,0,0,0,0] = sourcePrescribedPins r b from
+ prescribed_target r b hr]
+ exact (confluentEquiv r hr).injective.eq_iff.symm
+
+theorem sourceSmoothLaw_raw_pin_fiber {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ sourceSmoothLaw hL r b {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} = 1 := by
+ have hset : {ω : SmoothSample 2 L | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} =
+ {ω | sourceConfluentPinsAt L r ω = sourcePrescribedPins r b} := by
+ ext ω
+ exact rawPins_prescribed_iff r b hr ω
+ rw [hset]
+ exact sourceSmoothKernel_pin_fiber hL r hG (sourcePrescribedPins r b)
+
+lemma sourceRawPins_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :
+ Measurable (rawPins L r) := by
+ have heq : rawPins L r = fun ω => rawTransform r (sourceConfluentPinsAt L r ω) := by
+ funext ω
+ exact (rawTransform_confluentTransform r hr (rawPins L r ω)).symm
+ rw [heq]
+ have hc : Continuous (rawTransform r) := by
+ unfold rawTransform
+ fun_prop
+ exact hc.measurable.comp (sourceConfluentPinsAt_measurable hL r)
+
+theorem sourceSmoothLaw_raw_pin_fiber_ae {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ ∀ᵐ ω ∂sourceSmoothLaw hL r b, rawPins L r ω = ![b,b-r^3/6,0,0,0,0] := by
+ apply (mem_ae_iff_prob_eq_one
+ (measurableSet_eq_fun (sourceRawPins_measurable hL r hr) measurable_const)).2
+ exact sourceSmoothLaw_raw_pin_fiber hL r b hr hG
+
+/-- Every probability measure absolutely continuous with respect to the actual conditioned
+carrier law retains its exact prescribed raw values and zero gradients. -/
+theorem raw_pin_fiber_of_absolutelyContinuous {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r))
+ (ν : Measure (SmoothSample 2 L)) [IsProbabilityMeasure ν]
+ (hν : ν ≪ sourceSmoothLaw hL r b) :
+ ν {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} = 1 := by
+ apply (mem_ae_iff_prob_eq_one
+ (measurableSet_eq_fun (sourceRawPins_measurable hL r hr) measurable_const)).1
+ exact hν.ae_le (sourceSmoothLaw_raw_pin_fiber_ae hL r b hr hG)
+
+theorem prwMeasure_raw_pin_fiber {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) (W : SmoothSample 2 L → ℝ)
+ [IsProbabilityMeasure (prwMeasure (sourceSmoothLaw hL r b) W)] :
+ prwMeasure (sourceSmoothLaw hL r b) W
+ {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} = 1 := by
+ apply raw_pin_fiber_of_absolutelyContinuous hL r b hr hG
+ exact withDensity_absolutelyContinuous _ _
+
+/-- Literal actual symmetric endpoint Hessian entries at M. -/
+def sourceRawHM (L r : ℝ) (ω : SmoothSample 2 L) : Matrix (Fin 2) (Fin 2) ℝ :=
+ let v := rawPinsWithHessians L r ω
+ !![v 6,v 7;v 7,v 8]
+
+/-- Literal actual symmetric endpoint Hessian entries at S. -/
+def sourceRawHS (L r : ℝ) (ω : SmoothSample 2 L) : Matrix (Fin 2) (Fin 2) ℝ :=
+ let v := rawPinsWithHessians L r ω
+ !![v 9,v 10;v 10,v 11]
+
+def sourceSmoothTyped (L r : ℝ) (ω : SmoothSample 2 L) : Prop :=
+ dm2Negative (sourceRawHM L r ω) ∧ (sourceRawHS L r ω).det < 0
+
+/-- Strict maximum/saddle determinant weight of the actual field at its two endpoints. -/
+def sourceSmoothWeight (L r : ℝ) (ω : SmoothSample 2 L) : ℝ := by
+ classical
+ exact if sourceSmoothTyped L r ω then |(sourceRawHM L r ω).det * (sourceRawHS L r ω).det| else 0
+
+lemma sourceRawHM_eq_normalized (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :
+ sourceRawHM L r ω = egm_HM r (sourcePhysicalCoordinates (sourceNormalizedEndpoints L r ω)) := by
+ ext i j
+ fin_cases i <;> fin_cases j <;>
+ simp [sourceRawHM, egm_HM, sourcePhysicalCoordinates, sourceNormalizedEndpoints]
+ all_goals field_simp [hr]
+
+lemma sourceRawHS_eq_normalized (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :
+ sourceRawHS L r ω = egm_HS r (sourcePhysicalCoordinates (sourceNormalizedEndpoints L r ω)) := by
+ ext i j
+ fin_cases i <;> fin_cases j <;>
+ simp [sourceRawHS, egm_HS, sourcePhysicalCoordinates, sourceNormalizedEndpoints]
+ all_goals field_simp [hr]
+
+theorem sourceSmoothWeight_eq (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :
+ sourceSmoothWeight L r ω = sourceEndpointWeight r (sourceNormalizedEndpoints L r ω) := by
+ unfold sourceSmoothWeight sourceSmoothTyped sourceEndpointWeight egm_weight
+ rw [sourceRawHM_eq_normalized L r hr ω, sourceRawHS_eq_normalized L r hr ω]
+ split_ifs <;> rfl
+
+theorem sourceSmoothWeight_nonneg (L r : ℝ) (ω : SmoothSample 2 L) :
+ 0 ≤ sourceSmoothWeight L r ω := by
+ unfold sourceSmoothWeight
+ split_ifs
+ · exact abs_nonneg _
+ · exact le_rfl
+
+theorem sourceSmoothWeight_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :
+ Measurable (sourceSmoothWeight L r) := by
+ have heq : sourceSmoothWeight L r = sourceEndpointWeight r ∘ sourceNormalizedEndpoints L r :=
+ funext (sourceSmoothWeight_eq L r hr)
+ rw [heq]
+ exact (sourceEndpointWeight_measurable r).comp (sourceNormalizedEndpoints_measurable hL r)
+
+theorem sourceSmoothWeight_pos_iff (L r : ℝ) (ω : SmoothSample 2 L) :
+ 0 < sourceSmoothWeight L r ω ↔ sourceSmoothTyped L r ω := by
+ classical
+ by_cases ht : sourceSmoothTyped L r ω
+ · have hM : 0 < (sourceRawHM L r ω).det := by
+ have h := (dm2_negative_iff _ _ _).mp ht.1
+ simpa [sourceRawHM, Matrix.det_fin_two, pow_two] using h.2
+ have hn : (sourceRawHM L r ω).det * (sourceRawHS L r ω).det ≠ 0 :=
+ mul_ne_zero hM.ne' ht.2.ne
+ rw [sourceSmoothWeight, ite_eq_left ht]
+ exact ⟨fun _ => ht, fun _ => abs_pos.mpr hn⟩
+ · simp [sourceSmoothWeight, ht]
+
+theorem sourceSmoothTyped_measurableSet {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :
+ MeasurableSet {ω : SmoothSample 2 L | sourceSmoothTyped L r ω} := by
+ have heq : {ω : SmoothSample 2 L | sourceSmoothTyped L r ω} =
+ {ω | 0 < sourceSmoothWeight L r ω} := by
+ ext ω
+ exact (sourceSmoothWeight_pos_iff L r ω).symm
+ rw [heq]
+ exact measurableSet_lt measurable_const (sourceSmoothWeight_measurable hL r hr)
+
+/-- The whole-carrier probability defined by the literal normalized actual determinant density. -/
+def sourceSmoothWeightedLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ) : Measure (SmoothSample 2 L) :=
+ prwMeasure (sourceSmoothLaw hL r b) (sourceSmoothWeight L r)
+
+theorem sourceSmoothLaw_endpoint_hasLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ HasLaw (sourceNormalizedEndpoints L r) (sourcePhysicalEndpointLaw L r b)
+ (sourceSmoothLaw hL r b) := by
+ refine ⟨(sourceNormalizedEndpoints_measurable hL r).aemeasurable, ?_⟩
+ exact sourceSmoothKernel_physical_prescribed_map hL r b hG
+
+theorem sourceSmoothLaw_weight_square_integrable {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r))
+ (hsq : Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourcePhysicalEndpointLaw L r b)) :
+ Integrable (fun ω => sourceSmoothWeight L r ω ^ 2) (sourceSmoothLaw hL r b) := by
+ simpa only [sourceSmoothWeight_eq L r hr, Function.comp_def] using
+ (sourceSmoothLaw_endpoint_hasLaw hL r b hG).integrable_comp hsq
+
+theorem sourceSmoothLaw_weight_integral {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ (∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b) =
+ ∫ v, sourceEndpointWeight r v ∂sourcePhysicalEndpointLaw L r b := by
+ simpa only [sourceSmoothWeight_eq L r hr, Function.comp_def] using
+ (sourceSmoothLaw_endpoint_hasLaw hL r b hG).integral_comp
+ (sourceEndpointWeight_measurable r).aestronglyMeasurable
+
+theorem sourceSmoothLaw_weight_square_integral {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) =
+ ∫ v, sourceEndpointWeight r v ^ 2 ∂sourcePhysicalEndpointLaw L r b := by
+ simpa only [sourceSmoothWeight_eq L r hr, Function.comp_def] using
+ (sourceSmoothLaw_endpoint_hasLaw hL r b hG).integral_comp
+ ((sourceEndpointWeight_measurable r).pow_const 2).aestronglyMeasurable
+
+/-- Exact endpoint pushforward of the literal weighted whole-carrier law. -/
+theorem sourceSmoothWeightedLaw_endpoint_map {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :
+ (sourceSmoothWeightedLaw hL r b).map (sourceNormalizedEndpoints L r) =
+ sourcePhysicalEndpointWeightedProbability L r b := by
+ have heq : sourceSmoothWeight L r = sourceEndpointWeight r ∘ sourceNormalizedEndpoints L r :=
+ funext (sourceSmoothWeight_eq L r hr)
+ unfold sourceSmoothWeightedLaw sourcePhysicalEndpointWeightedProbability
+ rw [heq, prwMeasure_map_comp _ _ _ (sourceNormalizedEndpoints_measurable hL r)
+ (sourceEndpointWeight_measurable r), (sourceSmoothLaw_endpoint_hasLaw hL r b hG).map_eq]
+
+/-- The event estimate applies to every measurable event of the actual smooth carrier. -/
+theorem sourceSmooth_weighted_event_bound_of_estimates {L : ℝ} (hL : L ≠ 0)
+ (r b C c : ℝ) (hC : 0 ≤ C) (hc : 0 < c) (hr : 0 < r)
+ (hsq : Integrable (fun ω => sourceSmoothWeight L r ω ^ 2) (sourceSmoothLaw hL r b))
+ (hmoment : (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) ≤ C*r^4)
+ (hfloor : c*r^2 ≤ ∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b)
+ (E : Set (SmoothSample 2 L)) (hE : MeasurableSet E) :
+ IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) ∧
+ (sourceSmoothWeightedLaw hL r b).real E ≤
+ (Real.sqrt C/c) * Real.sqrt ((sourceSmoothLaw hL r b).real E) := by
+ exact prw_square_root_event_bound (sourceSmoothLaw hL r b) (sourceSmoothWeight L r)
+ (sourceSmoothWeight_measurable hL r hr.ne') (sourceSmoothWeight_nonneg L r) hsq
+ C c r hC hc hr hmoment hfloor E hE
+
+/-- The literal density is positive only on the strict maximum/saddle type, which has full mass. -/
+theorem sourceSmoothWeightedLaw_typed {L : ℝ} (hL : L ≠ 0) (r b : ℝ) (hr : r ≠ 0)
+ [IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b)]
+ (hZ : 0 < ∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b) :
+ sourceSmoothWeightedLaw hL r b {ω | sourceSmoothTyped L r ω} = 1 := by
+ apply (mem_ae_iff_prob_eq_one (sourceSmoothTyped_measurableSet hL r hr)).1
+ have hp := prwMeasure_ae_weight_pos (sourceSmoothLaw hL r b) (sourceSmoothWeight L r)
+ (sourceSmoothWeight_measurable hL r hr) hZ
+ filter_upwards [hp] with ω hω
+ exact (sourceSmoothWeight_pos_iff L r ω).mp hω
+
+/-- The density preserves the exact raw prescribed values and all four zero first derivatives. -/
+theorem sourceSmoothWeightedLaw_raw_pins {L : ℝ} (hL : L ≠ 0) (r b : ℝ)
+ (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r))
+ [IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b)] :
+ sourceSmoothWeightedLaw hL r b {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} = 1 := by
+ have : IsProbabilityMeasure (prwMeasure (sourceSmoothLaw hL r b) (sourceSmoothWeight L r)) :=
+ ‹IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b)›
+ exact prwMeasure_raw_pin_fiber hL r b hr hG (sourceSmoothWeight L r)
+
+/-- Actual whole-carrier determinant moments, normalizer, probability and event transfer.
+Only the period and fixed prescribed height are inputs; actual covariance limits supply
+all sufficiently-small-radius invertibility needed by the literal endpoint marginal. -/
+theorem sourceSmoothPalm_estimates {L : ℝ} (hL : L ≠ 0) (b : ℝ) :
+ ∃ C c δ : ℝ, 0 ≤ C ∧ 0 < c ∧ 0 < δ ∧ δ ≤ 1 ∧
+ ∀ r : ℝ, 0 < r → r < δ →
+ Integrable (fun ω => sourceSmoothWeight L r ω ^ 2) (sourceSmoothLaw hL r b) ∧
+ (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) ≤ C*r^4 ∧
+ c*r^2 ≤ (∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b) ∧
+ IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) ∧
+ (∀ E : Set (SmoothSample 2 L), MeasurableSet E →
+ (sourceSmoothWeightedLaw hL r b).real E ≤
+ (Real.sqrt C/c) * Real.sqrt ((sourceSmoothLaw hL r b).real E)) ∧
+ (sourceSmoothWeightedLaw hL r b).map (sourceNormalizedEndpoints L r) =
+ sourcePhysicalEndpointWeightedProbability L r b ∧
+ sourceSmoothWeightedLaw hL r b
+ {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} = 1 ∧
+ sourceSmoothWeightedLaw hL r b {ω | sourceSmoothTyped L r ω} = 1 := by
+ obtain ⟨C,c,δE,hC,hc,hδE,hδE1,he⟩ := sourcePhysicalEndpoint_estimates_and_weighted_events hL b
+ obtain ⟨δG,hδG,hGinterval⟩ := mem_nhdsGT_iff_exists_Ioo_subset.mp
+ (sourceEndpoint_parameter_limits hL b).1
+ refine ⟨C,c,min δE δG,hC,hc,lt_min hδE hδG,(min_le_left _ _).trans hδE1,?_⟩
+ intro r hr hrδ
+ have hrE : r < δE := lt_of_lt_of_le hrδ (min_le_left _ _)
+ have hG : IsUnit (sourcePinCovarianceAt L r) :=
+ hGinterval ⟨hr,lt_of_lt_of_le hrδ (min_le_right _ _)⟩
+ obtain ⟨hsqE,hmE,hfE,_,_⟩ := he r hr hrE
+ have hsq := sourceSmoothLaw_weight_square_integrable hL r b hr.ne' hG hsqE
+ have hm : (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) ≤ C*r^4 := by
+ rw [sourceSmoothLaw_weight_square_integral hL r b hr.ne' hG]
+ exact hmE
+ have hf : c*r^2 ≤ ∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b := by
+ rw [sourceSmoothLaw_weight_integral hL r b hr.ne' hG]
+ exact hfE
+ have hp := sourceSmooth_weighted_event_bound_of_estimates hL r b C c hC hc hr
+ hsq hm hf Set.univ MeasurableSet.univ
+ have : IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) := hp.1
+ have hZ : 0 < ∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b :=
+ (mul_pos hc (sq_pos_of_pos hr)).trans_le hf
+ refine ⟨hsq,hm,hf,hp.1,?_,sourceSmoothWeightedLaw_endpoint_map hL r b hr.ne' hG,
+ sourceSmoothWeightedLaw_raw_pins hL r b hr.ne' hG,
+ sourceSmoothWeightedLaw_typed hL r b hr.ne' hZ⟩
+ intro E hE
+ exact (sourceSmooth_weighted_event_bound_of_estimates hL r b C c hC hc hr hsq hm hf E hE).2
+
+end I4SourceSmoothPalm
diff --git a/cbz/evidence/website-foundation-20261029/sources/alignment/PAIR_LAW_SOURCE_BINDING.lean b/cbz/evidence/website-foundation-20261029/sources/alignment/PAIR_LAW_SOURCE_BINDING.lean
new file mode 100644
index 000000000..f2508f7f2
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/alignment/PAIR_LAW_SOURCE_BINDING.lean
@@ -0,0 +1,634 @@
+import Mathlib
+
+/-!
+# Lifetime-track statements: parent Theorems A, B, C, the bounded remainder R and the
+# planar elder lower bound / density gap (statements only)
+
+Scientific effect: NONE. Formal progress of every declaration here: `specified`.
+Organizational-independence credit of this transcription: 0 (Anthropic / Claude).
+
+This module states, as `Prop`-valued definitions, the shapes of the parent lifetime
+results (1.1), (1.2), (1.3) of UNIFORM_MATRIX_CAP_AND_LIFETIME.md, of the bounded
+remainder (R1) of LIFETIME_REMAINDER.md, and of the planar lower bound (E2), the
+two-sided rate (E4) and the compact-window density gap (E11) of
+ELDER_LOWER_AND_DENSITY_GAP.md. Every statement is parametrised by interface objects
+(the Gaussian field, the superlevel-bar / elder-partner relation, and the typed pair law
+probability `p_r(b,k,R)`); it is a statement about whatever objects satisfy those
+interfaces, and the identification of those objects with the objects of the source texts
+is not part of the statement.
+
+This module is self-contained: it imports only Mathlib and re-declares, verbatim up to
+the namespace, the shared objects of `Specifications/Field.lean` (covariance, field
+interface, critical points, Hessian inertia, pairs, superlevel bars, density versions).
+The duplication is deliberate at this layer and is recorded as such.
+
+What this module does not establish. It consists only of definitions and structures;
+it states nothing as a result and proves nothing: none of the parent results, the
+remainder bound or the planar bounds is shown here, and no kernel receipt about them
+exists. It does not transcribe the explicit Gaussian/angular integral (15.2) for the
+leading coefficient `c_{d,L}` (the coefficient is characterised only through the
+leading-term asymptotics of (1.3)); it does not transcribe the regression law
+`Q_{r,b,k,R}`, the typed weight `W_r`, the full normalizer `Z_r` or the marked Kac-Rice
+representation (all informal in the source and taken as the interface field `p`); it
+does not transcribe the reading-rule amendments bound to the parent (congruence erratum,
+Section 9 replacement v1.1, wording W1, embedding radius `r < L/(4 sqrt 2)`), nor the
+marked-cylinder cap support; it asserts no numerical `C`, `r_*`, `z_*`, `ell_*` or
+coefficient value; it does not state Theorem A as consumed by Theorem R; and it does
+not state the compact-window `O(ell^(2/3))` difference for the unrestricted densities.
+The planar statements (E4) and (E11) carry the parent upper bound (1.1), for the same
+typed pair law at `d = 2`, as an explicit hypothesis, as the source does ("If the precise
+Theorem A upper bound in [LP] is consumed"; its Section 4 says the upper half of (E11)
+consumes the parent upper bound already identified there); the direct lower bound (E2) is
+unconditional, as in the source.
+Nothing here promotes, reclassifies or discharges any claim, premise or obligation of
+the registers; the landing disposition `REVIEWED_SCOPED` (lifetime-remainder) and the
+graph classification and review disposition recorded for
+`math.uniform-matrix-cap-lifetime` are transcribed from the registers by the statement
+register, never re-derived here; alignment of these statements with the sources is
+PENDING_INDEPENDENT_REVIEW.
+
+Sources (Layer 0, byte-pinned, `d6g8k5htny-coder/Math-`):
+* `lifetime-parent`: commit `c39164254ad1529ed49543743598d5dcb24bab98`, path
+ `imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md`,
+ sha256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`.
+* `lifetime-remainder`: commit `760340e921ac4ceda296b8118da936f1133e956e`, path
+ `frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md`,
+ sha256 `380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a`.
+* `elder-lower-density-gap`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md`,
+ sha256 `8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c`.
+-/
+
+namespace UniversalLaw.Spec.Lifetime
+
+open MeasureTheory
+
+/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same text, this
+namespace). The duplication is deliberate: modules of this packet import only Mathlib. -/
+
+/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised
+by `L`-periodic functions.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.
+Does not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/
+abbrev E (d : ℕ) : Type := EuclideanSpace ℝ (Fin d)
+
+/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: none.
+Does not claim: anything beyond the definition of the vector `L n`. -/
+noncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : E d :=
+ ∑ i, EuclideanSpace.single i (L * (n i : ℝ))
+
+/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,
+written as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;
+summability is a hypothesis field of `GaussianFieldInterface`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.
+Does not claim: convergence of the sum. -/
+noncomputable def thetaSum (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ ∑' n : Fin d → ℤ, Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2)
+
+/-- The periodized Gaussian covariance
+`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta
+sum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the
+summability field is meant to provide this; not shown here).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: summability of both theta sums is the field `GaussianFieldInterface.summable`.
+Does not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/
+noncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z : E d) : ℝ :=
+ thetaSum d L z / thetaSum d L 0
+
+/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear
+combination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred
+stationary field with covariance `K_L`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.
+Does not claim: positive definiteness (Section 2 of the source). -/
+noncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) : ℝ :=
+ ∑ i, ∑ j, a i * a j * periodicCovariance d L (x i - x j)
+
+/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the defining predicate of a function on the torus.
+Does not claim: anything about the field. -/
+def IsLPeriodic (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ ∀ (x : E d) (n : Fin d → ℤ), g (x + latticeVec d L n) = g x
+
+/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "In particular the field has a smooth version and all finite moments of its global derivative suprema exist."
+Interface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.
+Does not claim: existence of a smooth version, or moment bounds on derivative suprema. -/
+def IsSmooth (d : ℕ) (g : E d → ℝ) : Prop :=
+ ∀ n : ℕ, ContDiff ℝ n g
+
+/-- Interface for the centred stationary Gaussian field of variance one on the torus
+`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample
+paths, their smoothness and periodicity, the Gaussian law of every finite real linear
+combination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic
+form) and the covariance identity are hypothesis fields, as is summability of the theta
+sums. Existence of such an object is not asserted.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: every field of this structure is a given property of the field, never derived.
+Does 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. -/
+structure GaussianFieldInterface (d : ℕ) (L : ℝ) where
+ /-- The underlying probability space (sample space). -/
+ Ω : Type
+ -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not
+ -- registered for typeclass resolution after this declaration; consumers bring it into
+ -- scope with `haveI := G.mΩ`.
+ [mΩ : MeasurableSpace Ω]
+ /-- The probability measure `P`. -/
+ P : Measure Ω
+ -- `P` is a probability measure (square-bracket field).
+ [isProb : IsProbabilityMeasure P]
+ /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/
+ F : Ω → E d → ℝ
+ /-- Section 2 clause: "the field has a smooth version"; every sample path is smooth. -/
+ smooth : ∀ ω, IsSmooth d (F ω)
+ /-- Section 1 clause: the field lives "On the flat torus X = R^d/(L Z^d)"; every sample path
+ is `L`-periodic. -/
+ periodic : ∀ ω, IsLPeriodic d L (F ω)
+ /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/
+ summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))
+ /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/
+ quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a
+ /-- Section 1 clause: "the centered stationary Gaussian field of variance one with covariance"
+ `K_L`; every finite real linear combination of point evaluations has the centred Gaussian
+ law whose variance is the `K_L`-quadratic form. -/
+ gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),
+ Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =
+ ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩
+ /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/
+ covariance : ∀ x y : E d, ∫ ω, F ω x * F ω y ∂P = periodicCovariance d L (x - y)
+
+/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet
+derivative: `hessian d g x v w = D^2 g(x)[v, w]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: symmetry of the form (true for `C^2` functions, not stated here). -/
+noncomputable def hessian (d : ℕ) (g : E d → ℝ) (x v w : E d) : ℝ :=
+ iteratedFDeriv ℝ 2 g x ![v, w]
+
+/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "grad f(M)=grad f(S)=0."
+Interface: none.
+Does not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/
+def IsCriticalPoint (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ fderiv ℝ g x = 0
+
+/-- Sylvester-inertia encoding of "the Hessian at `x` is nondegenerate with exactly `j`
+negative and `d - j` positive eigenvalues": there are complementary subspaces `V`, `W` of
+dimensions `j` and `d - j` on which the Hessian form is negative definite, respectively
+positive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)
+Hessians; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "The index counts negative eigenvalues."
+Interface: none.
+Does not claim: equivalence with an eigenvalue count for a non-symmetric form. -/
+def HessianHasInertia (d : ℕ) (g : E d → ℝ) (x : E d) (j : ℕ) : Prop :=
+ ∃ V W : Submodule ℝ (E d), IsCompl V W ∧
+ Module.finrank ℝ V = j ∧ Module.finrank ℝ W = d - j ∧
+ (∀ v ∈ V, v ≠ 0 → hessian d g x v v < 0) ∧
+ (∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)
+
+/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative
+eigenvalues (negative definite).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/
+def IsNondegMax (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x d
+
+/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one
+positive eigenvalue.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: that such a saddle is a merging saddle of any superlevel bar. -/
+def IsIndexSaddle (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ IsCriticalPoint d g x ∧ HessianHasInertia d g x (d - 1)
+
+/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinM (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ -((r / 2) • u)
+
+/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does 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. -/
+noncomputable def pinS (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ (r / 2) • u
+
+/-- Torus distance between two points of `R^d`: the infimum over the lattice of
+`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the
+same torus point; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: that the height gap of an elder pair is the persistence of a bar in any persistence module. -/
+def heightGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=
+ g M - g S
+
+/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none.
+Does not claim: positivity of the height gap (added separately where the source requires it). -/
+def IsCandidatePair (d : ℕ) (L : ℝ) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S
+
+/-- Morse genericity with distinct critical values on the torus: every critical point is
+nondegenerate (has some inertia) and critical points at distinct torus positions have
+distinct critical values.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Countable exhaustion now proves that Q is almost surely Morse with distinct critical values."
+Interface: none; used only as a hypothesis of the elder-partner interface clause.
+Does not claim: that sample paths are almost surely Morse (Section 8 of the source). -/
+def IsMorseDistinct (d : ℕ) (L : ℝ) (g : E d → ℝ) : Prop :=
+ (∀ x : E d, IsCriticalPoint d g x → ∃ j : ℕ, HessianHasInertia d g x j) ∧
+ (∀ x y : E d, IsCriticalPoint d g x → IsCriticalPoint d g y →
+ 0 < torusDist d L x y → g x ≠ g y)
+
+/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:
+the maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary
+elder death partner relation. These are GIVEN relations; the fields transcribe the source
+clauses that characterise them on smooth periodic functions, and the elder relation is
+pinned only on the Morse distinct-value locus, exactly as the source does.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint."
+Interface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.
+Does 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. -/
+structure SuperlevelBarInterface (d : ℕ) (L : ℝ) where
+ /-- Section 8 clause: the maximin connection level
+ `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/
+ deathHeight : (E d → ℝ) → E d → ℝ
+ /-- The essential class: the global maximum, which "has no older endpoint" and whose
+ superlevel H0 bar is not finite. -/
+ IsEssential : (E d → ℝ) → E d → Prop
+ /-- Section 1 clause: "the global ordinary superlevel elder death partner of M is S". -/
+ ElderPartner : (E d → ℝ) → E d → E d → Prop
+ /-- `M` is essential exactly when no point is strictly higher (so the supremum in the
+ maximin is over an empty set, "equal to -infinity"). -/
+ essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M
+ /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly
+ higher point stays strictly above `h`. -/
+ deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →
+ ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,
+ h < deathHeight g M ↔
+ ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)
+ /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, "equality
+ d_f(M)=f(S)" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle "expresses
+ ordinary elder death at S". -/
+ elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →
+ ∀ M S : E d, ElderPartner g M S ↔
+ (IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)
+
+/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`
+(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus
+distance. The essential global-maximum class is excluded because `ElderPartner` requires
+`¬ IsEssential` on the Morse locus.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death."
+Interface: `I : SuperlevelBarInterface d L` is given.
+Does 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. -/
+def IsFiniteBar (d : ℕ) (L : ℝ) (I : SuperlevelBarInterface d L) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S
+
+/-- The set of pairs of a population `Pair` with both points in the fundamental domain and
+lifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of this set (a field of the density-version predicate). -/
+def pairSet (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop) (g : E d → ℝ) (A : Set ℝ) :
+ Set (E d × E d) :=
+ {p | p.1 ∈ FundDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}
+
+/-- Number of pairs of the population with lifetime in `A` and base points in the
+fundamental domain (`Set.ncard`, which is `0` for an infinite set).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: the population predicate `Pair` is a parameter.
+Does not claim: finiteness of the counted set. -/
+noncomputable def pairCount (d : ℕ) (L : ℝ) (Pair : (E d → ℝ) → E d → E d → Prop)
+ (g : E d → ℝ) (A : Set ℝ) : ℕ :=
+ Set.ncard (pairSet d L Pair g A)
+
+/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population
+`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost
+surely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and
+`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.
+The source's densities are only defined up to such versions. The sigma-algebra of the sample
+space is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket
+field of a bundled record is not registered for typeclass resolution after the declaration).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "These densities admit versions with"
+Interface: 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.
+Does 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. -/
+def IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (Pair : (E d → ℝ) → E d → E d → Prop) (ν : ℝ → ℝ) : Prop :=
+ haveI := G.mΩ
+ (∀ ℓ : ℝ, 0 ≤ ν ℓ) ∧ Measurable ν ∧
+ (∀ A : Set ℝ, MeasurableSet A → A ⊆ Set.Ioi 0 →
+ (∀ᵐ ω ∂G.P, (pairSet d L Pair (G.F ω) A).Finite) ∧
+ Integrable (fun ω => ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ)) G.P ∧
+ IntegrableOn ν A ∧
+ ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)
+
+/-! ### Populations of pairs -/
+
+/-- Compact-window population of Theorem B: ordered maximum / index-(d-1)-saddle pairs with
+`0 < distance <= ρ`, birth `f(M)` in `B = [bLo, bHi]` and scaled gap in `K = [kLo, kHi]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "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."
+Interface: none beyond the shared predicates.
+Does not claim: anything about the off-diagonal (far) population separately (Section 14 of the source). -/
+def IsUnrestrictedPair (d : ℕ) (L : ℝ) (g : E d → ℝ) (M S : E d) : Prop :=
+ IsCandidatePair d L g M S ∧ 0 < heightGap d g M S
+
+/-! ### The typed pair law as an interface -/
+
+/-- Interface for the weighted regression (typed pair) law: the only object consumed by the
+statements is the probability `p_r(b,k,R)` that the global ordinary superlevel elder death
+partner of the pinned maximum `M = -(r/2)u` is the pinned saddle `S = (r/2)u`, under the
+law `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}`.
+That law, its weight, its normalizer and the regression construction are informal in the
+source and are NOT transcribed; `p` is a GIVEN function of radius `r`, birth `b`, gap mark
+`k` and orthonormal frame `R` with values in `[0, 1]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S."
+Interface: `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.
+Does 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). -/
+structure PairLawInterface (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) where
+ /-- Section 1 clause: "Let p_r(b,k,R) be the Q^W probability that the global ordinary
+ superlevel elder death partner of M is S." -/
+ p : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → ℝ
+ /-- `p` is a probability: nonnegative. -/
+ p_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 ≤ p r b k R
+ /-- `p` is a probability: at most one. -/
+ p_le_one : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), p r b k R ≤ 1
+
+/-! ### The parent statements (1.1), (1.2), (1.3) -/
+
+/-- Shape of Theorem A (1.1), uniform selection candidate: for fixed `d ≥ 2`, `L > 0`,
+compact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo ≤ kHi`, there exist `r_* > 0`
+and `C` (quantified OUTSIDE the universal quantifiers over `r`, `b`, `k` and the frame)
+such that `0 <= 1 - p_r(b,k,R) <= C r^3` for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K` and all
+orthonormal frames `R`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "There exist r_*>0 and C 0` and
+windows `B`, `K` of positive length with `kLo > 0`, there are a distance cutoff `r_* > 0`, a
+constant `c_{B,K} > 0` and a constant `C_{B,K}` such that the compact-window candidate and
+elder lifetime densities admit versions `νc`, `νe` with `νc(ℓ) ~ c_{B,K} ℓ^(-1/3)`,
+`νe(ℓ) ~ c_{B,K} ℓ^(-1/3)` as `ℓ ↓ 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and
+`0 ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all sufficiently small `ℓ > 0`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),"
+Interface: `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).
+Does 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. -/
+def ParentCompactWindowDensityB (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo < bHi → 0 < kLo → kLo < kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ c : ℝ, 0 < c ∧ ∃ C : ℝ, ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsWindowPair d L rStar bLo bHi kLo kHi) νc ∧
+ IsLifetimeDensityVersion d L G (IsWindowElderPair d L rStar bLo bHi kLo kHi I) νe ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νc
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ ∃ ℓStar : ℝ, 0 < ℓStar ∧ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3)
+
+/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and
+versions `νc`, `νe` of the unrestricted candidate density and of the finite ordinary
+superlevel H0 bar density satisfy `νc(ℓ) ~ c ℓ^(-1/3)` and `νe(ℓ) ~ c ℓ^(-1/3)` as `ℓ ↓ 0`.
+The essential global-maximum class is excluded from `νe` through `IsFiniteBar`. This is the
+conclusion of (1.3) for a given `c`; it characterises `c_{d,L}` by its leading-term role,
+not by the integral (13.6)/(15.2).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "There is a positive finite constant c_{d,L} such that"
+Interface: `G` and `I` are given; versions are characterised by the integral identity only.
+Does 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. -/
+def IsUnrestrictedLeadingCoefficient (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) (c : ℝ) : Prop :=
+ 0 < c ∧ ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsUnrestrictedPair d L) νc ∧
+ IsLifetimeDensityVersion d L G (IsFiniteBar d L I) νe ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νc
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3)) ∧
+ Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe
+ (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3))
+
+/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for
+fixed `d ≥ 2` and `L > 0` there is a positive finite constant `c_{d,L}` such that the
+unrestricted candidate density and the finite ordinary superlevel H0 bar density (all birth
+heights, all positive gap marks, all separations; essential global maximum excluded) admit
+versions with `ν(ℓ) ~ c_{d,L} ℓ^(-1/3)` as `ℓ ↓ 0`. Leading term only.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),"
+Interface: `G` and `I` are given; versions are characterised by the integral identity only.
+Does 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. -/
+def ParentUnrestrictedLeadingDensityC (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) : Prop :=
+ 2 ≤ d → 0 < L → ∃ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c
+
+/-! ### The bounded remainder (R1) -/
+
+/-- Shape of Theorem R (R1), bounded unrestricted short-lifetime remainder: for fixed
+`d ≥ 2`, `L > 0` and with `c = c_{d,L}` the parent leading coefficient (characterised here
+by `IsUnrestrictedLeadingCoefficient`), there are `ell_* > 0` and `C` such that versions of
+the unrestricted candidate and finite-bar densities satisfy, for `0 < ℓ ≤ ell_*`,
+`|νc(ℓ) - c ℓ^(-1/3)| ≤ C`, `0 ≤ νc(ℓ) - νe(ℓ) ≤ C` and `|νe(ℓ) - c ℓ^(-1/3)| ≤ C`.
+The `O(1)` remainder is stated with an explicit absolute-value bound.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md sha256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a
+Anchor: "|nu_cand(ell)-c ell^(-1/3)| <= C,"
+Interface: `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).
+Does 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. -/
+def RemainderBoundedR1 (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)
+ (I : SuperlevelBarInterface d L) : Prop :=
+ 2 ≤ d → 0 < L → ∀ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c →
+ ∃ ℓStar : ℝ, 0 < ℓStar ∧ ∃ C : ℝ, ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion d L G (IsUnrestrictedPair d L) νc ∧
+ IsLifetimeDensityVersion d L G (IsFiniteBar d L I) νe ∧
+ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ |νc ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C ∧
+ 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C ∧
+ |νe ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C
+
+/-! ### Planar elder lower bound and density gap (d = 2) -/
+
+/-- Shape of the planar direct lower bound (E2): on the fixed planar torus (`d = 2`), with
+birth `b` in a fixed compact interval, `k ∈ [kLo, kHi]` with `kLo > 0` and frames ranging
+over `O(2)`, there are `c > 0` and `r_* > 0` such that `1 - p_r(b,k,R) ≥ c r^3` for all
+`0 < r ≤ r_*`, uniformly in `b`, `k` and the frame.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c
+Anchor: "1-p_r(b,k,R) >= c r^3, 0 0` there are a distance cutoff
+`r_* > 0`, constants `c_{B,K} > 0`, `C_{B,K}` and `ell_* > 0` such that versions of the
+compact-window candidate and ordinary elder densities satisfy
+`c_{B,K} ℓ^(2/3) ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all `0 < ℓ ≤ ell_*`. The parent upper
+input is an explicit hypothesis, not folded into the conclusion. The lower half, which the
+source derives from (E2) alone, is stated under the same hypothesis because the source displays
+(E11) as one two-sided inequality; that is a hypothesis the source does not need for the lower
+half, recorded here as such.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c
+Anchor: " <= C_{B,K} ell^(2/3). (E11)"
+Interface: `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.
+Does 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. -/
+def PlanarDensityGapE11 (L : ℝ) (G : GaussianFieldInterface 2 L) (I : SuperlevelBarInterface 2 L)
+ (PL : PairLawInterface 2 L G I) (bLo bHi kLo kHi : ℝ) : Prop :=
+ ParentUniformSelectionA 2 L G I PL bLo bHi kLo kHi →
+ (0 < L → bLo < bHi → 0 < kLo → kLo < kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ c : ℝ, 0 < c ∧ ∃ C : ℝ, ∃ ℓStar : ℝ, 0 < ℓStar ∧
+ ∃ νc νe : ℝ → ℝ,
+ IsLifetimeDensityVersion 2 L G (IsWindowPair 2 L rStar bLo bHi kLo kHi) νc ∧
+ IsLifetimeDensityVersion 2 L G (IsWindowElderPair 2 L rStar bLo bHi kLo kHi I) νe ∧
+ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →
+ c * ℓ ^ ((2 : ℝ) / 3) ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3))
+
+end UniversalLaw.Spec.Lifetime
diff --git a/cbz/evidence/website-foundation-20261029/sources/alignment/REGULAR_LEVEL_GEOMETRY_BOUNDARY.lean b/cbz/evidence/website-foundation-20261029/sources/alignment/REGULAR_LEVEL_GEOMETRY_BOUNDARY.lean
new file mode 100644
index 000000000..a7a803960
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/alignment/REGULAR_LEVEL_GEOMETRY_BOUNDARY.lean
@@ -0,0 +1,55 @@
+import RegularSuperlevel
+import RegularPointChart
+
+/-!
+Draft literal regular-point consumers of the separately owned scalar chart.
+
+Released dependency: Research Task Watch's RegularPointChart.lean at Math-
+commit 72edcf5b93be45c29f2d10a26f7d8e861a48f528, 2,767 bytes, SHA-256
+5568c8d6e03f7064cd5924ebe2814ae746100505ae31789d5c975902528f9fa2.
+That source was frozen and released by its owner. This C297 consumer has not
+yet been compiled or kernel-checked.
+It neither reimplements the chart nor modifies the topology candidate under replay.
+
+The public conclusions are actual path-connected neighborhood bases in the
+closed-superlevel subtype. The critical-boundary case and quotient transport
+remain outside these statements.
+-/
+
+open Set Filter Topology
+open UniversalLaw.Spec.Lifetime
+
+namespace TorusRegularSuperlevel
+
+/-- At a literal noncritical point, the closed superlevel has a neighborhood
+basis of path-connected sets. The supplied smoothness and noncriticality
+construct the chart through the separately owned regular-point module. -/
+theorem closed_superlevel_regular_basis
+ {d : ℕ} {g : E d → ℝ}
+ (hsmooth : IsSmooth d g)
+ (a : ℝ) (x : {y : E d // a ≤ g y})
+ (hregular : ¬ IsCriticalPoint d g x.val) :
+ (𝓝 x).HasBasis
+ (fun V : Set {y : E d // a ≤ g y} =>
+ V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ exact closed_superlevel_basis_of_chart a x
+ (regularPointChart hsmooth hregular)
+ (mem_regularPointChart_source hsmooth hregular)
+ (fun y _ => regularPointChart_fst hsmooth hregular y)
+
+/-- The pointwise basis required for eventual global LPC holds at every
+strict-interior or literal regular point of the closed superlevel.
+No chart or LPC hypothesis appears in this public interface. -/
+theorem closed_superlevel_path_connected_basis
+ {d : ℕ} {g : E d → ℝ}
+ (hsmooth : IsSmooth d g)
+ (a : ℝ) (x : {y : E d // a ≤ g y})
+ (hx : a < g x.val ∨ ¬ IsCriticalPoint d g x.val) :
+ (𝓝 x).HasBasis
+ (fun V : Set {y : E d // a ≤ g y} =>
+ V ∈ 𝓝 x ∧ IsPathConnected V) id := by
+ rcases hx with hinterior | hregular
+ · exact closed_superlevel_interior_basis (hsmooth 0).continuous a x hinterior
+ · exact closed_superlevel_regular_basis hsmooth a x hregular
+
+end TorusRegularSuperlevel
diff --git a/cbz/evidence/website-foundation-20261029/sources/alignment/RN_REGRESSION_PALM_BINDING.lean b/cbz/evidence/website-foundation-20261029/sources/alignment/RN_REGRESSION_PALM_BINDING.lean
new file mode 100644
index 000000000..8af911ef6
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/alignment/RN_REGRESSION_PALM_BINDING.lean
@@ -0,0 +1,1009 @@
+import Mathlib
+
+/-!
+# RN-track statements: count interface (Theorem N), fixed-remote and fixed-annulus
+# height windows, the D5 reconciliation rows, the dimension lift, the C6 moment
+# bounds, the rare-cluster Poisson obstruction and the open witness-collision target
+# (statements only)
+
+Scientific effect: NONE. Formal progress of every declaration here: `specified`.
+Organizational-independence credit of this transcription: 0 (Anthropic / Claude).
+
+This module states, as `Prop`-valued definitions, the shapes of the RN-track results:
+the abstract probability-to-count interface (N1)-(N5) of RN_COUNT_INTERFACE.md, the
+fixed-remote Theorem A displays (2) and (3) of remote_window_20260924/PROOF.md, the
+fixed-annulus height-window candidate (A2) of FIXED_ANNULUS_CANDIDATE.md, the all-height
+annulus bridge display (2) of rn_annulus_bridge_20260925/PROOF.md, the six reconciled
+rows D5-a ... D5-f of RECONCILIATION.md, the headline displays of Theorems P_d, C_d,
+I_d, G_d of d5_dimension_lift_20260929/PROOF.md, the planar (F4) display of
+c6_fourier_cutoff_20260929/PROOF.md, Theorem Q and Corollary Theta of
+c6_palm_route_20260929/PROOF.md, Theorem O of c6_rare_cluster_laws_20260929/PROOF.md,
+Corollary D of remote_collision_20260928/PROOF.md, and, labelled as an OPEN obligation
+whose Prop is a target and not a result, the regional near-pin witness-collision
+second-moment target of GRAPH node `math.rn-region.witness-collision`.
+
+Every statement about the pinned Gaussian model is parametrised by an interface object
+`PinnedLawInterface`: the sample space, the sample paths, the Gaussian regression law
+`Q_r`, the typed endpoint weight `W_r`, the tilted law `Q_r^W = (W_r/Z_r) Q_r` and the
+contact kernel `Lambda_j` are GIVEN; their Gaussian-regression construction, the
+determinant form of the weight and the Kac-Rice representation of the kernel are informal
+in the sources and are not transcribed. The pin equations, the positivity of the normalizer
+and the exact tilt are required only in the pin regime `0 < r < L`, this module's reading of
+the sources' "For small r>0 the pins are" (for `0 < r < L` the two pins are distinct modulo
+`L Z^d`, so the pin equations are consistent with `L`-periodicity); outside that regime the
+laws are unconstrained given probability measures. The statements are about whatever objects satisfy
+the interface; the identification of those objects with the objects of the source texts is
+not part of any statement.
+
+This module is self-contained: it imports only Mathlib and re-declares, up to the
+namespace, the shared objects of `Specifications/Field.lean` that it needs (ambient space,
+lattice vectors, Hessian form, critical points, inertia, pins, torus distance, fundamental
+domain): the nine bodies are byte-identical to Field.lean's, and so are the docstrings except
+the `Does not claim:` lines of `pinM` and `pinS`, which are module-specific (Field.lean
+records that no statement there consumes the pins; here the interface and the window
+statements consume them). The duplication is deliberate at this layer and is recorded as
+such.
+
+What this module does not establish. It consists only of definitions and structures; it
+states nothing as a result and proves nothing: none of Theorem N, Theorem A, the annulus
+candidates, the D5 rows, the dimension lift, the C6 bounds, the rare-cluster Poisson
+obstruction or the collision target is shown here, and no kernel receipt about them exists. It does not
+construct the Gaussian field or the regression law `Q_r`; it does not transcribe the
+determinant/inertia form of `W_r` (only its sign and typing), the normalizer floor
+`Z_r >= z_* r^2`, the observation transform `U_r`, the coupling estimates, the weighted
+Kac-Rice formulas (N6), (12), (A21), (16), (3.1) or the contact-kernel integral (13); it
+asserts no numerical constant, radius or cutoff; it does not state the two-scale, thin-tube,
+microdisk, collar, intermediate-window or elder sources that the D5 rows consume; it does
+not state Theorem F (F1)-(F2) or Proposition B of the Fourier cutoff note, Corollary P of
+the Palm route, Theorems C and S of the rare-cluster note, or Theorem C / Corollaries E, F
+of the remote-collision note; and it does not assert that the open target is attainable.
+Nothing here promotes, reclassifies or discharges any claim, premise or obligation of the
+registers: the landing dispositions `HOLD_WITH_DOMAIN` (rn-count-interface,
+rn-fixed-remote-window) and `REVIEWED_SCOPED` (rn-fixed-annulus-window), and the GRAPH
+classifications of the `math.rn-region.*` nodes (including `OPEN_ACTIVE` for
+`witness-collision`), are transcribed from the registers by the statement register, never
+re-derived here; alignment of these statements with the sources is
+PENDING_INDEPENDENT_REVIEW.
+
+Sources (Layer 0, byte-pinned, `d6g8k5htny-coder/Math-`):
+* `lifetime-parent` (shared objects): commit `c39164254ad1529ed49543743598d5dcb24bab98`,
+ path `imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md`,
+ sha256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`.
+* `rn-count-interface`: commit `760340e921ac4ceda296b8118da936f1133e956e`, path
+ `frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md`,
+ sha256 `aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab`.
+* `rn-fixed-remote-window`: commit `760340e921ac4ceda296b8118da936f1133e956e`, path
+ `frontiers/remote_window_20260924/PROOF.md`,
+ sha256 `a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7`.
+* `rn-fixed-annulus-window`: commit `760340e921ac4ceda296b8118da936f1133e956e`, path
+ `frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md`,
+ sha256 `1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b`.
+* `rn-annulus-bridge`: commit `760340e921ac4ceda296b8118da936f1133e956e`, path
+ `frontiers/rn_annulus_bridge_20260925/PROOF.md`,
+ sha256 `d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05`.
+* `d5-reconciliation`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `reviews/d5_reconciliation_20260929/RECONCILIATION.md`,
+ sha256 `14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432`.
+* `d5-dimension-lift`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/d5_dimension_lift_20260929/PROOF.md`,
+ sha256 `6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80`.
+* `c6-fourier-cutoff`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/c6_fourier_cutoff_20260929/PROOF.md`,
+ sha256 `c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733`.
+* `c6-palm-route`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/c6_palm_route_20260929/PROOF.md`,
+ sha256 `aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b`.
+* `c6-rare-cluster`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/c6_rare_cluster_laws_20260929/PROOF.md`,
+ sha256 `c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb`.
+* `remote-collision`: commit `6c020d6a72936632f2055122e71a7818a4ff497e`, path
+ `frontiers/remote_collision_20260928/PROOF.md`,
+ sha256 `b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2`.
+-/
+
+namespace UniversalLaw.Spec.RN
+
+open MeasureTheory
+
+/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same bodies, this
+namespace; see the module header for the two module-specific `Does not claim:` lines). The
+duplication is deliberate: modules of this packet import only Mathlib. -/
+
+/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised
+by `L`-periodic functions.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance"
+Interface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.
+Does not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/
+abbrev E (d : ℕ) : Type := EuclideanSpace ℝ (Fin d)
+
+/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)"
+Interface: none.
+Does not claim: anything beyond the definition of the vector `L n`. -/
+noncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : E d :=
+ ∑ i, EuclideanSpace.single i (L * (n i : ℝ))
+
+/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet
+derivative: `hessian d g x v w = D^2 g(x)[v, w]`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue."
+Interface: none.
+Does not claim: symmetry of the form (true for `C^2` functions, not stated here). -/
+noncomputable def hessian (d : ℕ) (g : E d → ℝ) (x v w : E d) : ℝ :=
+ iteratedFDeriv ℝ 2 g x ![v, w]
+
+/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "grad f(M)=grad f(S)=0."
+Interface: none.
+Does not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/
+def IsCriticalPoint (d : ℕ) (g : E d → ℝ) (x : E d) : Prop :=
+ fderiv ℝ g x = 0
+
+/-- Sylvester-inertia encoding of "the Hessian at `x` is nondegenerate with exactly `j`
+negative and `d - j` positive eigenvalues": there are complementary subspaces `V`, `W` of
+dimensions `j` and `d - j` on which the Hessian form is negative definite, respectively
+positive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)
+Hessians; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "The index counts negative eigenvalues."
+Interface: none.
+Does not claim: equivalence with an eigenvalue count for a non-symmetric form. -/
+def HessianHasInertia (d : ℕ) (g : E d → ℝ) (x : E d) (j : ℕ) : Prop :=
+ ∃ V W : Submodule ℝ (E d), IsCompl V W ∧
+ Module.finrank ℝ V = j ∧ Module.finrank ℝ W = d - j ∧
+ (∀ v ∈ V, v ≠ 0 → hessian d g x v v < 0) ∧
+ (∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)
+
+/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does not claim: that `u` is a unit vector (a hypothesis where used). -/
+noncomputable def pinM (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ -((r / 2) • u)
+
+/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "M=-(r/2)u, S=(r/2)u,"
+Interface: none.
+Does not claim: that `u` is a unit vector (a hypothesis where used). -/
+noncomputable def pinS (d : ℕ) (r : ℝ) (u : E d) : E d :=
+ (r / 2) • u
+
+/-- Torus distance between two points of `R^d`: the infimum over the lattice of
+`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the
+same torus point; not shown here.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Count ordered maximum/saddle pairs with 0 1`,
+`E[N 1_E] ≤ (E N^p)^(1/p) P(E)^(1-1/p)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "E[N_r 1_Er] <= (E N_r^p)^(1/p) P(E_r)^(1-1/p)."
+Interface: none; the probability space, event and count are universally quantified, integrability of `N^p` is a hypothesis.
+Does 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). -/
+def HolderCountBoundN1 : Prop :=
+ ∀ (Ω : Type) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
+ (Ev : Set Ω) (N : Ω → ℕ) (p : ℝ),
+ MeasurableSet Ev → 1 < p → Integrable (fun ω => (N ω : ℝ) ^ p) P →
+ ∫ ω, (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω ∂P ≤
+ (∫ ω, (N ω : ℝ) ^ p ∂P) ^ (1 / p) * (P Ev).toReal ^ (1 - 1 / p)
+
+/-- Shape of (N2), the consequence of (N1) with a power-law moment bound: if
+`E N^p ≤ A r^(-β)` and `P(E) ≤ C r^3` then
+`E[N 1_E] ≤ A^(1/p) C^(1-1/p) r^((3(p-1)-β)/p)`. The powers refer to the `p`-th MOMENT
+itself, as the source insists.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "E[N_r 1_Er] <= A^(1/p) C^(1-1/p)"
+Interface: none; `A`, `β`, `C`, `p`, `r` and the probability space are universally quantified, the two bounds are hypotheses.
+Does 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). -/
+def HolderConsequenceN2 : Prop :=
+ ∀ (Ω : Type) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
+ (Ev : Set Ω) (N : Ω → ℕ) (p A β C r : ℝ),
+ MeasurableSet Ev → 1 < p → 0 ≤ A → 0 ≤ C → 0 < r →
+ Integrable (fun ω => (N ω : ℝ) ^ p) P →
+ ∫ ω, (N ω : ℝ) ^ p ∂P ≤ A * r ^ (-β) →
+ (P Ev).toReal ≤ C * r ^ 3 →
+ ∫ ω, (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω ∂P ≤
+ A ^ (1 / p) * C ^ (1 - 1 / p) * r ^ ((3 * (p - 1) - β) / p)
+
+/-- Shape of (N3), the exact identity `E[N 1_E] = q E[N | E]` with `q = P(E) > 0`, stated
+with Mathlib's conditional measure `P[|E] = P(E)⁻¹ P|_E` for the conditional expectation.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "E[N_r 1_Er]=q E[N_r | E_r]."
+Interface: none; the probability space, event and count are universally quantified, `P(E) > 0` and integrability of `N` are hypotheses.
+Does 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). -/
+def ConditionalMeanIdentityN3 : Prop :=
+ ∀ (Ω : Type) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
+ (Ev : Set Ω) (N : Ω → ℕ),
+ MeasurableSet Ev → 0 < (P Ev).toReal → Integrable (fun ω => (N ω : ℝ)) P →
+ ∫ ω, (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω ∂P =
+ (P Ev).toReal * ∫ ω, (N ω : ℝ) ∂(ProbabilityTheory.cond P Ev)
+
+/-- The law of `U` uniform on `[0,1]`: Lebesgue measure restricted to `[0, 1]`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "On one space take U uniform on [0,1]."
+Interface: none; an explicit construction.
+Does not claim: that this measure is a probability measure (true, not stated as a result here). -/
+noncomputable def uniformLaw : Measure ℝ := volume.restrict (Set.Icc (0 : ℝ) 1)
+
+/-- The counterexample count `N_r = ceil(log(1/r)) 1_{E_r}` with `E_r = {U ≤ r^3}`, as a
+function of the uniform variable `u`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "N_r=ceil(log(1/r)) 1_Er."
+Interface: none; an explicit construction.
+Does not claim: that this count is a realization of any Gaussian field quantity (the source says it is NOT). -/
+noncomputable def counterCount (r : ℝ) (u : ℝ) : ℝ :=
+ (⌈Real.log (1 / r)⌉₊ : ℝ) * (Set.Iic (r ^ 3)).indicator (fun _ => (1 : ℝ)) u
+
+/-- Shape of the sharp counterexample (N4): for `0 < r ≤ e^(-1)`, `P(E_r) = r^3` and
+`E N_r / r^3 = ceil(log(1/r))`, which tends to infinity as `r ↓ 0`, while for EACH finite
+`p ≥ 1` the `p`-th moments `E N_r^p` are bounded uniformly in `r` (by a constant that may
+depend on `p`). So every finite moment does not preserve the cubic exponent.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "E N_r/r^3=ceil(log(1/r)) -> infinity."
+Interface: none; the construction is explicit (`uniformLaw`, `counterCount`).
+Does 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). -/
+def UniformCounterexampleN4 : Prop :=
+ (∀ r : ℝ, 0 < r → r ≤ Real.exp (-1) →
+ (uniformLaw (Set.Iic (r ^ 3))).toReal = r ^ 3 ∧
+ (∫ u, counterCount r u ∂uniformLaw) / r ^ 3 = (⌈Real.log (1 / r)⌉₊ : ℝ)) ∧
+ Filter.Tendsto (fun r : ℝ => (∫ u, counterCount r u ∂uniformLaw) / r ^ 3)
+ (nhdsWithin (0 : ℝ) (Set.Ioi 0)) Filter.atTop ∧
+ (∀ p : ℝ, 1 ≤ p → ∃ A : ℝ, ∀ r : ℝ, 0 < r → r ≤ Real.exp (-1) →
+ ∫ u, counterCount r u ^ p ∂uniformLaw ≤ A)
+
+/-- Shape of (N5), the exponential-tail layer-cake bound: if `P(N > t) ≤ A exp(-t/B)` for
+all `t ≥ 0` with `A ≥ 1`, `B > 0`, and `q = P(E) > 0`, then
+`E[N 1_E] ≤ B q [1 + log(A/q)]`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab
+Anchor: "= B q[1+log(A/q)]."
+Interface: none; the probability space, event, count and tail constants are universally quantified, the tail bound is a hypothesis.
+Does 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). -/
+def ExponentialTailLayerCakeN5 : Prop :=
+ ∀ (Ω : Type) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
+ (Ev : Set Ω) (N : Ω → ℕ) (A B : ℝ),
+ MeasurableSet Ev → 1 ≤ A → 0 < B → 0 < (P Ev).toReal →
+ Integrable (fun ω => (N ω : ℝ)) P →
+ (∀ t : ℝ, 0 ≤ t → (P {ω | t < (N ω : ℝ)}).toReal ≤ A * Real.exp (-t / B)) →
+ ∫ ω, (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω ∂P ≤
+ B * (P Ev).toReal * (1 + Real.log (A / (P Ev).toReal))
+
+/-! ### The pinned weighted law as an interface -/
+
+/-- Interface for the pinned Gaussian regression law and its determinant tilt. The sample
+space `Ω` and its sigma-algebra are parameters; the sample paths `F`, the regression law
+`Q_r = Q r b k R` on the `2(d+1)` pin observations at `M = -(r/2)u`, `S = (r/2)u`
+(`u = R e_1`), the typed endpoint weight `W_r`, the tilted law `Q_r^W` and the contact
+kernel `Lambda_j` are GIVEN. The hypothesis fields transcribe: smooth `L`-periodic sample
+paths; `Q_r` is a probability measure under which, in the pin regime `0 < r < L`, the
+`2(d+1)` pin equations hold almost surely; `W_r ≥ 0` vanishes unless `H_M` is negative
+definite and `H_S` has index `d-1`; in the same regime `Z_r = E_(Q_r) W_r > 0` and
+`dQ_r^W = (W_r/Z_r) dQ_r` exactly (`Measure.withDensity`); and `Q_r^W` is a probability
+measure. The regime `0 < r < L` is this module's reading of the source clause "For small r>0
+the pins are": for `0 < r < L` the pins `M`, `S` are distinct modulo `L Z^d` (`‖S - M‖ = r`
+while every nonzero lattice vector has norm at least `L`), so the pin equations are
+consistent with `L`-periodicity; without the gate the structure would have no inhabitant for
+`L > 0` (at `r = L` along a coordinate frame the two pins coincide on the torus, so the pin
+values `b` and `b - k r^3` would be prescribed at one point). The Gaussian-regression
+construction of `Q_r`, the determinant factors `|det H_M| |det H_S|` of `W_r` and the
+Kac-Rice contact representation (13) of `Lambda_j` are informal in the sources and are NOT
+transcribed. Existence of such an object is not asserted (a Dirac mass at one smooth
+`L`-periodic sample path with the prescribed pin values, a nondegenerate maximum at `M` and a
+nondegenerate index-`(d-1)` saddle at `S`, with `W = 1` on that path, would satisfy the gated
+fields; this consistency remark is not a statement of this module).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7
+Anchor: "Q_r denotes continuous Gaussian regression on these 2(d+1) observations."
+Interface: 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.
+Does 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. -/
+structure PinnedLawInterface (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω] where
+ /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/
+ F : Ω → E d → ℝ
+ /-- Section 2 clause: "The real Fourier series therefore has smooth versions"; every
+ sample path is `C^n` for every finite `n`. -/
+ smooth : ∀ (ω : Ω) (n : ℕ), ContDiff ℝ n (F ω)
+ /-- Section 1 clause: the field lives "On X=R^d/(L Z^d)"; every sample path is `L`-periodic. -/
+ periodic : ∀ (ω : Ω) (x : E d) (n : Fin d → ℤ), F ω (x + latticeVec d L n) = F ω x
+ /-- Section 1 clause: "Q_r denotes continuous Gaussian regression on these 2(d+1)
+ observations", indexed by radius `r`, birth `b`, gap mark `k` and frame `R`. -/
+ Q : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → Measure Ω
+ /-- `Q_r` is a probability measure. -/
+ Q_prob : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), IsProbabilityMeasure (Q r b k R)
+ /-- Section 1 clause: the pins "f(M)=b, f(S)=b-k r^3, grad f(M)=grad f(S)=0" hold
+ `Q_r`-almost surely in the pin regime `0 < r < L` (source: "For small r>0 the pins are"). -/
+ Q_pinned : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 < r → r < L →
+ ∀ᵐ ω ∂(Q r b k R),
+ F ω (pinM d r (R 0)) = b ∧ F ω (pinS d r (R 0)) = b - k * r ^ 3 ∧
+ IsCriticalPoint d (F ω) (pinM d r (R 0)) ∧ IsCriticalPoint d (F ω) (pinS d r (R 0))
+ /-- Section 1 clause: the "actual endpoint weight" `W_r=F_d(H_M) F_(d-1)(H_S)`, as a
+ given functional of the sample. -/
+ W : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → Ω → ℝ
+ /-- `W_r ≥ 0` (a product of filtered absolute determinants). -/
+ W_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (ω : Ω), 0 ≤ W r b k R ω
+ /-- Section 1 clause: `F_j(H)=|det H| 1{H has j negative eigenvalues}`, "with value zero
+ on singular matrices"; so `W_r ≠ 0` forces `H_M` negative definite and `H_S` of index
+ `d-1`. -/
+ W_typed : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (ω : Ω), W r b k R ω ≠ 0 →
+ HessianHasInertia d (F ω) (pinM d r (R 0)) d ∧ HessianHasInertia d (F ω) (pinS d r (R 0)) (d - 1)
+ /-- Section 1 clause: the "FULL normalizer" `Z_r=E_(Q_r) W_r` is positive in the pin
+ regime `0 < r < L`. -/
+ Z_pos : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 < r → r < L →
+ 0 < ∫ ω, W r b k R ω ∂(Q r b k R)
+ /-- The tilted law `Q_r^W`. -/
+ QW : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → Measure Ω
+ /-- Section 1 clause: `dQ_r^W=(W_r/Z_r)dQ_r`, exactly, in the pin regime `0 < r < L`. -/
+ QW_eq : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 < r → r < L →
+ QW r b k R = (Q r b k R).withDensity
+ (fun ω => ENNReal.ofReal (W r b k R ω / ∫ ω', W r b k R ω' ∂(Q r b k R)))
+ /-- `Q_r^W` is a probability measure. -/
+ QW_prob : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), IsProbabilityMeasure (QW r b k R)
+ /-- Section 5 clause (13): "The contact kernel is Lambda_j(x;b,k,u)", a given function of
+ the index `j`, birth `b`, gap mark `k`, axial direction `u` and position `x`. -/
+ Λ : ℕ → ℝ → ℝ → E d → E d → ℝ
+
+/-! ### Counts and regions -/
+
+/-- `N_(r,j)(E)`: the number of index-`j` critical points of `g` in `A` with height STRICTLY
+between `b - k r^3` and `b` (`Set.ncard`, which is `0` for an infinite set).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7
+Anchor: "N_(r,j)(E)=#{x in E: grad f(x)=0, index H_x=j,"
+Interface: none.
+Does 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). -/
+noncomputable def windowCount (d : ℕ) (g : E d → ℝ) (b k r : ℝ) (j : ℕ) (A : Set (E d)) : ℕ :=
+ Set.ncard {x : E d | x ∈ A ∧ IsCriticalPoint d g x ∧ HessianHasInertia d g x j ∧
+ b - k * r ^ 3 < g x ∧ g x < b}
+
+/-- All-index window count: the number of critical points of `g` in `A` (degenerate ones
+included) with height strictly between `b - k r^3` and `b`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b
+Anchor: "`N` is the number of critical points of `f` in `X minus {M, S}` with height in `I_r`, all"
+Interface: none.
+Does not claim: finiteness of the counted set; equality with the sum of the index counts (true off the degenerate locus, not stated). -/
+noncomputable def windowCountAll (d : ℕ) (g : E d → ℝ) (b k r : ℝ) (A : Set (E d)) : ℕ :=
+ Set.ncard {x : E d | x ∈ A ∧ IsCriticalPoint d g x ∧ b - k * r ^ 3 < g x ∧ g x < b}
+
+/-- `N(E) = sum_j N_j(E)`: the all-index window count of the remote-collision note, the sum
+over `j = 0, ..., d` of the index-`j` window counts (critical points with nonsingular Hessian
+of index `j`; an index above `d` does not occur in `R^d`).
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/remote_collision_20260928/PROOF.md sha256 b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2
+Anchor: "N(E) = sum_j N_j(E)."
+Interface: none.
+Does not claim: finiteness of the counted sets; equality with `windowCountAll` (the two agree only off the degenerate locus). -/
+noncomputable def windowCountIndexSum (d : ℕ) (g : E d → ℝ) (b k r : ℝ) (A : Set (E d)) : ℕ :=
+ ∑ j ∈ Finset.range (d + 1), windowCount d g b k r j A
+
+/-- `N_j(E)`: the number of index-`j` critical points of `g` in `A` at all heights.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_annulus_bridge_20260925/PROOF.md sha256 d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05
+Anchor: "let N_j(rE) count index-j critical points in rE at **all heights**."
+Interface: none.
+Does not claim: finiteness of the counted set. -/
+noncomputable def allHeightCount (d : ℕ) (g : E d → ℝ) (j : ℕ) (A : Set (E d)) : ℕ :=
+ Set.ncard {x : E d | x ∈ A ∧ IsCriticalPoint d g x ∧ HessianHasInertia d g x j}
+
+/-- The remote region `D_rho = {x : dist_X(x,0) >= rho}`, represented in the fundamental
+domain so that a Borel subset of it carries one representative per torus point.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7
+Anchor: "Fix 0=rho}."
+Interface: none.
+Does not claim: anything about the representation of torus Borel sets beyond this choice. -/
+def remoteRegion (d : ℕ) (L ρ : ℝ) : Set (E d) :=
+ {x : E d | x ∈ FundDomain d L ∧ ρ ≤ torusDist d L x 0}
+
+/-- The torus with the two pins removed, `X minus {M, S}`, represented in the fundamental
+domain: points at positive torus distance from both `M = -(r/2)u` and `S = (r/2)u`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b
+Anchor: "critical points of `f` in `X minus {M, S}`"
+Interface: none.
+Does not claim: anything beyond the definition. -/
+def torusMinusPins (d : ℕ) (L r : ℝ) (u : E d) : Set (E d) :=
+ {x : E d | x ∈ FundDomain d L ∧ 0 < torusDist d L x (pinM d r u) ∧ 0 < torusDist d L x (pinS d r u)}
+
+/-- The torus-wide all-index window count `N` of the C6 notes: critical points other than
+`M, S` with height in `I_r = (b - k r^3, b)`, under the frame `R` (axial direction `R 0`).
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b
+Anchor: "`N` is the number of critical points of `f` in `X minus {M, S}` with height in `I_r`, all"
+Interface: `I : PinnedLawInterface` supplies the sample paths.
+Does not claim: finiteness or measurability of the count as a function of the sample. -/
+noncomputable def torusWindowCount (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (ω : Ω) : ℕ :=
+ windowCountAll d (I.F ω) b k r (torusMinusPins d L r (R 0))
+
+/-- Ordered pairs of distinct window critical points (both in `X minus {M, S}`, both with
+height in `I_r`, at positive torus distance from each other) such that the FIRST witness is
+within torus distance `η` of a pin. All mutual separations are included, down to collision.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "one witness is within fixed `η` of a pin."
+Interface: none.
+Does not claim: finiteness or measurability of the counted set (`Set.ncard` is `0` on an infinite set);
+that an ordered pair whose only near-pin witness is in second position is counted (it is not: it is
+the swap of a counted pair, so in the finite case the source's "at least one witness near a pin"
+count lies between this count and twice it, and a bound `C r^3` on this count is a bound `2 C r^3`
+on the source's; the two functionals are not literally the same). -/
+noncomputable def nearPinPairCount (d : ℕ) (L : ℝ) (g : E d → ℝ) (b k r η : ℝ) (u : E d) : ℕ :=
+ Set.ncard {q : E d × E d |
+ q.1 ∈ torusMinusPins d L r u ∧ q.2 ∈ torusMinusPins d L r u ∧ 0 < torusDist d L q.1 q.2 ∧
+ IsCriticalPoint d g q.1 ∧ IsCriticalPoint d g q.2 ∧
+ b - k * r ^ 3 < g q.1 ∧ g q.1 < b ∧ b - k * r ^ 3 < g q.2 ∧ g q.2 < b ∧
+ (torusDist d L q.1 (pinM d r u) < η ∨ torusDist d L q.1 (pinS d r u) < η)}
+
+/-- The scaled chart `x0 + r E0` read through the frame `R`: the image of a coordinate set
+`E0` (coordinates `p` with `p 0` axial) under `p ↦ x0 + r ∑ p_i R_i`. With `x0 = 0` these
+are the midpoint scaled coordinates `X = r(u, v)`, in which the pins are `(±1/2, 0)`; with
+`x0 = M` they are the endpoint chart `M + r(p, q)`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "Scaled coordinates are `X = r(u, v)` from the midpoint, so the pins are `(±1/2, 0)`."
+Interface: none.
+Does not claim: that the image lies in one fundamental domain (the sources take `r` small enough for the chart to embed in the torus). -/
+noncomputable def scaledAt (d : ℕ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (r : ℝ) (x0 : E d)
+ (E0 : Set (E d)) : Set (E d) :=
+ (fun p : E d => x0 + r • ∑ i, p i • R i) '' E0
+
+/-- The compact collar `C(eta, R)` in midpoint scaled coordinates: the ball of radius `R`
+(boundary included) with the two open balls of radius `eta` about the scaled pins
+`(-1/2, 0)` and `(1/2, 0)` removed.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80
+Anchor: "with the two open balls of radius `eta` about `(-1/2, 0)` and `(1/2, 0)` removed"
+Interface: none.
+Does not claim: anything beyond the definition; RECONCILIATION.md writes the same set `C_{η,R}` without defining it, and this definition is taken from the dimension-lift source. -/
+def collar (d : ℕ) [NeZero d] (η R0 : ℝ) : Set (E d) :=
+ {p : E d | ‖p‖ ≤ R0 ∧ η ≤ ‖p - EuclideanSpace.single (0 : Fin d) (-(1 : ℝ) / 2)‖ ∧
+ η ≤ ‖p - EuclideanSpace.single (0 : Fin d) ((1 : ℝ) / 2)‖}
+
+/-- The weight `omega_d(p, q) = max(|q|, r |p|)^(2-d)` of the endpoint chart, where `p` is
+the axial coordinate (`p 0`) and `q` the transverse part; `omega_2 = 1`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80
+Anchor: "omega_d(p, q) = max(|q|, r |p|)^(2-d)"
+Interface: none.
+Does not claim: integrability of the weight over the punctured ball (part of the Theorem P_d statement). -/
+noncomputable def omegaD (d : ℕ) [NeZero d] (r : ℝ) (p : E d) : ℝ :=
+ (max ‖p - EuclideanSpace.single (0 : Fin d) (p 0)‖ (r * |p 0|)) ^ ((2 : ℝ) - d)
+
+/-- `E_(Q_r^W) N_(r,j)(A)`: the expected index-`j` window count in `A` under the tilted law.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7
+Anchor: "E_(Q_r^W) N_(r,j)(E)"
+Interface: `I : PinnedLawInterface` supplies the sample paths and the tilted law; the Kac-Rice representation (12) of this expectation is NOT used.
+Does not claim: integrability of the count (if it is not integrable the Bochner integral is `0`). -/
+noncomputable def meanWindowCount (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (j : ℕ)
+ (A : Set (E d)) : ℝ :=
+ ∫ ω, (windowCount d (I.F ω) b k r j A : ℝ) ∂(I.QW r b k R)
+
+/-- `E_(Q_r^W) N_j(A)`: the expected index-`j` all-height count in `A` under the tilted law.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_annulus_bridge_20260925/PROOF.md sha256 d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05
+Anchor: "E_(Q_r^W) N_j(rE)"
+Interface: `I : PinnedLawInterface` supplies the sample paths and the tilted law; the weighted Kac-Rice intensity (16) is NOT used.
+Does not claim: integrability of the count. -/
+noncomputable def meanAllHeightCount (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (j : ℕ)
+ (A : Set (E d)) : ℝ :=
+ ∫ ω, (allHeightCount d (I.F ω) j A : ℝ) ∂(I.QW r b k R)
+
+/-! ### Fixed-remote Theorem A, displays (2) and (3) -/
+
+/-- Shape of Theorem A, display (2) (fixed-remote mean measure): for fixed `d ≥ 2`, `L > 0`,
+`0 < ρ < L/4`, compact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `kLo > 0`, there are
+`r_* > 0` and `C` (quantified OUTSIDE the universal quantifiers) such that for all
+`0 < r ≤ r_*`, `b ∈ B`, `k ∈ K`, frames `R`, indices `j ≤ d` and Borel `E ⊆ D_ρ`,
+`| 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
+`Lambda_j` is continuous on `D_ρ`, bounded above and away from zero uniformly on the
+compact parameter sets.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7
+Anchor: "| E_(Q_r^W) N_(r,j)(E)/(k r^3)"
+Interface: `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.
+Does 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). -/
+def FixedRemoteMeanMeasureA2 (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (ρ bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → 0 < ρ → ρ < L / 4 → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ C : ℝ,
+ (∃ cΛ : ℝ, 0 < cΛ ∧ ∃ CΛ : ℝ, ∀ j : ℕ, j ≤ d →
+ ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi, ∀ R : OrthonormalBasis (Fin d) ℝ (E d),
+ ContinuousOn (I.Λ j b k (R 0)) (remoteRegion d L ρ) ∧
+ ∀ x ∈ remoteRegion d L ρ, cΛ ≤ I.Λ j b k (R 0) x ∧ I.Λ j b k (R 0) x ≤ CΛ) ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ ∀ A : Set (E d), MeasurableSet A → A ⊆ remoteRegion d L ρ →
+ |meanWindowCount d L Ω I r b k R j A / (k * r ^ 3) - ∫ x in A, I.Λ j b k (R 0) x| ≤
+ C * r * (volume A).toReal
+
+/-- Shape of Theorem A, display (3) (fixed-remote count and event bounds): with the same
+fixed data and existential `r_* > 0`, `C`, for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K`, frames,
+indices and Borel `E ⊆ D_ρ`, `E_(Q_r^W) N_(r,j)(E) ≤ C k r^3 |E|` and
+`P_(Q_r^W){N_(r,j)(E) ≥ 1} ≤ C k r^3 |E|`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7
+Anchor: "E_(Q_r^W) N_(r,j)(E) <= C k r^3 |E|,"
+Interface: `I` is a given object as in `FixedRemoteMeanMeasureA2`.
+Does 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. -/
+def FixedRemoteCountBoundA3 (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (ρ bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → 0 < ρ → ρ < L / 4 → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∃ C : ℝ,
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ ∀ A : Set (E d), MeasurableSet A → A ⊆ remoteRegion d L ρ →
+ meanWindowCount d L Ω I r b k R j A ≤ C * k * r ^ 3 * (volume A).toReal ∧
+ ((I.QW r b k R) {ω | 1 ≤ windowCount d (I.F ω) b k r j A}).toReal ≤
+ C * k * r ^ 3 * (volume A).toReal
+
+/-! ### Fixed scaled annulus (d = 2): the height-window candidate (A2) and the all-height
+bridge (2) -/
+
+/-- Shape of the fixed-annulus height-window candidate statement (A2): `d = 2`, fixed `L > 0`,
+compact marks (`b ∈ [bLo, bHi]`, `0 < kLo ≤ k ≤ kHi`), fixed scaled annulus
+`K = {A0 ≤ |(u,t)| ≤ B0}` with `1 < A0 < B0`; there are `C, r_* > 0`, uniform in the frame,
+the marks, the Borel `E0 ⊆ K` and `j ∈ {0,1,2}`, such that
+`E_(Q_r^W) N_j(r E0) ≤ C k r^3 area(E0)` for `0 < r ≤ r_*`, where `N_j(r E0)` counts
+index-`j` critical points in `r E0` with height STRICTLY between `b - k r^3` and `b`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md sha256 1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b
+Anchor: "E_Qr^W N_j(r E0) <= C*k*r^3*area(E0),"
+Interface: `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.
+Does 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). -/
+def FixedAnnulusWindowCandidateA2 (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi A0 B0 : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi → 1 < A0 → A0 < B0 →
+ ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ ∀ E0 : Set (E 2), MeasurableSet E0 → E0 ⊆ {p : E 2 | A0 ≤ ‖p‖ ∧ ‖p‖ ≤ B0} →
+ meanWindowCount 2 L Ω I r b k R j (scaledAt 2 R r 0 E0) ≤
+ C * k * r ^ 3 * (volume E0).toReal
+
+/-- Shape of the all-height fixed-annulus bridge candidate statement, display (2): `d = 2`,
+fixed `L > 0`, compact marks, fixed scaled annulus `K_AB = {A ≤ |(u,v)| ≤ B}` with
+`1 < A < B`; there are `C, r_* > 0`, uniform in the marks, frames, Borel `E ⊆ K_AB` and
+`j ∈ {0,1,2}`, such that `E_(Q_r^W) N_j(rE) ≤ C r^3 area(E)` for `0 < r ≤ r_*`, where
+`N_j(rE)` counts index-`j` critical points in `rE` at ALL heights. The review interfaces
+R1-R7 of the source are the steps of its proof, not parts of this statement.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_annulus_bridge_20260925/PROOF.md sha256 d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05
+Anchor: "E_(Q_r^W) N_j(rE) <= C r^3 area(E), 0 0`, all frames and indices, existential constants) -/
+
+/-- Shape of row D5-a (P2, punctured pin disks): all heights; for Borel
+`E ⊂ {0 < p² + q² ≤ 1/16}` in the endpoint chart, `E_{Q_r^W} N_j(M + rE) ≤ C r³|E|`, and
+the same at `S`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "E_{Q_r^W} N_j(M + rE) ≤ C r³|E|"
+Interface: `I` is a given object; the chart `M + rE` is `scaledAt` based at the pin.
+Does 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. -/
+def D5aPuncturedPinDisks (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ ∀ E0 : Set (E 2), MeasurableSet E0 →
+ E0 ⊆ {p : E 2 | 0 < ‖p‖ ^ 2 ∧ ‖p‖ ^ 2 ≤ (1 : ℝ) / 16} →
+ meanAllHeightCount 2 L Ω I r b k R j (scaledAt 2 R r (pinM 2 r (R 0)) E0) ≤
+ C * r ^ 3 * (volume E0).toReal ∧
+ meanAllHeightCount 2 L Ω I r b k R j (scaledAt 2 R r (pinS 2 r (R 0)) E0) ≤
+ C * r ^ 3 * (volume E0).toReal
+
+/-- Shape of row D5-b (microdisk): all heights; for fixed `κ > 0`, the expected index-`j`
+count in the punctured disk of physical radius `κ r²` about each pin is `O(r⁵)`: there are
+`C, r_* > 0` with `E_{Q_r^W} N_j(disk) ≤ C r^5` for `0 < r ≤ r_*`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "the nested disks of radius `κr²` about each pin, for fixed `κ`: `O(r⁵)`"
+Interface: `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`.
+Does not claim: the P2 source or its nested-disk corollary; any numerical constant; uniformity in `κ`; nonauthor review or acceptance. -/
+def D5bMicrodisk (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∀ κ : ℝ, 0 < κ → ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ meanAllHeightCount 2 L Ω I r b k R j
+ {x : E 2 | 0 < ‖x - pinM 2 r (R 0)‖ ∧ ‖x - pinM 2 r (R 0)‖ ≤ κ * r ^ 2} ≤ C * r ^ 5 ∧
+ meanAllHeightCount 2 L Ω I r b k R j
+ {x : E 2 | 0 < ‖x - pinS 2 r (R 0)‖ ∧ ‖x - pinS 2 r (R 0)‖ ≤ κ * r ^ 2} ≤ C * r ^ 5
+
+/-- Shape of row D5-c (C1, compact collar): all heights; for fixed `R ≥ 1` and
+`0 < η ≤ 1/4`, for Borel `E ⊂ C_{η,R}` in midpoint scaled coordinates,
+`E_{Q_r^W} N_j(rE) ≤ C r³|E|`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "for Borel `E ⊂ C_{η,R}`, `η ≤ 1/4`, fixed `R ≥ 1`"
+Interface: `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).
+Does not claim: the C1 source (COLLAR_PROOF.md) or its proof; the normalizer (P14) it imports; any numerical constant; nonauthor review or acceptance. -/
+def D5cCollarC1 (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∀ η R0 : ℝ, 0 < η → η ≤ (1 : ℝ) / 4 → 1 ≤ R0 → ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ ∀ E0 : Set (E 2), MeasurableSet E0 → E0 ⊆ collar 2 η R0 →
+ meanAllHeightCount 2 L Ω I r b k R j (scaledAt 2 R r 0 E0) ≤
+ C * r ^ 3 * (volume E0).toReal
+
+/-- Shape of row D5-d (C2, the summed pin-neighbourhood bound): all heights; for fixed
+`R ≥ 1`, `E_{Q_r^W} N_j(r B_R ∖ {M,S}) ≤ C_R r³`, the scaled ball of radius `R` with the
+two pins removed.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "E_{Q_r^W} N_j(r B_R ∖ {M,S}) ≤ C_R r³"
+Interface: `I` is a given object.
+Does 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. -/
+def D5dSummedPinNeighbourhoodC2 (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∀ R0 : ℝ, 1 ≤ R0 → ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ meanAllHeightCount 2 L Ω I r b k R j (scaledAt 2 R r 0
+ {p : E 2 | ‖p‖ ≤ R0 ∧ p ≠ EuclideanSpace.single (0 : Fin 2) (-(1 : ℝ) / 2) ∧
+ p ≠ EuclideanSpace.single (0 : Fin 2) ((1 : ℝ) / 2)}) ≤ C * r ^ 3
+
+/-- Shape of row D5-e (I3/I4, intermediate shells): window `I_r`; the dyadic shells and
+`{A_0 r ≤ |X| ≤ ρ}` satisfy `E N ≤ C r³(A_0^{−2} + ρ²)`: there are `C, s_0 > 0` such that
+for `A_0 ≥ 4` and `A_0 r < ρ ≤ s_0` the expected index-`j` window count in
+`{A_0 r ≤ |X| ≤ ρ}` (distance from the midpoint) is at most `C r^3 (A_0^(-2) + ρ^2)`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "E N ≤ C r³(A_0^{−2} + ρ²)"
+Interface: `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.
+Does 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. -/
+def D5eIntermediateShellsI3I4 (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C s0 : ℝ, 0 < C ∧ 0 < s0 ∧
+ ∀ A0 ρ r : ℝ, 4 ≤ A0 → 0 < r → A0 * r < ρ → ρ ≤ s0 →
+ ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ meanWindowCount 2 L Ω I r b k R j {x : E 2 | A0 * r ≤ ‖x‖ ∧ ‖x‖ ≤ ρ} ≤
+ C * r ^ 3 * ((A0 ^ 2)⁻¹ + ρ ^ 2)
+
+/-- Shape of row D5-f (I5, global window first moment and planar event order): window
+`I_r`; `E_{Q_r^W} N_{r,j}(T² ∖ {M,S}) ≤ C r³`, and for the event `A_r` that some critical
+point other than `M, S` has height in `I_r`, `c r³ ≤ P(A_r) ≤ C r³` with `c > 0`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "E_{Q_r^W} N_{r,j}(T² ∖ {M,S}) ≤ C r³"
+Interface: `I` is a given object; `A_r` is the event `{N ≥ 1}` for the all-index torus-wide window count.
+Does 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. -/
+def D5fGlobalWindowFirstMomentI5 (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ (∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2), ∀ j : ℕ, j ≤ 2 →
+ meanWindowCount 2 L Ω I r b k R j (torusMinusPins 2 L r (R 0)) ≤ C * r ^ 3) ∧
+ (∃ c C rStar : ℝ, 0 < c ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2),
+ c * r ^ 3 ≤ ((I.QW r b k R) {ω | 1 ≤ torusWindowCount 2 L Ω I r b k R ω}).toReal ∧
+ ((I.QW r b k R) {ω | 1 ≤ torusWindowCount 2 L Ω I r b k R ω}).toReal ≤ C * r ^ 3)
+
+/-! ### The dimension lift: Theorems P_d, C_d, I_d, G_d (every fixed d ≥ 2) -/
+
+/-- Shape of Theorem P_d (all-height punctured pin ball), display (1.2): fixed `d ≥ 2`,
+`L > 0`, compact marks; there are `C, C', r_* > 0` such that for `0 < r ≤ r_*`, all `b, k, R, j`
+and every Borel `E ⊆ D = {0 < p² + |q|² ≤ 1/16}` in the endpoint chart,
+`E_(Q_r^W) N_j(M + r E) ≤ C r^3 ∫_E omega_d ≤ C' r^3`, and the same about `S`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80
+Anchor: "E_(Q_r^W) N_j(M + r E) <= C r^3 integral_E omega_d(p, q) dp dq <= C' r^3."
+Interface: `I` is a given object; the chart is `scaledAt` based at the pin; the weight is `omegaD`.
+Does 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. -/
+def DimensionLiftPuncturedPinBallP (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C C' rStar : ℝ, 0 < C ∧ 0 < C' ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ ∀ E0 : Set (E d), MeasurableSet E0 →
+ E0 ⊆ {p : E d | 0 < ‖p‖ ^ 2 ∧ ‖p‖ ^ 2 ≤ (1 : ℝ) / 16} →
+ (meanAllHeightCount d L Ω I r b k R j (scaledAt d R r (pinM d r (R 0)) E0) ≤
+ C * r ^ 3 * ∫ p in E0, omegaD d r p ∧
+ C * r ^ 3 * ∫ p in E0, omegaD d r p ≤ C' * r ^ 3) ∧
+ (meanAllHeightCount d L Ω I r b k R j (scaledAt d R r (pinS d r (R 0)) E0) ≤
+ C * r ^ 3 * ∫ p in E0, omegaD d r p ∧
+ C * r ^ 3 * ∫ p in E0, omegaD d r p ≤ C' * r ^ 3)
+
+/-- Shape of Theorem C_d (compact collar), display (1.3): fixed `d ≥ 2`, `L > 0`, compact
+marks, fixed `R ≥ 1` and `0 < η ≤ 1/4`; there are `C, r_* > 0` such that for every Borel
+`E ⊆ C(η, R)`, `E_(Q_r^W) N_j(r E) ≤ C r^3 |E|` for `0 < r ≤ r_*`, all `b, k, R, j`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80
+Anchor: "E_(Q_r^W) N_j(r E) <= C r^3 |E|."
+Interface: `I` is a given object; `C(η, R)` is `collar d η R`.
+Does 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. -/
+def DimensionLiftCompactCollarC (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∀ η R0 : ℝ, 0 < η → η ≤ (1 : ℝ) / 4 → 1 ≤ R0 → ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ ∀ E0 : Set (E d), MeasurableSet E0 → E0 ⊆ collar d η R0 →
+ meanAllHeightCount d L Ω I r b k R j (scaledAt d R r 0 E0) ≤
+ C * r ^ 3 * (volume E0).toReal
+
+/-- Shape of Theorem I_d (intermediate height-window shells), displays (1.5) and (1.6):
+there are `C, s_0 > 0` such that for `0 < r ≤ s/4` and `0 < s ≤ s_0`,
+`E_(Q_r^W) N_(r,j)({ s ≤ |X| ≤ 2 s }) ≤ C r^3 [ (r/s)^2 + s^2 ]`, and hence, uniformly for
+`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)`.
+`|X|` is the distance from the midpoint.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80
+Anchor: "E_(Q_r^W) N_(r,j)({ s <= |X| <= 2 s }) <= C r^3 [ (r/s)^2 + s^2 ],"
+Interface: `I` is a given object.
+Does 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. -/
+def DimensionLiftIntermediateShellsI (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C s0 : ℝ, 0 < C ∧ 0 < s0 ∧
+ (∀ r s : ℝ, 0 < r → r ≤ s / 4 → 0 < s → s ≤ s0 →
+ ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ meanWindowCount d L Ω I r b k R j {x : E d | s ≤ ‖x‖ ∧ ‖x‖ ≤ 2 * s} ≤
+ C * r ^ 3 * ((r / s) ^ 2 + s ^ 2)) ∧
+ (∀ A0 ρ r : ℝ, 4 ≤ A0 → 0 < r → A0 * r < ρ → ρ ≤ s0 →
+ ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ meanWindowCount d L Ω I r b k R j {x : E d | A0 * r ≤ ‖x‖ ∧ ‖x‖ ≤ ρ} ≤
+ C * r ^ 3 * ((A0 ^ 2)⁻¹ + ρ ^ 2))
+
+/-- Shape of Theorem G_d (global height-window first moment), display (1.7): fixed `d ≥ 2`,
+`L > 0`, compact marks; there are `C, r_* > 0` such that
+`E_(Q_r^W) N_(r,j)( X minus {M, S} ) ≤ C r^3` for `0 < r ≤ r_*`, all `b, k, R, j`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80
+Anchor: "E_(Q_r^W) N_(r,j)( X minus {M, S} ) <= C r^3."
+Interface: `I` is a given object.
+Does 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. -/
+def DimensionLiftGlobalWindowG (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C rStar : ℝ, 0 < C ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →
+ meanWindowCount d L Ω I r b k R j (torusMinusPins d L r (R 0)) ≤ C * r ^ 3
+
+/-! ### C6: Fourier cutoff (F4), Palm route (Theorem Q, Corollary Theta) -/
+
+/-- Shape of the planar Fourier-cutoff consequence (F4): in `d = 2`, GIVEN the
+dimension-matched first-moment hypothesis `G_2` (`E_(Q_r^W) N ≤ C r^3` for small `r`,
+uniformly in the marks and frames), there are `C` and `r_* > 0` such that
+`E_(Q_r^W) N(N-1) ≤ C r^3 log(1/r)` for `0 < r ≤ r_*`, all `b, k, R`. The source derives
+this from Theorem W with `p = 2`; the hypothesis `G_2` is stated as a hypothesis here, not
+discharged.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_fourier_cutoff_20260929/PROOF.md sha256 c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733
+Anchor: "E_Qr^W N(N-1) <= C r^3 log(1/r),"
+Interface: `I` is a given object; `N` is `torusWindowCount`; `(N)_2 = N(N-1)` is `Nat.descFactorial N 2`.
+Does 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. -/
+def FourierCutoffPlanarSecondFactorialF4 (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface 2 L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ (∃ C0 r0 : ℝ, 0 < r0 ∧
+ ∀ r : ℝ, 0 < r → r ≤ r0 → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2),
+ ∫ ω, (torusWindowCount 2 L Ω I r b k R ω : ℝ) ∂(I.QW r b k R) ≤ C0 * r ^ 3) →
+ ∃ C rStar : ℝ, 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin 2) ℝ (E 2),
+ ∫ ω, (Nat.descFactorial (torusWindowCount 2 L Ω I r b k R ω) 2 : ℝ) ∂(I.QW r b k R) ≤
+ C * r ^ 3 * Real.log (1 / r)
+
+/-- Shape of Theorem Q (Palm route, factorial moments in every fixed dimension): fixed
+`d ≥ 2`, `L > 0`, compact marks; for every fixed integer `q ≥ 2` there are `C_q, r_* > 0`
+such that `E_(Q_r^W)[ (N)_q ] ≤ C_q r^3` for `0 < r ≤ r_*`, all `b, k, R`. The radius
+threshold is allowed to depend on `q` (the source's quantifier order is "There are
+`C_q, r_* > 0` such that for `0 < r ≤ r_*`, all `b, k, R` and every fixed integer `q ≥ 2`";
+the weaker reading with `r_*` after `q` is stated).
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b
+Anchor: "E_(Q_r^W)[ (N)_q ] <= C_q r^3."
+Interface: `I` is a given object; `N` is `torusWindowCount`; `(N)_q` is `Nat.descFactorial N q`.
+Does 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. -/
+def PalmRouteFactorialMomentsQ (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∀ q : ℕ, 2 ≤ q → ∃ Cq rStar : ℝ, 0 < Cq ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d),
+ ∫ ω, (Nat.descFactorial (torusWindowCount d L Ω I r b k R ω) q : ℝ) ∂(I.QW r b k R) ≤
+ Cq * r ^ 3
+
+/-- Shape of Corollary Theta (the C6 order is `r^3`): in every fixed `d ≥ 2`, there are
+`c > 0`, `C` and `r_* > 0` such that `c r^3 ≤ E_(Q_r^W)[ N(N-1) ] ≤ C r^3` and
+`c r^3 ≤ Q_r^W{ N ≥ 2 } ≤ C r^3` for `0 < r ≤ r_*`, all `b, k, R`.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b
+Anchor: "c r^3 <= E_(Q_r^W)[ N(N-1) ] <= C r^3,"
+Interface: `I` is a given object; `N` is `torusWindowCount`.
+Does 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. -/
+def PalmRouteSecondFactorialTheta (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ c C rStar : ℝ, 0 < c ∧ 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d),
+ c * r ^ 3 ≤
+ ∫ ω, (Nat.descFactorial (torusWindowCount d L Ω I r b k R ω) 2 : ℝ) ∂(I.QW r b k R) ∧
+ ∫ ω, (Nat.descFactorial (torusWindowCount d L Ω I r b k R ω) 2 : ℝ) ∂(I.QW r b k R) ≤
+ C * r ^ 3 ∧
+ c * r ^ 3 ≤ ((I.QW r b k R) {ω | 2 ≤ torusWindowCount d L Ω I r b k R ω}).toReal ∧
+ ((I.QW r b k R) {ω | 2 ≤ torusWindowCount d L Ω I r b k R ω}).toReal ≤ C * r ^ 3
+
+/-! ### C6 rare-cluster consequences: Theorem O (abstract, on laws on ℕ) -/
+
+/-- Total-variation distance between two probability mass functions on `ℕ`: half the `l^1`
+distance (the source's convention; equal to the supremum over events for probability laws).
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_rare_cluster_laws_20260929/PROOF.md sha256 c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb
+Anchor: "For probability laws, dTV is the supremum over measurable events, equivalently half the l1 distance on this countable state space."
+Interface: none; if the `l^1` series is not summable the `tsum` is `0`.
+Does not claim: equality with the event supremum (true for probability laws, not stated). -/
+noncomputable def pmfTV (μ ν : ℕ → ℝ) : ℝ :=
+ (1 / 2) * ∑' n : ℕ, |μ n - ν n|
+
+/-- The Poisson probability mass function `Pois(lam)(n) = exp(-lam) lam^n / n!`
+(for `lam ≥ 0`; `Pois(0) = δ_0`).
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_rare_cluster_laws_20260929/PROOF.md sha256 c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb
+Anchor: "dTV(Law N, Pois(lambda))"
+Interface: none; an explicit formula (the source's `Pois(lambda)`).
+Does not claim: that it sums to one (true for `lam ≥ 0`, not stated). -/
+noncomputable def poissonPMF (lam : ℝ) (n : ℕ) : ℝ :=
+ Real.exp (-lam) * lam ^ n / (Nat.factorial n : ℝ)
+
+/-- Shape of Theorem O (sharp ordinary-Poisson obstruction): for a family of laws
+`μ_r` on `ℕ` (the law of the window count `N_r`) which, for all sufficiently small `r`
+(that is, for `0 < r ≤ r_0` for some `r_0 > 0`), are probability mass functions with
+summable mean satisfying only (H1) `E N_r ≤ A r^3` and (H2) `P(N_r ≥ 2) ≥ a r^3` with
+`a > 0`: then, for all sufficiently small `r`,
+`(a/2) r^3 ≤ inf_{lambda ≥ 0} dTV(Law N_r, Pois(lambda)) ≤ A r^3`: every nonnegative
+intensity is at distance at least `(a/2) r^3`, and some intensity is within `A r^3`. The
+hypotheses are imposed only on `0 < r ≤ r_0`, as in the source ("for all sufficiently small
+r"); imposing (H2) for every `r > 0` would be unsatisfiable (`a r^3 ≤ 1` fails for large
+`r`) and would make the statement hold for every family. The source's remark that the
+premises imply `2a ≤ A` is not taken as a hypothesis.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_rare_cluster_laws_20260929/PROOF.md sha256 c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb
+Anchor: "(a/2) r^3 <= inf_{lambda>=0} dTV(Law N, Pois(lambda)) <= A r^3."
+Interface: 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).
+Does 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) uses Pois(0)=delta_0 and dTV(Law N,delta_0)=p); nonauthor review or acceptance. -/
+def RareClusterPoissonObstructionO (μ : ℝ → ℕ → ℝ) (a A : ℝ) : Prop :=
+ 0 < a →
+ (∃ r0 : ℝ, 0 < r0 ∧ ∀ r : ℝ, 0 < r → r ≤ r0 →
+ (∀ n : ℕ, 0 ≤ μ r n) ∧ Summable (μ r) ∧ ∑' n : ℕ, μ r n = 1 ∧
+ Summable (fun n : ℕ => (n : ℝ) * μ r n) ∧ ∑' n : ℕ, (n : ℝ) * μ r n ≤ A * r ^ 3 ∧
+ a * r ^ 3 ≤ 1 - μ r 0 - μ r 1) →
+ ∃ rStar : ℝ, 0 < rStar ∧ ∀ r : ℝ, 0 < r → r ≤ rStar →
+ (∀ lam : ℝ, 0 ≤ lam → (a / 2) * r ^ 3 ≤ pmfTV (μ r) (poissonPMF lam)) ∧
+ (∃ lam : ℝ, 0 ≤ lam ∧ pmfTV (μ r) (poissonPMF lam) ≤ A * r ^ 3)
+
+/-! ### Remote collision (Corollary D) and the OPEN witness-collision target -/
+
+/-- Shape of Corollary D (second factorial moment in the fixed remote region): fixed `d ≥ 2`,
+`L > 0`, `0 < ρ < L/4`, compact marks; there are `C` and `r_* > 0` such that for
+`0 < r ≤ r_*`, all marks and frames and every Borel `E ⊆ D_ρ`,
+`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(E) = sum_j N_j(E)` is the sum of the index-`j` window counts in `E`
+(`windowCountIndexSum`, the source's definition). Pairs at every mutual separation inside
+`D_ρ`, down to coincidence, are included.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/remote_collision_20260928/PROOF.md sha256 b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2
+Anchor: "E_(Q_r^W) N(E)(N(E)-1) <= C r^5 |E|,"
+Interface: `I` is a given object; the pair Kac-Rice formula (3.1) and the divided-difference coordinates (4.1) are not transcribed.
+Does 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. -/
+def RemoteCollisionSecondFactorialD (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (ρ bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → 0 < ρ → ρ < L / 4 → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C rStar : ℝ, 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d),
+ ∀ A : Set (E d), MeasurableSet A → A ⊆ remoteRegion d L ρ →
+ ∫ ω, (Nat.descFactorial (windowCountIndexSum d (I.F ω) b k r A) 2 : ℝ) ∂(I.QW r b k R) ≤
+ C * r ^ 5 * (volume A).toReal ∧
+ ((I.QW r b k R) {ω | 2 ≤ windowCountIndexSum d (I.F ω) b k r A}).toReal ≤
+ C * r ^ 5 * (volume A).toReal
+
+/-- OPEN OBLIGATION, stated as a TARGET and not as a result. GRAPH node
+`math.rn-region.witness-collision` (classification OPEN_ACTIVE, catalog C6): the regional
+shrinking pin/witness-collision mechanism. The reconciliation describes what is missing as
+a torus-wide second factorial moment of the window count "with pairs where at least one
+witness is within fixed `η` of a pin", at every mutual separation (the fixed-remote `P_η`
+of Corollary D covers only pairs with both witnesses at distance `≥ η` from the pins). The
+Prop below is that target: fixed `d ≥ 2`, `L > 0`, `η > 0`, compact marks; there are `C` and
+`r_* > 0` with `E_(Q_r^W) #{ordered window pairs with the first witness within η of a pin} ≤ C r^3`
+for `0 < r ≤ r_*`, all `b, k, R`. No source in this packet establishes it; its register
+status is OPEN and this declaration does not change that.
+
+Scope note (statement-shape review 5483861746 on Math- PR #419, 2026-10-11, AMEND_SCOPE_NOTE;
+nothing below changes the Prop): (i) the source's §5 states its open obligation for the planar
+case and makes no claim for `d > 2`; the formal target quantifies every `d ≥ 2`, so its instances
+with `d > 2` are a proposed generalisation carried by this packet, not a transcription of the
+source's scope. (ii) `nearPinPairCount` counts ordered pairs whose FIRST witness is within `η` of
+a pin; the source's "at least one witness" set is the union of that set with its swap, so (in the
+finite case) it has between one and two times as many elements, and a bound `C r^3` here is a
+bound `2 C r^3` for the source's count: the orders agree, the functionals do not literally
+coincide. (iii) `Set.ncard` is `0` on an infinite set and `PinnedLawInterface` supplies neither
+almost-sure finiteness nor measurability of the pair population, so an infinite population would
+make the integrand vanish spuriously; reading this Prop as the source's second factorial moment
+needs those two facts about the law, which the interface does not provide and this Prop does not
+assume. The weighted law `I.QW` is a given field, not the source's six-pin regression.
+
+Source: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432
+Anchor: "A torus-wide second factorial moment `E_{Q_r^W} N(N−1)` for the window count, with pairs where at least"
+Interface: `I` is a given object; the pair count is `nearPinPairCount`.
+Does 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. -/
+def WitnessCollisionNearPinPairsTarget (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]
+ (I : PinnedLawInterface d L Ω) (η bLo bHi kLo kHi : ℝ) : Prop :=
+ 2 ≤ d → 0 < L → 0 < η → bLo ≤ bHi → 0 < kLo → kLo ≤ kHi →
+ ∃ C rStar : ℝ, 0 < rStar ∧
+ ∀ r : ℝ, 0 < r → r ≤ rStar → ∀ b ∈ Set.Icc bLo bHi, ∀ k ∈ Set.Icc kLo kHi,
+ ∀ R : OrthonormalBasis (Fin d) ℝ (E d),
+ ∫ ω, (nearPinPairCount d L (I.F ω) b k r η (R 0) : ℝ) ∂(I.QW r b k R) ≤ C * r ^ 3
+
+end UniversalLaw.Spec.RN
diff --git a/cbz/evidence/website-foundation-20261029/sources/alignment/SIDE24_EXACT_ENCLOSURE.lean b/cbz/evidence/website-foundation-20261029/sources/alignment/SIDE24_EXACT_ENCLOSURE.lean
new file mode 100644
index 000000000..cf461df95
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/alignment/SIDE24_EXACT_ENCLOSURE.lean
@@ -0,0 +1,1014 @@
+import Mathlib
+
+/-!
+# SIDE24 coefficient in dimensions two and three (statements only)
+
+Scientific effect: NONE. Formal progress of every declaration here: `specified`.
+Organizational-independence credit of this transcription: 0 (Anthropic / Claude).
+
+This module transcribes, as definitions, interface structures and `Prop`-valued
+specifications, the displayed statements of the Layer 0 note
+`coefficients/side24_v1/PROOF.md` (object SIDE24-COEFFICIENT-D23-20260924-v1) and of its
+`ENCLOSURE.json`: the exact cone moments `D_1 = 4/3` and `D_2 = 29/6 - sqrt 6`, the
+reference coefficient `c_{d,ref}` of display (1), the image constant `E` of display (2), the
+relative covariance allowance `epsilon = 10^(-108)` of display (3), the twenty-digit
+published endpoints, the headline two-dimensional and three-dimensional enclosures, the
+reference comparison (4), the Section 2 derivative and lattice-image bounds, the Section 3
+joint-covariance ordering in the positive-semidefinite order, the Section 4 Gaussian density
+comparison and integrand-ratio bounds, and the Section 1 cone-moment identities with the
+Gaussian laws of the displayed variances `8/3`, `5/3`, `1`.
+
+The exact periodic coefficient `c_{d,24}` is "precisely its equation (15.2)" of the parent
+(UNIFORM-MATRIX-CAP-LIFETIME-20260924-v1); that formula involves the Gaussian cone expectation
+`D_u` of (15.1), which this module cannot write without a conditional-Gaussian construction.
+The coefficient is therefore an INTERFACE parameter (`PeriodicCoefficientInterface`): its
+defining property (15.2) is a hypothesis field, the cone moment `D_u` is a given field, and the
+densities and the conditional variance are pinned to derivatives of `K_24` by hypothesis fields.
+
+What this module does not establish. It consists only of definitions and structures; it
+states nothing as a result and proves nothing. It does not enclose the coefficient, does not
+evaluate `Gamma(7/6)`, does not prove any of the displayed inequalities, does not identify an
+object satisfying an interface here with the object of the source, and does not touch the
+parent's results. The Section 5 Stirling/`Gamma(7/6)` remainder procedure is described in the
+source as a method, not displayed as a precise statement, and is NOT specified here. The
+arithmetic skeleton of these displays (pairing counts, the image constant, `60E < epsilon`,
+odd-block minors, exponent inequalities, the `D_2` algebra, endpoint adjacency) is already
+kernel-checked on main as the 31 `UniversalLaw.Side24` targets of `formal/` at origin/main
+`f6deeba7`; nothing here re-proves it and nothing here encloses the coefficient. Nothing here
+promotes, reclassifies or discharges any claim, premise or obligation of the registers;
+alignment of these statements with the source is PENDING_INDEPENDENT_REVIEW.
+
+Primary sources (Layer 0, byte-pinned): `d6g8k5htny-coder/Math-` commit
+`760340e921ac4ceda296b8118da936f1133e956e`, paths `coefficients/side24_v1/PROOF.md`
+(sha256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`, source id
+`side24-proof`) and `coefficients/side24_v1/ENCLOSURE.json` (sha256
+`72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811`, source id
+`side24-enclosure`). Parent clause (15.2) quoted from source id `lifetime-parent`.
+-/
+
+namespace UniversalLaw.Spec.Side24
+
+open MeasureTheory
+
+/-- The ambient Euclidean space `R^d` of the field; `d ∈ {2, 3}` in the source.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Use its centered variance-one field with the exact normalized covariance"
+Interface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.
+Does not claim: anything about the field or the torus `R^d/(24 Z^d)`. -/
+abbrev E (d : ℕ) : Type := EuclideanSpace ℝ (Fin d)
+
+/-! ## Exact constants of the note -/
+
+/-- The cone moment `D_1 = 4/3` of the reference law for `m = d - 1 = 1`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "D_1=E[A^2 1{A<0}]=4/3."
+Interface: none; a rational constant.
+Does 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. -/
+noncomputable def coneMomentD1 : ℝ := 4 / 3
+
+/-- The cone moment `D_2 = 29/6 - sqrt 6` of the reference law for `m = d - 1 = 2`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: " = 29/6-sqrt(6)."
+Interface: none; an explicit real constant.
+Does 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. -/
+noncomputable def coneMomentD2 : ℝ := 29 / 6 - Real.sqrt 6
+
+/-- The reference cone moment `D_m` as a function of `m = d - 1`: `D_1` for `m = 1`, `D_2` for
+`m = 2`, and `0` (unspecified by the source) otherwise.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "c_d,ref = Gamma(7/6)*(3/2)^(1/3)*D_(d-1)"
+Interface: none.
+Does not claim: any value outside `m ∈ {1, 2}`; the value `0` there is a placeholder, not a cone moment. -/
+noncomputable def coneMomentRef (m : ℕ) : ℝ :=
+ if m = 1 then coneMomentD1 else if m = 2 then coneMomentD2 else 0
+
+/-- The nonperiodic reference coefficient of display (1):
+`c_{d,ref} = Gamma(7/6) (3/2)^(1/3) D_{d-1} / [2 sqrt 3 pi^(d-1) sqrt pi]`, `d = 2, 3`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "/ [2sqrt(3)*pi^(d-1)*sqrt(pi)], d=2,3."
+Interface: none; `Real.Gamma`, `Real.sqrt`, `Real.pi` and real powers are Mathlib's.
+Does 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)`. -/
+noncomputable def cRef (d : ℕ) : ℝ :=
+ Real.Gamma (7 / 6) * (3 / 2 : ℝ) ^ ((1 : ℝ) / 3) * coneMomentRef (d - 1) /
+ (2 * Real.sqrt 3 * Real.pi ^ (d - 1) * Real.sqrt Real.pi)
+
+/-- The image constant `E = 21175738586478 * 10^(-125)` of display (2), as a rational over a
+power of ten.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "= 21175738586478 *10^(-125)."
+Interface: none.
+Does not claim: the factorisation `1458*(76*24^6+15) = 21175738586478`, kernel-checked on main (`UniversalLaw.Side24.image_constant_value`), not here. -/
+noncomputable def imageConstE : ℝ := 21175738586478 / 10 ^ 125
+
+/-- The relative covariance allowance `epsilon = 10^(-108)` of display (3).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "epsilon=10^(-108), since60E Real.exp (-(‖z + latticeVec d n‖ ^ 2) / 2))
+
+/-! ## Section 2: the uniform derivative bound and the lattice-image bound -/
+
+/-- A tuple of `q` unit directions in `R^d` (the "unit directional differentiations", mixed
+directions allowed).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "For q<=6 unit directional differentiations of phi(x)=exp(-|x|^2/2), product-rule"
+Interface: none.
+Does not claim: anything. -/
+def IsUnitTuple (d q : ℕ) (u : Fin q → E d) : Prop :=
+ ∀ i, ‖u i‖ = 1
+
+/-- The product-rule pairing sum `sum_{j=0}^{floor(q/2)} q! r^(q-2j) / [2^j j! (q-2j)!]`
+evaluated at `r = |x|`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "q! |x|^(q-2j) / [2^j j! (q-2j)!]."
+Interface: none.
+Does not claim: that the sum of the coefficients at `q = 6` is `76` (kernel-checked on main, `UniversalLaw.Side24.pairing_sum_six`), nor the bound itself (`DerivativePairingBound`). -/
+noncomputable def pairingSum (q : ℕ) (r : ℝ) : ℝ :=
+ ∑ j ∈ Finset.range (q / 2 + 1),
+ (Nat.factorial q : ℝ) * r ^ (q - 2 * j) /
+ ((2 : ℝ) ^ j * (Nat.factorial j : ℝ) * (Nat.factorial (q - 2 * j) : ℝ))
+
+/-- Section 2, first display: for `q ≤ 6` and unit directions, the absolute `q`-th directional
+derivative of `phi(x) = exp(-|x|^2/2)` is at most `exp(-|x|^2/2)` times the pairing sum.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "pairings bound the absolute derivative by"
+Interface: none; the derivative is Mathlib's `iteratedFDeriv ℝ q` applied to the direction tuple.
+Does not claim: the bound (statement only); validity for `q > 6` (the source restricts to `q ≤ 6`); nothing here encloses the coefficient. -/
+def DerivativePairingBound : Prop :=
+ ∀ (d q : ℕ), q ≤ 6 → ∀ (x : E d) (u : Fin q → E d), IsUnitTuple d q u →
+ |iteratedFDeriv ℝ q (Kinf d) x u| ≤ Real.exp (-(‖x‖ ^ 2) / 2) * pairingSum q ‖x‖
+
+/-- Section 2: at `|x| ≥ 1` every unit-direction contraction of order `q ≤ 6` of
+`phi(x) = exp(-|x|^2/2)` is bounded by `76 |x|^6 exp(-|x|^2/2)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "At |x|>=1 this is at most76 |x|^6 e^(-|x|^2/2)."
+Interface: none.
+Does 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 coefficient. -/
+def DerivativeBoundAtLeastOne : Prop :=
+ ∀ (d q : ℕ), q ≤ 6 → ∀ (x : E d), 1 ≤ ‖x‖ → ∀ (u : Fin q → E d), IsUnitTuple d q u →
+ |iteratedFDeriv ℝ q (Kinf d) x u| ≤ 76 * ‖x‖ ^ 6 * Real.exp (-(‖x‖ ^ 2) / 2)
+
+/-- Section 2: at zero every unit-direction contraction of order `q ≤ 6` of `phi` has absolute
+value at most `15`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "contraction has absolute value at most15."
+Interface: none.
+Does not claim: the bound (statement only); `5!! = 15` is kernel-checked on main (`UniversalLaw.Side24.sixth_moment_double_factorial`), not here. -/
+def DerivativeBoundAtZero : Prop :=
+ ∀ (d q : ℕ), q ≤ 6 → ∀ (u : Fin q → E d), IsUnitTuple d q u →
+ |iteratedFDeriv ℝ q (Kinf d) 0 u| ≤ 15
+
+/-- The squared Euclidean length `|n|^2 = sum_i n_i^2` of an integer point.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "sum_{n!=0} |n|^6 e^(-288|n|^2)"
+Interface: none.
+Does not claim: anything. -/
+noncomputable def intNormSq (d : ℕ) (n : Fin d → ℤ) : ℝ :=
+ ∑ i, ((n i : ℤ) : ℝ) ^ 2
+
+/-- The lattice-image term `|n|^6 exp(-288 |n|^2)` for `n ≠ 0`, and `0` at `n = 0`
+(`288 = 24^2/2`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "sum_{n!=0} |n|^6 e^(-288|n|^2)"
+Interface: none.
+Does not claim: `24^2/2 = 288`, kernel-checked on main (`UniversalLaw.Side24.period_exponent`), not here. -/
+noncomputable def imageTerm (d : ℕ) (n : Fin d → ℤ) : ℝ :=
+ if n = 0 then 0 else intNormSq d n ^ 3 * Real.exp (-288 * intNormSq d n)
+
+/-- Section 2 lattice bound: for `d ≤ 3`, the image family is summable and
+`sum_{n ≠ 0} |n|^6 exp(-288|n|^2) ≤ 1458 exp(-288)`. Summability is stated so the `tsum` is
+not the vacuous `0`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "<=1458 e^(-288)."
+Interface: none.
+Does 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_constant`), not here. -/
+def LatticeImageSumBound : Prop :=
+ ∀ d : ℕ, d ≤ 3 →
+ Summable (fun n : Fin d → ℤ => imageTerm d n) ∧
+ (∑' n : Fin d → ℤ, imageTerm d n) ≤ 1458 * Real.exp (-288)
+
+/-- Section 2: successive terms `j^9 exp(-288 j^2)`, `j ≥ 1`, have ratio at most
+`512 exp(-864)`, and that constant is below `1/2`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "successive terms have ratio at most512e^(-864)<1/2."
+Interface: none.
+Does not claim: the bounds (statement only); `2^9 = 512`, `288*3 = 864` are kernel-checked on main (`UniversalLaw.Side24.geometric_ratio_constants`), not here. -/
+def SuccessiveTermRatio : Prop :=
+ (∀ j : ℕ, 1 ≤ j →
+ ((j : ℝ) + 1) ^ 9 * Real.exp (-288 * ((j : ℝ) + 1) ^ 2) ≤
+ 512 * Real.exp (-864) * ((j : ℝ) ^ 9 * Real.exp (-288 * (j : ℝ) ^ 2))) ∧
+ 512 * Real.exp (-864) < 1 / 2
+
+/-- Section 2 exponential facts: `exp(288/125) > 10`, hence `exp(-288) < 10^(-125)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "hence e^(-288)<10^(-125) and the geometric-ratio inequality follows too."
+Interface: none; `Real.exp` is Mathlib's.
+Does 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 in `Ledger.lean`), not here. -/
+def ExponentialBounds : Prop :=
+ 10 < Real.exp (288 / 125) ∧ Real.exp (-288) < 1 / 10 ^ 125
+
+/-- Display (2): for `d ∈ {2, 3}`, every unit-direction contraction through total order `6`,
+mixed directions included, satisfies `|D^q K_24(0) - D^q K_infty(0)| < E`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "|D^q K_24(0)-D^q K_infty(0)|"
+Interface: summability of the theta family is the premise `ThetaSummable d`; derivatives are Mathlib's `iteratedFDeriv ℝ q`.
+Does 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 coefficient; nonauthor review or acceptance. -/
+def ImageBound : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → ThetaSummable d →
+ ∀ q : ℕ, q ≤ 6 → ∀ u : Fin q → E d, IsUnitTuple d q u →
+ |iteratedFDeriv ℝ q (K24 d) 0 u - iteratedFDeriv ℝ q (Kinf d) 0 u| < imageConstE
+
+/-! ## Section 3: the joint covariance of `(G, t, svec H)` in a frame -/
+
+/-- Index set of the `svec` coordinates: ordered pairs `(i, j)` with `i ≤ j`, of cardinality
+`d(d+1)/2` (`3` for `d = 2`, `6` for `d = 3`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Use the joint vector (G,t,svec H), where svec lists diagonal Hessian entries and"
+Interface: none.
+Does not claim: anything. -/
+abbrev SymIndex (d : ℕ) : Type := {p : Fin d × Fin d // p.1 ≤ p.2}
+
+/-- Index set of the joint vector `(G, t, svec H)`: `d` gradient coordinates, one third
+derivative `t`, and `d(d+1)/2` `svec` coordinates; dimension `6` for `d = 2` and `10` for `d = 3`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "sqrt(2) times independent off-diagonal entries. Its dimension is at most10."
+Interface: none.
+Does not claim: the dimension count `6`, `10`, kernel-checked on main (`UniversalLaw.Side24.pin_determinant_and_joint_dimension`), not here. -/
+abbrev JointIndex (d : ℕ) : Type := Fin d ⊕ Unit ⊕ SymIndex d
+
+/-- The list of differentiation directions attached to a joint coordinate, in the orthonormal
+frame `R` with `u = R 0`: `G_i = ∂_{R i} f`, `t = ∂_u^3 f`, `H_{ij} = ∂_{R i} ∂_{R j} f`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Use the joint vector (G,t,svec H), where svec lists diagonal Hessian entries and"
+Interface: none.
+Does not claim: anything. -/
+def jetDirs (d : ℕ) (u : E d) (R : Fin d → E d) : JointIndex d → List (E d)
+ | Sum.inl i => [R i]
+ | Sum.inr (Sum.inl _) => [u, u, u]
+ | Sum.inr (Sum.inr p) => [R p.1.1, R p.1.2]
+
+/-- The `svec` scaling: `1` on gradient, `t` and diagonal Hessian coordinates, `sqrt 2` on
+off-diagonal Hessian coordinates.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "sqrt(2) times independent off-diagonal entries. Its dimension is at most10."
+Interface: none.
+Does not claim: anything. -/
+noncomputable def svecScale (d : ℕ) : JointIndex d → ℝ
+ | Sum.inr (Sum.inr p) => if p.1.1 = p.1.2 then 1 else Real.sqrt 2
+ | _ => 1
+
+/-- The derivative of `K` at `x` contracted against a list of directions:
+`D^{|l|} K(x)[l_1, …, l_{|l|}]`, through Mathlib's `iteratedFDeriv`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Each covariance entry differs from the reference by at most2E, by (2)."
+Interface: none.
+Does not claim: differentiability of `K` (if absent the derivative is `0` in Lean). -/
+noncomputable def derivContraction (d : ℕ) (K : E d → ℝ) (x : E d) (l : List (E d)) : ℝ :=
+ iteratedFDeriv ℝ l.length K x (fun i => l.get i)
+
+/-- The joint covariance matrix of `(G, t, svec H)` at a point of a centred stationary field
+with covariance `K`, in the frame `R` with `u = R 0`, through the stationary rule
+`Cov(∂^α f, ∂^β f) = (-1)^{|β|} ∂^{α+β} K(0)`, with the `svec` scaling. With `K = K_infty`
+this is `C_ref`; with `K = K_24` it is `C_24`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Each covariance entry differs from the reference by at most2E, by (2)."
+Interface: none; the covariance is DEFINED by the derivative rule, no field is constructed.
+Does not claim: that this matrix is the covariance of any random vector (no field is constructed here); symmetry or positive semidefiniteness of the matrix. -/
+noncomputable def jointCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) :
+ Matrix (JointIndex d) (JointIndex d) ℝ :=
+ Matrix.of fun a b =>
+ svecScale d a * svecScale d b * (-1 : ℝ) ^ (jetDirs d u R b).length *
+ derivContraction d K 0 (jetDirs d u R a ++ jetDirs d u R b)
+
+/-- The gradient covariance block `Cov(G_i, G_j) = -∂_{R i} ∂_{R j} K(0)` in the frame `R`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "covariance differentiation gives"
+Interface: none.
+Does not claim: that it equals the identity for `K_infty` (that is `ReferenceOddAndPinBlocks`). -/
+noncomputable def gradCov (d : ℕ) (K : E d → ℝ) (R : Fin d → E d) : Matrix (Fin d) (Fin d) ℝ :=
+ Matrix.of fun i j => - derivContraction d K 0 [R i, R j]
+
+/-- The pin covariance block of `V = H u`, coordinates `V_i = ∂_u ∂_{R i} f`:
+`Cov(V_i, V_j) = ∂_u ∂_{R i} ∂_u ∂_{R j} K(0)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Thus V=Hu has covariance diag(3,1,...,1), tau^2=Var(t|G=0)=6, and"
+Interface: none.
+Does not claim: that it equals `diag(3,1,...,1)` for `K_infty` (that is `ReferenceOddAndPinBlocks`). -/
+noncomputable def pinCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) :
+ Matrix (Fin d) (Fin d) ℝ :=
+ Matrix.of fun i j => derivContraction d K 0 [u, R i, u, R j]
+
+/-- The covariance vector `Cov(t, G_j) = -∂_u^3 ∂_{R j} K(0)` of `t = ∂_u^3 f` with the gradient.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Var(t)=15, Cov(t,G)=(-3,0,...,0),"
+Interface: none.
+Does not claim: its reference value `(-3, 0, …, 0)` (that is `ReferenceOddAndPinBlocks`). -/
+noncomputable def thirdGradCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) : Fin d → ℝ :=
+ fun j => - derivContraction d K 0 [u, u, u, R j]
+
+/-- The variance `Var(t) = -∂_u^6 K(0)` of `t = ∂_u^3 f`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Var(t)=15, Cov(t,G)=(-3,0,...,0),"
+Interface: none.
+Does not claim: its reference value `15` (that is `ReferenceOddAndPinBlocks`). -/
+noncomputable def thirdVar (d : ℕ) (K : E d → ℝ) (u : E d) : ℝ :=
+ - derivContraction d K 0 [u, u, u, u, u, u]
+
+/-- The conditional variance `tau^2 = Var(t | G = 0)` as the Schur complement
+`Var(t) - Cov(t,G) Cov(G)^(-1) Cov(G,t)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "tau^2=Var(t|G=0)=6"
+Interface: none; the Gaussian conditional variance is written as the Schur complement (a standard identity, used here as the definition).
+Does not claim: invertibility of `Cov(G)` (Mathlib's matrix inverse is `0` on a singular matrix); the value `6` (that is `ReferenceOddAndPinBlocks`). -/
+noncomputable def condThirdVariance (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) : ℝ :=
+ thirdVar d K u -
+ dotProduct (thirdGradCov d K u R) (Matrix.mulVec (gradCov d K R)⁻¹ (thirdGradCov d K u R))
+
+/-- The reference joint covariance `C_ref` (kernel `K_infty`) in the frame `R`, `u = R 0`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "(1-epsilon) C_ref <= C_24 <= (1+epsilon) C_ref,"
+Interface: none.
+Does not claim: its displayed block values (`ReferenceOddAndPinBlocks`), or that it is frame independent. -/
+noncomputable def Cref (d : ℕ) (u : E d) (R : Fin d → E d) :
+ Matrix (JointIndex d) (JointIndex d) ℝ :=
+ jointCov d (Kinf d) u R
+
+/-- The exact periodic joint covariance `C_24` (kernel `K_24`) in the frame `R`, `u = R 0`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "(1-epsilon) C_ref <= C_24 <= (1+epsilon) C_ref,"
+Interface: summability of the theta family is a premise wherever this matrix is used.
+Does not claim: rotational invariance (the source asserts none for `C_24`). -/
+noncomputable def C24 (d : ℕ) (u : E d) (R : Fin d → E d) :
+ Matrix (JointIndex d) (JointIndex d) ℝ :=
+ jointCov d (K24 d) u R
+
+/-- Display (3): for `d ∈ {2, 3}`, in every orthonormal frame `R` (with `u = R 0`),
+`(1-epsilon) C_ref ≤ C_24 ≤ (1+epsilon) C_ref` in the positive-semidefinite order.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "The inequalities are in the positive-semidefinite ordering and hold in every"
+Interface: summability of the theta family is the premise `ThetaSummable d`; the matrices are defined by the derivative rule of `jointCov`.
+Does 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 encloses the coefficient; nonauthor review or acceptance. -/
+def CovarianceOrdering : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → ThetaSummable d →
+ ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ (C24 d (R ⟨0, hd⟩) R - (1 - epsilon) • Cref d (R ⟨0, hd⟩) R).PosSemidef ∧
+ ((1 + epsilon) • Cref d (R ⟨0, hd⟩) R - C24 d (R ⟨0, hd⟩) R).PosSemidef
+
+/-- Section 3: each entry of `C_24` differs from the corresponding entry of `C_ref` by at most
+`2E`, in every orthonormal frame.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Each covariance entry differs from the reference by at most2E, by (2)."
+Interface: summability of the theta family is the premise `ThetaSummable d`.
+Does not claim: the bound (statement only); the spectral-norm bound `20E` (not specified); nonauthor review or acceptance. -/
+def EntrywiseCovarianceBound : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → ThetaSummable d →
+ ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ ∀ a b : JointIndex d,
+ |C24 d (R ⟨0, hd⟩) R a b - Cref d (R ⟨0, hd⟩) R a b| ≤ 2 * imageConstE
+
+/-- Section 3: `C_ref ≥ I/3` in the positive-semidefinite order, in every orthonormal frame.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Thus C_ref >= I/3 and"
+Interface: none.
+Does 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_minors`, `smaller_eigenvalue_exceeds_third`), not here. -/
+def ReferenceCovarianceLowerBound : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ (Cref d (R ⟨0, hd⟩) R - (1 / 3 : ℝ) • (1 : Matrix (JointIndex d) (JointIndex d) ℝ)).PosSemidef
+
+/-- Section 1 reference blocks, in every orthonormal frame with `u = R 0`: `Cov(G) = I_d`,
+`Var(t) = 15`, `Cov(t, G) = (-3, 0, …, 0)`, `Cov(V) = diag(3, 1, …, 1)` and `tau^2 = 6`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Var(t)=15, Cov(t,G)=(-3,0,...,0),"
+Interface: none; the blocks are the derivative-rule matrices of `K_infty`.
+Does not claim: the identities (statement only); `15 - 9 = 6` is kernel-checked on main (`UniversalLaw.Side24.conditional_third_derivative_variance`), not here. -/
+def ReferenceOddAndPinBlocks : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ gradCov d (Kinf d) R = 1 ∧
+ thirdVar d (Kinf d) (R ⟨0, hd⟩) = 15 ∧
+ thirdGradCov d (Kinf d) (R ⟨0, hd⟩) R = (fun j => if j = ⟨0, hd⟩ then -3 else 0) ∧
+ pinCov d (Kinf d) (R ⟨0, hd⟩) R = Matrix.diagonal (fun i => if i = ⟨0, hd⟩ then 3 else 1) ∧
+ condThirdVariance d (Kinf d) (R ⟨0, hd⟩) R = 6
+
+/-! ## Section 4: Gaussian density comparison -/
+
+/-- The centred Gaussian density on `R^n` with covariance `C`:
+`(2 pi)^(-n/2) det(C)^(-1/2) exp(-x^T C^(-1) x / 2)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Comparing Gaussian determinants"
+Interface: none.
+Does not claim: that this is a probability density when `C` is singular (the matrix inverse is then `0` in Lean). -/
+noncomputable def gaussDensity (n : ℕ) (C : Matrix (Fin n) (Fin n) ℝ) (x : Fin n → ℝ) : ℝ :=
+ (2 * Real.pi) ^ (-(n : ℝ) / 2) * C.det ^ (-(1 : ℝ) / 2) *
+ Real.exp (-(dotProduct x (Matrix.mulVec C⁻¹ x)) / 2)
+
+/-- The number `n = m(m+1)/2` of independent symmetric-matrix coordinates.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Let C be a centered covariance in n=m(m+1)/2 independent symmetric-matrix"
+Interface: none.
+Does not claim: anything. -/
+def symCoordDim (m : ℕ) : ℕ := m * (m + 1) / 2
+
+/-- Section 4 density comparison: if `(1-epsilon) C0 ≤ C ≤ (1+epsilon) C0` in the
+positive-semidefinite order, with `C0` positive definite, then pointwise
+`[(1-epsilon)/(1+epsilon)]^(n/2) phi_{(1-epsilon)C0} ≤ phi_C ≤ [(1+epsilon)/(1-epsilon)]^(n/2) phi_{(1+epsilon)C0}`,
+`n = m(m+1)/2`, `epsilon = 10^(-108)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "[(1-epsilon)/(1+epsilon)]^(n/2) phi_((1-epsilon)C0)"
+Interface: none; `C.PosDef` is stated as a premise although it follows from `C0.PosDef` and the ordering.
+Does 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); nothing here encloses the coefficient; nonauthor review or acceptance. -/
+def DensityComparison : Prop :=
+ ∀ (m : ℕ) (C0 C : Matrix (Fin (symCoordDim m)) (Fin (symCoordDim m)) ℝ),
+ C0.PosDef → C.PosDef →
+ (C - (1 - epsilon) • C0).PosSemidef → ((1 + epsilon) • C0 - C).PosSemidef →
+ ∀ x : Fin (symCoordDim m) → ℝ,
+ ((1 - epsilon) / (1 + epsilon)) ^ ((symCoordDim m : ℝ) / 2) *
+ gaussDensity (symCoordDim m) ((1 - epsilon) • C0) x ≤
+ gaussDensity (symCoordDim m) C x ∧
+ gaussDensity (symCoordDim m) C x ≤
+ ((1 + epsilon) / (1 - epsilon)) ^ ((symCoordDim m : ℝ) / 2) *
+ gaussDensity (symCoordDim m) ((1 + epsilon) • C0) x
+
+/-- The exponent `a = m + 2/3 + n/2` of Section 4, with `m = d - 1`, `n = m(m+1)/2`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "a=m+2/3+n/2, b=d+n/2."
+Interface: none.
+Does not claim: the values `13/6`, `25/6`, kernel-checked on main (`UniversalLaw.Side24.exponent_values`), not here. -/
+noncomputable def exponentA (d : ℕ) : ℝ :=
+ ((d - 1 : ℕ) : ℝ) + 2 / 3 + (symCoordDim (d - 1) : ℝ) / 2
+
+/-- The exponent `b = d + n/2` of Section 4, with `n = (d-1)d/2`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "a=m+2/3+n/2, b=d+n/2."
+Interface: none.
+Does not claim: the inequalities `a+2b<14`, `2a+b<13`, kernel-checked on main (`UniversalLaw.Side24.exponent_bounds`), not here. -/
+noncomputable def exponentB (d : ℕ) : ℝ :=
+ (d : ℝ) + (symCoordDim (d - 1) : ℝ) / 2
+
+/-- Section 4 ratio bounds: for `d ∈ {2, 3}`,
+`1 - 13 epsilon ≤ (1-epsilon)^a / (1+epsilon)^b` and `(1+epsilon)^a / (1-epsilon)^b ≤ 1 + 28 epsilon`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "ratio between1-13epsilon and"
+Interface: none.
+Does 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.Side24.ratio_constant_ordering`, `density_comparison_below_reported`), not here. -/
+def IntegrandRatioBounds : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 →
+ 1 - 13 * epsilon ≤ (1 - epsilon) ^ exponentA d / (1 + epsilon) ^ exponentB d ∧
+ (1 + epsilon) ^ exponentA d / (1 - epsilon) ^ exponentB d ≤ 1 + 28 * epsilon
+
+/-! ## Section 1: reference densities and the reference coefficient identity -/
+
+/-- Section 1: in every orthonormal frame with `u = R 0`, the reference gradient and pin
+densities at zero satisfy `p_G(0) p_V(0) = (2 pi)^(-d) / sqrt 3`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "p_G(0) p_V(0) = (2pi)^(-d) / sqrt(3)."
+Interface: none; the densities are `gaussDensity` of the derivative-rule blocks of `K_infty`.
+Does not claim: the identity (statement only); `det diag(3,1,…,1) = 3` is kernel-checked on main (`UniversalLaw.Side24.pin_determinant_and_joint_dimension`), not here. -/
+def ReferencePinDensityProduct : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ gaussDensity d (gradCov d (Kinf d) R) 0 *
+ gaussDensity d (pinCov d (Kinf d) (R ⟨0, hd⟩) R) 0 =
+ (2 * Real.pi) ^ (-(d : ℝ)) / Real.sqrt 3
+
+/-- Ordinary sphere area `|S^(d-1)|`: `2 pi` for `d = 2`, `4 pi` for `d = 3`, `0` otherwise.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Substituting these moments and |S^1|=2pi, |S^2|=4pi into the exact parent coefficient"
+Interface: none.
+Does not claim: any value outside `d ∈ {2, 3}`. -/
+noncomputable def sphereArea (d : ℕ) : ℝ :=
+ if d = 2 then 2 * Real.pi else if d = 3 then 4 * Real.pi else 0
+
+/-- Display (1) as an identity: the parent prefactor `Gamma(7/6) / [24^(1/3) sqrt pi]` times
+`p_G(0) p_V(0) = (2 pi)^(-d) / sqrt 3`, times `tau^(4/3)` with `tau = sqrt 6`, times `D_{d-1}`,
+times `|S^(d-1)|`, equals `c_{d,ref}` (using `6^(2/3)/24^(1/3) = (3/2)^(1/3)`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "This eliminates BOTH the angular and cone integrals for the reference expression."
+Interface: none.
+Does 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.Side24.cube_root_simplification`), not here; nonauthor review or acceptance. -/
+def ReferenceCoefficientIdentity : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 →
+ Real.Gamma (7 / 6) / ((24 : ℝ) ^ ((1 : ℝ) / 3) * Real.sqrt Real.pi) *
+ ((2 * Real.pi) ^ (-(d : ℝ)) / Real.sqrt 3) * (Real.sqrt 6) ^ ((4 : ℝ) / 3) *
+ coneMomentRef (d - 1) * sphereArea d =
+ cRef d
+
+/-! ## Section 1: the cone moments as Gaussian expectations -/
+
+/-- Interface for the Gaussian variables of the reference cone moments. GIVEN: a probability
+space; the `m = 1` transverse entry `A` with law `N(0, 8/3)`; the `m = 2` coordinates
+`s, x, y` (shared trace shift and traceless part) jointly independent with laws `N(0, 5/3)`,
+`N(0, 1)`, `N(0, 1)`, stated as a product law. Existence of such variables is not asserted.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Var(s)=5/3 and Var(x)=Var(y)=1. The negative-definite cone is s<-R,"
+Interface: every field is a given property; the laws are `ProbabilityTheory.gaussianReal` with the displayed variances.
+Does 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`). -/
+structure ConeMomentInterface where
+ /-- The sample space. -/
+ Ω : Type
+ /-- Its sigma-algebra. -/
+ [mΩ : MeasurableSpace Ω]
+ /-- The probability measure. -/
+ P : Measure Ω
+ /-- `P` is a probability measure. -/
+ [isProb : IsProbabilityMeasure P]
+ /-- Section 1 clause "For m=1 the variance of A is8/3.": the scalar transverse Hessian. -/
+ A : Ω → ℝ
+ /-- Law of `A`: centred Gaussian of variance `8/3`. -/
+ A_law : Measure.map A P = ProbabilityTheory.gaussianReal 0 (8 / 3)
+ /-- Section 1 clause "write A=[[s+x,y],[y,s-x]]": the shared scalar shift `s`. -/
+ s : Ω → ℝ
+ /-- The traceless coordinate `x`. -/
+ x : Ω → ℝ
+ /-- The traceless coordinate `y`. -/
+ y : Ω → ℝ
+ /-- Section 1 clause "s,x,y are independent, Var(s)=5/3 and Var(x)=Var(y)=1": the joint law
+ of `(s, x, y)` is the product of `N(0,5/3)`, `N(0,1)`, `N(0,1)`. -/
+ sxy_law : Measure.map (fun ω => (s ω, x ω, y ω)) P =
+ (ProbabilityTheory.gaussianReal 0 (5 / 3)).prod
+ ((ProbabilityTheory.gaussianReal 0 1).prod (ProbabilityTheory.gaussianReal 0 1))
+
+/-- The `m = 2` transverse Hessian `A = [[s+x, y], [y, s-x]]`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "For m=2 write A=[[s+x,y],[y,s-x]]. Then s,x,y are independent,"
+Interface: none.
+Does not claim: anything. -/
+noncomputable def transverseMatrix (s x y : ℝ) : Matrix (Fin 2) (Fin 2) ℝ :=
+ Matrix.of ![![s + x, y], ![y, s - x]]
+
+/-- The negative-definite cone `A < 0` for the `m = 2` matrix, as positive definiteness of `-A`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "R=sqrt(x^2+y^2), and det A=s^2-R^2."
+Interface: none.
+Does not claim: the source's reduction of the cone to `s < -R` (not specified; the cone is taken by its definition). -/
+def NegDefCone (q : ℝ × ℝ × ℝ) : Prop :=
+ (-(transverseMatrix q.1 q.2.1 q.2.2)).PosDef
+
+/-- The cone-moment integrand `h(A) = det(A)^2 1{A<0}` for the `m = 2` matrix.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "R=sqrt(x^2+y^2), and det A=s^2-R^2."
+Interface: none.
+Does not claim: the identity `det A = s^2 - R^2` (not specified separately). -/
+noncomputable def coneIntegrand (q : ℝ × ℝ × ℝ) : ℝ :=
+ Set.indicator {q : ℝ × ℝ × ℝ | NegDefCone q}
+ (fun q => (transverseMatrix q.1 q.2.1 q.2.2).det ^ 2) q
+
+/-- Section 1 identity `D_1 = E[A^2 1{A<0}] = 4/3` for `A ~ N(0, 8/3)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "D_1=E[A^2 1{A<0}]=4/3."
+Interface: `I : ConeMomentInterface` is given; the law of `A` is its hypothesis field.
+Does not claim: the identity (statement only); that `D_1` is the parent's cone moment `D_u` of (15.1) for the reference law; nothing here encloses the coefficient. -/
+def ConeMomentD1Identity (I : ConeMomentInterface) : Prop :=
+ ∫ ω, Set.indicator (Set.Iio (0 : ℝ)) (fun a => a ^ 2) (I.A ω) ∂I.P = coneMomentD1
+
+/-- Section 1 identity `D_2 = E[det(A)^2 1{A<0}] = (1/2)[25/3 - 20/3 + 8 - 8 sqrt(3/8)]` for
+`A = [[s+x, y], [y, s-x]]` with the product Gaussian law.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "D_2 = (1/2)[25/3-20/3+8-8sqrt(3/8)]"
+Interface: `I : ConeMomentInterface` is given; the joint law is its hypothesis field.
+Does not claim: the identity (statement only); the Rayleigh integration route; that `D_2` is the parent's `D_u` for the reference law; nothing here encloses the coefficient; nonauthor review or acceptance. -/
+def ConeMomentD2Identity (I : ConeMomentInterface) : Prop :=
+ ∫ ω, coneIntegrand (I.s ω, I.x ω, I.y ω) ∂I.P =
+ (1 / 2) * (25 / 3 - 20 / 3 + 8 - 8 * Real.sqrt (3 / 8))
+
+/-- Section 1 algebra `(1/2)[25/3 - 20/3 + 8 - 8 sqrt(3/8)] = 29/6 - sqrt 6`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: " = 29/6-sqrt(6)."
+Interface: none.
+Does not claim: the identity (statement only); its rational part and `4 sqrt(3/8) = sqrt 6` are kernel-checked on main (`UniversalLaw.Side24.cone_moment_m2_algebra`), not here. -/
+def ConeMomentD2Algebra : Prop :=
+ (1 / 2 : ℝ) * (25 / 3 - 20 / 3 + 8 - 8 * Real.sqrt (3 / 8)) = coneMomentD2
+
+/-- Section 1 moments of the trace shift `s ~ N(0, 5/3)`: `E s^2 = 5/3`, `E s^4 = 25/3`,
+`E exp(-s^2/2) = sqrt(3/8)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "E s^2=5/3, E s^4=25/3 and"
+Interface: `I : ConeMomentInterface` is given.
+Does not claim: the identities (statement only); `3 (5/3)^2 = 25/3` and `1 + 5/3 = 8/3` are kernel-checked on main (`UniversalLaw.Side24.fourth_moment_of_trace`, `exponential_moment_of_trace`), not here. -/
+def TraceMoments (I : ConeMomentInterface) : Prop :=
+ ∫ ω, I.s ω ^ 2 ∂I.P = 5 / 3 ∧
+ ∫ ω, I.s ω ^ 4 ∂I.P = 25 / 3 ∧
+ ∫ ω, Real.exp (-(I.s ω ^ 2) / 2) ∂I.P = Real.sqrt (3 / 8)
+
+/-- Section 1: `R^2 = x^2 + y^2` has density `exp(-z/2)/2` on `(0, ∞)`, written through its
+distribution function `P(R^2 ≤ a) = ∫_0^a exp(-z/2)/2 dz` for `a ≥ 0`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "The variable R^2 has density e^(-z/2)/2."
+Interface: `I : ConeMomentInterface` is given.
+Does not claim: the law (statement only); measurability of the event (if the event is not measurable, `P` is its outer measure). -/
+def RayleighSquareLaw (I : ConeMomentInterface) : Prop :=
+ ∀ a : ℝ, 0 ≤ a →
+ (I.P {ω | I.x ω ^ 2 + I.y ω ^ 2 ≤ a}).toReal = ∫ z in (0 : ℝ)..a, Real.exp (-z / 2) / 2
+
+/-- Section 1 elementary integral: for `a ≥ 0`,
+`∫_0^a (a-z)^2 exp(-z/2) dz/2 = a^2 - 4a + 8 - 8 exp(-a/2)`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "integral_0^a (a-z)^2 e^(-z/2) dz/2 = a^2-4a+8-8e^(-a/2)."
+Interface: none; the integral is Mathlib's interval integral against Lebesgue measure.
+Does not claim: the identity (statement only). -/
+def ElementaryConeIntegral : Prop :=
+ ∀ a : ℝ, 0 ≤ a →
+ ∫ z in (0 : ℝ)..a, (a - z) ^ 2 * Real.exp (-z / 2) / 2 =
+ a ^ 2 - 4 * a + 8 - 8 * Real.exp (-a / 2)
+
+/-! ## The exact periodic coefficient as an interface, and the headline statements -/
+
+/-- Interface for the exact periodic coefficient `c_{d,24}`, "precisely its equation (15.2)"
+of the parent. GIVEN: the coefficient `c24`; the ordinary sphere-area measure on `S^(d-1)`;
+the gradient density `p_G(0)`, the pin density `p_{V_u}(0)`, the conditional standard
+deviation `tau_u` and the cone moment `D_u` of the parent's (15.1). Hypothesis fields: the
+sphere measure is carried by the unit sphere with the areas `2 pi`, `4 pi`; the parent's
+positivity clause "Finite-jet rank proves tau_u>0, positive densities p_G(0),p_Vu(0), and
+D_u>0"; the densities and `tau_u^2` agree with the Gaussian density formula and the Schur
+complement of the derivative-rule blocks of `K_24`; summability of the theta family; and
+the parent's display (15.2)
+`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)`
+(source id `lifetime-parent`, Section 15). The cone moment `D_u` is NOT pinned to `K_24`
+here: writing it needs the conditional Gaussian law `A_u | V_u = 0`, which this module does
+not construct.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Let c_d,24 be precisely its equation (15.2), using ordinary sphere area, ordered"
+Interface: every field is a given object or a hypothesis; nothing is derived; in particular `coneMoment` is characterised only by its docstring.
+Does 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). -/
+structure PeriodicCoefficientInterface where
+ /-- The exact periodic coefficient `c_{d,24}`, as a function of the dimension. -/
+ c24 : ℕ → ℝ
+ /-- Scope clause "using ordinary sphere area": the surface measure `sigma` on `S^(d-1)`. -/
+ sphereMeasure : (d : ℕ) → Measure (E d)
+ /-- The sphere measure is carried by the unit sphere. -/
+ sphereMeasure_support : ∀ d : ℕ, sphereMeasure d ((Metric.sphere (0 : E d) 1)ᶜ) = 0
+ /-- Section 1 clause "|S^1|=2pi, |S^2|=4pi": total areas in dimensions `2` and `3`. -/
+ sphereMeasure_area :
+ (sphereMeasure 2 Set.univ).toReal = 2 * Real.pi ∧ (sphereMeasure 3 Set.univ).toReal = 4 * Real.pi
+ /-- Parent (15.2) ingredient: the gradient density at zero `p_G(0)`. -/
+ pG0 : ℕ → ℝ
+ /-- Parent (15.2) ingredient: the pin density at zero `p_{V_u}(0)` for the direction `u`. -/
+ pV0 : (d : ℕ) → E d → ℝ
+ /-- Parent (15.1) ingredient: `tau_u`, with `tau_u^2 = Var(t_u | G = 0)`. -/
+ tau : (d : ℕ) → E d → ℝ
+ /-- Parent (15.1) ingredient: `D_u = E[(det A_u)^2 1{A_u<0} | V_u=0]`, the Gaussian cone
+ expectation under the conditional law of the transverse Hessian; GIVEN, not constructed. -/
+ coneMoment : (d : ℕ) → E d → ℝ
+ /-- Parent clause: positive density `p_G(0)`. -/
+ pG0_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → 0 < pG0 d
+ /-- Parent clause: positive density `p_{V_u}(0)` for every unit direction. -/
+ pV0_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ u : E d, ‖u‖ = 1 → 0 < pV0 d u
+ /-- Parent clause: `tau_u > 0` for every unit direction. -/
+ tau_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ u : E d, ‖u‖ = 1 → 0 < tau d u
+ /-- Parent clause: `D_u > 0` for every unit direction. -/
+ coneMoment_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ u : E d, ‖u‖ = 1 → 0 < coneMoment d u
+ /-- The theta family of `K_24` is summable. -/
+ theta_summable : ∀ d : ℕ, d = 2 ∨ d = 3 → ThetaSummable d
+ /-- `p_G(0)` is the centred Gaussian density at zero with the gradient block of `K_24`, in
+ every orthonormal frame. -/
+ pG0_def : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ R : Fin d → E d, Orthonormal ℝ R →
+ pG0 d = gaussDensity d (gradCov d (K24 d) R) 0
+ /-- `p_{V_u}(0)` is the centred Gaussian density at zero with the pin block of `K_24`, in
+ every orthonormal frame with `u = R 0`. -/
+ pV0_def : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ pV0 d (R ⟨0, hd⟩) = gaussDensity d (pinCov d (K24 d) (R ⟨0, hd⟩) R) 0
+ /-- `tau_u^2` is the Schur complement `Var(t_u) - Cov(t_u,G) Cov(G)^(-1) Cov(G,t_u)` of the
+ derivative-rule blocks of `K_24`, in every orthonormal frame with `u = R 0`. -/
+ tau_sq : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ tau d (R ⟨0, hd⟩) ^ 2 = condThirdVariance d (K24 d) (R ⟨0, hd⟩) R
+ /-- Parent display (15.2), for `d ∈ {2, 3}`. -/
+ eq_15_2 : ∀ d : ℕ, d = 2 ∨ d = 3 →
+ c24 d = Real.Gamma (7 / 6) / ((24 : ℝ) ^ ((1 : ℝ) / 3) * Real.sqrt Real.pi) *
+ ∫ u, pG0 d * pV0 d u * tau d u ^ ((4 : ℝ) / 3) * coneMoment d u ∂(sphereMeasure d)
+
+/-- The headline statement of the source: the two enclosures
+`0.07340691930603427103 < c_{2,24} < 0.07340691930603427104` and
+`0.04177593184059834334 < c_{3,24} < 0.04177593184059834335`, for any coefficient satisfying
+the interface.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "0.07340691930603427103 < c_2,24 < 0.07340691930603427104,"
+Interface: `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.
+Does 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)`) is kernel-checked on main (31 `UniversalLaw.Side24` targets at origin/main f6deeba7), not here; nonauthor review or acceptance. -/
+def CoefficientEnclosure (I : PeriodicCoefficientInterface) : Prop :=
+ d2Lower < I.c24 2 ∧ I.c24 2 < d2Upper ∧ d3Lower < I.c24 3 ∧ I.c24 3 < d3Upper
+
+/-- Display (4): `|c_{d,24} / c_{d,ref} - 1| < 10^(-106)` for `d = 2, 3`, for any coefficient
+satisfying the interface.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "|c_d,24/c_d,ref -1| < 10^(-106), d=2,3."
+Interface: `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.
+Does 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)` is kernel-checked on main (`UniversalLaw.Side24.density_comparison_below_reported`), not here; nothing here encloses the coefficient. -/
+def ReferenceComparison (I : PeriodicCoefficientInterface) : Prop :=
+ ∀ d : ℕ, d = 2 ∨ d = 3 → |I.c24 d / cRef d - 1| < 1 / 10 ^ 106
+
+/-! ## Round 7: the successor interface that pins the cone moment
+
+Everything above this line is byte-identical to the module at Math- `8acc4856`. The declarations below
+transcribe the parent's (15.1) `D_u = E[(det A_u)^2 1{A_u<0} | V_u=0]` (source id `lifetime-parent`,
+Section 15) for the formal kernel `K_24`: the conditional law of the transverse Hessian block `A_u`
+given the pin `V_u = 0` is written, for a centred Gaussian vector, through the Schur complement of the
+derivative-rule blocks (the SIDE24 note's Section 3 reading of conditioning), and the cone expectation
+is the Lebesgue integral of `det(A)^2 1{A<0}` against Mathlib's `multivariateGaussian` with that
+covariance. The successor `PeriodicCoefficientInterface2` keeps every field of
+`PeriodicCoefficientInterface` and adds the parent's nondegeneracy clause for the pin block and the
+conditional block and the definition of `coneMoment`; the two successor Props restate the headline
+displays over it. Formal progress of every declaration here: `specified`. Nothing here is proved,
+nothing above changes, no label moves, and no inhabitant of either interface is constructed.
+
+What the successor does NOT pin (recorded for the design review, main#307 6137276515): `sphereMeasure` stays a given measure
+constrained only by its support and total area, so `c24` is determined by the fields only up to that
+choice; frame invariance of `coneMomentOf` under transverse-frame changes (the parent asserts it) is
+not a field, so the frame-quantified `coneMoment_def` is a consistency burden on the interface rather
+than a theorem here. The uniform-in-`u` bounds of the source would make the sphere-measure choice immaterial to
+the two successor inequalities, not to the value of `c24`. -/
+
+/-- Transverse coordinates of the frame: the indices `i ≠ 0` (the axial direction is `u = R 0`), the
+`m = d - 1` directions of `u`-perp.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Writing m=d-1 and A for the transverse Hessian, Gaussian conditioning on V=0 gives"
+Interface: none; a subtype of `Fin d`.
+Does not claim: anything. -/
+abbrev TransRow (d : ℕ) : Type := {i : Fin d // 0 < i.val}
+
+/-- Transverse `svec` coordinates: the `svec` indices `(i, j)`, `i ≤ j`, with both entries transverse
+(`0 < i`), of cardinality `m(m+1)/2` (`1` for `d = 2`, `3` for `d = 3`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Use the joint vector (G,t,svec H), where svec lists diagonal Hessian entries and"
+Interface: none; a subtype of `SymIndex d`.
+Does not claim: the cardinalities (not specified). -/
+abbrev TransIndex (d : ℕ) : Type := {p : SymIndex d // 0 < p.1.1.val}
+
+/-- The `svec` scaling restricted to transverse coordinates: `1` on the diagonal, `sqrt 2` off it
+(the restriction of `svecScale` to the Hessian block).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "sqrt(2) times independent off-diagonal entries. Its dimension is at most10."
+Interface: none.
+Does not claim: anything. -/
+noncomputable def transScale (d : ℕ) (a : TransIndex d) : ℝ :=
+ if a.1.1.1 = a.1.1.2 then 1 else Real.sqrt 2
+
+/-- The covariance block of the transverse Hessian entries `A_ij = ∂_{R i} ∂_{R j} f`, `i, j ≠ 0`, by the
+stationary rule `Cov(∂^α f, ∂^β f) = (-1)^{|β|} ∂^{α+β} K(0)` at even total order (sign `+`), with the
+`svec` scaling: the restriction of `jointCov` to the transverse `svec` coordinates.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Cov(H_ij,H_kl)=delta_ij delta_kl+delta_ik delta_jl+delta_il delta_jk,"
+Interface: none; the matrix is DEFINED by the derivative rule, no field is constructed.
+Does not claim: that this matrix is the covariance of any random vector; its reference value (the display is for `K_infty`); symmetry or positive semidefiniteness. -/
+noncomputable def transCov (d : ℕ) (K : E d → ℝ) (R : Fin d → E d) :
+ Matrix (TransIndex d) (TransIndex d) ℝ :=
+ Matrix.of fun a b => transScale d a * transScale d b *
+ derivContraction d K 0 [R a.1.1.1, R a.1.1.2, R b.1.1.1, R b.1.1.2]
+
+/-- The cross-covariance block of the transverse Hessian entries with the pin coordinates
+`V_i = ∂_u ∂_{R i} f`: `Cov(A_ab, V_i) = ∂_{R a} ∂_{R b} ∂_u ∂_{R i} K(0)`, with the `svec` scaling.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Thus V=Hu has covariance diag(3,1,...,1), tau^2=Var(t|G=0)=6, and"
+Interface: none; defined by the derivative rule.
+Does not claim: that this matrix is a covariance; its reference value. -/
+noncomputable def transPinCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) :
+ Matrix (TransIndex d) (Fin d) ℝ :=
+ 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]
+
+/-- The conditional covariance of the transverse Hessian given `V_u = 0`, as the Schur complement
+`Cov(A) - Cov(A,V) Cov(V)^(-1) Cov(V,A)` of the derivative-rule blocks (the same pattern as
+`condThirdVariance`, with `pinCov` as `Cov(V)`): the Gaussian conditional covariance when `Cov(V)` is
+nondegenerate.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "to their conditional covariances. For the latter, the Schur-complement quadratic"
+Interface: none; the Gaussian conditional covariance is written as the Schur complement (a standard identity for a nondegenerate conditioning block, used here as the definition).
+Does 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 constructed); the reference value `(2/3) delta delta + delta delta + delta delta` of Section 1. -/
+noncomputable def condHessianCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) :
+ Matrix (TransIndex d) (TransIndex d) ℝ :=
+ transCov d K R - transPinCov d K u R * (pinCov d K u R)⁻¹ * (transPinCov d K u R).transpose
+
+/-- The symmetric transverse matrix read off an `svec` coordinate vector, undoing the `sqrt 2` scaling
+of the off-diagonal entries: entry `(i, j)` is `v_(i,j)` on the diagonal and `v_(min,max) / sqrt 2` off it.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Let C be a centered covariance in n=m(m+1)/2 independent symmetric-matrix"
+Interface: none.
+Does not claim: anything. -/
+noncomputable def symOf (d : ℕ) (v : EuclideanSpace ℝ (TransIndex d)) :
+ Matrix (TransRow d) (TransRow d) ℝ :=
+ Matrix.of fun i j =>
+ if h : i.1 ≤ j.1 then v ⟨⟨(i.1, j.1), h⟩, i.2⟩ / (if i = j then 1 else Real.sqrt 2)
+ else v ⟨⟨(j.1, i.1), le_of_not_ge h⟩, j.2⟩ / Real.sqrt 2
+
+/-- The cone-moment integrand `h(A) = det(A)^2 1{A<0}` on `svec` coordinates, the negative-definite
+cone taken as positive definiteness of `-A` (as in `NegDefCone`).
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "Integrate the nonnegative function h(A)=det(A)^2 1{A<0}. Under covariance scaling"
+Interface: none.
+Does not claim: measurability or integrability of the integrand (if it is not integrable, Mathlib's integral is `0`). -/
+noncomputable def coneIntegrandTrans (d : ℕ) (v : EuclideanSpace ℝ (TransIndex d)) : ℝ :=
+ Set.indicator {v : EuclideanSpace ℝ (TransIndex d) | (-(symOf d v)).PosDef}
+ (fun v => (symOf d v).det ^ 2) v
+
+/-- The Gaussian cone expectation of the parent's (15.1), `D_u = E[(det A_u)^2 1{A_u<0} | V_u=0]`,
+written for a kernel `K` as the integral of the cone integrand against the centred multivariate
+Gaussian law with the conditional covariance `condHessianCov d K u R`, in the frame `R` with `u = R 0`.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "D_u=E[(det A_u)^2 1{A_u<0} | V_u=0]."
+Interface: 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`.
+Does 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 here); its reference values `4/3`, `29/6 - sqrt 6` (those are `ConeMomentD1Identity`, `ConeMomentD2Identity` over `ConeMomentInterface`). -/
+noncomputable def coneMomentOf (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) : ℝ :=
+ ∫ v, coneIntegrandTrans d v ∂(ProbabilityTheory.multivariateGaussian 0 (condHessianCov d K u R))
+
+/-- Successor of `PeriodicCoefficientInterface` (numbered, the predecessor unchanged): every field of
+the predecessor, plus the parent's Section 15 clause that `A_u` conditional on `V_u = 0` is a centred
+NONDEGENERATE Gaussian symmetric matrix (as positive definiteness of the pin block and of the
+conditional block of `K_24`, in every orthonormal frame with `u = R 0`), plus the definition of the
+cone moment: `coneMoment d u` is the Gaussian cone expectation `coneMomentOf d (K24 d) u R`. With these
+fields `coneMoment` is no longer free, so the doubling inhabitant that makes the universal closure of
+`CoefficientEnclosure` and `ReferenceComparison` false is excluded.
+
+Source: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7
+Anchor: "Here A_u conditional on V_u=0 is an actual centered nondegenerate Gaussian symmetric matrix"
+Interface: 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).
+Does 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. -/
+structure PeriodicCoefficientInterface2 extends PeriodicCoefficientInterface where
+ /-- Parent clause "an actual centered nondegenerate Gaussian symmetric matrix": the pin block
+ `Cov(V_u)` of `K_24` is positive definite in every orthonormal frame with `u = R 0`. The ordinary-inverse
+ Schur identification of `condHessianCov` with the Gaussian conditional covariance requires an invertible pin
+ block; this field supplies that hypothesis. -/
+ pinCov_posDef : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ (pinCov d (K24 d) (R ⟨0, hd⟩) R).PosDef
+ /-- The same clause for the conditional transverse block: positive definite, so the law in
+ `coneMomentOf` is a nondegenerate Gaussian. For a covariance that is not positive semidefinite, Mathlib's
+ `multivariateGaussian` falls back to the Dirac mass at `0`; a singular positive-semidefinite covariance gives a
+ degenerate Gaussian, including the Dirac mass when the covariance is zero; omitting a PosDef field would not
+ establish singularity. The inherited `coneMoment_pos` with `coneMoment_def` excludes the Dirac case, whose
+ cone moment is `0`. -/
+ condHessianCov_posDef : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ (condHessianCov d (K24 d) (R ⟨0, hd⟩) R).PosDef
+ /-- Parent (15.1): `D_u` is the Gaussian cone expectation under the conditional law of the
+ transverse Hessian of `K_24` given `V_u = 0`, in every orthonormal frame with `u = R 0`. -/
+ coneMoment_def : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →
+ coneMoment d (R ⟨0, hd⟩) = coneMomentOf d (K24 d) (R ⟨0, hd⟩) R
+
+/-- Successor of `CoefficientEnclosure` over the successor interface: the same two enclosures
+`0.07340691930603427103 < c_{2,24} < 0.07340691930603427104` and
+`0.04177593184059834334 < c_{3,24} < 0.04177593184059834335`, for any object satisfying
+`PeriodicCoefficientInterface2`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "0.04177593184059834334 < c_3,24 < 0.04177593184059834335."
+Interface: `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.
+Does 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); existence of an inhabitant; that the formal objects are the source's; anything about `CoefficientEnclosure`, which is unchanged; nonauthor review or acceptance. -/
+def CoefficientEnclosure2 (I : PeriodicCoefficientInterface2) : Prop :=
+ CoefficientEnclosure I.toPeriodicCoefficientInterface
+
+/-- Successor of `ReferenceComparison` over the successor interface: display (4),
+`|c_{d,24} / c_{d,ref} - 1| < 10^(-106)` for `d = 2, 3`, for any object satisfying
+`PeriodicCoefficientInterface2`.
+
+Source: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769
+Anchor: "|c_d,24/c_d,ref -1| < 10^(-106), d=2,3. (4)"
+Interface: `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).
+Does 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 periodic and reference constants (the source says it is NOT claimed); anything about `ReferenceComparison`, which is unchanged; nothing here encloses the coefficient. -/
+def ReferenceComparison2 (I : PeriodicCoefficientInterface2) : Prop :=
+ ReferenceComparison I.toPeriodicCoefficientInterface
+
+end UniversalLaw.Spec.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/coverage-boundary.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/coverage-boundary.json
new file mode 100644
index 000000000..00abab905
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/coverage-boundary.json
@@ -0,0 +1,1844 @@
+{
+ "all_manifest_sources_equal_parent_f20_and_current": true,
+ "archival_disposition": "Historical negative-control inputs and proposed Math/legacy source copies are not imported into any of the three live project modules; archived token hits remain visible.",
+ "assembler_sha256": "f757d7aad6baacba99f83364140bb1a1a891f927498d6819fdd1297186e6f4ed",
+ "base_commit": "f20cc54d4d136e854608853372249882eb4c949f",
+ "companion_sha256": "adb20234c60c017a07a6411f4fa559b8552a59ae6ebb56f9753c3ecce53bb518",
+ "dynamic_source_observations": [],
+ "f20_parent_to_f20_test_change": {
+ "added_names": [
+ "GitObjectFreshnessTests.test_changed_blob_or_directory_is_stale",
+ "GitObjectFreshnessTests.test_duplicate_or_unsupported_target_is_unknown",
+ "GitObjectFreshnessTests.test_object_type_change_is_stale_even_when_sha_text_matches",
+ "GitObjectFreshnessTests.test_observation_must_bind_exact_url_pin_type_and_valid_hashes",
+ "GitObjectFreshnessTests.test_raw_api_duplicate_object_keys_are_unknown",
+ "GitObjectFreshnessTests.test_raw_api_valid_object_controls",
+ "GitObjectFreshnessTests.test_raw_discussion_duplicate_timestamp_is_unknown",
+ "GitObjectFreshnessTests.test_report_only_keeps_entire_original_record_bytes",
+ "GitObjectFreshnessTests.test_snapshot_after_last_path_edit_is_fresh_for_same_blob",
+ "GitObjectFreshnessTests.test_source_path_cannot_cross_a_file_or_use_dot_segments",
+ "GitObjectFreshnessTests.test_unavailable_or_untrustworthy_object_is_unknown",
+ "GitObjectFreshnessTests.test_unchanged_directory_uses_tree_identity",
+ "GitObjectFreshnessTests.test_url_kind_must_match_the_pinned_object",
+ "RefreshTests.test_github_fetch_preserves_discussion_timestamp_endpoints"
+ ],
+ "changed_retained_names": [],
+ "interpretation": "One old moving-ref behavior test was explicitly replaced with discussion-timestamp coverage and exact Git-object freshness regression tests; no claim of zero removed names. Existing formal tests are byte-preserved.",
+ "new_ast_hashes": {
+ "GitObjectFreshnessTests.test_changed_blob_or_directory_is_stale": "e5702acf99fa91bf9c22379b0894d8bfca462c9f2565a4f0c89a736bd9d0ab01",
+ "GitObjectFreshnessTests.test_duplicate_or_unsupported_target_is_unknown": "e9e135687498c52326ecfaf514bf530d948efec03a0ebd0aebd032a7b9957108",
+ "GitObjectFreshnessTests.test_object_type_change_is_stale_even_when_sha_text_matches": "aadd68ebb2a13a98ffdcce3de037dffed3b03bcda7acc85b1e499b8dc92465a8",
+ "GitObjectFreshnessTests.test_observation_must_bind_exact_url_pin_type_and_valid_hashes": "182a4542c74b4871ddedd5c1badf138437fc9850207e8517a9bbf07eb2c9d9e6",
+ "GitObjectFreshnessTests.test_raw_api_duplicate_object_keys_are_unknown": "1caf006d0dc81d6db53b5971fc06ef6fcfc120de22e9cf11723cbe7166399786",
+ "GitObjectFreshnessTests.test_raw_api_valid_object_controls": "83bc4930b074752ca8f3a955d6b17e046b335ae6c5ebafccd84193a8f60e3783",
+ "GitObjectFreshnessTests.test_raw_discussion_duplicate_timestamp_is_unknown": "5d73a5246e3f18f886daa02f57ac18e882da7dc20dc09f9c26a2619647e6acfa",
+ "GitObjectFreshnessTests.test_report_only_keeps_entire_original_record_bytes": "76a6163a95a2a6ceec617695ab6d41784dfa32a136a11b8215b4b0182c64bf08",
+ "GitObjectFreshnessTests.test_snapshot_after_last_path_edit_is_fresh_for_same_blob": "68fed5b78c77af13382a9a73b9d25a58cf761957fa786c7eaf760f74814072df",
+ "GitObjectFreshnessTests.test_source_path_cannot_cross_a_file_or_use_dot_segments": "f5c113d45c77d1e14a34203201acfa15483db5ca6064d03a0d799bb97d8f930e",
+ "GitObjectFreshnessTests.test_unavailable_or_untrustworthy_object_is_unknown": "1376c7c25c0b5ca8eecf5ea0e641edc10d3a9ebb5ea568b2d1d14e755dd45a04",
+ "GitObjectFreshnessTests.test_unchanged_directory_uses_tree_identity": "e6eb168953186bff98eee3ae020a2dc2068b318ce74d25b165b72430cfa81f0d",
+ "GitObjectFreshnessTests.test_url_kind_must_match_the_pinned_object": "a71acd7f368cf5cb96adbb18372a293a89a65cf8b4862834f69b2443c4dfe875",
+ "PaginationTests.test_bad_source_remains_unknown": "8482e205e55d0b0059983135c0f606b441a33fb54d4fdf1481a88f82a69bcc0c",
+ "PaginationTests.test_full_2600_requires_unknown": "5d5e375c6f2b9469ddc2a3f8d0c535d450f3a4cad34285aaca0038aa6d064524",
+ "PaginationTests.test_full_read_with_no_release_does_not_infer_one": "c51dcc1c93159fd67c69c2f98e097ee507a7205643a3e5dd4f8301dd3f7ffd76",
+ "PaginationTests.test_incomplete_does_not_project_early_release": "036bdac4c56dc510dd4f35b4c0f847801e178eaaf1d7648165ed93444705143e",
+ "PaginationTests.test_report_only_preserves_file": "753c186e84eb9409256aa02733998cd30daa24687805e2de4062edc7e1ee6ef0",
+ "PaginationTests.test_stale_source_remains_stale": "f55c0aa3390dc71a833b956b69deba64af908b6ebfc8a254b00aeea2b9b3e0e3",
+ "PaginationTests.test_unsupported_evidence_never_fetches": "97152f1aa37a2e7caf162ebd9d53925fca79a4d795e3beca98217e4f349f5679",
+ "PaginationTests.test_wrong_release_reference_is_not_accepted": "aadb72d2a54ab1f52e2d95c9873c612ce38b9104d28f3e04c8d8ce7c3ec40763",
+ "RefreshTests.test_changed_rev_is_stale": "b91b4018a5edb42b86586bd0d760c3c310920d9b8a1006a804ab69006b2ea3a7",
+ "RefreshTests.test_dir_report_only_does_not_write": "c3bf55ffda206909fc03ffec1f656c9d743021749beb66bf8a3f8f946a0ba60f",
+ "RefreshTests.test_dir_write_mode": "5ccc1f31c23256a4b7c1a9dfad72a241563f58ed6234e679be1931fbf04f953b",
+ "RefreshTests.test_discussion_updated_at_newer_is_stale_and_unfetched_is_unknown": "27193fbcba8ff6ca391f66c991d3fd814458d7ce282986c24db5066050994a70",
+ "RefreshTests.test_duplicate_json_key_is_unknown_and_not_rewritten": "84756a1cd9dcad21f0f7a71bcf7e16b77858d571dc486d4a6d708566be7111a2",
+ "RefreshTests.test_empty_or_missing_source_revision_never_fresh": "2db555e85f57049918a54cca1afb20c40974795ed1eb3ff87c5e91e4da895a9d",
+ "RefreshTests.test_failure_never_fresh_even_if_other_source_ok": "6554e427b2dcad5998d4b11b3feaec5d14493c1ae0b681ca1ef2a5d0c80e68e7",
+ "RefreshTests.test_github_fetch_preserves_discussion_timestamp_endpoints": "e134f6a42b827dfc951e1c4e990e6cdfa4e70c6d3284cfad8fb9ebfdc52e5a67",
+ "RefreshTests.test_no_sources_or_bad_schema_is_unknown": "546d6339097c89ef6f947c6a48e0d7114e1a8ab18590e56583bc0c581ee0f38d",
+ "RefreshTests.test_owner_and_scientific_effect_untouched": "c18f8b0d60b601abea5461a6191738a9ff6afd25290826557fe8e01cb9cd912f",
+ "RefreshTests.test_pinned_sha_accepted_and_other_rev_forms_unknown": "4dc454002b82472ed60e08126222e6174f3cc36d217cd8d5582a73cef17746bb",
+ "RefreshTests.test_pinned_url_trailing_newline_is_not_pinned": "f83f19a54d6b20ebbf712ac96f0f096d3c9b0ffb1437e321f90aacb695e12a77",
+ "RefreshTests.test_refresh_error_is_string_or_null": "ae3790f9cfdb94d3b69c4a5ec8ffa82442603b9d88687414ad4e99d8f28c22d8",
+ "RefreshTests.test_release_comment_sets_released_url_only": "b726117d5f712abb686eb7152b949d44732acbec207c91fc6b07768590051df6",
+ "RefreshTests.test_release_sets_released_url_only_for_matching_pickup_id": "41edcc01d8f75a68d74e212987eff4e200e4302317599ac178b5d255359574e7",
+ "RefreshTests.test_report_only_includes_discovered_released_url": "e1204d9e5bae52784f233edf050b2891ec2ab4157f80fe5e4b557827ef8ad366",
+ "RefreshTests.test_scientific_effect_forced_none_not_passed_through": "e7d53773d202fc170ed712f2624d6420f6f58da772a443914f2f69fbcc77362d",
+ "RefreshTests.test_source_rev_is_primary_and_moving_ref_is_not_stored": "9e7ee682d62e18d1793273b9f64e663899220e6259fa3ed1bf3b969f6cd6e8a6",
+ "RefreshTests.test_successful_refresh_clears_stale_refresh_error": "70b309361702ba9d1f191c63dffcb69358f01833cbd980da7100e095b826dc03",
+ "RefreshTests.test_unchanged_is_fresh": "9190a7e948edeab3793535a6570df7d6a3aeef619b783d10b738ff91b0b90df3",
+ "RefreshTests.test_unreachable_is_unknown_with_error": "b7face96b2007c543b7c0a3c87c29d044528636ab5b10a81d451388263dea4d3",
+ "RefreshTests.test_unsupported_url_raises_source_error": "32603665fd07ee56c1c113b4d4d606948736bb2f8b4ed63830350a980bf4ad35"
+ },
+ "new_count": 43,
+ "old_ast_hashes": {
+ "PaginationTests.test_bad_source_remains_unknown": "8482e205e55d0b0059983135c0f606b441a33fb54d4fdf1481a88f82a69bcc0c",
+ "PaginationTests.test_full_2600_requires_unknown": "5d5e375c6f2b9469ddc2a3f8d0c535d450f3a4cad34285aaca0038aa6d064524",
+ "PaginationTests.test_full_read_with_no_release_does_not_infer_one": "c51dcc1c93159fd67c69c2f98e097ee507a7205643a3e5dd4f8301dd3f7ffd76",
+ "PaginationTests.test_incomplete_does_not_project_early_release": "036bdac4c56dc510dd4f35b4c0f847801e178eaaf1d7648165ed93444705143e",
+ "PaginationTests.test_report_only_preserves_file": "753c186e84eb9409256aa02733998cd30daa24687805e2de4062edc7e1ee6ef0",
+ "PaginationTests.test_stale_source_remains_stale": "f55c0aa3390dc71a833b956b69deba64af908b6ebfc8a254b00aeea2b9b3e0e3",
+ "PaginationTests.test_unsupported_evidence_never_fetches": "97152f1aa37a2e7caf162ebd9d53925fca79a4d795e3beca98217e4f349f5679",
+ "PaginationTests.test_wrong_release_reference_is_not_accepted": "aadb72d2a54ab1f52e2d95c9873c612ce38b9104d28f3e04c8d8ce7c3ec40763",
+ "RefreshTests.test_changed_rev_is_stale": "b91b4018a5edb42b86586bd0d760c3c310920d9b8a1006a804ab69006b2ea3a7",
+ "RefreshTests.test_dir_report_only_does_not_write": "c3bf55ffda206909fc03ffec1f656c9d743021749beb66bf8a3f8f946a0ba60f",
+ "RefreshTests.test_dir_write_mode": "5ccc1f31c23256a4b7c1a9dfad72a241563f58ed6234e679be1931fbf04f953b",
+ "RefreshTests.test_discussion_updated_at_newer_is_stale_and_unfetched_is_unknown": "27193fbcba8ff6ca391f66c991d3fd814458d7ce282986c24db5066050994a70",
+ "RefreshTests.test_duplicate_json_key_is_unknown_and_not_rewritten": "84756a1cd9dcad21f0f7a71bcf7e16b77858d571dc486d4a6d708566be7111a2",
+ "RefreshTests.test_empty_or_missing_source_revision_never_fresh": "2db555e85f57049918a54cca1afb20c40974795ed1eb3ff87c5e91e4da895a9d",
+ "RefreshTests.test_failure_never_fresh_even_if_other_source_ok": "6554e427b2dcad5998d4b11b3feaec5d14493c1ae0b681ca1ef2a5d0c80e68e7",
+ "RefreshTests.test_github_fetch_uses_moving_ref_for_pinned_url": "1273947f57d7ac1c694f472b325c1ea19c6c95a63e34a2aa0ae8aefe2735ab91",
+ "RefreshTests.test_no_sources_or_bad_schema_is_unknown": "546d6339097c89ef6f947c6a48e0d7114e1a8ab18590e56583bc0c581ee0f38d",
+ "RefreshTests.test_owner_and_scientific_effect_untouched": "c18f8b0d60b601abea5461a6191738a9ff6afd25290826557fe8e01cb9cd912f",
+ "RefreshTests.test_pinned_sha_accepted_and_other_rev_forms_unknown": "4dc454002b82472ed60e08126222e6174f3cc36d217cd8d5582a73cef17746bb",
+ "RefreshTests.test_pinned_url_trailing_newline_is_not_pinned": "f83f19a54d6b20ebbf712ac96f0f096d3c9b0ffb1437e321f90aacb695e12a77",
+ "RefreshTests.test_refresh_error_is_string_or_null": "ae3790f9cfdb94d3b69c4a5ec8ffa82442603b9d88687414ad4e99d8f28c22d8",
+ "RefreshTests.test_release_comment_sets_released_url_only": "b726117d5f712abb686eb7152b949d44732acbec207c91fc6b07768590051df6",
+ "RefreshTests.test_release_sets_released_url_only_for_matching_pickup_id": "41edcc01d8f75a68d74e212987eff4e200e4302317599ac178b5d255359574e7",
+ "RefreshTests.test_report_only_includes_discovered_released_url": "e1204d9e5bae52784f233edf050b2891ec2ab4157f80fe5e4b557827ef8ad366",
+ "RefreshTests.test_scientific_effect_forced_none_not_passed_through": "e7d53773d202fc170ed712f2624d6420f6f58da772a443914f2f69fbcc77362d",
+ "RefreshTests.test_source_rev_is_primary_and_moving_ref_is_not_stored": "9e7ee682d62e18d1793273b9f64e663899220e6259fa3ed1bf3b969f6cd6e8a6",
+ "RefreshTests.test_successful_refresh_clears_stale_refresh_error": "70b309361702ba9d1f191c63dffcb69358f01833cbd980da7100e095b826dc03",
+ "RefreshTests.test_unchanged_is_fresh": "9190a7e948edeab3793535a6570df7d6a3aeef619b783d10b738ff91b0b90df3",
+ "RefreshTests.test_unreachable_is_unknown_with_error": "b7face96b2007c543b7c0a3c87c29d044528636ab5b10a81d451388263dea4d3",
+ "RefreshTests.test_unsupported_url_raises_source_error": "32603665fd07ee56c1c113b4d4d606948736bb2f8b4ed63830350a980bf4ad35"
+ },
+ "old_count": 30,
+ "path": "tests/test_node_status_refresh.py",
+ "removed_names": [
+ "RefreshTests.test_github_fetch_uses_moving_ref_for_pinned_url"
+ ]
+ },
+ "implicit_core_dependency": "Lean Init, supplied by exact kernel toolchain; no project Math dependency",
+ "kernel_audit_inputs": [
+ {
+ "bytes": 3008,
+ "matched": true,
+ "path": "tools/CBZNonvacuity.lean",
+ "receipt_sha256": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f",
+ "sha256": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f"
+ },
+ {
+ "bytes": 14610,
+ "matched": true,
+ "path": "tools/cbz_lean_check.py",
+ "receipt_sha256": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d",
+ "sha256": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d"
+ },
+ {
+ "bytes": 23845,
+ "matched": true,
+ "path": "tools/formal_gate_check.py",
+ "receipt_sha256": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5",
+ "sha256": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5"
+ }
+ ],
+ "kernel_axiom_sets": {
+ "UniversalLaw.Side24.conditional_third_derivative_variance": [],
+ "UniversalLaw.Side24.cone_moment_m1_thirds": [],
+ "UniversalLaw.Side24.cone_moment_m2_algebra": [],
+ "UniversalLaw.Side24.covariance_relative_bound": [],
+ "UniversalLaw.Side24.cube_root_simplification": [],
+ "UniversalLaw.Side24.d2Lower": [],
+ "UniversalLaw.Side24.d2Upper": [],
+ "UniversalLaw.Side24.d2_endpoints_adjacent": [],
+ "UniversalLaw.Side24.d3Lower": [],
+ "UniversalLaw.Side24.d3Upper": [],
+ "UniversalLaw.Side24.d3_below_d2": [],
+ "UniversalLaw.Side24.d3_endpoints_adjacent": [],
+ "UniversalLaw.Side24.density_comparison_below_reported": [],
+ "UniversalLaw.Side24.endpoints_in_unit_tenth": [],
+ "UniversalLaw.Side24.expTaylorNumerator": [],
+ "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten": [],
+ "UniversalLaw.Side24.exponent_bounds": [],
+ "UniversalLaw.Side24.exponent_values": [],
+ "UniversalLaw.Side24.exponential_moment_of_trace": [],
+ "UniversalLaw.Side24.fact": [],
+ "UniversalLaw.Side24.fact._f": [],
+ "UniversalLaw.Side24.fact._sunfold": [],
+ "UniversalLaw.Side24.fact._unsafe_rec": [],
+ "UniversalLaw.Side24.fact.match_1": [],
+ "UniversalLaw.Side24.fourth_moment_of_trace": [],
+ "UniversalLaw.Side24.geometric_ratio_constants": [],
+ "UniversalLaw.Side24.hessian_block_eigenvalues": [],
+ "UniversalLaw.Side24.imageConstant": [],
+ "UniversalLaw.Side24.image_constant_value": [],
+ "UniversalLaw.Side24.lattice_shell_constant": [],
+ "UniversalLaw.Side24.odd_block_eigenvalues": [],
+ "UniversalLaw.Side24.odd_block_shifted_minors": [],
+ "UniversalLaw.Side24.pairingSum": [],
+ "UniversalLaw.Side24.pairing_sum_le_six": [],
+ "UniversalLaw.Side24.pairing_sum_six": [],
+ "UniversalLaw.Side24.pairing_terms_six": [],
+ "UniversalLaw.Side24.period_exponent": [],
+ "UniversalLaw.Side24.pin_determinant_and_joint_dimension": [],
+ "UniversalLaw.Side24.ratio_constant_ordering": [],
+ "UniversalLaw.Side24.sixA": [],
+ "UniversalLaw.Side24.sixB": [],
+ "UniversalLaw.Side24.sixth_moment_double_factorial": [],
+ "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third": [],
+ "UniversalLaw.Side24.trace_and_traceless_variances": [],
+ "UniversalLaw.Side24.transverse_covariance_entries_thirds": []
+ },
+ "kernel_baseline_receipt_current": {
+ "bytes": 4378,
+ "path": "formal/.lake/formal-evidence/receipt.json",
+ "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1"
+ },
+ "kernel_baseline_receipt_expected_sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1",
+ "kernel_baseline_receipt_matches_current": true,
+ "kernel_checked_commit": "6fc021839072d8c34f41e18e77b0f618c53baa15",
+ "kernel_constant_count": 45,
+ "kernel_fresh_status": "PASS",
+ "kernel_logs": [
+ {
+ "bytes": 10360,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/all-declarations-and-witnesses.log",
+ "receipt_sha256": "dcc81dc13a6dce4b25a6300fd616966e835877f124b8e6448b452878df9673ea",
+ "sha256": "dcc81dc13a6dce4b25a6300fd616966e835877f124b8e6448b452878df9673ea"
+ },
+ {
+ "bytes": 1028,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/auditor-module-census.log",
+ "receipt_sha256": "6b9bf4260474d13fb392b71b0fa3b3dadc75fc99fb06310b9caaff31feb3ce4c",
+ "sha256": "6b9bf4260474d13fb392b71b0fa3b3dadc75fc99fb06310b9caaff31feb3ce4c"
+ },
+ {
+ "bytes": 538,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/false_premise-audit.log",
+ "receipt_sha256": "424799495dafb2dac297a8206c364a73e8c41bed48ac772b0e806443811bfac1",
+ "sha256": "424799495dafb2dac297a8206c364a73e8c41bed48ac772b0e806443811bfac1"
+ },
+ {
+ "bytes": 0,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/false_premise-compile.log",
+ "receipt_sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ {
+ "bytes": 36,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/fresh-kernel.log",
+ "receipt_sha256": "765e0f77863dc012524cd125d2699754f19e967f4ec35908a2aed7903057572e",
+ "sha256": "765e0f77863dc012524cd125d2699754f19e967f4ec35908a2aed7903057572e"
+ },
+ {
+ "bytes": 485,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/honest-audit.log",
+ "receipt_sha256": "62390300f3aaa05474dd1d9b75e47728635f0e2c4b0b49dc9daf0914ec506d87",
+ "sha256": "62390300f3aaa05474dd1d9b75e47728635f0e2c4b0b49dc9daf0914ec506d87"
+ },
+ {
+ "bytes": 0,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/honest-compile.log",
+ "receipt_sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ {
+ "bytes": 450,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/missing-module.log",
+ "receipt_sha256": "2d9fdde838c729bf8630456eec1033381833a4a2eb42c8f07ca910d9d636f121",
+ "sha256": "2d9fdde838c729bf8630456eec1033381833a4a2eb42c8f07ca910d9d636f121"
+ },
+ {
+ "bytes": 502,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/native-audit.log",
+ "receipt_sha256": "468963ce795fd68a13b99e1e5b9e90e817f273fe2099bda696deb61552697200",
+ "sha256": "468963ce795fd68a13b99e1e5b9e90e817f273fe2099bda696deb61552697200"
+ },
+ {
+ "bytes": 0,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/native-compile.log",
+ "receipt_sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ {
+ "bytes": 441,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/sorry-audit.log",
+ "receipt_sha256": "938f55996c45f78c29d90750ce73a1cfba8bd488b34f5b9e99ced19993bab2f4",
+ "sha256": "938f55996c45f78c29d90750ce73a1cfba8bd488b34f5b9e99ced19993bab2f4"
+ },
+ {
+ "bytes": 136,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/sorry-compile.log",
+ "receipt_sha256": "693c90261e9a6a2c68216209a5692f39ee06659d9a50919b2e551ffbd8f8deaa",
+ "sha256": "693c90261e9a6a2c68216209a5692f39ee06659d9a50919b2e551ffbd8f8deaa"
+ },
+ {
+ "bytes": 581,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/unused_axiom-audit.log",
+ "receipt_sha256": "972d65c1ff8afddb2e2f9024fbaf972b80292d7b9c0d774f8d946dee28fc12f6",
+ "sha256": "972d65c1ff8afddb2e2f9024fbaf972b80292d7b9c0d774f8d946dee28fc12f6"
+ },
+ {
+ "bytes": 0,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/unused_axiom-compile.log",
+ "receipt_sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ {
+ "bytes": 665,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/weakened-witness-audit.log",
+ "receipt_sha256": "3da011e5e28b010ac0851c66e96f3c3d7f501dbb8febcf944f597f239d4412d4",
+ "sha256": "3da011e5e28b010ac0851c66e96f3c3d7f501dbb8febcf944f597f239d4412d4"
+ },
+ {
+ "bytes": 0,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/weakened-witness-compile.log",
+ "receipt_sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ {
+ "bytes": 1180,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/weakened-witness-contract.log",
+ "receipt_sha256": "727a132984645d32ac0f4607e61132c096ab4aa1dfe82bcfe9ad4756744d9346",
+ "sha256": "727a132984645d32ac0f4607e61132c096ab4aa1dfe82bcfe9ad4756744d9346"
+ },
+ {
+ "bytes": 24,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/witness-kernel.log",
+ "receipt_sha256": "ab7e01501bc759b00ba24bb39ea9d9bf5e475a179a06f32ee13f3cb1bbc2492d",
+ "sha256": "ab7e01501bc759b00ba24bb39ea9d9bf5e475a179a06f32ee13f3cb1bbc2492d"
+ },
+ {
+ "bytes": 0,
+ "matched": true,
+ "path": "formal/.lake/cbz-evidence/witness-type-contract.log",
+ "receipt_sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ }
+ ],
+ "kernel_manifest_bound": true,
+ "kernel_proof_count": 31,
+ "kernel_receipt": {
+ "bytes": 26957,
+ "path": "formal/.lake/cbz-evidence/receipt.json",
+ "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7"
+ },
+ "kernel_scope": "31 literal Main arithmetic statements only; no analytic/source parent closure",
+ "kernel_source_alignment": "NOT_INFERRED",
+ "lake_manifest": {
+ "bytes": 144,
+ "path": "formal/lake-manifest.json",
+ "sha256": "562d38ad95598486b2b592e6d072d5d3212735bfeb1cb6d8eb8ec04492522ba2"
+ },
+ "lake_packages": [],
+ "lean_source_files": [
+ {
+ "bytes": 586,
+ "path": "formal/UniversalLaw.lean",
+ "sha256": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e"
+ },
+ {
+ "bytes": 4409,
+ "path": "formal/UniversalLaw/Side24/ConeMoments.lean",
+ "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c"
+ },
+ {
+ "bytes": 1940,
+ "path": "formal/UniversalLaw/Side24/Endpoints.lean",
+ "sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd"
+ },
+ {
+ "bytes": 7025,
+ "path": "formal/UniversalLaw/Side24/Ledger.lean",
+ "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7"
+ }
+ ],
+ "manifest_alignment_status": "PENDING_INDEPENDENT_REVIEW",
+ "mathematical_status_promotion": false,
+ "namespaced_quarantine_source_manifest": {
+ "bytes": 109961,
+ "path": "cbz/evidence/website-foundation-20261029/source-manifest.json",
+ "sha256": "a02e5d55229b4bab97169e03c1c92a958556950bebeb4e28c8fb999d1484da0a"
+ },
+ "observed_at": "2026-10-29T18:22:05.059352+00:00",
+ "observed_head": "6fc021839072d8c34f41e18e77b0f618c53baa15",
+ "preservation_from_f20": {
+ "all_preserved": true,
+ "base_commit": "f20cc54d4d136e854608853372249882eb4c949f",
+ "count": 215,
+ "rows": [
+ {
+ "base_sha256": "a750779fc69cc1cb4163d585bfb0a9b175c7a4d34a1d108eddc21cdf580f111c",
+ "current_sha256": "a750779fc69cc1cb4163d585bfb0a9b175c7a4d34a1d108eddc21cdf580f111c",
+ "path": ".github/workflows/architecture-casefold-probe.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "f5b5c8f3580057e626f3ec15e55a7dcb2a2c5c897706f455f56e585e2a8e7289",
+ "current_sha256": "f5b5c8f3580057e626f3ec15e55a7dcb2a2c5c897706f455f56e585e2a8e7289",
+ "path": ".github/workflows/architecture-cli-boundary-regression.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "9b33eee757bae53966a151150bc62bc6aec13f9aa8226b4398dfa3362597de65",
+ "current_sha256": "9b33eee757bae53966a151150bc62bc6aec13f9aa8226b4398dfa3362597de65",
+ "path": ".github/workflows/architecture-runtime-acquisition.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "69044e14596bd26c870559543eb8960a8b71defaf3691d2fe209916f7cce8f9b",
+ "current_sha256": "69044e14596bd26c870559543eb8960a8b71defaf3691d2fe209916f7cce8f9b",
+ "path": ".github/workflows/canvas-reader-native-admission.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "1acbfa4a7e0bb56035e4cdd1d2acb2434e39e0aecf6ef74373552ae87518ba30",
+ "current_sha256": "1acbfa4a7e0bb56035e4cdd1d2acb2434e39e0aecf6ef74373552ae87518ba30",
+ "path": ".github/workflows/ci.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "db5fc4e94abc0b1ee41b0e6e7a55c9b955653e5b1fbb04c00e69975503b197d9",
+ "current_sha256": "db5fc4e94abc0b1ee41b0e6e7a55c9b955653e5b1fbb04c00e69975503b197d9",
+ "path": ".github/workflows/coordination-lock.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "b68b840d1363ebb63dd18bde32e25625a8386678495f13912260aef1ffd98cae",
+ "current_sha256": "b68b840d1363ebb63dd18bde32e25625a8386678495f13912260aef1ffd98cae",
+ "path": ".github/workflows/current-site-native-base-controls.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "21030e418c4b80bb542ff06c373f7d49cb52c184489ea8bd236c3b5c73b75bf9",
+ "current_sha256": "21030e418c4b80bb542ff06c373f7d49cb52c184489ea8bd236c3b5c73b75bf9",
+ "path": ".github/workflows/current-site-native-registry-controls.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "81b53ba0db931a25f4f322ab7e9b78f3fd21f86254c4e76da8d4ed4240ae8fef",
+ "current_sha256": "81b53ba0db931a25f4f322ab7e9b78f3fd21f86254c4e76da8d4ed4240ae8fef",
+ "path": ".github/workflows/current-site.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "8c1457a4cfb509a08930f04c8dbce342cb2c54b19cbc5578da311a8ecc240dbe",
+ "current_sha256": "8c1457a4cfb509a08930f04c8dbce342cb2c54b19cbc5578da311a8ecc240dbe",
+ "path": ".github/workflows/formal-verification.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "703278234fb3d6797a3267c162c8ea4fdaf7b09d7e9476b43d7d88927e56f9a9",
+ "current_sha256": "703278234fb3d6797a3267c162c8ea4fdaf7b09d7e9476b43d7d88927e56f9a9",
+ "path": ".github/workflows/h3-band-v2.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "bd59e6d06a5c7bee5f65eb9de9ea91281eb7a528f1654015f60e06b52bb80d0d",
+ "current_sha256": "bd59e6d06a5c7bee5f65eb9de9ea91281eb7a528f1654015f60e06b52bb80d0d",
+ "path": ".github/workflows/interface-runtime-preparation.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "90e7f6d4615b5359ed356204b6490be04d9efb5f30ef889a28c842b0f1beda65",
+ "current_sha256": "90e7f6d4615b5359ed356204b6490be04d9efb5f30ef889a28c842b0f1beda65",
+ "path": ".github/workflows/math-hypergraph.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "65ad6ac0e0082d648f10ced4d4f60b56c2b1ddaa39717a6843e64c1ea94cbf51",
+ "current_sha256": "65ad6ac0e0082d648f10ced4d4f60b56c2b1ddaa39717a6843e64c1ea94cbf51",
+ "path": ".github/workflows/museum-conditionals.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "0c6f348b0ca980abea7599b4f18e7554a776be5093a7f4a9215bed599d46b2b1",
+ "current_sha256": "0c6f348b0ca980abea7599b4f18e7554a776be5093a7f4a9215bed599d46b2b1",
+ "path": ".github/workflows/navigation.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "2f3ab9e29bf26df7eb971f441dc5b44228cde1e8b7dada3c08b6d0446fb10d85",
+ "current_sha256": "2f3ab9e29bf26df7eb971f441dc5b44228cde1e8b7dada3c08b6d0446fb10d85",
+ "path": ".github/workflows/node-status.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "f93565a18327e3a1f0cff4ba81575c241f137b29f3cc10e1bb8248fdafd41bd5",
+ "current_sha256": "f93565a18327e3a1f0cff4ba81575c241f137b29f3cc10e1bb8248fdafd41bd5",
+ "path": ".github/workflows/periodic-h0-pilot.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "d5b7cf329cd1f4c1bad9f0ad45bafbe48c9e9da3ce0df35106b1b012dc15a737",
+ "current_sha256": "d5b7cf329cd1f4c1bad9f0ad45bafbe48c9e9da3ce0df35106b1b012dc15a737",
+ "path": ".github/workflows/public-intake-controls.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "c8ee83ad38db05d8f0ce0a8ad944408ebac7e4f3a12b0d31fe4e270c46890c87",
+ "current_sha256": "c8ee83ad38db05d8f0ce0a8ad944408ebac7e4f3a12b0d31fe4e270c46890c87",
+ "path": ".github/workflows/public-intake.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "63bd9484d71a6ebeb6d8d4091d9e27b324d0ead34029195a137e4211f2bfaa9a",
+ "current_sha256": "63bd9484d71a6ebeb6d8d4091d9e27b324d0ead34029195a137e4211f2bfaa9a",
+ "path": ".github/workflows/public-shop.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "35e5159896e1032ce341beb2b30b6fbadb6ffdcebb6f551b2d8fc021034785ff",
+ "current_sha256": "35e5159896e1032ce341beb2b30b6fbadb6ffdcebb6f551b2d8fc021034785ff",
+ "path": ".github/workflows/public-vector-index.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "117da0c992e25b788acea640f1d621036e5beb07c8274ac29b5c0adf1e2cf3b0",
+ "current_sha256": "117da0c992e25b788acea640f1d621036e5beb07c8274ac29b5c0adf1e2cf3b0",
+ "path": ".github/workflows/reactor-v0-controls.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "fe34fc5463664df5e8bea6dc74750c6427b2aface585e7ca5b7f41799df6a107",
+ "current_sha256": "fe34fc5463664df5e8bea6dc74750c6427b2aface585e7ca5b7f41799df6a107",
+ "path": ".github/workflows/release-snapshot.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "dea19da2aa351946a31c7cad8066f9b96de1944297421ec7a10ab78e85029709",
+ "current_sha256": "dea19da2aa351946a31c7cad8066f9b96de1944297421ec7a10ab78e85029709",
+ "path": ".github/workflows/research-architecture.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "dc2ad770983a99e1956c9d2e749b78e1531e11e55ce3d969cac2019e5c36dbbb",
+ "current_sha256": "dc2ad770983a99e1956c9d2e749b78e1531e11e55ce3d969cac2019e5c36dbbb",
+ "path": ".github/workflows/semantic-memory-experiment.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "6c209e250d5e0853dff889fcf0b97b2fc9d7ae95d14de27b90fb45b90d7b978d",
+ "current_sha256": "6c209e250d5e0853dff889fcf0b97b2fc9d7ae95d14de27b90fb45b90d7b978d",
+ "path": ".github/workflows/site-graph-projection.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "92813f9b0f7e3f1761ea3571efc91a42e9f084f53881516db3f07222ada64267",
+ "current_sha256": "92813f9b0f7e3f1761ea3571efc91a42e9f084f53881516db3f07222ada64267",
+ "path": ".github/workflows/source-census.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "76b16677bdf2fb0e7f86b480e51d1c024dce5f1c011e7c1e4de8d88ebec0548b",
+ "current_sha256": "76b16677bdf2fb0e7f86b480e51d1c024dce5f1c011e7c1e4de8d88ebec0548b",
+ "path": ".github/workflows/st-contract-pilot.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "1f405e66666676b253f59424df163db787b01d6e4cb1df5225462fdc55ec839e",
+ "current_sha256": "1f405e66666676b253f59424df163db787b01d6e4cb1df5225462fdc55ec839e",
+ "path": ".github/workflows/universality-controls.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "ff8735658be98a8b983e2193da3101635c5bbe544520a46959cb8c52e46bf52c",
+ "current_sha256": "ff8735658be98a8b983e2193da3101635c5bbe544520a46959cb8c52e46bf52c",
+ "path": ".github/workflows/workspace-landing.yml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "cb366e3311608a921e0ad25291c92e6218573d74803747da9075aef7e4f8ba74",
+ "current_sha256": "cb366e3311608a921e0ad25291c92e6218573d74803747da9075aef7e4f8ba74",
+ "path": "experiments/board_capacity_probe_20261022/test_board_capacity_probe.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "44c93975535f9bd23290a9893f979c5830a77f0111b382a9a60a62a414dc3c98",
+ "current_sha256": "44c93975535f9bd23290a9893f979c5830a77f0111b382a9a60a62a414dc3c98",
+ "path": "experiments/board_capacity_probe_20261022/test_timestamp_offsets.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "1ddc48fccb81c2780e86e5bd8e9d5244ef875b2e8d36ae08d764744b92cc8a66",
+ "current_sha256": "1ddc48fccb81c2780e86e5bd8e9d5244ef875b2e8d36ae08d764744b92cc8a66",
+ "path": "experiments/h3_band_v2/test_h3_band_v2.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "65060e9633f5b6110bdb06be8e487d4a1c09a605f83238ead53e8ae68e64885d",
+ "current_sha256": "65060e9633f5b6110bdb06be8e487d4a1c09a605f83238ead53e8ae68e64885d",
+ "path": "experiments/periodic_h0/test_controls.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "1c59bf0e3a9434eab7cf4ecb5498f5d08b5ef715828c4d49742eb30bb7e9ca6f",
+ "current_sha256": "1c59bf0e3a9434eab7cf4ecb5498f5d08b5ef715828c4d49742eb30bb7e9ca6f",
+ "path": "experiments/periodic_h0/test_count_confidence.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "8f1151e904f93b61eb56fc7c971f94f1a46c178b7f9d2462f343bac8b20a9c68",
+ "current_sha256": "8f1151e904f93b61eb56fc7c971f94f1a46c178b7f9d2462f343bac8b20a9c68",
+ "path": "experiments/periodic_h0/test_count_confidence_certificate.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "0f91e8e998a5c0b3c7b4c47e3a38d12f981369a00f1e7f57da23e75a47f28cd5",
+ "current_sha256": "0f91e8e998a5c0b3c7b4c47e3a38d12f981369a00f1e7f57da23e75a47f28cd5",
+ "path": "experiments/periodic_h0/test_exact_barcode_certificate.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "c22930ef4fd0007ab8fd78079f4560cdad3043b210f3b074f7b0220d99039610",
+ "current_sha256": "c22930ef4fd0007ab8fd78079f4560cdad3043b210f3b074f7b0220d99039610",
+ "path": "experiments/periodic_h0/test_exact_h0.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "a25637323989837d56e3228ce35cef0592c77842b01386a629a2b4d295d007cd",
+ "current_sha256": "a25637323989837d56e3228ce35cef0592c77842b01386a629a2b4d295d007cd",
+ "path": "experiments/periodic_h0/test_experiment.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "aa6ea3092a43a374e41c57618c77b5a12063d080689985647ac1e92abe93b185",
+ "current_sha256": "aa6ea3092a43a374e41c57618c77b5a12063d080689985647ac1e92abe93b185",
+ "path": "experiments/periodic_h0/test_finite_certificate.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "bc5a8a47e35e16bc969637ebada47e26f7555563776e581e098bd4511de1e287",
+ "current_sha256": "bc5a8a47e35e16bc969637ebada47e26f7555563776e581e098bd4511de1e287",
+ "path": "experiments/periodic_h0/test_finite_count_loss.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "e4f56f1049d5b0377e2e756efeb0457aaade2f37bb0cdfb7cac942c75dfe667e",
+ "current_sha256": "e4f56f1049d5b0377e2e756efeb0457aaade2f37bb0cdfb7cac942c75dfe667e",
+ "path": "experiments/periodic_h0/test_finite_count_loss_certificate.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "206db755ebacbd99ae76148492be58c462debd6f924afc401a546626dbb78459",
+ "current_sha256": "206db755ebacbd99ae76148492be58c462debd6f924afc401a546626dbb78459",
+ "path": "experiments/periodic_h0/test_gaussian_coupling.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "26d032022b6f0cfb4b2b4e2aea148bc0d032dca10ecf0c099c958bd13d0d67a0",
+ "current_sha256": "26d032022b6f0cfb4b2b4e2aea148bc0d032dca10ecf0c099c958bd13d0d67a0",
+ "path": "experiments/periodic_h0/test_gaussian_coupling_certificate.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "9fa830767afe3f3dc23c79a28bde0886e5df652843758675c6b0d32d7a0f1bd7",
+ "current_sha256": "9fa830767afe3f3dc23c79a28bde0886e5df652843758675c6b0d32d7a0f1bd7",
+ "path": "experiments/periodic_h0/test_gaussian_tail.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "d127f2b8f6f4b5c483755904ad3b08151b0e38cf1416a0bee669f88bb36ce921",
+ "current_sha256": "d127f2b8f6f4b5c483755904ad3b08151b0e38cf1416a0bee669f88bb36ce921",
+ "path": "experiments/periodic_h0/test_gaussian_tail_certificate.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "ef280d1f52e7fccdf86747744da7ad8a05c172c61e5f1f085f9544625f9dd9d1",
+ "current_sha256": "ef280d1f52e7fccdf86747744da7ad8a05c172c61e5f1f085f9544625f9dd9d1",
+ "path": "experiments/periodic_h0/test_hessian_grid_certificate.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "9de6df341361bc8cc13d8e300003800f99b2b91d9119898b836a7d40d72b0419",
+ "current_sha256": "9de6df341361bc8cc13d8e300003800f99b2b91d9119898b836a7d40d72b0419",
+ "path": "experiments/periodic_h0/test_hessian_grid_core.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "d04d9ea01c46a2a5bbea86a0f264668cf2a2d385f2ab7a35103bc22f4430fb36",
+ "current_sha256": "d04d9ea01c46a2a5bbea86a0f264668cf2a2d385f2ab7a35103bc22f4430fb36",
+ "path": "experiments/periodic_h0/test_mean_adaptive_confidence.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "b1b2c37a781fcf0f004e850f697d313929776b1ad3fc66541a4b620cfd3cf426",
+ "current_sha256": "b1b2c37a781fcf0f004e850f697d313929776b1ad3fc66541a4b620cfd3cf426",
+ "path": "experiments/periodic_h0/test_nodal_certificate.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "5d2e9c2aa178c3d280d715c692f3204b98cac11e55345e00e450c419ef295bdf",
+ "current_sha256": "5d2e9c2aa178c3d280d715c692f3204b98cac11e55345e00e450c419ef295bdf",
+ "path": "experiments/periodic_h0/test_nodal_core.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "218a924692d6970044b0d0197a2e0bc41061a752f0e8431cac155a5eb7fe5dd9",
+ "current_sha256": "218a924692d6970044b0d0197a2e0bc41061a752f0e8431cac155a5eb7fe5dd9",
+ "path": "experiments/periodic_h0/test_refinement.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "00d6cef9c34b7ce255da89bdbf6ae3415fd113beca105fe880d751dca2d98a8b",
+ "current_sha256": "00d6cef9c34b7ce255da89bdbf6ae3415fd113beca105fe880d751dca2d98a8b",
+ "path": "experiments/periodic_h0/test_runner.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "142ea2c601c1e676c14d346e206313f6833282f0407e635961def375e8f1ffa4",
+ "current_sha256": "142ea2c601c1e676c14d346e206313f6833282f0407e635961def375e8f1ffa4",
+ "path": "experiments/periodic_h0/test_word_polynomial.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "96d7fc07667cd4901cb410df6636aefa99a332c273d0799b9f99ad06439ad0e5",
+ "current_sha256": "96d7fc07667cd4901cb410df6636aefa99a332c273d0799b9f99ad06439ad0e5",
+ "path": "experiments/periodic_h0/test_word_polynomial_certificate.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "8beb2b19a3ce37175521113637923b3a9a925b14915ef1cb0bd5a8431ebb88b1",
+ "current_sha256": "8beb2b19a3ce37175521113637923b3a9a925b14915ef1cb0bd5a8431ebb88b1",
+ "path": "experiments/reactor_v0/test_reactor_v0.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "1accd6a4c5d4f61e8f50a79694d12dbff93dc0e4fdf517784b1028d5ee0480a2",
+ "current_sha256": "1accd6a4c5d4f61e8f50a79694d12dbff93dc0e4fdf517784b1028d5ee0480a2",
+ "path": "experiments/universality/test_amplitude_mixture_falsifier.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "dbfa528adba5edc3bdf10cc5ea252a65c0c196d2f8113d74140d6253b80e7874",
+ "current_sha256": "dbfa528adba5edc3bdf10cc5ea252a65c0c196d2f8113d74140d6253b80e7874",
+ "path": "experiments/universality/test_amplitude_process_controls.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "2b3654a4c1e48e5ebbcc6e046991fdb8e688c86aaf63b44f40ffbc6dea8aec7d",
+ "current_sha256": "2b3654a4c1e48e5ebbcc6e046991fdb8e688c86aaf63b44f40ffbc6dea8aec7d",
+ "path": "experiments/universality/test_fold_controls.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "c43592075a8f3d6bac6706e962c6c214ffc2700cfdfd3b65844112601ee7e3eb",
+ "current_sha256": "c43592075a8f3d6bac6706e962c6c214ffc2700cfdfd3b65844112601ee7e3eb",
+ "path": "experiments/universality/test_models.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "fc8c329138d6c942bfb2c8a3d6bff2f66145426e6ae011808403a39a9ec006d3",
+ "current_sha256": "fc8c329138d6c942bfb2c8a3d6bff2f66145426e6ae011808403a39a9ec006d3",
+ "path": "experiments/universality/test_pairwise_field_controls.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "65c5bd0a757bb4822a83dd15b4998ac6e5e61b26a2de33598e37b0242528a209",
+ "current_sha256": "65c5bd0a757bb4822a83dd15b4998ac6e5e61b26a2de33598e37b0242528a209",
+ "path": "experiments/universality/test_pilot.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "e658a8cbb486c2c3e46a52cb837f58bb1105c5ed6bc1f57589add7cdc0c698b4",
+ "current_sha256": "e658a8cbb486c2c3e46a52cb837f58bb1105c5ed6bc1f57589add7cdc0c698b4",
+ "path": "experiments/universality/test_published.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "000a99a70a635ca04a1bbd29b248352526a31316a0c030388cdabce1d2163043",
+ "current_sha256": "000a99a70a635ca04a1bbd29b248352526a31316a0c030388cdabce1d2163043",
+ "path": "experiments/zeta_fold_exploration/test_exact.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "ff873c910743662d932f5e69903eda62c713518792dadc36ee7c7298fe08d9c7",
+ "current_sha256": "ff873c910743662d932f5e69903eda62c713518792dadc36ee7c7298fe08d9c7",
+ "path": "experiments/zeta_fold_exploration/test_numeric.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "059fcf3b501e2a6e73b3c20c6294eb57467ffc9118db696e05c8c3fcd7b2fa75",
+ "current_sha256": "059fcf3b501e2a6e73b3c20c6294eb57467ffc9118db696e05c8c3fcd7b2fa75",
+ "path": "formal/ALIGNMENT.md",
+ "preserved": true
+ },
+ {
+ "base_sha256": "342d4efb374fea31c39e51f8f6bcdbc50d7fb5fea1fd393eda21afff92c62fb8",
+ "current_sha256": "342d4efb374fea31c39e51f8f6bcdbc50d7fb5fea1fd393eda21afff92c62fb8",
+ "path": "formal/GLOSSARY.md",
+ "preserved": true
+ },
+ {
+ "base_sha256": "137e7c7ed44d732042d803eb4a0ee75f9ddc6475950a2bb6226a7711a44be14b",
+ "current_sha256": "137e7c7ed44d732042d803eb4a0ee75f9ddc6475950a2bb6226a7711a44be14b",
+ "path": "formal/README.md",
+ "preserved": true
+ },
+ {
+ "base_sha256": "54d32104aa012e917ef40b73fa3a40228d023249b339cf30fe4bdb7dcbfed414",
+ "current_sha256": "54d32104aa012e917ef40b73fa3a40228d023249b339cf30fe4bdb7dcbfed414",
+ "path": "formal/REVIEW_LANE.md",
+ "preserved": true
+ },
+ {
+ "base_sha256": "fd06700628b1fbc81c5cfe3786aaa455032375bcb879914f068a66b726802a17",
+ "current_sha256": "fd06700628b1fbc81c5cfe3786aaa455032375bcb879914f068a66b726802a17",
+ "path": "formal/SCOPE.md",
+ "preserved": true
+ },
+ {
+ "base_sha256": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e",
+ "current_sha256": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e",
+ "path": "formal/UniversalLaw.lean",
+ "preserved": true
+ },
+ {
+ "base_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c",
+ "current_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c",
+ "path": "formal/UniversalLaw/Side24/ConeMoments.lean",
+ "preserved": true
+ },
+ {
+ "base_sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd",
+ "current_sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd",
+ "path": "formal/UniversalLaw/Side24/Endpoints.lean",
+ "preserved": true
+ },
+ {
+ "base_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7",
+ "current_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7",
+ "path": "formal/UniversalLaw/Side24/Ledger.lean",
+ "preserved": true
+ },
+ {
+ "base_sha256": "562d38ad95598486b2b592e6d072d5d3212735bfeb1cb6d8eb8ec04492522ba2",
+ "current_sha256": "562d38ad95598486b2b592e6d072d5d3212735bfeb1cb6d8eb8ec04492522ba2",
+ "path": "formal/lake-manifest.json",
+ "preserved": true
+ },
+ {
+ "base_sha256": "58f0fa6864cc03e9bcbef2d8c0404e9f3385a30a6124000454319367906cbe4a",
+ "current_sha256": "58f0fa6864cc03e9bcbef2d8c0404e9f3385a30a6124000454319367906cbe4a",
+ "path": "formal/lakefile.toml",
+ "preserved": true
+ },
+ {
+ "base_sha256": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b",
+ "current_sha256": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b",
+ "path": "formal/lean-toolchain",
+ "preserved": true
+ },
+ {
+ "base_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0",
+ "current_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0",
+ "path": "formal/manifest.json",
+ "preserved": true
+ },
+ {
+ "base_sha256": "333ca71e7c676cee89e5d01cd61999c21bb0584e41d6bdacb18afa410109f95d",
+ "current_sha256": "333ca71e7c676cee89e5d01cd61999c21bb0584e41d6bdacb18afa410109f95d",
+ "path": "formal/reviews/README.md",
+ "preserved": true
+ },
+ {
+ "base_sha256": "e722e928ca43c16981e063d8eb1c91e9bf8c683241d9dcf156400a419e72feb3",
+ "current_sha256": "e722e928ca43c16981e063d8eb1c91e9bf8c683241d9dcf156400a419e72feb3",
+ "path": "formal/reviews/TEMPLATE_alignment_review.json",
+ "preserved": true
+ },
+ {
+ "base_sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811",
+ "current_sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811",
+ "path": "formal/sources/side24_v1/ENCLOSURE.json",
+ "preserved": true
+ },
+ {
+ "base_sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769",
+ "current_sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769",
+ "path": "formal/sources/side24_v1/PROOF.md",
+ "preserved": true
+ },
+ {
+ "base_sha256": "3dea29af8ecad450e29533da4b918e033360924fd1032fa4d3fd93331fe0c017",
+ "current_sha256": "3dea29af8ecad450e29533da4b918e033360924fd1032fa4d3fd93331fe0c017",
+ "path": "incoming/side24-chart-claude-20260926/regeneration/test_run.txt",
+ "preserved": true
+ },
+ {
+ "base_sha256": "8c218ee02ade98db363a7710960344e2f33b2492f967129c5a60900e4b7e317d",
+ "current_sha256": "8c218ee02ade98db363a7710960344e2f33b2492f967129c5a60900e4b7e317d",
+ "path": "reviews/zeta_fold_slice_c_openai_20261026/logs/test_numeric.stderr",
+ "preserved": true
+ },
+ {
+ "base_sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "current_sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "path": "reviews/zeta_fold_slice_c_openai_20261026/logs/test_numeric.stdout",
+ "preserved": true
+ },
+ {
+ "base_sha256": "3b36fc20981231058ea1b33d4c582e3de8656779b1f2f8f9dea0ee2c8e6e33ff",
+ "current_sha256": "3b36fc20981231058ea1b33d4c582e3de8656779b1f2f8f9dea0ee2c8e6e33ff",
+ "path": "reviews/zeta_fold_slice_c_openai_20261026/scripts/test_evidence_controls.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "b3b7a6f2457545a1555edb9eb336acefa40498afc551d547ba604aa5a9617c0c",
+ "current_sha256": "b3b7a6f2457545a1555edb9eb336acefa40498afc551d547ba604aa5a9617c0c",
+ "path": "reviews/zeta_fold_slice_c_rerun_20261019/logs/test_numeric.stderr",
+ "preserved": true
+ },
+ {
+ "base_sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "current_sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "path": "reviews/zeta_fold_slice_c_rerun_20261019/logs/test_numeric.stdout",
+ "preserved": true
+ },
+ {
+ "base_sha256": "ee9149d49a566fe1c37ed1af0efbf7bf7cb6d686c5dc5ed5ebe2c16572acbd58",
+ "current_sha256": "ee9149d49a566fe1c37ed1af0efbf7bf7cb6d686c5dc5ed5ebe2c16572acbd58",
+ "path": "tests/casefold/test_source_isolation_casefold.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "4286136d8b24eca9b26d1e7b12933bed5b0961809b362a60c3af7bf46e6ed4b6",
+ "current_sha256": "4286136d8b24eca9b26d1e7b12933bed5b0961809b362a60c3af7bf46e6ed4b6",
+ "path": "tests/fixtures/atlas_formal_build_3b39/test_formal_gate.py.txt",
+ "preserved": true
+ },
+ {
+ "base_sha256": "26c5cf756daddb5b442f4e8affa942346efe39f8a312709b0b2eba5e7005b47a",
+ "current_sha256": "26c5cf756daddb5b442f4e8affa942346efe39f8a312709b0b2eba5e7005b47a",
+ "path": "tests/test_active_board_routing.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "a403c84cd547a342876ac21b3ebd3eb456620d30c5eec0d79e7ccd509fd60b04",
+ "current_sha256": "a403c84cd547a342876ac21b3ebd3eb456620d30c5eec0d79e7ccd509fd60b04",
+ "path": "tests/test_architecture_artifact_index.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "523d03dffb84656fdeebd62c73a5f479ecc0b416ff3ec94d4881c8005fcacfcf",
+ "current_sha256": "523d03dffb84656fdeebd62c73a5f479ecc0b416ff3ec94d4881c8005fcacfcf",
+ "path": "tests/test_architecture_binding.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "d36b8b17e2354c14b60b5d3c48580ea15cab3b152960bf62764553c70f655d2a",
+ "current_sha256": "d36b8b17e2354c14b60b5d3c48580ea15cab3b152960bf62764553c70f655d2a",
+ "path": "tests/test_architecture_claim_selection_transfer.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "8b45b7d60f86d743cfbb8e3706a1d32d049a7fc557656f243bbbc5ebb97a578c",
+ "current_sha256": "8b45b7d60f86d743cfbb8e3706a1d32d049a7fc557656f243bbbc5ebb97a578c",
+ "path": "tests/test_architecture_cli_boundaries.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "f95f99bd044981aa7928a7bcad25a4473420a8935e16b7e8ff6288b8354b1894",
+ "current_sha256": "f95f99bd044981aa7928a7bcad25a4473420a8935e16b7e8ff6288b8354b1894",
+ "path": "tests/test_architecture_evidence_adapter.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "1038f3638b4e3772d7b96526d7721f8d4d6d772a70166ab80e9bc9f66b610a7e",
+ "current_sha256": "1038f3638b4e3772d7b96526d7721f8d4d6d772a70166ab80e9bc9f66b610a7e",
+ "path": "tests/test_architecture_evidence_path.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "dac82c4827322fb887ebf887b815a51a69f5e7ba47c1357cb1457f5b70fb2387",
+ "current_sha256": "dac82c4827322fb887ebf887b815a51a69f5e7ba47c1357cb1457f5b70fb2387",
+ "path": "tests/test_architecture_evidence_topology_diagnostic.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "dd3c5b3f2011ae3f7582514eae0fb79f25257d5bf54f40a99585d21dff65116e",
+ "current_sha256": "dd3c5b3f2011ae3f7582514eae0fb79f25257d5bf54f40a99585d21dff65116e",
+ "path": "tests/test_architecture_graph_artifact_readback.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "92cf35857d9c6418c5fd5d536d261c06b72bdd18dcea4d16cd0faf4fc8cacc1d",
+ "current_sha256": "92cf35857d9c6418c5fd5d536d261c06b72bdd18dcea4d16cd0faf4fc8cacc1d",
+ "path": "tests/test_architecture_graph_export.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "56b01ae5ae5faf37675ee84771d81cb81a13c2224658067d37220724013fc84a",
+ "current_sha256": "56b01ae5ae5faf37675ee84771d81cb81a13c2224658067d37220724013fc84a",
+ "path": "tests/test_architecture_receipt.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "6f9281005cf62b2d061f3a0381fa6c1b79999dbb5813758ae1f4fd0f870fbe78",
+ "current_sha256": "6f9281005cf62b2d061f3a0381fa6c1b79999dbb5813758ae1f4fd0f870fbe78",
+ "path": "tests/test_architecture_sandbox.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "ad151ccd1871acc1b073272625e2b962ce3a7ee04082676453911df83b8b4ab2",
+ "current_sha256": "ad151ccd1871acc1b073272625e2b962ce3a7ee04082676453911df83b8b4ab2",
+ "path": "tests/test_architecture_side24_coefficient_binding.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "80ac5d83af8204964de454f3df89933e6b21c2149ac44e3e61483e3118f1187f",
+ "current_sha256": "80ac5d83af8204964de454f3df89933e6b21c2149ac44e3e61483e3118f1187f",
+ "path": "tests/test_architecture_site_graph_bundle.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "70796eb7986308b4cb431b34d841e22ae474b58c1fdc393bd5f60c724ef7e1c3",
+ "current_sha256": "70796eb7986308b4cb431b34d841e22ae474b58c1fdc393bd5f60c724ef7e1c3",
+ "path": "tests/test_architecture_unittest_timing_probe.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "8539446ca52505a1dbb8edbd20217023367cbfd4709aea9b1f04c94c39a76f6f",
+ "current_sha256": "8539446ca52505a1dbb8edbd20217023367cbfd4709aea9b1f04c94c39a76f6f",
+ "path": "tests/test_atlas_controls.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "e87c54ac2c263c6bcfd6836023ac623fdab3ba52202e90c40dead7cbdb8141c6",
+ "current_sha256": "e87c54ac2c263c6bcfd6836023ac623fdab3ba52202e90c40dead7cbdb8141c6",
+ "path": "tests/test_atlas_focus_geometry.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "06d917654cfb99af48e6fb6de7a85ec20be2fbc21ffe8c1d3987ef0cdb8a2913",
+ "current_sha256": "06d917654cfb99af48e6fb6de7a85ec20be2fbc21ffe8c1d3987ef0cdb8a2913",
+ "path": "tests/test_atlas_formal_evidence.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "67bd4e6a55d9e02a1108d73438777f36e4c2b7357a28a9b690bd4c909bbd1148",
+ "current_sha256": "67bd4e6a55d9e02a1108d73438777f36e4c2b7357a28a9b690bd4c909bbd1148",
+ "path": "tests/test_atlas_formal_evidence_build.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "31c6b6e66f15874eacdafbf23adb948473927401643196cdab2e92a05b1f60ed",
+ "current_sha256": "31c6b6e66f15874eacdafbf23adb948473927401643196cdab2e92a05b1f60ed",
+ "path": "tests/test_atlas_formal_source_bridge.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "ac10c9e6bf7530ea877f18caf1bc1f32caab89445e0b6e5d2bffe401ff2c882b",
+ "current_sha256": "ac10c9e6bf7530ea877f18caf1bc1f32caab89445e0b6e5d2bffe401ff2c882b",
+ "path": "tests/test_atlas_formal_source_bridge.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "7c6aa238a518109411b3e61d348f53e8536a03d2ef0fdbdc26b7cf19437eac89",
+ "current_sha256": "7c6aa238a518109411b3e61d348f53e8536a03d2ef0fdbdc26b7cf19437eac89",
+ "path": "tests/test_atlas_reader_experience.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "4a6bcbd588113a9fe0864e0a56cd8cc56f715b1b7ec5ded018d8860a600446b5",
+ "current_sha256": "4a6bcbd588113a9fe0864e0a56cd8cc56f715b1b7ec5ded018d8860a600446b5",
+ "path": "tests/test_atlas_reader_scroll.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "d711415a3a951cf6fad923ba944b744e0a76e39d4f21b62132f89394f054f8e1",
+ "current_sha256": "d711415a3a951cf6fad923ba944b744e0a76e39d4f21b62132f89394f054f8e1",
+ "path": "tests/test_atlas_relationships.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "741a954dbfb327c2e965a3fce226a02d17e1bf968366c62ed0b4a8510cc0b77c",
+ "current_sha256": "741a954dbfb327c2e965a3fce226a02d17e1bf968366c62ed0b4a8510cc0b77c",
+ "path": "tests/test_atlas_resilience.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "b9b9af683bad0a5c894e5aa700d8edf85e891113026cdc6a58207df5ba1133a1",
+ "current_sha256": "b9b9af683bad0a5c894e5aa700d8edf85e891113026cdc6a58207df5ba1133a1",
+ "path": "tests/test_atlas_spatial.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "06056d5bf6b88d700995905fa434aab054ae6c27fd910911cf8f994df3a4a92e",
+ "current_sha256": "06056d5bf6b88d700995905fa434aab054ae6c27fd910911cf8f994df3a4a92e",
+ "path": "tests/test_atlas_spatial_labels.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "0fca44ed2dfdf77be1551094d7cb9e3f3713bc6cffb43bf86500c5c90e5b0f1e",
+ "current_sha256": "0fca44ed2dfdf77be1551094d7cb9e3f3713bc6cffb43bf86500c5c90e5b0f1e",
+ "path": "tests/test_board_links.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "2ac670b1ae824d5e665560c983eecfa0392ec4d381d0ff80ed26b5318aba5520",
+ "current_sha256": "2ac670b1ae824d5e665560c983eecfa0392ec4d381d0ff80ed26b5318aba5520",
+ "path": "tests/test_board_links_raw_json.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "328e342e663d504c4b2ca1c7bba485ce02bcc6295e74592ada8e2fbb721703a3",
+ "current_sha256": "328e342e663d504c4b2ca1c7bba485ce02bcc6295e74592ada8e2fbb721703a3",
+ "path": "tests/test_board_links_url_errors.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "f101c8a3c76c91ca4e67910cd754e676d2eefeae043f46219663937c92c09e0a",
+ "current_sha256": "f101c8a3c76c91ca4e67910cd754e676d2eefeae043f46219663937c92c09e0a",
+ "path": "tests/test_brand_identity.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "6bbd9481758d0d5b6741a7ed13ba3b7a04125108378b0c1b98a61e15aed07104",
+ "current_sha256": "6bbd9481758d0d5b6741a7ed13ba3b7a04125108378b0c1b98a61e15aed07104",
+ "path": "tests/test_catalog_query.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "68182d38f365d7ef98da6c8c1e6c677f16d0657e7e158df211e3e12b39b32ad0",
+ "current_sha256": "68182d38f365d7ef98da6c8c1e6c677f16d0657e7e158df211e3e12b39b32ad0",
+ "path": "tests/test_compare_categories.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "4bca6e043b16ee10876aec19d29696a16e630ce57cffb5ca995e51abac32155d",
+ "current_sha256": "4bca6e043b16ee10876aec19d29696a16e630ce57cffb5ca995e51abac32155d",
+ "path": "tests/test_compare_source_panel.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "543371b0afb87d40d599a07f90120cf4a4cc787c81ddc50190c6a4c09d381687",
+ "current_sha256": "543371b0afb87d40d599a07f90120cf4a4cc787c81ddc50190c6a4c09d381687",
+ "path": "tests/test_coordination_lock_check.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "11166b8b5a778a1aebc87026a4e8c35d5c733db777e925dc979bbf89148658ac",
+ "current_sha256": "11166b8b5a778a1aebc87026a4e8c35d5c733db777e925dc979bbf89148658ac",
+ "path": "tests/test_current_inventory_acquisition.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "680378befe3c0cb264241f35a0222bdcb2dc8a541be17a7b6dc1e0e539ba0595",
+ "current_sha256": "680378befe3c0cb264241f35a0222bdcb2dc8a541be17a7b6dc1e0e539ba0595",
+ "path": "tests/test_current_inventory_acquisition.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "017e70f834f5757e0766302226e077b7c4b92ba9b4ea321d2c01cc5176366b14",
+ "current_sha256": "017e70f834f5757e0766302226e077b7c4b92ba9b4ea321d2c01cc5176366b14",
+ "path": "tests/test_current_observation_coherence.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "15e8e28428477c582239bd635943387edfe739d8860c488305e3611b59385150",
+ "current_sha256": "15e8e28428477c582239bd635943387edfe739d8860c488305e3611b59385150",
+ "path": "tests/test_current_site.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "ad16d1cbf37468409d8fbf3ae95e3511257dfd057f9ad771d21e91811409eecd",
+ "current_sha256": "ad16d1cbf37468409d8fbf3ae95e3511257dfd057f9ad771d21e91811409eecd",
+ "path": "tests/test_current_site_browser_contract.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "356819ec74e00fa78e2a4c788523556cce0bef4303dbd6be35f4b6fc6015aa51",
+ "current_sha256": "356819ec74e00fa78e2a4c788523556cce0bef4303dbd6be35f4b6fc6015aa51",
+ "path": "tests/test_current_site_build.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "abe09b871643bfd9e7ca0d7d8404f1670d14a64cff4fdbf1478ba4d9560285c0",
+ "current_sha256": "abe09b871643bfd9e7ca0d7d8404f1670d14a64cff4fdbf1478ba4d9560285c0",
+ "path": "tests/test_current_site_data.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "11eaa3818c4e9930c933ce45915e74c39fb104b7d800b6c59b09f51f8a7a9e67",
+ "current_sha256": "11eaa3818c4e9930c933ce45915e74c39fb104b7d800b6c59b09f51f8a7a9e67",
+ "path": "tests/test_current_site_history.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "ff6d8a5e6eb1fc051ce9f3a57e28e3c654c186c3fdd77f193596ffc518b2787b",
+ "current_sha256": "ff6d8a5e6eb1fc051ce9f3a57e28e3c654c186c3fdd77f193596ffc518b2787b",
+ "path": "tests/test_current_site_native_base.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "32da9cfb1684817a69030a20e85356bf571697e7dfc7532c417839915364a9cc",
+ "current_sha256": "32da9cfb1684817a69030a20e85356bf571697e7dfc7532c417839915364a9cc",
+ "path": "tests/test_current_site_native_registry.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "2f7870085cb224d6458c81238f3de6dc91acff8c73ca4cfe9657affa134ffd1f",
+ "current_sha256": "2f7870085cb224d6458c81238f3de6dc91acff8c73ca4cfe9657affa134ffd1f",
+ "path": "tests/test_current_site_persistent_status.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "60b4cec31a382dfc250ae3d29627e89ce6653ec27220fcb975509a054aabf2e8",
+ "current_sha256": "60b4cec31a382dfc250ae3d29627e89ce6653ec27220fcb975509a054aabf2e8",
+ "path": "tests/test_current_site_publication.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "f3e4c8ddda311673e0d6fb8a6ac51b52a518351024d10d1d6542ea2476120aa7",
+ "current_sha256": "f3e4c8ddda311673e0d6fb8a6ac51b52a518351024d10d1d6542ea2476120aa7",
+ "path": "tests/test_current_site_resume.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "75fbc86730163b9dd98308aa6031c1601bd63dc75aa9c22660407f3789cf6fe2",
+ "current_sha256": "75fbc86730163b9dd98308aa6031c1601bd63dc75aa9c22660407f3789cf6fe2",
+ "path": "tests/test_current_site_shell.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "34be490c59e5f66d76ba4813f23461c1feff00a76ac4bd3de7b9ad09eda2a7e4",
+ "current_sha256": "34be490c59e5f66d76ba4813f23461c1feff00a76ac4bd3de7b9ad09eda2a7e4",
+ "path": "tests/test_current_site_stylesheet_order.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "d22b6b9239c1fd7ec36977e5f155653bc8718c73c723ddcb25c3e70acc6c0dd4",
+ "current_sha256": "d22b6b9239c1fd7ec36977e5f155653bc8718c73c723ddcb25c3e70acc6c0dd4",
+ "path": "tests/test_curvature_export.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "af6936b60006b527b3b68ed9b695af923b166683f2a7c5921b651be7059021a1",
+ "current_sha256": "af6936b60006b527b3b68ed9b695af923b166683f2a7c5921b651be7059021a1",
+ "path": "tests/test_d5_shrinking_witness.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "75edf94d9b6c45ce18523862b6e312cc44b72aca38f1e7eb6f32a9876626e73b",
+ "current_sha256": "75edf94d9b6c45ce18523862b6e312cc44b72aca38f1e7eb6f32a9876626e73b",
+ "path": "tests/test_dependency_source_binding.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "a15bcb32b05ebdd2ea6152166153d6c66584223a06f5e10a327a8036e553617a",
+ "current_sha256": "a15bcb32b05ebdd2ea6152166153d6c66584223a06f5e10a327a8036e553617a",
+ "path": "tests/test_dependency_viewer.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "5bd868e54c42a20b1bc7245ec4262be3c844d3e51807c15d16a0e2b86a22d4a5",
+ "current_sha256": "5bd868e54c42a20b1bc7245ec4262be3c844d3e51807c15d16a0e2b86a22d4a5",
+ "path": "tests/test_drive_id_scan.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "62d80b88fcdad4c4dfef151f1551197648113db92a3d1d16be747b2855376c75",
+ "current_sha256": "62d80b88fcdad4c4dfef151f1551197648113db92a3d1d16be747b2855376c75",
+ "path": "tests/test_dropbox_reconcile.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "b75c262c2376bd5952c32354408ae8ed8370cf982788ed8f0a4b1839f72cf687",
+ "current_sha256": "b75c262c2376bd5952c32354408ae8ed8370cf982788ed8f0a4b1839f72cf687",
+ "path": "tests/test_evidence_path.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "63e59fadac910846b8425975e67230a055992c2087c32a8cd2341e01948be3be",
+ "current_sha256": "63e59fadac910846b8425975e67230a055992c2087c32a8cd2341e01948be3be",
+ "path": "tests/test_exact_sample_shrinking_bin.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "9ff140148fbeb088c664f482a754661819c4f609f8180b2ad34df5f9a696a2d7",
+ "current_sha256": "9ff140148fbeb088c664f482a754661819c4f609f8180b2ad34df5f9a696a2d7",
+ "path": "tests/test_explore_models.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "c820936cbf60c31262bb1a24f1548e31a2e471b28ea78cdee58d8e4f1bb36baa",
+ "current_sha256": "c820936cbf60c31262bb1a24f1548e31a2e471b28ea78cdee58d8e4f1bb36baa",
+ "path": "tests/test_figure_png.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "0751ca299c72a821c2130e66fb00cd9f6e79cb9fd5a9a4147b70bfdf99ddd353",
+ "current_sha256": "0751ca299c72a821c2130e66fb00cd9f6e79cb9fd5a9a4147b70bfdf99ddd353",
+ "path": "tests/test_formal_execution_context.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "2b13ad83b03d2b45f4be70ce03af597c195563a1ed0bd3983a2b7040068a3a84",
+ "current_sha256": "2b13ad83b03d2b45f4be70ce03af597c195563a1ed0bd3983a2b7040068a3a84",
+ "path": "tests/test_formal_gate.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "3d29a169da19ab648b65c3939d244b211233ea705bd50b538e8d1953f0a88086",
+ "current_sha256": "3d29a169da19ab648b65c3939d244b211233ea705bd50b538e8d1953f0a88086",
+ "path": "tests/test_formal_workflow_shell.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "b0a48735ef7e0f5f45cf83e68c65deb0939eff6fb117c939a98282a715e1460f",
+ "current_sha256": "b0a48735ef7e0f5f45cf83e68c65deb0939eff6fb117c939a98282a715e1460f",
+ "path": "tests/test_graph_artifact_bindings_v2.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "e151abf4eae86384305d17ddba07d16e31b2dc062786054e975488a5e65e2828",
+ "current_sha256": "e151abf4eae86384305d17ddba07d16e31b2dc062786054e975488a5e65e2828",
+ "path": "tests/test_graph_binding_check.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "faf20763f61489c28783da73d8b92374191f7c41f3cf88a241ca57adffc51366",
+ "current_sha256": "faf20763f61489c28783da73d8b92374191f7c41f3cf88a241ca57adffc51366",
+ "path": "tests/test_library_discovery.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "980c6576281a799eb170056896050c265461d0913a02c4f4001fa7e9c381fc30",
+ "current_sha256": "980c6576281a799eb170056896050c265461d0913a02c4f4001fa7e9c381fc30",
+ "path": "tests/test_library_source_search.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "71a1fcba1dd118d91326289cd788bca1c8a1fe673ffd267eab0790974ea73190",
+ "current_sha256": "71a1fcba1dd118d91326289cd788bca1c8a1fe673ffd267eab0790974ea73190",
+ "path": "tests/test_living_project_validation.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "83c8b3d0a8e2e95f06a697fea846fa2088a41e81809c64fc3e201665757cd223",
+ "current_sha256": "83c8b3d0a8e2e95f06a697fea846fa2088a41e81809c64fc3e201665757cd223",
+ "path": "tests/test_measurement_model.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "ec358beae99c477ad8f4272fd50813ef7d8874e13b9097e8ba9f15bac79c173f",
+ "current_sha256": "ec358beae99c477ad8f4272fd50813ef7d8874e13b9097e8ba9f15bac79c173f",
+ "path": "tests/test_museum_conditionals.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "48310479d97a5b6c116d5a4a0f4bf925e1faf0e70da54775166ad2f1ed241634",
+ "current_sha256": "48310479d97a5b6c116d5a4a0f4bf925e1faf0e70da54775166ad2f1ed241634",
+ "path": "tests/test_museum_conditionals_cli.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "ad6416f09b22a6ee3c2fdf876939be385efac52f0a4d4124de1420464b547de0",
+ "current_sha256": "ad6416f09b22a6ee3c2fdf876939be385efac52f0a4d4124de1420464b547de0",
+ "path": "tests/test_museum_conditionals_paths.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "3b69f603a3128029caacc8bbc9af43e5898802124506887bdc887b1982d16d71",
+ "current_sha256": "3b69f603a3128029caacc8bbc9af43e5898802124506887bdc887b1982d16d71",
+ "path": "tests/test_museum_conditionals_startup.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "0eff026523881a6818a103cdd1e23006a082a3545423c2fe4f19182d08d24da7",
+ "current_sha256": "0eff026523881a6818a103cdd1e23006a082a3545423c2fe4f19182d08d24da7",
+ "path": "tests/test_museum_data.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "1bc61e0202cc6c147bbdd1357d7075f239f8a1bacda405404de09ba138507c72",
+ "current_sha256": "1bc61e0202cc6c147bbdd1357d7075f239f8a1bacda405404de09ba138507c72",
+ "path": "tests/test_museum_frontend.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "cc5a9ee15b27ccb10f96f0a77f79238e03b67b42efbcb6aeebbc9dddff1a9da0",
+ "current_sha256": "cc5a9ee15b27ccb10f96f0a77f79238e03b67b42efbcb6aeebbc9dddff1a9da0",
+ "path": "tests/test_museum_geometry.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "db894ec40b2c3d437aaa748110181ae8c9dc37636108deaccac87070b47c3728",
+ "current_sha256": "db894ec40b2c3d437aaa748110181ae8c9dc37636108deaccac87070b47c3728",
+ "path": "tests/test_museum_identity.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "2a0e8eb79cfbdcbcbbc3237545ebdbbe8c859b0f71cad0f8a8fc46062829e314",
+ "current_sha256": "2a0e8eb79cfbdcbcbbc3237545ebdbbe8c859b0f71cad0f8a8fc46062829e314",
+ "path": "tests/test_navigation.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "5bc38e6b23292e73d1a295c2d8f281f7215b88b87bf45c4ca6ff335e0f1d1422",
+ "current_sha256": "5bc38e6b23292e73d1a295c2d8f281f7215b88b87bf45c4ca6ff335e0f1d1422",
+ "path": "tests/test_navigation_discovery.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "bff5158f65c182c4a80519e8bf8824c18294e1d067bd1e9acad0d970d7078657",
+ "current_sha256": "bff5158f65c182c4a80519e8bf8824c18294e1d067bd1e9acad0d970d7078657",
+ "path": "tests/test_navigation_manifest.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "fac899b807edf049479dacd449736d861ccf363d9b914994646c5e80935d75db",
+ "current_sha256": "fac899b807edf049479dacd449736d861ccf363d9b914994646c5e80935d75db",
+ "path": "tests/test_navigation_workflow.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "1b4d0f5dcae7f1004056c76978f5282a96a157c08d7a629cd798f2fc0ed66e3d",
+ "current_sha256": "1b4d0f5dcae7f1004056c76978f5282a96a157c08d7a629cd798f2fc0ed66e3d",
+ "path": "tests/test_node_status_atlas.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "dbca3e03dc714038fd2161eaf16e205ea810e1d45487d5e52c97bb8d6a6da8a5",
+ "current_sha256": "dbca3e03dc714038fd2161eaf16e205ea810e1d45487d5e52c97bb8d6a6da8a5",
+ "path": "tests/test_node_status_refresh.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "3c98a48d02bd269e872e0bd4188ad01f6e4bbcd110c94d30cfa65831420d4eda",
+ "current_sha256": "3c98a48d02bd269e872e0bd4188ad01f6e4bbcd110c94d30cfa65831420d4eda",
+ "path": "tests/test_palette_export.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "c820b3725940dd25abf7bb68a1f23da1f1f3c04bab4187f29924362b2821d645",
+ "current_sha256": "c820b3725940dd25abf7bb68a1f23da1f1f3c04bab4187f29924362b2821d645",
+ "path": "tests/test_periodic_certificate_dependencies.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "7b2960401d47e2a48385fca6e8311e2dad03df4e15d313fa561a009d16afdacf",
+ "current_sha256": "7b2960401d47e2a48385fca6e8311e2dad03df4e15d313fa561a009d16afdacf",
+ "path": "tests/test_periodic_pilot_custody.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "b69a4477064fe1d42a285df5674e9cd180fddc62294c3ef20e896458f1ec86dd",
+ "current_sha256": "b69a4477064fe1d42a285df5674e9cd180fddc62294c3ef20e896458f1ec86dd",
+ "path": "tests/test_periodic_pilot_custody_oserror.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "d8771777c62f31868a46be269ecc7e5d3d822e6186e853c3c1acc1d83c49d362",
+ "current_sha256": "d8771777c62f31868a46be269ecc7e5d3d822e6186e853c3c1acc1d83c49d362",
+ "path": "tests/test_pickup_fence.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "0df96caec47e26767d6639d270060d998454aaadf6d81789ca6e22dde0ff7801",
+ "current_sha256": "0df96caec47e26767d6639d270060d998454aaadf6d81789ca6e22dde0ff7801",
+ "path": "tests/test_pin_export.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "d4c28d0972de547b3f262659e863170b085aad3a170afc3cbd1a125e3d140152",
+ "current_sha256": "d4c28d0972de547b3f262659e863170b085aad3a170afc3cbd1a125e3d140152",
+ "path": "tests/test_public_intake.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "51a7b8c70c1b06ebf092de3e32af53f8dd48d5efc5dd7480efd85e3064c431e0",
+ "current_sha256": "51a7b8c70c1b06ebf092de3e32af53f8dd48d5efc5dd7480efd85e3064c431e0",
+ "path": "tests/test_public_intake_artifact_identity_control.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "dcc2a3cb66a7877ca0fe941ae8a1e1a7058dcaf913fc25f3dacc726a5a5ef896",
+ "current_sha256": "dcc2a3cb66a7877ca0fe941ae8a1e1a7058dcaf913fc25f3dacc726a5a5ef896",
+ "path": "tests/test_public_shop_app.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "c45fd974735bc9f2bba62c2d6c1afda1dbc1badf581c2d1b6284eba952f3d78c",
+ "current_sha256": "c45fd974735bc9f2bba62c2d6c1afda1dbc1badf581c2d1b6284eba952f3d78c",
+ "path": "tests/test_public_shop_browser_contract.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "e0434d4678f608958a27e33d3056c13602376050aa8a24d172b1ecd809935202",
+ "current_sha256": "e0434d4678f608958a27e33d3056c13602376050aa8a24d172b1ecd809935202",
+ "path": "tests/test_public_shop_check_identity_control.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "f081685965bc34d542ae08311d11b3de5d6343e5554410d25cdcd15c8444c082",
+ "current_sha256": "f081685965bc34d542ae08311d11b3de5d6343e5554410d25cdcd15c8444c082",
+ "path": "tests/test_public_shop_data.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "98eeb82fea6d73f24ef9be15ce839feeb76608c4ce79e81a27df946d0d46fd4f",
+ "current_sha256": "98eeb82fea6d73f24ef9be15ce839feeb76608c4ce79e81a27df946d0d46fd4f",
+ "path": "tests/test_public_shop_frontend.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "237bf7b94d616f7686a1d161d45c079df84f75694bf5bda1a543c349e8bf1075",
+ "current_sha256": "237bf7b94d616f7686a1d161d45c079df84f75694bf5bda1a543c349e8bf1075",
+ "path": "tests/test_public_vector_index.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "025e631470545010a9bb33e92a1e5f84c5313aa62c7c0e1ac71d980e595c3295",
+ "current_sha256": "025e631470545010a9bb33e92a1e5f84c5313aa62c7c0e1ac71d980e595c3295",
+ "path": "tests/test_pytest_bytecode_policy.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "a135963b747399235afa9ae7ec53d6d0571e1353e7a6f577cdb9f85d7130e380",
+ "current_sha256": "a135963b747399235afa9ae7ec53d6d0571e1353e7a6f577cdb9f85d7130e380",
+ "path": "tests/test_reader_experience.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "227a52ca9f4bc337b257ea867356fa10dc84582dfd1ffed7b335e1c5e99a4583",
+ "current_sha256": "227a52ca9f4bc337b257ea867356fa10dc84582dfd1ffed7b335e1c5e99a4583",
+ "path": "tests/test_reader_jump.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "66e66891a890defc616723bdc76dab7b6af3919a584054c9713eb519c53882ac",
+ "current_sha256": "66e66891a890defc616723bdc76dab7b6af3919a584054c9713eb519c53882ac",
+ "path": "tests/test_reader_links.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "f33a92bae9aa0d1ec5cbdfb703e42826f85a59c4350899ce78f877adfa6e764e",
+ "current_sha256": "f33a92bae9aa0d1ec5cbdfb703e42826f85a59c4350899ce78f877adfa6e764e",
+ "path": "tests/test_reader_navigation.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "7bbdb892e8898d8da21401473d877e6c6175ca86267f7377c2fe33db7913723c",
+ "current_sha256": "7bbdb892e8898d8da21401473d877e6c6175ca86267f7377c2fe33db7913723c",
+ "path": "tests/test_reading_list_citation.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "ebe0243e35023f311e4229c15d99719f6b3141502b9f61a4f6478703a747c146",
+ "current_sha256": "ebe0243e35023f311e4229c15d99719f6b3141502b9f61a4f6478703a747c146",
+ "path": "tests/test_release_snapshot.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "feddcf6679744431922e10d2de99a0edfaf090b86067847da095bb57db6c2df4",
+ "current_sha256": "feddcf6679744431922e10d2de99a0edfaf090b86067847da095bb57db6c2df4",
+ "path": "tests/test_required_formal_binding_control.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "37dece6d29d470f0c7ecda729e5fba61bd4808647976345ba108a02d6245ac5b",
+ "current_sha256": "37dece6d29d470f0c7ecda729e5fba61bd4808647976345ba108a02d6245ac5b",
+ "path": "tests/test_required_formal_check.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "ea78adf62306716937bc654abaf3fd388145ba0058945be3ac81fb4073e1fc7f",
+ "current_sha256": "ea78adf62306716937bc654abaf3fd388145ba0058945be3ac81fb4073e1fc7f",
+ "path": "tests/test_research_delivery.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "0c7e3d3ee64477b1c6b37514a7388fe0948a52726cfc19fbcd0cf79db2057fc5",
+ "current_sha256": "0c7e3d3ee64477b1c6b37514a7388fe0948a52726cfc19fbcd0cf79db2057fc5",
+ "path": "tests/test_research_desk.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "945616152e9d50631890049fbe575cd67f925cc30257d2d60ee5d4542a6294d6",
+ "current_sha256": "945616152e9d50631890049fbe575cd67f925cc30257d2d60ee5d4542a6294d6",
+ "path": "tests/test_semantic_memory_benchmark.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "e79d0e886c4201aa241d893a2a405938b7082a0753c26265e780e77b555cc5d0",
+ "current_sha256": "e79d0e886c4201aa241d893a2a405938b7082a0753c26265e780e77b555cc5d0",
+ "path": "tests/test_site_asset_release.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "1d6caef1cb503538b41c48878601891b4e9f0774601fc1aa242d0bda0aac0b03",
+ "current_sha256": "1d6caef1cb503538b41c48878601891b4e9f0774601fc1aa242d0bda0aac0b03",
+ "path": "tests/test_site_csp.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "44eb872c01e510fddc8942c818b4f98aa0a305fc1c5109686c7d7ada9331964c",
+ "current_sha256": "44eb872c01e510fddc8942c818b4f98aa0a305fc1c5109686c7d7ada9331964c",
+ "path": "tests/test_site_graph_capture.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "0c49edf48527532c8dfd91277a24fffabc51b6e3b2a17529b8e69cfb6a3a08a5",
+ "current_sha256": "0c49edf48527532c8dfd91277a24fffabc51b6e3b2a17529b8e69cfb6a3a08a5",
+ "path": "tests/test_site_graph_projection.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "c88bee61162434ed34ce748aef65a2cb9737eeae42b1e0a06ddcc9ef5b28fbfb",
+ "current_sha256": "c88bee61162434ed34ce748aef65a2cb9737eeae42b1e0a06ddcc9ef5b28fbfb",
+ "path": "tests/test_snapshot_compare.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "68c821e2f7698f06854166d5a73b1f647fc913c4fd9b514ffec8681868d1ebe3",
+ "current_sha256": "68c821e2f7698f06854166d5a73b1f647fc913c4fd9b514ffec8681868d1ebe3",
+ "path": "tests/test_source_quote.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "cfb3ab0624216c4d0422e0aae17d71b74e73cfd84dff3d9600d8037ea2518816",
+ "current_sha256": "cfb3ab0624216c4d0422e0aae17d71b74e73cfd84dff3d9600d8037ea2518816",
+ "path": "tests/test_source_reference.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "193bd7099c964ba1870decb180e88fe4e0559bd6ce5e9ede6ff0bdede7642699",
+ "current_sha256": "193bd7099c964ba1870decb180e88fe4e0559bd6ce5e9ede6ff0bdede7642699",
+ "path": "tests/test_st_contract_pilot.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "8317e834b7f1b5a640fffb89ae186a37f9669e7baada97fa458fb57f288f4eb0",
+ "current_sha256": "8317e834b7f1b5a640fffb89ae186a37f9669e7baada97fa458fb57f288f4eb0",
+ "path": "tests/test_teaching_export.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "dfa26545041881fa0b995f2fd1de14cc3367597580e9145ead494c89cbc111d9",
+ "current_sha256": "dfa26545041881fa0b995f2fd1de14cc3367597580e9145ead494c89cbc111d9",
+ "path": "tests/test_workspace_landing.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "134bf1fbcb65353e489da2ce7ebfff62f1cc37996a9673bd806bc11c0baeb1bb",
+ "current_sha256": "134bf1fbcb65353e489da2ce7ebfff62f1cc37996a9673bd806bc11c0baeb1bb",
+ "path": "tests/test_workspace_navigation.mjs",
+ "preserved": true
+ },
+ {
+ "base_sha256": "651d9ab9945d257159a661f2e4f22f77c9c8693fc09213ee345460328c5f4403",
+ "current_sha256": "651d9ab9945d257159a661f2e4f22f77c9c8693fc09213ee345460328c5f4403",
+ "path": "tools/hypergraph/test_artifacts.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "69b553b5f3513179f9736d103522a0b7b2c655aac1fce72f499f3b0312f0d1c7",
+ "current_sha256": "69b553b5f3513179f9736d103522a0b7b2c655aac1fce72f499f3b0312f0d1c7",
+ "path": "tools/hypergraph/test_math_hypergraph.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "6800939d8dcce2693ecfc9a77f5b35128535dee7c50895cc1d34e602311ed44a",
+ "current_sha256": "6800939d8dcce2693ecfc9a77f5b35128535dee7c50895cc1d34e602311ed44a",
+ "path": "tools/source_census_20260927/test_source_census.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "a7f0a8ddc5bb74c541c60052e7fa4d84e8c1ef646430a9a6af505655beca6e6a",
+ "current_sha256": "a7f0a8ddc5bb74c541c60052e7fa4d84e8c1ef646430a9a6af505655beca6e6a",
+ "path": "tools/source_census_20260927/test_unpack_sources.py",
+ "preserved": true
+ },
+ {
+ "base_sha256": "6fc5da2310a05e72b675a657e6d41d4f336ae8fe293a7d13b3c3bcee07c6af90",
+ "current_sha256": "6fc5da2310a05e72b675a657e6d41d4f336ae8fe293a7d13b3c3bcee07c6af90",
+ "path": "tools/source_census_20260927/test_workflow_nonzero_discovery.py",
+ "preserved": true
+ }
+ ]
+ },
+ "project_import_graph": {
+ "formal/UniversalLaw.lean": [
+ "UniversalLaw.Side24.Ledger",
+ "UniversalLaw.Side24.ConeMoments",
+ "UniversalLaw.Side24.Endpoints"
+ ],
+ "formal/UniversalLaw/Side24/ConeMoments.lean": [],
+ "formal/UniversalLaw/Side24/Endpoints.lean": [],
+ "formal/UniversalLaw/Side24/Ledger.lean": []
+ },
+ "receipt_interpretation": "Point-in-time source/binding observations only; this assembler does not issue a fresh kernel execution or complete current receipt verdict",
+ "remaining_unknowns": [
+ "Transitive source-parent analytic alignment is not established.",
+ "Historical/dynamic Python programs are not executed or proved safe by member inventory.",
+ "Fresh final runner must rebind receipts after any source change."
+ ],
+ "schema_version": 1,
+ "scope": "Main31 literal theorem/source and archival isolation boundary; no source-parent statement alignment acceptance",
+ "source_preservation": [
+ {
+ "all_equal": true,
+ "base_sha256": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b",
+ "bytes": 25,
+ "manifest_sha256": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b",
+ "parent_sha256": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b",
+ "path": "formal/lean-toolchain",
+ "sha256": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "58f0fa6864cc03e9bcbef2d8c0404e9f3385a30a6124000454319367906cbe4a",
+ "bytes": 464,
+ "manifest_sha256": "58f0fa6864cc03e9bcbef2d8c0404e9f3385a30a6124000454319367906cbe4a",
+ "parent_sha256": "58f0fa6864cc03e9bcbef2d8c0404e9f3385a30a6124000454319367906cbe4a",
+ "path": "formal/lakefile.toml",
+ "sha256": "58f0fa6864cc03e9bcbef2d8c0404e9f3385a30a6124000454319367906cbe4a"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "562d38ad95598486b2b592e6d072d5d3212735bfeb1cb6d8eb8ec04492522ba2",
+ "bytes": 144,
+ "manifest_sha256": "562d38ad95598486b2b592e6d072d5d3212735bfeb1cb6d8eb8ec04492522ba2",
+ "parent_sha256": "562d38ad95598486b2b592e6d072d5d3212735bfeb1cb6d8eb8ec04492522ba2",
+ "path": "formal/lake-manifest.json",
+ "sha256": "562d38ad95598486b2b592e6d072d5d3212735bfeb1cb6d8eb8ec04492522ba2"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e",
+ "bytes": 586,
+ "manifest_sha256": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e",
+ "parent_sha256": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e",
+ "path": "formal/UniversalLaw.lean",
+ "sha256": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7",
+ "bytes": 7025,
+ "manifest_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7",
+ "parent_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7",
+ "path": "formal/UniversalLaw/Side24/Ledger.lean",
+ "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c",
+ "bytes": 4409,
+ "manifest_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c",
+ "parent_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c",
+ "path": "formal/UniversalLaw/Side24/ConeMoments.lean",
+ "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd",
+ "bytes": 1940,
+ "manifest_sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd",
+ "parent_sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd",
+ "path": "formal/UniversalLaw/Side24/Endpoints.lean",
+ "sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769",
+ "bytes": 10272,
+ "manifest_sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769",
+ "parent_sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769",
+ "path": "formal/sources/side24_v1/PROOF.md",
+ "sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811",
+ "bytes": 1090,
+ "manifest_sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811",
+ "parent_sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811",
+ "path": "formal/sources/side24_v1/ENCLOSURE.json",
+ "sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "fd06700628b1fbc81c5cfe3786aaa455032375bcb879914f068a66b726802a17",
+ "bytes": 6279,
+ "manifest_sha256": "fd06700628b1fbc81c5cfe3786aaa455032375bcb879914f068a66b726802a17",
+ "parent_sha256": "fd06700628b1fbc81c5cfe3786aaa455032375bcb879914f068a66b726802a17",
+ "path": "formal/SCOPE.md",
+ "sha256": "fd06700628b1fbc81c5cfe3786aaa455032375bcb879914f068a66b726802a17"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "342d4efb374fea31c39e51f8f6bcdbc50d7fb5fea1fd393eda21afff92c62fb8",
+ "bytes": 10035,
+ "manifest_sha256": "342d4efb374fea31c39e51f8f6bcdbc50d7fb5fea1fd393eda21afff92c62fb8",
+ "parent_sha256": "342d4efb374fea31c39e51f8f6bcdbc50d7fb5fea1fd393eda21afff92c62fb8",
+ "path": "formal/GLOSSARY.md",
+ "sha256": "342d4efb374fea31c39e51f8f6bcdbc50d7fb5fea1fd393eda21afff92c62fb8"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "137e7c7ed44d732042d803eb4a0ee75f9ddc6475950a2bb6226a7711a44be14b",
+ "bytes": 9154,
+ "manifest_sha256": "137e7c7ed44d732042d803eb4a0ee75f9ddc6475950a2bb6226a7711a44be14b",
+ "parent_sha256": "137e7c7ed44d732042d803eb4a0ee75f9ddc6475950a2bb6226a7711a44be14b",
+ "path": "formal/README.md",
+ "sha256": "137e7c7ed44d732042d803eb4a0ee75f9ddc6475950a2bb6226a7711a44be14b"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "54d32104aa012e917ef40b73fa3a40228d023249b339cf30fe4bdb7dcbfed414",
+ "bytes": 5151,
+ "manifest_sha256": "54d32104aa012e917ef40b73fa3a40228d023249b339cf30fe4bdb7dcbfed414",
+ "parent_sha256": "54d32104aa012e917ef40b73fa3a40228d023249b339cf30fe4bdb7dcbfed414",
+ "path": "formal/REVIEW_LANE.md",
+ "sha256": "54d32104aa012e917ef40b73fa3a40228d023249b339cf30fe4bdb7dcbfed414"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "e722e928ca43c16981e063d8eb1c91e9bf8c683241d9dcf156400a419e72feb3",
+ "bytes": 1061,
+ "manifest_sha256": "e722e928ca43c16981e063d8eb1c91e9bf8c683241d9dcf156400a419e72feb3",
+ "parent_sha256": "e722e928ca43c16981e063d8eb1c91e9bf8c683241d9dcf156400a419e72feb3",
+ "path": "formal/reviews/TEMPLATE_alignment_review.json",
+ "sha256": "e722e928ca43c16981e063d8eb1c91e9bf8c683241d9dcf156400a419e72feb3"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "333ca71e7c676cee89e5d01cd61999c21bb0584e41d6bdacb18afa410109f95d",
+ "bytes": 906,
+ "manifest_sha256": "333ca71e7c676cee89e5d01cd61999c21bb0584e41d6bdacb18afa410109f95d",
+ "parent_sha256": "333ca71e7c676cee89e5d01cd61999c21bb0584e41d6bdacb18afa410109f95d",
+ "path": "formal/reviews/README.md",
+ "sha256": "333ca71e7c676cee89e5d01cd61999c21bb0584e41d6bdacb18afa410109f95d"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5",
+ "bytes": 23845,
+ "manifest_sha256": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5",
+ "parent_sha256": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5",
+ "path": "tools/formal_gate_check.py",
+ "sha256": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5"
+ },
+ {
+ "all_equal": true,
+ "base_sha256": "2b13ad83b03d2b45f4be70ce03af597c195563a1ed0bd3983a2b7040068a3a84",
+ "bytes": 26219,
+ "manifest_sha256": "2b13ad83b03d2b45f4be70ce03af597c195563a1ed0bd3983a2b7040068a3a84",
+ "parent_sha256": "2b13ad83b03d2b45f4be70ce03af597c195563a1ed0bd3983a2b7040068a3a84",
+ "path": "tests/test_formal_gate.py",
+ "sha256": "2b13ad83b03d2b45f4be70ce03af597c195563a1ed0bd3983a2b7040068a3a84"
+ }
+ ],
+ "statement_alignment_disposition": "QUARANTINED: analytic/source parent claims and historic scientific labels are not established by Main31 integer arithmetic"
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/baseline-receipt.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/baseline-receipt.json
new file mode 100644
index 000000000..72cf869d0
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/baseline-receipt.json
@@ -0,0 +1,77 @@
+{
+ "alignment_status": "PENDING_INDEPENDENT_REVIEW",
+ "axioms": {
+ "UniversalLaw.Side24.conditional_third_derivative_variance": [],
+ "UniversalLaw.Side24.cone_moment_m1_thirds": [],
+ "UniversalLaw.Side24.cone_moment_m2_algebra": [],
+ "UniversalLaw.Side24.covariance_relative_bound": [],
+ "UniversalLaw.Side24.cube_root_simplification": [],
+ "UniversalLaw.Side24.d2_endpoints_adjacent": [],
+ "UniversalLaw.Side24.d3_below_d2": [],
+ "UniversalLaw.Side24.d3_endpoints_adjacent": [],
+ "UniversalLaw.Side24.density_comparison_below_reported": [],
+ "UniversalLaw.Side24.endpoints_in_unit_tenth": [],
+ "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten": [],
+ "UniversalLaw.Side24.exponent_bounds": [],
+ "UniversalLaw.Side24.exponent_values": [],
+ "UniversalLaw.Side24.exponential_moment_of_trace": [],
+ "UniversalLaw.Side24.fourth_moment_of_trace": [],
+ "UniversalLaw.Side24.geometric_ratio_constants": [],
+ "UniversalLaw.Side24.hessian_block_eigenvalues": [],
+ "UniversalLaw.Side24.image_constant_value": [],
+ "UniversalLaw.Side24.lattice_shell_constant": [],
+ "UniversalLaw.Side24.odd_block_eigenvalues": [],
+ "UniversalLaw.Side24.odd_block_shifted_minors": [],
+ "UniversalLaw.Side24.pairing_sum_le_six": [],
+ "UniversalLaw.Side24.pairing_sum_six": [],
+ "UniversalLaw.Side24.pairing_terms_six": [],
+ "UniversalLaw.Side24.period_exponent": [],
+ "UniversalLaw.Side24.pin_determinant_and_joint_dimension": [],
+ "UniversalLaw.Side24.ratio_constant_ordering": [],
+ "UniversalLaw.Side24.sixth_moment_double_factorial": [],
+ "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third": [],
+ "UniversalLaw.Side24.trace_and_traceless_variances": [],
+ "UniversalLaw.Side24.transverse_covariance_entries_thirds": []
+ },
+ "checked_commit": "a7f602241f759285190d8deebfefb017a6167ee8",
+ "dependency_revisions": {},
+ "formalization_status": "kernel-checked",
+ "lean_version": "Lean (version 4.34.1, x86_64-unknown-linux-gnu, commit 5045d0056413266e57c625dcd7c365b10e377c52, Release)",
+ "logs": {
+ "axioms.log": "856d934eabb250bffb96085454fc04b3ddd64a47bb92829728f7d5bb7d286d0c",
+ "build.log": "6a7ae1a06694eb7d44106bbd4e578aa965abdae391a1678ac0a14ec7e0b0908e",
+ "custom_imported.log": "6e7f917c7fe2fdc3efe1943dcc327c56acadd0b0ca96507a4327073fdfd2f083",
+ "elaborated-types.log": "10a954ced98371c5cf98eecada196d50c1e6e570af9ea8e07caade4a80b0aab8",
+ "false_covariance_bound.log": "3e9f3d67aa666c88ed8e2b0b126163336cd5982dee6ce21b1118fa200292a4dd",
+ "false_eigenvalue_third.log": "fda3cc4e985c3309e132c150d4ba988a4d4699095ef2f0cab010dc8e2a5094b2",
+ "false_endpoint_adjacency.log": "62af9c46e66215424a5c82c4a1ee83700bbe7ca84906c14400cc4bfdcd5b276a",
+ "false_exp_partial_sum.log": "a82d1d1651352ec73a73ee7ad17a596d225fc808b9a3723dbbdd41f982f5328e",
+ "false_exponent_bound_d3.log": "bccf477ff397333506812af1a4a1475a3716f50a0ac0f3a20de77b421064b78d",
+ "false_trace_variance.log": "685a68785e68c9590b0479754dc6479d4e1be7a9f89b29a40bfed17c24a376bb",
+ "leanchecker.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "native.log": "8a0b9f79f3265724af58b27461627f9d532535f8a23681361da731c9ea37c101",
+ "preflight-version.log": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680",
+ "sorry.log": "50c0e4557dee071a09d39a848a5eb54324115cd8958a4564f1e845380a64677a",
+ "version.log": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680",
+ "wrong_image_constant.log": "56114d671544669de953160f6688ba962a052a17b8a00e614dc5cdab711744b1"
+ },
+ "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0",
+ "negative_controls": {
+ "custom_imported": "REJECTED_BY_AXIOM_GATE",
+ "false_covariance_bound": "REJECTED_BY_LEAN",
+ "false_eigenvalue_third": "REJECTED_BY_LEAN",
+ "false_endpoint_adjacency": "REJECTED_BY_LEAN",
+ "false_exp_partial_sum": "REJECTED_BY_LEAN",
+ "false_exponent_bound_d3": "REJECTED_BY_LEAN",
+ "false_trace_variance": "REJECTED_BY_LEAN",
+ "native": "REJECTED_BY_AXIOM_GATE",
+ "sorry": "REJECTED_BY_AXIOM_GATE",
+ "wrong_image_constant": "REJECTED_BY_LEAN"
+ },
+ "package": "side24-arithmetic-skeleton",
+ "repository": null,
+ "schema_version": 1,
+ "scientific_effect": "NONE",
+ "scientific_status_authority": false,
+ "workflow_run_id": null
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/all-declarations-and-witnesses.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/all-declarations-and-witnesses.log
new file mode 100644
index 000000000..2ccbba98a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/all-declarations-and-witnesses.log
@@ -0,0 +1,50 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.lattice_shell_constant","prop_premises":[],"statement":"27 * 27 = 729 ∧ 729 * 2 = 1458"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.pairing_terms_six","prop_premises":[],"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"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.geometric_ratio_constants","prop_premises":[],"statement":"2 ^ 9 = 512 ∧ 288 * 3 = 864"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.expTaylorNumerator","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact._f","prop_premises":[],"statement":"(x : Nat) → Nat.below x → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.exponent_bounds","prop_premises":[{"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"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.pairing_sum_six","prop_premises":[],"statement":"UniversalLaw.Side24.pairingSum 6 = 76"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.covariance_relative_bound","prop_premises":[],"statement":"2 * 10 * 3 = 60 ∧ 60 * UniversalLaw.Side24.imageConstant < 10 ^ 17"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.smaller_eigenvalue_exceeds_third","prop_premises":[],"statement":"58 * 9 < 23 ^ 2"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.imageConstant","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.odd_block_shifted_minors","prop_premises":[],"statement":"3 * 1 - 1 = 2 ∧ 3 * 15 - 1 = 44 ∧ 2 * 44 - -9 * -9 = 7"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.sixB","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.density_comparison_below_reported","prop_premises":[],"statement":"32 * 10 ^ 106 < 10 ^ 108"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.period_exponent","prop_premises":[],"statement":"24 ^ 2 / 2 = 288"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.odd_block_eigenvalues","prop_premises":[],"statement":"1 + 15 = 2 * 8 ∧ 1 * 15 - -3 * -3 = 6 ∧ 8 ^ 2 - 58 = 6"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.sixA","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.pairing_sum_le_six","prop_premises":[{"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"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact._sunfold","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.image_constant_value","prop_premises":[],"statement":"UniversalLaw.Side24.imageConstant = 21175738586478"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten","prop_premises":[],"statement":"10 * (125 ^ 20 * UniversalLaw.Side24.fact 20) < UniversalLaw.Side24.expTaylorNumerator"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact._unsafe_rec","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.pairingSum","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.sixth_moment_double_factorial","prop_premises":[],"statement":"1 * 3 * 5 = 15"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.exponent_values","prop_premises":[],"statement":"UniversalLaw.Side24.sixA 2 = 13 ∧\n UniversalLaw.Side24.sixB 2 = 15 ∧ UniversalLaw.Side24.sixA 3 = 25 ∧ UniversalLaw.Side24.sixB 3 = 27"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.ratio_constant_ordering","prop_premises":[],"statement":"13 ≤ 32 ∧ 28 ≤ 32"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact.match_1","prop_premises":[],"statement":"(motive : Nat → Sort u_1) → (x : Nat) → (Unit → motive 0) → ((n : Nat) → motive n.succ) → motive x"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.conditional_third_derivative_variance","prop_premises":[],"statement":"15 - -3 * -3 / 1 = 6"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.cube_root_simplification","prop_premises":[],"statement":"6 ^ 2 * 2 = 3 * 24"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.exponential_moment_of_trace","prop_premises":[],"statement":"3 + 5 = 8"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.fourth_moment_of_trace","prop_premises":[],"statement":"3 * 5 ^ 2 * 3 = 25 * 9"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.hessian_block_eigenvalues","prop_premises":[],"statement":"2 + 2 = 4 ∧ 3 + 2 = 5 ∧ 1 < 3 * 2"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.pin_determinant_and_joint_dimension","prop_premises":[],"statement":"3 * 1 * 1 = 3 ∧ 2 + 1 + 2 * 3 / 2 = 6 ∧ 3 + 1 + 3 * 4 / 2 = 10"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.transverse_covariance_entries_thirds","prop_premises":[],"statement":"2 + 3 + 3 = 8 ∧ 0 + 3 + 0 = 3 ∧ 2 + 0 + 0 = 2"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.trace_and_traceless_variances","prop_premises":[],"statement":"8 + 8 + 2 * 2 = 20 ∧ 20 * 3 = 5 * 12 ∧ 8 + 8 - 2 * 2 = 12 ∧ 12 = 1 * 12 ∧ 8 - 8 = 0"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.cone_moment_m1_thirds","prop_premises":[],"statement":"8 = 2 * 4"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.cone_moment_m2_algebra","prop_premises":[],"statement":"4 * 5 = 20 ∧ 25 - 20 + 24 = 29 ∧ 4 ^ 2 * 3 = 6 * 8"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d3Upper","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d2Lower","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d2_endpoints_adjacent","prop_premises":[],"statement":"UniversalLaw.Side24.d2Lower < UniversalLaw.Side24.d2Upper ∧\n UniversalLaw.Side24.d2Upper = UniversalLaw.Side24.d2Lower + 1"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d3Lower","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d3_endpoints_adjacent","prop_premises":[],"statement":"UniversalLaw.Side24.d3Lower < UniversalLaw.Side24.d3Upper ∧\n UniversalLaw.Side24.d3Upper = UniversalLaw.Side24.d3Lower + 1"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.endpoints_in_unit_tenth","prop_premises":[],"statement":"0 < UniversalLaw.Side24.d3Lower ∧ UniversalLaw.Side24.d2Upper < 10 ^ 19"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d2Upper","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d3_below_d2","prop_premises":[],"statement":"UniversalLaw.Side24.d3Upper < UniversalLaw.Side24.d2Lower"}
+CBZ_END {"count":45,"modules":["UniversalLaw.Side24.Ledger","UniversalLaw.Side24.ConeMoments","UniversalLaw.Side24.Endpoints","UniversalLaw"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/auditor-module-census.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/auditor-module-census.log
new file mode 100644
index 000000000..7effdc667
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/auditor-module-census.log
@@ -0,0 +1,5 @@
+CBZ_RECORD {"axioms":["propext","Quot.sound"],"kind":"theorem","module":"CBZNonvacuity","name":"CBZNonvacuity.dimensions_inhabited","prop_premises":[],"statement":"∃ d, d ∈ [2, 3]"}
+CBZ_RECORD {"axioms":["propext","Quot.sound"],"kind":"theorem","module":"CBZNonvacuity","name":"CBZNonvacuity.pairing_all_seven","prop_premises":[],"statement":"0 ∈ [0, 1, 2, 3, 4, 5, 6] ∧\n 1 ∈ [0, 1, 2, 3, 4, 5, 6] ∧\n 2 ∈ [0, 1, 2, 3, 4, 5, 6] ∧\n 3 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 4 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 5 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 6 ∈ [0, 1, 2, 3, 4, 5, 6]"}
+CBZ_RECORD {"axioms":["propext","Quot.sound"],"kind":"theorem","module":"CBZNonvacuity","name":"CBZNonvacuity.dimensions_both","prop_premises":[],"statement":"2 ∈ [2, 3] ∧ 3 ∈ [2, 3]"}
+CBZ_RECORD {"axioms":["propext","Quot.sound"],"kind":"theorem","module":"CBZNonvacuity","name":"CBZNonvacuity.pairing_domain_inhabited","prop_premises":[],"statement":"∃ q, q ∈ [0, 1, 2, 3, 4, 5, 6]"}
+CBZ_END {"count":4,"modules":["CBZNonvacuity"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/false_premise-audit.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/false_premise-audit.log
new file mode 100644
index 000000000..678dc0f15
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/false_premise-audit.log
@@ -0,0 +1,6 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZControl_false_premise","name":"vacuous","prop_premises":[{"name":"h","type":"False"}],"statement":"False → False"}
+CBZ_END {"count":1,"modules":["CBZControl_false_premise"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/false_premise-compile.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/false_premise-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/fresh-kernel.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/fresh-kernel.log
new file mode 100644
index 000000000..dd6c2b20d
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/fresh-kernel.log
@@ -0,0 +1 @@
+replaying UniversalLaw with --fresh
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/honest-audit.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/honest-audit.log
new file mode 100644
index 000000000..ab1971291
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/honest-audit.log
@@ -0,0 +1,6 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZControl_honest","name":"honest","prop_premises":[],"statement":"True"}
+CBZ_END {"count":1,"modules":["CBZControl_honest"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/honest-compile.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/honest-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/missing-module.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/missing-module.log
new file mode 100644
index 000000000..be2f08351
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/missing-module.log
@@ -0,0 +1,5 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/MissingModule.lean:21:0: error: CBZ_MISSING_MODULE [MissingModule]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/native-audit.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/native-audit.log
new file mode 100644
index 000000000..d3f616d31
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/native-audit.log
@@ -0,0 +1,5 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/Audit_native.lean:21:0: error: CBZ_FORBIDDEN native._native.native_decide.ax_1_1 [native._native.native_decide.ax_1_1]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/native-compile.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/native-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/sorry-audit.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/sorry-audit.log
new file mode 100644
index 000000000..6368c5815
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/sorry-audit.log
@@ -0,0 +1,5 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/Audit_sorry.lean:21:0: error: CBZ_FORBIDDEN bad [sorryAx]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/sorry-compile.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/sorry-compile.log
new file mode 100644
index 000000000..856f03ef6
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/sorry-compile.log
@@ -0,0 +1 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/CBZControl_sorry.lean:2:8: warning: declaration uses `sorry`
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/unused_axiom-audit.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/unused_axiom-audit.log
new file mode 100644
index 000000000..e1c241735
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/unused_axiom-audit.log
@@ -0,0 +1,6 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZControl_unused_axiom","name":"honest","prop_premises":[],"statement":"True"}
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/Audit_unused_axiom.lean:21:0: error: CBZ_FORBIDDEN hidden [hidden]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/unused_axiom-compile.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/unused_axiom-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-audit.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-audit.log
new file mode 100644
index 000000000..29960ffd9
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-audit.log
@@ -0,0 +1,5 @@
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZWeakenedWitness","name":"CBZNonvacuity.dimensions_inhabited","prop_premises":[],"statement":"True"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZWeakenedWitness","name":"CBZNonvacuity.pairing_all_seven","prop_premises":[],"statement":"True"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZWeakenedWitness","name":"CBZNonvacuity.dimensions_both","prop_premises":[],"statement":"True"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZWeakenedWitness","name":"CBZNonvacuity.pairing_domain_inhabited","prop_premises":[],"statement":"True"}
+CBZ_END {"count":4,"modules":["CBZWeakenedWitness"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-compile.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-contract.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-contract.log
new file mode 100644
index 000000000..af3197f70
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-contract.log
@@ -0,0 +1,27 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/WeakenedWitnessContract.lean:2:46: error: Type mismatch
+ CBZNonvacuity.pairing_domain_inhabited
+has type
+ True
+but is expected to have type
+ ∃ q, q ∈ [0, 1, 2, 3, 4, 5, 6]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/WeakenedWitnessContract.lean:3:209: error: Type mismatch
+ CBZNonvacuity.pairing_all_seven
+has type
+ True
+but is expected to have type
+ 0 ∈ [0, 1, 2, 3, 4, 5, 6] ∧
+ 1 ∈ [0, 1, 2, 3, 4, 5, 6] ∧
+ 2 ∈ [0, 1, 2, 3, 4, 5, 6] ∧
+ 3 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 4 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 5 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 6 ∈ [0, 1, 2, 3, 4, 5, 6]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/WeakenedWitnessContract.lean:4:36: error: Type mismatch
+ CBZNonvacuity.dimensions_inhabited
+has type
+ True
+but is expected to have type
+ ∃ d, d ∈ [2, 3]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/WeakenedWitnessContract.lean:5:49: error: Type mismatch
+ CBZNonvacuity.dimensions_both
+has type
+ True
+but is expected to have type
+ 2 ∈ [2, 3] ∧ 3 ∈ [2, 3]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/witness-kernel.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/witness-kernel.log
new file mode 100644
index 000000000..00b3a20b0
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/witness-kernel.log
@@ -0,0 +1 @@
+replaying CBZNonvacuity
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/witness-type-contract.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/witness-type-contract.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/receipt.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/receipt.json
new file mode 100644
index 000000000..79bb6cd6e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/receipt.json
@@ -0,0 +1,748 @@
+{
+ "all_project_constants": [
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.lattice_shell_constant",
+ "prop_premises": [],
+ "statement": "27 * 27 = 729 \u2227 729 * 2 = 1458"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_terms_six",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.fact 6 / (2 ^ 0 * UniversalLaw.Side24.fact 0 * UniversalLaw.Side24.fact 6) = 1 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 1 * UniversalLaw.Side24.fact 1 * UniversalLaw.Side24.fact 4) = 15 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 2 * UniversalLaw.Side24.fact 2 * UniversalLaw.Side24.fact 2) = 45 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 3 * UniversalLaw.Side24.fact 3 * UniversalLaw.Side24.fact 0) = 15"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.geometric_ratio_constants",
+ "prop_premises": [],
+ "statement": "2 ^ 9 = 512 \u2227 288 * 3 = 864"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.expTaylorNumerator",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact._f",
+ "prop_premises": [],
+ "statement": "(x : Nat) \u2192 Nat.below x \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exponent_bounds",
+ "prop_premises": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "d \u2208 [2, 3]"
+ }
+ ],
+ "statement": "\u2200 (d : Nat),\n d \u2208 [2, 3] \u2192\n UniversalLaw.Side24.sixA d + 2 * UniversalLaw.Side24.sixB d < 84 \u2227\n 2 * UniversalLaw.Side24.sixA d + UniversalLaw.Side24.sixB d < 78"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_sum_six",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.pairingSum 6 = 76"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.covariance_relative_bound",
+ "prop_premises": [],
+ "statement": "2 * 10 * 3 = 60 \u2227 60 * UniversalLaw.Side24.imageConstant < 10 ^ 17"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third",
+ "prop_premises": [],
+ "statement": "58 * 9 < 23 ^ 2"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.imageConstant",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.odd_block_shifted_minors",
+ "prop_premises": [],
+ "statement": "3 * 1 - 1 = 2 \u2227 3 * 15 - 1 = 44 \u2227 2 * 44 - -9 * -9 = 7"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.sixB",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.density_comparison_below_reported",
+ "prop_premises": [],
+ "statement": "32 * 10 ^ 106 < 10 ^ 108"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.period_exponent",
+ "prop_premises": [],
+ "statement": "24 ^ 2 / 2 = 288"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.odd_block_eigenvalues",
+ "prop_premises": [],
+ "statement": "1 + 15 = 2 * 8 \u2227 1 * 15 - -3 * -3 = 6 \u2227 8 ^ 2 - 58 = 6"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.sixA",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_sum_le_six",
+ "prop_premises": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "q \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ }
+ ],
+ "statement": "\u2200 (q : Nat), q \u2208 [0, 1, 2, 3, 4, 5, 6] \u2192 UniversalLaw.Side24.pairingSum q \u2264 76"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact._sunfold",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.image_constant_value",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.imageConstant = 21175738586478"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten",
+ "prop_premises": [],
+ "statement": "10 * (125 ^ 20 * UniversalLaw.Side24.fact 20) < UniversalLaw.Side24.expTaylorNumerator"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact._unsafe_rec",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairingSum",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.sixth_moment_double_factorial",
+ "prop_premises": [],
+ "statement": "1 * 3 * 5 = 15"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exponent_values",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.sixA 2 = 13 \u2227\n UniversalLaw.Side24.sixB 2 = 15 \u2227 UniversalLaw.Side24.sixA 3 = 25 \u2227 UniversalLaw.Side24.sixB 3 = 27"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.ratio_constant_ordering",
+ "prop_premises": [],
+ "statement": "13 \u2264 32 \u2227 28 \u2264 32"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact.match_1",
+ "prop_premises": [],
+ "statement": "(motive : Nat \u2192 Sort u_1) \u2192 (x : Nat) \u2192 (Unit \u2192 motive 0) \u2192 ((n : Nat) \u2192 motive n.succ) \u2192 motive x"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.conditional_third_derivative_variance",
+ "prop_premises": [],
+ "statement": "15 - -3 * -3 / 1 = 6"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cube_root_simplification",
+ "prop_premises": [],
+ "statement": "6 ^ 2 * 2 = 3 * 24"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.exponential_moment_of_trace",
+ "prop_premises": [],
+ "statement": "3 + 5 = 8"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.fourth_moment_of_trace",
+ "prop_premises": [],
+ "statement": "3 * 5 ^ 2 * 3 = 25 * 9"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.hessian_block_eigenvalues",
+ "prop_premises": [],
+ "statement": "2 + 2 = 4 \u2227 3 + 2 = 5 \u2227 1 < 3 * 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.pin_determinant_and_joint_dimension",
+ "prop_premises": [],
+ "statement": "3 * 1 * 1 = 3 \u2227 2 + 1 + 2 * 3 / 2 = 6 \u2227 3 + 1 + 3 * 4 / 2 = 10"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.transverse_covariance_entries_thirds",
+ "prop_premises": [],
+ "statement": "2 + 3 + 3 = 8 \u2227 0 + 3 + 0 = 3 \u2227 2 + 0 + 0 = 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.trace_and_traceless_variances",
+ "prop_premises": [],
+ "statement": "8 + 8 + 2 * 2 = 20 \u2227 20 * 3 = 5 * 12 \u2227 8 + 8 - 2 * 2 = 12 \u2227 12 = 1 * 12 \u2227 8 - 8 = 0"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cone_moment_m1_thirds",
+ "prop_premises": [],
+ "statement": "8 = 2 * 4"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cone_moment_m2_algebra",
+ "prop_premises": [],
+ "statement": "4 * 5 = 20 \u2227 25 - 20 + 24 = 29 \u2227 4 ^ 2 * 3 = 6 * 8"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3Upper",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d2Lower",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d2_endpoints_adjacent",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d2Lower < UniversalLaw.Side24.d2Upper \u2227\n UniversalLaw.Side24.d2Upper = UniversalLaw.Side24.d2Lower + 1"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3Lower",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3_endpoints_adjacent",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d3Lower < UniversalLaw.Side24.d3Upper \u2227\n UniversalLaw.Side24.d3Upper = UniversalLaw.Side24.d3Lower + 1"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.endpoints_in_unit_tenth",
+ "prop_premises": [],
+ "statement": "0 < UniversalLaw.Side24.d3Lower \u2227 UniversalLaw.Side24.d2Upper < 10 ^ 19"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d2Upper",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3_below_d2",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d3Upper < UniversalLaw.Side24.d2Lower"
+ }
+ ],
+ "audit_input_sha256": {
+ "tools/CBZNonvacuity.lean": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f",
+ "tools/cbz_lean_check.py": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d",
+ "tools/formal_gate_check.py": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5"
+ },
+ "audit_module_constants": [
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.dimensions_inhabited",
+ "prop_premises": [],
+ "statement": "\u2203 d, d \u2208 [2, 3]"
+ },
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.pairing_all_seven",
+ "prop_premises": [],
+ "statement": "0 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 1 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 2 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 3 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 4 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 5 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 6 \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ },
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.dimensions_both",
+ "prop_premises": [],
+ "statement": "2 \u2208 [2, 3] \u2227 3 \u2208 [2, 3]"
+ },
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.pairing_domain_inhabited",
+ "prop_premises": [],
+ "statement": "\u2203 q, q \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ }
+ ],
+ "baseline_receipt_sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1",
+ "checked_commit": "a7f602241f759285190d8deebfefb017a6167ee8",
+ "fresh_kernel": "PASS",
+ "lean_version": "Lean (version 4.34.1, x86_64-unknown-linux-gnu, commit 5045d0056413266e57c625dcd7c365b10e377c52, Release)",
+ "logs": {
+ "all-declarations-and-witnesses.log": "dcc81dc13a6dce4b25a6300fd616966e835877f124b8e6448b452878df9673ea",
+ "auditor-module-census.log": "6b9bf4260474d13fb392b71b0fa3b3dadc75fc99fb06310b9caaff31feb3ce4c",
+ "false_premise-audit.log": "424799495dafb2dac297a8206c364a73e8c41bed48ac772b0e806443811bfac1",
+ "false_premise-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "fresh-kernel.log": "765e0f77863dc012524cd125d2699754f19e967f4ec35908a2aed7903057572e",
+ "honest-audit.log": "62390300f3aaa05474dd1d9b75e47728635f0e2c4b0b49dc9daf0914ec506d87",
+ "honest-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "missing-module.log": "2d9fdde838c729bf8630456eec1033381833a4a2eb42c8f07ca910d9d636f121",
+ "native-audit.log": "468963ce795fd68a13b99e1e5b9e90e817f273fe2099bda696deb61552697200",
+ "native-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "sorry-audit.log": "938f55996c45f78c29d90750ce73a1cfba8bd488b34f5b9e99ced19993bab2f4",
+ "sorry-compile.log": "693c90261e9a6a2c68216209a5692f39ee06659d9a50919b2e551ffbd8f8deaa",
+ "unused_axiom-audit.log": "972d65c1ff8afddb2e2f9024fbaf972b80292d7b9c0d774f8d946dee28fc12f6",
+ "unused_axiom-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "weakened-witness-audit.log": "3da011e5e28b010ac0851c66e96f3c3d7f501dbb8febcf944f597f239d4412d4",
+ "weakened-witness-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "weakened-witness-contract.log": "727a132984645d32ac0f4607e61132c096ab4aa1dfe82bcfe9ad4756744d9346",
+ "witness-kernel.log": "ab7e01501bc759b00ba24bb39ea9d9bf5e475a179a06f32ee13f3cb1bbc2492d",
+ "witness-type-contract.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0",
+ "proofs": [
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.lattice_shell_constant",
+ "prop_premises": [],
+ "statement": "27 * 27 = 729 \u2227 729 * 2 = 1458"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_terms_six",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.fact 6 / (2 ^ 0 * UniversalLaw.Side24.fact 0 * UniversalLaw.Side24.fact 6) = 1 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 1 * UniversalLaw.Side24.fact 1 * UniversalLaw.Side24.fact 4) = 15 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 2 * UniversalLaw.Side24.fact 2 * UniversalLaw.Side24.fact 2) = 45 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 3 * UniversalLaw.Side24.fact 3 * UniversalLaw.Side24.fact 0) = 15"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.geometric_ratio_constants",
+ "prop_premises": [],
+ "statement": "2 ^ 9 = 512 \u2227 288 * 3 = 864"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exponent_bounds",
+ "prop_premises": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "d \u2208 [2, 3]"
+ }
+ ],
+ "statement": "\u2200 (d : Nat),\n d \u2208 [2, 3] \u2192\n UniversalLaw.Side24.sixA d + 2 * UniversalLaw.Side24.sixB d < 84 \u2227\n 2 * UniversalLaw.Side24.sixA d + UniversalLaw.Side24.sixB d < 78"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_sum_six",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.pairingSum 6 = 76"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.covariance_relative_bound",
+ "prop_premises": [],
+ "statement": "2 * 10 * 3 = 60 \u2227 60 * UniversalLaw.Side24.imageConstant < 10 ^ 17"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third",
+ "prop_premises": [],
+ "statement": "58 * 9 < 23 ^ 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.odd_block_shifted_minors",
+ "prop_premises": [],
+ "statement": "3 * 1 - 1 = 2 \u2227 3 * 15 - 1 = 44 \u2227 2 * 44 - -9 * -9 = 7"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.density_comparison_below_reported",
+ "prop_premises": [],
+ "statement": "32 * 10 ^ 106 < 10 ^ 108"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.period_exponent",
+ "prop_premises": [],
+ "statement": "24 ^ 2 / 2 = 288"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.odd_block_eigenvalues",
+ "prop_premises": [],
+ "statement": "1 + 15 = 2 * 8 \u2227 1 * 15 - -3 * -3 = 6 \u2227 8 ^ 2 - 58 = 6"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_sum_le_six",
+ "prop_premises": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "q \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ }
+ ],
+ "statement": "\u2200 (q : Nat), q \u2208 [0, 1, 2, 3, 4, 5, 6] \u2192 UniversalLaw.Side24.pairingSum q \u2264 76"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.image_constant_value",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.imageConstant = 21175738586478"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten",
+ "prop_premises": [],
+ "statement": "10 * (125 ^ 20 * UniversalLaw.Side24.fact 20) < UniversalLaw.Side24.expTaylorNumerator"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.sixth_moment_double_factorial",
+ "prop_premises": [],
+ "statement": "1 * 3 * 5 = 15"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exponent_values",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.sixA 2 = 13 \u2227\n UniversalLaw.Side24.sixB 2 = 15 \u2227 UniversalLaw.Side24.sixA 3 = 25 \u2227 UniversalLaw.Side24.sixB 3 = 27"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.ratio_constant_ordering",
+ "prop_premises": [],
+ "statement": "13 \u2264 32 \u2227 28 \u2264 32"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.conditional_third_derivative_variance",
+ "prop_premises": [],
+ "statement": "15 - -3 * -3 / 1 = 6"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cube_root_simplification",
+ "prop_premises": [],
+ "statement": "6 ^ 2 * 2 = 3 * 24"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.exponential_moment_of_trace",
+ "prop_premises": [],
+ "statement": "3 + 5 = 8"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.fourth_moment_of_trace",
+ "prop_premises": [],
+ "statement": "3 * 5 ^ 2 * 3 = 25 * 9"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.hessian_block_eigenvalues",
+ "prop_premises": [],
+ "statement": "2 + 2 = 4 \u2227 3 + 2 = 5 \u2227 1 < 3 * 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.pin_determinant_and_joint_dimension",
+ "prop_premises": [],
+ "statement": "3 * 1 * 1 = 3 \u2227 2 + 1 + 2 * 3 / 2 = 6 \u2227 3 + 1 + 3 * 4 / 2 = 10"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.transverse_covariance_entries_thirds",
+ "prop_premises": [],
+ "statement": "2 + 3 + 3 = 8 \u2227 0 + 3 + 0 = 3 \u2227 2 + 0 + 0 = 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.trace_and_traceless_variances",
+ "prop_premises": [],
+ "statement": "8 + 8 + 2 * 2 = 20 \u2227 20 * 3 = 5 * 12 \u2227 8 + 8 - 2 * 2 = 12 \u2227 12 = 1 * 12 \u2227 8 - 8 = 0"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cone_moment_m1_thirds",
+ "prop_premises": [],
+ "statement": "8 = 2 * 4"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cone_moment_m2_algebra",
+ "prop_premises": [],
+ "statement": "4 * 5 = 20 \u2227 25 - 20 + 24 = 29 \u2227 4 ^ 2 * 3 = 6 * 8"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d2_endpoints_adjacent",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d2Lower < UniversalLaw.Side24.d2Upper \u2227\n UniversalLaw.Side24.d2Upper = UniversalLaw.Side24.d2Lower + 1"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3_endpoints_adjacent",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d3Lower < UniversalLaw.Side24.d3Upper \u2227\n UniversalLaw.Side24.d3Upper = UniversalLaw.Side24.d3Lower + 1"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.endpoints_in_unit_tenth",
+ "prop_premises": [],
+ "statement": "0 < UniversalLaw.Side24.d3Lower \u2227 UniversalLaw.Side24.d2Upper < 10 ^ 19"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3_below_d2",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d3Upper < UniversalLaw.Side24.d2Lower"
+ }
+ ],
+ "schema_version": 1,
+ "scientific_effect": "NONE",
+ "scope": "31 literal Main arithmetic statements only; no analytic/source parent closure",
+ "self_tests": {
+ "false_premise": "EXPECTED_REJECTION",
+ "honest": "EXPECTED_ACCEPTANCE",
+ "missing_module": "EXPECTED_REJECTION",
+ "native": "EXPECTED_REJECTION",
+ "sorry": "EXPECTED_REJECTION",
+ "unused_axiom": "EXPECTED_REJECTION",
+ "weakened_witness_types": "REJECTED_BY_EXACT_TYPE_CENSUS_AND_LEAN_ASCRIPTION"
+ },
+ "source_alignment": "NOT_INFERRED",
+ "witness_axioms": {
+ "CBZNonvacuity.dimensions_both": [
+ "Quot.sound",
+ "propext"
+ ],
+ "CBZNonvacuity.dimensions_inhabited": [
+ "Quot.sound",
+ "propext"
+ ],
+ "CBZNonvacuity.pairing_all_seven": [
+ "Quot.sound",
+ "propext"
+ ],
+ "CBZNonvacuity.pairing_domain_inhabited": [
+ "Quot.sound",
+ "propext"
+ ]
+ },
+ "witness_type_contract": {
+ "CBZNonvacuity.dimensions_both": "(2:Nat) \u2208 [2,3] \u2227 (3:Nat) \u2208 [2,3]",
+ "CBZNonvacuity.dimensions_inhabited": "\u2203 d : Nat, d \u2208 [2,3]",
+ "CBZNonvacuity.pairing_all_seven": "(0:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (1:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (2:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (3:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (4:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (5:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (6:Nat) \u2208 [0,1,2,3,4,5,6]",
+ "CBZNonvacuity.pairing_domain_inhabited": "\u2203 q : Nat, q \u2208 [0,1,2,3,4,5,6]"
+ }
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/tools/CBZNonvacuity.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/tools/CBZNonvacuity.lean
new file mode 100644
index 000000000..3efd43999
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/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/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/tools/cbz_lean_check.py b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/tools/cbz_lean_check.py
new file mode 100644
index 000000000..9c8365024
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/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/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/tools/formal_gate_check.py b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/tools/formal_gate_check.py
new file mode 100644
index 000000000..263d8674c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/tools/formal_gate_check.py
@@ -0,0 +1,403 @@
+#!/usr/bin/env python3
+"""Source-bound Lean evidence gate for the main-side formal package (stdlib only).
+
+Follows the contract of the Math- formal lane (docs/FORMAL_VERIFICATION.md,
+work item #95): a manifest is an evidence sidecar, not a scientific register.
+
+Default (source-only, no Lean run): the manifest is well formed and cannot
+self-award execution or review; every bound file matches its SHA-256; every
+Lean module is registered; no `sorry`, `native_decide` or `axiom` appears
+outside comments; the root module imports exactly the registered modules; the
+target inventory equals the theorem declarations found in those modules; every
+pinned informal source has a local byte copy with the recorded size and hash;
+every target's informal anchor is a verbatim substring of its source.
+
+`--run-lean`: additionally performs a fresh build of the pinned package, runs a
+transitive `#print axioms` audit restricted to propext / Classical.choice /
+Quot.sound, captures elaborated types, executes real negative controls
+(tightened inequalities, a wrong constant, `sorry`, an indirect custom axiom,
+`native_decide`) and writes logs plus a receipt under `.lake/formal-evidence/`.
+Only that receipt carries `kernel-checked`; the committed manifest says
+`proved`. A receipt from arbitrary input is untrusted until matched to the
+actual workflow run and checked Git commit.
+
+`--axioms-output FILE`: audit a captured `#print axioms` output without running
+Lean (for tests and split CI steps).
+
+`--alignment REVIEW.json`: validate an independently authored alignment record
+against the current manifest and scope digests. This checks structure,
+identity, coverage and lineage independence; it does not authenticate that the
+review happened and never promotes scientific status.
+
+Nothing here edits STATUS.md, PROOF_INDEX.md or any review verdict.
+"""
+from __future__ import annotations
+
+import argparse
+import hashlib
+import json
+import os
+from pathlib import Path, PurePosixPath
+import re
+import shutil
+import subprocess
+import sys
+
+ROOT = Path(__file__).resolve().parents[1]
+MANIFEST = "formal/manifest.json"
+ALLOWED = frozenset({"propext", "Classical.choice", "Quot.sound"})
+NAME = r"[A-Za-z_][A-Za-z0-9_.']*"
+AXIOM_LINE = re.compile(r"'(" + NAME + r")' (?:depends on axioms: \[([^\]]*)\]|does not depend on any axioms)")
+HEX40 = re.compile(r"[0-9a-f]{40}")
+HEX64 = re.compile(r"[0-9a-f]{64}")
+PUBLIC_REPOS = {"d6g8k5htny-coder/main", "d6g8k5htny-coder/Math-", "d6g8k5htny-coder/query-",
+ "d6g8k5htny-coder/meta-framework", "d6g8k5htny-coder/Universal-Law-Workspace"}
+THEOREM = re.compile(r"^(?:theorem|lemma)\s+(" + NAME + r")", re.M)
+NAMESPACE = re.compile(r"^namespace\s+(\S+)", re.M)
+TOOLCHAIN = "leanprover/lean4:v4.34.1"
+LEAN_COMMIT = "5045d0056413266e57c625dcd7c365b10e377c52"
+BUILD_DIR = ".lake"
+
+
+def sha(data: bytes) -> str:
+ return hashlib.sha256(data).hexdigest()
+
+
+def require(condition, message):
+ if not condition:
+ raise ValueError(message)
+
+
+def load_json(text: str):
+ def unique(pairs):
+ obj = {}
+ for key, value in pairs:
+ require(key not in obj, "duplicate JSON key: " + key)
+ obj[key] = value
+ return obj
+ return json.loads(text, object_pairs_hook=unique)
+
+
+def safe_path(root: Path, relative) -> Path:
+ require(isinstance(relative, str) and relative and "\\" not in relative, f"invalid path: {relative!r}")
+ pure = PurePosixPath(relative)
+ require(not pure.is_absolute() and ".." not in pure.parts and str(pure) == relative, f"unsafe path: {relative}")
+ path = root
+ for part in pure.parts:
+ path = path / part
+ require(not path.is_symlink(), f"symlink refused: {relative}")
+ require(path.is_file() and path.resolve().is_relative_to(root.resolve()), f"missing or escaping file: {relative}")
+ return path
+
+
+def strip_lean_comments(text: str) -> str:
+ """Remove `--` line comments and nested `/- -/` block comments. Comment text
+ cannot smuggle a proof term; the kernel audit of `sorryAx` is authoritative."""
+ out, i, depth, n = [], 0, 0, len(text)
+ while i < n:
+ two = text[i:i + 2]
+ if depth:
+ if two == "/-":
+ depth, i = depth + 1, i + 2
+ elif two == "-/":
+ depth, i = depth - 1, i + 2
+ else:
+ out.append("\n" if text[i] == "\n" else " ")
+ i += 1
+ elif two == "/-":
+ depth, i = 1, i + 2
+ elif two == "--":
+ end = text.find("\n", i)
+ i = n if end < 0 else end
+ else:
+ out.append(text[i])
+ i += 1
+ return "".join(out)
+
+
+def audit_axioms(text: str, targets: list) -> dict:
+ require(isinstance(targets, list) and targets and len(set(targets)) == len(targets), "empty or duplicate target list")
+ records = {}
+ for match in AXIOM_LINE.finditer(text):
+ name, raw = match.groups()
+ require(name in targets and name not in records, "unexpected or duplicate axiom target: " + name)
+ axioms = [] if raw is None or not raw.strip() else [a.strip() for a in raw.split(",")]
+ require(all(re.fullmatch(NAME, a) for a in axioms), "malformed axiom name")
+ require(set(axioms) <= ALLOWED, "forbidden transitive axiom: " + repr(sorted(set(axioms) - ALLOWED)))
+ records[name] = sorted(set(axioms))
+ require(not AXIOM_LINE.sub("", text).strip(), "unrecognized audit output")
+ require(set(records) == set(targets), "missing target axiom report")
+ return records
+
+
+def source_check(root: Path, manifest_rel: str = MANIFEST) -> tuple[dict, str, Path]:
+ root = root.resolve()
+ raw = safe_path(root, manifest_rel).read_bytes()
+ m = load_json(raw.decode("utf-8"))
+ require(m.get("schema_version") == 1 and m.get("scientific_effect") == "NONE", "invalid evidence schema")
+ require(m.get("scientific_status_authority") is False, "manifest must declare scientific_status_authority false")
+ require(m.get("formalization_status") == "proved" and m.get("alignment_status") == "PENDING_INDEPENDENT_REVIEW",
+ "source metadata cannot self-award execution or review")
+ for key in ("package", "package_root", "root_module", "lean_toolchain"):
+ require(isinstance(m.get(key), str) and m[key].strip(), key + " must be a nonempty string")
+ require(m["lean_toolchain"] == TOOLCHAIN, "unsupported Lean toolchain in manifest")
+ pkg_rel = m["package_root"]
+ pkg = root / pkg_rel
+ require(pkg.is_dir() and not pkg.is_symlink(), "package root missing")
+ files = m.get("files")
+ require(isinstance(files, dict) and files, "empty file manifest")
+ for name, digest in files.items():
+ require(isinstance(digest, str) and HEX64.fullmatch(digest), "invalid source hash: " + name)
+ require(sha(safe_path(root, name).read_bytes()) == digest, "source hash mismatch: " + name)
+ required = {f"{pkg_rel}/lean-toolchain", f"{pkg_rel}/lakefile.toml", f"{pkg_rel}/lake-manifest.json",
+ f"{pkg_rel}/{m['root_module']}.lean", f"{pkg_rel}/SCOPE.md", f"{pkg_rel}/GLOSSARY.md",
+ f"{pkg_rel}/README.md", "tools/formal_gate_check.py", "tests/test_formal_gate.py"}
+ require(required <= set(files), "unbound control or scope file: " + repr(sorted(required - set(files))))
+ require((pkg / "lean-toolchain").read_text(encoding="utf-8").strip() == TOOLCHAIN, "wrong Lean toolchain file")
+ lock = load_json((pkg / "lake-manifest.json").read_text(encoding="utf-8"))
+ packages = lock.get("packages", [])
+ require(isinstance(packages, list), "invalid lake manifest")
+ actual = {p["name"]: p["rev"] for p in packages}
+ require(len(actual) == len(packages), "duplicate dependency")
+ require(actual == m.get("dependency_revisions"), "dependency lock mismatch")
+ require(all(HEX40.fullmatch(v) for v in actual.values()), "unpinned dependency")
+ modules = m.get("source_modules")
+ require(isinstance(modules, list) and modules and len(set(modules)) == len(modules), "invalid source module list")
+ expected_root = "".join("import " + path[:-5].replace("/", ".") + "\n" for path in modules)
+ root_text = strip_lean_comments((pkg / (m["root_module"] + ".lean")).read_text(encoding="utf-8"))
+ require("".join(line + "\n" for line in root_text.splitlines() if line.strip()) == expected_root,
+ "root must only import registered modules")
+ names = []
+ for path in modules:
+ require(f"{pkg_rel}/{path}" in files and path.endswith(".lean"), "unbound source module: " + path)
+ text = strip_lean_comments((pkg / path).read_text(encoding="utf-8"))
+ require(not re.search(r"\bsorry\b", text), "sorry in " + path)
+ require(not re.search(r"\bnative_decide\b", text), "native_decide in " + path)
+ require(not re.search(r"^\s*axiom\b", text, re.M), "custom axiom declaration in " + path)
+ namespaces = NAMESPACE.findall(text)
+ require(len(namespaces) == 1, "each module must open exactly one namespace: " + path)
+ names.extend(namespaces[0] + "." + n for n in THEOREM.findall(text))
+ targets = m.get("targets")
+ require(isinstance(targets, list) and targets, "empty target list")
+ target_names = []
+ sources = {s["id"]: s for s in m.get("sources", [])} if isinstance(m.get("sources"), list) else None
+ require(isinstance(sources, dict) and sources, "sources must be a nonempty list")
+ source_text = {}
+ for s in m["sources"]:
+ require(set(s) == {"id", "repository", "commit", "path", "bytes", "sha256", "local_copy"}, "source rows have a fixed schema")
+ require(s["repository"] in PUBLIC_REPOS, "nonpublic source repository refused: " + str(s["repository"]))
+ require(isinstance(s["commit"], str) and HEX40.fullmatch(s["commit"]), "invalid commit for " + s["id"])
+ require(isinstance(s["sha256"], str) and HEX64.fullmatch(s["sha256"]), "invalid sha256 for " + s["id"])
+ require(type(s["bytes"]) is int and s["bytes"] > 0, "invalid byte count for " + s["id"])
+ payload = safe_path(root, s["local_copy"]).read_bytes()
+ require(len(payload) == s["bytes"] and sha(payload) == s["sha256"], "local copy differs from pinned bytes: " + s["id"])
+ require(s["local_copy"] in files, "pinned source copy not bound in files: " + s["local_copy"])
+ source_text[s["id"]] = payload.decode("utf-8")
+ for t in targets:
+ require(isinstance(t, dict) and set(t) == {"name", "module", "title", "source", "informal_anchor", "does_not_claim"},
+ "target rows have a fixed schema")
+ require(isinstance(t["name"], str) and re.fullmatch(NAME, t["name"]), "invalid target name")
+ require(t["module"] in modules, "target module not registered: " + t["name"])
+ for key in ("title", "does_not_claim"):
+ require(isinstance(t[key], str) and t[key].strip(), f"{t['name']}: {key} must be nonempty")
+ require(t["source"] in source_text, f"{t['name']}: unknown source")
+ require(isinstance(t["informal_anchor"], str) and t["informal_anchor"].strip(), f"{t['name']}: empty informal anchor")
+ require(t["informal_anchor"] in source_text[t["source"]], f"{t['name']}: informal anchor is not a verbatim substring of its source")
+ target_names.append(t["name"])
+ require(target_names == names, "target inventory differs from source declarations")
+ lean_files = {p.relative_to(pkg).as_posix() for p in pkg.rglob("*.lean") if BUILD_DIR not in p.relative_to(pkg).parts}
+ require(lean_files == set(modules) | {m["root_module"] + ".lean"}, "unregistered Lean module: " + repr(sorted(lean_files - set(modules) - {m['root_module'] + '.lean'})))
+ for p in pkg.rglob("*"):
+ rel = p.relative_to(root).as_posix()
+ if p.is_file() and BUILD_DIR not in p.relative_to(pkg).parts and rel not in files:
+ require(rel in set(m.get("unbound_files", [])), "file in package not bound or declared unbound: " + rel)
+ return m, sha(raw), pkg
+
+
+def lake_binary() -> str | None:
+ found = shutil.which("lake")
+ if found:
+ return found
+ candidate = Path.home() / ".elan/bin/lake"
+ return str(candidate) if candidate.is_file() else None
+
+
+def check_lean_version(text: str) -> str:
+ pin = re.fullmatch(r"leanprover/lean4:v(\d+\.\d+\.\d+)", TOOLCHAIN)
+ require(pin is not None, "unsupported pinned Lean toolchain")
+ version = text.strip()
+ record = (r"Lean \(version " + re.escape(pin.group(1))
+ + r", [A-Za-z0-9_.+-]+, commit " + LEAN_COMMIT + r", Release\)")
+ require(re.fullmatch(record, version) is not None,
+ "unexpected running Lean version")
+ return version
+
+
+def run(command, label, out: Path, cwd: Path, env, expect_success=True):
+ result = subprocess.run(command, cwd=cwd, text=True, stdout=subprocess.PIPE, stderr=subprocess.STDOUT, timeout=900, env=env)
+ (out / (label + ".log")).write_text(result.stdout, encoding="utf-8")
+ print(label + ": exit " + str(result.returncode), flush=True)
+ require((result.returncode == 0) == expect_success, "unexpected process outcome: " + label + "\n" + result.stdout[-6000:])
+ return result.stdout
+
+
+def negative_controls(m: dict, pkg: Path) -> dict:
+ """Real mutation controls: each must be rejected by Lean or by the axiom gate."""
+ root_import = "import " + m["root_module"] + "\n"
+ cases = {}
+ for label, spec in m.get("negative_controls", {}).items():
+ module_text = (pkg / spec["module"]).read_text(encoding="utf-8")
+ require(spec["replace"] in module_text, "negative control text not found: " + label)
+ cases[label] = (module_text.replace(spec["replace"], spec["with"]), False, None)
+ cases["sorry"] = (root_import + "theorem injected : False := by sorry\n#print axioms injected\n", True, "injected")
+ cases["custom_imported"] = (root_import + "axiom hiddenPremise : False\ntheorem middle : False := hiddenPremise\n"
+ "theorem injected : False := middle\n#print axioms injected\n", True, "injected")
+ cases["native"] = (root_import + "theorem injected : (2 : Nat) + 2 = 4 := by native_decide\n#print axioms injected\n", True, "injected")
+ return cases
+
+
+def execute(m: dict, digest: str, pkg: Path, root: Path) -> dict:
+ lake = lake_binary()
+ require(lake is not None, "lake not found on PATH or in ~/.elan/bin")
+ env = dict(os.environ, PATH=f"{Path(lake).parent}{os.pathsep}{os.environ.get('PATH', '')}")
+ out = pkg / BUILD_DIR / "formal-evidence"
+ out.mkdir(parents=True, exist_ok=True)
+ require(not (pkg / BUILD_DIR).is_symlink() and not (pkg / BUILD_DIR / "build").is_symlink(), "symlink build directory")
+ check_lean_version(run([lake, "env", "lean", "--version"], "preflight-version", out, pkg, env))
+ if (pkg / BUILD_DIR / "build").exists():
+ shutil.rmtree(pkg / BUILD_DIR / "build")
+ targets = [t["name"] for t in m["targets"]]
+ run([lake, "build"], "build", out, pkg, env)
+ run([lake, "env", "leanchecker", m["root_module"]], "leanchecker", out, pkg, env)
+ audit = out / "Audit.lean"
+ audit.write_text("import " + m["root_module"] + "\n" + "\n".join("#print axioms " + n for n in targets) + "\n", encoding="utf-8")
+ axioms = audit_axioms(run([lake, "env", "lean", str(audit)], "axioms", out, pkg, env), targets)
+ types = out / "Types.lean"
+ types.write_text("import " + m["root_module"] + "\nset_option pp.explicit true\n" + "\n".join("#check " + n for n in targets) + "\n", encoding="utf-8")
+ run([lake, "env", "lean", str(types)], "elaborated-types", out, pkg, env)
+ outcomes = {}
+ for label, (source, succeeds, target) in negative_controls(m, pkg).items():
+ path = out / (label + ".lean")
+ path.write_text(source, encoding="utf-8")
+ log = run([lake, "env", "lean", str(path)], label, out, pkg, env, succeeds)
+ if target:
+ matches = list(AXIOM_LINE.finditer(log))
+ require(matches, "negative control missing axiom report: " + label)
+ try:
+ audit_axioms("\n".join(x.group() for x in matches), [target])
+ except ValueError:
+ outcomes[label] = "REJECTED_BY_AXIOM_GATE"
+ else:
+ raise ValueError("negative control escaped: " + label)
+ else:
+ require("is false" in log or "unsolved goals" in log or "failed" in log, "negative control did not fail on its proof goal: " + label)
+ outcomes[label] = "REJECTED_BY_LEAN"
+ _, after, _ = source_check(root)
+ require(after == digest, "manifest changed during execution")
+ version = check_lean_version(run([lake, "env", "lean", "--version"], "version", out, pkg, env))
+ head = subprocess.run(["git", "rev-parse", "HEAD"], cwd=root, text=True, capture_output=True).stdout.strip()
+ require(HEX40.fullmatch(head or ""), "missing exact checked commit")
+ receipt = dict(schema_version=1, scientific_effect="NONE", scientific_status_authority=False,
+ package=m["package"], formalization_status="kernel-checked",
+ alignment_status="PENDING_INDEPENDENT_REVIEW", manifest_sha256=digest, checked_commit=head,
+ repository=os.environ.get("GITHUB_REPOSITORY"), workflow_run_id=os.environ.get("GITHUB_RUN_ID"),
+ lean_version=version, dependency_revisions=m["dependency_revisions"], axioms=axioms,
+ negative_controls=outcomes)
+ receipt["logs"] = {p.name: sha(p.read_bytes()) for p in sorted(out.glob("*.log"))}
+ (out / "receipt.json").write_text(json.dumps(receipt, indent=2, sort_keys=True) + "\n", encoding="utf-8")
+ return receipt
+
+
+def check_alignment(review: dict, manifest_digest: str, targets: list, scope_digest: str):
+ require(isinstance(review, dict), "review must be object")
+ require(review.get("disposition") == "ACCEPTED", "alignment not accepted")
+ require(review.get("manifest_sha256") == manifest_digest, "stale alignment manifest")
+ require(review.get("scope_sha256") == scope_digest, "stale alignment scope")
+ covered = review.get("targets", [])
+ require(isinstance(covered, list) and len(covered) == len(set(covered)) and set(covered) == set(targets), "partial or ambiguous review")
+ a, r = review.get("author", {}), review.get("reviewer", {})
+ for key in ("provider", "family", "agent"):
+ require(isinstance(a.get(key), str) and a[key].strip() and isinstance(r.get(key), str) and r[key].strip(), "missing review lineage")
+ require(a[key].strip().casefold() != r[key].strip().casefold(), "lineage not independent: " + key)
+ e = review.get("evidence", {})
+ require(isinstance(e.get("repository"), str) and re.fullmatch(r"[^/\s]+/[^/\s]+", e["repository"]), "missing evidence repo")
+ require(isinstance(e.get("commit"), str) and HEX40.fullmatch(e["commit"]), "mutable review ref")
+ require(isinstance(e.get("sha256"), str) and HEX64.fullmatch(e["sha256"]), "missing review hash")
+ require(isinstance(e.get("path"), str) and e["path"] and not PurePosixPath(e["path"]).is_absolute()
+ and ".." not in PurePosixPath(e["path"]).parts, "missing or unsafe review path")
+
+
+def render_alignment(m: dict) -> str:
+ lines = ["# Informal–formal alignment table", "",
+ f"Generated from `{MANIFEST}` by `tools/formal_gate_check.py --write-alignment`; do not hand-edit.",
+ "Each row pairs one Lean target with the verbatim informal text it is attached to. The kernel checks the",
+ "declaration; the independent alignment review (see REVIEW_LANE.md) checks that the declaration says what",
+ "the anchor says. Source-level formalization status of every row is `proved`; only a trusted run receipt",
+ "reports `kernel-checked`. Nothing here is a Layer 0 review outcome.", "",
+ "| Lean target | Title | Informal anchor | Source | Does not claim |", "|---|---|---|---|---|"]
+ for t in m["targets"]:
+ anchor = "`" + " ".join(t["informal_anchor"].split()).replace("`", "'").replace("|", "\\|") + "`"
+ cells = [f"`{t['name']}`", t["title"].replace("|", "\\|"), anchor, t["source"], t["does_not_claim"].replace("|", "\\|")]
+ lines.append("| " + " | ".join(cells) + " |")
+ lines.append("")
+ return "\n".join(lines)
+
+
+def refresh_hashes(root: Path, manifest_rel: str = MANIFEST) -> int:
+ path = safe_path(root, manifest_rel)
+ m = load_json(path.read_text(encoding="utf-8"))
+ changed = 0
+ for name in list(m["files"]):
+ digest = sha(safe_path(root, name).read_bytes())
+ if m["files"][name] != digest:
+ m["files"][name] = digest
+ changed += 1
+ path.write_text(json.dumps(m, indent=2, ensure_ascii=False) + "\n", encoding="utf-8")
+ return changed
+
+
+def main(argv=None) -> int:
+ p = argparse.ArgumentParser(description=__doc__, formatter_class=argparse.RawDescriptionHelpFormatter)
+ p.add_argument("--root", type=Path, default=ROOT)
+ p.add_argument("--manifest", default=MANIFEST)
+ p.add_argument("--run-lean", action="store_true", help="fresh build, leanchecker, axiom audit, negative controls, receipt")
+ p.add_argument("--axioms-output", type=Path, help="audit a captured #print axioms output without running Lean")
+ p.add_argument("--alignment", type=Path, help="validate an independently authored alignment record; never promotes science")
+ p.add_argument("--alignment-table", default="formal/ALIGNMENT.md", help="generated table to compare against the manifest")
+ p.add_argument("--write-alignment", action="store_true", help="regenerate the alignment table and exit")
+ p.add_argument("--refresh-hashes", action="store_true", help="rewrite manifest file hashes from disk and exit")
+ args = p.parse_args(argv)
+ root = args.root.resolve()
+ try:
+ if args.refresh_hashes:
+ print(f"updated {refresh_hashes(root, args.manifest)} file hashes in {args.manifest}")
+ return 0
+ m, digest, pkg = source_check(root, args.manifest)
+ if args.write_alignment:
+ (root / args.alignment_table).write_text(render_alignment(m), encoding="utf-8")
+ print("wrote " + args.alignment_table)
+ return 0
+ require(safe_path(root, args.alignment_table).read_text(encoding="utf-8") == render_alignment(m),
+ "alignment table differs from the manifest rendering; regenerate with --write-alignment")
+ if args.alignment:
+ check_alignment(load_json(args.alignment.read_text(encoding="utf-8")), digest,
+ [t["name"] for t in m["targets"]], m["files"][f"{m['package_root']}/SCOPE.md"])
+ print("ALIGNMENT_RECORD_STRUCTURE_PASS (identity, coverage and lineage only; the review itself must be retrieved and authenticated)")
+ if args.axioms_output:
+ axioms = audit_axioms(args.axioms_output.read_text(encoding="utf-8"), [t["name"] for t in m["targets"]])
+ print(json.dumps({"axiom_audit": axioms, "manifest_sha256": digest}, indent=2, sort_keys=True))
+ if args.run_lean:
+ print(json.dumps(execute(m, digest, pkg, root), indent=2, sort_keys=True))
+ elif not args.axioms_output:
+ print("SOURCE_IDENTITY_PASS (not a Lean build or scientific acceptance): " + digest)
+ print(json.dumps({"package": m["package"], "targets": len(m["targets"]), "sources": len(m["sources"]),
+ "formalization_status": m["formalization_status"], "alignment_status": m["alignment_status"]},
+ sort_keys=True))
+ except (ValueError, KeyError, TypeError, OSError, UnicodeDecodeError, subprocess.SubprocessError) as e:
+ print("FORMAL_GATE_FAIL: " + str(e), file=sys.stderr)
+ return 1
+ return 0
+
+
+if __name__ == "__main__":
+ sys.exit(main())
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-receipt-observation.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-receipt-observation.json
new file mode 100644
index 000000000..8197b7b4a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-receipt-observation.json
@@ -0,0 +1,52 @@
+{
+ "observed_utc": "2026-10-29T17:58:49.831247+00:00",
+ "receipt_sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c",
+ "checked_commit": "a7f602241f759285190d8deebfefb017a6167ee8",
+ "audit_input_sha256": {
+ "tools/CBZNonvacuity.lean": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f",
+ "tools/cbz_lean_check.py": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d",
+ "tools/formal_gate_check.py": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5"
+ },
+ "version": "Lean (version 4.34.1, x86_64-unknown-linux-gnu, commit 5045d0056413266e57c625dcd7c365b10e377c52, Release)",
+ "self_tests": {
+ "false_premise": "EXPECTED_REJECTION",
+ "honest": "EXPECTED_ACCEPTANCE",
+ "missing_module": "EXPECTED_REJECTION",
+ "native": "EXPECTED_REJECTION",
+ "sorry": "EXPECTED_REJECTION",
+ "unused_axiom": "EXPECTED_REJECTION",
+ "weakened_witness_types": "REJECTED_BY_EXACT_TYPE_CENSUS_AND_LEAN_ASCRIPTION"
+ },
+ "proofs": 31,
+ "constants": 45,
+ "audit_constants": 4,
+ "witness_type_contract": {
+ "CBZNonvacuity.dimensions_both": "(2:Nat) \u2208 [2,3] \u2227 (3:Nat) \u2208 [2,3]",
+ "CBZNonvacuity.dimensions_inhabited": "\u2203 d : Nat, d \u2208 [2,3]",
+ "CBZNonvacuity.pairing_all_seven": "(0:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (1:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (2:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (3:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (4:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (5:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (6:Nat) \u2208 [0,1,2,3,4,5,6]",
+ "CBZNonvacuity.pairing_domain_inhabited": "\u2203 q : Nat, q \u2208 [0,1,2,3,4,5,6]"
+ },
+ "fresh_kernel": "PASS",
+ "live_log_match": {
+ "all-declarations-and-witnesses.log": true,
+ "auditor-module-census.log": true,
+ "false_premise-audit.log": true,
+ "false_premise-compile.log": true,
+ "fresh-kernel.log": true,
+ "honest-audit.log": true,
+ "honest-compile.log": true,
+ "missing-module.log": true,
+ "native-audit.log": true,
+ "native-compile.log": true,
+ "sorry-audit.log": true,
+ "sorry-compile.log": true,
+ "unused_axiom-audit.log": true,
+ "unused_axiom-compile.log": true,
+ "weakened-witness-audit.log": true,
+ "weakened-witness-compile.log": true,
+ "weakened-witness-contract.log": true,
+ "witness-kernel.log": true,
+ "witness-type-contract.log": true
+ },
+ "baseline_receipt_matches": true
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEW.md b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEW.md
new file mode 100644
index 000000000..b006effde
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEW.md
@@ -0,0 +1,99 @@
+# CBZ tools — independent engineering review
+
+**Final reviewed-source disposition: CBZ-R1, CBZ-R2 and CBZ-R3 ADDRESSED. No unresolved findings remain in this reviewed tool scope.** Three Important findings were reproduced and fixed by their original authors; no Critical or Minor findings were established. Final mission/commit execution remains a separate qualification. This is a finite engineering review of evidence validation and cleanup safety, not scientific truth, statement alignment or CBZ-0 certification. The previous source-workflows review remains frozen B and is not reopened.
+
+Actual reviewer: `/root/source_workflows_review_1029`, separate OpenAI GPT-6-family agent, neither implementer of these tools nor author of their fixes. Same-family engineering scope only; no family-diversity or organizational-independence credit. Scientific effect NONE. No Git/source index/ref changes, original-file mutations, real remote mutations or subagents were used. Adversarial mutations were confined to disposable fixtures; reports and probe programs remain in this directory.
+
+Scope: `tools/cbz_lean_check.py`, `tools/CBZNonvacuity.lean`, `tools/cbz_refs.py`, `tools/cbz_storage.py` and their three matching tests. Existing `formal_gate_check.py` and exact pinned LeanChecker implementation were read as consumed contracts. `cbz_audit.py` and the in-flight baseline implementation are excluded and were not reviewed. Registry reports and the owner mission were read to assess stated guarantees.
+
+## Source identities
+
+Original reviewed source, recorded before fixes in `REVIEWED_SOURCE.json`:
+
+| Path | SHA-256 |
+| --- | --- |
+| `tools/cbz_lean_check.py` | `7b716e0507c0963510af5d276d1b900378df1cb630c5888551db3f939b333e75` |
+| `tools/CBZNonvacuity.lean` | `b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f` |
+| `tools/cbz_refs.py` | `186a090c2dd536f3e21dbaf71d9a11e48281fcb6644bbc74653543774180bc24` |
+| `tools/cbz_storage.py` | `a0aee53dec348bf5bc40016b4956fae41b1a672a36942fcb9160398a399379ae` |
+| `tests/test_cbz_lean_check.py` | `cabf2ba2f705b3b289482468f55de77e86a727a01f223ce47832ec8dd0ab5150` |
+| `tests/test_cbz_refs.py` | `091ce8c4fb16f5dbe79dc97cab52428af9430100548237672f2ef5505e39e6a5` |
+| `tests/test_cbz_storage.py` | `8fc7303a983fc626f3aa9a422451812db25e4cbe8ff2b3054b77274127afaefb` |
+
+These matched the supplied worker registry identities. Subsequent fixes were made by the original authors after findings were reported; original findings/evidence remain preserved.
+
+## Strengths and checked boundaries
+
+- Ref archival uses a new standalone bare repository, exact canonical embedded manifest, exact original branch tips as archive-commit parents, object-format matching, original annotated-tag IDs, independent fresh remote archive fetches and full Git fsck. Branch deletion is one atomic push with an explicit expected-old lease for every deleted branch. Default/protected/active exclusions and exact state checks are present; failed operations do not return cleanup success. Tests include actual server-hook rejection and changed-ref races.
+- Storage apply verifies a separately supplied digest, canonical plan bytes and a complete freshly re-derived plan before any mutation. Same-device/byte/mode/owner eligibility, no-follow file opening, path checks, content rechecks, temporary hardlink replacement and post-apply verification are meaningful. It does not pretend hardlinks retain independent future-write semantics.
+- The Main wrapper calls the existing source-bound pinned gate, captures all selected module declarations rather than just named proofs, rejects transitive forbidden axioms and project axioms, separates theorem constants from definitions, and rejects unexpected proposition premises. Actual compiled controls exercise sorry, native computation, unused axioms, False premises and missing modules. The current four witness statements inspected are the intended finite-domain statements; no original mathematical statement was edited by this work.
+- Pinned LeanChecker source was inspected: normal module arguments select a module-name prefix; `--fresh UniversalLaw` selects the one root module and replays all its imported/project constants into an empty kernel environment. The reviewed call does not accidentally select only an empty root. The named witness module has its own kernel replay. This is Lean's own kernel, not an independent external verifier.
+- Independent disposable real-Lean controls additionally showed that both ordinary and `module`-header private unused custom axioms are rejected by the census (`private-axiom-probe.json`). No hidden-private-axiom gap was reproduced.
+
+## Important findings
+
+### CBZ-R1 — Original tag retention was not verified before claiming archive completeness
+
+Original location: `tools/cbz_refs.py`, `verify_snapshot`, original lines 229–259. It checked original tag object existence and peeled identity but did not require the original local tag refs to remain present. `git fsck` succeeds for an unreferenced but still present object.
+
+Independent reproduction in `probe_safety.py` / `safety-probe-report.json`: created a disposable remote with a lightweight tag pointing to a unique blob, made a snapshot, deleted only that tag from the local snapshot, and called `verify_snapshot`. It returned `verified: true`. After fixture-only reflog expiry/GC the tag-only blob disappeared. The original disposable remote tag remained intact. The successful verification therefore overstated durable standalone archive coverage. The same risk applies to annotated tag objects and tag-only histories.
+
+**Successor disposition: ADDRESSED.** Reviewed `verify_snapshot` successor lines 232–238 now require exact local head/tag membership equal to original manifest tags plus archive tag, reject any extra heads/tags, and require detached HEAD exactly at the archive commit. Missing original tags cannot pass simply because their objects have not yet been collected.
+
+Independently reran the original tag-only-blob case in `probe_safety_successor.py`: intact archive accepted; removal refused while the object was still present (`safety-successor-report.json`). Read author 26/26 normal and optimized passing tests, including missing annotated tag, blob/tree tag-only objects, unexpected heads/tags and incorrect HEAD. Successor identities:
+
+- Tool `f26c6f8f13aac2b967a8c03cf4ca9643a875a93ebd0855a732576e8fdceaca85`.
+- Tests `87894edca7a54974ff53af31e8d3a696643633c148d591d410709b28881916de`.
+
+No live snapshot or remote was mutated by this review or its verification.
+
+### CBZ-R2 — Hardlink grouping discarded distinct extended attributes
+
+Original locations: `tools/cbz_storage.py:54–74` (`file_record`), `make_plan` grouping and `same_content`. File identity/grouping considered device, bytes, mode, uid/gid and byte hash, but did not capture or refuse xattrs. Atomic replacement substitutes the source inode's attributes for the target's.
+
+Independent reproduction in `probe_safety.py` / `safety-probe-report.json`: two equal-byte/equal-mode/equal-owner disposable regular files, with `user.review-note` only on the target, produced one operation. Apply erased the target attribute and reported `content_paths_modes_verified: true`. ACLs/capabilities and other xattr metadata likewise cannot be presumed equivalent from mode/ownership alone. This is a destructive metadata-safety issue, not a claim that a previous real storage operation lost such metadata.
+
+**Successor disposition: ADDRESSED for new uses.** Successor `require_no_xattrs` and `file_record` refuse nonempty descriptor xattrs and enumeration failures before/after hashing; per-operation rechecks use the same function. This is a conservative refusal instead of silently broadening metadata-copy semantics.
+
+Independent successor probe refused the original pair before planning/mutation; target metadata remained present and the inodes stayed distinct. Read author 13/13 normal and optimized passing tests, including xattr enumeration failure and a newly added attribute before replacement. Successor identities:
+
+- Tool `c829d392e00601d7876a2530a8bff02b7f913cff7bed2dec29df69d796b4ff9a`.
+- Tests `5efc1289a0d13e266cd1143b7f6b1946efb29a24deba718eb0170093f67b1295`.
+
+Historical apply receipts did not capture pre-apply xattrs. A later clean scan cannot prove attributes were absent before those operations. Their original byte/path/mode/owner claims retain that exact scope; no retroactive all-metadata preservation claim is made.
+
+### CBZ-R3 — Witness names/axioms were accepted without enforcing witness propositions
+
+Original location: `tools/cbz_lean_check.py:162–168` and `validate_census`. The wrapper checks that the four expected names are theorem constants with allowed axioms/no unsupported proposition premises, but does not check that their propositions are the finite-domain witnesses the wrapper relies on. An expected name alone is not a witness contract.
+
+Independent reproduction in `probe_witness_contract.py` / `witness-contract-probe.json`: compiled a disposable real Lean module with the four exact expected witness names, each proving only `True`. Generated the real census using `audit_program`, ran Lean successfully, then passed its real output to the production `validate_census`. All four were accepted with statements `True`. This is an audit-stage reproduction, not an asserted full wrapper replay. The actual original witness source remains correct; the issue is the validator's acceptance of weakened replacements and its resulting nonvacuity claim.
+
+**Successor disposition: ADDRESSED.** Reviewed the original author's independent `WITNESS_TYPES`/`WITNESS_PROPOSITIONS` contracts, exact census comparison, generated Lean type ascriptions, and real weakened-witness control. The expected propositions are generated from the Python validator rather than copied from the candidate witness source. The actual witness declarations remain unchanged. The receipt now includes the exact type contract.
+
+Independently executed `probe_witness_successor.py` using disposable actual Lean modules. Same-named `True` witnesses compile but are rejected both by the census and all four Lean type ascriptions. A fresh compilation of the actual witness source passes both boundaries. Results and exact commands are preserved in `witness-successor-probe.json` and its script. This is bounded audit-stage verification, not a repeated full Main kernel run.
+
+Read original-author 19/19 normal and optimized protocol tests and full-wrapper exit0 with seven actual controls. Preserved runtime receipt identifies 31 proofs, 45 project constants, four witness constants/type contracts and full fresh-kernel PASS. Successor identities:
+
+- Tool `a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d`.
+- Tests `8642d2bb63acf3d9ab56c89dad4132449f6b9b964431ca14ce9cf52ed3eac3d6`.
+- Witness file unchanged: `b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f`.
+
+At 17:58:49 UTC, the R3 receipt SHA-256 was `b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c`, checked_commit `a7f602241f759285190d8deebfefb017a6167ee8`; all 19 named log hashes, source-input hashes and the baseline receipt hash matched actual files. The matched receipt, baseline receipt, logs and three input sources were copied with hash checks to `R3-observed-run/` before later mutable evidence could replace them. This establishes that observed R3 run only; it does not bind any subsequent integration commit or supply the final mission seal.
+
+## Receipt binding, observed execution and limits
+
+Read actual `portable-main-receipt.json`, `portable-main-final-run.log/.exit`, the registry and relevant kernel/control logs. The preserved receipt identifies manifest `38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0`, commit `f20cc54d4d136e854608853372249882eb4c949f`, original helper/source hashes above, 45 project constants, 31 theorem constants and four witness constants; current original witness types were inspected. Version text identifies Lean 4.34.1 commit `5045d0056413266e57c625dcd7c365b10e377c52`. The wrapper's actual command arrays were inspected: named witness kernel replay and `leanchecker -v --fresh` with the manifest root are explicit; output logs are hashed in the receipt. The receipt does not separately serialize an argv/exit ledger, so this review does not claim one exists.
+
+A read-only observation of mutable live evidence at 17:54:10 UTC found the current CBZ receipt still referring to baseline hash `2f028a…`, while the live formal baseline receipt had hash `2cce1c…`. Details are in `live-receipt-observation.json`. The read was not atomic and other gate runs were in progress, so it is not attributed as a completed-run failure or an invalidation of historical retained evidence. It does establish that those live files cannot presently be combined as one coherent final receipt. Root confirmed the final sequence will run all suites first, then one complete wrapper invocation serially with no Main concurrency and exact final commit/helper binding.
+
+The wrapper reuses fixed output names; source and receipt hashes must be consumed together with their actual run context. Historical observed execution does not automatically rebind to fixes, a new commit, a new binary/version or a concurrently replaced baseline receipt. The author’s original execution reports are evidence consumed, not newly rerun kernel proof by this reviewer. The source-bound R3 successor runtime observation above closes the reviewed witness defect. No final CBZ/global regression/hosted result or later-commit execution is inferred.
+
+## Scope exclusions and retained assumptions
+
+- Mathematical truth, semantic alignment to papers, Gaussian/interface/Palm applicability, Math- closure, whole-federation CBZ status and scientific acceptance are excluded. Literal finite-domain witness validation is an engineering protocol check, not a scientific alignment review.
+- Ref scope is advertised heads/tags and default HEAD. Hidden refs, PR objects, stashes, dirty worktrees, protected/active branch discovery and quarantine/disposition indexing require caller-owned inventories. The tool explicitly requires the complete policy inventory; no hosting-policy inference was credited.
+- Atomic leases guard each requested deletion; they are not a server-wide lock on unrelated concurrent changes. Final-state refusal after a successful atomic push can require recovery. That documented limit is not a claim that no deletion occurred on every failed post-check.
+- Storage is for stable, explicitly selected immutable files. Shared-write semantics, deliberate inode/link-count changes and non-preserved per-path timestamps are documented. No concurrent-writer linearizability or adversarial directory-swap guarantee is inferred from ordinary path checks.
+- No false historical metadata restoration is claimed for the xattr fix. No in-flight audit/baseline implementation was reviewed. No unchanged full suite or expensive full kernel replay was repeated solely to restate worker evidence.
+
+This report preserves the initial findings and exact successor dispositions. All three are addressed on the stated hashes. Future final-seal output remains separate and is not assumed passing.
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEW.pending-R3.md b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEW.pending-R3.md
new file mode 100644
index 000000000..db2051b72
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEW.pending-R3.md
@@ -0,0 +1,89 @@
+# CBZ tools — independent engineering review
+
+**Current disposition: AMEND for CBZ-R3. CBZ-R1 and CBZ-R2 are addressed in reviewed successor bytes.** Three Important findings were reproduced; no Critical finding was established. This is a finite engineering review of evidence validation and cleanup safety, not scientific truth, statement alignment or CBZ-0 certification. The previous source-workflows review remains frozen B and is not reopened.
+
+Actual reviewer: `/root/source_workflows_review_1029`, separate OpenAI GPT-6-family agent, neither implementer of these tools nor author of their fixes. Same-family engineering scope only; no family-diversity or organizational-independence credit. Scientific effect NONE. No Git/source index/ref changes, original-file mutations, real remote mutations or subagents were used. Adversarial mutations were confined to disposable fixtures; reports and probe programs remain in this directory.
+
+Scope: `tools/cbz_lean_check.py`, `tools/CBZNonvacuity.lean`, `tools/cbz_refs.py`, `tools/cbz_storage.py` and their three matching tests. Existing `formal_gate_check.py` and exact pinned LeanChecker implementation were read as consumed contracts. `cbz_audit.py` and the in-flight baseline implementation are excluded and were not reviewed. Registry reports and the owner mission were read to assess stated guarantees.
+
+## Source identities
+
+Original reviewed source, recorded before fixes in `REVIEWED_SOURCE.json`:
+
+| Path | SHA-256 |
+| --- | --- |
+| `tools/cbz_lean_check.py` | `7b716e0507c0963510af5d276d1b900378df1cb630c5888551db3f939b333e75` |
+| `tools/CBZNonvacuity.lean` | `b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f` |
+| `tools/cbz_refs.py` | `186a090c2dd536f3e21dbaf71d9a11e48281fcb6644bbc74653543774180bc24` |
+| `tools/cbz_storage.py` | `a0aee53dec348bf5bc40016b4956fae41b1a672a36942fcb9160398a399379ae` |
+| `tests/test_cbz_lean_check.py` | `cabf2ba2f705b3b289482468f55de77e86a727a01f223ce47832ec8dd0ab5150` |
+| `tests/test_cbz_refs.py` | `091ce8c4fb16f5dbe79dc97cab52428af9430100548237672f2ef5505e39e6a5` |
+| `tests/test_cbz_storage.py` | `8fc7303a983fc626f3aa9a422451812db25e4cbe8ff2b3054b77274127afaefb` |
+
+These matched the supplied worker registry identities. Subsequent fixes were made by the original authors after findings were reported; original findings/evidence remain preserved.
+
+## Strengths and checked boundaries
+
+- Ref archival uses a new standalone bare repository, exact canonical embedded manifest, exact original branch tips as archive-commit parents, object-format matching, original annotated-tag IDs, independent fresh remote archive fetches and full Git fsck. Branch deletion is one atomic push with an explicit expected-old lease for every deleted branch. Default/protected/active exclusions and exact state checks are present; failed operations do not return cleanup success. Tests include actual server-hook rejection and changed-ref races.
+- Storage apply verifies a separately supplied digest, canonical plan bytes and a complete freshly re-derived plan before any mutation. Same-device/byte/mode/owner eligibility, no-follow file opening, path checks, content rechecks, temporary hardlink replacement and post-apply verification are meaningful. It does not pretend hardlinks retain independent future-write semantics.
+- The Main wrapper calls the existing source-bound pinned gate, captures all selected module declarations rather than just named proofs, rejects transitive forbidden axioms and project axioms, separates theorem constants from definitions, and rejects unexpected proposition premises. Actual compiled controls exercise sorry, native computation, unused axioms, False premises and missing modules. The current four witness statements inspected are the intended finite-domain statements; no original mathematical statement was edited by this work.
+- Pinned LeanChecker source was inspected: normal module arguments select a module-name prefix; `--fresh UniversalLaw` selects the one root module and replays all its imported/project constants into an empty kernel environment. The reviewed call does not accidentally select only an empty root. The named witness module has its own kernel replay. This is Lean's own kernel, not an independent external verifier.
+- Independent disposable real-Lean controls additionally showed that both ordinary and `module`-header private unused custom axioms are rejected by the census (`private-axiom-probe.json`). No hidden-private-axiom gap was reproduced.
+
+## Important findings
+
+### CBZ-R1 — Original tag retention was not verified before claiming archive completeness
+
+Original location: `tools/cbz_refs.py`, `verify_snapshot`, original lines 229–259. It checked original tag object existence and peeled identity but did not require the original local tag refs to remain present. `git fsck` succeeds for an unreferenced but still present object.
+
+Independent reproduction in `probe_safety.py` / `safety-probe-report.json`: created a disposable remote with a lightweight tag pointing to a unique blob, made a snapshot, deleted only that tag from the local snapshot, and called `verify_snapshot`. It returned `verified: true`. After fixture-only reflog expiry/GC the tag-only blob disappeared. The original disposable remote tag remained intact. The successful verification therefore overstated durable standalone archive coverage. The same risk applies to annotated tag objects and tag-only histories.
+
+**Successor disposition: ADDRESSED.** Reviewed `verify_snapshot` successor lines 232–238 now require exact local head/tag membership equal to original manifest tags plus archive tag, reject any extra heads/tags, and require detached HEAD exactly at the archive commit. Missing original tags cannot pass simply because their objects have not yet been collected.
+
+Independently reran the original tag-only-blob case in `probe_safety_successor.py`: intact archive accepted; removal refused while the object was still present (`safety-successor-report.json`). Read author 26/26 normal and optimized passing tests, including missing annotated tag, blob/tree tag-only objects, unexpected heads/tags and incorrect HEAD. Successor identities:
+
+- Tool `f26c6f8f13aac2b967a8c03cf4ca9643a875a93ebd0855a732576e8fdceaca85`.
+- Tests `87894edca7a54974ff53af31e8d3a696643633c148d591d410709b28881916de`.
+
+No live snapshot or remote was mutated by this review or its verification.
+
+### CBZ-R2 — Hardlink grouping discarded distinct extended attributes
+
+Original locations: `tools/cbz_storage.py:54–74` (`file_record`), `make_plan` grouping and `same_content`. File identity/grouping considered device, bytes, mode, uid/gid and byte hash, but did not capture or refuse xattrs. Atomic replacement substitutes the source inode's attributes for the target's.
+
+Independent reproduction in `probe_safety.py` / `safety-probe-report.json`: two equal-byte/equal-mode/equal-owner disposable regular files, with `user.review-note` only on the target, produced one operation. Apply erased the target attribute and reported `content_paths_modes_verified: true`. ACLs/capabilities and other xattr metadata likewise cannot be presumed equivalent from mode/ownership alone. This is a destructive metadata-safety issue, not a claim that a previous real storage operation lost such metadata.
+
+**Successor disposition: ADDRESSED for new uses.** Successor `require_no_xattrs` and `file_record` refuse nonempty descriptor xattrs and enumeration failures before/after hashing; per-operation rechecks use the same function. This is a conservative refusal instead of silently broadening metadata-copy semantics.
+
+Independent successor probe refused the original pair before planning/mutation; target metadata remained present and the inodes stayed distinct. Read author 13/13 normal and optimized passing tests, including xattr enumeration failure and a newly added attribute before replacement. Successor identities:
+
+- Tool `c829d392e00601d7876a2530a8bff02b7f913cff7bed2dec29df69d796b4ff9a`.
+- Tests `5efc1289a0d13e266cd1143b7f6b1946efb29a24deba718eb0170093f67b1295`.
+
+Historical apply receipts did not capture pre-apply xattrs. A later clean scan cannot prove attributes were absent before those operations. Their original byte/path/mode/owner claims retain that exact scope; no retroactive all-metadata preservation claim is made.
+
+### CBZ-R3 — Witness names/axioms were accepted without enforcing witness propositions
+
+Original location: `tools/cbz_lean_check.py:162–168` and `validate_census`. The wrapper checks that the four expected names are theorem constants with allowed axioms/no unsupported proposition premises, but does not check that their propositions are the finite-domain witnesses the wrapper relies on. An expected name alone is not a witness contract.
+
+Independent reproduction in `probe_witness_contract.py` / `witness-contract-probe.json`: compiled a disposable real Lean module with the four exact expected witness names, each proving only `True`. Generated the real census using `audit_program`, ran Lean successfully, then passed its real output to the production `validate_census`. All four were accepted with statements `True`. This is an audit-stage reproduction, not an asserted full wrapper replay. The actual original witness source remains correct; the issue is the validator's acceptance of weakened replacements and its resulting nonvacuity claim.
+
+**Disposition at this writing: NOT YET ADDRESSED / native fix in progress.** The author acknowledged the issue and is adding independent generated exact-type ascriptions, elaborated proposition checks and an actual same-name-True rejection control. A source-bound successor disposition will follow observed output; no future result is assumed.
+
+## Receipt binding, observed execution and limits
+
+Read actual `portable-main-receipt.json`, `portable-main-final-run.log/.exit`, the registry and relevant kernel/control logs. The preserved receipt identifies manifest `38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0`, commit `f20cc54d4d136e854608853372249882eb4c949f`, original helper/source hashes above, 45 project constants, 31 theorem constants and four witness constants; current original witness types were inspected. Version text identifies Lean 4.34.1 commit `5045d0056413266e57c625dcd7c365b10e377c52`. The wrapper's actual command arrays were inspected: named witness kernel replay and `leanchecker -v --fresh` with the manifest root are explicit; output logs are hashed in the receipt. The receipt does not separately serialize an argv/exit ledger, so this review does not claim one exists.
+
+A read-only observation of mutable live evidence at 17:54:10 UTC found the current CBZ receipt still referring to baseline hash `2f028a…`, while the live formal baseline receipt had hash `2cce1c…`. Details are in `live-receipt-observation.json`. The read was not atomic and other gate runs were in progress, so it is not attributed as a completed-run failure or an invalidation of historical retained evidence. It does establish that those live files cannot presently be combined as one coherent final receipt. Root confirmed the final sequence will run all suites first, then one complete wrapper invocation serially with no Main concurrency and exact final commit/helper binding.
+
+The wrapper reuses fixed output names; source and receipt hashes must be consumed together with their actual run context. Historical observed execution does not automatically rebind to fixes, a new commit, a new binary/version or a concurrently replaced baseline receipt. The author’s original execution reports are evidence consumed, not newly rerun kernel proof by this reviewer. Final R3 full runtime evidence remains pending; no final CBZ/global regression/hosted result is inferred.
+
+## Scope exclusions and retained assumptions
+
+- Mathematical truth, semantic alignment to papers, Gaussian/interface/Palm applicability, Math- closure, whole-federation CBZ status and scientific acceptance are excluded. Literal finite-domain witness validation is an engineering protocol check, not a scientific alignment review.
+- Ref scope is advertised heads/tags and default HEAD. Hidden refs, PR objects, stashes, dirty worktrees, protected/active branch discovery and quarantine/disposition indexing require caller-owned inventories. The tool explicitly requires the complete policy inventory; no hosting-policy inference was credited.
+- Atomic leases guard each requested deletion; they are not a server-wide lock on unrelated concurrent changes. Final-state refusal after a successful atomic push can require recovery. That documented limit is not a claim that no deletion occurred on every failed post-check.
+- Storage is for stable, explicitly selected immutable files. Shared-write semantics, deliberate inode/link-count changes and non-preserved per-path timestamps are documented. No concurrent-writer linearizability or adversarial directory-swap guarantee is inferred from ordinary path checks.
+- No false historical metadata restoration is claimed for the xattr fix. No in-flight audit/baseline implementation was reviewed. No unchanged full suite or expensive full kernel replay was repeated solely to restate worker evidence.
+
+This report preserves the initial findings and exact successor dispositions. Pending author output is not a passing gate.
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEWED_SOURCE.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEWED_SOURCE.json
new file mode 100644
index 000000000..7a4f84b1a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEWED_SOURCE.json
@@ -0,0 +1,37 @@
+[
+ {
+ "path": "tools/cbz_lean_check.py",
+ "bytes": 11339,
+ "sha256": "7b716e0507c0963510af5d276d1b900378df1cb630c5888551db3f939b333e75"
+ },
+ {
+ "path": "tools/CBZNonvacuity.lean",
+ "bytes": 3008,
+ "sha256": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f"
+ },
+ {
+ "path": "tools/cbz_refs.py",
+ "bytes": 18735,
+ "sha256": "186a090c2dd536f3e21dbaf71d9a11e48281fcb6644bbc74653543774180bc24"
+ },
+ {
+ "path": "tools/cbz_storage.py",
+ "bytes": 9641,
+ "sha256": "a0aee53dec348bf5bc40016b4956fae41b1a672a36942fcb9160398a399379ae"
+ },
+ {
+ "path": "tests/test_cbz_lean_check.py",
+ "bytes": 5361,
+ "sha256": "cabf2ba2f705b3b289482468f55de77e86a727a01f223ce47832ec8dd0ab5150"
+ },
+ {
+ "path": "tests/test_cbz_refs.py",
+ "bytes": 14964,
+ "sha256": "091ce8c4fb16f5dbe79dc97cab52428af9430100548237672f2ef5505e39e6a5"
+ },
+ {
+ "path": "tests/test_cbz_storage.py",
+ "bytes": 5396,
+ "sha256": "8fc7303a983fc626f3aa9a422451812db25e4cbe8ff2b3054b77274127afaefb"
+ }
+]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEWED_SUCCESSOR_SOURCE.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEWED_SUCCESSOR_SOURCE.json
new file mode 100644
index 000000000..012275318
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEWED_SUCCESSOR_SOURCE.json
@@ -0,0 +1,37 @@
+[
+ {
+ "path": "tools/cbz_lean_check.py",
+ "bytes": 14610,
+ "sha256": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d"
+ },
+ {
+ "path": "tools/CBZNonvacuity.lean",
+ "bytes": 3008,
+ "sha256": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f"
+ },
+ {
+ "path": "tools/cbz_refs.py",
+ "bytes": 19268,
+ "sha256": "f26c6f8f13aac2b967a8c03cf4ca9643a875a93ebd0855a732576e8fdceaca85"
+ },
+ {
+ "path": "tools/cbz_storage.py",
+ "bytes": 10064,
+ "sha256": "c829d392e00601d7876a2530a8bff02b7f913cff7bed2dec29df69d796b4ff9a"
+ },
+ {
+ "path": "tests/test_cbz_lean_check.py",
+ "bytes": 6992,
+ "sha256": "8642d2bb63acf3d9ab56c89dad4132449f6b9b964431ca14ce9cf52ed3eac3d6"
+ },
+ {
+ "path": "tests/test_cbz_refs.py",
+ "bytes": 17142,
+ "sha256": "87894edca7a54974ff53af31e8d3a696643633c148d591d410709b28881916de"
+ },
+ {
+ "path": "tests/test_cbz_storage.py",
+ "bytes": 6712,
+ "sha256": "5efc1289a0d13e266cd1143b7f6b1946efb29a24deba718eb0170093f67b1295"
+ }
+]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/live-receipt-observation.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/live-receipt-observation.json
new file mode 100644
index 000000000..325355750
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/live-receipt-observation.json
@@ -0,0 +1,13 @@
+{
+ "observed_utc": "2026-10-29T17:54:10.072204+00:00",
+ "scope": "Non-atomic read of live shared evidence directories during concurrent work, not a final execution verdict",
+ "cbz_receipt_sha256": "8de0eb40af25a4e4bc2342e6ec3dc057299385e1baae99610186c6161e0b06c0",
+ "expected_baseline_sha256": "2f028a8484c25d5e4ed1d26c865a5481ade22415b08af075b098a8fcf32b5d52",
+ "observed_baseline_sha256": "2cce1ca8139cb45594fa626a9bdaed522c762b300053ffb82721e1d32c44e746",
+ "checked_commit": "f20cc54d4d136e854608853372249882eb4c949f",
+ "audit_inputs": {
+ "tools/CBZNonvacuity.lean": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f",
+ "tools/cbz_lean_check.py": "7b716e0507c0963510af5d276d1b900378df1cb630c5888551db3f939b333e75",
+ "tools/formal_gate_check.py": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5"
+ }
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/private-axiom-probe.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/private-axiom-probe.json
new file mode 100644
index 000000000..1fd1db3bb
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/private-axiom-probe.json
@@ -0,0 +1,16 @@
+[
+ {
+ "case": "legacy",
+ "compile_exit": 0,
+ "compile_log": "",
+ "audit_exit": 1,
+ "audit_log": "CBZ_RECORD {\"axioms\":[],\"kind\":\"theorem\",\"module\":\"Private_legacy\",\"name\":\"honest\",\"prop_premises\":[],\"statement\":\"True\"}\n/workspace/cbz0/review-tools/cbz-review-private-yb5qwa4d/Audit_legacy.lean:4:0: error: CBZ_FORBIDDEN _private.Private_legacy.0.hidden [_private.Private_legacy.0.hidden]\n"
+ },
+ {
+ "case": "module",
+ "compile_exit": 0,
+ "compile_log": "",
+ "audit_exit": 1,
+ "audit_log": "CBZ_RECORD {\"axioms\":[],\"kind\":\"theorem\",\"module\":\"Private_module\",\"name\":\"_private.Private_module.0.honest\",\"prop_premises\":[],\"statement\":\"True\"}\n/workspace/cbz0/review-tools/cbz-review-private-yb5qwa4d/Audit_module.lean:4:0: error: CBZ_FORBIDDEN _private.Private_module.0.hidden [_private.Private_module.0.hidden]\n"
+ }
+]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_private_axiom.py b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_private_axiom.py
new file mode 100644
index 000000000..6a45bb6e5
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_private_axiom.py
@@ -0,0 +1,17 @@
+from pathlib import Path
+from tempfile import TemporaryDirectory
+import importlib.util,json,os,subprocess
+ROOT=Path('/workspace/universal-law/website-repair-20261028');OUT=Path('/workspace/cbz0/review-tools');lean='/workspace/research/audit/formal/toolchain/bin/lean'
+spec=importlib.util.spec_from_file_location('cbz',ROOT/'tools/cbz_lean_check.py');m=importlib.util.module_from_spec(spec);spec.loader.exec_module(m)
+report=[]
+with TemporaryDirectory(prefix='cbz-review-private-',dir=OUT) as tmp:
+ p=Path(tmp);env=dict(os.environ,LEAN_PATH=str(p))
+ for label,header in [('legacy',''),('module','module\n')]:
+ name='Private_'+label;(p/(name+'.lean')).write_text(header+'import Lean\nprivate axiom hidden : False\ntheorem honest : True := True.intro\n')
+ c=subprocess.run([lean,'-o',str(p/(name+'.olean')),str(p/(name+'.lean'))],cwd=p,env=env,capture_output=True,text=True)
+ row={'case':label,'compile_exit':c.returncode,'compile_log':c.stdout+c.stderr}
+ if c.returncode==0:
+ a=p/('Audit_'+label+'.lean');a.write_text(m.audit_program((ROOT/'tools/CBZNonvacuity.lean').read_text(),name))
+ r=subprocess.run([lean,str(a)],cwd=p,env=env,capture_output=True,text=True);row.update(audit_exit=r.returncode,audit_log=r.stdout+r.stderr)
+ report.append(row)
+(OUT/'private-axiom-probe.json').write_text(json.dumps(report,indent=2)+'\n');print(json.dumps(report,indent=2))
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_safety.py b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_safety.py
new file mode 100644
index 000000000..9cd72201e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_safety.py
@@ -0,0 +1,29 @@
+from pathlib import Path
+from tempfile import TemporaryDirectory
+from unittest.mock import patch
+import importlib.util,json,os,subprocess
+ROOT=Path('/workspace/universal-law/website-repair-20261028');OUT=Path('/workspace/cbz0/review-tools')
+def module(path,name):
+ spec=importlib.util.spec_from_file_location(name,path);m=importlib.util.module_from_spec(spec);spec.loader.exec_module(m);return m
+s=module(ROOT/'tools/cbz_storage.py','storage');t=module(ROOT/'tests/test_cbz_refs.py','ref_tests');t.RefSafetyTests.setUpClass()
+report={}
+with TemporaryDirectory(prefix='cbz-review-storage-',dir=OUT) as tmp:
+ roots=[Path(tmp)/n for n in ('a','b')]
+ for p in roots:p.mkdir();(p/'payload').write_bytes(b'exact immutable bytes');(p/'payload').chmod(0o644)
+ os.setxattr(roots[1]/'payload',b'user.review-note',b'target-only metadata')
+ plan=s.make_plan([str(p) for p in roots]);before=[os.listxattr(p/'payload') for p in roots]
+ result=s.apply_plan(plan);after=[os.listxattr(p/'payload') for p in roots]
+ report['xattr_loss']={'planned_operations':plan['operations'],'before':before,'after':after,'tool_report':result,'bytes_preserved':[(p/'payload').read_bytes().decode() for p in roots]}
+case=t.RefSafetyTests('test_archive_has_unique_parents_exact_manifest_and_recoverable_content');case.setUp()
+try:
+ blob=t.git(case.remote,'hash-object','-w','--stdin',input='unique tag-only blob\n')
+ t.git(case.remote,'update-ref','refs/tags/tag-only-blob',blob)
+ case.snapshot();archive=case.out/'repository.git'
+ t.git(archive,'update-ref','-d','refs/tags/tag-only-blob')
+ verified=case.tool.verify_snapshot(case.out)
+ exists_before=t.git(archive,'cat-file','-t',blob)
+ t.git(archive,'reflog','expire','--expire=now','--all');t.git(archive,'gc','--prune=now')
+ proc=subprocess.run(['git','-C',str(archive),'cat-file','-e',blob],capture_output=True)
+ report['unretained_tag_pass']={'verified_after_local_tag_deletion':verified['verified'],'tag_only_object':blob,'object_type_before_gc':exists_before,'exists_after_gc':proc.returncode==0,'original_fixture_remote_tag_intact':t.git(case.remote,'rev-parse','refs/tags/tag-only-blob')==blob}
+finally:case.doCleanups()
+(OUT/'safety-probe-report.json').write_text(json.dumps(report,indent=2)+'\n');print(json.dumps(report,indent=2))
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_safety_successor.py b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_safety_successor.py
new file mode 100644
index 000000000..ab24bbbb6
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_safety_successor.py
@@ -0,0 +1,24 @@
+from pathlib import Path
+from tempfile import TemporaryDirectory
+import importlib.util,json,os,hashlib
+ROOT=Path('/workspace/universal-law/website-repair-20261028');OUT=Path('/workspace/cbz0/review-tools')
+def module(path,name):
+ spec=importlib.util.spec_from_file_location(name,path);m=importlib.util.module_from_spec(spec);spec.loader.exec_module(m);return m
+s=module(ROOT/'tools/cbz_storage.py','storage');t=module(ROOT/'tests/test_cbz_refs.py','ref_tests');t.RefSafetyTests.setUpClass();report={}
+with TemporaryDirectory(prefix='cbz-review-storage-fixed-',dir=OUT) as tmp:
+ roots=[Path(tmp)/n for n in ('a','b')]
+ for p in roots:p.mkdir();(p/'payload').write_bytes(b'exact immutable bytes');(p/'payload').chmod(0o644)
+ os.setxattr(roots[1]/'payload',b'user.review-note',b'target-only metadata')
+ try:s.make_plan([str(p) for p in roots]);raise AssertionError('metadata ambiguity accepted')
+ except s.Refusal as err:report['storage_refusal']=str(err)
+ report['xattr_preserved']=os.getxattr(roots[1]/'payload',b'user.review-note')==b'target-only metadata';report['files_remain_distinct']=not os.path.samefile(*(p/'payload' for p in roots))
+case=t.RefSafetyTests('test_archive_has_unique_parents_exact_manifest_and_recoverable_content');case.setUp()
+try:
+ blob=t.git(case.remote,'hash-object','-w','--stdin',input='unique tag-only blob\n');t.git(case.remote,'update-ref','refs/tags/tag-only-blob',blob);case.snapshot();archive=case.out/'repository.git'
+ report['intact_snapshot_accepted']=case.tool.verify_snapshot(case.out)['verified'];t.git(archive,'update-ref','-d','refs/tags/tag-only-blob')
+ try:case.tool.verify_snapshot(case.out);raise AssertionError('missing tag accepted')
+ except case.tool.SafetyError as err:report['refs_refusal']=str(err)
+ report['object_still_exists_at_refusal']=t.git(archive,'cat-file','-t',blob)=='blob'
+finally:case.doCleanups()
+report['source_sha256']={p:hashlib.sha256((ROOT/p).read_bytes()).hexdigest() for p in ['tools/cbz_refs.py','tests/test_cbz_refs.py','tools/cbz_storage.py','tests/test_cbz_storage.py']}
+(OUT/'safety-successor-report.json').write_text(json.dumps(report,indent=2)+'\n');print(json.dumps(report,indent=2))
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_witness_contract.py b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_witness_contract.py
new file mode 100644
index 000000000..0f5f4d215
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_witness_contract.py
@@ -0,0 +1,18 @@
+from pathlib import Path
+from tempfile import TemporaryDirectory
+import importlib.util,json,os,subprocess
+ROOT=Path('/workspace/universal-law/website-repair-20261028');OUT=Path('/workspace/cbz0/review-tools')
+spec=importlib.util.spec_from_file_location('cbz',ROOT/'tools/cbz_lean_check.py');m=importlib.util.module_from_spec(spec);spec.loader.exec_module(m)
+lean=Path('/workspace/research/audit/formal/toolchain/bin/lean');report={}
+with TemporaryDirectory(prefix='cbz-review-witness-',dir=OUT) as tmp:
+ p=Path(tmp);source='import Lean\nnamespace CBZNonvacuity\n'+''.join('theorem '+name.split('.')[-1]+' : True := True.intro\n' for name in m.WITNESSES)+'end CBZNonvacuity\n'
+ (p/'FakeWitness.lean').write_text(source)
+ (p/'Audit.lean').write_text(m.audit_program((ROOT/'tools/CBZNonvacuity.lean').read_text(),'FakeWitness'))
+ env=dict(os.environ,LEAN_PATH=str(p))
+ compile=subprocess.run([str(lean),'-o',str(p/'FakeWitness.olean'),str(p/'FakeWitness.lean')],cwd=p,env=env,capture_output=True,text=True)
+ audit=subprocess.run([str(lean),str(p/'Audit.lean')],cwd=p,env=env,capture_output=True,text=True)
+ report={'scope':'Real Lean disposable audit stage only, not a full CBZ wrapper replay or scientific truth review','compile_exit':compile.returncode,'compile_output':compile.stdout+compile.stderr,'audit_exit':audit.returncode,'audit_output':audit.stdout+audit.stderr}
+ if compile.returncode==0 and audit.returncode==0:
+ result=m.validate_census(audit.stdout,set(m.WITNESSES),{'FakeWitness'})
+ report['witness_census_accepted']=True;report['statements']={row['name']:row['statement'] for row in result['proofs']}
+(OUT/'witness-contract-probe.json').write_text(json.dumps(report,indent=2)+'\n');print(json.dumps(report,indent=2))
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_witness_successor.py b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_witness_successor.py
new file mode 100644
index 000000000..62606fe6d
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_witness_successor.py
@@ -0,0 +1,20 @@
+from pathlib import Path
+from tempfile import TemporaryDirectory
+import importlib.util,json,os,subprocess,hashlib
+ROOT=Path('/workspace/universal-law/website-repair-20261028');OUT=Path('/workspace/cbz0/review-tools');lean='/workspace/research/audit/formal/toolchain/bin/lean'
+spec=importlib.util.spec_from_file_location('cbz',ROOT/'tools/cbz_lean_check.py');m=importlib.util.module_from_spec(spec);spec.loader.exec_module(m);source=(ROOT/'tools/CBZNonvacuity.lean').read_text();cases=[]
+with TemporaryDirectory(prefix='cbz-review-witness-fixed-',dir=OUT) as tmp:
+ p=Path(tmp);env=dict(os.environ,LEAN_PATH=str(p)+':'+str(ROOT/'formal/.lake/build/lib/lean'))
+ for label in ['TrueOnly','ActualWitness']:
+ content=source[:source.index('open Lean Meta Elab Command')] if label=='ActualWitness' else 'import Lean\nnamespace CBZNonvacuity\n'+''.join('theorem '+n.split('.')[-1]+' : True := True.intro\n' for n in m.WITNESSES)+'end CBZNonvacuity\n'
+ (p/(label+'.lean')).write_text(content)
+ c=subprocess.run([lean,'-o',str(p/(label+'.olean')),str(p/(label+'.lean'))],cwd=p,env=env,capture_output=True,text=True);assert c.returncode==0,c.stdout+c.stderr
+ audit=p/('Audit'+label+'.lean');audit.write_text(m.audit_program(source,label));a=subprocess.run([lean,str(audit)],cwd=p,env=env,capture_output=True,text=True);assert a.returncode==0,a.stdout+a.stderr
+ row={'case':label,'compile_exit':c.returncode,'audit_exit':a.returncode}
+ try:m.validate_census(a.stdout,set(m.WITNESSES),{label});row['census_accepted']=True
+ except ValueError as err:row.update(census_accepted=False,census_error=str(err))
+ contract=p/('Contract'+label+'.lean');contract.write_text(m.witness_contract_program(label));k=subprocess.run([lean,str(contract)],cwd=p,env=env,capture_output=True,text=True);row.update(contract_exit=k.returncode,contract_output=k.stdout+k.stderr)
+ assert row['census_accepted']==(label=='ActualWitness');assert (k.returncode==0)==(label=='ActualWitness')
+ cases.append(row)
+report={'scope':'Independent actual Lean audit-stage and exact-type controls, not a repeated full wrapper/kernel run','cases':cases,'source_sha256':{name:hashlib.sha256((ROOT/name).read_bytes()).hexdigest() for name in ['tools/cbz_lean_check.py','tools/CBZNonvacuity.lean','tests/test_cbz_lean_check.py']}}
+(OUT/'witness-successor-probe.json').write_text(json.dumps(report,indent=2)+'\n');print(json.dumps(report,indent=2))
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/safety-probe-report.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/safety-probe-report.json
new file mode 100644
index 000000000..614fe8216
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/safety-probe-report.json
@@ -0,0 +1,38 @@
+{
+ "xattr_loss": {
+ "planned_operations": [
+ [
+ 0,
+ 1
+ ]
+ ],
+ "before": [
+ [],
+ [
+ "user.review-note"
+ ]
+ ],
+ "after": [
+ [],
+ []
+ ],
+ "tool_report": {
+ "applied": 1,
+ "content_paths_modes_verified": true,
+ "free_before": 1861099520,
+ "free_after": 1861103616,
+ "actual_df_bytes_freed": 4096
+ },
+ "bytes_preserved": [
+ "exact immutable bytes",
+ "exact immutable bytes"
+ ]
+ },
+ "unretained_tag_pass": {
+ "verified_after_local_tag_deletion": true,
+ "tag_only_object": "41bfd37cf32a7acf6ca40c3c5ec9eab7ae5642e9",
+ "object_type_before_gc": "blob",
+ "exists_after_gc": false,
+ "original_fixture_remote_tag_intact": true
+ }
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/safety-successor-report.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/safety-successor-report.json
new file mode 100644
index 000000000..d1899a167
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/safety-successor-report.json
@@ -0,0 +1,14 @@
+{
+ "storage_refusal": "extended attributes unsupported; file sharing refused",
+ "xattr_preserved": true,
+ "files_remain_distinct": true,
+ "intact_snapshot_accepted": true,
+ "refs_refusal": "archive original tag refs/archive tag membership mismatch or unexpected heads",
+ "object_still_exists_at_refusal": true,
+ "source_sha256": {
+ "tools/cbz_refs.py": "f26c6f8f13aac2b967a8c03cf4ca9643a875a93ebd0855a732576e8fdceaca85",
+ "tests/test_cbz_refs.py": "87894edca7a54974ff53af31e8d3a696643633c148d591d410709b28881916de",
+ "tools/cbz_storage.py": "c829d392e00601d7876a2530a8bff02b7f913cff7bed2dec29df69d796b4ff9a",
+ "tests/test_cbz_storage.py": "5efc1289a0d13e266cd1143b7f6b1946efb29a24deba718eb0170093f67b1295"
+ }
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/witness-contract-probe.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/witness-contract-probe.json
new file mode 100644
index 000000000..0cf6a66a7
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/witness-contract-probe.json
@@ -0,0 +1,14 @@
+{
+ "scope": "Real Lean disposable audit stage only, not a full CBZ wrapper replay or scientific truth review",
+ "compile_exit": 0,
+ "compile_output": "",
+ "audit_exit": 0,
+ "audit_output": "CBZ_RECORD {\"axioms\":[],\"kind\":\"theorem\",\"module\":\"FakeWitness\",\"name\":\"CBZNonvacuity.dimensions_inhabited\",\"prop_premises\":[],\"statement\":\"True\"}\nCBZ_RECORD {\"axioms\":[],\"kind\":\"theorem\",\"module\":\"FakeWitness\",\"name\":\"CBZNonvacuity.pairing_all_seven\",\"prop_premises\":[],\"statement\":\"True\"}\nCBZ_RECORD {\"axioms\":[],\"kind\":\"theorem\",\"module\":\"FakeWitness\",\"name\":\"CBZNonvacuity.dimensions_both\",\"prop_premises\":[],\"statement\":\"True\"}\nCBZ_RECORD {\"axioms\":[],\"kind\":\"theorem\",\"module\":\"FakeWitness\",\"name\":\"CBZNonvacuity.pairing_domain_inhabited\",\"prop_premises\":[],\"statement\":\"True\"}\nCBZ_END {\"count\":4,\"modules\":[\"FakeWitness\"]}\n",
+ "witness_census_accepted": true,
+ "statements": {
+ "CBZNonvacuity.dimensions_inhabited": "True",
+ "CBZNonvacuity.pairing_all_seven": "True",
+ "CBZNonvacuity.dimensions_both": "True",
+ "CBZNonvacuity.pairing_domain_inhabited": "True"
+ }
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/witness-successor-probe.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/witness-successor-probe.json
new file mode 100644
index 000000000..c5f7c2312
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/witness-successor-probe.json
@@ -0,0 +1,27 @@
+{
+ "scope": "Independent actual Lean audit-stage and exact-type controls, not a repeated full wrapper/kernel run",
+ "cases": [
+ {
+ "case": "TrueOnly",
+ "compile_exit": 0,
+ "audit_exit": 0,
+ "census_accepted": false,
+ "census_error": "witness type contract changed: CBZNonvacuity.dimensions_inhabited",
+ "contract_exit": 1,
+ "contract_output": "/workspace/cbz0/review-tools/cbz-review-witness-fixed-45ivc3ef/ContractTrueOnly.lean:2:46: error: Type mismatch\n CBZNonvacuity.pairing_domain_inhabited\nhas type\n True\nbut is expected to have type\n \u2203 q, q \u2208 [0, 1, 2, 3, 4, 5, 6]\n/workspace/cbz0/review-tools/cbz-review-witness-fixed-45ivc3ef/ContractTrueOnly.lean:3:209: error: Type mismatch\n CBZNonvacuity.pairing_all_seven\nhas type\n True\nbut is expected to have type\n 0 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 1 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 2 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 3 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 4 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 5 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 6 \u2208 [0, 1, 2, 3, 4, 5, 6]\n/workspace/cbz0/review-tools/cbz-review-witness-fixed-45ivc3ef/ContractTrueOnly.lean:4:36: error: Type mismatch\n CBZNonvacuity.dimensions_inhabited\nhas type\n True\nbut is expected to have type\n \u2203 d, d \u2208 [2, 3]\n/workspace/cbz0/review-tools/cbz-review-witness-fixed-45ivc3ef/ContractTrueOnly.lean:5:49: error: Type mismatch\n CBZNonvacuity.dimensions_both\nhas type\n True\nbut is expected to have type\n 2 \u2208 [2, 3] \u2227 3 \u2208 [2, 3]\n"
+ },
+ {
+ "case": "ActualWitness",
+ "compile_exit": 0,
+ "audit_exit": 0,
+ "census_accepted": true,
+ "contract_exit": 0,
+ "contract_output": ""
+ }
+ ],
+ "source_sha256": {
+ "tools/cbz_lean_check.py": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d",
+ "tools/CBZNonvacuity.lean": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f",
+ "tests/test_cbz_lean_check.py": "8642d2bb63acf3d9ab56c89dad4132449f6b9b964431ca14ce9cf52ed3eac3d6"
+ }
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel-run-result.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel-run-result.json
new file mode 100644
index 000000000..b7b3c9344
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel-run-result.json
@@ -0,0 +1,15 @@
+{
+ "argv": [
+ "/opt/codex/runtimes/codex-primary-runtime/dependencies/python/bin/python",
+ "-B",
+ "-S",
+ "tools/cbz_lean_check.py"
+ ],
+ "source_commit": "6fc021839072d8c34f41e18e77b0f618c53baa15",
+ "started": "2026-10-29T18:13:11.817671+00:00",
+ "python": "3.12.14 (main, Aug 25 2026, 14:00:49) [Clang 22.1.3 ]",
+ "executable": "/opt/codex/runtimes/codex-primary-runtime/dependencies/python/bin/python",
+ "finished": "2026-10-29T18:14:38.102872+00:00",
+ "exit": 0,
+ "seconds": 86.28466872899935
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json
new file mode 100644
index 000000000..9ff20f647
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json
@@ -0,0 +1,382 @@
+{
+ "scope": "actual31literalMainproofs; source-parent alignment not inferred; negative fixtures are verification tests, never accepted proofs",
+ "source_commit": "6fc021839072d8c34f41e18e77b0f618c53baa15",
+ "sealed_at": "2026-10-29T18:17:08.954059+00:00",
+ "files": [
+ {
+ "path": "cbz-evidence/AuditWeakenedWitness.lean",
+ "bytes": 1996,
+ "sha256": "e371bdfc23bdce4823e34a6ba256f20b8786def91aaafe7fc4bed771119fc668"
+ },
+ {
+ "path": "cbz-evidence/Audit_false_premise.lean",
+ "bytes": 2937,
+ "sha256": "bc649d9293515f6a1f707503b0883fb6ea2b845c20fccd9f42f3dee6216215e1"
+ },
+ {
+ "path": "cbz-evidence/Audit_honest.lean",
+ "bytes": 2923,
+ "sha256": "7e3db1846b209bf1b1c4309ccc319d70eaca67932ceff91c2e1eb5183ba79c75"
+ },
+ {
+ "path": "cbz-evidence/Audit_native.lean",
+ "bytes": 2923,
+ "sha256": "b7c80d76545ac4de9cd065cd23b65e9363a6e9585469f445764d138772c1c20b"
+ },
+ {
+ "path": "cbz-evidence/Audit_sorry.lean",
+ "bytes": 2921,
+ "sha256": "f05c64a3378544e29d991af8346187542dd50938e2488132152e1179a8af500e"
+ },
+ {
+ "path": "cbz-evidence/Audit_unused_axiom.lean",
+ "bytes": 2935,
+ "sha256": "17e7bd63d299fb6ca43b4b791d75268499a1af711bc82aa3fbcc2a56da941175"
+ },
+ {
+ "path": "cbz-evidence/CBZControl_false_premise.lean",
+ "bytes": 61,
+ "sha256": "90c2c80bb3fbc9cc7ae30816d050ae5d0eac8903b3d2455136b48ebea7281dc0"
+ },
+ {
+ "path": "cbz-evidence/CBZControl_honest.lean",
+ "bytes": 56,
+ "sha256": "d8099911accbf7a768892136256820e31afa9158d8d15c92d7437bb695a53295"
+ },
+ {
+ "path": "cbz-evidence/CBZControl_native.lean",
+ "bytes": 75,
+ "sha256": "4c5529b6c627afca507e031a24f43750a8376f5b5179b349efc4d63a24ed2187"
+ },
+ {
+ "path": "cbz-evidence/CBZControl_sorry.lean",
+ "bytes": 52,
+ "sha256": "9326bf1f792972f852fc0449f52b530e1ebb1b6a092993dd745e873600620683"
+ },
+ {
+ "path": "cbz-evidence/CBZControl_unused_axiom.lean",
+ "bytes": 77,
+ "sha256": "e45b7df50d35aa6fd7f9cfcd89157a664f4474fd7f11bebf2b7883afe27a914a"
+ },
+ {
+ "path": "cbz-evidence/CBZNonvacuity.lean",
+ "bytes": 3008,
+ "sha256": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f"
+ },
+ {
+ "path": "cbz-evidence/CBZWeakenedWitness.lean",
+ "bytes": 258,
+ "sha256": "810e160d7666b4ad02f616ff0e02502bc2d83bd99f934d692aa7a420b2b05c07"
+ },
+ {
+ "path": "cbz-evidence/MissingModule.lean",
+ "bytes": 2929,
+ "sha256": "c14bbecc2f99170c2c56c3e2865493a89a144a55927bc036c751e7f5ad3a039c"
+ },
+ {
+ "path": "cbz-evidence/SelfAudit.lean",
+ "bytes": 1986,
+ "sha256": "d9a5c1d0b99420d6731163698f53a83253cb9913c5e1a793d7c12e3df6005bdd"
+ },
+ {
+ "path": "cbz-evidence/WeakenedWitnessContract.lean",
+ "bytes": 542,
+ "sha256": "ce758e7ce7d3c30865f9ccc01b1f6f27d582e6ff5e9d5f411a09daaa9cc6fcf7"
+ },
+ {
+ "path": "cbz-evidence/WitnessTypeContract.lean",
+ "bytes": 537,
+ "sha256": "613a79ffe608808ca7b2a4e06e76453b72b390116adf4d880b50106ab7c34596"
+ },
+ {
+ "path": "cbz-evidence/all-declarations-and-witnesses.log",
+ "bytes": 10360,
+ "sha256": "dcc81dc13a6dce4b25a6300fd616966e835877f124b8e6448b452878df9673ea"
+ },
+ {
+ "path": "cbz-evidence/auditor-module-census.log",
+ "bytes": 1028,
+ "sha256": "6b9bf4260474d13fb392b71b0fa3b3dadc75fc99fb06310b9caaff31feb3ce4c"
+ },
+ {
+ "path": "cbz-evidence/false_premise-audit.log",
+ "bytes": 538,
+ "sha256": "424799495dafb2dac297a8206c364a73e8c41bed48ac772b0e806443811bfac1"
+ },
+ {
+ "path": "cbz-evidence/false_premise-compile.log",
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ {
+ "path": "cbz-evidence/fresh-kernel.log",
+ "bytes": 36,
+ "sha256": "765e0f77863dc012524cd125d2699754f19e967f4ec35908a2aed7903057572e"
+ },
+ {
+ "path": "cbz-evidence/honest-audit.log",
+ "bytes": 485,
+ "sha256": "62390300f3aaa05474dd1d9b75e47728635f0e2c4b0b49dc9daf0914ec506d87"
+ },
+ {
+ "path": "cbz-evidence/honest-compile.log",
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ {
+ "path": "cbz-evidence/missing-module.log",
+ "bytes": 450,
+ "sha256": "2d9fdde838c729bf8630456eec1033381833a4a2eb42c8f07ca910d9d636f121"
+ },
+ {
+ "path": "cbz-evidence/native-audit.log",
+ "bytes": 502,
+ "sha256": "468963ce795fd68a13b99e1e5b9e90e817f273fe2099bda696deb61552697200"
+ },
+ {
+ "path": "cbz-evidence/native-compile.log",
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ {
+ "path": "cbz-evidence/receipt.json",
+ "bytes": 26957,
+ "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7"
+ },
+ {
+ "path": "cbz-evidence/sorry-audit.log",
+ "bytes": 441,
+ "sha256": "938f55996c45f78c29d90750ce73a1cfba8bd488b34f5b9e99ced19993bab2f4"
+ },
+ {
+ "path": "cbz-evidence/sorry-compile.log",
+ "bytes": 136,
+ "sha256": "693c90261e9a6a2c68216209a5692f39ee06659d9a50919b2e551ffbd8f8deaa"
+ },
+ {
+ "path": "cbz-evidence/unused_axiom-audit.log",
+ "bytes": 581,
+ "sha256": "972d65c1ff8afddb2e2f9024fbaf972b80292d7b9c0d774f8d946dee28fc12f6"
+ },
+ {
+ "path": "cbz-evidence/unused_axiom-compile.log",
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ {
+ "path": "cbz-evidence/weakened-witness-audit.log",
+ "bytes": 665,
+ "sha256": "3da011e5e28b010ac0851c66e96f3c3d7f501dbb8febcf944f597f239d4412d4"
+ },
+ {
+ "path": "cbz-evidence/weakened-witness-compile.log",
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ {
+ "path": "cbz-evidence/weakened-witness-contract.log",
+ "bytes": 1180,
+ "sha256": "727a132984645d32ac0f4607e61132c096ab4aa1dfe82bcfe9ad4756744d9346"
+ },
+ {
+ "path": "cbz-evidence/witness-kernel.log",
+ "bytes": 24,
+ "sha256": "ab7e01501bc759b00ba24bb39ea9d9bf5e475a179a06f32ee13f3cb1bbc2492d"
+ },
+ {
+ "path": "cbz-evidence/witness-type-contract.log",
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ {
+ "path": "formal-evidence/Audit.lean",
+ "bytes": 1837,
+ "sha256": "09b59390c165b16d1c7b5bae189da6b806d79e8491ee0df1e2e83bb911674c71"
+ },
+ {
+ "path": "formal-evidence/Types.lean",
+ "bytes": 1648,
+ "sha256": "e235933f1ff52b448b3b80952f7ec9ac932723520c22766e85dd81046d558884"
+ },
+ {
+ "path": "formal-evidence/axioms.log",
+ "bytes": 2375,
+ "sha256": "856d934eabb250bffb96085454fc04b3ddd64a47bb92829728f7d5bb7d286d0c"
+ },
+ {
+ "path": "formal-evidence/build.log",
+ "bytes": 237,
+ "sha256": "44deafbbb3d221e71b39a9acefff0973a13f662a3e30de6855971abe5c5ceaaf"
+ },
+ {
+ "path": "formal-evidence/custom_imported.lean",
+ "bytes": 146,
+ "sha256": "dc222fa20546b3443101625ac0793b3cd9e2cd563af489b8db03990e11afd6d5"
+ },
+ {
+ "path": "formal-evidence/custom_imported.log",
+ "bytes": 46,
+ "sha256": "6e7f917c7fe2fdc3efe1943dcc327c56acadd0b0ca96507a4327073fdfd2f083"
+ },
+ {
+ "path": "formal-evidence/elaborated-types.log",
+ "bytes": 25152,
+ "sha256": "10a954ced98371c5cf98eecada196d50c1e6e570af9ea8e07caade4a80b0aab8"
+ },
+ {
+ "path": "formal-evidence/false_covariance_bound.lean",
+ "bytes": 7025,
+ "sha256": "621b585e6a025d9a606cc21c7dfdd2dbc5095b432d4e51d7ea9b2b713a637030"
+ },
+ {
+ "path": "formal-evidence/false_covariance_bound.log",
+ "bytes": 224,
+ "sha256": "3e9f3d67aa666c88ed8e2b0b126163336cd5982dee6ce21b1118fa200292a4dd"
+ },
+ {
+ "path": "formal-evidence/false_eigenvalue_third.lean",
+ "bytes": 7025,
+ "sha256": "1380775e4a2dc33ffb8c126dea5d2194ed7bdf7428b6d9d3dca1f8a3addafcb9"
+ },
+ {
+ "path": "formal-evidence/false_eigenvalue_third.log",
+ "bytes": 192,
+ "sha256": "fda3cc4e985c3309e132c150d4ba988a4d4699095ef2f0cab010dc8e2a5094b2"
+ },
+ {
+ "path": "formal-evidence/false_endpoint_adjacency.lean",
+ "bytes": 1940,
+ "sha256": "f3874de8ca4cab2016d51822373ea1932fcf64b233bec9b653e6a73360a19c0c"
+ },
+ {
+ "path": "formal-evidence/false_endpoint_adjacency.log",
+ "bytes": 221,
+ "sha256": "62af9c46e66215424a5c82c4a1ee83700bbe7ca84906c14400cc4bfdcd5b276a"
+ },
+ {
+ "path": "formal-evidence/false_exp_partial_sum.lean",
+ "bytes": 7025,
+ "sha256": "c3bd8d4579b8f23a53e7185bd74e44e3a09b92fe904c61a25ddb3001a33341a4"
+ },
+ {
+ "path": "formal-evidence/false_exp_partial_sum.log",
+ "bytes": 221,
+ "sha256": "a82d1d1651352ec73a73ee7ad17a596d225fc808b9a3723dbbdd41f982f5328e"
+ },
+ {
+ "path": "formal-evidence/false_exponent_bound_d3.lean",
+ "bytes": 7025,
+ "sha256": "2822b2cce0cf09eccc1926df9be7b48d06a0747a5b79bf14d5187057ea10c588"
+ },
+ {
+ "path": "formal-evidence/false_exponent_bound_d3.log",
+ "bytes": 262,
+ "sha256": "bccf477ff397333506812af1a4a1475a3716f50a0ac0f3a20de77b421064b78d"
+ },
+ {
+ "path": "formal-evidence/false_trace_variance.lean",
+ "bytes": 4409,
+ "sha256": "07963f41f4b3b682042b048a8133b8315ecfc47f59a441d9684d075585cc18b4"
+ },
+ {
+ "path": "formal-evidence/false_trace_variance.log",
+ "bytes": 265,
+ "sha256": "685a68785e68c9590b0479754dc6479d4e1be7a9f89b29a40bfed17c24a376bb"
+ },
+ {
+ "path": "formal-evidence/leanchecker.log",
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ {
+ "path": "formal-evidence/native.lean",
+ "bytes": 100,
+ "sha256": "7a79ea6c867f3a79ef2474d2290e7265ab56a775212c6e67dc1bbad9e4334f37"
+ },
+ {
+ "path": "formal-evidence/native.log",
+ "bytes": 70,
+ "sha256": "8a0b9f79f3265724af58b27461627f9d532535f8a23681361da731c9ea37c101"
+ },
+ {
+ "path": "formal-evidence/preflight-version.log",
+ "bytes": 106,
+ "sha256": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680"
+ },
+ {
+ "path": "formal-evidence/receipt.json",
+ "bytes": 4378,
+ "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1"
+ },
+ {
+ "path": "formal-evidence/sorry.lean",
+ "bytes": 80,
+ "sha256": "8d3b8320eba70953d8de1bc5665cd3665d0d1dfe90f783a7270b1bb1bfab353e"
+ },
+ {
+ "path": "formal-evidence/sorry.log",
+ "bytes": 168,
+ "sha256": "50c0e4557dee071a09d39a848a5eb54324115cd8958a4564f1e845380a64677a"
+ },
+ {
+ "path": "formal-evidence/version.log",
+ "bytes": 106,
+ "sha256": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680"
+ },
+ {
+ "path": "formal-evidence/wrong_image_constant.lean",
+ "bytes": 7025,
+ "sha256": "bb6e6665b42659821261de1b84674ef6a0a19811e8599671f9a7d2d90e81eb77"
+ },
+ {
+ "path": "formal-evidence/wrong_image_constant.log",
+ "bytes": 204,
+ "sha256": "56114d671544669de953160f6688ba962a052a17b8a00e614dc5cdab711744b1"
+ },
+ {
+ "path": "inputs/formal/UniversalLaw/Side24/ConeMoments.lean",
+ "bytes": 4409,
+ "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c"
+ },
+ {
+ "path": "inputs/formal/UniversalLaw/Side24/Endpoints.lean",
+ "bytes": 1940,
+ "sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd"
+ },
+ {
+ "path": "inputs/formal/UniversalLaw/Side24/Ledger.lean",
+ "bytes": 7025,
+ "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7"
+ },
+ {
+ "path": "inputs/formal/UniversalLaw.lean",
+ "bytes": 586,
+ "sha256": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e"
+ },
+ {
+ "path": "inputs/formal/lean-toolchain",
+ "bytes": 25,
+ "sha256": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b"
+ },
+ {
+ "path": "inputs/formal/manifest.json",
+ "bytes": 18104,
+ "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0"
+ },
+ {
+ "path": "inputs/tools/CBZNonvacuity.lean",
+ "bytes": 3008,
+ "sha256": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f"
+ },
+ {
+ "path": "inputs/tools/cbz_lean_check.py",
+ "bytes": 14610,
+ "sha256": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d"
+ },
+ {
+ "path": "inputs/tools/formal_gate_check.py",
+ "bytes": 23845,
+ "sha256": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5"
+ }
+ ]
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/AuditWeakenedWitness.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/AuditWeakenedWitness.lean
new file mode 100644
index 000000000..4aa51b31d
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/AuditWeakenedWitness.lean
@@ -0,0 +1,40 @@
+import Lean
+import CBZWeakenedWitness
+open Lean Meta Elab Command
+run_cmd do
+ let env ← getEnv
+ let modules : Array Name := #[`CBZWeakenedWitness]
+ 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/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_false_premise.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_false_premise.lean
new file mode 100644
index 000000000..6377b002f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_false_premise.lean
@@ -0,0 +1,57 @@
+import Lean
+import CBZControl_false_premise
+
+/-! 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 := #[`CBZControl_false_premise]
+ 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/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_honest.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_honest.lean
new file mode 100644
index 000000000..fb41ada93
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_honest.lean
@@ -0,0 +1,57 @@
+import Lean
+import CBZControl_honest
+
+/-! 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 := #[`CBZControl_honest]
+ 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/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_native.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_native.lean
new file mode 100644
index 000000000..30f137786
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_native.lean
@@ -0,0 +1,57 @@
+import Lean
+import CBZControl_native
+
+/-! 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 := #[`CBZControl_native]
+ 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/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_sorry.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_sorry.lean
new file mode 100644
index 000000000..3c1e19467
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_sorry.lean
@@ -0,0 +1,57 @@
+import Lean
+import CBZControl_sorry
+
+/-! 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 := #[`CBZControl_sorry]
+ 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/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_unused_axiom.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_unused_axiom.lean
new file mode 100644
index 000000000..ad5f369ce
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_unused_axiom.lean
@@ -0,0 +1,57 @@
+import Lean
+import CBZControl_unused_axiom
+
+/-! 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 := #[`CBZControl_unused_axiom]
+ 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/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_false_premise.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_false_premise.lean
new file mode 100644
index 000000000..ba93d7024
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_false_premise.lean
@@ -0,0 +1,2 @@
+import UniversalLaw
+theorem vacuous (h : False) : False := h
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_honest.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_honest.lean
new file mode 100644
index 000000000..6394b8a24
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_honest.lean
@@ -0,0 +1,2 @@
+import UniversalLaw
+theorem honest : True := True.intro
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_native.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_native.lean
new file mode 100644
index 000000000..47387d627
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_native.lean
@@ -0,0 +1,2 @@
+import UniversalLaw
+theorem native : (2 : Nat) + 2 = 4 := by native_decide
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_sorry.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_sorry.lean
new file mode 100644
index 000000000..4d8c2cb07
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_sorry.lean
@@ -0,0 +1,2 @@
+import UniversalLaw
+theorem bad : False := by sorry
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_unused_axiom.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_unused_axiom.lean
new file mode 100644
index 000000000..5ca9d9ac6
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_unused_axiom.lean
@@ -0,0 +1,3 @@
+import UniversalLaw
+axiom hidden : False
+theorem honest : True := True.intro
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZNonvacuity.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZNonvacuity.lean
new file mode 100644
index 000000000..3efd43999
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/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/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZWeakenedWitness.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZWeakenedWitness.lean
new file mode 100644
index 000000000..660e19217
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZWeakenedWitness.lean
@@ -0,0 +1,7 @@
+import UniversalLaw
+namespace CBZNonvacuity
+theorem pairing_domain_inhabited : True := True.intro
+theorem pairing_all_seven : True := True.intro
+theorem dimensions_inhabited : True := True.intro
+theorem dimensions_both : True := True.intro
+end CBZNonvacuity
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/MissingModule.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/MissingModule.lean
new file mode 100644
index 000000000..afea6af9c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/MissingModule.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, `MissingModule]
+ 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/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/SelfAudit.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/SelfAudit.lean
new file mode 100644
index 000000000..fbe67829d
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/SelfAudit.lean
@@ -0,0 +1,40 @@
+import Lean
+import CBZNonvacuity
+open Lean Meta Elab Command
+run_cmd do
+ let env ← getEnv
+ let modules : Array Name := #[`CBZNonvacuity]
+ 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/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/WeakenedWitnessContract.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/WeakenedWitnessContract.lean
new file mode 100644
index 000000000..a5be3ea8f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/WeakenedWitnessContract.lean
@@ -0,0 +1,5 @@
+import CBZWeakenedWitness
+example : (∃ q : Nat, q ∈ [0,1,2,3,4,5,6]) := CBZNonvacuity.pairing_domain_inhabited
+example : ((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]) := CBZNonvacuity.pairing_all_seven
+example : (∃ d : Nat, d ∈ [2,3]) := CBZNonvacuity.dimensions_inhabited
+example : ((2:Nat) ∈ [2,3] ∧ (3:Nat) ∈ [2,3]) := CBZNonvacuity.dimensions_both
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/WitnessTypeContract.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/WitnessTypeContract.lean
new file mode 100644
index 000000000..31ed5f063
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/WitnessTypeContract.lean
@@ -0,0 +1,5 @@
+import CBZNonvacuity
+example : (∃ q : Nat, q ∈ [0,1,2,3,4,5,6]) := CBZNonvacuity.pairing_domain_inhabited
+example : ((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]) := CBZNonvacuity.pairing_all_seven
+example : (∃ d : Nat, d ∈ [2,3]) := CBZNonvacuity.dimensions_inhabited
+example : ((2:Nat) ∈ [2,3] ∧ (3:Nat) ∈ [2,3]) := CBZNonvacuity.dimensions_both
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/all-declarations-and-witnesses.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/all-declarations-and-witnesses.log
new file mode 100644
index 000000000..2ccbba98a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/all-declarations-and-witnesses.log
@@ -0,0 +1,50 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.lattice_shell_constant","prop_premises":[],"statement":"27 * 27 = 729 ∧ 729 * 2 = 1458"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.pairing_terms_six","prop_premises":[],"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"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.geometric_ratio_constants","prop_premises":[],"statement":"2 ^ 9 = 512 ∧ 288 * 3 = 864"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.expTaylorNumerator","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact._f","prop_premises":[],"statement":"(x : Nat) → Nat.below x → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.exponent_bounds","prop_premises":[{"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"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.pairing_sum_six","prop_premises":[],"statement":"UniversalLaw.Side24.pairingSum 6 = 76"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.covariance_relative_bound","prop_premises":[],"statement":"2 * 10 * 3 = 60 ∧ 60 * UniversalLaw.Side24.imageConstant < 10 ^ 17"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.smaller_eigenvalue_exceeds_third","prop_premises":[],"statement":"58 * 9 < 23 ^ 2"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.imageConstant","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.odd_block_shifted_minors","prop_premises":[],"statement":"3 * 1 - 1 = 2 ∧ 3 * 15 - 1 = 44 ∧ 2 * 44 - -9 * -9 = 7"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.sixB","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.density_comparison_below_reported","prop_premises":[],"statement":"32 * 10 ^ 106 < 10 ^ 108"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.period_exponent","prop_premises":[],"statement":"24 ^ 2 / 2 = 288"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.odd_block_eigenvalues","prop_premises":[],"statement":"1 + 15 = 2 * 8 ∧ 1 * 15 - -3 * -3 = 6 ∧ 8 ^ 2 - 58 = 6"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.sixA","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.pairing_sum_le_six","prop_premises":[{"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"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact._sunfold","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.image_constant_value","prop_premises":[],"statement":"UniversalLaw.Side24.imageConstant = 21175738586478"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten","prop_premises":[],"statement":"10 * (125 ^ 20 * UniversalLaw.Side24.fact 20) < UniversalLaw.Side24.expTaylorNumerator"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact._unsafe_rec","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.pairingSum","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.sixth_moment_double_factorial","prop_premises":[],"statement":"1 * 3 * 5 = 15"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.exponent_values","prop_premises":[],"statement":"UniversalLaw.Side24.sixA 2 = 13 ∧\n UniversalLaw.Side24.sixB 2 = 15 ∧ UniversalLaw.Side24.sixA 3 = 25 ∧ UniversalLaw.Side24.sixB 3 = 27"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.ratio_constant_ordering","prop_premises":[],"statement":"13 ≤ 32 ∧ 28 ≤ 32"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact.match_1","prop_premises":[],"statement":"(motive : Nat → Sort u_1) → (x : Nat) → (Unit → motive 0) → ((n : Nat) → motive n.succ) → motive x"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.conditional_third_derivative_variance","prop_premises":[],"statement":"15 - -3 * -3 / 1 = 6"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.cube_root_simplification","prop_premises":[],"statement":"6 ^ 2 * 2 = 3 * 24"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.exponential_moment_of_trace","prop_premises":[],"statement":"3 + 5 = 8"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.fourth_moment_of_trace","prop_premises":[],"statement":"3 * 5 ^ 2 * 3 = 25 * 9"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.hessian_block_eigenvalues","prop_premises":[],"statement":"2 + 2 = 4 ∧ 3 + 2 = 5 ∧ 1 < 3 * 2"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.pin_determinant_and_joint_dimension","prop_premises":[],"statement":"3 * 1 * 1 = 3 ∧ 2 + 1 + 2 * 3 / 2 = 6 ∧ 3 + 1 + 3 * 4 / 2 = 10"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.transverse_covariance_entries_thirds","prop_premises":[],"statement":"2 + 3 + 3 = 8 ∧ 0 + 3 + 0 = 3 ∧ 2 + 0 + 0 = 2"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.trace_and_traceless_variances","prop_premises":[],"statement":"8 + 8 + 2 * 2 = 20 ∧ 20 * 3 = 5 * 12 ∧ 8 + 8 - 2 * 2 = 12 ∧ 12 = 1 * 12 ∧ 8 - 8 = 0"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.cone_moment_m1_thirds","prop_premises":[],"statement":"8 = 2 * 4"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.cone_moment_m2_algebra","prop_premises":[],"statement":"4 * 5 = 20 ∧ 25 - 20 + 24 = 29 ∧ 4 ^ 2 * 3 = 6 * 8"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d3Upper","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d2Lower","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d2_endpoints_adjacent","prop_premises":[],"statement":"UniversalLaw.Side24.d2Lower < UniversalLaw.Side24.d2Upper ∧\n UniversalLaw.Side24.d2Upper = UniversalLaw.Side24.d2Lower + 1"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d3Lower","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d3_endpoints_adjacent","prop_premises":[],"statement":"UniversalLaw.Side24.d3Lower < UniversalLaw.Side24.d3Upper ∧\n UniversalLaw.Side24.d3Upper = UniversalLaw.Side24.d3Lower + 1"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.endpoints_in_unit_tenth","prop_premises":[],"statement":"0 < UniversalLaw.Side24.d3Lower ∧ UniversalLaw.Side24.d2Upper < 10 ^ 19"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d2Upper","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d3_below_d2","prop_premises":[],"statement":"UniversalLaw.Side24.d3Upper < UniversalLaw.Side24.d2Lower"}
+CBZ_END {"count":45,"modules":["UniversalLaw.Side24.Ledger","UniversalLaw.Side24.ConeMoments","UniversalLaw.Side24.Endpoints","UniversalLaw"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/auditor-module-census.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/auditor-module-census.log
new file mode 100644
index 000000000..7effdc667
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/auditor-module-census.log
@@ -0,0 +1,5 @@
+CBZ_RECORD {"axioms":["propext","Quot.sound"],"kind":"theorem","module":"CBZNonvacuity","name":"CBZNonvacuity.dimensions_inhabited","prop_premises":[],"statement":"∃ d, d ∈ [2, 3]"}
+CBZ_RECORD {"axioms":["propext","Quot.sound"],"kind":"theorem","module":"CBZNonvacuity","name":"CBZNonvacuity.pairing_all_seven","prop_premises":[],"statement":"0 ∈ [0, 1, 2, 3, 4, 5, 6] ∧\n 1 ∈ [0, 1, 2, 3, 4, 5, 6] ∧\n 2 ∈ [0, 1, 2, 3, 4, 5, 6] ∧\n 3 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 4 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 5 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 6 ∈ [0, 1, 2, 3, 4, 5, 6]"}
+CBZ_RECORD {"axioms":["propext","Quot.sound"],"kind":"theorem","module":"CBZNonvacuity","name":"CBZNonvacuity.dimensions_both","prop_premises":[],"statement":"2 ∈ [2, 3] ∧ 3 ∈ [2, 3]"}
+CBZ_RECORD {"axioms":["propext","Quot.sound"],"kind":"theorem","module":"CBZNonvacuity","name":"CBZNonvacuity.pairing_domain_inhabited","prop_premises":[],"statement":"∃ q, q ∈ [0, 1, 2, 3, 4, 5, 6]"}
+CBZ_END {"count":4,"modules":["CBZNonvacuity"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/false_premise-audit.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/false_premise-audit.log
new file mode 100644
index 000000000..678dc0f15
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/false_premise-audit.log
@@ -0,0 +1,6 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZControl_false_premise","name":"vacuous","prop_premises":[{"name":"h","type":"False"}],"statement":"False → False"}
+CBZ_END {"count":1,"modules":["CBZControl_false_premise"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/false_premise-compile.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/false_premise-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/fresh-kernel.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/fresh-kernel.log
new file mode 100644
index 000000000..dd6c2b20d
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/fresh-kernel.log
@@ -0,0 +1 @@
+replaying UniversalLaw with --fresh
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/honest-audit.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/honest-audit.log
new file mode 100644
index 000000000..ab1971291
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/honest-audit.log
@@ -0,0 +1,6 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZControl_honest","name":"honest","prop_premises":[],"statement":"True"}
+CBZ_END {"count":1,"modules":["CBZControl_honest"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/honest-compile.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/honest-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/missing-module.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/missing-module.log
new file mode 100644
index 000000000..be2f08351
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/missing-module.log
@@ -0,0 +1,5 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/MissingModule.lean:21:0: error: CBZ_MISSING_MODULE [MissingModule]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/native-audit.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/native-audit.log
new file mode 100644
index 000000000..d3f616d31
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/native-audit.log
@@ -0,0 +1,5 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/Audit_native.lean:21:0: error: CBZ_FORBIDDEN native._native.native_decide.ax_1_1 [native._native.native_decide.ax_1_1]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/native-compile.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/native-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json
new file mode 100644
index 000000000..3d40c74a5
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json
@@ -0,0 +1,748 @@
+{
+ "all_project_constants": [
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.lattice_shell_constant",
+ "prop_premises": [],
+ "statement": "27 * 27 = 729 \u2227 729 * 2 = 1458"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_terms_six",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.fact 6 / (2 ^ 0 * UniversalLaw.Side24.fact 0 * UniversalLaw.Side24.fact 6) = 1 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 1 * UniversalLaw.Side24.fact 1 * UniversalLaw.Side24.fact 4) = 15 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 2 * UniversalLaw.Side24.fact 2 * UniversalLaw.Side24.fact 2) = 45 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 3 * UniversalLaw.Side24.fact 3 * UniversalLaw.Side24.fact 0) = 15"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.geometric_ratio_constants",
+ "prop_premises": [],
+ "statement": "2 ^ 9 = 512 \u2227 288 * 3 = 864"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.expTaylorNumerator",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact._f",
+ "prop_premises": [],
+ "statement": "(x : Nat) \u2192 Nat.below x \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exponent_bounds",
+ "prop_premises": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "d \u2208 [2, 3]"
+ }
+ ],
+ "statement": "\u2200 (d : Nat),\n d \u2208 [2, 3] \u2192\n UniversalLaw.Side24.sixA d + 2 * UniversalLaw.Side24.sixB d < 84 \u2227\n 2 * UniversalLaw.Side24.sixA d + UniversalLaw.Side24.sixB d < 78"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_sum_six",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.pairingSum 6 = 76"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.covariance_relative_bound",
+ "prop_premises": [],
+ "statement": "2 * 10 * 3 = 60 \u2227 60 * UniversalLaw.Side24.imageConstant < 10 ^ 17"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third",
+ "prop_premises": [],
+ "statement": "58 * 9 < 23 ^ 2"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.imageConstant",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.odd_block_shifted_minors",
+ "prop_premises": [],
+ "statement": "3 * 1 - 1 = 2 \u2227 3 * 15 - 1 = 44 \u2227 2 * 44 - -9 * -9 = 7"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.sixB",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.density_comparison_below_reported",
+ "prop_premises": [],
+ "statement": "32 * 10 ^ 106 < 10 ^ 108"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.period_exponent",
+ "prop_premises": [],
+ "statement": "24 ^ 2 / 2 = 288"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.odd_block_eigenvalues",
+ "prop_premises": [],
+ "statement": "1 + 15 = 2 * 8 \u2227 1 * 15 - -3 * -3 = 6 \u2227 8 ^ 2 - 58 = 6"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.sixA",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_sum_le_six",
+ "prop_premises": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "q \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ }
+ ],
+ "statement": "\u2200 (q : Nat), q \u2208 [0, 1, 2, 3, 4, 5, 6] \u2192 UniversalLaw.Side24.pairingSum q \u2264 76"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact._sunfold",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.image_constant_value",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.imageConstant = 21175738586478"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten",
+ "prop_premises": [],
+ "statement": "10 * (125 ^ 20 * UniversalLaw.Side24.fact 20) < UniversalLaw.Side24.expTaylorNumerator"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact._unsafe_rec",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairingSum",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.sixth_moment_double_factorial",
+ "prop_premises": [],
+ "statement": "1 * 3 * 5 = 15"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exponent_values",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.sixA 2 = 13 \u2227\n UniversalLaw.Side24.sixB 2 = 15 \u2227 UniversalLaw.Side24.sixA 3 = 25 \u2227 UniversalLaw.Side24.sixB 3 = 27"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.ratio_constant_ordering",
+ "prop_premises": [],
+ "statement": "13 \u2264 32 \u2227 28 \u2264 32"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact.match_1",
+ "prop_premises": [],
+ "statement": "(motive : Nat \u2192 Sort u_1) \u2192 (x : Nat) \u2192 (Unit \u2192 motive 0) \u2192 ((n : Nat) \u2192 motive n.succ) \u2192 motive x"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.conditional_third_derivative_variance",
+ "prop_premises": [],
+ "statement": "15 - -3 * -3 / 1 = 6"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cube_root_simplification",
+ "prop_premises": [],
+ "statement": "6 ^ 2 * 2 = 3 * 24"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.exponential_moment_of_trace",
+ "prop_premises": [],
+ "statement": "3 + 5 = 8"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.fourth_moment_of_trace",
+ "prop_premises": [],
+ "statement": "3 * 5 ^ 2 * 3 = 25 * 9"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.hessian_block_eigenvalues",
+ "prop_premises": [],
+ "statement": "2 + 2 = 4 \u2227 3 + 2 = 5 \u2227 1 < 3 * 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.pin_determinant_and_joint_dimension",
+ "prop_premises": [],
+ "statement": "3 * 1 * 1 = 3 \u2227 2 + 1 + 2 * 3 / 2 = 6 \u2227 3 + 1 + 3 * 4 / 2 = 10"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.transverse_covariance_entries_thirds",
+ "prop_premises": [],
+ "statement": "2 + 3 + 3 = 8 \u2227 0 + 3 + 0 = 3 \u2227 2 + 0 + 0 = 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.trace_and_traceless_variances",
+ "prop_premises": [],
+ "statement": "8 + 8 + 2 * 2 = 20 \u2227 20 * 3 = 5 * 12 \u2227 8 + 8 - 2 * 2 = 12 \u2227 12 = 1 * 12 \u2227 8 - 8 = 0"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cone_moment_m1_thirds",
+ "prop_premises": [],
+ "statement": "8 = 2 * 4"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cone_moment_m2_algebra",
+ "prop_premises": [],
+ "statement": "4 * 5 = 20 \u2227 25 - 20 + 24 = 29 \u2227 4 ^ 2 * 3 = 6 * 8"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3Upper",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d2Lower",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d2_endpoints_adjacent",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d2Lower < UniversalLaw.Side24.d2Upper \u2227\n UniversalLaw.Side24.d2Upper = UniversalLaw.Side24.d2Lower + 1"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3Lower",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3_endpoints_adjacent",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d3Lower < UniversalLaw.Side24.d3Upper \u2227\n UniversalLaw.Side24.d3Upper = UniversalLaw.Side24.d3Lower + 1"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.endpoints_in_unit_tenth",
+ "prop_premises": [],
+ "statement": "0 < UniversalLaw.Side24.d3Lower \u2227 UniversalLaw.Side24.d2Upper < 10 ^ 19"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d2Upper",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3_below_d2",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d3Upper < UniversalLaw.Side24.d2Lower"
+ }
+ ],
+ "audit_input_sha256": {
+ "tools/CBZNonvacuity.lean": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f",
+ "tools/cbz_lean_check.py": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d",
+ "tools/formal_gate_check.py": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5"
+ },
+ "audit_module_constants": [
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.dimensions_inhabited",
+ "prop_premises": [],
+ "statement": "\u2203 d, d \u2208 [2, 3]"
+ },
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.pairing_all_seven",
+ "prop_premises": [],
+ "statement": "0 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 1 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 2 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 3 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 4 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 5 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 6 \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ },
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.dimensions_both",
+ "prop_premises": [],
+ "statement": "2 \u2208 [2, 3] \u2227 3 \u2208 [2, 3]"
+ },
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.pairing_domain_inhabited",
+ "prop_premises": [],
+ "statement": "\u2203 q, q \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ }
+ ],
+ "baseline_receipt_sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1",
+ "checked_commit": "6fc021839072d8c34f41e18e77b0f618c53baa15",
+ "fresh_kernel": "PASS",
+ "lean_version": "Lean (version 4.34.1, x86_64-unknown-linux-gnu, commit 5045d0056413266e57c625dcd7c365b10e377c52, Release)",
+ "logs": {
+ "all-declarations-and-witnesses.log": "dcc81dc13a6dce4b25a6300fd616966e835877f124b8e6448b452878df9673ea",
+ "auditor-module-census.log": "6b9bf4260474d13fb392b71b0fa3b3dadc75fc99fb06310b9caaff31feb3ce4c",
+ "false_premise-audit.log": "424799495dafb2dac297a8206c364a73e8c41bed48ac772b0e806443811bfac1",
+ "false_premise-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "fresh-kernel.log": "765e0f77863dc012524cd125d2699754f19e967f4ec35908a2aed7903057572e",
+ "honest-audit.log": "62390300f3aaa05474dd1d9b75e47728635f0e2c4b0b49dc9daf0914ec506d87",
+ "honest-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "missing-module.log": "2d9fdde838c729bf8630456eec1033381833a4a2eb42c8f07ca910d9d636f121",
+ "native-audit.log": "468963ce795fd68a13b99e1e5b9e90e817f273fe2099bda696deb61552697200",
+ "native-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "sorry-audit.log": "938f55996c45f78c29d90750ce73a1cfba8bd488b34f5b9e99ced19993bab2f4",
+ "sorry-compile.log": "693c90261e9a6a2c68216209a5692f39ee06659d9a50919b2e551ffbd8f8deaa",
+ "unused_axiom-audit.log": "972d65c1ff8afddb2e2f9024fbaf972b80292d7b9c0d774f8d946dee28fc12f6",
+ "unused_axiom-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "weakened-witness-audit.log": "3da011e5e28b010ac0851c66e96f3c3d7f501dbb8febcf944f597f239d4412d4",
+ "weakened-witness-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "weakened-witness-contract.log": "727a132984645d32ac0f4607e61132c096ab4aa1dfe82bcfe9ad4756744d9346",
+ "witness-kernel.log": "ab7e01501bc759b00ba24bb39ea9d9bf5e475a179a06f32ee13f3cb1bbc2492d",
+ "witness-type-contract.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0",
+ "proofs": [
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.lattice_shell_constant",
+ "prop_premises": [],
+ "statement": "27 * 27 = 729 \u2227 729 * 2 = 1458"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_terms_six",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.fact 6 / (2 ^ 0 * UniversalLaw.Side24.fact 0 * UniversalLaw.Side24.fact 6) = 1 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 1 * UniversalLaw.Side24.fact 1 * UniversalLaw.Side24.fact 4) = 15 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 2 * UniversalLaw.Side24.fact 2 * UniversalLaw.Side24.fact 2) = 45 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 3 * UniversalLaw.Side24.fact 3 * UniversalLaw.Side24.fact 0) = 15"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.geometric_ratio_constants",
+ "prop_premises": [],
+ "statement": "2 ^ 9 = 512 \u2227 288 * 3 = 864"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exponent_bounds",
+ "prop_premises": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "d \u2208 [2, 3]"
+ }
+ ],
+ "statement": "\u2200 (d : Nat),\n d \u2208 [2, 3] \u2192\n UniversalLaw.Side24.sixA d + 2 * UniversalLaw.Side24.sixB d < 84 \u2227\n 2 * UniversalLaw.Side24.sixA d + UniversalLaw.Side24.sixB d < 78"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_sum_six",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.pairingSum 6 = 76"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.covariance_relative_bound",
+ "prop_premises": [],
+ "statement": "2 * 10 * 3 = 60 \u2227 60 * UniversalLaw.Side24.imageConstant < 10 ^ 17"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third",
+ "prop_premises": [],
+ "statement": "58 * 9 < 23 ^ 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.odd_block_shifted_minors",
+ "prop_premises": [],
+ "statement": "3 * 1 - 1 = 2 \u2227 3 * 15 - 1 = 44 \u2227 2 * 44 - -9 * -9 = 7"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.density_comparison_below_reported",
+ "prop_premises": [],
+ "statement": "32 * 10 ^ 106 < 10 ^ 108"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.period_exponent",
+ "prop_premises": [],
+ "statement": "24 ^ 2 / 2 = 288"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.odd_block_eigenvalues",
+ "prop_premises": [],
+ "statement": "1 + 15 = 2 * 8 \u2227 1 * 15 - -3 * -3 = 6 \u2227 8 ^ 2 - 58 = 6"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_sum_le_six",
+ "prop_premises": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "q \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ }
+ ],
+ "statement": "\u2200 (q : Nat), q \u2208 [0, 1, 2, 3, 4, 5, 6] \u2192 UniversalLaw.Side24.pairingSum q \u2264 76"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.image_constant_value",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.imageConstant = 21175738586478"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten",
+ "prop_premises": [],
+ "statement": "10 * (125 ^ 20 * UniversalLaw.Side24.fact 20) < UniversalLaw.Side24.expTaylorNumerator"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.sixth_moment_double_factorial",
+ "prop_premises": [],
+ "statement": "1 * 3 * 5 = 15"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exponent_values",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.sixA 2 = 13 \u2227\n UniversalLaw.Side24.sixB 2 = 15 \u2227 UniversalLaw.Side24.sixA 3 = 25 \u2227 UniversalLaw.Side24.sixB 3 = 27"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.ratio_constant_ordering",
+ "prop_premises": [],
+ "statement": "13 \u2264 32 \u2227 28 \u2264 32"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.conditional_third_derivative_variance",
+ "prop_premises": [],
+ "statement": "15 - -3 * -3 / 1 = 6"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cube_root_simplification",
+ "prop_premises": [],
+ "statement": "6 ^ 2 * 2 = 3 * 24"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.exponential_moment_of_trace",
+ "prop_premises": [],
+ "statement": "3 + 5 = 8"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.fourth_moment_of_trace",
+ "prop_premises": [],
+ "statement": "3 * 5 ^ 2 * 3 = 25 * 9"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.hessian_block_eigenvalues",
+ "prop_premises": [],
+ "statement": "2 + 2 = 4 \u2227 3 + 2 = 5 \u2227 1 < 3 * 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.pin_determinant_and_joint_dimension",
+ "prop_premises": [],
+ "statement": "3 * 1 * 1 = 3 \u2227 2 + 1 + 2 * 3 / 2 = 6 \u2227 3 + 1 + 3 * 4 / 2 = 10"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.transverse_covariance_entries_thirds",
+ "prop_premises": [],
+ "statement": "2 + 3 + 3 = 8 \u2227 0 + 3 + 0 = 3 \u2227 2 + 0 + 0 = 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.trace_and_traceless_variances",
+ "prop_premises": [],
+ "statement": "8 + 8 + 2 * 2 = 20 \u2227 20 * 3 = 5 * 12 \u2227 8 + 8 - 2 * 2 = 12 \u2227 12 = 1 * 12 \u2227 8 - 8 = 0"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cone_moment_m1_thirds",
+ "prop_premises": [],
+ "statement": "8 = 2 * 4"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cone_moment_m2_algebra",
+ "prop_premises": [],
+ "statement": "4 * 5 = 20 \u2227 25 - 20 + 24 = 29 \u2227 4 ^ 2 * 3 = 6 * 8"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d2_endpoints_adjacent",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d2Lower < UniversalLaw.Side24.d2Upper \u2227\n UniversalLaw.Side24.d2Upper = UniversalLaw.Side24.d2Lower + 1"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3_endpoints_adjacent",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d3Lower < UniversalLaw.Side24.d3Upper \u2227\n UniversalLaw.Side24.d3Upper = UniversalLaw.Side24.d3Lower + 1"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.endpoints_in_unit_tenth",
+ "prop_premises": [],
+ "statement": "0 < UniversalLaw.Side24.d3Lower \u2227 UniversalLaw.Side24.d2Upper < 10 ^ 19"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3_below_d2",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d3Upper < UniversalLaw.Side24.d2Lower"
+ }
+ ],
+ "schema_version": 1,
+ "scientific_effect": "NONE",
+ "scope": "31 literal Main arithmetic statements only; no analytic/source parent closure",
+ "self_tests": {
+ "false_premise": "EXPECTED_REJECTION",
+ "honest": "EXPECTED_ACCEPTANCE",
+ "missing_module": "EXPECTED_REJECTION",
+ "native": "EXPECTED_REJECTION",
+ "sorry": "EXPECTED_REJECTION",
+ "unused_axiom": "EXPECTED_REJECTION",
+ "weakened_witness_types": "REJECTED_BY_EXACT_TYPE_CENSUS_AND_LEAN_ASCRIPTION"
+ },
+ "source_alignment": "NOT_INFERRED",
+ "witness_axioms": {
+ "CBZNonvacuity.dimensions_both": [
+ "Quot.sound",
+ "propext"
+ ],
+ "CBZNonvacuity.dimensions_inhabited": [
+ "Quot.sound",
+ "propext"
+ ],
+ "CBZNonvacuity.pairing_all_seven": [
+ "Quot.sound",
+ "propext"
+ ],
+ "CBZNonvacuity.pairing_domain_inhabited": [
+ "Quot.sound",
+ "propext"
+ ]
+ },
+ "witness_type_contract": {
+ "CBZNonvacuity.dimensions_both": "(2:Nat) \u2208 [2,3] \u2227 (3:Nat) \u2208 [2,3]",
+ "CBZNonvacuity.dimensions_inhabited": "\u2203 d : Nat, d \u2208 [2,3]",
+ "CBZNonvacuity.pairing_all_seven": "(0:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (1:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (2:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (3:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (4:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (5:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (6:Nat) \u2208 [0,1,2,3,4,5,6]",
+ "CBZNonvacuity.pairing_domain_inhabited": "\u2203 q : Nat, q \u2208 [0,1,2,3,4,5,6]"
+ }
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/sorry-audit.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/sorry-audit.log
new file mode 100644
index 000000000..6368c5815
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/sorry-audit.log
@@ -0,0 +1,5 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/Audit_sorry.lean:21:0: error: CBZ_FORBIDDEN bad [sorryAx]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/sorry-compile.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/sorry-compile.log
new file mode 100644
index 000000000..856f03ef6
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/sorry-compile.log
@@ -0,0 +1 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/CBZControl_sorry.lean:2:8: warning: declaration uses `sorry`
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/unused_axiom-audit.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/unused_axiom-audit.log
new file mode 100644
index 000000000..e1c241735
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/unused_axiom-audit.log
@@ -0,0 +1,6 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZControl_unused_axiom","name":"honest","prop_premises":[],"statement":"True"}
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/Audit_unused_axiom.lean:21:0: error: CBZ_FORBIDDEN hidden [hidden]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/unused_axiom-compile.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/unused_axiom-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-audit.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-audit.log
new file mode 100644
index 000000000..29960ffd9
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-audit.log
@@ -0,0 +1,5 @@
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZWeakenedWitness","name":"CBZNonvacuity.dimensions_inhabited","prop_premises":[],"statement":"True"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZWeakenedWitness","name":"CBZNonvacuity.pairing_all_seven","prop_premises":[],"statement":"True"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZWeakenedWitness","name":"CBZNonvacuity.dimensions_both","prop_premises":[],"statement":"True"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZWeakenedWitness","name":"CBZNonvacuity.pairing_domain_inhabited","prop_premises":[],"statement":"True"}
+CBZ_END {"count":4,"modules":["CBZWeakenedWitness"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-compile.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-contract.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-contract.log
new file mode 100644
index 000000000..af3197f70
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-contract.log
@@ -0,0 +1,27 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/WeakenedWitnessContract.lean:2:46: error: Type mismatch
+ CBZNonvacuity.pairing_domain_inhabited
+has type
+ True
+but is expected to have type
+ ∃ q, q ∈ [0, 1, 2, 3, 4, 5, 6]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/WeakenedWitnessContract.lean:3:209: error: Type mismatch
+ CBZNonvacuity.pairing_all_seven
+has type
+ True
+but is expected to have type
+ 0 ∈ [0, 1, 2, 3, 4, 5, 6] ∧
+ 1 ∈ [0, 1, 2, 3, 4, 5, 6] ∧
+ 2 ∈ [0, 1, 2, 3, 4, 5, 6] ∧
+ 3 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 4 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 5 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 6 ∈ [0, 1, 2, 3, 4, 5, 6]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/WeakenedWitnessContract.lean:4:36: error: Type mismatch
+ CBZNonvacuity.dimensions_inhabited
+has type
+ True
+but is expected to have type
+ ∃ d, d ∈ [2, 3]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/WeakenedWitnessContract.lean:5:49: error: Type mismatch
+ CBZNonvacuity.dimensions_both
+has type
+ True
+but is expected to have type
+ 2 ∈ [2, 3] ∧ 3 ∈ [2, 3]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/witness-kernel.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/witness-kernel.log
new file mode 100644
index 000000000..00b3a20b0
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/witness-kernel.log
@@ -0,0 +1 @@
+replaying CBZNonvacuity
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/witness-type-contract.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/witness-type-contract.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/Audit.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/Audit.lean
new file mode 100644
index 000000000..e6fd8903c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/Audit.lean
@@ -0,0 +1,32 @@
+import UniversalLaw
+#print axioms UniversalLaw.Side24.pairing_sum_six
+#print axioms UniversalLaw.Side24.pairing_sum_le_six
+#print axioms UniversalLaw.Side24.pairing_terms_six
+#print axioms UniversalLaw.Side24.sixth_moment_double_factorial
+#print axioms UniversalLaw.Side24.lattice_shell_constant
+#print axioms UniversalLaw.Side24.geometric_ratio_constants
+#print axioms UniversalLaw.Side24.period_exponent
+#print axioms UniversalLaw.Side24.image_constant_value
+#print axioms UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten
+#print axioms UniversalLaw.Side24.covariance_relative_bound
+#print axioms UniversalLaw.Side24.odd_block_eigenvalues
+#print axioms UniversalLaw.Side24.odd_block_shifted_minors
+#print axioms UniversalLaw.Side24.smaller_eigenvalue_exceeds_third
+#print axioms UniversalLaw.Side24.exponent_bounds
+#print axioms UniversalLaw.Side24.exponent_values
+#print axioms UniversalLaw.Side24.ratio_constant_ordering
+#print axioms UniversalLaw.Side24.density_comparison_below_reported
+#print axioms UniversalLaw.Side24.conditional_third_derivative_variance
+#print axioms UniversalLaw.Side24.transverse_covariance_entries_thirds
+#print axioms UniversalLaw.Side24.cone_moment_m1_thirds
+#print axioms UniversalLaw.Side24.trace_and_traceless_variances
+#print axioms UniversalLaw.Side24.fourth_moment_of_trace
+#print axioms UniversalLaw.Side24.exponential_moment_of_trace
+#print axioms UniversalLaw.Side24.cone_moment_m2_algebra
+#print axioms UniversalLaw.Side24.cube_root_simplification
+#print axioms UniversalLaw.Side24.pin_determinant_and_joint_dimension
+#print axioms UniversalLaw.Side24.hessian_block_eigenvalues
+#print axioms UniversalLaw.Side24.d2_endpoints_adjacent
+#print axioms UniversalLaw.Side24.d3_endpoints_adjacent
+#print axioms UniversalLaw.Side24.d3_below_d2
+#print axioms UniversalLaw.Side24.endpoints_in_unit_tenth
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/Types.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/Types.lean
new file mode 100644
index 000000000..bf35db692
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/Types.lean
@@ -0,0 +1,33 @@
+import UniversalLaw
+set_option pp.explicit true
+#check UniversalLaw.Side24.pairing_sum_six
+#check UniversalLaw.Side24.pairing_sum_le_six
+#check UniversalLaw.Side24.pairing_terms_six
+#check UniversalLaw.Side24.sixth_moment_double_factorial
+#check UniversalLaw.Side24.lattice_shell_constant
+#check UniversalLaw.Side24.geometric_ratio_constants
+#check UniversalLaw.Side24.period_exponent
+#check UniversalLaw.Side24.image_constant_value
+#check UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten
+#check UniversalLaw.Side24.covariance_relative_bound
+#check UniversalLaw.Side24.odd_block_eigenvalues
+#check UniversalLaw.Side24.odd_block_shifted_minors
+#check UniversalLaw.Side24.smaller_eigenvalue_exceeds_third
+#check UniversalLaw.Side24.exponent_bounds
+#check UniversalLaw.Side24.exponent_values
+#check UniversalLaw.Side24.ratio_constant_ordering
+#check UniversalLaw.Side24.density_comparison_below_reported
+#check UniversalLaw.Side24.conditional_third_derivative_variance
+#check UniversalLaw.Side24.transverse_covariance_entries_thirds
+#check UniversalLaw.Side24.cone_moment_m1_thirds
+#check UniversalLaw.Side24.trace_and_traceless_variances
+#check UniversalLaw.Side24.fourth_moment_of_trace
+#check UniversalLaw.Side24.exponential_moment_of_trace
+#check UniversalLaw.Side24.cone_moment_m2_algebra
+#check UniversalLaw.Side24.cube_root_simplification
+#check UniversalLaw.Side24.pin_determinant_and_joint_dimension
+#check UniversalLaw.Side24.hessian_block_eigenvalues
+#check UniversalLaw.Side24.d2_endpoints_adjacent
+#check UniversalLaw.Side24.d3_endpoints_adjacent
+#check UniversalLaw.Side24.d3_below_d2
+#check UniversalLaw.Side24.endpoints_in_unit_tenth
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/axioms.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/axioms.log
new file mode 100644
index 000000000..4948445ef
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/axioms.log
@@ -0,0 +1,31 @@
+'UniversalLaw.Side24.pairing_sum_six' does not depend on any axioms
+'UniversalLaw.Side24.pairing_sum_le_six' does not depend on any axioms
+'UniversalLaw.Side24.pairing_terms_six' does not depend on any axioms
+'UniversalLaw.Side24.sixth_moment_double_factorial' does not depend on any axioms
+'UniversalLaw.Side24.lattice_shell_constant' does not depend on any axioms
+'UniversalLaw.Side24.geometric_ratio_constants' does not depend on any axioms
+'UniversalLaw.Side24.period_exponent' does not depend on any axioms
+'UniversalLaw.Side24.image_constant_value' does not depend on any axioms
+'UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten' does not depend on any axioms
+'UniversalLaw.Side24.covariance_relative_bound' does not depend on any axioms
+'UniversalLaw.Side24.odd_block_eigenvalues' does not depend on any axioms
+'UniversalLaw.Side24.odd_block_shifted_minors' does not depend on any axioms
+'UniversalLaw.Side24.smaller_eigenvalue_exceeds_third' does not depend on any axioms
+'UniversalLaw.Side24.exponent_bounds' does not depend on any axioms
+'UniversalLaw.Side24.exponent_values' does not depend on any axioms
+'UniversalLaw.Side24.ratio_constant_ordering' does not depend on any axioms
+'UniversalLaw.Side24.density_comparison_below_reported' does not depend on any axioms
+'UniversalLaw.Side24.conditional_third_derivative_variance' does not depend on any axioms
+'UniversalLaw.Side24.transverse_covariance_entries_thirds' does not depend on any axioms
+'UniversalLaw.Side24.cone_moment_m1_thirds' does not depend on any axioms
+'UniversalLaw.Side24.trace_and_traceless_variances' does not depend on any axioms
+'UniversalLaw.Side24.fourth_moment_of_trace' does not depend on any axioms
+'UniversalLaw.Side24.exponential_moment_of_trace' does not depend on any axioms
+'UniversalLaw.Side24.cone_moment_m2_algebra' does not depend on any axioms
+'UniversalLaw.Side24.cube_root_simplification' does not depend on any axioms
+'UniversalLaw.Side24.pin_determinant_and_joint_dimension' does not depend on any axioms
+'UniversalLaw.Side24.hessian_block_eigenvalues' does not depend on any axioms
+'UniversalLaw.Side24.d2_endpoints_adjacent' does not depend on any axioms
+'UniversalLaw.Side24.d3_endpoints_adjacent' does not depend on any axioms
+'UniversalLaw.Side24.d3_below_d2' does not depend on any axioms
+'UniversalLaw.Side24.endpoints_in_unit_tenth' does not depend on any axioms
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/build.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/build.log
new file mode 100644
index 000000000..9ae799e1b
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/build.log
@@ -0,0 +1,5 @@
+✔ [2/6] Built UniversalLaw.Side24.Endpoints (566ms)
+✔ [3/6] Built UniversalLaw.Side24.Ledger (840ms)
+✔ [4/6] Built UniversalLaw.Side24.ConeMoments (839ms)
+✔ [5/6] Built UniversalLaw (291ms)
+Build completed successfully (6 jobs).
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/custom_imported.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/custom_imported.lean
new file mode 100644
index 000000000..2d0df8256
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/custom_imported.lean
@@ -0,0 +1,5 @@
+import UniversalLaw
+axiom hiddenPremise : False
+theorem middle : False := hiddenPremise
+theorem injected : False := middle
+#print axioms injected
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/custom_imported.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/custom_imported.log
new file mode 100644
index 000000000..52be5f132
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/custom_imported.log
@@ -0,0 +1 @@
+'injected' depends on axioms: [hiddenPremise]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/elaborated-types.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/elaborated-types.log
new file mode 100644
index 000000000..be7907e96
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/elaborated-types.log
@@ -0,0 +1,389 @@
+UniversalLaw.Side24.pairing_sum_six :
+ @Eq Nat (UniversalLaw.Side24.pairingSum (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))
+ (@OfNat.ofNat Nat (nat_lit 76) (instOfNatNat (nat_lit 76)))
+UniversalLaw.Side24.pairing_sum_le_six (q : Nat) :
+ @Membership.mem Nat (List Nat) (@List.instMembership Nat)
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))) (@List.nil Nat))))))))
+ q →
+ @LE.le Nat instLENat (UniversalLaw.Side24.pairingSum q) (@OfNat.ofNat Nat (nat_lit 76) (instOfNatNat (nat_lit 76)))
+UniversalLaw.Side24.pairing_terms_six :
+ And
+ (@Eq Nat
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0)))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))))
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
+ (And
+ (@Eq Nat
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4))))))
+ (@OfNat.ofNat Nat (nat_lit 15) (instOfNatNat (nat_lit 15))))
+ (And
+ (@Eq Nat
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))))
+ (@OfNat.ofNat Nat (nat_lit 45) (instOfNatNat (nat_lit 45))))
+ (@Eq Nat
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))))))
+ (@OfNat.ofNat Nat (nat_lit 15) (instOfNatNat (nat_lit 15))))))
+UniversalLaw.Side24.sixth_moment_double_factorial :
+ @Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5))))
+ (@OfNat.ofNat Nat (nat_lit 15) (instOfNatNat (nat_lit 15)))
+UniversalLaw.Side24.lattice_shell_constant :
+ And
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 27) (instOfNatNat (nat_lit 27)))
+ (@OfNat.ofNat Nat (nat_lit 27) (instOfNatNat (nat_lit 27))))
+ (@OfNat.ofNat Nat (nat_lit 729) (instOfNatNat (nat_lit 729))))
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 729) (instOfNatNat (nat_lit 729)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 1458) (instOfNatNat (nat_lit 1458))))
+UniversalLaw.Side24.geometric_ratio_constants :
+ And
+ (@Eq Nat
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 9) (instOfNatNat (nat_lit 9))))
+ (@OfNat.ofNat Nat (nat_lit 512) (instOfNatNat (nat_lit 512))))
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 288) (instOfNatNat (nat_lit 288)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 864) (instOfNatNat (nat_lit 864))))
+UniversalLaw.Side24.period_exponent :
+ @Eq Nat
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 24) (instOfNatNat (nat_lit 24)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 288) (instOfNatNat (nat_lit 288)))
+UniversalLaw.Side24.image_constant_value :
+ @Eq Nat UniversalLaw.Side24.imageConstant
+ (@OfNat.ofNat Nat (nat_lit 21175738586478) (instOfNatNat (nat_lit 21175738586478)))
+UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten :
+ @LT.lt Nat instLTNat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10)))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 125) (instOfNatNat (nat_lit 125)))
+ (@OfNat.ofNat Nat (nat_lit 20) (instOfNatNat (nat_lit 20))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 20) (instOfNatNat (nat_lit 20))))))
+ UniversalLaw.Side24.expTaylorNumerator
+UniversalLaw.Side24.covariance_relative_bound :
+ And
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10))))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 60) (instOfNatNat (nat_lit 60))))
+ (@LT.lt Nat instLTNat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 60) (instOfNatNat (nat_lit 60)))
+ UniversalLaw.Side24.imageConstant)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10)))
+ (@OfNat.ofNat Nat (nat_lit 17) (instOfNatNat (nat_lit 17)))))
+UniversalLaw.Side24.odd_block_eigenvalues :
+ And
+ (@Eq Int
+ (@HAdd.hAdd Int Int Int (@instHAdd Int Int.instAdd) (@OfNat.ofNat Int (nat_lit 1) (@instOfNat (nat_lit 1)))
+ (@OfNat.ofNat Int (nat_lit 15) (@instOfNat (nat_lit 15))))
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul) (@OfNat.ofNat Int (nat_lit 2) (@instOfNat (nat_lit 2)))
+ (@OfNat.ofNat Int (nat_lit 8) (@instOfNat (nat_lit 8)))))
+ (And
+ (@Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub)
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul) (@OfNat.ofNat Int (nat_lit 1) (@instOfNat (nat_lit 1)))
+ (@OfNat.ofNat Int (nat_lit 15) (@instOfNat (nat_lit 15))))
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul)
+ (@Neg.neg Int Int.instNegInt (@OfNat.ofNat Int (nat_lit 3) (@instOfNat (nat_lit 3))))
+ (@Neg.neg Int Int.instNegInt (@OfNat.ofNat Int (nat_lit 3) (@instOfNat (nat_lit 3))))))
+ (@OfNat.ofNat Int (nat_lit 6) (@instOfNat (nat_lit 6))))
+ (@Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub)
+ (@HPow.hPow Int Nat Int (@instHPow Int Nat (@instPowNat Int Int.instNatPow))
+ (@OfNat.ofNat Int (nat_lit 8) (@instOfNat (nat_lit 8)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Int (nat_lit 58) (@instOfNat (nat_lit 58))))
+ (@OfNat.ofNat Int (nat_lit 6) (@instOfNat (nat_lit 6)))))
+UniversalLaw.Side24.odd_block_shifted_minors :
+ And
+ (@Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub)
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul) (@OfNat.ofNat Int (nat_lit 3) (@instOfNat (nat_lit 3)))
+ (@OfNat.ofNat Int (nat_lit 1) (@instOfNat (nat_lit 1))))
+ (@OfNat.ofNat Int (nat_lit 1) (@instOfNat (nat_lit 1))))
+ (@OfNat.ofNat Int (nat_lit 2) (@instOfNat (nat_lit 2))))
+ (And
+ (@Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub)
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul) (@OfNat.ofNat Int (nat_lit 3) (@instOfNat (nat_lit 3)))
+ (@OfNat.ofNat Int (nat_lit 15) (@instOfNat (nat_lit 15))))
+ (@OfNat.ofNat Int (nat_lit 1) (@instOfNat (nat_lit 1))))
+ (@OfNat.ofNat Int (nat_lit 44) (@instOfNat (nat_lit 44))))
+ (@Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub)
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul) (@OfNat.ofNat Int (nat_lit 2) (@instOfNat (nat_lit 2)))
+ (@OfNat.ofNat Int (nat_lit 44) (@instOfNat (nat_lit 44))))
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul)
+ (@Neg.neg Int Int.instNegInt (@OfNat.ofNat Int (nat_lit 9) (@instOfNat (nat_lit 9))))
+ (@Neg.neg Int Int.instNegInt (@OfNat.ofNat Int (nat_lit 9) (@instOfNat (nat_lit 9))))))
+ (@OfNat.ofNat Int (nat_lit 7) (@instOfNat (nat_lit 7)))))
+UniversalLaw.Side24.smaller_eigenvalue_exceeds_third :
+ @LT.lt Nat instLTNat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 58) (instOfNatNat (nat_lit 58)))
+ (@OfNat.ofNat Nat (nat_lit 9) (instOfNatNat (nat_lit 9))))
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 23) (instOfNatNat (nat_lit 23)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+UniversalLaw.Side24.exponent_bounds (d : Nat) :
+ @Membership.mem Nat (List Nat) (@List.instMembership Nat)
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))) (@List.nil Nat)))
+ d →
+ And
+ (@LT.lt Nat instLTNat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (UniversalLaw.Side24.sixA d)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (UniversalLaw.Side24.sixB d)))
+ (@OfNat.ofNat Nat (nat_lit 84) (instOfNatNat (nat_lit 84))))
+ (@LT.lt Nat instLTNat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (UniversalLaw.Side24.sixA d))
+ (UniversalLaw.Side24.sixB d))
+ (@OfNat.ofNat Nat (nat_lit 78) (instOfNatNat (nat_lit 78))))
+UniversalLaw.Side24.exponent_values :
+ And
+ (@Eq Nat (UniversalLaw.Side24.sixA (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 13) (instOfNatNat (nat_lit 13))))
+ (And
+ (@Eq Nat (UniversalLaw.Side24.sixB (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 15) (instOfNatNat (nat_lit 15))))
+ (And
+ (@Eq Nat (UniversalLaw.Side24.sixA (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 25) (instOfNatNat (nat_lit 25))))
+ (@Eq Nat (UniversalLaw.Side24.sixB (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 27) (instOfNatNat (nat_lit 27))))))
+UniversalLaw.Side24.ratio_constant_ordering :
+ And
+ (@LE.le Nat instLENat (@OfNat.ofNat Nat (nat_lit 13) (instOfNatNat (nat_lit 13)))
+ (@OfNat.ofNat Nat (nat_lit 32) (instOfNatNat (nat_lit 32))))
+ (@LE.le Nat instLENat (@OfNat.ofNat Nat (nat_lit 28) (instOfNatNat (nat_lit 28)))
+ (@OfNat.ofNat Nat (nat_lit 32) (instOfNatNat (nat_lit 32))))
+UniversalLaw.Side24.density_comparison_below_reported :
+ @LT.lt Nat instLTNat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 32) (instOfNatNat (nat_lit 32)))
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10)))
+ (@OfNat.ofNat Nat (nat_lit 106) (instOfNatNat (nat_lit 106)))))
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10)))
+ (@OfNat.ofNat Nat (nat_lit 108) (instOfNatNat (nat_lit 108))))
+UniversalLaw.Side24.conditional_third_derivative_variance :
+ @Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub) (@OfNat.ofNat Int (nat_lit 15) (@instOfNat (nat_lit 15)))
+ (@HDiv.hDiv Int Int Int (@instHDiv Int Int.instDiv)
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul)
+ (@Neg.neg Int Int.instNegInt (@OfNat.ofNat Int (nat_lit 3) (@instOfNat (nat_lit 3))))
+ (@Neg.neg Int Int.instNegInt (@OfNat.ofNat Int (nat_lit 3) (@instOfNat (nat_lit 3)))))
+ (@OfNat.ofNat Int (nat_lit 1) (@instOfNat (nat_lit 1)))))
+ (@OfNat.ofNat Int (nat_lit 6) (@instOfNat (nat_lit 6)))
+UniversalLaw.Side24.transverse_covariance_entries_thirds :
+ And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8))))
+ (And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))))
+ (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+UniversalLaw.Side24.cone_moment_m1_thirds :
+ @Eq Nat (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8)))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4))))
+UniversalLaw.Side24.trace_and_traceless_variances :
+ And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8)))
+ (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+ (@OfNat.ofNat Nat (nat_lit 20) (instOfNatNat (nat_lit 20))))
+ (And
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 20) (instOfNatNat (nat_lit 20)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5)))
+ (@OfNat.ofNat Nat (nat_lit 12) (instOfNatNat (nat_lit 12)))))
+ (And
+ (@Eq Nat
+ (@HSub.hSub Nat Nat Nat (@instHSub Nat instSubNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8)))
+ (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+ (@OfNat.ofNat Nat (nat_lit 12) (instOfNatNat (nat_lit 12))))
+ (And
+ (@Eq Nat (@OfNat.ofNat Nat (nat_lit 12) (instOfNatNat (nat_lit 12)))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))
+ (@OfNat.ofNat Nat (nat_lit 12) (instOfNatNat (nat_lit 12)))))
+ (@Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub) (@OfNat.ofNat Int (nat_lit 8) (@instOfNat (nat_lit 8)))
+ (@OfNat.ofNat Int (nat_lit 8) (@instOfNat (nat_lit 8))))
+ (@OfNat.ofNat Int (nat_lit 0) (@instOfNat (nat_lit 0)))))))
+UniversalLaw.Side24.fourth_moment_of_trace :
+ @Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 25) (instOfNatNat (nat_lit 25)))
+ (@OfNat.ofNat Nat (nat_lit 9) (instOfNatNat (nat_lit 9))))
+UniversalLaw.Side24.exponential_moment_of_trace :
+ @Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5))))
+ (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8)))
+UniversalLaw.Side24.cone_moment_m2_algebra :
+ And
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4)))
+ (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5))))
+ (@OfNat.ofNat Nat (nat_lit 20) (instOfNatNat (nat_lit 20))))
+ (And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HSub.hSub Nat Nat Nat (@instHSub Nat instSubNat) (@OfNat.ofNat Nat (nat_lit 25) (instOfNatNat (nat_lit 25)))
+ (@OfNat.ofNat Nat (nat_lit 20) (instOfNatNat (nat_lit 20))))
+ (@OfNat.ofNat Nat (nat_lit 24) (instOfNatNat (nat_lit 24))))
+ (@OfNat.ofNat Nat (nat_lit 29) (instOfNatNat (nat_lit 29))))
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6)))
+ (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8))))))
+UniversalLaw.Side24.cube_root_simplification :
+ @Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 24) (instOfNatNat (nat_lit 24))))
+UniversalLaw.Side24.pin_determinant_and_joint_dimension :
+ And
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+ (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4))))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+ (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10)))))
+UniversalLaw.Side24.hessian_block_eigenvalues :
+ And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4))))
+ (And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5))))
+ (@LT.lt Nat instLTNat (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))))
+UniversalLaw.Side24.d2_endpoints_adjacent :
+ And (@LT.lt Nat instLTNat UniversalLaw.Side24.d2Lower UniversalLaw.Side24.d2Upper)
+ (@Eq Nat UniversalLaw.Side24.d2Upper
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) UniversalLaw.Side24.d2Lower
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
+UniversalLaw.Side24.d3_endpoints_adjacent :
+ And (@LT.lt Nat instLTNat UniversalLaw.Side24.d3Lower UniversalLaw.Side24.d3Upper)
+ (@Eq Nat UniversalLaw.Side24.d3Upper
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) UniversalLaw.Side24.d3Lower
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
+UniversalLaw.Side24.d3_below_d2 : @LT.lt Nat instLTNat UniversalLaw.Side24.d3Upper UniversalLaw.Side24.d2Lower
+UniversalLaw.Side24.endpoints_in_unit_tenth :
+ And (@LT.lt Nat instLTNat (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))) UniversalLaw.Side24.d3Lower)
+ (@LT.lt Nat instLTNat UniversalLaw.Side24.d2Upper
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10)))
+ (@OfNat.ofNat Nat (nat_lit 19) (instOfNatNat (nat_lit 19)))))
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_covariance_bound.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_covariance_bound.lean
new file mode 100644
index 000000000..c4941c3c1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_covariance_bound.lean
@@ -0,0 +1,142 @@
+/-!
+# SIDE24 coefficient note — analytic-image ledger, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+sections 2–4, and the `image_ledger()` function of `coefficient.py`.
+
+What this module establishes: every *exact integer or rational* identity and
+inequality that sections 2–4 of the note rely on is checked by the Lean kernel.
+No `sorry`, no `native_decide`, no axioms (the `--run-lean` receipt records the
+transitive `#print axioms` result for every target).
+
+What this module does **not** establish: the analytic facts the arithmetic is
+attached to — the Gaussian derivative bound `76|x|^6 e^{-|x|^2/2}` for `|x| ≥ 1`,
+the geometric-tail argument, the positive-semidefinite covariance comparison,
+the Schur-complement monotonicity, the Gaussian density comparison, and the
+`log`/`exp` estimates that turn exponents into the factor `32ε`. Those remain
+author-side prose under nonauthor review (Layer 0). Nothing here changes the
+scientific status of the coefficient or of its parent theorem.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Factorial on `Nat`; kept local so that the library has no dependencies. -/
+def fact : Nat → Nat
+ | 0 => 1
+ | n + 1 => (n + 1) * fact n
+
+/-- Product-rule pairing count for `q` unit directional derivatives of
+`exp(-|x|^2/2)`: `∑_{j=0}^{⌊q/2⌋} q! / (2^j j! (q-2j)!)`. Section 2 of the note
+uses its value at `q = 6` and the fact that it dominates the lower orders. -/
+def pairingSum (q : Nat) : Nat :=
+ (List.range (q / 2 + 1)).foldl
+ (fun acc j => acc + fact q / (2 ^ j * fact j * fact (q - 2 * j))) 0
+
+/-- Source: "The coefficient sum for q=6 is 1+15+45+15=76". -/
+theorem pairing_sum_six : pairingSum 6 = 76 := by decide
+
+/-- Source: "and it bounds the smaller orders as well". -/
+theorem pairing_sum_le_six : ∀ q, q ∈ [0, 1, 2, 3, 4, 5, 6] → pairingSum q ≤ 76 := by
+ decide
+
+/-- The individual pairing terms at `q = 6`, as displayed in the note. -/
+theorem pairing_terms_six :
+ fact 6 / (2 ^ 0 * fact 0 * fact 6) = 1 ∧
+ fact 6 / (2 ^ 1 * fact 1 * fact 4) = 15 ∧
+ fact 6 / (2 ^ 2 * fact 2 * fact 2) = 45 ∧
+ fact 6 / (2 ^ 3 * fact 3 * fact 0) = 15 := by
+ decide
+
+/-- Source: "At zero, every such contraction has absolute value at most 15".
+The sixth Gaussian moment / sixth derivative of `exp(-x^2/2)` at zero is the
+double factorial `5!! = 1·3·5`. Only the arithmetic value is checked here. -/
+theorem sixth_moment_double_factorial : 1 * 3 * 5 = 15 := by decide
+
+/-- Source: "there are at most 27j^3 possibilities for d<=3, |n|^6<=27j^6" and
+"<=729 sum_{j>=1} j^9 e^(-288j^2) <=1458 e^(-288)". The two factors of 27 give
+729; the geometric tail with ratio at most 1/2 gives the factor 2. -/
+theorem lattice_shell_constant : 27 * 27 = 729 ∧ 729 * 2 = 1458 := by decide
+
+/-- Source: "successive terms have ratio at most 512e^(-864)". `512 = 2^9` is
+the worst ratio `(j+1)^9 / j^9` at `j = 1`; `864 = 288·3` is the exponent gap
+`288((j+1)^2 - j^2)` at `j = 1`. -/
+theorem geometric_ratio_constants : 2 ^ 9 = 512 ∧ 288 * 3 = 864 := by decide
+
+/-- `24^2 / 2 = 288`: the periodization exponent for lattice period 24. -/
+theorem period_exponent : 24 ^ 2 / 2 = 288 := by decide
+
+/-- The image constant `E · 10^125` of display (2):
+`1458 · (76 · 24^6 + 15)`. -/
+def imageConstant : Nat := 1458 * (76 * 24 ^ 6 + 15)
+
+/-- Source: "E := 1458*(76*24^6+15)*10^(-125) = 21175738586478 *10^(-125)". -/
+theorem image_constant_value : imageConstant = 21175738586478 := by decide
+
+/-- Numerator of the degree-20 Taylor partial sum of `exp(288/125)` after
+clearing the denominator `125^20 · 20!`:
+`∑_{k=0}^{20} 288^k · 125^(20-k) · 20!/k!`. -/
+def expTaylorNumerator : Nat :=
+ (List.range 21).foldl
+ (fun acc k => acc + 288 ^ k * 125 ^ (20 - k) * (fact 20 / fact k)) 0
+
+/-- Source: "The code proves e^(288/125)>10 using the positive rational Taylor
+sum through20". Because every Taylor term of `exp` at a positive argument is
+positive, the partial sum is a lower bound; this theorem checks that the exact
+rational partial sum exceeds 10. The step from the partial sum to `exp` itself
+is analysis and is not formalised here. -/
+theorem exp_taylor_partial_sum_gt_ten :
+ 10 * (125 ^ 20 * fact 20) < expTaylorNumerator := by decide
+
+/-- Source: "Each covariance entry differs from the reference by at most2E ...
+the spectral norm of the difference is at most20E" (dimension at most 10) and
+"C_ref >= I/3 ... epsilon=10^(-108), since60E 1/3 ⇔ 23/3 > √58 ⇔ 23^2 > 58·9`. -/
+theorem smaller_eigenvalue_exceeds_third : 58 * 9 < 23 ^ 2 := by decide
+
+/-- Source (section 4): with `m = d-1`, `n = m(m+1)/2`, `a = m + 2/3 + n/2`,
+`b = d + n/2`. These are `6a` and `6b` as natural numbers. -/
+def sixA (d : Nat) : Nat := 6 * (d - 1) + 4 + 3 * ((d - 1) * d / 2)
+def sixB (d : Nat) : Nat := 6 * d + 3 * ((d - 1) * d / 2)
+
+/-- Source: "For d=2,3, a+2b<14 and2a+b<13". In sixths: `6a + 12b < 84` and
+`12a + 6b < 78`. For `d = 3` the second inequality is `77 < 78`, so this is a
+genuinely tight check. -/
+theorem exponent_bounds :
+ ∀ d, d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 78 := by
+ decide
+
+/-- The exact values behind `exponent_bounds`: `d = 2` gives `a = 13/6`, `b = 5/2`;
+`d = 3` gives `a = 25/6`, `b = 9/2`. -/
+theorem exponent_values :
+ sixA 2 = 13 ∧ sixB 2 = 15 ∧ sixA 3 = 25 ∧ sixB 3 = 27 := by decide
+
+/-- Source: "ratio between1-13epsilon and1+28epsilon, hence safely between
+1-32epsilon and1+32epsilon". The analytic `log`/`exp` estimates are not
+formalised; the ordering of the constants is. -/
+theorem ratio_constant_ordering : 13 ≤ 32 ∧ 28 ≤ 32 := by decide
+
+/-- Source: "|c_d,24/c_d,ref -1| < 10^(-106)" together with `ε = 10^(-108)`
+and the factor 32 from section 4: `32 · 10^(-108) < 10^(-106)`. -/
+theorem density_comparison_below_reported : 32 * 10 ^ 106 < 10 ^ 108 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_covariance_bound.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_covariance_bound.log
new file mode 100644
index 000000000..4e58b81dc
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_covariance_bound.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/false_covariance_bound.lean:97:57: error: Tactic `decide` proved that the proposition
+ 2 * 10 * 3 = 60 ∧ 60 * imageConstant < 10 ^ 15
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_eigenvalue_third.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_eigenvalue_third.lean
new file mode 100644
index 000000000..34c7727b4
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_eigenvalue_third.lean
@@ -0,0 +1,142 @@
+/-!
+# SIDE24 coefficient note — analytic-image ledger, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+sections 2–4, and the `image_ledger()` function of `coefficient.py`.
+
+What this module establishes: every *exact integer or rational* identity and
+inequality that sections 2–4 of the note rely on is checked by the Lean kernel.
+No `sorry`, no `native_decide`, no axioms (the `--run-lean` receipt records the
+transitive `#print axioms` result for every target).
+
+What this module does **not** establish: the analytic facts the arithmetic is
+attached to — the Gaussian derivative bound `76|x|^6 e^{-|x|^2/2}` for `|x| ≥ 1`,
+the geometric-tail argument, the positive-semidefinite covariance comparison,
+the Schur-complement monotonicity, the Gaussian density comparison, and the
+`log`/`exp` estimates that turn exponents into the factor `32ε`. Those remain
+author-side prose under nonauthor review (Layer 0). Nothing here changes the
+scientific status of the coefficient or of its parent theorem.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Factorial on `Nat`; kept local so that the library has no dependencies. -/
+def fact : Nat → Nat
+ | 0 => 1
+ | n + 1 => (n + 1) * fact n
+
+/-- Product-rule pairing count for `q` unit directional derivatives of
+`exp(-|x|^2/2)`: `∑_{j=0}^{⌊q/2⌋} q! / (2^j j! (q-2j)!)`. Section 2 of the note
+uses its value at `q = 6` and the fact that it dominates the lower orders. -/
+def pairingSum (q : Nat) : Nat :=
+ (List.range (q / 2 + 1)).foldl
+ (fun acc j => acc + fact q / (2 ^ j * fact j * fact (q - 2 * j))) 0
+
+/-- Source: "The coefficient sum for q=6 is 1+15+45+15=76". -/
+theorem pairing_sum_six : pairingSum 6 = 76 := by decide
+
+/-- Source: "and it bounds the smaller orders as well". -/
+theorem pairing_sum_le_six : ∀ q, q ∈ [0, 1, 2, 3, 4, 5, 6] → pairingSum q ≤ 76 := by
+ decide
+
+/-- The individual pairing terms at `q = 6`, as displayed in the note. -/
+theorem pairing_terms_six :
+ fact 6 / (2 ^ 0 * fact 0 * fact 6) = 1 ∧
+ fact 6 / (2 ^ 1 * fact 1 * fact 4) = 15 ∧
+ fact 6 / (2 ^ 2 * fact 2 * fact 2) = 45 ∧
+ fact 6 / (2 ^ 3 * fact 3 * fact 0) = 15 := by
+ decide
+
+/-- Source: "At zero, every such contraction has absolute value at most 15".
+The sixth Gaussian moment / sixth derivative of `exp(-x^2/2)` at zero is the
+double factorial `5!! = 1·3·5`. Only the arithmetic value is checked here. -/
+theorem sixth_moment_double_factorial : 1 * 3 * 5 = 15 := by decide
+
+/-- Source: "there are at most 27j^3 possibilities for d<=3, |n|^6<=27j^6" and
+"<=729 sum_{j>=1} j^9 e^(-288j^2) <=1458 e^(-288)". The two factors of 27 give
+729; the geometric tail with ratio at most 1/2 gives the factor 2. -/
+theorem lattice_shell_constant : 27 * 27 = 729 ∧ 729 * 2 = 1458 := by decide
+
+/-- Source: "successive terms have ratio at most 512e^(-864)". `512 = 2^9` is
+the worst ratio `(j+1)^9 / j^9` at `j = 1`; `864 = 288·3` is the exponent gap
+`288((j+1)^2 - j^2)` at `j = 1`. -/
+theorem geometric_ratio_constants : 2 ^ 9 = 512 ∧ 288 * 3 = 864 := by decide
+
+/-- `24^2 / 2 = 288`: the periodization exponent for lattice period 24. -/
+theorem period_exponent : 24 ^ 2 / 2 = 288 := by decide
+
+/-- The image constant `E · 10^125` of display (2):
+`1458 · (76 · 24^6 + 15)`. -/
+def imageConstant : Nat := 1458 * (76 * 24 ^ 6 + 15)
+
+/-- Source: "E := 1458*(76*24^6+15)*10^(-125) = 21175738586478 *10^(-125)". -/
+theorem image_constant_value : imageConstant = 21175738586478 := by decide
+
+/-- Numerator of the degree-20 Taylor partial sum of `exp(288/125)` after
+clearing the denominator `125^20 · 20!`:
+`∑_{k=0}^{20} 288^k · 125^(20-k) · 20!/k!`. -/
+def expTaylorNumerator : Nat :=
+ (List.range 21).foldl
+ (fun acc k => acc + 288 ^ k * 125 ^ (20 - k) * (fact 20 / fact k)) 0
+
+/-- Source: "The code proves e^(288/125)>10 using the positive rational Taylor
+sum through20". Because every Taylor term of `exp` at a positive argument is
+positive, the partial sum is a lower bound; this theorem checks that the exact
+rational partial sum exceeds 10. The step from the partial sum to `exp` itself
+is analysis and is not formalised here. -/
+theorem exp_taylor_partial_sum_gt_ten :
+ 10 * (125 ^ 20 * fact 20) < expTaylorNumerator := by decide
+
+/-- Source: "Each covariance entry differs from the reference by at most2E ...
+the spectral norm of the difference is at most20E" (dimension at most 10) and
+"C_ref >= I/3 ... epsilon=10^(-108), since60E 1/3 ⇔ 23/3 > √58 ⇔ 23^2 > 58·9`. -/
+theorem smaller_eigenvalue_exceeds_third : 58 * 9 < 22 ^ 2 := by decide
+
+/-- Source (section 4): with `m = d-1`, `n = m(m+1)/2`, `a = m + 2/3 + n/2`,
+`b = d + n/2`. These are `6a` and `6b` as natural numbers. -/
+def sixA (d : Nat) : Nat := 6 * (d - 1) + 4 + 3 * ((d - 1) * d / 2)
+def sixB (d : Nat) : Nat := 6 * d + 3 * ((d - 1) * d / 2)
+
+/-- Source: "For d=2,3, a+2b<14 and2a+b<13". In sixths: `6a + 12b < 84` and
+`12a + 6b < 78`. For `d = 3` the second inequality is `77 < 78`, so this is a
+genuinely tight check. -/
+theorem exponent_bounds :
+ ∀ d, d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 78 := by
+ decide
+
+/-- The exact values behind `exponent_bounds`: `d = 2` gives `a = 13/6`, `b = 5/2`;
+`d = 3` gives `a = 25/6`, `b = 9/2`. -/
+theorem exponent_values :
+ sixA 2 = 13 ∧ sixB 2 = 15 ∧ sixA 3 = 25 ∧ sixB 3 = 27 := by decide
+
+/-- Source: "ratio between1-13epsilon and1+28epsilon, hence safely between
+1-32epsilon and1+32epsilon". The analytic `log`/`exp` estimates are not
+formalised; the ordering of the constants is. -/
+theorem ratio_constant_ordering : 13 ≤ 32 ∧ 28 ≤ 32 := by decide
+
+/-- Source: "|c_d,24/c_d,ref -1| < 10^(-106)" together with `ε = 10^(-108)`
+and the factor 32 from section 4: `32 · 10^(-108) < 10^(-106)`. -/
+theorem density_comparison_below_reported : 32 * 10 ^ 106 < 10 ^ 108 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_eigenvalue_third.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_eigenvalue_third.log
new file mode 100644
index 000000000..6d314fe0f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_eigenvalue_third.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/false_eigenvalue_third.lean:114:65: error: Tactic `decide` proved that the proposition
+ 58 * 9 < 22 ^ 2
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_endpoint_adjacency.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_endpoint_adjacency.lean
new file mode 100644
index 000000000..53568c6e9
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_endpoint_adjacency.lean
@@ -0,0 +1,42 @@
+/-!
+# SIDE24 published endpoints — consistency of the frozen artifact
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/ENCLOSURE.json`,
+1090 bytes, SHA-256 `72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811`.
+
+The published decimal endpoints are transcribed here as integers in units of
+`10^-20`. The kernel checks that each interval is nonempty and exactly one
+`10^-20` step wide, and that the two intervals are disjoint and ordered.
+
+This module does **not** establish that the coefficient lies in either
+interval: that claim needs `Real.Gamma`, `Real.pi`, `Real.exp` and the
+Gaussian cone moments, none of which exist in core Lean. That boundary is
+recorded target by target in `formal/SCOPE.md`; the enclosure itself is not a
+target of this package.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- `0.07340691930603427103` and `0.07340691930603427104` in units of `10^-20`. -/
+def d2Lower : Nat := 7340691930603427103
+def d2Upper : Nat := 7340691930603427104
+
+/-- `0.04177593184059834334` and `0.04177593184059834335` in units of `10^-20`. -/
+def d3Lower : Nat := 4177593184059834334
+def d3Upper : Nat := 4177593184059834335
+
+/-- Source: "0.07340691930603427103 < c_2,24 < 0.07340691930603427104" — the
+published endpoints are distinct and adjacent on the 20-digit grid. -/
+theorem d2_endpoints_adjacent : d2Lower < d2Upper ∧ d2Upper = d2Lower + 2 := by decide
+
+/-- Source: "0.04177593184059834334 < c_3,24 < 0.04177593184059834335". -/
+theorem d3_endpoints_adjacent : d3Lower < d3Upper ∧ d3Upper = d3Lower + 1 := by decide
+
+/-- The published `d = 3` interval lies strictly below the `d = 2` interval. -/
+theorem d3_below_d2 : d3Upper < d2Lower := by decide
+
+/-- Both published intervals lie in `(0, 1/10)`: `10^-20`-units below `10^19`. -/
+theorem endpoints_in_unit_tenth : 0 < d3Lower ∧ d2Upper < 10 ^ 19 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_endpoint_adjacency.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_endpoint_adjacency.log
new file mode 100644
index 000000000..573733867
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_endpoint_adjacency.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/false_endpoint_adjacency.lean:31:80: error: Tactic `decide` proved that the proposition
+ d2Lower < d2Upper ∧ d2Upper = d2Lower + 2
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exp_partial_sum.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exp_partial_sum.lean
new file mode 100644
index 000000000..1e10c9733
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exp_partial_sum.lean
@@ -0,0 +1,142 @@
+/-!
+# SIDE24 coefficient note — analytic-image ledger, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+sections 2–4, and the `image_ledger()` function of `coefficient.py`.
+
+What this module establishes: every *exact integer or rational* identity and
+inequality that sections 2–4 of the note rely on is checked by the Lean kernel.
+No `sorry`, no `native_decide`, no axioms (the `--run-lean` receipt records the
+transitive `#print axioms` result for every target).
+
+What this module does **not** establish: the analytic facts the arithmetic is
+attached to — the Gaussian derivative bound `76|x|^6 e^{-|x|^2/2}` for `|x| ≥ 1`,
+the geometric-tail argument, the positive-semidefinite covariance comparison,
+the Schur-complement monotonicity, the Gaussian density comparison, and the
+`log`/`exp` estimates that turn exponents into the factor `32ε`. Those remain
+author-side prose under nonauthor review (Layer 0). Nothing here changes the
+scientific status of the coefficient or of its parent theorem.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Factorial on `Nat`; kept local so that the library has no dependencies. -/
+def fact : Nat → Nat
+ | 0 => 1
+ | n + 1 => (n + 1) * fact n
+
+/-- Product-rule pairing count for `q` unit directional derivatives of
+`exp(-|x|^2/2)`: `∑_{j=0}^{⌊q/2⌋} q! / (2^j j! (q-2j)!)`. Section 2 of the note
+uses its value at `q = 6` and the fact that it dominates the lower orders. -/
+def pairingSum (q : Nat) : Nat :=
+ (List.range (q / 2 + 1)).foldl
+ (fun acc j => acc + fact q / (2 ^ j * fact j * fact (q - 2 * j))) 0
+
+/-- Source: "The coefficient sum for q=6 is 1+15+45+15=76". -/
+theorem pairing_sum_six : pairingSum 6 = 76 := by decide
+
+/-- Source: "and it bounds the smaller orders as well". -/
+theorem pairing_sum_le_six : ∀ q, q ∈ [0, 1, 2, 3, 4, 5, 6] → pairingSum q ≤ 76 := by
+ decide
+
+/-- The individual pairing terms at `q = 6`, as displayed in the note. -/
+theorem pairing_terms_six :
+ fact 6 / (2 ^ 0 * fact 0 * fact 6) = 1 ∧
+ fact 6 / (2 ^ 1 * fact 1 * fact 4) = 15 ∧
+ fact 6 / (2 ^ 2 * fact 2 * fact 2) = 45 ∧
+ fact 6 / (2 ^ 3 * fact 3 * fact 0) = 15 := by
+ decide
+
+/-- Source: "At zero, every such contraction has absolute value at most 15".
+The sixth Gaussian moment / sixth derivative of `exp(-x^2/2)` at zero is the
+double factorial `5!! = 1·3·5`. Only the arithmetic value is checked here. -/
+theorem sixth_moment_double_factorial : 1 * 3 * 5 = 15 := by decide
+
+/-- Source: "there are at most 27j^3 possibilities for d<=3, |n|^6<=27j^6" and
+"<=729 sum_{j>=1} j^9 e^(-288j^2) <=1458 e^(-288)". The two factors of 27 give
+729; the geometric tail with ratio at most 1/2 gives the factor 2. -/
+theorem lattice_shell_constant : 27 * 27 = 729 ∧ 729 * 2 = 1458 := by decide
+
+/-- Source: "successive terms have ratio at most 512e^(-864)". `512 = 2^9` is
+the worst ratio `(j+1)^9 / j^9` at `j = 1`; `864 = 288·3` is the exponent gap
+`288((j+1)^2 - j^2)` at `j = 1`. -/
+theorem geometric_ratio_constants : 2 ^ 9 = 512 ∧ 288 * 3 = 864 := by decide
+
+/-- `24^2 / 2 = 288`: the periodization exponent for lattice period 24. -/
+theorem period_exponent : 24 ^ 2 / 2 = 288 := by decide
+
+/-- The image constant `E · 10^125` of display (2):
+`1458 · (76 · 24^6 + 15)`. -/
+def imageConstant : Nat := 1458 * (76 * 24 ^ 6 + 15)
+
+/-- Source: "E := 1458*(76*24^6+15)*10^(-125) = 21175738586478 *10^(-125)". -/
+theorem image_constant_value : imageConstant = 21175738586478 := by decide
+
+/-- Numerator of the degree-20 Taylor partial sum of `exp(288/125)` after
+clearing the denominator `125^20 · 20!`:
+`∑_{k=0}^{20} 288^k · 125^(20-k) · 20!/k!`. -/
+def expTaylorNumerator : Nat :=
+ (List.range 21).foldl
+ (fun acc k => acc + 288 ^ k * 125 ^ (20 - k) * (fact 20 / fact k)) 0
+
+/-- Source: "The code proves e^(288/125)>10 using the positive rational Taylor
+sum through20". Because every Taylor term of `exp` at a positive argument is
+positive, the partial sum is a lower bound; this theorem checks that the exact
+rational partial sum exceeds 10. The step from the partial sum to `exp` itself
+is analysis and is not formalised here. -/
+theorem exp_taylor_partial_sum_gt_ten :
+ 11 * (125 ^ 20 * fact 20) < expTaylorNumerator := by decide
+
+/-- Source: "Each covariance entry differs from the reference by at most2E ...
+the spectral norm of the difference is at most20E" (dimension at most 10) and
+"C_ref >= I/3 ... epsilon=10^(-108), since60E 1/3 ⇔ 23/3 > √58 ⇔ 23^2 > 58·9`. -/
+theorem smaller_eigenvalue_exceeds_third : 58 * 9 < 23 ^ 2 := by decide
+
+/-- Source (section 4): with `m = d-1`, `n = m(m+1)/2`, `a = m + 2/3 + n/2`,
+`b = d + n/2`. These are `6a` and `6b` as natural numbers. -/
+def sixA (d : Nat) : Nat := 6 * (d - 1) + 4 + 3 * ((d - 1) * d / 2)
+def sixB (d : Nat) : Nat := 6 * d + 3 * ((d - 1) * d / 2)
+
+/-- Source: "For d=2,3, a+2b<14 and2a+b<13". In sixths: `6a + 12b < 84` and
+`12a + 6b < 78`. For `d = 3` the second inequality is `77 < 78`, so this is a
+genuinely tight check. -/
+theorem exponent_bounds :
+ ∀ d, d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 78 := by
+ decide
+
+/-- The exact values behind `exponent_bounds`: `d = 2` gives `a = 13/6`, `b = 5/2`;
+`d = 3` gives `a = 25/6`, `b = 9/2`. -/
+theorem exponent_values :
+ sixA 2 = 13 ∧ sixB 2 = 15 ∧ sixA 3 = 25 ∧ sixB 3 = 27 := by decide
+
+/-- Source: "ratio between1-13epsilon and1+28epsilon, hence safely between
+1-32epsilon and1+32epsilon". The analytic `log`/`exp` estimates are not
+formalised; the ordering of the constants is. -/
+theorem ratio_constant_ordering : 13 ≤ 32 ∧ 28 ≤ 32 := by decide
+
+/-- Source: "|c_d,24/c_d,ref -1| < 10^(-106)" together with `ε = 10^(-108)`
+and the factor 32 from section 4: `32 · 10^(-108) < 10^(-106)`. -/
+theorem density_comparison_below_reported : 32 * 10 ^ 106 < 10 ^ 108 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exp_partial_sum.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exp_partial_sum.log
new file mode 100644
index 000000000..b8640ddd1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exp_partial_sum.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/false_exp_partial_sum.lean:90:57: error: Tactic `decide` proved that the proposition
+ 11 * (125 ^ 20 * fact 20) < expTaylorNumerator
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exponent_bound_d3.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exponent_bound_d3.lean
new file mode 100644
index 000000000..7153c6709
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exponent_bound_d3.lean
@@ -0,0 +1,142 @@
+/-!
+# SIDE24 coefficient note — analytic-image ledger, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+sections 2–4, and the `image_ledger()` function of `coefficient.py`.
+
+What this module establishes: every *exact integer or rational* identity and
+inequality that sections 2–4 of the note rely on is checked by the Lean kernel.
+No `sorry`, no `native_decide`, no axioms (the `--run-lean` receipt records the
+transitive `#print axioms` result for every target).
+
+What this module does **not** establish: the analytic facts the arithmetic is
+attached to — the Gaussian derivative bound `76|x|^6 e^{-|x|^2/2}` for `|x| ≥ 1`,
+the geometric-tail argument, the positive-semidefinite covariance comparison,
+the Schur-complement monotonicity, the Gaussian density comparison, and the
+`log`/`exp` estimates that turn exponents into the factor `32ε`. Those remain
+author-side prose under nonauthor review (Layer 0). Nothing here changes the
+scientific status of the coefficient or of its parent theorem.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Factorial on `Nat`; kept local so that the library has no dependencies. -/
+def fact : Nat → Nat
+ | 0 => 1
+ | n + 1 => (n + 1) * fact n
+
+/-- Product-rule pairing count for `q` unit directional derivatives of
+`exp(-|x|^2/2)`: `∑_{j=0}^{⌊q/2⌋} q! / (2^j j! (q-2j)!)`. Section 2 of the note
+uses its value at `q = 6` and the fact that it dominates the lower orders. -/
+def pairingSum (q : Nat) : Nat :=
+ (List.range (q / 2 + 1)).foldl
+ (fun acc j => acc + fact q / (2 ^ j * fact j * fact (q - 2 * j))) 0
+
+/-- Source: "The coefficient sum for q=6 is 1+15+45+15=76". -/
+theorem pairing_sum_six : pairingSum 6 = 76 := by decide
+
+/-- Source: "and it bounds the smaller orders as well". -/
+theorem pairing_sum_le_six : ∀ q, q ∈ [0, 1, 2, 3, 4, 5, 6] → pairingSum q ≤ 76 := by
+ decide
+
+/-- The individual pairing terms at `q = 6`, as displayed in the note. -/
+theorem pairing_terms_six :
+ fact 6 / (2 ^ 0 * fact 0 * fact 6) = 1 ∧
+ fact 6 / (2 ^ 1 * fact 1 * fact 4) = 15 ∧
+ fact 6 / (2 ^ 2 * fact 2 * fact 2) = 45 ∧
+ fact 6 / (2 ^ 3 * fact 3 * fact 0) = 15 := by
+ decide
+
+/-- Source: "At zero, every such contraction has absolute value at most 15".
+The sixth Gaussian moment / sixth derivative of `exp(-x^2/2)` at zero is the
+double factorial `5!! = 1·3·5`. Only the arithmetic value is checked here. -/
+theorem sixth_moment_double_factorial : 1 * 3 * 5 = 15 := by decide
+
+/-- Source: "there are at most 27j^3 possibilities for d<=3, |n|^6<=27j^6" and
+"<=729 sum_{j>=1} j^9 e^(-288j^2) <=1458 e^(-288)". The two factors of 27 give
+729; the geometric tail with ratio at most 1/2 gives the factor 2. -/
+theorem lattice_shell_constant : 27 * 27 = 729 ∧ 729 * 2 = 1458 := by decide
+
+/-- Source: "successive terms have ratio at most 512e^(-864)". `512 = 2^9` is
+the worst ratio `(j+1)^9 / j^9` at `j = 1`; `864 = 288·3` is the exponent gap
+`288((j+1)^2 - j^2)` at `j = 1`. -/
+theorem geometric_ratio_constants : 2 ^ 9 = 512 ∧ 288 * 3 = 864 := by decide
+
+/-- `24^2 / 2 = 288`: the periodization exponent for lattice period 24. -/
+theorem period_exponent : 24 ^ 2 / 2 = 288 := by decide
+
+/-- The image constant `E · 10^125` of display (2):
+`1458 · (76 · 24^6 + 15)`. -/
+def imageConstant : Nat := 1458 * (76 * 24 ^ 6 + 15)
+
+/-- Source: "E := 1458*(76*24^6+15)*10^(-125) = 21175738586478 *10^(-125)". -/
+theorem image_constant_value : imageConstant = 21175738586478 := by decide
+
+/-- Numerator of the degree-20 Taylor partial sum of `exp(288/125)` after
+clearing the denominator `125^20 · 20!`:
+`∑_{k=0}^{20} 288^k · 125^(20-k) · 20!/k!`. -/
+def expTaylorNumerator : Nat :=
+ (List.range 21).foldl
+ (fun acc k => acc + 288 ^ k * 125 ^ (20 - k) * (fact 20 / fact k)) 0
+
+/-- Source: "The code proves e^(288/125)>10 using the positive rational Taylor
+sum through20". Because every Taylor term of `exp` at a positive argument is
+positive, the partial sum is a lower bound; this theorem checks that the exact
+rational partial sum exceeds 10. The step from the partial sum to `exp` itself
+is analysis and is not formalised here. -/
+theorem exp_taylor_partial_sum_gt_ten :
+ 10 * (125 ^ 20 * fact 20) < expTaylorNumerator := by decide
+
+/-- Source: "Each covariance entry differs from the reference by at most2E ...
+the spectral norm of the difference is at most20E" (dimension at most 10) and
+"C_ref >= I/3 ... epsilon=10^(-108), since60E 1/3 ⇔ 23/3 > √58 ⇔ 23^2 > 58·9`. -/
+theorem smaller_eigenvalue_exceeds_third : 58 * 9 < 23 ^ 2 := by decide
+
+/-- Source (section 4): with `m = d-1`, `n = m(m+1)/2`, `a = m + 2/3 + n/2`,
+`b = d + n/2`. These are `6a` and `6b` as natural numbers. -/
+def sixA (d : Nat) : Nat := 6 * (d - 1) + 4 + 3 * ((d - 1) * d / 2)
+def sixB (d : Nat) : Nat := 6 * d + 3 * ((d - 1) * d / 2)
+
+/-- Source: "For d=2,3, a+2b<14 and2a+b<13". In sixths: `6a + 12b < 84` and
+`12a + 6b < 78`. For `d = 3` the second inequality is `77 < 78`, so this is a
+genuinely tight check. -/
+theorem exponent_bounds :
+ ∀ d, d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 77 := by
+ decide
+
+/-- The exact values behind `exponent_bounds`: `d = 2` gives `a = 13/6`, `b = 5/2`;
+`d = 3` gives `a = 25/6`, `b = 9/2`. -/
+theorem exponent_values :
+ sixA 2 = 13 ∧ sixB 2 = 15 ∧ sixA 3 = 25 ∧ sixB 3 = 27 := by decide
+
+/-- Source: "ratio between1-13epsilon and1+28epsilon, hence safely between
+1-32epsilon and1+32epsilon". The analytic `log`/`exp` estimates are not
+formalised; the ordering of the constants is. -/
+theorem ratio_constant_ordering : 13 ≤ 32 ∧ 28 ≤ 32 := by decide
+
+/-- Source: "|c_d,24/c_d,ref -1| < 10^(-106)" together with `ε = 10^(-108)`
+and the factor 32 from section 4: `32 · 10^(-108) < 10^(-106)`. -/
+theorem density_comparison_below_reported : 32 * 10 ^ 106 < 10 ^ 108 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exponent_bound_d3.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exponent_bound_d3.log
new file mode 100644
index 000000000..4dc63ed37
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exponent_bound_d3.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/false_exponent_bound_d3.lean:126:2: error: Tactic `decide` proved that the proposition
+ ∀ (d : Nat), d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 77
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_trace_variance.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_trace_variance.lean
new file mode 100644
index 000000000..1f9120725
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_trace_variance.lean
@@ -0,0 +1,85 @@
+/-!
+# SIDE24 coefficient note — reference covariance and cone moments, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+section 1.
+
+Core Lean has no rational-number type, so every rational identity is stated
+as the equivalent cross-multiplied integer identity, with the rational form in
+the docstring. The kernel checks the integers; a reviewer checks that the
+integer statement is the stated rational statement (the alignment review lane).
+
+Not formalised here: the Gaussian conditioning that produces the covariance
+formula `Cov(A_ij,A_kl | V=0) = (2/3)δ_ijδ_kl + δ_ikδ_jl + δ_ilδ_jk`, the
+elementary integral `∫_0^a (a-z)^2 e^{-z/2} dz/2 = a^2-4a+8-8e^{-a/2}`, the
+Gaussian moment identities `E s^4 = 3 (Var s)^2` and
+`E exp(-s^2/2) = (1+Var s)^{-1/2}`, and the Rayleigh cone integration. Only the
+arithmetic that combines those inputs is kernel-checked.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Source: "Var(t)=15, Cov(t,G)=(-3,0,...,0)" and "tau^2=Var(t|G=0)=6":
+the Gaussian conditional variance `15 - (-3)^2 / Var(G_1)` with `Var(G_1) = 1`. -/
+theorem conditional_third_derivative_variance : (15 : Int) - (-3) * (-3) / 1 = 6 := by
+ decide
+
+/-- Source: "Cov(A_ij,A_kl | V=0) = (2/3)delta_ij delta_kl + delta_ik delta_jl
++ delta_il delta_jk". With `i=j=k=l` the three deltas give `2/3 + 1 + 1 = 8/3`
+(source: "For m=1 the variance of A is8/3"); for `A_12` only `δ_ik δ_jl` survives
+(variance `1`); for the pair `A_11, A_22` only `(2/3)δ_ij δ_kl` survives
+(covariance `2/3`). All in thirds. -/
+theorem transverse_covariance_entries_thirds :
+ 2 + 3 + 3 = 8 ∧ 0 + 3 + 0 = 3 ∧ 2 + 0 + 0 = 2 := by decide
+
+/-- Source: "D_1=E[A^2 1{A<0}]=4/3" — half of the variance `8/3` by centred
+symmetry. In thirds: `8 = 2 · 4`. -/
+theorem cone_moment_m1_thirds : 8 = 2 * 4 := by decide
+
+/-- Source: "For m=2 write A=[[s+x,y],[y,s-x]]. Then s,x,y are independent,
+Var(s)=5/3 and Var(x)=Var(y)=1." With `s = (A_11+A_22)/2`, `x = (A_11-A_22)/2`:
+`Var s = (8/3 + 8/3 + 2·2/3)/4 = 20/12 = 5/3`,
+`Var x = (8/3 + 8/3 - 2·2/3)/4 = 12/12 = 1`,
+`Cov(s,x) = (Var A_11 - Var A_22)/4 = 0`, `Var y = Var A_12 = 1`.
+Stated in thirds over the common denominator 12. This is the "shared trace
+variance5/3" that the note lists first among the items for nonauthor review. -/
+theorem trace_and_traceless_variances :
+ 8 + 8 + 2 * 2 = 20 ∧ 20 * 3 = 6 * 12 ∧
+ 8 + 8 - 2 * 2 = 12 ∧ 12 = 1 * 12 ∧
+ (8 : Int) - 8 = 0 := by decide
+
+/-- Source: "E s^2=5/3, E s^4=25/3": for a centred Gaussian `E s^4 = 3 (E s^2)^2`,
+so `E s^4 = 3 · (5/3)^2 = 75/9 = 25/3`. Cross-multiplied: `3 · 5^2 · 3 = 25 · 9`. -/
+theorem fourth_moment_of_trace : 3 * 5 ^ 2 * 3 = 25 * 9 := by decide
+
+/-- Source: "E exp(-s^2/2)=sqrt(3/8)": `E exp(-s^2/2) = (1 + Var s)^{-1/2}` with
+`1 + 5/3 = 8/3`. In thirds: `3 + 5 = 8`. -/
+theorem exponential_moment_of_trace : 3 + 5 = 8 := by decide
+
+/-- Source: "D_2 = (1/2)[25/3-20/3+8-8sqrt(3/8)] = 29/6-sqrt(6)".
+The bracket is the polynomial `a^2 - 4a + 8 - 8e^{-a/2}` averaged at
+`a = s^2`, so `4 · E s^2 = 4 · 5/3 = 20/3`.
+Rational part: `(25/3 - 20/3 + 8)/2 = (29/3)/2 = 29/6`; in thirds
+`25 - 20 + 24 = 29`. Irrational part: `(1/2)·8·√(3/8) = 4√(3/8) = √(16·3/8) = √6`;
+cross-multiplied `4^2 · 3 = 6 · 8`. -/
+theorem cone_moment_m2_algebra :
+ 4 * 5 = 20 ∧ 25 - 20 + 24 = 29 ∧ 4 ^ 2 * 3 = 6 * 8 := by decide
+
+/-- Source: "simplifying 6^(2/3)/24^(1/3)=(3/2)^(1/3)". Cubing both sides:
+`6^2 / 24 = 3/2`, i.e. `6^2 · 2 = 3 · 24`. -/
+theorem cube_root_simplification : 6 ^ 2 * 2 = 3 * 24 := by decide
+
+/-- Source: "p_G(0) p_V(0) = (2pi)^(-d) / sqrt(3)": `det diag(3,1,...,1) = 3`, and
+"Its dimension is at most10": the joint vector `(G, t, svec H)` has
+`d + 1 + d(d+1)/2` coordinates, `6` for `d = 2` and `10` for `d = 3`. -/
+theorem pin_determinant_and_joint_dimension :
+ 3 * 1 * 1 = 3 ∧ 2 + 1 + 2 * 3 / 2 = 6 ∧ 3 + 1 + 3 * 4 / 2 = 10 := by decide
+
+/-- Source: "The reference Hessian block has eigenvalues d+2 on trace and2 on
+traceless matrices": for `d = 2,3` these are `4, 5` and `2`; each exceeds `1/3`
+(`1 < 3·2`), consistent with the later `C_ref >= I/3`. -/
+theorem hessian_block_eigenvalues : 2 + 2 = 4 ∧ 3 + 2 = 5 ∧ 1 < 3 * 2 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_trace_variance.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_trace_variance.log
new file mode 100644
index 000000000..70942504b
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_trace_variance.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/false_trace_variance.lean:51:28: error: Tactic `decide` proved that the proposition
+ 8 + 8 + 2 * 2 = 20 ∧ 20 * 3 = 6 * 12 ∧ 8 + 8 - 2 * 2 = 12 ∧ 12 = 1 * 12 ∧ 8 - 8 = 0
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/leanchecker.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/leanchecker.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/native.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/native.lean
new file mode 100644
index 000000000..4ed222057
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/native.lean
@@ -0,0 +1,3 @@
+import UniversalLaw
+theorem injected : (2 : Nat) + 2 = 4 := by native_decide
+#print axioms injected
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/native.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/native.log
new file mode 100644
index 000000000..a494e022b
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/native.log
@@ -0,0 +1 @@
+'injected' depends on axioms: [injected._native.native_decide.ax_1_1]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/preflight-version.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/preflight-version.log
new file mode 100644
index 000000000..3bdff924e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/preflight-version.log
@@ -0,0 +1 @@
+Lean (version 4.34.1, x86_64-unknown-linux-gnu, commit 5045d0056413266e57c625dcd7c365b10e377c52, Release)
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json
new file mode 100644
index 000000000..0a48a4307
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json
@@ -0,0 +1,77 @@
+{
+ "alignment_status": "PENDING_INDEPENDENT_REVIEW",
+ "axioms": {
+ "UniversalLaw.Side24.conditional_third_derivative_variance": [],
+ "UniversalLaw.Side24.cone_moment_m1_thirds": [],
+ "UniversalLaw.Side24.cone_moment_m2_algebra": [],
+ "UniversalLaw.Side24.covariance_relative_bound": [],
+ "UniversalLaw.Side24.cube_root_simplification": [],
+ "UniversalLaw.Side24.d2_endpoints_adjacent": [],
+ "UniversalLaw.Side24.d3_below_d2": [],
+ "UniversalLaw.Side24.d3_endpoints_adjacent": [],
+ "UniversalLaw.Side24.density_comparison_below_reported": [],
+ "UniversalLaw.Side24.endpoints_in_unit_tenth": [],
+ "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten": [],
+ "UniversalLaw.Side24.exponent_bounds": [],
+ "UniversalLaw.Side24.exponent_values": [],
+ "UniversalLaw.Side24.exponential_moment_of_trace": [],
+ "UniversalLaw.Side24.fourth_moment_of_trace": [],
+ "UniversalLaw.Side24.geometric_ratio_constants": [],
+ "UniversalLaw.Side24.hessian_block_eigenvalues": [],
+ "UniversalLaw.Side24.image_constant_value": [],
+ "UniversalLaw.Side24.lattice_shell_constant": [],
+ "UniversalLaw.Side24.odd_block_eigenvalues": [],
+ "UniversalLaw.Side24.odd_block_shifted_minors": [],
+ "UniversalLaw.Side24.pairing_sum_le_six": [],
+ "UniversalLaw.Side24.pairing_sum_six": [],
+ "UniversalLaw.Side24.pairing_terms_six": [],
+ "UniversalLaw.Side24.period_exponent": [],
+ "UniversalLaw.Side24.pin_determinant_and_joint_dimension": [],
+ "UniversalLaw.Side24.ratio_constant_ordering": [],
+ "UniversalLaw.Side24.sixth_moment_double_factorial": [],
+ "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third": [],
+ "UniversalLaw.Side24.trace_and_traceless_variances": [],
+ "UniversalLaw.Side24.transverse_covariance_entries_thirds": []
+ },
+ "checked_commit": "6fc021839072d8c34f41e18e77b0f618c53baa15",
+ "dependency_revisions": {},
+ "formalization_status": "kernel-checked",
+ "lean_version": "Lean (version 4.34.1, x86_64-unknown-linux-gnu, commit 5045d0056413266e57c625dcd7c365b10e377c52, Release)",
+ "logs": {
+ "axioms.log": "856d934eabb250bffb96085454fc04b3ddd64a47bb92829728f7d5bb7d286d0c",
+ "build.log": "44deafbbb3d221e71b39a9acefff0973a13f662a3e30de6855971abe5c5ceaaf",
+ "custom_imported.log": "6e7f917c7fe2fdc3efe1943dcc327c56acadd0b0ca96507a4327073fdfd2f083",
+ "elaborated-types.log": "10a954ced98371c5cf98eecada196d50c1e6e570af9ea8e07caade4a80b0aab8",
+ "false_covariance_bound.log": "3e9f3d67aa666c88ed8e2b0b126163336cd5982dee6ce21b1118fa200292a4dd",
+ "false_eigenvalue_third.log": "fda3cc4e985c3309e132c150d4ba988a4d4699095ef2f0cab010dc8e2a5094b2",
+ "false_endpoint_adjacency.log": "62af9c46e66215424a5c82c4a1ee83700bbe7ca84906c14400cc4bfdcd5b276a",
+ "false_exp_partial_sum.log": "a82d1d1651352ec73a73ee7ad17a596d225fc808b9a3723dbbdd41f982f5328e",
+ "false_exponent_bound_d3.log": "bccf477ff397333506812af1a4a1475a3716f50a0ac0f3a20de77b421064b78d",
+ "false_trace_variance.log": "685a68785e68c9590b0479754dc6479d4e1be7a9f89b29a40bfed17c24a376bb",
+ "leanchecker.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "native.log": "8a0b9f79f3265724af58b27461627f9d532535f8a23681361da731c9ea37c101",
+ "preflight-version.log": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680",
+ "sorry.log": "50c0e4557dee071a09d39a848a5eb54324115cd8958a4564f1e845380a64677a",
+ "version.log": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680",
+ "wrong_image_constant.log": "56114d671544669de953160f6688ba962a052a17b8a00e614dc5cdab711744b1"
+ },
+ "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0",
+ "negative_controls": {
+ "custom_imported": "REJECTED_BY_AXIOM_GATE",
+ "false_covariance_bound": "REJECTED_BY_LEAN",
+ "false_eigenvalue_third": "REJECTED_BY_LEAN",
+ "false_endpoint_adjacency": "REJECTED_BY_LEAN",
+ "false_exp_partial_sum": "REJECTED_BY_LEAN",
+ "false_exponent_bound_d3": "REJECTED_BY_LEAN",
+ "false_trace_variance": "REJECTED_BY_LEAN",
+ "native": "REJECTED_BY_AXIOM_GATE",
+ "sorry": "REJECTED_BY_AXIOM_GATE",
+ "wrong_image_constant": "REJECTED_BY_LEAN"
+ },
+ "package": "side24-arithmetic-skeleton",
+ "repository": null,
+ "schema_version": 1,
+ "scientific_effect": "NONE",
+ "scientific_status_authority": false,
+ "workflow_run_id": null
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/sorry.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/sorry.lean
new file mode 100644
index 000000000..29e31c096
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/sorry.lean
@@ -0,0 +1,3 @@
+import UniversalLaw
+theorem injected : False := by sorry
+#print axioms injected
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/sorry.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/sorry.log
new file mode 100644
index 000000000..51b8af9ac
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/sorry.log
@@ -0,0 +1,2 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/sorry.lean:2:8: warning: declaration uses `sorry`
+'injected' depends on axioms: [sorryAx]
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/version.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/version.log
new file mode 100644
index 000000000..3bdff924e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/version.log
@@ -0,0 +1 @@
+Lean (version 4.34.1, x86_64-unknown-linux-gnu, commit 5045d0056413266e57c625dcd7c365b10e377c52, Release)
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/wrong_image_constant.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/wrong_image_constant.lean
new file mode 100644
index 000000000..837abc536
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/wrong_image_constant.lean
@@ -0,0 +1,142 @@
+/-!
+# SIDE24 coefficient note — analytic-image ledger, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+sections 2–4, and the `image_ledger()` function of `coefficient.py`.
+
+What this module establishes: every *exact integer or rational* identity and
+inequality that sections 2–4 of the note rely on is checked by the Lean kernel.
+No `sorry`, no `native_decide`, no axioms (the `--run-lean` receipt records the
+transitive `#print axioms` result for every target).
+
+What this module does **not** establish: the analytic facts the arithmetic is
+attached to — the Gaussian derivative bound `76|x|^6 e^{-|x|^2/2}` for `|x| ≥ 1`,
+the geometric-tail argument, the positive-semidefinite covariance comparison,
+the Schur-complement monotonicity, the Gaussian density comparison, and the
+`log`/`exp` estimates that turn exponents into the factor `32ε`. Those remain
+author-side prose under nonauthor review (Layer 0). Nothing here changes the
+scientific status of the coefficient or of its parent theorem.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Factorial on `Nat`; kept local so that the library has no dependencies. -/
+def fact : Nat → Nat
+ | 0 => 1
+ | n + 1 => (n + 1) * fact n
+
+/-- Product-rule pairing count for `q` unit directional derivatives of
+`exp(-|x|^2/2)`: `∑_{j=0}^{⌊q/2⌋} q! / (2^j j! (q-2j)!)`. Section 2 of the note
+uses its value at `q = 6` and the fact that it dominates the lower orders. -/
+def pairingSum (q : Nat) : Nat :=
+ (List.range (q / 2 + 1)).foldl
+ (fun acc j => acc + fact q / (2 ^ j * fact j * fact (q - 2 * j))) 0
+
+/-- Source: "The coefficient sum for q=6 is 1+15+45+15=76". -/
+theorem pairing_sum_six : pairingSum 6 = 76 := by decide
+
+/-- Source: "and it bounds the smaller orders as well". -/
+theorem pairing_sum_le_six : ∀ q, q ∈ [0, 1, 2, 3, 4, 5, 6] → pairingSum q ≤ 76 := by
+ decide
+
+/-- The individual pairing terms at `q = 6`, as displayed in the note. -/
+theorem pairing_terms_six :
+ fact 6 / (2 ^ 0 * fact 0 * fact 6) = 1 ∧
+ fact 6 / (2 ^ 1 * fact 1 * fact 4) = 15 ∧
+ fact 6 / (2 ^ 2 * fact 2 * fact 2) = 45 ∧
+ fact 6 / (2 ^ 3 * fact 3 * fact 0) = 15 := by
+ decide
+
+/-- Source: "At zero, every such contraction has absolute value at most 15".
+The sixth Gaussian moment / sixth derivative of `exp(-x^2/2)` at zero is the
+double factorial `5!! = 1·3·5`. Only the arithmetic value is checked here. -/
+theorem sixth_moment_double_factorial : 1 * 3 * 5 = 15 := by decide
+
+/-- Source: "there are at most 27j^3 possibilities for d<=3, |n|^6<=27j^6" and
+"<=729 sum_{j>=1} j^9 e^(-288j^2) <=1458 e^(-288)". The two factors of 27 give
+729; the geometric tail with ratio at most 1/2 gives the factor 2. -/
+theorem lattice_shell_constant : 27 * 27 = 729 ∧ 729 * 2 = 1458 := by decide
+
+/-- Source: "successive terms have ratio at most 512e^(-864)". `512 = 2^9` is
+the worst ratio `(j+1)^9 / j^9` at `j = 1`; `864 = 288·3` is the exponent gap
+`288((j+1)^2 - j^2)` at `j = 1`. -/
+theorem geometric_ratio_constants : 2 ^ 9 = 512 ∧ 288 * 3 = 864 := by decide
+
+/-- `24^2 / 2 = 288`: the periodization exponent for lattice period 24. -/
+theorem period_exponent : 24 ^ 2 / 2 = 288 := by decide
+
+/-- The image constant `E · 10^125` of display (2):
+`1458 · (76 · 24^6 + 15)`. -/
+def imageConstant : Nat := 1458 * (76 * 24 ^ 6 + 15)
+
+/-- Source: "E := 1458*(76*24^6+15)*10^(-125) = 21175738586479 *10^(-125)". -/
+theorem image_constant_value : imageConstant = 21175738586479 := by decide
+
+/-- Numerator of the degree-20 Taylor partial sum of `exp(288/125)` after
+clearing the denominator `125^20 · 20!`:
+`∑_{k=0}^{20} 288^k · 125^(20-k) · 20!/k!`. -/
+def expTaylorNumerator : Nat :=
+ (List.range 21).foldl
+ (fun acc k => acc + 288 ^ k * 125 ^ (20 - k) * (fact 20 / fact k)) 0
+
+/-- Source: "The code proves e^(288/125)>10 using the positive rational Taylor
+sum through20". Because every Taylor term of `exp` at a positive argument is
+positive, the partial sum is a lower bound; this theorem checks that the exact
+rational partial sum exceeds 10. The step from the partial sum to `exp` itself
+is analysis and is not formalised here. -/
+theorem exp_taylor_partial_sum_gt_ten :
+ 10 * (125 ^ 20 * fact 20) < expTaylorNumerator := by decide
+
+/-- Source: "Each covariance entry differs from the reference by at most2E ...
+the spectral norm of the difference is at most20E" (dimension at most 10) and
+"C_ref >= I/3 ... epsilon=10^(-108), since60E 1/3 ⇔ 23/3 > √58 ⇔ 23^2 > 58·9`. -/
+theorem smaller_eigenvalue_exceeds_third : 58 * 9 < 23 ^ 2 := by decide
+
+/-- Source (section 4): with `m = d-1`, `n = m(m+1)/2`, `a = m + 2/3 + n/2`,
+`b = d + n/2`. These are `6a` and `6b` as natural numbers. -/
+def sixA (d : Nat) : Nat := 6 * (d - 1) + 4 + 3 * ((d - 1) * d / 2)
+def sixB (d : Nat) : Nat := 6 * d + 3 * ((d - 1) * d / 2)
+
+/-- Source: "For d=2,3, a+2b<14 and2a+b<13". In sixths: `6a + 12b < 84` and
+`12a + 6b < 78`. For `d = 3` the second inequality is `77 < 78`, so this is a
+genuinely tight check. -/
+theorem exponent_bounds :
+ ∀ d, d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 78 := by
+ decide
+
+/-- The exact values behind `exponent_bounds`: `d = 2` gives `a = 13/6`, `b = 5/2`;
+`d = 3` gives `a = 25/6`, `b = 9/2`. -/
+theorem exponent_values :
+ sixA 2 = 13 ∧ sixB 2 = 15 ∧ sixA 3 = 25 ∧ sixB 3 = 27 := by decide
+
+/-- Source: "ratio between1-13epsilon and1+28epsilon, hence safely between
+1-32epsilon and1+32epsilon". The analytic `log`/`exp` estimates are not
+formalised; the ordering of the constants is. -/
+theorem ratio_constant_ordering : 13 ≤ 32 ∧ 28 ≤ 32 := by decide
+
+/-- Source: "|c_d,24/c_d,ref -1| < 10^(-106)" together with `ε = 10^(-108)`
+and the factor 32 from section 4: `32 · 10^(-108) < 10^(-106)`. -/
+theorem density_comparison_below_reported : 32 * 10 ^ 106 < 10 ^ 108 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/wrong_image_constant.log b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/wrong_image_constant.log
new file mode 100644
index 000000000..e9290ef83
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/wrong_image_constant.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/wrong_image_constant.lean:75:68: error: Tactic `decide` proved that the proposition
+ imageConstant = 21175738586479
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw.lean
new file mode 100644
index 000000000..ff12fa0eb
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw.lean
@@ -0,0 +1,13 @@
+import UniversalLaw.Side24.Ledger
+import UniversalLaw.Side24.ConeMoments
+import UniversalLaw.Side24.Endpoints
+
+/-!
+# Universal Law — main-side formal package (SIDE24 arithmetic skeleton)
+
+Root module. `tools/formal_gate_check.py` requires this file to import exactly
+the modules registered in `formal/manifest.json`, derives the target inventory
+from their `theorem` declarations, and in `--run-lean` mode builds the package,
+runs `leanchecker`, audits `#print axioms` for every target (only `propext`,
+`Classical.choice`, `Quot.sound` are allowed) and executes negative controls.
+-/
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/ConeMoments.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/ConeMoments.lean
new file mode 100644
index 000000000..e18e69b08
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/ConeMoments.lean
@@ -0,0 +1,85 @@
+/-!
+# SIDE24 coefficient note — reference covariance and cone moments, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+section 1.
+
+Core Lean has no rational-number type, so every rational identity is stated
+as the equivalent cross-multiplied integer identity, with the rational form in
+the docstring. The kernel checks the integers; a reviewer checks that the
+integer statement is the stated rational statement (the alignment review lane).
+
+Not formalised here: the Gaussian conditioning that produces the covariance
+formula `Cov(A_ij,A_kl | V=0) = (2/3)δ_ijδ_kl + δ_ikδ_jl + δ_ilδ_jk`, the
+elementary integral `∫_0^a (a-z)^2 e^{-z/2} dz/2 = a^2-4a+8-8e^{-a/2}`, the
+Gaussian moment identities `E s^4 = 3 (Var s)^2` and
+`E exp(-s^2/2) = (1+Var s)^{-1/2}`, and the Rayleigh cone integration. Only the
+arithmetic that combines those inputs is kernel-checked.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Source: "Var(t)=15, Cov(t,G)=(-3,0,...,0)" and "tau^2=Var(t|G=0)=6":
+the Gaussian conditional variance `15 - (-3)^2 / Var(G_1)` with `Var(G_1) = 1`. -/
+theorem conditional_third_derivative_variance : (15 : Int) - (-3) * (-3) / 1 = 6 := by
+ decide
+
+/-- Source: "Cov(A_ij,A_kl | V=0) = (2/3)delta_ij delta_kl + delta_ik delta_jl
++ delta_il delta_jk". With `i=j=k=l` the three deltas give `2/3 + 1 + 1 = 8/3`
+(source: "For m=1 the variance of A is8/3"); for `A_12` only `δ_ik δ_jl` survives
+(variance `1`); for the pair `A_11, A_22` only `(2/3)δ_ij δ_kl` survives
+(covariance `2/3`). All in thirds. -/
+theorem transverse_covariance_entries_thirds :
+ 2 + 3 + 3 = 8 ∧ 0 + 3 + 0 = 3 ∧ 2 + 0 + 0 = 2 := by decide
+
+/-- Source: "D_1=E[A^2 1{A<0}]=4/3" — half of the variance `8/3` by centred
+symmetry. In thirds: `8 = 2 · 4`. -/
+theorem cone_moment_m1_thirds : 8 = 2 * 4 := by decide
+
+/-- Source: "For m=2 write A=[[s+x,y],[y,s-x]]. Then s,x,y are independent,
+Var(s)=5/3 and Var(x)=Var(y)=1." With `s = (A_11+A_22)/2`, `x = (A_11-A_22)/2`:
+`Var s = (8/3 + 8/3 + 2·2/3)/4 = 20/12 = 5/3`,
+`Var x = (8/3 + 8/3 - 2·2/3)/4 = 12/12 = 1`,
+`Cov(s,x) = (Var A_11 - Var A_22)/4 = 0`, `Var y = Var A_12 = 1`.
+Stated in thirds over the common denominator 12. This is the "shared trace
+variance5/3" that the note lists first among the items for nonauthor review. -/
+theorem trace_and_traceless_variances :
+ 8 + 8 + 2 * 2 = 20 ∧ 20 * 3 = 5 * 12 ∧
+ 8 + 8 - 2 * 2 = 12 ∧ 12 = 1 * 12 ∧
+ (8 : Int) - 8 = 0 := by decide
+
+/-- Source: "E s^2=5/3, E s^4=25/3": for a centred Gaussian `E s^4 = 3 (E s^2)^2`,
+so `E s^4 = 3 · (5/3)^2 = 75/9 = 25/3`. Cross-multiplied: `3 · 5^2 · 3 = 25 · 9`. -/
+theorem fourth_moment_of_trace : 3 * 5 ^ 2 * 3 = 25 * 9 := by decide
+
+/-- Source: "E exp(-s^2/2)=sqrt(3/8)": `E exp(-s^2/2) = (1 + Var s)^{-1/2}` with
+`1 + 5/3 = 8/3`. In thirds: `3 + 5 = 8`. -/
+theorem exponential_moment_of_trace : 3 + 5 = 8 := by decide
+
+/-- Source: "D_2 = (1/2)[25/3-20/3+8-8sqrt(3/8)] = 29/6-sqrt(6)".
+The bracket is the polynomial `a^2 - 4a + 8 - 8e^{-a/2}` averaged at
+`a = s^2`, so `4 · E s^2 = 4 · 5/3 = 20/3`.
+Rational part: `(25/3 - 20/3 + 8)/2 = (29/3)/2 = 29/6`; in thirds
+`25 - 20 + 24 = 29`. Irrational part: `(1/2)·8·√(3/8) = 4√(3/8) = √(16·3/8) = √6`;
+cross-multiplied `4^2 · 3 = 6 · 8`. -/
+theorem cone_moment_m2_algebra :
+ 4 * 5 = 20 ∧ 25 - 20 + 24 = 29 ∧ 4 ^ 2 * 3 = 6 * 8 := by decide
+
+/-- Source: "simplifying 6^(2/3)/24^(1/3)=(3/2)^(1/3)". Cubing both sides:
+`6^2 / 24 = 3/2`, i.e. `6^2 · 2 = 3 · 24`. -/
+theorem cube_root_simplification : 6 ^ 2 * 2 = 3 * 24 := by decide
+
+/-- Source: "p_G(0) p_V(0) = (2pi)^(-d) / sqrt(3)": `det diag(3,1,...,1) = 3`, and
+"Its dimension is at most10": the joint vector `(G, t, svec H)` has
+`d + 1 + d(d+1)/2` coordinates, `6` for `d = 2` and `10` for `d = 3`. -/
+theorem pin_determinant_and_joint_dimension :
+ 3 * 1 * 1 = 3 ∧ 2 + 1 + 2 * 3 / 2 = 6 ∧ 3 + 1 + 3 * 4 / 2 = 10 := by decide
+
+/-- Source: "The reference Hessian block has eigenvalues d+2 on trace and2 on
+traceless matrices": for `d = 2,3` these are `4, 5` and `2`; each exceeds `1/3`
+(`1 < 3·2`), consistent with the later `C_ref >= I/3`. -/
+theorem hessian_block_eigenvalues : 2 + 2 = 4 ∧ 3 + 2 = 5 ∧ 1 < 3 * 2 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/Endpoints.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/Endpoints.lean
new file mode 100644
index 000000000..adccc6c2d
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/Endpoints.lean
@@ -0,0 +1,42 @@
+/-!
+# SIDE24 published endpoints — consistency of the frozen artifact
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/ENCLOSURE.json`,
+1090 bytes, SHA-256 `72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811`.
+
+The published decimal endpoints are transcribed here as integers in units of
+`10^-20`. The kernel checks that each interval is nonempty and exactly one
+`10^-20` step wide, and that the two intervals are disjoint and ordered.
+
+This module does **not** establish that the coefficient lies in either
+interval: that claim needs `Real.Gamma`, `Real.pi`, `Real.exp` and the
+Gaussian cone moments, none of which exist in core Lean. That boundary is
+recorded target by target in `formal/SCOPE.md`; the enclosure itself is not a
+target of this package.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- `0.07340691930603427103` and `0.07340691930603427104` in units of `10^-20`. -/
+def d2Lower : Nat := 7340691930603427103
+def d2Upper : Nat := 7340691930603427104
+
+/-- `0.04177593184059834334` and `0.04177593184059834335` in units of `10^-20`. -/
+def d3Lower : Nat := 4177593184059834334
+def d3Upper : Nat := 4177593184059834335
+
+/-- Source: "0.07340691930603427103 < c_2,24 < 0.07340691930603427104" — the
+published endpoints are distinct and adjacent on the 20-digit grid. -/
+theorem d2_endpoints_adjacent : d2Lower < d2Upper ∧ d2Upper = d2Lower + 1 := by decide
+
+/-- Source: "0.04177593184059834334 < c_3,24 < 0.04177593184059834335". -/
+theorem d3_endpoints_adjacent : d3Lower < d3Upper ∧ d3Upper = d3Lower + 1 := by decide
+
+/-- The published `d = 3` interval lies strictly below the `d = 2` interval. -/
+theorem d3_below_d2 : d3Upper < d2Lower := by decide
+
+/-- Both published intervals lie in `(0, 1/10)`: `10^-20`-units below `10^19`. -/
+theorem endpoints_in_unit_tenth : 0 < d3Lower ∧ d2Upper < 10 ^ 19 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/Ledger.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/Ledger.lean
new file mode 100644
index 000000000..c76f2ea2e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/Ledger.lean
@@ -0,0 +1,142 @@
+/-!
+# SIDE24 coefficient note — analytic-image ledger, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+sections 2–4, and the `image_ledger()` function of `coefficient.py`.
+
+What this module establishes: every *exact integer or rational* identity and
+inequality that sections 2–4 of the note rely on is checked by the Lean kernel.
+No `sorry`, no `native_decide`, no axioms (the `--run-lean` receipt records the
+transitive `#print axioms` result for every target).
+
+What this module does **not** establish: the analytic facts the arithmetic is
+attached to — the Gaussian derivative bound `76|x|^6 e^{-|x|^2/2}` for `|x| ≥ 1`,
+the geometric-tail argument, the positive-semidefinite covariance comparison,
+the Schur-complement monotonicity, the Gaussian density comparison, and the
+`log`/`exp` estimates that turn exponents into the factor `32ε`. Those remain
+author-side prose under nonauthor review (Layer 0). Nothing here changes the
+scientific status of the coefficient or of its parent theorem.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Factorial on `Nat`; kept local so that the library has no dependencies. -/
+def fact : Nat → Nat
+ | 0 => 1
+ | n + 1 => (n + 1) * fact n
+
+/-- Product-rule pairing count for `q` unit directional derivatives of
+`exp(-|x|^2/2)`: `∑_{j=0}^{⌊q/2⌋} q! / (2^j j! (q-2j)!)`. Section 2 of the note
+uses its value at `q = 6` and the fact that it dominates the lower orders. -/
+def pairingSum (q : Nat) : Nat :=
+ (List.range (q / 2 + 1)).foldl
+ (fun acc j => acc + fact q / (2 ^ j * fact j * fact (q - 2 * j))) 0
+
+/-- Source: "The coefficient sum for q=6 is 1+15+45+15=76". -/
+theorem pairing_sum_six : pairingSum 6 = 76 := by decide
+
+/-- Source: "and it bounds the smaller orders as well". -/
+theorem pairing_sum_le_six : ∀ q, q ∈ [0, 1, 2, 3, 4, 5, 6] → pairingSum q ≤ 76 := by
+ decide
+
+/-- The individual pairing terms at `q = 6`, as displayed in the note. -/
+theorem pairing_terms_six :
+ fact 6 / (2 ^ 0 * fact 0 * fact 6) = 1 ∧
+ fact 6 / (2 ^ 1 * fact 1 * fact 4) = 15 ∧
+ fact 6 / (2 ^ 2 * fact 2 * fact 2) = 45 ∧
+ fact 6 / (2 ^ 3 * fact 3 * fact 0) = 15 := by
+ decide
+
+/-- Source: "At zero, every such contraction has absolute value at most 15".
+The sixth Gaussian moment / sixth derivative of `exp(-x^2/2)` at zero is the
+double factorial `5!! = 1·3·5`. Only the arithmetic value is checked here. -/
+theorem sixth_moment_double_factorial : 1 * 3 * 5 = 15 := by decide
+
+/-- Source: "there are at most 27j^3 possibilities for d<=3, |n|^6<=27j^6" and
+"<=729 sum_{j>=1} j^9 e^(-288j^2) <=1458 e^(-288)". The two factors of 27 give
+729; the geometric tail with ratio at most 1/2 gives the factor 2. -/
+theorem lattice_shell_constant : 27 * 27 = 729 ∧ 729 * 2 = 1458 := by decide
+
+/-- Source: "successive terms have ratio at most 512e^(-864)". `512 = 2^9` is
+the worst ratio `(j+1)^9 / j^9` at `j = 1`; `864 = 288·3` is the exponent gap
+`288((j+1)^2 - j^2)` at `j = 1`. -/
+theorem geometric_ratio_constants : 2 ^ 9 = 512 ∧ 288 * 3 = 864 := by decide
+
+/-- `24^2 / 2 = 288`: the periodization exponent for lattice period 24. -/
+theorem period_exponent : 24 ^ 2 / 2 = 288 := by decide
+
+/-- The image constant `E · 10^125` of display (2):
+`1458 · (76 · 24^6 + 15)`. -/
+def imageConstant : Nat := 1458 * (76 * 24 ^ 6 + 15)
+
+/-- Source: "E := 1458*(76*24^6+15)*10^(-125) = 21175738586478 *10^(-125)". -/
+theorem image_constant_value : imageConstant = 21175738586478 := by decide
+
+/-- Numerator of the degree-20 Taylor partial sum of `exp(288/125)` after
+clearing the denominator `125^20 · 20!`:
+`∑_{k=0}^{20} 288^k · 125^(20-k) · 20!/k!`. -/
+def expTaylorNumerator : Nat :=
+ (List.range 21).foldl
+ (fun acc k => acc + 288 ^ k * 125 ^ (20 - k) * (fact 20 / fact k)) 0
+
+/-- Source: "The code proves e^(288/125)>10 using the positive rational Taylor
+sum through20". Because every Taylor term of `exp` at a positive argument is
+positive, the partial sum is a lower bound; this theorem checks that the exact
+rational partial sum exceeds 10. The step from the partial sum to `exp` itself
+is analysis and is not formalised here. -/
+theorem exp_taylor_partial_sum_gt_ten :
+ 10 * (125 ^ 20 * fact 20) < expTaylorNumerator := by decide
+
+/-- Source: "Each covariance entry differs from the reference by at most2E ...
+the spectral norm of the difference is at most20E" (dimension at most 10) and
+"C_ref >= I/3 ... epsilon=10^(-108), since60E 1/3 ⇔ 23/3 > √58 ⇔ 23^2 > 58·9`. -/
+theorem smaller_eigenvalue_exceeds_third : 58 * 9 < 23 ^ 2 := by decide
+
+/-- Source (section 4): with `m = d-1`, `n = m(m+1)/2`, `a = m + 2/3 + n/2`,
+`b = d + n/2`. These are `6a` and `6b` as natural numbers. -/
+def sixA (d : Nat) : Nat := 6 * (d - 1) + 4 + 3 * ((d - 1) * d / 2)
+def sixB (d : Nat) : Nat := 6 * d + 3 * ((d - 1) * d / 2)
+
+/-- Source: "For d=2,3, a+2b<14 and2a+b<13". In sixths: `6a + 12b < 84` and
+`12a + 6b < 78`. For `d = 3` the second inequality is `77 < 78`, so this is a
+genuinely tight check. -/
+theorem exponent_bounds :
+ ∀ d, d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 78 := by
+ decide
+
+/-- The exact values behind `exponent_bounds`: `d = 2` gives `a = 13/6`, `b = 5/2`;
+`d = 3` gives `a = 25/6`, `b = 9/2`. -/
+theorem exponent_values :
+ sixA 2 = 13 ∧ sixB 2 = 15 ∧ sixA 3 = 25 ∧ sixB 3 = 27 := by decide
+
+/-- Source: "ratio between1-13epsilon and1+28epsilon, hence safely between
+1-32epsilon and1+32epsilon". The analytic `log`/`exp` estimates are not
+formalised; the ordering of the constants is. -/
+theorem ratio_constant_ordering : 13 ≤ 32 ∧ 28 ≤ 32 := by decide
+
+/-- Source: "|c_d,24/c_d,ref -1| < 10^(-106)" together with `ε = 10^(-108)`
+and the factor 32 from section 4: `32 · 10^(-108) < 10^(-106)`. -/
+theorem density_comparison_below_reported : 32 * 10 ^ 106 < 10 ^ 108 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/lean-toolchain b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/lean-toolchain
new file mode 100644
index 000000000..ba8ebf2db
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/lean-toolchain
@@ -0,0 +1 @@
+leanprover/lean4:v4.34.1
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/manifest.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/manifest.json
new file mode 100644
index 000000000..a22f06a3a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/manifest.json
@@ -0,0 +1,365 @@
+{
+ "schema_version": 1,
+ "scientific_effect": "NONE",
+ "scientific_status_authority": false,
+ "package": "side24-arithmetic-skeleton",
+ "package_root": "formal",
+ "root_module": "UniversalLaw",
+ "formalization_status": "proved",
+ "alignment_status": "PENDING_INDEPENDENT_REVIEW",
+ "meaning": "Evidence sidecar for the main-side Lean package, following the Math- formal lane contract (docs/FORMAL_VERIFICATION.md; historical formal-ladder work item #95, retained in coordination.work_item as provenance rather than current pickup routing). `proved` here means proof text supplied and bound by hash; `kernel-checked` is reported only by the receipt of a trusted --run-lean execution at an exact commit. Alignment is a separate pending/accepted/stale dimension. Nothing in this file is a scientific register entry or changes any ACCEPT/AMEND disposition.",
+ "coordination": {
+ "guide": "docs/FORMAL_VERIFICATION.md",
+ "work_item": "https://github.com/d6g8k5htny-coder/main/issues/95",
+ "math_pilot": "https://github.com/d6g8k5htny-coder/Math-/tree/cc2989c1280f4f227d0c6aa30c8841d6ba01e46e/formal",
+ "rollout_record": "docs/FORMAL_VERIFICATION_ROLLOUT_20260927.md",
+ "work_offer_addressed": "Numerical formalizer, first step only: the exact arithmetic skeleton of the SIDE24 note. The coefficient definition and the proof-producing enclosure pipeline are NOT supplied."
+ },
+ "author": {
+ "provider": "Anthropic",
+ "family": "Claude",
+ "agent": "Cursor cloud agent, 2026-09-27"
+ },
+ "lean_toolchain": "leanprover/lean4:v4.34.1",
+ "dependency_revisions": {},
+ "allowed_axioms": [
+ "propext",
+ "Classical.choice",
+ "Quot.sound"
+ ],
+ "files": {
+ "formal/lean-toolchain": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b",
+ "formal/lakefile.toml": "58f0fa6864cc03e9bcbef2d8c0404e9f3385a30a6124000454319367906cbe4a",
+ "formal/lake-manifest.json": "562d38ad95598486b2b592e6d072d5d3212735bfeb1cb6d8eb8ec04492522ba2",
+ "formal/UniversalLaw.lean": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e",
+ "formal/UniversalLaw/Side24/Ledger.lean": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7",
+ "formal/UniversalLaw/Side24/ConeMoments.lean": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c",
+ "formal/UniversalLaw/Side24/Endpoints.lean": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd",
+ "formal/sources/side24_v1/PROOF.md": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769",
+ "formal/sources/side24_v1/ENCLOSURE.json": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811",
+ "formal/SCOPE.md": "fd06700628b1fbc81c5cfe3786aaa455032375bcb879914f068a66b726802a17",
+ "formal/GLOSSARY.md": "342d4efb374fea31c39e51f8f6bcdbc50d7fb5fea1fd393eda21afff92c62fb8",
+ "formal/README.md": "137e7c7ed44d732042d803eb4a0ee75f9ddc6475950a2bb6226a7711a44be14b",
+ "formal/REVIEW_LANE.md": "54d32104aa012e917ef40b73fa3a40228d023249b339cf30fe4bdb7dcbfed414",
+ "formal/reviews/TEMPLATE_alignment_review.json": "e722e928ca43c16981e063d8eb1c91e9bf8c683241d9dcf156400a419e72feb3",
+ "formal/reviews/README.md": "333ca71e7c676cee89e5d01cd61999c21bb0584e41d6bdacb18afa410109f95d",
+ "tools/formal_gate_check.py": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5",
+ "tests/test_formal_gate.py": "2b13ad83b03d2b45f4be70ce03af597c195563a1ed0bd3983a2b7040068a3a84"
+ },
+ "unbound_files": [
+ "formal/manifest.json",
+ "formal/ALIGNMENT.md"
+ ],
+ "sources": [
+ {
+ "id": "side24-proof",
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "9d7b6802424fb4715b31999066aafca8ee2f3cca",
+ "path": "coefficients/side24_v1/PROOF.md",
+ "bytes": 10272,
+ "sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769",
+ "local_copy": "formal/sources/side24_v1/PROOF.md"
+ },
+ {
+ "id": "side24-enclosure",
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "9d7b6802424fb4715b31999066aafca8ee2f3cca",
+ "path": "coefficients/side24_v1/ENCLOSURE.json",
+ "bytes": 1090,
+ "sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811",
+ "local_copy": "formal/sources/side24_v1/ENCLOSURE.json"
+ }
+ ],
+ "source_modules": [
+ "UniversalLaw/Side24/Ledger.lean",
+ "UniversalLaw/Side24/ConeMoments.lean",
+ "UniversalLaw/Side24/Endpoints.lean"
+ ],
+ "targets": [
+ {
+ "name": "UniversalLaw.Side24.pairing_sum_six",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Product-rule pairing count at q=6 equals 76",
+ "source": "side24-proof",
+ "informal_anchor": "The coefficient sum for q=6 is\n1+15+45+15=76",
+ "does_not_claim": "the derivative bound 76|x|^6 e^(-|x|^2/2) itself"
+ },
+ {
+ "name": "UniversalLaw.Side24.pairing_sum_le_six",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Pairing counts for q<=6 are at most 76",
+ "source": "side24-proof",
+ "informal_anchor": "it bounds the smaller orders as well",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.pairing_terms_six",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Individual pairing terms 1, 15, 45, 15",
+ "source": "side24-proof",
+ "informal_anchor": "1+15+45+15=76",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.sixth_moment_double_factorial",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Double factorial 5!! = 15",
+ "source": "side24-proof",
+ "informal_anchor": "At zero, every such\ncontraction has absolute value at most15.",
+ "does_not_claim": "that Gaussian derivative contractions at zero are bounded by 15"
+ },
+ {
+ "name": "UniversalLaw.Side24.lattice_shell_constant",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Shell constants 27·27 = 729 and 729·2 = 1458",
+ "source": "side24-proof",
+ "informal_anchor": "<=729 sum_{j>=1} j^9 e^(-288j^2)\n <=1458 e^(-288).",
+ "does_not_claim": "the lattice-point count or the geometric tail sum"
+ },
+ {
+ "name": "UniversalLaw.Side24.geometric_ratio_constants",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Ratio constants 2^9 = 512 and 288·3 = 864",
+ "source": "side24-proof",
+ "informal_anchor": "successive terms have ratio at most512e^(-864)<1/2",
+ "does_not_claim": "that the ratio is below 1/2"
+ },
+ {
+ "name": "UniversalLaw.Side24.period_exponent",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Period-24 exponent 24^2/2 = 288",
+ "source": "side24-proof",
+ "informal_anchor": "sum_{n!=0} |n|^6 e^(-288|n|^2)",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.image_constant_value",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Image constant 1458·(76·24^6+15) = 21175738586478",
+ "source": "side24-proof",
+ "informal_anchor": "E := 1458*(76*24^6+15)*10^(-125)\n = 21175738586478 *10^(-125).",
+ "does_not_claim": "the inequality |D^q K_24(0)-D^q K_infty(0)| < E"
+ },
+ {
+ "name": "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Degree-20 Taylor partial sum of exp(288/125) exceeds 10",
+ "source": "side24-proof",
+ "informal_anchor": "The code proves e^(288/125)>10 using the positive rational Taylor sum through20",
+ "does_not_claim": "that the partial sum is below exp(288/125) (positivity of the omitted terms is analysis)"
+ },
+ {
+ "name": "UniversalLaw.Side24.covariance_relative_bound",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "60E < 10^(-108) as the integer inequality 60·21175738586478 < 10^17",
+ "source": "side24-proof",
+ "informal_anchor": "epsilon=10^(-108), since60E= I/3"
+ },
+ {
+ "name": "UniversalLaw.Side24.odd_block_eigenvalues",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Odd block trace 16 and determinant 6 = 8^2 - 58",
+ "source": "side24-proof",
+ "informal_anchor": "[[1,-3],[-3,15]], whose eigenvalues are8 +/- sqrt(58)",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.odd_block_shifted_minors",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Shifted odd block minors 2/3 and 7/9 (scaled by 3: 2 and 7)",
+ "source": "side24-proof",
+ "informal_anchor": "subtract I/3 and use first principal minor2/3 and determinant7/9",
+ "does_not_claim": "Sylvester's criterion"
+ },
+ {
+ "name": "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "8 - sqrt(58) > 1/3 via 23^2 > 58·9",
+ "source": "side24-proof",
+ "informal_anchor": "Its smaller eigenvalue exceeds\n1/3",
+ "does_not_claim": "monotonicity of the square root"
+ },
+ {
+ "name": "UniversalLaw.Side24.exponent_bounds",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Exponent inequalities a+2b<14 and 2a+b<13 for d=2,3 (in sixths)",
+ "source": "side24-proof",
+ "informal_anchor": "For d=2,3, a+2b<14 and2a+b<13.",
+ "does_not_claim": "the log/exp estimates that follow"
+ },
+ {
+ "name": "UniversalLaw.Side24.exponent_values",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Exact a, b values for d=2,3",
+ "source": "side24-proof",
+ "informal_anchor": "a=m+2/3+n/2, b=d+n/2.",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.ratio_constant_ordering",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "13 <= 32 and 28 <= 32",
+ "source": "side24-proof",
+ "informal_anchor": "ratio between1-13epsilon and\n1+28epsilon, hence safely between1-32epsilon and1+32epsilon",
+ "does_not_claim": "the elementary log/exp bounds"
+ },
+ {
+ "name": "UniversalLaw.Side24.density_comparison_below_reported",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "32·10^(-108) < 10^(-106)",
+ "source": "side24-proof",
+ "informal_anchor": "|c_d,24/c_d,ref -1| < 10^(-106), d=2,3.",
+ "does_not_claim": "the multiplicative density comparison"
+ },
+ {
+ "name": "UniversalLaw.Side24.conditional_third_derivative_variance",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "Conditional variance tau^2 = 15 - 9 = 6",
+ "source": "side24-proof",
+ "informal_anchor": "Var(t)=15, Cov(t,G)=(-3,0,...,0)",
+ "does_not_claim": "the Gaussian conditioning formula or the covariance derivatives"
+ },
+ {
+ "name": "UniversalLaw.Side24.transverse_covariance_entries_thirds",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "Transverse covariance entries 8/3, 1, 2/3 from the delta formula",
+ "source": "side24-proof",
+ "informal_anchor": "Cov(A_ij,A_kl | V=0)\n = (2/3)delta_ij delta_kl + delta_ik delta_jl + delta_il delta_jk.",
+ "does_not_claim": "the delta formula itself"
+ },
+ {
+ "name": "UniversalLaw.Side24.cone_moment_m1_thirds",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "D_1 = 4/3 is half of 8/3",
+ "source": "side24-proof",
+ "informal_anchor": "D_1=E[A^2 1{A<0}]=4/3.",
+ "does_not_claim": "centred Gaussian symmetry"
+ },
+ {
+ "name": "UniversalLaw.Side24.trace_and_traceless_variances",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "Var(s) = 5/3, Var(x) = Var(y) = 1, Cov(s,x) = 0 from the 2x2 covariance entries",
+ "source": "side24-proof",
+ "informal_anchor": "Var(s)=5/3 and Var(x)=Var(y)=1.",
+ "does_not_claim": "independence beyond zero covariance, which is Gaussian"
+ },
+ {
+ "name": "UniversalLaw.Side24.fourth_moment_of_trace",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "E s^4 = 3·(5/3)^2 = 25/3",
+ "source": "side24-proof",
+ "informal_anchor": "E s^2=5/3, E s^4=25/3",
+ "does_not_claim": "the Gaussian fourth-moment identity"
+ },
+ {
+ "name": "UniversalLaw.Side24.exponential_moment_of_trace",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "1 + 5/3 = 8/3 behind E exp(-s^2/2) = sqrt(3/8)",
+ "source": "side24-proof",
+ "informal_anchor": "E exp(-s^2/2)=sqrt(3/8)",
+ "does_not_claim": "the Gaussian exponential-moment identity"
+ },
+ {
+ "name": "UniversalLaw.Side24.cone_moment_m2_algebra",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "D_2 algebra: rational part 29/6 and 4·sqrt(3/8) = sqrt(6)",
+ "source": "side24-proof",
+ "informal_anchor": "D_2 = (1/2)[25/3-20/3+8-8sqrt(3/8)]\n = 29/6-sqrt(6).",
+ "does_not_claim": "the integral identity or the Rayleigh cone integration"
+ },
+ {
+ "name": "UniversalLaw.Side24.cube_root_simplification",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "6^2·2 = 3·24 behind 6^(2/3)/24^(1/3) = (3/2)^(1/3)",
+ "source": "side24-proof",
+ "informal_anchor": "simplifying 6^(2/3)/24^(1/3)=(3/2)^(1/3)",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.pin_determinant_and_joint_dimension",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "det diag(3,1,..,1) = 3 and joint dimensions 6, 10",
+ "source": "side24-proof",
+ "informal_anchor": "Its dimension is at most10.",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.hessian_block_eigenvalues",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "Hessian block eigenvalues 4, 5, 2 exceed 1/3",
+ "source": "side24-proof",
+ "informal_anchor": "The reference Hessian block has eigenvalues d+2 on trace and2 on traceless matrices",
+ "does_not_claim": "the spectral decomposition"
+ },
+ {
+ "name": "UniversalLaw.Side24.d2_endpoints_adjacent",
+ "module": "UniversalLaw/Side24/Endpoints.lean",
+ "title": "Published d=2 endpoints are adjacent 20-digit decimals",
+ "source": "side24-enclosure",
+ "informal_anchor": "\"2\": {\n \"lower\": \"0.07340691930603427103\",\n \"upper\": \"0.07340691930603427104\"",
+ "does_not_claim": "that c_2,24 lies between them"
+ },
+ {
+ "name": "UniversalLaw.Side24.d3_endpoints_adjacent",
+ "module": "UniversalLaw/Side24/Endpoints.lean",
+ "title": "Published d=3 endpoints are adjacent 20-digit decimals",
+ "source": "side24-enclosure",
+ "informal_anchor": "\"3\": {\n \"lower\": \"0.04177593184059834334\",\n \"upper\": \"0.04177593184059834335\"",
+ "does_not_claim": "that c_3,24 lies between them"
+ },
+ {
+ "name": "UniversalLaw.Side24.d3_below_d2",
+ "module": "UniversalLaw/Side24/Endpoints.lean",
+ "title": "Published d=3 interval lies below the d=2 interval",
+ "source": "side24-enclosure",
+ "informal_anchor": "\"dimensions\": {\n \"2\": {\n \"lower\": \"0.07340691930603427103\",\n \"upper\": \"0.07340691930603427104\"\n },\n \"3\": {\n \"lower\": \"0.04177593184059834334\",\n \"upper\": \"0.04177593184059834335\"",
+ "does_not_claim": "anything about the true coefficients; the ordering d3 upper < d2 lower is a derived artifact-consistency check of the displayed endpoints"
+ },
+ {
+ "name": "UniversalLaw.Side24.endpoints_in_unit_tenth",
+ "module": "UniversalLaw/Side24/Endpoints.lean",
+ "title": "Published endpoints lie in (0, 1/10)",
+ "source": "side24-enclosure",
+ "informal_anchor": "\"dimensions\": {\n \"2\": {\n \"lower\": \"0.07340691930603427103\",\n \"upper\": \"0.07340691930603427104\"\n },\n \"3\": {\n \"lower\": \"0.04177593184059834334\",\n \"upper\": \"0.04177593184059834335\"",
+ "does_not_claim": "anything about the true coefficients; the range (0, 1/10) is a derived artifact-consistency check of the displayed endpoints"
+ }
+ ],
+ "negative_controls": {
+ "false_exponent_bound_d3": {
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "replace": "sixB d < 78",
+ "with": "sixB d < 77"
+ },
+ "false_covariance_bound": {
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "replace": "60 * imageConstant < 10 ^ 17",
+ "with": "60 * imageConstant < 10 ^ 15"
+ },
+ "false_exp_partial_sum": {
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "replace": "10 * (125 ^ 20 * fact 20) < expTaylorNumerator",
+ "with": "11 * (125 ^ 20 * fact 20) < expTaylorNumerator"
+ },
+ "wrong_image_constant": {
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "replace": "= 21175738586478",
+ "with": "= 21175738586479"
+ },
+ "false_eigenvalue_third": {
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "replace": "58 * 9 < 23 ^ 2",
+ "with": "58 * 9 < 22 ^ 2"
+ },
+ "false_trace_variance": {
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "replace": "20 * 3 = 5 * 12",
+ "with": "20 * 3 = 6 * 12"
+ },
+ "false_endpoint_adjacency": {
+ "module": "UniversalLaw/Side24/Endpoints.lean",
+ "replace": "d2Upper = d2Lower + 1",
+ "with": "d2Upper = d2Lower + 2"
+ }
+ }
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/tools/CBZNonvacuity.lean b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/tools/CBZNonvacuity.lean
new file mode 100644
index 000000000..3efd43999
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/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/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/tools/cbz_lean_check.py b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/tools/cbz_lean_check.py
new file mode 100644
index 000000000..9c8365024
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/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/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/tools/formal_gate_check.py b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/tools/formal_gate_check.py
new file mode 100644
index 000000000..263d8674c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/tools/formal_gate_check.py
@@ -0,0 +1,403 @@
+#!/usr/bin/env python3
+"""Source-bound Lean evidence gate for the main-side formal package (stdlib only).
+
+Follows the contract of the Math- formal lane (docs/FORMAL_VERIFICATION.md,
+work item #95): a manifest is an evidence sidecar, not a scientific register.
+
+Default (source-only, no Lean run): the manifest is well formed and cannot
+self-award execution or review; every bound file matches its SHA-256; every
+Lean module is registered; no `sorry`, `native_decide` or `axiom` appears
+outside comments; the root module imports exactly the registered modules; the
+target inventory equals the theorem declarations found in those modules; every
+pinned informal source has a local byte copy with the recorded size and hash;
+every target's informal anchor is a verbatim substring of its source.
+
+`--run-lean`: additionally performs a fresh build of the pinned package, runs a
+transitive `#print axioms` audit restricted to propext / Classical.choice /
+Quot.sound, captures elaborated types, executes real negative controls
+(tightened inequalities, a wrong constant, `sorry`, an indirect custom axiom,
+`native_decide`) and writes logs plus a receipt under `.lake/formal-evidence/`.
+Only that receipt carries `kernel-checked`; the committed manifest says
+`proved`. A receipt from arbitrary input is untrusted until matched to the
+actual workflow run and checked Git commit.
+
+`--axioms-output FILE`: audit a captured `#print axioms` output without running
+Lean (for tests and split CI steps).
+
+`--alignment REVIEW.json`: validate an independently authored alignment record
+against the current manifest and scope digests. This checks structure,
+identity, coverage and lineage independence; it does not authenticate that the
+review happened and never promotes scientific status.
+
+Nothing here edits STATUS.md, PROOF_INDEX.md or any review verdict.
+"""
+from __future__ import annotations
+
+import argparse
+import hashlib
+import json
+import os
+from pathlib import Path, PurePosixPath
+import re
+import shutil
+import subprocess
+import sys
+
+ROOT = Path(__file__).resolve().parents[1]
+MANIFEST = "formal/manifest.json"
+ALLOWED = frozenset({"propext", "Classical.choice", "Quot.sound"})
+NAME = r"[A-Za-z_][A-Za-z0-9_.']*"
+AXIOM_LINE = re.compile(r"'(" + NAME + r")' (?:depends on axioms: \[([^\]]*)\]|does not depend on any axioms)")
+HEX40 = re.compile(r"[0-9a-f]{40}")
+HEX64 = re.compile(r"[0-9a-f]{64}")
+PUBLIC_REPOS = {"d6g8k5htny-coder/main", "d6g8k5htny-coder/Math-", "d6g8k5htny-coder/query-",
+ "d6g8k5htny-coder/meta-framework", "d6g8k5htny-coder/Universal-Law-Workspace"}
+THEOREM = re.compile(r"^(?:theorem|lemma)\s+(" + NAME + r")", re.M)
+NAMESPACE = re.compile(r"^namespace\s+(\S+)", re.M)
+TOOLCHAIN = "leanprover/lean4:v4.34.1"
+LEAN_COMMIT = "5045d0056413266e57c625dcd7c365b10e377c52"
+BUILD_DIR = ".lake"
+
+
+def sha(data: bytes) -> str:
+ return hashlib.sha256(data).hexdigest()
+
+
+def require(condition, message):
+ if not condition:
+ raise ValueError(message)
+
+
+def load_json(text: str):
+ def unique(pairs):
+ obj = {}
+ for key, value in pairs:
+ require(key not in obj, "duplicate JSON key: " + key)
+ obj[key] = value
+ return obj
+ return json.loads(text, object_pairs_hook=unique)
+
+
+def safe_path(root: Path, relative) -> Path:
+ require(isinstance(relative, str) and relative and "\\" not in relative, f"invalid path: {relative!r}")
+ pure = PurePosixPath(relative)
+ require(not pure.is_absolute() and ".." not in pure.parts and str(pure) == relative, f"unsafe path: {relative}")
+ path = root
+ for part in pure.parts:
+ path = path / part
+ require(not path.is_symlink(), f"symlink refused: {relative}")
+ require(path.is_file() and path.resolve().is_relative_to(root.resolve()), f"missing or escaping file: {relative}")
+ return path
+
+
+def strip_lean_comments(text: str) -> str:
+ """Remove `--` line comments and nested `/- -/` block comments. Comment text
+ cannot smuggle a proof term; the kernel audit of `sorryAx` is authoritative."""
+ out, i, depth, n = [], 0, 0, len(text)
+ while i < n:
+ two = text[i:i + 2]
+ if depth:
+ if two == "/-":
+ depth, i = depth + 1, i + 2
+ elif two == "-/":
+ depth, i = depth - 1, i + 2
+ else:
+ out.append("\n" if text[i] == "\n" else " ")
+ i += 1
+ elif two == "/-":
+ depth, i = 1, i + 2
+ elif two == "--":
+ end = text.find("\n", i)
+ i = n if end < 0 else end
+ else:
+ out.append(text[i])
+ i += 1
+ return "".join(out)
+
+
+def audit_axioms(text: str, targets: list) -> dict:
+ require(isinstance(targets, list) and targets and len(set(targets)) == len(targets), "empty or duplicate target list")
+ records = {}
+ for match in AXIOM_LINE.finditer(text):
+ name, raw = match.groups()
+ require(name in targets and name not in records, "unexpected or duplicate axiom target: " + name)
+ axioms = [] if raw is None or not raw.strip() else [a.strip() for a in raw.split(",")]
+ require(all(re.fullmatch(NAME, a) for a in axioms), "malformed axiom name")
+ require(set(axioms) <= ALLOWED, "forbidden transitive axiom: " + repr(sorted(set(axioms) - ALLOWED)))
+ records[name] = sorted(set(axioms))
+ require(not AXIOM_LINE.sub("", text).strip(), "unrecognized audit output")
+ require(set(records) == set(targets), "missing target axiom report")
+ return records
+
+
+def source_check(root: Path, manifest_rel: str = MANIFEST) -> tuple[dict, str, Path]:
+ root = root.resolve()
+ raw = safe_path(root, manifest_rel).read_bytes()
+ m = load_json(raw.decode("utf-8"))
+ require(m.get("schema_version") == 1 and m.get("scientific_effect") == "NONE", "invalid evidence schema")
+ require(m.get("scientific_status_authority") is False, "manifest must declare scientific_status_authority false")
+ require(m.get("formalization_status") == "proved" and m.get("alignment_status") == "PENDING_INDEPENDENT_REVIEW",
+ "source metadata cannot self-award execution or review")
+ for key in ("package", "package_root", "root_module", "lean_toolchain"):
+ require(isinstance(m.get(key), str) and m[key].strip(), key + " must be a nonempty string")
+ require(m["lean_toolchain"] == TOOLCHAIN, "unsupported Lean toolchain in manifest")
+ pkg_rel = m["package_root"]
+ pkg = root / pkg_rel
+ require(pkg.is_dir() and not pkg.is_symlink(), "package root missing")
+ files = m.get("files")
+ require(isinstance(files, dict) and files, "empty file manifest")
+ for name, digest in files.items():
+ require(isinstance(digest, str) and HEX64.fullmatch(digest), "invalid source hash: " + name)
+ require(sha(safe_path(root, name).read_bytes()) == digest, "source hash mismatch: " + name)
+ required = {f"{pkg_rel}/lean-toolchain", f"{pkg_rel}/lakefile.toml", f"{pkg_rel}/lake-manifest.json",
+ f"{pkg_rel}/{m['root_module']}.lean", f"{pkg_rel}/SCOPE.md", f"{pkg_rel}/GLOSSARY.md",
+ f"{pkg_rel}/README.md", "tools/formal_gate_check.py", "tests/test_formal_gate.py"}
+ require(required <= set(files), "unbound control or scope file: " + repr(sorted(required - set(files))))
+ require((pkg / "lean-toolchain").read_text(encoding="utf-8").strip() == TOOLCHAIN, "wrong Lean toolchain file")
+ lock = load_json((pkg / "lake-manifest.json").read_text(encoding="utf-8"))
+ packages = lock.get("packages", [])
+ require(isinstance(packages, list), "invalid lake manifest")
+ actual = {p["name"]: p["rev"] for p in packages}
+ require(len(actual) == len(packages), "duplicate dependency")
+ require(actual == m.get("dependency_revisions"), "dependency lock mismatch")
+ require(all(HEX40.fullmatch(v) for v in actual.values()), "unpinned dependency")
+ modules = m.get("source_modules")
+ require(isinstance(modules, list) and modules and len(set(modules)) == len(modules), "invalid source module list")
+ expected_root = "".join("import " + path[:-5].replace("/", ".") + "\n" for path in modules)
+ root_text = strip_lean_comments((pkg / (m["root_module"] + ".lean")).read_text(encoding="utf-8"))
+ require("".join(line + "\n" for line in root_text.splitlines() if line.strip()) == expected_root,
+ "root must only import registered modules")
+ names = []
+ for path in modules:
+ require(f"{pkg_rel}/{path}" in files and path.endswith(".lean"), "unbound source module: " + path)
+ text = strip_lean_comments((pkg / path).read_text(encoding="utf-8"))
+ require(not re.search(r"\bsorry\b", text), "sorry in " + path)
+ require(not re.search(r"\bnative_decide\b", text), "native_decide in " + path)
+ require(not re.search(r"^\s*axiom\b", text, re.M), "custom axiom declaration in " + path)
+ namespaces = NAMESPACE.findall(text)
+ require(len(namespaces) == 1, "each module must open exactly one namespace: " + path)
+ names.extend(namespaces[0] + "." + n for n in THEOREM.findall(text))
+ targets = m.get("targets")
+ require(isinstance(targets, list) and targets, "empty target list")
+ target_names = []
+ sources = {s["id"]: s for s in m.get("sources", [])} if isinstance(m.get("sources"), list) else None
+ require(isinstance(sources, dict) and sources, "sources must be a nonempty list")
+ source_text = {}
+ for s in m["sources"]:
+ require(set(s) == {"id", "repository", "commit", "path", "bytes", "sha256", "local_copy"}, "source rows have a fixed schema")
+ require(s["repository"] in PUBLIC_REPOS, "nonpublic source repository refused: " + str(s["repository"]))
+ require(isinstance(s["commit"], str) and HEX40.fullmatch(s["commit"]), "invalid commit for " + s["id"])
+ require(isinstance(s["sha256"], str) and HEX64.fullmatch(s["sha256"]), "invalid sha256 for " + s["id"])
+ require(type(s["bytes"]) is int and s["bytes"] > 0, "invalid byte count for " + s["id"])
+ payload = safe_path(root, s["local_copy"]).read_bytes()
+ require(len(payload) == s["bytes"] and sha(payload) == s["sha256"], "local copy differs from pinned bytes: " + s["id"])
+ require(s["local_copy"] in files, "pinned source copy not bound in files: " + s["local_copy"])
+ source_text[s["id"]] = payload.decode("utf-8")
+ for t in targets:
+ require(isinstance(t, dict) and set(t) == {"name", "module", "title", "source", "informal_anchor", "does_not_claim"},
+ "target rows have a fixed schema")
+ require(isinstance(t["name"], str) and re.fullmatch(NAME, t["name"]), "invalid target name")
+ require(t["module"] in modules, "target module not registered: " + t["name"])
+ for key in ("title", "does_not_claim"):
+ require(isinstance(t[key], str) and t[key].strip(), f"{t['name']}: {key} must be nonempty")
+ require(t["source"] in source_text, f"{t['name']}: unknown source")
+ require(isinstance(t["informal_anchor"], str) and t["informal_anchor"].strip(), f"{t['name']}: empty informal anchor")
+ require(t["informal_anchor"] in source_text[t["source"]], f"{t['name']}: informal anchor is not a verbatim substring of its source")
+ target_names.append(t["name"])
+ require(target_names == names, "target inventory differs from source declarations")
+ lean_files = {p.relative_to(pkg).as_posix() for p in pkg.rglob("*.lean") if BUILD_DIR not in p.relative_to(pkg).parts}
+ require(lean_files == set(modules) | {m["root_module"] + ".lean"}, "unregistered Lean module: " + repr(sorted(lean_files - set(modules) - {m['root_module'] + '.lean'})))
+ for p in pkg.rglob("*"):
+ rel = p.relative_to(root).as_posix()
+ if p.is_file() and BUILD_DIR not in p.relative_to(pkg).parts and rel not in files:
+ require(rel in set(m.get("unbound_files", [])), "file in package not bound or declared unbound: " + rel)
+ return m, sha(raw), pkg
+
+
+def lake_binary() -> str | None:
+ found = shutil.which("lake")
+ if found:
+ return found
+ candidate = Path.home() / ".elan/bin/lake"
+ return str(candidate) if candidate.is_file() else None
+
+
+def check_lean_version(text: str) -> str:
+ pin = re.fullmatch(r"leanprover/lean4:v(\d+\.\d+\.\d+)", TOOLCHAIN)
+ require(pin is not None, "unsupported pinned Lean toolchain")
+ version = text.strip()
+ record = (r"Lean \(version " + re.escape(pin.group(1))
+ + r", [A-Za-z0-9_.+-]+, commit " + LEAN_COMMIT + r", Release\)")
+ require(re.fullmatch(record, version) is not None,
+ "unexpected running Lean version")
+ return version
+
+
+def run(command, label, out: Path, cwd: Path, env, expect_success=True):
+ result = subprocess.run(command, cwd=cwd, text=True, stdout=subprocess.PIPE, stderr=subprocess.STDOUT, timeout=900, env=env)
+ (out / (label + ".log")).write_text(result.stdout, encoding="utf-8")
+ print(label + ": exit " + str(result.returncode), flush=True)
+ require((result.returncode == 0) == expect_success, "unexpected process outcome: " + label + "\n" + result.stdout[-6000:])
+ return result.stdout
+
+
+def negative_controls(m: dict, pkg: Path) -> dict:
+ """Real mutation controls: each must be rejected by Lean or by the axiom gate."""
+ root_import = "import " + m["root_module"] + "\n"
+ cases = {}
+ for label, spec in m.get("negative_controls", {}).items():
+ module_text = (pkg / spec["module"]).read_text(encoding="utf-8")
+ require(spec["replace"] in module_text, "negative control text not found: " + label)
+ cases[label] = (module_text.replace(spec["replace"], spec["with"]), False, None)
+ cases["sorry"] = (root_import + "theorem injected : False := by sorry\n#print axioms injected\n", True, "injected")
+ cases["custom_imported"] = (root_import + "axiom hiddenPremise : False\ntheorem middle : False := hiddenPremise\n"
+ "theorem injected : False := middle\n#print axioms injected\n", True, "injected")
+ cases["native"] = (root_import + "theorem injected : (2 : Nat) + 2 = 4 := by native_decide\n#print axioms injected\n", True, "injected")
+ return cases
+
+
+def execute(m: dict, digest: str, pkg: Path, root: Path) -> dict:
+ lake = lake_binary()
+ require(lake is not None, "lake not found on PATH or in ~/.elan/bin")
+ env = dict(os.environ, PATH=f"{Path(lake).parent}{os.pathsep}{os.environ.get('PATH', '')}")
+ out = pkg / BUILD_DIR / "formal-evidence"
+ out.mkdir(parents=True, exist_ok=True)
+ require(not (pkg / BUILD_DIR).is_symlink() and not (pkg / BUILD_DIR / "build").is_symlink(), "symlink build directory")
+ check_lean_version(run([lake, "env", "lean", "--version"], "preflight-version", out, pkg, env))
+ if (pkg / BUILD_DIR / "build").exists():
+ shutil.rmtree(pkg / BUILD_DIR / "build")
+ targets = [t["name"] for t in m["targets"]]
+ run([lake, "build"], "build", out, pkg, env)
+ run([lake, "env", "leanchecker", m["root_module"]], "leanchecker", out, pkg, env)
+ audit = out / "Audit.lean"
+ audit.write_text("import " + m["root_module"] + "\n" + "\n".join("#print axioms " + n for n in targets) + "\n", encoding="utf-8")
+ axioms = audit_axioms(run([lake, "env", "lean", str(audit)], "axioms", out, pkg, env), targets)
+ types = out / "Types.lean"
+ types.write_text("import " + m["root_module"] + "\nset_option pp.explicit true\n" + "\n".join("#check " + n for n in targets) + "\n", encoding="utf-8")
+ run([lake, "env", "lean", str(types)], "elaborated-types", out, pkg, env)
+ outcomes = {}
+ for label, (source, succeeds, target) in negative_controls(m, pkg).items():
+ path = out / (label + ".lean")
+ path.write_text(source, encoding="utf-8")
+ log = run([lake, "env", "lean", str(path)], label, out, pkg, env, succeeds)
+ if target:
+ matches = list(AXIOM_LINE.finditer(log))
+ require(matches, "negative control missing axiom report: " + label)
+ try:
+ audit_axioms("\n".join(x.group() for x in matches), [target])
+ except ValueError:
+ outcomes[label] = "REJECTED_BY_AXIOM_GATE"
+ else:
+ raise ValueError("negative control escaped: " + label)
+ else:
+ require("is false" in log or "unsolved goals" in log or "failed" in log, "negative control did not fail on its proof goal: " + label)
+ outcomes[label] = "REJECTED_BY_LEAN"
+ _, after, _ = source_check(root)
+ require(after == digest, "manifest changed during execution")
+ version = check_lean_version(run([lake, "env", "lean", "--version"], "version", out, pkg, env))
+ head = subprocess.run(["git", "rev-parse", "HEAD"], cwd=root, text=True, capture_output=True).stdout.strip()
+ require(HEX40.fullmatch(head or ""), "missing exact checked commit")
+ receipt = dict(schema_version=1, scientific_effect="NONE", scientific_status_authority=False,
+ package=m["package"], formalization_status="kernel-checked",
+ alignment_status="PENDING_INDEPENDENT_REVIEW", manifest_sha256=digest, checked_commit=head,
+ repository=os.environ.get("GITHUB_REPOSITORY"), workflow_run_id=os.environ.get("GITHUB_RUN_ID"),
+ lean_version=version, dependency_revisions=m["dependency_revisions"], axioms=axioms,
+ negative_controls=outcomes)
+ receipt["logs"] = {p.name: sha(p.read_bytes()) for p in sorted(out.glob("*.log"))}
+ (out / "receipt.json").write_text(json.dumps(receipt, indent=2, sort_keys=True) + "\n", encoding="utf-8")
+ return receipt
+
+
+def check_alignment(review: dict, manifest_digest: str, targets: list, scope_digest: str):
+ require(isinstance(review, dict), "review must be object")
+ require(review.get("disposition") == "ACCEPTED", "alignment not accepted")
+ require(review.get("manifest_sha256") == manifest_digest, "stale alignment manifest")
+ require(review.get("scope_sha256") == scope_digest, "stale alignment scope")
+ covered = review.get("targets", [])
+ require(isinstance(covered, list) and len(covered) == len(set(covered)) and set(covered) == set(targets), "partial or ambiguous review")
+ a, r = review.get("author", {}), review.get("reviewer", {})
+ for key in ("provider", "family", "agent"):
+ require(isinstance(a.get(key), str) and a[key].strip() and isinstance(r.get(key), str) and r[key].strip(), "missing review lineage")
+ require(a[key].strip().casefold() != r[key].strip().casefold(), "lineage not independent: " + key)
+ e = review.get("evidence", {})
+ require(isinstance(e.get("repository"), str) and re.fullmatch(r"[^/\s]+/[^/\s]+", e["repository"]), "missing evidence repo")
+ require(isinstance(e.get("commit"), str) and HEX40.fullmatch(e["commit"]), "mutable review ref")
+ require(isinstance(e.get("sha256"), str) and HEX64.fullmatch(e["sha256"]), "missing review hash")
+ require(isinstance(e.get("path"), str) and e["path"] and not PurePosixPath(e["path"]).is_absolute()
+ and ".." not in PurePosixPath(e["path"]).parts, "missing or unsafe review path")
+
+
+def render_alignment(m: dict) -> str:
+ lines = ["# Informal–formal alignment table", "",
+ f"Generated from `{MANIFEST}` by `tools/formal_gate_check.py --write-alignment`; do not hand-edit.",
+ "Each row pairs one Lean target with the verbatim informal text it is attached to. The kernel checks the",
+ "declaration; the independent alignment review (see REVIEW_LANE.md) checks that the declaration says what",
+ "the anchor says. Source-level formalization status of every row is `proved`; only a trusted run receipt",
+ "reports `kernel-checked`. Nothing here is a Layer 0 review outcome.", "",
+ "| Lean target | Title | Informal anchor | Source | Does not claim |", "|---|---|---|---|---|"]
+ for t in m["targets"]:
+ anchor = "`" + " ".join(t["informal_anchor"].split()).replace("`", "'").replace("|", "\\|") + "`"
+ cells = [f"`{t['name']}`", t["title"].replace("|", "\\|"), anchor, t["source"], t["does_not_claim"].replace("|", "\\|")]
+ lines.append("| " + " | ".join(cells) + " |")
+ lines.append("")
+ return "\n".join(lines)
+
+
+def refresh_hashes(root: Path, manifest_rel: str = MANIFEST) -> int:
+ path = safe_path(root, manifest_rel)
+ m = load_json(path.read_text(encoding="utf-8"))
+ changed = 0
+ for name in list(m["files"]):
+ digest = sha(safe_path(root, name).read_bytes())
+ if m["files"][name] != digest:
+ m["files"][name] = digest
+ changed += 1
+ path.write_text(json.dumps(m, indent=2, ensure_ascii=False) + "\n", encoding="utf-8")
+ return changed
+
+
+def main(argv=None) -> int:
+ p = argparse.ArgumentParser(description=__doc__, formatter_class=argparse.RawDescriptionHelpFormatter)
+ p.add_argument("--root", type=Path, default=ROOT)
+ p.add_argument("--manifest", default=MANIFEST)
+ p.add_argument("--run-lean", action="store_true", help="fresh build, leanchecker, axiom audit, negative controls, receipt")
+ p.add_argument("--axioms-output", type=Path, help="audit a captured #print axioms output without running Lean")
+ p.add_argument("--alignment", type=Path, help="validate an independently authored alignment record; never promotes science")
+ p.add_argument("--alignment-table", default="formal/ALIGNMENT.md", help="generated table to compare against the manifest")
+ p.add_argument("--write-alignment", action="store_true", help="regenerate the alignment table and exit")
+ p.add_argument("--refresh-hashes", action="store_true", help="rewrite manifest file hashes from disk and exit")
+ args = p.parse_args(argv)
+ root = args.root.resolve()
+ try:
+ if args.refresh_hashes:
+ print(f"updated {refresh_hashes(root, args.manifest)} file hashes in {args.manifest}")
+ return 0
+ m, digest, pkg = source_check(root, args.manifest)
+ if args.write_alignment:
+ (root / args.alignment_table).write_text(render_alignment(m), encoding="utf-8")
+ print("wrote " + args.alignment_table)
+ return 0
+ require(safe_path(root, args.alignment_table).read_text(encoding="utf-8") == render_alignment(m),
+ "alignment table differs from the manifest rendering; regenerate with --write-alignment")
+ if args.alignment:
+ check_alignment(load_json(args.alignment.read_text(encoding="utf-8")), digest,
+ [t["name"] for t in m["targets"]], m["files"][f"{m['package_root']}/SCOPE.md"])
+ print("ALIGNMENT_RECORD_STRUCTURE_PASS (identity, coverage and lineage only; the review itself must be retrieved and authenticated)")
+ if args.axioms_output:
+ axioms = audit_axioms(args.axioms_output.read_text(encoding="utf-8"), [t["name"] for t in m["targets"]])
+ print(json.dumps({"axiom_audit": axioms, "manifest_sha256": digest}, indent=2, sort_keys=True))
+ if args.run_lean:
+ print(json.dumps(execute(m, digest, pkg, root), indent=2, sort_keys=True))
+ elif not args.axioms_output:
+ print("SOURCE_IDENTITY_PASS (not a Lean build or scientific acceptance): " + digest)
+ print(json.dumps({"package": m["package"], "targets": len(m["targets"]), "sources": len(m["sources"]),
+ "formalization_status": m["formalization_status"], "alignment_status": m["alignment_status"]},
+ sort_keys=True))
+ except (ValueError, KeyError, TypeError, OSError, UnicodeDecodeError, subprocess.SubprocessError) as e:
+ print("FORMAL_GATE_FAIL: " + str(e), file=sys.stderr)
+ return 1
+ return 0
+
+
+if __name__ == "__main__":
+ sys.exit(main())
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition-optimized.stderr b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition-optimized.stderr
new file mode 100644
index 000000000..9db4d1ec1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition-optimized.stderr
@@ -0,0 +1,6 @@
+test_525_composition (test_graph_binding_check.Composition525Test.test_525_composition) ... ok
+
+----------------------------------------------------------------------
+Ran 1 test in 0.135s
+
+OK
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition-optimized.stdout b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition-optimized.stdout
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition.stderr b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition.stderr
new file mode 100644
index 000000000..3b05981d5
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition.stderr
@@ -0,0 +1,6 @@
+test_525_composition (test_graph_binding_check.Composition525Test.test_525_composition) ... ok
+
+----------------------------------------------------------------------
+Ran 1 test in 1.035s
+
+OK
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition.stdout b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition.stdout
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/museum-input-receipt.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/museum-input-receipt.json
new file mode 100644
index 000000000..491ee2812
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/museum-input-receipt.json
@@ -0,0 +1,243 @@
+{
+ "scope": "public pinned display inputs, never executed source/proof code",
+ "sources": [
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md",
+ "bytes": 17734,
+ "sha256": "380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "coefficients/side24_v1/PROOF.md",
+ "bytes": 10272,
+ "sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "frontiers/remote_window_20260924/PROOF.md",
+ "bytes": 18355,
+ "sha256": "a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "frontiers/rn_annulus_bridge_20260925/PROOF.md",
+ "bytes": 16948,
+ "sha256": "d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md",
+ "bytes": 17646,
+ "sha256": "1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md",
+ "bytes": 15902,
+ "sha256": "079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "frontiers/axial_density_20260925/PROOF.md",
+ "bytes": 10858,
+ "sha256": "8b9376a69fda9f0f231d9502be839ae45d8006d1891ff3e700fa521cc96f6cb4"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "reviews/downstream_boundary_20260925/TRANSVERSE_BOUND_CANDIDATE.md",
+ "bytes": 9902,
+ "sha256": "f64c954245f17bcbc64a5ccf58a60689cf2a2fd85362f8321c0f64ff66584e36"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "reviews/collision_mechanism_20260925/CUMULATIVE_TRANSFER_CORRECTION.md",
+ "bytes": 3272,
+ "sha256": "83f653393dc6245980f6848e2bfc65ac9ad4c7d8304b028b88764356fd3825b6"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md",
+ "bytes": 2266,
+ "sha256": "498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "frontiers/full_price_20260924/PROOF.md",
+ "bytes": 11352,
+ "sha256": "87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "PROOF_INDEX.md",
+ "bytes": 12708,
+ "sha256": "f9c4db77aeab1c61d2a0c02f88a964cbfc6be63d18619acf0e047c884e0c0249"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "claims/LANDING_CLAIMS.json",
+ "bytes": 16417,
+ "sha256": "c6fb2fa2bda1fdae9eeaaaf13008497921537b77aa4d4537aec30c9b961b989e"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "imports/hardening_ebedb780/EC-014/proof.md.export.txt",
+ "bytes": 11331,
+ "sha256": "c5e64b9ba3a906535f1ae58a161d594a427371599c102ae4a68849b087a2f62c"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "coefficients/side24_v1/ENCLOSURE.json",
+ "bytes": 1090,
+ "sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md",
+ "bytes": 15925,
+ "sha256": "69ea7a479a9e8a5150cbe07b373772ab22413a1d81194d5a6a78adf6ada5f03f"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md",
+ "bytes": 12741,
+ "sha256": "29a0c6d00ce739baf1d29a3163977d8e707e2079e216fba4fee3669cebec127d"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md",
+ "bytes": 10073,
+ "sha256": "04cf4c986f29ac7ac33b3cc87feac23f3cf494e0c1b3bf4476e4e6666de46574"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "reviews/replacement_20260925_pr19_pr21/REVIEW.md",
+ "bytes": 15615,
+ "sha256": "7ff9e4a028f24afc731200b14bc5b993c0a874906cf6ea25e8c890afed8cdc53"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "reviews/pr16_fixed_transverse_nonauthor_20260925/REVIEW.md",
+ "bytes": 12510,
+ "sha256": "20d6451412f304a20f70e0bc6aabb87bdd0bb9761b17834469d60867407ebd9c"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "reviews/d2_cumulative_correction_20260925/REVIEW.md",
+ "bytes": 3723,
+ "sha256": "910d371ebb4a310a7e2248348ba8cd09d6f3229740525d74ec7d06d8d1470717"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "reviews/p15_full_price_nonauthor_20260926/REVIEW.md",
+ "bytes": 15569,
+ "sha256": "691ea0db5c0f073326c9f7208c9804c6f5d0daf92ba7467529c9d57e08b15eb7"
+ },
+ {
+ "repository": "d6g8k5htny-coder/main",
+ "commit": "f2e432ea5c86742e480c66624775bc9103343314",
+ "path": "STATUS.md",
+ "bytes": 7655,
+ "sha256": "039d4fea921a5e9602340ab8580404ef709588ca72f45c52f865f4644da51da3"
+ },
+ {
+ "repository": "d6g8k5htny-coder/main",
+ "commit": "71400b94f6cb354a8cf7aba73ffede2138a64efa",
+ "path": "reviews/sard_g_successor_a1_a6_20260926/REVIEW.md",
+ "bytes": 25057,
+ "sha256": "894d27c0de6dd4312ea5109ac2480a68cb1b5ded0b4a60749d4edee2288fb537"
+ },
+ {
+ "repository": "d6g8k5htny-coder/main",
+ "commit": "71400b94f6cb354a8cf7aba73ffede2138a64efa",
+ "path": "incoming/side24-identity-replay-20260926/IDENTITY.json",
+ "bytes": 673,
+ "sha256": "6087bfe1ccc12bd52ebb169d00975ce44e846d611f0628333a0dbd71a4448176"
+ },
+ {
+ "repository": "d6g8k5htny-coder/main",
+ "commit": "71400b94f6cb354a8cf7aba73ffede2138a64efa",
+ "path": "incoming/side24-identity-replay-20260926/output.json",
+ "bytes": 362,
+ "sha256": "813bcf5d81e1d5d52d37c112df23716701809f03e7b55939a2afb2e8e57741be"
+ },
+ {
+ "repository": "d6g8k5htny-coder/main",
+ "commit": "71400b94f6cb354a8cf7aba73ffede2138a64efa",
+ "path": "docs/notebooks/SIDE24_PUBLIC_COEFFICIENTS.ipynb",
+ "bytes": 61961,
+ "sha256": "e348db8e9d667caff2a8da1d85ffd5ad599db34b34e542d9662d0bc1edc84024"
+ },
+ {
+ "repository": "d6g8k5htny-coder/main",
+ "commit": "71400b94f6cb354a8cf7aba73ffede2138a64efa",
+ "path": "incoming/side24-identity-replay-20260926/RESULT.md",
+ "bytes": 1118,
+ "sha256": "fa40a6b8afc413646081145d6d5d7b01cc4b5b4ddec32f4c6e82caa399e38cd8"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md",
+ "bytes": 40261,
+ "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7"
+ },
+ {
+ "repository": "d6g8k5htny-coder/main",
+ "commit": "a12c178c0f857a130cf434e9efd44233a038195b",
+ "path": "incoming/side24-chart-claude-20260926/RESULT.md",
+ "bytes": 10221,
+ "sha256": "3be14ca5013164e461a2bc72c317fd3694f94783826d4e5d8524d31133574502"
+ },
+ {
+ "repository": "d6g8k5htny-coder/main",
+ "commit": "a12c178c0f857a130cf434e9efd44233a038195b",
+ "path": "incoming/side24-chart-claude-20260926/IDENTITY.json",
+ "bytes": 1471,
+ "sha256": "b74bc2e52c065022a616823bd488827911bb4f116fe891b0f6efdd8a8d09147b"
+ },
+ {
+ "repository": "d6g8k5htny-coder/main",
+ "commit": "a12c178c0f857a130cf434e9efd44233a038195b",
+ "path": "incoming/side24-chart-claude-20260926/output.json",
+ "bytes": 1724,
+ "sha256": "478fb7620ea5947855006ab7af448010fdd5cc31581407b1f86d4b87ce5de2eb"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "82247833b5dd58e04291d55353b52938d73ec614",
+ "path": "reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md",
+ "bytes": 23312,
+ "sha256": "451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da"
+ },
+ {
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "d6628da09384728992dcbe6e921cc28ba85aebb0",
+ "path": "README.md",
+ "bytes": 6023,
+ "sha256": "89d4c618ad4560373f8fba3c787522cea8f0191fd8e176f3e0741c6230390730"
+ }
+ ]
+}
\ No newline at end of file
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/museum-inputs.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/museum-inputs.json
new file mode 100644
index 000000000..ecc48b0c5
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/museum-inputs.json
@@ -0,0 +1 @@
+{"https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md": "# A bounded unrestricted short-lifetime remainder

**Object:** LIFETIME-BOUNDED-REMAINDER-20260924-v1.  
**Author:** OpenAI / ChatGPT. **Disposition:** author-side derivation; nonauthor analytic review open.

## 1. Exact dependency and new conclusion

This is an additive successor to `UNIFORM-MATRIX-CAP-LIFETIME-20260924-v1`, main issue 63, Drive `1foDgiDi4XIKOfbrZEE8dWKV_BkZU8LIb`, SHA256 `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`. The unchanged deterministic import is `MARKED-CYLINDER-CAP-20260924-v1`, SHA256 `0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc`.

Use the parent's exact centered variance-one Gaussian field on the fixed torus X=R^d/(L Z^d), for each fixed d>=2 and L>0:

    K_L(z)=sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2).

Every constant below may depend on d,L. It need not be uniform as L or d varies. No infinite-volume theorem is asserted. Pins are M=-ru/2, S=ru/2, heights b and b-k r^3, and zero gradients at both points, with b in R, k>0 and u a unit vector. Q is the continuous Gaussian regression law, W=|det H_M det H_S| times the maximum/index-(d-1)-saddle indicator, and Z=E_Q W is the FULL normalizer. Let p denote the Q^W=(W/Z)Q probability of global ordinary elder pairing.

The marked Kac-Rice identity, pinned genericity, measurable elder convention and separating-cylinder implication are used exactly as in the parent. This note supplies quantitative estimates missing there; it is not independent acceptance of those interfaces. The coefficient c=c_{d,L} is exactly the parent's equation (15.2).

**Theorem R (candidate).** There are ell_*>0 and C<infinity such that versions of the unrestricted expected per-unit-volume densities satisfy, for 0<ell<=ell_*,

    |nu_cand(ell)-c ell^(-1/3)| <= C,
    0 <= nu_cand(ell)-nu_eld(ell) <= C,
    |nu_eld(ell)-c ell^(-1/3)| <= C.                       (R1)

Here candidates are ALL ordered maximum/index-(d-1)-saddle pairs with positive height gap ell, and selected pairs are all finite ordinary superlevel H0 bars. All birth heights, all positive gap marks, all orientations and all separations on the fixed torus are included. The essential global-maximum class is excluded.

Thus the relative error is O(ell^(1/3)). We do not prove convergence of the bounded remainder, identify a second coefficient, supply a numerical C or ell_*, or claim that the compact-window O(ell^(2/3)) selection difference holds without cutoffs. A bounded off-diagonal contribution need not vanish.

The mechanism is a quadratic determinant cancellation for a sqrt(r) off-diagonal Hessian block, combined with explicit k-dependence in an UNNORMALIZED cap-loss estimate. Neither a globally uniform lower bound for Z/r^2 over b,k nor a globally uniform Cr^3 pairing-probability constant is needed.

## 2. Symmetric contact observations give a second-order coupling

Use the exact parent observation transform U_r=T_r O_r. For a=-r/2,c=r/2 its axial rows are

    (f(a)+f(c))/2,
    (f(c)-f(a))/r,
    (f_x(c)-f_x(a))/r,
    (6/r^2)[f_x(a)+f_x(c)-2(f(c)-f(a))/r],

with transverse rows (f_yj(a)+f_yj(c))/2 and (f_yj(c)-f_yj(a))/r. Its absolute determinant is 12 r^(-(d+3)), and its target is

    v_r=(b-k r^3/2,-k r^2,0,12k,0,...,0).

At r=0 let U_0=(f,f_x,f_xx,f_xxx,f_y1,f_xy1,...), with target v_0=(b,0,0,12k,0,...). These are exact source conventions, including the factor 12.

All difference rules are centered. Taylor expansion with integral remainder gives U_r-U_0=O(r^2) in every finite L^p norm, uniformly over orthonormal frames. In particular the fourth axial row is f_xxx(0)+(r^2/40)f_xxxxx(0)+O(r^4), not an O(r) error or an unscaled residual. Cross-covariances with any fixed derivative order have the same second-order estimate.

A direct justification with no random-grid approximation uses the full positive Fourier expansion. Its coefficients satisfy sum_n sqrt(a_n)(1+|n|)^q<infinity for every fixed q. For each mode, the centered-rule error is bounded by C r^2 times a fixed higher power of |n|. Minkowski and this summability control the random series, derivative suprema and their moments. The same argument, with products of coefficients, controls deterministic covariance derivatives uniformly in position and frame.

Write Sigma_r=Cov(U_r), C_r(z)=Cov(F(z),U_r), where F is an unconditioned copy. The distinct contact functionals have positive covariance. Compactness of the frame space and convergence give, on one band 0<=r<=r_0, uniform positive lower/upper eigenvalue bounds and

    Sigma_r-Sigma_0=O(r^2),
    Sigma_r^(-1)-Sigma_0^(-1)=O(r^2),
    ||C_r-C_0||_{C^q}=O(r^2).                            (R2)

These covariance facts do not depend on b,k. Choose r_0<=1 inside the torus injectivity scale. On a common probability space set

    F_r=F+C_r Sigma_r^(-1)(v_r-U_r),
    F_0=F+C_0 Sigma_0^(-1)(v_0-U_0).                     (R3)

Gaussian regression shows that each F_r has the required law. Since |v_r-v_0|<=C r^2 k and |v_r|+|v_0|<=C(|b|+k), equations (R2)-(R3) imply, for finite p>=1 and each finite derivative order q,

    ||F_r-F_0||_{L^p(C^q)} <= C_{p,q} r^2 P,
    ||1+||F_r||_{C^q}+||F_0||_{C^q}||_p <= C_{p,q} P,
    P=1+|b|+k.                                          (R4)

This is a coupling of laws, not an assertion of equality of two conditioned fields or independence of endpoint variables.

Let pi_r be the density of U_r. For all b,k and r<=r_0,

    pi_r(v_r) <= C exp[-c(b^2+k^2)],
    |pi_r(v_r)-pi_0(v_0)|
       <= C r^2 P^2 exp[-c(b^2+k^2)].                    (R5)

To prove the difference estimate, interpolate the covariance and target linearly between r and 0. The covariance stays uniformly positive. The target keeps its 12k coordinate; its other nonzero height coordinate is b-theta*k*r^3/2, so its squared norm is uniformly coercive in b^2+k^2. Differentiating log Gaussian density gives a trace term O(r^2), a quadratic term O(r^2 P^2), and a target term O(r^2 kP). Integrating the derivative yields (R5), after reducing c. This explicitly handles arbitrarily large targets.

## 3. An index-filtered determinant is more stable than its inertia indicator

For a real symmetric n by n matrix H define

    F_j(H)=|det H| 1{H has exactly j negative eigenvalues},

and give it value zero on singular matrices. Two elementary lemmas suffice.

**Lemma R3.1.** For symmetric X,Y,

    |F_j(X)-F_j(Y)| <= n max(||X||,||Y||)^(n-1)||X-Y||.  (R6)

If their indices agree, this follows from the determinant difference bound (or both terms are zero). If their indices differ and one term is nonzero, the straight segment reaches a singular matrix Z. The same determinant bound from that endpoint to Z applies, with norm and distance bounded by those of the full segment. When an endpoint is singular the same reasoning applies directly. The determinant bound follows by telescoping columns and Hadamard's inequality. In particular the discontinuous inertia indicator itself was not assumed Lipschitz.

**Lemma R3.2 (quadratic off-diagonal cancellation).** For a symmetric (n-1) by (n-1) matrix A, scalar alpha, vector beta and t>=0, set

    K_t=[[alpha,sqrt(t) beta^T],[sqrt(t) beta,A]].

Then for every j and every r>=0,

    |F_j(K_r)-F_j(K_0)|
       <= r |beta^T adj(A) beta|.                        (R7)

Indeed det K_t=alpha det A-t beta^T adj(A) beta, INCLUDING singular A. If the endpoint indices agree, use the difference of absolute determinants. If only one endpoint contributes, a singular K_t lies in between by continuity of eigenvalues, and the affine determinant bounds the contributing endpoint by r times its slope. If the determinant is identically zero, both sides' filtered determinants are zero. The proof requires no inverse matrix and no lower eigenvalue margin.

A naive application of (R6) to the sqrt(r) entries would lose a square root. Equation (R7) is the stronger fact that prevents this loss, also as k tends to zero.

## 4. A refined all-mark intensity and contact error

Under (R3), put A_0=D_y^2 F_0(0), A_i=D_y^2 F_r(i),
alpha_i=F_r,xx(i)/r and beta_i=grad_y F_r,x(i)/r. Let D_r=diag(sqrt(r),I). Then

    K_i=D_r^(-1) H_i D_r^(-1)
       =[[alpha_i,sqrt(r) beta_i^T],[sqrt(r) beta_i,A_i]],
    |det H_i|/r=|det K_i|.

The exact gradient/height pin identities give

    |alpha_M+6k|+|alpha_S-6k| <= C r M4,
    ||beta_i|| <= M3/2.                                  (R8)

Equation (R4) and the endpoint displacement give a nonnegative random T>=1+k with all finite moments bounded by C_p P^p such that

    ||A_i-A_0||<=r T,
    ||A_i||+||A_0||+||beta_i||+M3+M4<=C T,
    |alpha_M+6k|+|alpha_S-6k|<=C r T.                     (R9)

For example T can include the C^4 norms in (R4) and r^(-2)||F_r-F_0||_{C^2}; the latter has the asserted uniform moments by (R4). No independence of T and A_0 is required here.

Use j=d at M and j=d-1 at S. First remove the off-diagonal block by (R7); then compare diag(alpha_i,A_i) with diag(+-6k,A_0) by (R6). Equations (R8)-(R9) yield an O(r T^d) filtered determinant error at each endpoint. The exact block determinant also gives

    F_j(K_i) <= C(k+r) T^d,
    F_d(diag(-6k,A_0)) <= C k T^(d-1),
    F_(d-1)(diag(6k,A_0)) <= C k T^(d-1).

The reference product is (6k)^2 det(A_0)^2 1{A_0<0}; no other transverse inertia can give both specified full indices. Multiplying the two estimates and taking expectations proves

    Z_r/r^2 <= C(k+r)^2 P^N,
    |Z_r/r^2-z_0(b,k,u)| <= C r(k+r) P^N,                (R10)

for a fixed finite integer N depending only on d. Thus, defining exactly as in the parent

    A_r(b,k,u)=12 pi_r(v_r) Z_r/r^2,
    A_0=12 pi_0(v_0) z_0,

there is a majorant H(b,k)=C P^N exp[-c(b^2+k^2)] (increasing N when necessary) with

    0<=A_r<=(k+r)^2 H,
    0<=A_0<=k^2 H,
    |A_r-A_0|<=r(k+r) H.                                (R11)

For the density difference term use (R5) and z_0<=C k^2 P^N; its r^2 k^2 factor is absorbed by r(k+r) times a further polynomial in P. These bounds hold for ALL b in R,k>0 and 0<r<=r_0. There is no division by k or Z in their proof.

## 5. The unnormalized cap-loss bound with its actual k dependence

Let G_r be the deterministic sufficient event

    lambda_min(-A_M) > (4/(3k)) r M3^2,
    r M4 <= 3k/10.

On typed support the cap theorem gives elder pairing on G_r. Define

    B_r=12 pi_r(v_r) E_Q[(W/r^2) 1{G_r^c}].

Always A_r(1-p_r)<=B_r<=A_r. We prove that with delta=r/k,

    B_r <= delta^3 H(b,k),       whenever delta<=1.       (R12)

The constants in (R12) are independent of b,k; their target growth is inside H. This is NOT a globally uniform normalized probability estimate.

Append the independent symmetric entries of A_M to U_r. The joint covariance is uniformly positive at contact and for r<=r_0, by distinct finite jets and compactness. Consequently its JOINT density obeys

    pi_r(v_r) density(A_M=A | U_r=v_r)
       <= C exp[-c(b^2+k^2+||A||_F^2)].                  (R13)

Regress the whole field on this appended vector. Its centered residual g is independent of that entire vector and has uniform C^4 moments of every finite order. Its mean has C^4 norm bounded by C(P+||A||). Set J=1+||g||_{C^4}, T=P+J. On A_M<0 write B=-A_M with eigenvalues 0<lambda_1<=...<=lambda_m=Lambda, m=d-1. Then h=M3 and M4 are at most K(T+Lambda), absorbing sqrt(m) into K. J is independent of B, though eigenvalues within B are not independent.

The exact parent determinant envelope is

    W/r^2 <= (h^2/4) lambda_1(lambda_1+3rh/2)
                      product_(j=2)^m lambda_j(lambda_j+rh). (R14)

For m>=2, failure of the depth condition implies

    0<lambda_1<=D delta(T+Lambda)^2,     D=4K^2/3.

Use symmetric-matrix Lebesgue eigenvalue coordinates. Their Vandermonde factor is at most Lambda^[m(m-1)/2] on the positive ordered domain, and (R13) supplies a Gaussian bound in all eigenvalues, uniformly in their eigenvectors. This is a Lebesgue change of variables, not a GOE claim. Put U=T+Lambda. All factors in (R14) except the first two soft factors are at most C U^(2m), for r<=1. After dropping the lambda_1 Gaussian factor, its integral is bounded by

    integral_0^(D delta U^2) lambda(lambda+E rU) d lambda
      = (D^3/3)delta^3 U^6+(ED^2/2)r delta^2 U^5.

Since r delta^2=k delta^3, both terms are bounded by delta^3 times a polynomial in P,J,Lambda. The Gaussian integration in lambda_2,...,lambda_m and finite moments of J give delta^3 H. The largest eigenvalue is integrated, not frozen at a chosen value. No lower cutoff on lambda_2 is used: every higher-corank intersection is included.

For m=1, lambda_1=Lambda=lambda. The scalar quadratic inequality is instead

    lambda<=D delta(T+lambda)^2
      => [lambda<=4D delta T^2] OR [lambda>1/(4D delta)]. (R15)

On the near branch delta<=1 gives h<=C T^2. Direct scalar integration of lambda(lambda+CrT^2), with width 4D delta T^2 and (R13), again gives delta^3 H, since r delta^2=k delta^3. For the FAR branch, fourth-moment Markov gives

    pi_r E_Q[(W/r^2) 1_far]
       <=(4D delta)^4 pi_r E_Q[(W/r^2)lambda^4]
       <=delta^4 H<=delta^3 H.

Joint moments here are bounded by polynomial Gaussian integrals from (R13), or directly by the target-growth regression bound. The scalar far branch was not discarded.

Finally the fourth-derivative exception M4>3/(10delta) gives

    pi_r E_Q[(W/r^2)1_exception]
       <=(10delta/3)^4 pi_r E_Q[(W/r^2)M4^4]
       <=delta^4 H<=delta^3 H.

These are weighted pointwise Markov inequalities, not Cauchy-Schwarz without a square root. Increasing the common polynomial degree and constants proves (R12).

## 6. Integrate candidate error over the entire mark domain

The exact parent polar/height/pin/determinant accounting gives r A_r dr db dk d sigma, with ordinary sphere area and no role-order factor 1/2. At lifetime ell set r=(ell/k)^(1/3). The near restriction r<=r_0 is k>=a, a=ell/r_0^3, and

    ell^(1/3) nu_cand^near(ell)
       = integral_(k>=a) A_(ell/k)^(1/3)/(3 k^(2/3)) db dk d sigma.

The full contact coefficient is integral A_0/(3 k^(2/3)) over all b,k>0,u. From (R11), the missing k<a contact mass is O(a^(7/3)). For the remaining difference the two monomials are exactly

    k^(-2/3) r k = ell^(1/3),
    k^(-2/3) r^2 = ell^(2/3) k^(-4/3).

Integrating H in b,k controls the first by C ell^(1/3). For the second, the integral from a to 1 is at most C a^(-1/3), and its tail is finite. Hence it is at most C ell^(2/3) a^(-1/3)=C r_0 ell^(1/3), up to another O(ell^(2/3)) tail. The a^(7/3) missing mass is smaller for small ell. Thus

    |ell^(1/3) nu_cand^near(ell)-c|<=C ell^(1/3).          (R16)

This is a rate proved from (R11), not an assigned rate for the parent's dominated convergence.

## 7. Integrate the actual pairing loss

Take eta=ell^(1/6), and shrink ell_* so that a<eta<1. For a<=k<=eta use B_r<=A_r and the first line of (R11), with (k+r)^2<=2k^2+2r^2. Its scaled contribution is

    C[eta^(7/3)+ell^(2/3) a^(-1/3)]
       <=C[ell^(7/18)+ell^(1/3)].                       (R17)

For k>=eta, delta=ell^(1/3)k^(-4/3)<=ell^(1/9)<=1. The loss estimate (R12) is therefore applicable, including large b,k. The scaled integrand is bounded by

    C ell k^(-14/3) H(b,k).

Its integral is at most C ell eta^(-11/3)=C ell^(7/18), plus a smaller Gaussian-tail term. Combining with (R17), since 7/18>1/3, gives

    0<=ell^(1/3)(nu_cand^near-nu_eld^near)<=C ell^(1/3).   (R18)

No normalized lower floor in the small-k region was used. The lower cutoff a must be retained: replacing it by zero in the r^2 k^(-2/3) term would create a divergent integral and lose the valid bound.

On torus separations at least r_0 the original full-pin covariance is uniformly positive, as in parent Section 14. The direct unconditioned height-density estimate there gives 0<=nu_eld^far<=nu_cand^far<=C for 0<ell<=1. Adding these terms to (R16)-(R18) proves (R1).

## 8. Quantitative consequences and exact limits

Per unit volume, integration of (R1) yields

    E N_eld(0,t] = (3/2)c t^(2/3)+O(t),
    0<=E N_cand-but-not-eld(0,t]<=C t.                   (R19)

For q>-2/3, the individual candidate and finite-bar q-moments obey

    E sum_(ell_i<=t) ell_i^q / Vol(X)
       = c t^(q+2/3)/(q+2/3)+O(t^(q+1)).                (R20)

For q>-1 the NONSELECTED counting measure alone has weighted mass at most C_q t^(q+1). This remains meaningful for -1<q<=-2/3 even though the two individual expectations diverge; it is not subtraction of infinities. It proves a sufficient p<1 inverse-lifetime integrability range for nonselected candidates, not an exact threshold.

The full individual inverse-lifetime threshold from the leading positive density remains p<2/3. No new fixed-r inverse-Hessian moment is inferred. This note supplies no RN expected-critical-count estimate and no original 24-jet certificate.

## 9. Review and validation interface

Critical review points are the second-order observation/coupling estimate (R4), the inertia-filtered affine determinant lemma (R7), target-uniform joint density (R13), both soft eigenvalue factors in (R14), the scalar far branch (R15), and the lower/upper k cutoffs in (R16)-(R18). Each is argued above, not delegated to numerical tests. The supplied finite exact tests check representative inertia transitions, covariance-free determinant identities, rational exponents and integration models. They do not verify continuum Gaussian estimates or independently accept the parent.

External background: Armentano, Azais and Leon, arXiv:2304.07424v3, Theorem 7.1 and Section 8.1, provide established Gaussian marked Kac-Rice context. The parent supplies its stated Borel-mark extension and event convention. The new determinant cancellation and rate argument are derived here; this bounded reconnaissance establishes no novelty or priority claim.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/coefficients/side24_v1/PROOF.md": "# SIDE24 coefficient in dimensions two and three

Object: SIDE24-COEFFICIENT-D23-20260924-v1. Author: OpenAI / ChatGPT.
Disposition: author-side coefficient-evaluation candidate; nonauthor review open.

## Scope and exact parent

This note evaluates the coefficient defined in equation (15.2) of
UNIFORM-MATRIX-CAP-LIFETIME-20260924-v1, SHA256
`9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`,
Drive ID `1foDgiDi4XIKOfbrZEE8dWKV_BkZU8LIb`, main issue63.
It does not independently accept that parent's global elder-selection or Kac-Rice
proof. Interpreting this coefficient as the finite-bar asymptotic constant remains
conditional on that proof. The parent source is not modified.

Use its centered variance-one field with the exact normalized covariance

    K_24(z) = sum_{n in Z^d} exp(-|z+24n|^2/2)
              / sum_{n in Z^d} exp(-|24n|^2/2),  d in {2,3}.

Let c_d,24 be precisely its equation (15.2), using ordinary sphere area, ordered
maximum/saddle roles and the full height/gradient pin Jacobian. Then the bounds
proved below, with endpoints rational decimal numbers, are

    0.07340691930603427103 < c_2,24 < 0.07340691930603427104,
    0.04177593184059834334 < c_3,24 < 0.04177593184059834335.

The uncertainty in these intervals is numerical/arithmetic uncertainty in this
specified expression, not a probability of correctness of the parent theorem.
No finite-radius error estimate, unrestricted remainder or RN/24-jet claim follows.

## 1. A nonperiodic reference coefficient with exact cone moments

Use K_infty(z)=exp(-|z|^2/2) only to define a reference CONTACT covariance and its
coefficient expression. No infinite-volume persistence theorem is asserted.
In an orthonormal frame with u=e1, covariance differentiation gives

    Cov(G)=I_d,
    Cov(H_ij,H_kl)=delta_ij delta_kl+delta_ik delta_jl+delta_il delta_jk,
    Var(t)=15,  Cov(t,G)=(-3,0,...,0),  t=partial_1^3 f.

Thus V=Hu has covariance diag(3,1,...,1), tau^2=Var(t|G=0)=6, and

    p_G(0) p_V(0) = (2pi)^(-d) / sqrt(3).

Writing m=d-1 and A for the transverse Hessian, Gaussian conditioning on V=0 gives

    Cov(A_ij,A_kl | V=0)
      = (2/3)delta_ij delta_kl + delta_ik delta_jl + delta_il delta_jk.

Equivalently A=Q+sqrt(2/3) Z I_m, with Q's diagonal variances2, off-diagonal
variances1, and independent upper-triangular entries, and Z an independent standard
normal. This explicitly specified reference law is not substituted for the actual
periodic law without an error bound.

For m=1 the variance of A is8/3. Centered Gaussian symmetry gives

    D_1=E[A^2 1{A<0}]=4/3.

For m=2 write A=[[s+x,y],[y,s-x]]. Then s,x,y are independent,
Var(s)=5/3 and Var(x)=Var(y)=1. The negative-definite cone is s<-R,
R=sqrt(x^2+y^2), and det A=s^2-R^2. The variable R^2 has density e^(-z/2)/2.
For a>=0, elementary integration gives

    integral_0^a (a-z)^2 e^(-z/2) dz/2 = a^2-4a+8-8e^(-a/2).

Using symmetry in s, E s^2=5/3, E s^4=25/3 and
E exp(-s^2/2)=sqrt(3/8), one obtains

    D_2 = (1/2)[25/3-20/3+8-8sqrt(3/8)]
        = 29/6-sqrt(6).

The truncation R<|s| is essential: half the UNTRUNCATED determinant-squared moment
would instead give29/6, an incorrect value. The shared scalar shift of the matrix
is likewise essential.

Substituting these moments and |S^1|=2pi, |S^2|=4pi into the exact parent coefficient
and simplifying 6^(2/3)/24^(1/3)=(3/2)^(1/3) gives

    c_d,ref = Gamma(7/6)*(3/2)^(1/3)*D_(d-1)
              / [2sqrt(3)*pi^(d-1)*sqrt(pi)], d=2,3.       (1)

This eliminates BOTH the angular and cone integrals for the reference expression.

## 2. A uniform, deterministic bound for every omitted periodic image

For q<=6 unit directional differentiations of phi(x)=exp(-|x|^2/2), product-rule
pairings bound the absolute derivative by

    e^(-|x|^2/2) sum_{j=0}^{floor(q/2)}
        q! |x|^(q-2j) / [2^j j! (q-2j)!].

At |x|>=1 this is at most76 |x|^6 e^(-|x|^2/2). The coefficient sum for q=6 is
1+15+45+15=76 and it bounds the smaller orders as well. At zero, every such
contraction has absolute value at most15.

For an integer point with maximum coordinate magnitude j>=1, there are at most
27j^3 possibilities for d<=3, |n|^6<=27j^6, and |n|^2>=j^2. Consequently

    sum_{n!=0} |n|^6 e^(-288|n|^2)
      <=729 sum_{j>=1} j^9 e^(-288j^2)
      <=1458 e^(-288).

The last step follows because successive terms have ratio at most512e^(-864)<1/2.
The code proves e^(288/125)>10 using the positive rational Taylor sum through20;
hence e^(-288)<10^(-125) and the geometric-ratio inequality follows too.

Normalizing by S=sum_n exp(-288|n|^2)>=1 costs the subtraction of
(S-1)D^q phi(0), which is included. Thus for EVERY unit-direction contraction,
including mixed directions, through total order6,

    |D^q K_24(0)-D^q K_infty(0)|
       < E := 1458*(76*24^6+15)*10^(-125)
        = 21175738586478 *10^(-125).                      (2)

This is a bound on the infinite image sum, not a sampled orientation or truncated
floating-point comparison. It applies to the exact variance-one normalization.

## 3. Full joint covariance and all orientations

Use the joint vector (G,t,svec H), where svec lists diagonal Hessian entries and
sqrt(2) times independent off-diagonal entries. Its dimension is at most10.
Each covariance entry differs from the reference by at most2E, by (2).
Hence the spectral norm of the difference is at most20E.

The reference Hessian block has eigenvalues d+2 on trace and2 on traceless matrices;
it is independent of the odd derivative block. The only nontrivial odd block is
[[1,-3],[-3,15]], whose eigenvalues are8 +/- sqrt(58). Its smaller eigenvalue exceeds
1/3: subtract I/3 and use first principal minor2/3 and determinant7/9.
All remaining gradient variances are1. Thus C_ref >= I/3 and

    (1-epsilon) C_ref <= C_24 <= (1+epsilon) C_ref,
    epsilon=10^(-108),   since60E<epsilon.                (3)

The inequalities are in the positive-semidefinite ordering and hold in every
orthonormal frame. No rotational invariance is asserted for C_24.

Multiplicative covariance inequalities pass to marginal linear observations and
to their conditional covariances. For the latter, the Schur-complement quadratic
form is the infimum over the conditioned-coordinate vector of the full quadratic
form, so taking infima preserves both inequalities in (3).
Therefore (3) controls the gradient density, the V density, tau^2, and the entire
conditional transverse covariance A|V=0 simultaneously.

## 4. Cone moments do not require perturbing the cone boundary

Let C be a centered covariance in n=m(m+1)/2 independent symmetric-matrix
coordinates, with (1-epsilon)C0<=C<=(1+epsilon)C0. Comparing Gaussian determinants
and inverse quadratic forms gives pointwise density bounds

    [(1-epsilon)/(1+epsilon)]^(n/2) phi_((1-epsilon)C0)
      <= phi_C
      <= [(1+epsilon)/(1-epsilon)]^(n/2) phi_((1+epsilon)C0).

Integrate the nonnegative function h(A)=det(A)^2 1{A<0}. Under covariance scaling
by a>0 its expectation scales by a^m, since h has degree2m and the cone is scale
invariant. Thus the exact conditional cone moment has the same bounds, multiplied
by (1-epsilon)^m D0 and (1+epsilon)^m D0 respectively. No continuity claim about
an indicator at a singular matrix is used.

Combining this with the two d-dimensional densities and tau^(4/3) yields an
integrand ratio between

    (1-epsilon)^a/(1+epsilon)^b and (1+epsilon)^a/(1-epsilon)^b,
    a=m+2/3+n/2,  b=d+n/2.

For d=2,3, a+2b<14 and2a+b<13. Since epsilon is far below1/28, elementary bounds
on log(1+epsilon), -log(1-epsilon) and exp give ratio between1-13epsilon and
1+28epsilon, hence safely between1-32epsilon and1+32epsilon. Angular integration
preserves these multiplicative bounds because every reference integrand is positive.
It follows that

    |c_d,24/c_d,ref -1| < 10^(-106), d=2,3.               (4)

The exact periodic constant is NOT claimed equal to the reference constant.
Equation (4) bounds it and justifies the numerical interval in this note.

## 5. Outward arithmetic and special-function remainder

`coefficient.py` uses only integer and Fraction arithmetic to obtain (1)-(4).
Every interval operation rounds outward to the rational grid10^(-80); negative
values use mathematical floor/ceiling rather than rounding toward zero. Floats and
booleans are rejected as inputs. Roots use exact integer root brackets.

Pi uses Machin's identity16atan(1/5)-4atan(1/239) with alternating-series remainder.
Log uses range reduction and the positive atanh series, with its geometric tail.
Exp uses reduction to[0,1/4], its positive Taylor series and a ratio-bounded tail;
negative arguments use reciprocal intervals.

Gamma(7/6) is obtained by shifting to z=199/6, using Stirling's LOG-gamma expansion
through B20, enclosing the remainder by the positive first omitted B22 term, then
subtracting the32 recurrence logarithms and exponentiating. The rigorous positive-
real remainder rule is NIST DLMF5.11(ii), and recurrence is DLMF5.5(i).
The periodization allowance in (4) is applied to exact rational endpoints BEFORE
the final outward rounding; it is not silently rounded to zero.
The displayed endpoints are outward rational decimal bounds, not rounded guesses.

The supplied unit tests and mutation runs are finite implementation/algebra checks.
They do not constitute formal verification or nonauthor analytic acceptance.
`ENCLOSURE.json` records the computed bounds and explicit scope.

## Review and remaining work

Nonauthor review should independently check the shared trace variance5/3, Rayleigh
cone integration, ordered-pair/gamma normalization inherited from the parent,
all-direction derivative bound, covariance and Schur-complement comparison, and
rational interval implementation. No frozen proof, review grade, RN/24-jet obligation,
P15 assertion or project completion flag is changed.

### External reconnaissance, 24 September 2026

Primary sources read: NIST DLMF5.11, especially equation5.11.1 and positive-real
remainder statement in5.11(ii); DLMF5.5 for the gamma recurrence. These are established
numerical-analysis inputs. The Gaussian covariance/cone and image comparison above
are derived here; no priority or novelty claim follows. Main issue63 and its exact
Drive source provide the project coefficient and conventions.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/frontiers/remote_window_20260924/PROOF.md": "# Remote critical points in a shrinking height window

**Object:** RN-FIXED-REMOTE-WINDOW-20260924-v1.  
**Author:** OpenAI / ChatGPT. **Disposition:** author-side proof candidate; nonauthor analytic review open.

[Research home](https://github.com/d6g8k5htny-coder/main) · [Math index](../../README.md) · [Earlier count interface](../three_fronts_20260924/RN_COUNT_INTERFACE.md)

## 1. The count and the new scope

The earlier RN count interface identified a three-determinant integral whose unnormalized numerator must be O(r^5), but did not bound it. This note supplies that bound for a precise part of the problem: **a fixed remote spatial region and the shrinking height window between the pinned maximum and saddle**. The spatial exclusion radius must not shrink with r.

Fix d>=2 and L>0. On X=R^d/(L Z^d), use the centered variance-one Gaussian field with the exact normalized periodic covariance

    K_L(z)=sum_(n in Z^d) exp(-|z+Ln|^2/2)
             / sum_(n in Z^d) exp(-|Ln|^2/2).

Fix compact B=[b_-,b_+] and K=[k_-,k_+] with 0<k_-<=k_+<infinity. Let R be any orthonormal frame, with axial direction u=Re_1. For small r>0 the pins are

    M=-(r/2)u, S=(r/2)u,
    f(M)=b, f(S)=b-k r^3, grad f(M)=grad f(S)=0.

Q_r denotes continuous Gaussian regression on these 2(d+1) observations. For a symmetric matrix H define

    F_j(H)=|det H| 1{H has j negative eigenvalues},

with value zero on singular matrices. Define the actual endpoint weight and FULL normalizer

    W_r=F_d(H_M) F_(d-1)(H_S),
    Z_r=E_(Q_r) W_r,             dQ_r^W=(W_r/Z_r)dQ_r.

There is no adjacency condition, no additional pin-density factor, and no Jacobian inside Z_r.

Fix 0<rho<L/4 and D_rho={x:dist_X(x,0)>=rho}. For a Borel E contained in D_rho and j in {0,...,d}, let

    N_(r,j)(E)=#{x in E: grad f(x)=0, index H_x=j,
                            b-k r^3<f(x)<b}.             (1)

Thus the height window shrinks; the spatial exclusion does not. Boundary heights may equivalently be included: their expected critical-point counts are zero by the height-density formula below. The set E is arbitrary; the uniform measure estimate even permits choosing different Borel E_r inside the SAME D_rho.

**Theorem A (fixed-remote mean measure).** There are r_*>0 and C<infinity, depending on d,L,rho,B,K, such that for r<=r_* and all b,k,R,j and Borel E subset D_rho,

    | E_(Q_r^W) N_(r,j)(E)/(k r^3)
           - integral_E Lambda_j(x;b,k,u) dx |
        <= C r |E|.                                      (2)

The explicitly defined contact kernel Lambda_j in Section 5 is continuous, finite and strictly positive. On these compact parameter sets it is bounded above and away from zero. In particular

    E_(Q_r^W) N_(r,j)(E) <= C k r^3 |E|,
    P_(Q_r^W){N_(r,j)(E)>=1} <= C k r^3 |E|.              (3)

For fixed E of positive volume the expected count is asymptotic to a strictly positive constant times r^3. This is NOT a matching lower bound on the event probability. Sum over the finitely many indices to count all critical types.

The normalized mean measures converge in total variation on D_rho at rate O(r): a density version differs uniformly from Lambda_j by O(r). No numerical value of C or r_* is supplied. No constant is claimed uniform as rho tends to zero, marks become unbounded, or d,L vary.

## 2. Exact observations and uniform remote nondegeneracy

Order the original axial observations as f(M),f_x(M),f(S),f_x(S), followed by pairs f_yj(M),f_yj(S). Use the centered transform

    U_r=[(f(M)+f(S))/2,
         (f(S)-f(M))/r,
         (f_x(S)-f_x(M))/r,
         (6/r^2){f_x(M)+f_x(S)-2(f(S)-f(M))/r},
         (f_yj(M)+f_yj(S))/2, (f_yj(S)-f_yj(M))/r for j].

It has absolute determinant 12 r^(-(d+3)) and target

    v_r=(b-k r^3/2,-k r^2,0,12k,0,...,0).

Its contact limit and target are

    U_0=(f,f_x,f_xx,f_xxx,f_yj,f_xyj for j) at 0,
    v_0=(b,0,0,12k,0,...,0).                              (4)

These are the exact conventions of the parent matrix-cap source, not a new normalization. Since U_r is an invertible re-expression of the original pins, conditioning on U_r=v_r gives the SAME Q_r. Its determinant does not get multiplied into the conditional count formula again.

Poisson summation gives strictly positive Fourier variances proportional to exp(-2pi^2|n|^2/L^2). All sums of their square roots times any fixed polynomial in |n| converge. The real Fourier series therefore has smooth versions and finite moments of every fixed derivative supremum.

Any finite collection of distinct derivative-evaluation functionals at distinct torus sites has positive covariance. A zero-variance linear combination would annihilate every Fourier mode, hence would be the zero distribution. Derivatives of point masses at distinct sites are independent, as tested by smooth functions with individually prescribed finite jets. At one site the rotated derivative monomials are independent; only independent symmetric Hessian entries are listed. This proves the assertion without a finite-mode or sampled-eigenvalue substitution.

For x in D_rho write Y_x=(grad f(x),f(x)). The joint vector (U_0,Y_x) has no repeated jet functionals and positive covariance. Its covariance varies continuously on the compact set O(d) x D_rho. It consequently has a uniform positive smallest eigenvalue and finite largest eigenvalue. The same holds after adjoining the independent entries of A_0=D_y^2 f(0) and H_x. These extra entries are distinct from the observations.

Centered differences imply U_r-U_0=O(r^2) in every finite L^p norm. More precisely, modewise Taylor remainder bounds and the Fourier summability above give second-order convergence of the observation covariance and its cross-covariances with any fixed derivative field, in every fixed C^q norm. For example the fourth axial row is f_xxx(0)+(r^2/40)f_xxxxx(0)+O(r^4). The bounds are uniform in frame and remote position.

Choose r_*<=rho and below the torus injectivity scale. Uniform convergence shows that the covariances of (U_r,Y_x), their inverses, and the relevant Schur complements are uniformly bounded and positive for r<=r_*. Every x stays at least rho/2 from both endpoints. The appended endpoint-transverse and witness-Hessian conditional covariances are also positive by their contact limits. These arguments use compactness, not rotational invariance of the torus.

## 3. A common regression coupling, with the extra height pin retained

For t in [b-k r^3,b], let V_r=(U_r,Y_x) have target a_r=(v_r,0,t). At contact take V_0=(U_0,Y_x) with target a_0=(v_0,0,b). If F is one unconditioned field copy, define

    F_(r,x,t)(z)=F(z)+Cov(F(z),V_r) Cov(V_r)^(-1)(a_r-V_r),
    F_(0,x,b)(z)=F(z)+Cov(F(z),V_0) Cov(V_0)^(-1)(a_0-V_0).

Each marginal has precisely the indicated conditional Gaussian law. All targets are bounded on the stated compact sets, and |a_r-a_0|<=C(r^2+|t-b|). Section 2 gives, for every fixed finite p>=1 and derivative order q,

    ||F_(r,x,t)-F_(0,x,b)||_(L^p(C^q)) <= C_(p,q) r^2,
    E[(1+||F_(r,x,t)||_(C^q)+||F_(0,x,b)||_(C^q))^p]<=C. (5)

Here |t-b|<=k_+ r^3 is included. The same construction without Y_x applies to the endpoint-only laws. The fields, their Hessians and remote observations are NOT declared independent; this is a coupling, not a factorization.

The conditional density p_(Y_x|U_r=v_r)(0,t) differs uniformly by O(r^2) from p_(Y_x|U_0=v_0)(0,b). To see this, the conditional means and covariances are Schur expressions in the uniformly positive joint covariance, and differ by O(r^2); t-b=O(r^3). On the bounded target/positive covariance domain the Gaussian density is continuously differentiable with bounded derivatives. In particular all these densities are uniformly bounded. No actual mean value is replaced by a zero mean unless the regression supplies it.

## 4. The endpoint weights vanish to second order even after remote conditioning

All extra conditional fields retain both original gradient pins and the exact height gap. Put

    alpha_i=f_xx(i)/r, beta_i=grad_y f_x(i)/r, A_i=D_y^2 f(i),
    H_i=[[r alpha_i,r beta_i^T],[r beta_i,A_i]].

The gradient integral identities give |alpha_i|,||beta_i||<=M3/2. The Hermite height identity forces an averaged f_xxx equal to 12k, whence

    alpha_M=-6k+O(r M4), alpha_S=6k+O(r M4).              (6)

All derivative moments in these bounds remain uniform under the EXTRA remote value and gradient pins by (5). This extra-conditioning verification is essential: an estimate established only under Q_r cannot simply be presumed uniform after Y_x has been fixed.

Let A_0 be the transverse block of F_(0,x,b) at 0. Equation (5), displacement of endpoints by r/2, and (6) show, in every fixed finite L^p norm,

    A_i-A_0=O(r), alpha_M+6k=O(r), alpha_S-6k=O(r),
    beta_i=O(1), H_x(F_(r,x,t))-H_x(F_(0,x,b))=O(r^2).    (7)

For clarity two purely deterministic facts are reproved. For symmetric X,Y,

    |F_j(X)-F_j(Y)|
       <= n max(||X||,||Y||)^(n-1)||X-Y||.               (8)

If one filtered determinant contributes and the indices differ, the segment from X to Y meets a singular matrix. The determinant difference bound between that endpoint and the singular matrix proves (8). Equal-index cases follow by the same determinant bound; if neither contributes the difference is zero. Thus the index indicator itself is not asserted Lipschitz.

For K_s=[[alpha,sqrt(s) beta^T],[sqrt(s) beta,A]],

    det K_s=alpha det A-s beta^T adj(A)beta,
    |F_j(K_r)-F_j(K_0)|<=r |beta^T adj(A)beta|.            (9)

The determinant is affine in s, including singular A. If an index changes, the continuous matrix path has a singular intermediate point and its affine determinant controls the contributing endpoint. If the determinant is identically zero both filtered determinants vanish. No inverse Hessian or lower eigenvalue bound occurs in (9).

With D_r=diag(sqrt(r),I), H_i=D_r K_i D_r. Congruence preserves inertia and det(D_r)^2=r. Remove the sqrt(r) block by (9), then compare each endpoint to its own filtered block-diagonal determinant F_d(diag(-6k,A_0)) and F_(d-1)(diag(6k,A_0)) by (8) and (7). Since k>0, each reference factor is 6k |det A_0|1{A_0<0}. Uniform higher moments and Holder control the product error, giving

    W_r/r^2 = w_0+O_(L^p)(r),
    w_0=(6k)^2(det A_0)^2 1{A_0<0}.                      (10)

No equality of the separate finite-r type indicators, and no independence of endpoint weights, is asserted.

Under the endpoint-only contact law, z_0=E[w_0|U_0=v_0] is continuous and strictly positive: the conditional law of A_0 has full density on an open negative-definite matrix ball. Compactness, k_->0, and the endpoint-only version of (10) give

    Z_r/r^2=z_0+O(r),     inf z_0>0,
    (Z_r/r^2)^(-1)=z_0^(-1)+O(r).                       (11)

This is the FULL normalizer, not a restriction to a geometric good event. The remote conditioning changes the law inside (10), not the denominator in (11).

## 5. Kac-Rice yields the actual bound and the limiting density

Apply Kac-Rice under Q_r to grad f(x) on the compact remote domain. Its conditional gradient covariance is uniformly nonsingular there. Use the endpoint determinant product as a field mark, and F_j(H_x) to incorporate the witness Jacobian and index. The endpoint and witness filtered determinants are continuous functions of finite jets by (8). Truncation and uniform Gaussian moments handle their polynomial growth. Approximate the height-window indicator by continuous functions and then use height disintegration; location restrictions extend to Borel sets as equality of the finite measures. The standard Gaussian weighted Kac-Rice formula therefore gives

    E_(Q_r^W) N_(r,j)(E)
      = (r^2/Z_r) integral_E integral_(b-k r^3)^b
          p_(Y_x|U_r=v_r)(0,t)
          E[(W_r/r^2) F_j(H_x)|U_r=v_r,Y_x=(0,t)] dt dx. (12)

An underlying critical-point Jacobian is counted exactly once through F_j(H_x). No separate |det H_x| should be multiplied into F_j. Endpoint weight is counted exactly once. The height disintegration uses dt, not a radial/pin Jacobian. Equality of (12) also establishes zero expected count at either single boundary height.

The contact kernel is

    Lambda_j(x;b,k,u)
      = p_(Y_x|U_0=v_0)(0,b)/z_0
          * E[w_0 F_j(H_x)|U_0=v_0,Y_x=(0,b)].           (13)

The dependence between A_0 and H_x is retained INSIDE this expectation. The contact field has a forced degenerate critical jet at 0 and is not a globally Morse field; no such claim is needed. Only its separated remote jets and their Gaussian density are used.

By (5),(8),(10), Holder and uniform moments, the expectation in (12) differs from its contact counterpart by O(r), uniformly in x,b,k,R,t. Multiply by the density estimate from Section 3 and (11); the complete integrand after r^2/Z_r differs uniformly from Lambda_j by O(r). Integrating over a window of exact length k r^3 proves (2). The unnormalized version of (12) has the explicit bound

    integral_E integral_window p_(Y_x|U_r)(0,t)
          E[W_r F_j(H_x)|U_r,Y_x] dt dx
        <= C k r^5 |E|.                                 (14)

This is the required three-determinant numerator for THIS declared spatial/height region. It is not deduced from a cap-failure probability. Markov is used only in the valid direction after the expectation is bounded, giving (3).

Continuity of Lambda_j follows from continuous nondegenerate Gaussian conditional parameters and polynomial moment domination, since the filtered determinants are continuous. Strict positivity follows from full conditional support of (A_0,H_x): use an open ball around A_0=-I and a separate open ball around a nonsingular H_x of index j. Their joint density is positive; it need not factor. Compactness supplies common positive lower and finite upper bounds. Invariance under changing the transverse frame follows from determinant/inertia invariance, so Lambda_j is a function of u. No global continuous choice of transverse frame over the sphere is required.

## 6. Several mutually separated witnesses

Fix an integer m>=2 and eta>0. Restrict the ordered location tuples to

    D_(rho,eta,m)={ (x1,...,xm): xi in D_rho,
                                      dist_X(xi,xj)>=eta for i!=j }.

The domain may be empty; then all corresponding quantities are zero. Count ordered distinct m-tuples of index-j critical points in the height window on this domain. Use the SAME endpoint weight W_r once, not its m-th power, and normalize by Z_r once. Append all Y_xi to U_r. Distinct-site jet rank and compact separation give the same uniform covariance, coupling and moment argument. Thus, writing T_(r,j,m,eta) for this ordered count,

    E_(Q_r^W) T_(r,j,m,eta)
      = (k r^3)^m integral_(D_(rho,eta,m)) Lambda_(j,m)(x1,...,xm) dx
          + O((k r^3)^m r).                              (15)

The coefficient uses the JOINT conditional density of all remote gradients/heights and the conditional expectation of w_0 times the product of the m witness filtered determinants, divided by z_0. It is not a product of one-point kernels. If the tuple domain has positive measure, its integral is strictly positive.

There are m+2 Hessian determinant factors, one O(r^2) endpoint product and m height-window integrations. The radius exponent is 2+3m-2=3m. Since each unordered qualifying m-set contributes m! ordered tuples,

    P(exists m pairwise-eta-separated qualifying points)
       <= E T_(r,j,m,eta)/m! = O(r^(3m)).                 (16)

For m=2 this supplies an O(r^6) bound on the probability of a separated pair. It does not control two nearly coincident witnesses. There is no uniformity as eta decreases to zero, no full factorial-moment bound, no matching probability lower bound, and no Poisson-limit claim.

## 7. RN crosswalk and remaining work

The earlier RN_COUNT_INTERFACE.md, SHA256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab, required an actual O(r^5) count numerator before division by Z~r^2. Equation (14) now supplies it for every fixed remote region and the entire BETWEEN-PIN HEIGHT WINDOW. Any additional 0/1 witness selector is bounded by this count when its type/location/value conditions imply (1). Arbitrary global selectors are not asserted to share the explicit positive leading kernel (13).

What remains outside this result:

- Spatial regions with distance from the pins tending to zero, including the intermediate annulus between a multiple of r and fixed rho. Compactness constants here may diverge there.
- Witness tuples whose mutual separation tends to zero; (15) does not control that collision.
- All remote critical points with NO shrinking height restriction. The r^3 window factor is absent for that different count.
- A numerical value of C or r_*, the original RN all-cell/24-jet enclosures, and a proof that a particular legacy witness definition lies in this note's count region.
- Independent analytic review of this note or any parent persistence theorem. A source checksum or green test cannot supply that review.

The Gaussian model and exact observation conventions are those of UNIFORM-MATRIX-CAP-LIFETIME-20260924-v1, SHA256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7. The weight stability algebra is reused, and rederived above, from LIFETIME-BOUNDED-REMAINDER-20260924-v1, SHA256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a. This proof does NOT consume their global elder-selection conclusion or the deterministic cap theorem. It treats the actual pinned law and remote critical-point count directly.

## 8. Attribution and test scope

Armentano, Azais and Leon, *On a general Kac-Rice formula for the measure of a level set*, arXiv:2304.07424v3, Theorem 7.1 and Section 8.1 supply the established Gaussian expected-integral/critical-point framework. The application to the stated pinned law, extra height disintegration, uniformity and endpoint scaling is argued here. This note claims no historical priority for Kac-Rice, Gaussian regression, rare-window scaling or factorial moment methods.

The standard-library exact tests check observation transforms, singular typed-determinant cases, conditional covariance calculations, dependence controls, height-window integration and ordered-count radius factors. They do not compute Lambda_j for the actual field, certify continuum bounds, or substitute for a mathematical review.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/frontiers/rn_annulus_bridge_20260925/PROOF.md": "# D5 all-height fixed-annulus bridge candidate

**Object:** D5-ALL-HEIGHT-ANNULUS-BRIDGE-20260925-v1.  
**Author:** OpenAI / ChatGPT, session OA-D5-ANNULUS-BRIDGE-20260925.  
**Disposition:** AUTHOR-SIDE ANALYTIC CANDIDATE; independent review pending.  
**Scientific effect:** NONE. No theorem/claim-status register is changed.

## 1. Statement and exact scope

Fix L>0 and the centered variance-one Gaussian field on the two-dimensional torus with covariance

    K_L(h) = sum_(n in Z^2) exp(-|h+Ln|^2/2)
             / sum_(n in Z^2) exp(-|Ln|^2/2).

Fix a compact birth interval, 0<k_-<=k<=k_+<infinity, and 1<A<B<infinity. For every orthonormal frame write f(x,z)=F(x e1+z e2), with midpoint zero. Impose exactly the six finite-r observations

    f(M)=b, f(S)=b-k r^3, grad f(M)=grad f(S)=0,
    M=(-r/2,0), S=(r/2,0).                                  (1)

Q_r denotes their continuous Gaussian regression law, not an adjacency law. For a symmetric 2x2 matrix put F_j(H)=|det H| times the indicator of negative index j, zero on singular matrices. Define

    W_r=F_2(H_M) F_1(H_S), Z_r=E_Qr W_r, dQ_r^W=(W_r/Z_r)dQ_r.

For a Borel set E in K_AB={(u,v): A<=sqrt(u^2+v^2)<=B}, let N_j(rE) count index-j critical points in rE at **all heights**.

**Candidate theorem.** There are C,r_*>0, uniform in the stated marks, frames, Borel E and j=0,1,2, such that

    E_(Q_r^W) N_j(rE) <= C r^3 area(E), 0<r<=r_*.           (2)

Equivalently, the physical-area weighted critical-point intensity satisfies rho_j^W(ru,rv)<=Cr throughout this fixed scaled annulus. Summing over indices only changes C. Markov gives an upper bound on witness existence, not a lower bound. The between-pin-height count is a subset and satisfies the same bound. Since k>=k_->0, (2) can also be written <=C' k r^3 area(E), but that rewriting uses k_-: **there is no height-window factor in the proof and no assertion uniform as k approaches zero**.

This addresses the fixed scaled-annulus region in d=2. It does not include pin neighborhoods, A approaching 1/2, B growing with r, intermediate physical distances r<<distance<<rho, witness-witness collisions, d>=3, uniform-L estimates, numerical all-cell certificates, elder selection or unrestricted lifetime acceptance. Choose r_* small enough that all local segments used below embed in the torus.

## 2. What was missing, and what is added

PR22's two-scale estimate controlled the conditional product of three Hessians by C delta^-6, leading to the physical intensity C r^-5 delta^-8 exp(-c/delta^2). That estimate alone retains an adverse r power on a strip of fixed positive scaled width.

The additional fact is deterministic: **three noncollinear zero gradients force all three Hessians to be small**. The Gaussian input must control the FULL conditional C3 norm after the witness gradient condition, not only endpoint-only moments. Combining the two facts supplies the factor

    min(1,(r/|v|)^6),                                      (3)

with value 1 at v=0. Splitting at |v|=r, not sending a fixed-chart constant to infinity, absorbs the remaining inverse powers into the Gaussian penalty. No new height conditioning or shrinking polynomial/logarithmic cutoff is needed.

All precursor sources remain unreviewed same-provider candidates. Sections 3-8 give the required arguments explicitly rather than treating those sources as accepted premises. The separate reviewer must verify these arguments, not infer their validity from matching implementations.

## 3. Uniform endpoint regression, moments and original Z

Let a=r/2, g(x)=f(x,0), h(x)=f_z(x,0). Let H_r be the cubic interpolating g and g' at +/-a, and L_r the affine interpolant of h at +/-a. Their midpoint coefficients form an invertible observation vector

    U_r=(H_r(0),H'_r(0),H''_r(0),H'''_r(0),L_r(0),L'_r(0)).

For arbitrary data define s0=(g(-a)+g(a))/2, d0=(g(a)-g(-a))/(2a), s1=(g'(-a)+g'(a))/2 and d1=(g'(a)-g'(-a))/(2a). Then

    U_r=(s0-a^2 d1/2,(3d0-s1)/2,d1,3(s1-d0)/a^2,L_r(0),L'_r(0)).

The exact target under (1) is

    v_r=(b-k r^3/2,-3k r^2/2,0,12k,0,0),
    H_r(x)=b-k r^3/2-3k r^2 x/2+2k x^3, L_r=0.            (4)

The finite-r targets are retained BEFORE rescaling. U_r converges in every fixed Lp at rate O(r^2) to U_0=(f,f_x,f_xx,f_xxx,f_z,f_xz)(0).

The covariance has strictly positive, Gaussian-decaying Fourier variances at every lattice mode. The sum of their square roots times any polynomial frequency weight is finite. Minkowski applied to the Fourier series therefore bounds every fixed C^m supremum in each finite Lp, uniformly over frames. For any distinct one-site derivative monomials, a zero-variance combination gives a polynomial symbol zero on the rotated lattice. Undo rotation and successively fix integer coordinates: that polynomial is identically zero. Thus the jet covariance is positive definite; compactness of O(2) gives uniform positive/finite bounds. At distinct sites the analogous statement follows from uniqueness of Fourier coefficients of distributions and isolation of the supports by test functions.

Taylor formulas justify the U_r convergence, including mixed covariances. Its inverse covariance and its C^m field cross-covariances are bounded. The Gaussian coupling

    F_Q = F + Cov(F,U_r) Cov(U_r)^-1 (v_r-U_r)

shows that all fixed C^m/Lp moments under Q_r remain uniformly bounded. This uses the whole local Taylor domain, including pins, midpoint and segments, rather than an annulus-only derivative bound.

For completeness the full endpoint-only normalizer has a uniform lower bound

    Z_r >= c_Z r^2.                                        (5)

Indeed, with A_r=f_zz(0), the exact finite-pin Taylor relations give, under Q_r,

    det H_M/r = -6k A_r+O_Lp(r),
    det H_S/r =  6k A_r+O_Lp(r),
    f_xx(M)/r = -6k+O_Lp(r).

For example f_xx(0)=-(r^2/24)f_xxxx(0)+O_Lp(r^4), f_xxx(0)=12k+O_Lp(r^2), and f_xz at the endpoints is O_Lp(r). Products of remainders are controlled with Holder. Appending f_zz to U_0 leaves distinct derivative monomials. Thus A_r has conditional variance bounded above and below and bounded mean, so Q_r(-2<=A_r<=-1)>=p0>0. Remove the events where any displayed error exceeds 3k_-; their union has probability O(r^p). On the remainder H_M is negative definite, H_S is indefinite, and both absolute determinants are >=3k_-r. This proves (5). No witness-conditioned quantity replaces Z_r.

## 4. Deterministic three-Hessian lemma

Assume grad f(M)=grad f(S)=grad f(X)=0, X=(ru,rv), |u|,|v|<=B and v!=0. Let M_3 bound the trilinear operator norm of D^3 f on a convex neighborhood of M,S,X.

Taylor's integral formula from M to S gives

    ||H_M e1|| <= r M_3/2.

Put d=(u+1/2,v). The formula from M to X gives

    ||H_M d|| <= r |d|^2 M_3/2.

Consequently

    |v| ||H_M e2|| <= r M_3 (|u+1/2|+|d|^2)/2.

Hessian Lipschitz control along the remaining segments yields

    max(||H_M||,||H_S||,||H_X||) <= C_B r M_3/|v|,          (6)

where, for example, a sufficiently generous choice is C_B=16(B+1)^2. Only a finite constant depending on B is used. Since |det H|<=||H||^2 in d=2,

    W_r F_j(H_X) <= C_B^6 r^6 |v|^-6 M_3^6.               (7)

Dropping types only increases the bound. Also, without noncollinearity,

    W_r F_j(H_X) <= M_2^6,                                 (8)

if M_2 bounds the Hessian norm everywhere on the local domain. Estimate (8) is the valid fallback on the axis. No division by v is made there. The lemma constrains all three Hessians; an endpoint-only smallness estimate would not suffice.

## 5. The stable two-scale Gaussian block near the axis

Fix 1<a0<B and use a0<=|u|<=B. At X=(ru,rv), set

    delta=sqrt(r^2+v^2), alpha=r/delta, beta=v/delta.

Define UNCONDITIONAL linear Gaussian observations

    Y1=[f_x(X)-H'_r(ru)-r v L'_r(0)]/(r^2 delta),
    Y2=[f_z(X)-L_r(ru)]/(r delta).                          (9)

The L'_r subtraction must be made before covariance calculations even though it vanishes at the prescribed pins. Under (1),

    grad f(X)=diag(r^2 delta,r delta)
                [Y+(6k(u^2-1/4)/delta,0)].                (10)

Write Q=f_xxxx(0), T=f_xxz(0), S=f_zz(0), A(u)=u(u^2-1/4)/6 and B(u)=(u^2-1/4)/2. The reuse of B(u) here is a polynomial, not the fixed outer annulus radius. To avoid ambiguity in calculations denote these polynomials A_u,B_u.

Exact quartic Hermite error and affine interpolation give

    g'(ru)-H'_r(ru)=r^3 A_u Q+O_Lp(r^4),
    h'(ru)-L'_r(0)=r u T+O_Lp(r^2),
    h(ru)-L_r(ru)=r^2 B_u T+O_Lp(r^3).

Expand in the physical transverse coordinate rv. The Y1 error is bounded by C(r^2+r|v|+v^2)/delta, and the Y2 error by C(r^2+r|v|+r v^2)/delta. Both are O_Lp(delta), uniformly in the aspect ratio. Thus

    Y = M(u,alpha,beta) (Q,T,S)^T + O_L2(delta),
    M = [A_u alpha, u beta, 0; 0, B_u alpha, beta].        (11)

Its three two-column minors are A_u B_u alpha^2, A_u alpha beta and u beta^2. Because alpha^2+beta^2=1, alpha>=0,

    det(M M^T) >= min(A_u^2 B_u^2,u^2)/2 > 0              (12)

uniformly on the compact longitudinal chart. The trace is bounded. The nine jets (U_0,Q,T,S) have uniformly positive covariance by Section 3. Hence the joint covariance of (U_r,Y), and the Schur complement Sigma=Cov_Qr(Y), have positive/finite eigenvalue bounds for delta<=delta0. The conditional mean m_Y is bounded. This proves uniformity also as alpha->0; using only the axial minor would not.

Let d(u)=6k(u^2-1/4)>=d_*>0. At zero gradient the Y target is tau=(-d(u)/delta,0). For small delta,

    |tau-m_Y|>=d_*/(2delta), |tau-m_Y|<=C/delta.

The exact Gaussian density and det diag(r^2 delta,r delta)=r^3 delta^2 give

    p_(grad f(X)|pins)(0) <= C r^-3 delta^-2 exp(-c/delta^2). (13)

This is a JOINT two-dimensional density, not a marginal small-ball probability.

## 6. The added conditional-field moment interface

The essential extension beyond a finite Hessian-vector estimate is

    E_Qr[M_2^6+M_3^6 | grad f(X)=0] <= C delta^-6.          (14)

Here M_2,M_3 may be bounded by a fixed multiple of ||F||_C3 on the whole torus. Under Q_r these supremum moments are uniformly finite. The conditional Y moments are uniformly bounded by (11) and its stable regression on U_r. For C(x)=Cov_Qr(F(x),Y), Cauchy-Schwarz bounds each derivative through degree three uniformly in x, so ||C||_C3<=C0.

Under Q_r define the Gaussian field residual

    R=F_Q-E_QF_Q-C Sigma^-1 (Y-m_Y).

It is independent of Y and has uniformly bounded C3/L6 norm: apply the triangle inequality to this explicit expression, bounded ||C Sigma^-1||_C3, and the uniform moments of F_Q and Y. Under the additional condition Y=tau the field has law

    E_QF_Q+C Sigma^-1(tau-m_Y)+R.

Its C3 sixth moment is <=C(1+|tau-m_Y|^6)<=C delta^-6. This proves (14) after *all* gradient pins. It does not assume independence between endpoint and witness Hessians. The regression construction retains the original pins and gives the exact additional zero gradient, so (6)-(8) hold under this conditional law.

Combining (7),(8),(14) gives

    E_Qr[W_r F_j(H_X) | grad f(X)=0]
      <= C delta^-6 min(1,(r/|v|)^6),                      (15)

where the minimum is defined to be 1 at v=0. Different constants in the two bounds are absorbed into C. This is the missing factor, not a new power inferred from unconditioned Hessians.

## 7. Weighted intensity, crossover and Gaussian absorption

For each fixed r>0 the annulus excludes M,S. Distinct-site derivative nondegeneracy and smooth Gaussian regression justify weighted Kac-Rice there. In detail, use the gradient as the zero-counted field and take the nonnegative mark W_r times the indicator of a nonsingular index-j witness Hessian. The endpoint filtered determinants are continuous through singular matrices (their determinant factors vanish); the witness type set is open. This mark is lower semicontinuous, and joint Gaussian regression supplies the requisite continuity. Truncation removes polynomial-growth restrictions. Height is not a mark in this application.

The exact intensity per physical area is

    rho_j^W(X)=Z_r^-1 p_(grad f(X)|pins)(0)
                  E_Qr[W_r F_j(H_X) | grad f(X)=0].       (16)

This formula is under the underlying Gaussian Q_r; the tilted Q_r^W is not declared Gaussian. Applying (5),(13),(15) proves

    rho_j^W(ru,rv)
      <= C r^-5 delta^-8 exp(-c/delta^2)
                         min(1,(r/|v|)^6).               (17)

Now split at the actual crossover |v|=r.

* If |v|<=r then r<=delta<=sqrt(2)r, so (17) is <=C r^-13 exp(-c/(2r^2)).
* If r<=|v| and delta<=delta0 then |v|<=delta<=sqrt(2)|v|, and (17) is <=C r |v|^-14 exp(-c/(2v^2)).

For every s,c0>0, the seventh positive term in exp(c0/s^2) gives

    exp(-c0/s^2) <= 7! c0^-7 s^14.                         (18)

Use (18) with s=r in the first case and s=|v| in the second. Both bounds become <=Cr. Thus there is a FIXED near-axis strip, not merely a shrinking-width region, on which

    rho_j^W(ru,rv) <= Cr                                  (19)

uniformly whenever a0<=|u|<=B and delta<=delta0. The constants are qualitative and may be large; no optimal power prefactor or numerical bound is claimed.

## 8. Off-axis chart and complete fixed-annulus cover

Choose a0=(A+1)/2>1 and epsilon>0 so small that sqrt(A^2-epsilon^2)>a0 and epsilon<=delta0/2. Then choose r_* small enough that r_*<=delta0/2. Every annulus point with |v|<=epsilon satisfies a0<|u|<=B and delta<delta0, so Section 7 applies.

On the complementary compact chart |v|>=epsilon, retain the finite-r pin corrections and use only

    J=(f_x(ru,rv)/r^2, f_z(ru,rv)/r).

With a=f_zz(0), q=f_xxz(0), c1=f_xzz(0), the expansion under Q_r is

    J = (6k(u^2-1/4)+q u v+c1 v^2/2, a v)+O_Lp(r).        (20)

The coefficient matrix on genuinely random jets (a,q,c1) is

    [0,u v,v^2/2; v,0,0].

Its minor in the a,c1 columns is -v^3/2, uniformly separated from zero on this chart. Appending these jets to U_0 preserves covariance positivity. Therefore J has uniformly bounded mean, positive covariance and bounded C3 field cross-covariance; conditioning J=0 yields a uniformly bounded C3 sixth moment. The raw gradient Jacobian is r^3, hence its density is <=Cr^-3. Equation (7) gives conditional triple weight <=Cr^6 since |v|>=epsilon. Divide by (5) to obtain rho_j^W<=Cr on the off-axis chart as well.

The two charts cover K_AB without a gap. Physical area is r^2 du dv, so (16),(19),(20) give (2) for every Borel E. Null boundaries can be assigned to either chart; the fixed-r intensity is absolutely continuous. There is exactly one endpoint normalizer and one witness determinant. No height-window Jacobian is multiplied into this all-height count.

## 9. Scope and independent-review requirements

This is a stronger local count candidate than the between-pin-height statement in PR16, but it has the SAME fixed d2/compact-mark/fixed-annulus restrictions. The estimate does not give a matching lower bound, a numerical constant/radius, a fixed-remote all-height bound, an all-scales RN theorem, a persistence partner statement or a 3D result. Its k_->0 dependence is essential to the Gaussian penalty.

The decisive review interfaces are: R1 exact unconditional subtraction and finite-r remainders in (9)-(11); R2 full-rank compactification (12); R3 conditional full-field moments after the large target (14); R4 deterministic three-Hessian bound (6)-(8); R5 ORIGINAL Z (5), not a witness-conditioned replacement; R6 weighted Kac-Rice and the absence of a height factor; R7 both crossover powers, absorption and complete annulus cover. Any unsupported interface prevents acceptance of (2).

## 10. Source relationships and external framework

Read source PR22 at b2e1652f1374c3b45759324a1ad1fd4177458500, `frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md` (SHA256079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d); PR16 at32b80ee085dc6a40113d1e46e333cda50d57ba21, `reviews/downstream_boundary_20260925/TRANSVERSE_BOUND_CANDIDATE.md` (blob024d927779f79fadaf932541ea6474f2995f8c50); and PR19 at e93eade078cac2e8b14aa39d402a3043b7cdb1c7. These are exposed same-provider author sources, not outside confirmation. Their files and review dispositions are unchanged by this package.

External framework inspected: Armentano, Azais and Leon, arXiv:2304.07424v3, Theorems 2.2 and 7.1, Remark 8 and section 8.1, https://arxiv.org/html/2304.07424v3. These supply the Gaussian/weighted expected-count framework and its hypotheses, not estimates (13)-(20). NIST DLMF 3.3, https://dlmf.nist.gov/3.3, is interpolation context only. No comprehensive novelty or priority claim is made.

The finite program verifies exact row/minor identities, raw six-pin interpolation, polynomial triple-gradient fixtures and exponent accounting, including deliberate omission controls. It is not a proof checker for the continuum argument, nor independent organizational review. A separate analyst must review the exact candidate source before it is consumed as a closed prerequisite.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md": "# D5 fixed scaled annulus: a height-window stitching candidate

**Object:** D5-FIXED-ANNULUS-STITCH-20260925-v1. **Author:** OpenAI / ChatGPT.
**Disposition:** AUTHOR-SIDE ANALYTIC CANDIDATE; independent analytic review OPEN.
**Scientific effect:** NONE. No global RN, elder-selection, lifetime, or historical numerical gate is closed by this file. The earlier PROOF.md and TWO_SCALE_ADDENDUM.md are unchanged.

## 1. Exact target, and what is stronger and weaker

Fix L>0 and the centered variance-one Gaussian field on R^2/(L Z^2) with FULL covariance

    K_L(h)=sum_{n in Z^2} exp(-|h+Ln|^2/2)
                         /sum_{n in Z^2} exp(-|Ln|^2/2).

For any orthonormal frame E write f(x,z)=F(x e1+z e2). Let b range over a fixed compact interval and 0<k_-<=k<=k_+<infinity. At M=(-r/2,0), S=(r/2,0) prescribe the six ORIGINAL pins

    f(M)=b, f(S)=b-k*r^3, grad f(M)=grad f(S)=0.            (A1)

Q_r is the continuous Gaussian regression law at (A1), not an elder/adjacency law. Define F_j(H)=|det H| times the indicator of nonsingular negative index j, zero on singular matrices, and

    W_r=F_2(H_M) F_1(H_S), Z_r=E_Qr W_r, dQ_r^W=(W_r/Z_r)dQ_r.

Fix 1<A0<B0<infinity and the entire scaled annulus

    K={ (u,t): A0<=sqrt(u^2+t^2)<=B0 }.

For a Borel E0 subset K let N_j(r E0) count index-j critical points in r E0 whose heights lie STRICTLY between b-k*r^3 and b. Here r E0 is embedded in the torus via the frame, with r sufficiently small.

**Candidate theorem.** There are C,r_*>0, uniform in the frame, compact marks, E0 and j=0,1,2, such that

    E_Qr^W N_j(r E0) <= C*k*r^3*area(E0),  0<r<=r_*.       (A2)

The all-index sum satisfies the same statement after changing C; Markov gives the corresponding existence-probability upper bound. Equivalently, the HEIGHT-RESTRICTED weighted intensity per physical area is at most C*k*r throughout the annulus, up to the usual density representative.

This removes a fixed-angle exclusion for this fixed scaled annulus at candidate scope. Unlike the earlier thin-tube result, (A2) is NOT an all-height assertion. The shrinking height window is essential in the outer part of the proof. Constants depend on L,A0,B0 and the mark compacts. There is no uniform-L, k down to zero, d>=3, pin-collision, r<<distance<<rho, multiple-witness, sharp coefficient, or numerical24-jet conclusion.

## 2. Stable Gaussian regression and the original normalizer

Let a=r/2, g(x)=f(x,0), h(x)=f_z(x,0). Let H_r interpolate the two values and two longitudinal slopes by a cubic, and L_r interpolate the transverse slopes by an affine function. For unconditioned observations put

    S0=(g(-a)+g(a))/2, D0=(g(a)-g(-a))/(2a),
    S1=(g'(-a)+g'(a))/2, D1=(g'(a)-g'(-a))/(2a),
    U_r=(S0-a^2 D1/2, (3D0-S1)/2, D1, 3(S1-D0)/a^2,
         (h(-a)+h(a))/2, (h(a)-h(-a))/(2a)).              (A3)

Evaluation of the interpolants recovers the six observations, proving invertibility. The exact target is

    v_r=(b-k*r^3/2, -(3/2)k*r^2, 0, 12k, 0, 0).          (A4)

In L^p for every fixed finite p, U_r=U_0+O(r^2), with

    U_0=(f,f_x,f_xx,f_xxx,f_z,f_xz)(0), v_0=(b,0,0,12k,0,0).

All Fourier weights of K_L are positive and decay Gaussianly. Their square roots times every fixed polynomial in frequency are summable, so every fixed derivative supremum has finite L^p moments. Distinct one-site derivative monomials have positive-definite covariance: a zero-variance combination would give a polynomial vanishing on every rotated lattice frequency, hence the zero polynomial. The compact set of frames gives uniform positive eigenvalue floors at fixed jet order.

Thus Cov(U_r)^-1 is uniformly bounded. The common-field Gaussian coupling

    f^(r)(s)=f(s)+Cov(f(s),U_r) Cov(U_r)^-1 (v_r-U_r)       (A5)

has law Q_r and uniformly bounded C^m moments at every fixed order on the torus. Covariance kernels and their derivatives in (A5) converge at order O(r^2); hence f^(r) couples to f^(0) in L^p(C^m) at that order. This follows directly by differentiating the finite-dimensional regression coefficients and using the Fourier-sum bounds. It does not impose a deterministic bound on a random derivative norm.

The finite-r pin identities, before scaling, include

    f_x(0)=-(r^2/8)f_xxx(0)+O_Lp(r^4),
    f_xx(0)=-(r^2/24)f_xxxx(0)+O_Lp(r^4),
    f_xxx(0)=12k+O_Lp(r^2), f(0)=b-k*r^3/2+O_Lp(r^4),
    f_z(0)=-(r^2/8)f_xxz(0)+O_Lp(r^4),
    f_xz(0)=-(r^2/24)f_xxxz(0)+O_Lp(r^4).                (A6)

They follow by adding/subtracting the symmetric endpoint slope/height Taylor formulas; the derivative moments in (A5) justify their remainders. In particular, with S_r=f_zz(0), under endpoint-only conditioning,

    det H_M/r=-6k*S_r+O_Lp(r), det H_S/r=6k*S_r+O_Lp(r),
    f_xx(M)/r=-6k+O_Lp(r).                               (A7)

S_r is Gaussian with mean bounded and variance uniformly bounded above and below. Therefore P_Qr(-2<=S_r<=-1)>=p0>0. On this event, excluding determinant errors exceeding 3k_- and longitudinal-diagonal errors exceeding 3k_- removes only O(r^p) probability. On the remaining positive-probability event H_M is negative definite, det H_S<0, and both absolute determinants are >=3k_- r. Consequently

    Z_r>=c_Z*r^2.                                       (A8)

This is the FULL normalizer under (A1), not after witness conditioning. Its upper finiteness follows from the same moment bounds. No numerical eigenfloor or prior acceptance is imported.

## 3. Retain the height: the three-row contact vector

All variables in this section are under Q_r; no zero pin target is substituted into an UNCONDITIONED covariance. At X=(ru,rt) set

    J_r=( f_x(X)/r^2, f_z(X)/r,
          [f(X)-b-(r*t/2)f_z(X)]/r^3 ).                 (A9)

For bounded u,t, (A6) and multivariate Taylor imply uniform L^p expansions

    f_x(X)/r^2=6k(u^2-1/4)+u*t*T+(t^2/2)*C+O_Lp(r),
    f_z(X)=r*t*S+r^2[(u^2-1/4)T/2+u*t*C+t^2*D/2]+O_Lp(r^3),
    f(X)-b=r^2*t^2*S/2+r^3[k(2u^3-3u/2-1/2)
             +(u^2-1/4)t*T/2+u*t^2*C/2+t^3*D/6]+O_Lp(r^4),

where S=f_zz(0), T=f_xxz(0), C=f_xzz(0), D=f_zzz(0). The quadratic height cancels in (A9), as does the C contribution to its third row. In the coupling (A5),

    J_r = d(u,k)+M(u,t) V_0+O_L2(r),                    (A10)
    d=(6k(u^2-1/4),0,k(2u^3-3u/2-1/2)),
    V_0=(S,T,C,D) under U_0=v_0,
    M=[ 0        u*t            t^2/2     0      ]
      [ t         0               0       0      ]
      [ 0  (u^2-1/4)*t/4          0      -t^3/12 ].

The four V_0 jets are independent modulo the six U_0 derivatives; their conditional covariance G obeys lambda I<=G<=Lambda I uniformly in frame. Means are uniformly bounded. Hence J_r has uniformly bounded L^p norms, and

    ||Cov_Qr(J_r)-M G M^T|| <= C*r                      (A11)

uniformly on the entire bounded scaled region. The O(r) comparison is absolute, not falsely asserted relative to a vanishing covariance.

The minor of M on columns (S,C,D) is exactly t^6/24. Cauchy-Binet gives det(M M^T)>=t^12/576. Its largest eigenvalue is uniformly bounded for |u|,|t|<=B0. Therefore, with changed constants,

    lambda_min(M G M^T)>=c*|t|^12.                     (A12)

The exponent 12 is deliberately conservative. Optimizing it is unnecessary for this proof. It is positive for every nonzero t, including u=0; it does NOT cover t=0.

## 4. An explicit shrinking cutoff makes perturbation uniform

Choose q=1/24 and h_r=r^q. For |t|>=h_r and r<=1,

    r/|t|^12 <= r^(1-12q)=r^(1/2) -> 0.                (A13)

Combining (A11)-(A13) and shrinking r_* to absorb the constants gives

    Sigma_r=Cov_Qr(J_r)>=c1*|t|^12 I,
    ||Sigma_r^-1||<=C*|t|^-12, det(Sigma_r)^-1/2<=C*|t|^-18.  (A14)

These estimates also hold away from a fixed small axis neighborhood by compactness. There is no substitution of a shrinking eta into unspecified PR16 constants. The cutoff is selected AFTER deriving the explicit eigenfloor and O(r) perturbation. A q with 12q>=1 would not justify this perturbation step.

## 5. The joint height density keeps the rare-gradient exponential

Choose A1=(A0+1)/2>1. Fix epsilon>0 sufficiently small that epsilon<1, epsilon^2<A0^2-A1^2, and the mean estimate below holds. On K with |t|<=epsilon, necessarily |u|>=A1. Write d0=6k_-(A1^2-1/4)>0. From (A10) and bounded jet means,

    E_Qr J_r1 >= d0-C(|t|+r) >= d0/2,
    Var_Qr J_r1 <= C*(t^2+r^2).                         (A15)

The variance estimate uses the O_L2(r) remainder and the t factors in the first random contact row. On h_r<=|t|<=epsilon, r<=|t|, so Var J_r1<=C*t^2.

At witness gradient zero and height f(X)=b+r^3*tau, the J_r target is y=(0,0,tau), tau in [-k,0], a fixed compact range. For any positive covariance Sigma and vector z,

    z^T Sigma^-1 z >= z_1^2/Sigma_11                    (A16)

by Cauchy-Schwarz applied to Sigma^(1/2)e1 and Sigma^(-1/2)z. Thus (A15) supplies exp(-c/t^2) in the FULL three-dimensional Gaussian density at y, regardless of correlations with height. Together with (A14) and the exact determinant r^-6 of the affine map (f_x,f_z,f)->J_r,

    p_(grad,height)|pins(0,b+r^3*tau)
        <= C*r^-6*|t|^-18*exp(-c/t^2)                  (A17)

on the outer part of the small axis neighborhood. Away from |t|<=epsilon, the same argument without the exponential gives p<=C*r^-6 with constants depending on epsilon. We never infer a joint density bound from a marginal alone: the joint determinant is bounded separately by (A14).

## 6. Account for all three Hessians after gradient AND height pins

Let M3 be the supremum norm of third derivatives on a local convex ball containing M,S,X. Under the three zero-gradient constraints, deterministic Taylor identities give

    ||H_M e1||<=C*r*M3,
    ||H_M (u+1/2,t)^T||<=C*r*M3.

The two-direction matrix has determinant t. For t!=0,

    ||H_M||+||H_S||+||H_X|| <= C*r*|t|^-1*M3,           (A18)

using Hessian Lipschitz control between these points. The constant is uniform for bounded u,t. Therefore the typed determinant product is bounded, pointwise under the constrained law, by

    W_r F_j(H_X) <= C*r^6*|t|^-6*M3^6.                  (A19)

Smallness of an endpoint-only Hessian is NOT simply reused after extra conditioning.

To control M3 after the additional pins, start with the Q_r field in (A5). Its C3 moments and J_r moments are uniformly bounded. For every derivative through order three, the supremum of its covariance with J_r is bounded by Cauchy-Schwarz. Gaussian regression at J_r=y represents the additional conditional field as

    f^*=f^(r)+Cov_Qr(f^(r),J_r) Sigma_r^-1 (y-J_r).

This coupling retains all original pins and imposes the actual witness pins. By (A14), Minkowski, and bounded sixth moments of y-J_r,

    E[M3^6 | original pins, grad=0, height=b+r^3*tau]
        <= C*|t|^-72                                  (A20)

for h_r<=|t|<=epsilon. This is intentionally crude and includes possible large conditional means. Combining (A19)-(A20) gives a single, correlated triple-determinant expectation <=C*r^6*|t|^-78. No independence or factorization of endpoint and witness Hessians is assumed. On |t|>=epsilon the same reasoning gives <=C*r^6.

## 7. Weighted Kac-Rice yields a bounded angular envelope

At each fixed r>0 the annulus stays away from the pinned sites. Distinct-site derivative distributions are independent for this periodic field: if a finite distribution annihilates every Fourier mode, it is zero, and local test functions isolate its coefficients. This proves the needed positive finite-r gradient/value/Hessian covariance off the pins. Smooth Gaussian regression provides continuous conditional laws. The joint gradient and symmetric-Hessian jet is the relevant subspace, not an unconstrained vector derivative space.

Apply the weighted Kac-Rice formula to the gradient under Q_r with nonnegative weight W_r times the nonsingular index indicator and the open height-window indicator. Equivalently augment the auxiliary Gaussian field with f, its Hessians, and the endpoint Hessians. These weights are lower semicontinuous on the nonsingular index sets and can be truncated and approximated from below; continuous Gaussian regression checks the conditional-law requirement. Disintegrating the witness height then gives

    rho_win,j^W(X)=Z_r^-1 int_(b-k*r^3)^b
       p_(grad,height)|pins(0,s)
       E_Qr[W_r F_j(H_X) | grad=0,height=s] ds.          (A21)

One may use Armentano--Azais--Leon, arXiv:2304.07424v3, Theorem 7.1 with Theorem 2.2, and the critical-point example in Section 8.1. The paper supplies the integration framework; the actual r,t-uniform bounds are proved here. No formula for almost every gradient level is substituted for the required zero-gradient level.

For h_r<=|t|<=epsilon, (A8),(A17),(A19)-(A20), and the ACTUAL height interval of length k*r^3 give

    rho_win,j^W(ru,rt)
       <= C*k*r * |t|^-96 * exp(-c/t^2).                (A22)

The angular exponent is 18+72+6=96. Although this polynomial cost is large, its product with the exponential is uniformly bounded for 0<|t|<=epsilon. For example, e^y>=y^48/48! gives

    |t|^-96 exp(-c/t^2) <= 48!*c^-48.                  (A23)

Consequently rho_win,j^W<=C*k*r on this entire shrinking-cutoff outer region. For |t|>=epsilon, fixed-angle covariance and (A18)-(A20) yield the same bound directly. The r ledger is density -6, triple determinants +6, height +3, original normalizer -2: physical-area intensity +1.

## 8. Inner strip: all-height suppression is enough

It remains to handle |t|<h_r, where |u|>=A1 for small r. This is exactly the two-scale regime; the following summarizes its proved-in-package candidate ingredients without assuming outside review acceptance.

Put delta=sqrt(r^2+t^2), alpha=r/delta, beta=t/delta. Before unconditional covariance analysis subtract H'_r(ru)+r*t*L'_r(0) from f_x and L_r(ru) from f_z, then divide by (r^2*delta,r*delta). The joint contact rows on the genuinely random jets (f_xxxx,f_xxz,f_zz) are

    [u(u^2-1/4)*alpha/6, u*beta, 0],
    [0,(u^2-1/4)*alpha/2,beta].                         (A24)

Taylor remainders are O_L2(delta) uniformly in the aspect ratio: the first component's error is bounded by C(r^2+r|t|+t^2)/delta, the second by C(r^2+r|t|+r*t^2)/delta. The three minors, with a=u(u^2-1/4)/6 and b=(u^2-1/4)/2, are ab*alpha^2,a*alpha*beta,u*beta^2. Their squared sum is bounded below by c(alpha^4+beta^4)>=c/2. Thus the conditional covariance is uniformly positive, while its Gaussian target has size at least c/delta, after allowing a bounded mean. The raw gradient density is <=C*r^-3*delta^-2*exp(-c/delta^2).

For all three Hessians, conditional regression under this rare gradient target gives O(delta^-1) means and bounded covariance, so the single determinant-product expectation is <=C*delta^-6. With the original normalizer (A8), the ALL-HEIGHT physical-area intensity satisfies

    rho_all,j^W(ru,rt)<=C*r^-5*delta^-8*exp(-c/delta^2). (A25)

Detailed derivations are in unchanged TWO_SCALE_ADDENDUM.md Sections 2--7. In this inner strip, r<=delta and delta^2<=2r^(1/12), hence

    rho_all,j^W<=C*r^-13*exp[-c/(2*r^(1/12))]<=C*r.     (A26)

The last step follows explicitly from e^y>=y^168/168!, producing a factor C*r^14. Constants may be huge but finite; no usable numerical radius is claimed. A height restriction only decreases this intensity. Since k>=k_->0, C*r can be written C'*k*r with C'=C/k_-. This does NOT give uniformity as k tends to zero.

## 9. Conclusion, remaining review, and non-extrapolation

Equations (A22)-(A26) cover every point in the fixed scaled annulus. Integrating rho_win,j^W<=C*k*r over r E0, whose physical area is r^2 area(E0), proves the candidate (A2). Boundary lines can be assigned to either region; the count measure is absolutely continuous by Kac-Rice, so fixed area-null boundaries have zero expected count.

The proof uses TWO different strengths: a height-restricted, three-Hessian cancellation outside h_r, and an all-height exponential bound inside h_r. It does not give all-height O(r^3) over the full annulus, a positive leading coefficient, or a matching probability lower bound.

Scope covered at author-candidate level: one witness in each fixed scaled annulus A0>1,B0<infinity, d=2, full periodic covariance at fixed L, compact positive marks. Scope still excluded: pin neighborhoods and scaled radii near the pinned sites, a limit B0->infinity, r<<distance<<rho, simultaneous witness collisions, d>=3, k_->0, uniform torus-size/field-class limits, numerical24-jet constants, or persistence elder pairing. This is downstream D5 candidate work, not activation of main#94.

Independent review must check: R1 full six-pin regression and original normalizer; R2 conditioned-law expansion (A10) and O(r) covariance perturbation; R3 contact eigenfloor and cutoff constants; R4 full joint density with retained exponential; R5 deterministic three-gradient Hessian lemma and extra-conditioned C3 moments; R6 legitimate weighted/height-disintegrated Kac-Rice; R7 pointwise inner-strip estimate and union of regions; R8 exact scope. Test success, same-provider agreement, and publication provide no independent acceptance of these interfaces.

Source context inspected: PR22 head b2e1652f1374c3b45759324a1ad1fd4177458500; PR16 head32b80ee085dc6a40113d1e46e333cda50d57ba21, TRANSVERSE_BOUND_CANDIDATE.md blob024d927779f79fadaf932541ea6474f2995f8c50; current Math#24 review assignment. This addendum quantifies the fixed-transverse constants and supplies a new stitching argument; it neither edits nor claims independent review of those same-provider sources. The exact algebra tests verify finite pin completions, the contact matrix/minor, and exponent budgets only, not this analytic proof.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md": "# D5 two-scale addendum: a uniform near-axis crossover estimate

**Object:** D5-TWO-SCALE-20260925-v1. **Author:** OpenAI / ChatGPT.
**Disposition:** AUTHOR-SIDE ANALYTIC CANDIDATE; no independent acceptance.
**Scientific effect:** NONE. Original `PROOF.md` remains unchanged.

## 1. Purpose, exact model, and quantifiers

This addendum addresses the width gap between a physical O(r^2) axial tube and a fixed-width scaled transverse chart. It does NOT substitute a diverging K into the previous fixed-K theorem. Instead it derives a new covariance normalization uniform across the aspect ratio t/r, including the limiting regimes zero and infinity.

Fix L>0 and the centered variance-one Gaussian field on R^2/(L Z^2) with the FULL covariance

    K_L(h) = [sum_{n in Z^2} exp(-|h+Ln|^2/2)]
             / [sum_{n in Z^2} exp(-|Ln|^2/2)].

Choose any orthonormal frame E and write f(x,z)=F(x e1+z e2). Let b range over a fixed compact interval, 0<k_-<=k<=k_+<infinity, and 1<A<B<infinity. Condition on exactly

    f(-r/2,0)=b, f(r/2,0)=b-k*r^3,
    f_x(-r/2,0)=f_x(r/2,0)=f_z(-r/2,0)=f_z(r/2,0)=0.       (S1)

Call this continuous Gaussian regression law Q_r. With M,S the two endpoints, define

    F_j(H)=|det H|*1{negative index(H)=j},
    W_r=F_2(H_M)*F_1(H_S), Z_r=E_Qr W_r, dQ_r^W=(W_r/Z_r)dQ_r.

Singular matrices contribute zero. There is no elder or adjacency conditioning. At the witness (x,z)=(r*u,r*t), put

    delta=sqrt(r^2+t^2), alpha=r/delta, beta=t/delta.        (S2)

Actual parameters have alpha>0 and alpha^2+beta^2=1. The closed semicircle alpha>=0 is used ONLY to prove uniform bounds by compactification. It is not an additional physical point at r=0.

**Candidate conclusions.** Constants C,c,delta_0>0 exist, depending on the preceding fixed parameters, such that for A<=|u|<=B, r>0 and delta<=delta_0, uniformly in the frame and marks,

    p_{grad f(ru,rt)|S1}(0) <= C*r^-3*delta^-2*exp(-c/delta^2),   (S3)

and the endpoint-weighted index-j critical-point intensity per PHYSICAL area satisfies

    rho_j^W(ru,rt) <= C*r^-5*delta^-8*exp(-c/delta^2).            (S4)

Here rho_j^W includes the original endpoint-only normalizer once. Choose delta_0 also small enough that the local coordinate chart is embedded. Constants are existence bounds, not numerical enclosures.

For T_r(epsilon)={(r*u,r*t): A<=|u|<=B, |t|<=epsilon}, if sqrt(r^2+epsilon^2)<=delta_0, this gives the explicit all-height count estimate

    E_Qr^W N_j(T_r(epsilon))
      <= C*r^-3 * int_{-epsilon}^{epsilon}
                  (r^2+t^2)^-4 * exp[-c/(r^2+t^2)] dt.         (S5)

The sum over the three possible indices satisfies the same bound after changing C. Restricting witness heights only decreases this count.

## 2. Exact finite-r subtraction and the PR21/PR22 crosswalk

Let g(x)=f(x,0), h(x)=f_z(x,0), and a=r/2. Let H_r be the unique cubic matching g and g' at -a,+a, and L_r the unique affine function matching h at those endpoints. For arbitrary unconditioned data define

    S0=(g(-a)+g(a))/2, D0=(g(a)-g(-a))/(2a),
    S1=(g'(-a)+g'(a))/2, D1=(g'(a)-g'(-a))/(2a).

The vector U_r of midpoint derivative coefficients of H_r followed by those of L_r is

    U_r=(S0-a^2*D1/2, (3*D0-S1)/2, D1,
         3*(S1-D0)/a^2, L_r(0), L'_r(0)).                    (S6)

This is invertible: these six coefficients recover the original observations by evaluation. In particular the pinned target is

    v_r=(b-k*r^3/2, -(3/2)*k*r^2, 0, 12k, 0, 0),
    H_r(x)=b-k*r^3/2-(3/2)*k*r^2*x+2k*x^3, L_r(x)=0.        (S7)

The notation S1 in (S6) means the average slope, not the label of equation (S1).

The previous thin-tube proof used V_r=(S0,D0,D1,3*(S1-D0)/a^2,L_r(0),L'_r(0)). Our first two coordinates equal V_r[0]-r^2*V_r[2]/8 and V_r[1]-r^2*V_r[3]/24; the other coordinates are unchanged. This shear has determinant one. Thus the targets -k*r^2 and -(3/2)*k*r^2 in the two coordinate systems are consistent; neither author needs to invalidate the original centered pin transform. The invalid operation is replacing a finite-r target by its limit BEFORE singular rescaling.

Define two UNCONDITIONAL linear Gaussian observations

    Y1=[f_x(ru,rt)-H'_r(ru)-r*t*L'_r(0)]/(r^2*delta),
    Y2=[f_z(ru,rt)-L_r(ru)]/(r*delta).                       (S8)

Subtracting r*t*L'_r is essential even though L'_r vanishes at the prescribed pin values. Omitting it from the unconditioned observation would leave a divergent f_xz contribution in the covariance calculation. Under the pins, the affine identity is EXACT:

    grad f(ru,rt)=diag(r^2*delta,r*delta)
                   [Y + (6k*(u^2-1/4)/delta,0)].            (S9)

Consequently the gradient-zero condition is evaluated at a known target for Y, not imposed on a rank-deficient limiting deterministic row.

## 3. Uniform remainders across the aspect ratio

The periodic Fourier coefficients are strictly positive and decay as a Gaussian in lattice frequency. The sum of their square roots times any fixed polynomial in frequency is finite. Applying Minkowski to the Fourier series gives finite L^p norms of every fixed derivative supremum on the torus, uniformly in E, for every fixed finite p. The Taylor remainders below therefore have uniform L^p bounds, not merely pathwise bounds with untracked random constants.

Write Q=f_xxxx(0), T=f_xxz(0), S=f_zz(0), and

    a(u)=u*(u^2-1/4)/6, b(u)=(u^2-1/4)/2.

Cubic Hermite and affine interpolation, followed by Taylor expansion, give uniformly for bounded u,

    g'(ru)-H'_r(ru)=r^3*a(u)*Q+O_Lp(r^4),
    h'(ru)-L'_r(0)=r*u*T+O_Lp(r^2),
    h(ru)-L_r(ru)=r^2*b(u)*T+O_Lp(r^3).                    (S10)

For the first identity the exact quartic interpolation error is Q*(x^2-r^2/4)^2/24. The Taylor remainder through degree four and its first derivative give the displayed O(r^4) derivative bound: interpolation coefficients multiplying endpoint value errors are O(1/r), and those multiplying endpoint derivative errors are O(1). The bounded scaled evaluation point is allowed outside the interpolation interval. The last two identities follow from affine interpolation of h and its quadratic Taylor term.

Expand in the physical transverse coordinate z=r*t. Bounded derivative moments imply

    f_x(ru,rt)=g'(ru)+r*t*h'(ru)+O_Lp(r^2*t^2),
    f_z(ru,rt)=h(ru)+r*t*S+O_Lp(r^2*|t|+r^2*t^2).         (S11)

After (S8), the error in Y1 is bounded by

    C*(r^2+r*|t|+t^2)/delta <= 3C*delta,

and the error in Y2 by

    C*(r^2+r*|t|+r*t^2)/delta <= 3C*delta                  (r<=1).

There is no hidden factor 1/alpha or 1/beta in these bounds. Also U_r=U_0+O_Lp(r^2), where U_0=(f,f_x,f_xx,f_xxx,f_z,f_xz)(0). Thus, uniformly as delta->0 across ALL aspect ratios,

    Y=M(u,alpha,beta)*(Q,T,S)^T+O_L2(delta),
    M = [ a(u)*alpha   u*beta       0 ]
        [      0      b(u)*alpha  beta ].                  (S12)

These are unconditioned joint Gaussian observations. Their covariance and cross-covariance converge uniformly by Cauchy-Schwarz. No claim about convergence of densities at divergent targets is used.

## 4. Rank at both ends and in between

The nine distinct midpoint derivatives (U_0,Q,T,S) have positive-definite covariance for every frame. A hypothetical zero-variance combination defines a polynomial differential symbol vanishing at every rotated lattice frequency, because each Fourier variance is positive. Undo the rotation and fix one integer coordinate at a time: a polynomial vanishing on Z^2 is identically zero. Distinct derivative monomials then force the combination to be trivial. Compactness of O(2) gives uniform positive/finite eigenvalue bounds for this nine-jet covariance.

The three 2-by-2 minors of M are

    a*b*alpha^2,   a*alpha*beta,   u*beta^2.                (S13)

The first one alone vanishes when alpha->0; it cannot establish uniformity outside the original tube. By Cauchy-Binet,

    det(M M^T)=a^2*b^2*alpha^4+a^2*alpha^2*beta^2+u^2*beta^4.

Let m0=min_{A<=|u|<=B}{a(u)^2*b(u)^2,u^2}>0. Then

    det(M M^T)>=m0*(alpha^4+beta^4)>=m0/2,                (S14)

using alpha^2+beta^2=1. Its trace is uniformly bounded on the compact parameter set, so its least eigenvalue is uniformly positive. This proves rank both at beta=0 (axis) and alpha=0 (outer aspect-ratio limit), and throughout the transition. The fixed mark k is not used as a random covariance coordinate.

Adjoining U_0 to Y_0=M(Q,T,S) therefore gives uniform positive/finite joint covariance bounds. By Section 3 the same holds for (U_r,Y) at sufficiently small delta. Its Schur complement obeys

    lambda I <= Sigma=Cov(Y|U_r) <= Lambda I.             (S15)

The conditional mean m_Y=Cov(Y,U_r)*Cov(U_r)^-1*v_r is uniformly bounded, since the cross-covariance, inverse, and target are bounded.

## 5. Joint density at the compensating value

Let d(u)=6k*(u^2-1/4), so d(u)>=d0=6k_-*(A^2-1/4)>0. At the target tau=(-d(u)/delta,0) from (S9), boundedness of m_Y permits delta_0 to be chosen so that

    |tau-m_Y|>=d0/(2delta),   |tau-m_Y|<=C/delta.

The exact Gaussian density with (S15) gives p_Y(tau|U_r=v_r)<=C exp(-c/delta^2). The raw-gradient Jacobian is

    det diag(r^2*delta,r*delta)=r^3*delta^2.

This proves (S3). It is a joint two-component density estimate, not an inference from one marginal density.

## 6. Extra conditioning and the ORIGINAL normalizer

Stack the independent entries of H_M,H_S,H_w into a nine-dimensional vector H. Under Q_r its mean and covariance are uniformly bounded, by bounded derivatives and the stable U_r regression. Cauchy-Schwarz and (S15) bound Cov_Qr(H,Y). Conditioning further on Y=tau changes its mean by Cov(H,Y)*Sigma^-1*(tau-m_Y)=O(delta^-1), and decreases its covariance. A product of three 2-by-2 determinant absolute values is bounded by C*|H|^6, so

    E_Qr[W_r*F_j(H_w) | grad f(w)=0] <= C*delta^-6.        (S16)

This keeps all three correlated Hessians in one expectation. An endpoint-only O(r^2) estimate is not incorrectly retained after imposing the witness condition.

Separately, Z_r uses ONLY the original six pins. The finite-r identities and bounded conditional derivative moments give, with A_r=f_zz(0),

    det H_M/r=-6k*A_r+O_Lp(r), det H_S/r=6k*A_r+O_Lp(r),
    f_xx(M)/r=-6k+O_Lp(r).                                 (S17)

For example f_xx(0)=-(r^2/24)f_xxxx(0)+O_Lp(r^4) and f_xxx(0)=12k+O_Lp(r^2), obtained by subtracting the symmetric slope and height equations, give the first diagonal estimates. Transverse slope pins give f_xz(M),f_xz(S)=O_Lp(r). These establish (S17) by multiplying the entries with Holder's inequality.

The conditional variance of A_r is uniformly bounded above and below by the one-site jet rank and covariance convergence, and its mean is bounded. Thus P_Qr(-2<=A_r<=-1)>=p0>0. Intersect with determinant errors below 3k_- and longitudinal-diagonal error below 3k_-. Markov and the uniform L^p bounds show that the removed probability is O(r^p). For small r the intersection still has probability at least p0/2; there H_M is negative definite, det H_S<0, and both |det|>=3k_-*r. Therefore

    Z_r>=c_Z*r^2.                                         (S18)

No remote-conditioned normalizer replaces Z_r, and no numerical historical eigenfloor/radius is imported.

## 7. Weighted counting and the two width corollaries

For every fixed r>0 the witness domain stays away from the two endpoints. Distinct-site jet functionals are nondegenerate for the full periodic model: if a finite combination of point derivatives annihilates all Fourier modes, the corresponding distribution on the torus is zero; disjoint local test functions then isolate its coefficients. Gaussian regression preserves the required full gradient/symmetric-Hessian jet rank away from the pins. Smoothness, Gaussian jet transversality and continuous conditional regression verify the local Kac-Rice hypotheses at fixed r.

Use the weighted Kac-Rice formula (Stecconi, arXiv:2103.10853v1, Theorem 29, printed p.20; nonnegative-weight argument in Section 8.4, p.44). W_r is a nonnegative measurable functional of the gradient field on the torus with M,S removed: endpoint derivatives are recoverable as limits. Truncation handles its unbounded size. We have not assumed the tilted measure is Gaussian. Consequently

    rho_j^W(w)=Z_r^-1*p_grad(0|S1)
                   *E_Qr[W_r*F_j(H_w)|grad f(w)=0].       (S19)

Combining (S3),(S16),(S18) proves (S4). Physical area is r^2 du dt, proving (S5). There is no additional height-window factor; all heights are already counted.

**Power-width corollary.** Fix 0<gamma<=1 and K>0. For epsilon(r)=K*r^gamma, shrinking delta_0 if necessary so s^-8 exp(-c/s^2) increases for 0<s<=delta_0, (S5) implies

    E_Qr^W N_j(T_r(K*r^gamma))
       <= C_gamma*r^(-3-7gamma)*exp(-c_gamma/r^(2gamma)).  (S20)

Indeed s_max=sqrt(r^2+K^2*r^(2gamma)) lies between K*r^gamma and sqrt(1+K^2)*r^gamma for r<=1. The integration interval has length 2K*r^gamma. This proves the claimed power and exponential without substituting a diverging constant into the original theorem. For gamma=1 it recovers the fixed O(r^2) physical width; gamma=1/2 gives physical width O(r^(3/2)) and bound C*r^(-13/2)*exp(-c/r). Every fixed positive gamma yields O(r^N) for every fixed N.

**Logarithmic-width corollary (target-dependent width).** For each fixed N>0 there exists D_N>0 such that

    E_Qr^W N_j(T_r(D_N/sqrt(log(1/r)))) = O(r^N).           (S21)

For small r, s_max^2<=2D_N^2/log(1/r). Then (S5) is bounded by

    C*D_N^-7*r^(c/(2D_N^2)-3)*(log(1/r))^(7/2).

Choose D_N^2<=c/[2(N+4)] and use r*(log(1/r))^(7/2)->0. This D_N depends on N and on an existence constant c; it is not numerically certified. It does NOT assert that one fixed positive logarithmic-width coefficient gives every power N. Markov yields only upper bounds on the corresponding witness-existence probability.

## 8. Limits and source/review crosswalk

The old fixed-K proof is preserved byte-for-byte. PR21's density argument at b420099b2440da3a8ba62f7000feacc9fc88069b was read and supplies the useful unconditioned Hermite subtraction convention; it and PR22's original 35eddbb5ab7dee33a659b64d8e9b0efeec16b70d are exposed SAME-PROVIDER candidates, not independent acceptance. The relevant identities and count ingredients are rederived here, rather than accepted by citation.

This addendum narrows the unresolved intermediate-width region but does not establish a uniform O(r^3) bound on a fixed scaled-width annulus. For fixed positive epsilon, the crude bound (S5) retains r^-3; simply integrating it does not close that target. One still needs a complementary count estimate uniform down to the shrinking cutoff, or a sharper determinant/height argument. No result is asserted at the pin sites, near u=0, at intermediate physical distances r<<|x|<<rho, for witness-witness collisions, in d>=3, at k_-=0, or uniformly over L. No elder-selection or generalized lifetime theorem is promoted.

Independent review questions: S6--S9 exact pins and subtraction; S10--S12 aspect-uniform remainders; S13--S15 all-minors rank argument; large-target Gaussian evaluation; S16 rare-conditioning determinant cost; S17--S19 normalizer and weighted Kac-Rice; S20--S21 quantifier order; explicit complement. Exact polynomial tests and deliberately broken implementations check finite algebra only. They do not establish analytic validity or reviewer independence.

### Reconnaissance delta

On 25 September 2026 I searched for the weighted Kac-Rice and Gaussian critical-point interpolation references, opened arXiv:2103.10853v1, and inspected page images for printed pp.20 and44. Those pages support the weighted-count theorem and its nonnegative-weight extension, not the new two-scale estimates. Gass--Stecconi, PTRF190 (2024), DOI10.1007/s00440-024-01273-5, was located as interpolation/nondegeneracy context only; its finite-moment theorem is not used to claim any rate here. No comprehensive novelty or priority claim is made.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/frontiers/axial_density_20260925/PROOF.md": "# Inner axial belt: an exponential conditional-gradient density bound

Object: **RN-INNER-AXIAL-DENSITY-20260925-v1**. Author: OpenAI / ChatGPT.
Disposition: **AUTHOR-SIDE ANALYTIC CANDIDATE; distinct-lane review required**.
Scientific/register effect: **NONE**. This is a density sublemma, not a weighted critical-point count or RN_UNIF closure.

## 1. Model, quantifiers, and conclusion

Fix L>0. Let f be the centered variance-one Gaussian field on the two-dimensional torus R^2/(L Z^2) with covariance

    K_L(t) = sum_{n in Z^2} exp(-|t+Ln|^2/2)
             / sum_{n in Z^2} exp(-|Ln|^2/2).

Fix B0<infinity, 0<k0<=k1<infinity, 1<A<B<infinity, and 0<=W<infinity. For any orthonormal frame R, use local coordinates (x,z) along its columns. With M=R(-r/2,0), S=R(r/2,0), condition on the ORIGINAL six observations

    f(M)=b, f(S)=b-k*r^3, grad f(M)=grad f(S)=0,
    |b|<=B0, k0<=k<=k1.

Denote their continuous Gaussian regression law by Q_r. Gradients below are in the frame R; the orthogonal coordinate change preserves density at zero. At the witness X=R(r*u,r^2*w), assume A<=|u|<=B and |w|<=W.

**Candidate theorem.** There are C,c,r_*>0 depending only on L,B0,k0,k1,A,B,W such that, uniformly in the stated parameters and frame, for 0<r<=r_*,

    p_{grad f(X) under Q_r}(0) <= C*r^(-5)*exp(-c*k^2/r^2).       (1)

The covariance at the witness is nonsingular for these r. The density is with respect to two-dimensional Lebesgue measure in GRADIENT space. It contains neither a pin-density factor nor a spatial Jacobian nor an endpoint Palm weight.

This covers the physical belt |z|<=W*r^2, equivalently |v|<=W*r when X=R(r*u,r*v). It is not a bound for a fixed-width scaled belt |v|<=epsilon. The omitted region W*r<|v|<eta is substantial and remains open here. Taking W=0 gives the axial line, but W>0 also covers positive area.

## 2. Exact Hermite observations before the limit

Put a=r/2, g(x)=f(R(x,0)), h(x)=partial_z f(R(x,0)). Let H_r be the unique cubic matching g and g' at both -a and a. Let L_r be the unique linear function matching h at those two points. Define

    U_r=(H_r(0),H'_r(0),H''_r(0),H'''_r(0),L_r(0),L'_r(0)).

For arbitrary, UNCONDITIONED input observations set

    S0=(g(-a)+g(a))/2, D0=(g(a)-g(-a))/(2a),
    S1=(g'(-a)+g'(a))/2, D1=(g'(a)-g'(-a))/(2a).

Then the first four coordinates of U_r are

    S0-a^2*D1/2, (3*D0-S1)/2, D1, 3*(S1-D0)/a^2,              (2)

and the last two are (h(-a)+h(a))/2 and (h(a)-h(-a))/(2a). These identities follow by substituting a cubic with derivative coefficients into all four interpolation equations. They also prove invertibility for every r>0: the coefficient vector recovers every original observation by evaluation.

Under the six specified pins, exactly, not asymptotically,

    H_r(x)=b-k*r^3/2-(3/2)*k*r^2*x+2*k*x^3, L_r(x)=0,
    U_r=v_r=(b-k*r^3/2,-(3/2)*k*r^2,0,12*k,0,0).             (3)

Thus H'_r(r*u)=6*k*r^2*(u^2-1/4). The offset does not disappear after division by r^2.

**Crosswalk to the fixed-remote source.** Its exact centered vector is

    V_r=(S0,D0,D1,3*(S1-D0)/a^2,L_r(0),L'_r(0)).

Our first two coordinates are V_0-r^2*V_2/8 and V_1-r^2*V_3/24, with the other four unchanged (indices in this sentence are zero-based). This change has determinant one. The old finite-r vector is therefore a VALID normalization of the same pins. The error in the unshifted chart is replacing finite-r data by their contact limit before rescaling, not an invalidity of every use of the centered vector. No parent normalizer or theorem is refuted by changing coordinates here.

## 3. The normalized UNCONDITIONAL Gaussian witness

Define the two linear Gaussian observations before any conditioning:

    Y_r1 = [f_x(r*u,r^2*w)-H'_r(r*u)-r^2*w*L'_r(0)]/r^3,
    Y_r2 = [f_z(r*u,r^2*w)-L_r(r*u)]/r^2.                     (4)

The L' subtraction in Y_r1 is essential. Under the pins L'=0, but without the subtraction the unconditioned covariance would contain the divergent term w*f_xz(0)/r. A formula that works only after substituting zero pin values is not automatically a valid covariance normalization.

Write the random midpoint jets Q=f_xxxx(0), T=f_xxz(0), S=f_zz(0), and

    alpha(u)=u*(u^2-1/4)/6, beta(u)=(u^2-1/4)/2.

Uniformly on the declared compact parameter set,

    U_r -> U_0=(f,f_x,f_xx,f_xxx,f_z,f_xz)(0),
    Y_r -> Y_0=(alpha(u)*Q+u*w*T, beta(u)*T+w*S)              (5)

in L^2, with errors O(r^2) and O(r), respectively.

Here are explicit remainder reasons. Positive Fourier coefficients, proportional to exp(-2*pi^2*|n|^2/L^2), give summability of the coefficient square roots times every polynomial in |n|. The Fourier series consequently has finite L^p moments of every fixed derivative supremum, uniformly in frame. Taylor estimates below therefore hold in L^2 uniformly, not merely pathwise with uncontrolled random constants.

For g, cubic Hermite interpolation reproduces degrees <=3. Its quartic error is

    (Q/24)*(x^2-a^2)^2.

Differentiating and evaluating x=r*u gives r^3*alpha(u)*Q. The fifth-order value remainder and fourth-order derivative remainder give O_L2(r^4) after interpolation and differentiation at r*u: the value-data coefficients grow at most as 1/r and the derivative-data coefficients stay bounded. For h, linear interpolation gives

    h(r*u)-L_r(r*u)=r^2*beta(u)*T+O_L2(r^3),
    h'(r*u)-L'_r(0)=r*u*T+O_L2(r^2).

Finally Taylor expansion in z=r^2*w gives

    f_x(r*u,r^2*w)=g'(r*u)+r^2*w*h'(r*u)+O_L2(r^4),
    f_z(r*u,r^2*w)=h(r*u)+r^2*w*S+O_L2(r^3).

Substitution in (4) proves (5). These are statements about the unconditioned jointly Gaussian observations; covariance and cross-covariance convergence follow by Cauchy-Schwarz. No convergence at a target tending to infinity is being assumed.

## 4. Uniform conditional covariance and bounded regression mean

The nine distinct jet functionals

    J=(f,f_x,f_xx,f_xxx,f_z,f_xz,Q,T,S)(0)

have positive-definite covariance for every frame. Indeed a zero-variance linear combination would have zero action on every Fourier mode, since all mode variances are strictly positive. Its derivative symbol is a polynomial in the rotated lattice frequency. A polynomial vanishing on all of Z^2 is zero: first fix either integer coordinate and use the one-variable polynomial identity, then apply it to each coefficient in the other coordinate. Rotation is invertible, so the original polynomial would also be zero. Distinct derivative monomials are linearly independent. This contradicts a nontrivial combination.

After adjoining the six U_0 coordinates, the two Y_0 rows are independent: on the unpinned random columns (Q,T) their 2-by-2 minor is

    alpha(u)*beta(u)=u*(u^2-1/4)^2/12 != 0.                  (6)

The mark k is fixed and is NOT a random covariance direction. The minor stays away from zero on A<=|u|<=B. Continuity and compactness of O(2) and the (u,w) set give a uniform positive minimum eigenvalue for Cov(U_0,Y_0), and a finite maximum. This uses compactness of frames, not rotational invariance of the torus covariance.

By (5), the same bounds, with possibly changed constants, hold for Cov(U_r,Y_r) at all sufficiently small r. Its Schur complement

    Sigma_r=Cov(Y_r)-Cov(Y_r,U_r)*Cov(U_r)^(-1)*Cov(U_r,Y_r)

is therefore uniformly positive and bounded: choose 0<lambda<=Lambda<infinity with

    lambda*I <= Sigma_r <= Lambda*I.                         (7)

For completeness the lower Schur bound follows by minimizing the quadratic form of the positive joint covariance over the U coordinates; the squared norm of the remaining Y coordinates is unchanged. The upper bound follows by taking the U coordinates zero.

Under U_r=v_r, Y_r is Gaussian with mean

    m_r=Cov(Y_r,U_r)*Cov(U_r)^(-1)*v_r.

The cross-covariances and inverses are uniformly bounded and (3) is a bounded vector for the fixed mark range. Thus |m_r|<=M0 uniformly. This does not declare the conditional mean zero.

## 5. Density at the required compensating value

Under the original pins, equation (4) becomes exactly

    grad f(X)=(6*k*r^2*(u^2-1/4)+r^3*Y_r1, r^2*Y_r2).

The transformation Y_r to this raw gradient has determinant r^5. Consequently

    p_{grad f(X)|U_r=v_r}(0)
      =r^(-5)*p_{Y_r|U_r=v_r}((-6*k*(u^2-1/4)/r,0)).        (8)

Let delta=6*(A^2-1/4)>0. The target t in (8) satisfies |t|>=delta*k/r. Shrink r_* so that r_*<=delta*k0/(2*M0) when M0>0, and ensure all local coordinates remain inside the torus injectivity scale. Then |t-m_r|>=delta*k/(2*r).

The exact two-dimensional Gaussian density and (7) imply

    p_Y(t) <= (2*pi*lambda)^(-1)
              *exp(-|t-m_r|^2/(2*Lambda))
           <= (2*pi*lambda)^(-1)
              *exp(-delta^2*k^2/(8*Lambda*r^2)).

Together with (8), this proves (1), with C=(2*pi*lambda)^(-1) and c=delta^2/(8*Lambda). These are existence constants, not numerical enclosures. The lower bound k0>0 is used essentially to dominate the bounded mean uniformly. No claim uniform down to k=0 follows.

## 6. Import boundary and review targets

This is an author-side proof of the declared density sublemma. It does NOT establish the height-conditioned density, conditional Hessian moments after forcing the large compensating value, the endpoint-weighted Palm count, its full normalizer, a bound across the remaining thin belt, pin/witness collisions, intermediate distances, d=3, numerical C_H, or historical 24-jet certification. In particular exponential smallness of a Gaussian gradient density must not be substituted for a weighted Kac-Rice integral without controlling its conditional determinant factors.

Distinct reviewer: independently check (2)-(4), the uniform Taylor remainders in (5), the random-jet minor (6), the Schur/mean bounds (7), and the affine density identity (8). Check all quantifiers and scope exclusions. Return ACCEPT/AMEND/COUNTEREXAMPLE per interface against the exact reviewed commit. Tests verify finite algebra, not these analytic arguments.

Source context, not unproved theorem imports:
- Math- main at baca69c394ab42130c61771bee74e808703f1ce7, frontiers/remote_window_20260924/PROOF.md, blob b383bfcc88ec4ad497dff01fb6640e429ba24a84: exact field and observation conventions.
- Math- PR19 at ee8629f37977f4132da4c5af7e1dd61e9d94aa1d, reviews/d5_finite_r_hermite_repair_20260925/REPAIR.md, blob ac13515dfb942fbc5468e5006547fc434d5c00ea: finite-pin repair context. Equations used here are rederived above.
- Math- PR9 at c393f6bd1b2a24bb4741baccc30f5c88969c474a, chart PROOF.md blob c96de6b907f23347964acc8b35c690e68e5c91f0: inspected erroneous unshifted rows; NOT imported.
- Gass and Stecconi, The number of critical points of a Gaussian field: finiteness of moments, PTRF 190 (2024), 1167-1197, DOI 10.1007/s00440-024-01273-5; preprint arXiv:2305.17586v2 (2023). Methodological prior art only; see RECONNAISSANCE.md. No novelty priority established by this search.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/reviews/downstream_boundary_20260925/TRANSVERSE_BOUND_CANDIDATE.md": "# Corrected fixed-transverse chart: a cubic conditional count bound

**Author:** OpenAI / ChatGPT, 25 September 2026.  
**Disposition:** corrective downstream proof candidate; separate-agent review required.  
**Scope:** dimension two, a fixed compact scaled chart bounded away from the axis. No full annulus, collision, finite numerical constant, or scientific promotion is claimed.

This note is a repair proposal following the exact finite-pin counterexample to Math PR9. It does not amend Cursor's proof body. The algebraic obstruction is settled by the accompanying rational-polynomial oracle; the continuum argument below still needs independent analytic review.

## 1. Model and exact count

Fix the variance-one normalized periodized Gaussian covariance

    K_L(z) = sum_(n in Z^2) exp(-|z+Ln|^2/2)
             / sum_(n in Z^2) exp(-|Ln|^2/2)

on the fixed two-dimensional torus of side L>0. Fix compact birth and gap intervals, with 0<k_min<=k<=k_max. Constants below may depend on L, these intervals, and the declared chart.

In an arbitrary orthonormal local frame, prescribe M=(-r/2,0), S=(r/2,0), heights b and b-k*r^3, and both gradients zero. Let Q_r be the full Gaussian regression law at these six observations. Set

    W_r = |det H_M det H_S| 1{H_M negative definite, H_S index one},
    Z_r = E_Qr W_r,    dQ_r^W = (W_r/Z_r) dQ_r.

There is no adjacency condition or pin Jacobian in Z_r.

For fixed A>1, B>A and eta>0, let

    K = {(u,v): A<=sqrt(u^2+v^2)<=B, |v|>=eta}.

Let E be any Borel subset of K, and N_j(rE) count critical points of index j in rE whose heights lie strictly between b-k*r^3 and b.

**Candidate theorem.** There are C<infinity and r_*>0 such that, uniformly over the compact marks, all frames, E and j=0,1,2,

    E_(Qr^W) N_j(rE) <= C*k*r^3*area(E),    0<r<=r_*.

The constants are qualitative. They are NOT uniform as eta tends to zero, B tends to infinity or the gap interval approaches zero.

## 2. Endpoint regression and full normalizer

Use the exact centered six-observation transform

    U_r = ((fM+fS)/2, (fS-fM)/r, (fxS-fxM)/r,
           (6/r^2)*(fxM+fxS-2*(fS-fM)/r),
           (fzM+fzS)/2, (fzS-fzM)/r).

Its target is (b-k*r^3/2,-k*r^2,0,12k,0,0). Its contact limit is

    U_0=(f,fx,fxx,fxxx,fz,fxz)_0,
    target=(b,0,0,12k,0,0).

Positive Fourier variances at every lattice mode imply positive covariance for any independent finite list of derivative-evaluation functionals. A zero-variance linear combination would annihilate every Fourier mode and hence be the zero derivative distribution. The Gaussian Fourier coefficients decrease rapidly enough that all fixed derivative-supremum moments are finite.

Taylor integral formulas give uniform convergence of the transformed observation covariance and its derivative-field cross-covariances on the compact frame set. The limiting covariance is positive, so inverse covariances remain bounded. Gaussian regression therefore gives uniformly bounded C^m moments for every fixed m and finite moment order under Q_r, and convergence of all the needed midpoint jets to their U_0-conditioned counterparts. No rotational invariance of the periodic field is assumed.

Appending a=fzz(0) leaves the contact jet list independent. Under Q_r, the endpoint Hessian entries satisfy

    fxx(M)/r -> -6k, fxx(S)/r -> 6k,
    fxz(M),fxz(S)=O_Lp(r), fzz(M),fzz(S)->a.

Consequently, by type convergence away from a=0 and uniform integrability,

    Z_r/r^2 -> 36*k^2 E[a^2 1{a<0} | U_0=target] = z_0 > 0.

The contact a has a nondegenerate Gaussian law. The limiting expectation is continuous in the compact parameters. Thus Z_r>=z_* r^2 uniformly for sufficiently small r. A compact-subsequence argument supplies uniformity of the convergence, without assuming an unproved uniform pointwise type margin.

These are local Gaussian regression and full-normalizer interfaces also used in the existing fixed-remote note. They do not consume a global elder-selection conclusion or any historical numerical RN certificate.

## 3. Keep finite-r midpoint corrections before taking limits

Write a=fzz(0), q=fxxz(0), c=fxzz(0), d=fzzz(0), for the finite-r field. Taylor's formula and the original pins imply, with remainders bounded in every fixed Lp uniformly on K,

    fx(ru,rv)/r^2
       = 6k*(u^2-1/4)+q*u*v+(c/2)*v^2 + O_Lp(r),

    fz(ru,rv)
       = r*a*v+r^2*((q/2)*(u^2-1/4)+c*u*v+(d/2)*v^2)
         + O_Lp(r^3),

    f(ru,rv)-b
       = r^2*a*v^2/2+r^3*(k*(2u^3-3u/2-1/2)
         +(q/2)*(u^2-1/4)*v+(c/2)*u*v^2+(d/6)*v^3)
         + O_Lp(r^4).

The origin corrections are fx(0)=-(3/2)kr^2+O(r^3 ||f||C4), fz(0)=-qr^2/8+O(r^3 ||f||C4), and f(0)=b-kr^3/2+O(r^4 ||f||C4). They cannot be discarded before rescaling. The accompanying exact cubic family verifies every displayed coefficient without any remainder.

Define the ACTUAL normalized witness vector at X=(ru,rv):

    J_r = (fx(X)/r^2,
           fz(X)/r,
           (f(X)-b-(r*v/2)*fz(X))/r^3).

Its limiting random part is a linear map of (a,q,c,d), with mean shifts depending on k:

    J_1 -> 6k*(u^2-1/4)+q*u*v+(c/2)*v^2,
    J_2 -> a*v,
    J_3 -> k*(2u^3-3u/2-1/2)+(q/4)*(u^2-1/4)*v-(d/12)*v^3.

The coefficient minor on columns (a,c,d) is v^6/24. It is bounded away from zero on |v|>=eta. The four added midpoint jets are independent from U_0, so their conditional covariance is positive definite. Compactness gives uniform positive covariance for J_r under Q_r when r is small. This is the true three-variable gradient-and-height density; it does NOT treat k as a free Gaussian variable after k has been pinned.

The exact affine change from (fx,fz,f) to J_r has determinant r^-6. At gradient zero and f(X)=b+r^3*tau, the J_r target is (0,0,tau), with tau in [-k,0]. Hence

    p_(grad f(X),f(X)|pins)(0,b+r^3*tau) <= C*r^-6.

The height Jacobian has not disappeared. It is kept explicitly here and canceled only by the actual dt=r^3*d tau in the final integral.

## 4. Three critical gradients force all three Hessians to be small

This step is deterministic. Under the endpoint pins and the additional witness condition grad f(X)=0, let M_3 bound the third directional derivatives on the local convex ball containing M,S,X.

The two endpoint gradient conditions and Taylor's integral formula give

    |fxx(M)| + |fxz(M)| <= C*r*M_3.

Expanding fz(X) from M, and using fz(M)=fz(X)=0, gives

    0 = r*(u+1/2)*fxz(M) + r*v*fzz(M) + O(r^2*M_3).

Since |v|>=eta, it follows that |fzz(M)|<=C*r*M_3. Hessian Lipschitz control along segments then gives

    ||H_M||+||H_S||+||H_X|| <= C*r*M_3.

In dimension two, therefore,

    W_r * |det H_X| <= C*r^6*M_3^6.

This is where the two endpoint determinants AND the witness determinant acquire the needed extra powers. Using the raw unconditioned r^1 determinant power after conditioning would miss this mechanism.

The same estimate holds with any witness index indicator, since dropping it only increases the absolute bound.

## 5. Uniform derivative moments after the extra witness pins

Under Q_r, J_r has uniformly bounded mean and nonsingular covariance from Section3. Its cross-covariance with any fixed derivative field is uniformly bounded in the corresponding supremum norm: use the uniformly bounded Q_r derivative moments, the bounded J_r moments, and Cauchy-Schwarz.

The Gaussian regression coupling

    F_conditioned = F_Qr + Cov(F_Qr,J_r) Cov(J_r)^-1 (target-J_r)

retains all original endpoint pins and has exactly the extra-conditioned law. Because target=(0,0,tau) lies in a fixed compact set, its C^3 moments of every fixed finite order are uniformly bounded. In particular E[M_3^6 | pins,J_r=(0,0,tau)]<=C. No independence between the endpoint and witness determinants is asserted.

Thus the full three-determinant conditional expectation is at most C*r^6.

## 6. The complete count ledger

Apply the marked Kac-Rice formula under Q_r on the spatial chart, disintegrating the witness height and retaining the endpoint weight. At fixed r>0 the witness stays away from both endpoints; distinct-site finite-jet positivity supplies the required nondegenerate conditional gradient/value laws. Filtered absolute determinants are continuous through singular matrices and have polynomial growth. Truncation and the uniform moments justify the weight; height indicators can be obtained by nonnegative approximation.

The unnormalized numerator is bounded by

    integral_(rE) integral_(b-k*r^3)^b
         p_(grad,height|pins)(0,t)
         E[W_r*|det H_X|*1{index=j} | pins,grad=0,height=t] dt dX
      <= C * r^2*area(E) * k*r^3 * r^-6 * r^6
      = C*k*r^5*area(E).

Division by the FULL Z_r>=z_*r^2 proves the stated O(k*r^3) expected count. Markov then supplies the corresponding upper bound on the probability of at least one witness. No probability-to-expected-count reversal is used.

## 7. Exactly what is and is not repaired

This proposal supplies a route through the fixed two-dimensional transverse chart with |v|>=eta. It replaces the mistaken finite-pin contact rows and accounts for the full gradient/height Jacobian and all three determinant factors. It does not cover eta->0 (thin belt/axis), pin collisions, intermediate r<<distance<<rho, multiple witness collisions, dimension three, numerical constants, or the historical all-cell/24-jet certificate. It establishes no positive leading count coefficient and no matching probability lower bound.

The argument is an OpenAI-authored repair candidate requiring another agent's review. The independent polynomial oracle validates its local algebra, not the continuum Gaussian regression/Kac-Rice proof.

Primary framework: Armentano, Azais and Leon, *On a general Kac-Rice formula for the measure of a level set*, arXiv:2304.07424v3, Theorem7.1 and Section8.1. The paper supplies the expected-integral framework, not this project's conditioned estimate. The actual application and its bounds are given above.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/reviews/collision_mechanism_20260925/CUMULATIVE_TRANSFER_CORRECTION.md": "IyBDb3JyZWN0aW9uIHRvIHRoZSBjdW11bGF0aXZlIHRyYW5zZmVyIHN0YXRlbWVudCAoRDIpCgoqKkF1dGhvcjoqKiBPcGVuQUkgLyBDaGF0R1BULiAqKlNjaWVudGlmaWMgZWZmZWN0OioqIE5PTkUuIFNlcGFyYXRlIHJldmlld2VyIGNvbmZpcm1hdGlvbiByZXF1ZXN0ZWQuCgpUaGlzIGFkZGl0aXZlIGNvcnJlY3Rpb24gcmVwbGFjZXMgb25seSB0aGUgY3VtdWxhdGl2ZSBwYXJhZ3JhcGggYW5kIGl0cyBwcm9vZiBpbiBTZWN0aW9uIEQgb2YgTk9URS5tZCBhdCBzb3VyY2UgYWQzNWU0NmQxNWMyODE1YzM2NzQ2NDQyODA4YTE2MjZhOTcyNGU4YSAoU0hBMjU2NTMwZGQzZWZhYTk2NWM4NTBlYTllNjU3NWY0MmQzOTUyYzNlZmU2YTg5YjJiNTM1NWI2YWZiNDI4NWM5ZDM3ZSkuIFRoZSBvcmlnaW5hbCBzb3VyY2Ugc3RheXMgdW5jaGFuZ2VkIGZvciBwcm92ZW5hbmNlLiBTZWN0aW9ucyBCL0MgYW5kIHRoZSBkZW5zaXR5IHRoZW9yZW0gRDEgYXJlIG5vdCBjaGFuZ2VkLgoKTm9uYXV0aG9yIHJldmlldyBQUjMyLCBjb21taXQxODk2MjgxMTlmNjVkODQ1ZTI3MDc1OWUxYjJiMWU4NGRkYjRjZmUzLCBjb3JyZWN0bHkgZm91bmQgdGhhdCBzYXlpbmcgb25seSAnbW9ub3RvbmljaXR5IGFuZCB0aGUgc2FtZSBjb21wYXJpc29uL2VudmVsb3BlIGFzc3VtcHRpb25zJyBjb3VsZCBkcm9wIHRoZSBuZWNlc3Nhcnkgbm9ybWFsaXphdGlvbiBoLyhrYXBwYSpyXm0pLT4xLiBUd28tc2lkZWQgY29tcGFyaXNvbnMgZG8gbm90IGRldGVybWluZSB0aGUgc2hhcnAgY29uc3RhbnQuIFRoZSBjb3JyZWN0aW9uIGV4cGxpY2l0bHkgcmV0YWlucyB0aGF0IHJhdGlvIGh5cG90aGVzaXMgd2hpbGUgZHJvcHBpbmcgb25seSBkZXJpdmF0aXZlIGFzc3VtcHRpb25zLgoKIyMgQ29ycmVjdGVkIGN1bXVsYXRpdmUgdGhlb3JlbQoKTGV0IChaLGxhbWJkYSkgYmUgc2lnbWEtZmluaXRlLCBhbHBoYT4tMSwgbT4wLCBiZXRhPShhbHBoYSsxKS9tLCBhbmQgcjA+MC4gTGV0IGFsbCBpbnRlZ3JhbmRzIGJlIGpvaW50bHkgbWVhc3VyYWJsZS4gQXNzdW1lLCBmb3IgbGFtYmRhLWFsbW9zdCBldmVyeSB6OgoKMS4ga2FwcGEoeik+MDsgMDw9QihyLHopPD1HKHopOyBCKHIseiktPkIwKHopIGFzIHItPjAuCjIuIFRoZSB3ZWlnaHRlZCBuZWdhdGl2ZSBtb21lbnQgaW50ZWdyYWwgRyh6KSprYXBwYSh6KV4oLWJldGEpIGRsYW1iZGEgaXMgZmluaXRlLgozLiBoKHIseikgaXMgY29udGludW91cyBhbmQgc3RyaWN0bHkgaW5jcmVhc2luZyBmb3IgMDxyPHIwLCB3aXRoIGgoMCsseik9MCBhbmQKCiAgICAgICBoKHIseikvKGthcHBhKHopKnJebSkgLT4gMS4KCjQuIFVuaWZvcm1seSBpbiByLHosIGgocix6KT49YzAqa2FwcGEoeikqcl5tIGZvciBhIGZpeGVkIGMwPjAuCgpOZWl0aGVyIGEgZGVyaXZhdGl2ZSBsaW1pdCBub3IgYSBsb3dlciBkZXJpdmF0aXZlIGJvdW5kIGlzIHJlcXVpcmVkIGZvciB0aGlzIGN1bXVsYXRpdmUgdGhlb3JlbS4gRGVmaW5lCgogICAgTihlbGwpPWludGVncmFsX1ogaW50ZWdyYWxfMF5yMCByXmFscGhhIEIocix6KSAxe2gocix6KTw9ZWxsfSBkciBkbGFtYmRhLgoKVGhlbgoKICAgIGxpbV8oZWxsLT4wKSBOKGVsbCkvZWxsXmJldGEKICAgICAgID0gMS8oYWxwaGErMSkgKiBpbnRlZ3JhbF9aIEIwKHopKmthcHBhKHopXigtYmV0YSkgZGxhbWJkYS4KCklmIHRoZSBkaXNwbGF5ZWQgY29lZmZpY2llbnQgaXMgcG9zaXRpdmUsIHRoaXMgbGltaXQgaXMgYSBwb3NpdGl2ZSBhc3ltcHRvdGljIGVxdWl2YWxlbmNlLiBJZiBpdCBpcyB6ZXJvLCBvbmx5IHRoZSBjb3JyZXNwb25kaW5nIG8oZWxsXmJldGEpIGNvbmNsdXNpb24gaXMgYXNzZXJ0ZWQuCgojIyBQcm9vZgoKQXQgZWFjaCBmaXhlZCB6IGFuZCBzdWZmaWNpZW50bHkgc21hbGwgZWxsLCBsZXQgUj1SKGVsbCx6KSBiZSB0aGUgaW52ZXJzZSBvZiBoLiBUaGUgZXhwbGljaXRseSByZXRhaW5lZCByYXRpbyBoeXBvdGhlc2lzIGdpdmVzCgogICAgUl4oYWxwaGErMSkgLyAoZWxsL2thcHBhKHopKV5iZXRhIC0+IDEuCgpBbHNvLAoKICAgIFJeKC1hbHBoYS0xKSBpbnRlZ3JhbF8wXlIgcl5hbHBoYSBCKHIseikgZHIKICAgICAgICAtPiBCMCh6KS8oYWxwaGErMSksCgpieSBjb252ZXJnZW5jZSBvZiBCIGF0IHplcm8gYW5kIGFscGhhPi0xLiBUaGVyZWZvcmUgdGhlIG5vcm1hbGl6ZWQgaW5uZXIgaW50ZWdyYWwgY29udmVyZ2VzIHRvIEIwKHopKmthcHBhKHopXigtYmV0YSkvKGFscGhhKzEpLgoKRm9yIGRvbWluYXRpb24sIHRoZSBsb3dlciBjb21wYXJpc29uIGltcGxpZXMgaChyLHopPD1lbGwgb25seSBpZiByPD0oZWxsLyhjMCprYXBwYSh6KSkpXigxL20pLiBUaHVzLCBhbHNvIHdoZW4gdGhlIGludmVyc2Ugd291bGQgZXhjZWVkIHIwLAoKICAgIGVsbF4oLWJldGEpIGludGVncmFsXzBecjAgcl5hbHBoYSBCKHIseikxe2g8PWVsbH1kcgogICAgICAgPD0gYzBeKC1iZXRhKSBHKHopKmthcHBhKHopXigtYmV0YSkvKGFscGhhKzEpLgoKVGhpcyBpcyBpbnRlZ3JhYmxlIGJ5IGFzc3VtcHRpb24yLiBEb21pbmF0ZWQgY29udmVyZ2VuY2UgcHJvdmVzIHRoZSByZXN1bHQuCgojIyBXaHkgdGhlIGFkZGVkIHByZWNpc2lvbiBtYXR0ZXJzCgpGb3IgaChyKT0yKmthcHBhKnJebSB3aXRoIGNvbnN0YW50IGFtcGxpdHVkZTEsIHRoZSBhY3R1YWwgY29lZmZpY2llbnQgaXMgbXVsdGlwbGllZCBieTJeKC1iZXRhKS4gVGhpcyBleGFtcGxlIHNhdGlzZmllcyBzdWl0YWJsZSBmaXhlZCB0d28tc2lkZWQgY29tcGFyaXNvbiBib3VuZHMgYnV0IHZpb2xhdGVzIGgvKGthcHBhKnJebSktPjEuIEZvciBhbHBoYT0xLG09MyxrYXBwYT0xIGFuZCBSPTEvMiwgZWxsPTEvNCBhbmQgTj0xLzg6IHRoZSBhY3R1YWwgY3ViZSBpczEvNTEyLCB3aGVyZWFzIHRoZSB1bmNvcnJlY3RlZCBjYW5kaWRhdGUgY29uc3RhbnQgKGVsbF4oMi8zKS8yKV4zIGlzMS8xMjguIFRoZSByYXRpbyBoeXBvdGhlc2lzIGV4Y2x1ZGVzIHByZWNpc2VseSB0aGlzIG1pc21hdGNoLgoKVGhpcyBjb3JyZWN0cyBhbiB1bmRlcnNwZWNpZmllZCB0aGVvcmVtIHN0YXRlbWVudDsgaXQgaXMgbm90IGFuIGV4Y3VzZSB0byBpbmZlciBhIGRlbnNpdHkgYXN5bXB0b3RpYyBmcm9tIGEgY3VtdWxhdGl2ZSBhc3ltcHRvdGljLiBEMSBzdGlsbCByZXF1aXJlcyBpdHMgc2VwYXJhdGUgZGVyaXZhdGl2ZSBjb250cm9scy4gVGhlIEdhdXNzaWFuIGNvbnRhY3QsIHRoaW4tYmVsdCwgd2hvbGUtYW5udWx1cywgYW5kIGdsb2JhbCBwZXJzaXN0ZW5jZSBzdGF0dXNlcyBhcmUgdW50b3VjaGVkLgo=", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md": "IyBXaHkgdGhlIHJlYWxpemVkLWNvdmVyIHRoZW9yZW0gY2Fubm90IHNpbXBseSB1c2UgZXZlcnkgdHJhbnNmb3JtZWQgcHJpY2UKCioqT2JqZWN0OioqIFAxNS1QUklDRS1CT1VOREFSWS0yMDI2MDkyNC12MS4gQXV0aG9yOiBPcGVuQUkgLyBDaGF0R1BULgpUaGlzIGlzIGFuIGV4YWN0IGNvdW50ZXJleGFtcGxlIHRvIG9uZSBwcm9wb3NlZCBleHRlbnNpb24sIG5vdCB0byBQMTUtQiBvciB0bwphbiB1bnJlc3RyaWN0ZWQgbGFyZ2UtcGFsZXR0ZSB0aGVvcmVtLgoKVGhlIHJlYWxpemVkLWNvdmVyIHRoZW9yZW0gZGVsaWJlcmF0ZWx5IGFzc3VtZXMgY192PD1wX3YuIENvbnNpZGVyIGl0cyBzbWFsbGVzdApvbmUtYmxvY2sgbWVtYmVyOiBhXzE9ZF8xPTEsIFg9e3gseX0sIG5vIG1hY3JvIGVkZ2VzLiBJdHMgZ29vZCBzZXRzIGFyZSB0aGUgZW1wdHkKc2V0IGFuZCBzaW5nbGV0b25zLCBpdHMgcGFsZXR0ZSBvcHRpbXVtIGlzIEtfSChkKT0xLCBhbmQgaXRzIG9uZS1waWVjZSBvYnN0cnVjdGlvbgppcyBleGFjdGx5IHtYfS4gVGhlIHByZXNjcmliZWQgY292ZXIgaXMge3t4LHl9fS4KClRha2UgaW5kZXBlbmRlbnQgb3JpZ2luYWwgcHJvYmFiaWxpdGllcyBwX3g9cF95PTEvMiBhbmQgcHJpY2VzIGNfeD1jX3k9Mi8zLgpUaGVzZSBhcmUgYWRtaXNzaWJsZSBUUkFOU0ZPUk1FRCBwcmljZXM6IHBoaSgxLzIpPWxvZyAyPjIvMy4gRm9yIGV4YW1wbGUsCgogICAgbG9nIDI9MiBpbnRlZ3JhbF8wXigxLzMpIDEvKDEtdF4yKSBkdCA+IDIvMy4KCk5ldmVydGhlbGVzcyBtdV9wKEQpPTMvNCwgYW5kCgogICAgbWluKDEsLWxvZyBtdV9wKEQpKT1sb2coNC8zKTwxLzMsCgp1c2luZyBsb2coMSt4KTx4IGZvciB4PjAuIEV2ZXJ5IGNvdmVyIG9mIHRoZSBvYnN0cnVjdGlvbiB7WH0gbXVzdCBjb250YWluIGEKZ2VuZXJhdG9yIGcgc3Vic2V0IFguIFRoZSBwb3NzaWJsZSBnZW5lcmF0b3IgY29zdHMgYXJlMSwyLzMsMi8zLDQvOSBmb3IgdGhlIGVtcHR5CnNldCwgdGhlIHR3byBzaW5nbGV0b25zLCBhbmQgWCByZXNwZWN0aXZlbHkuIEFkZGl0aW9uYWwgbm9ubmVnYXRpdmUtcHJpY2UKZ2VuZXJhdG9ycyBjYW5ub3QgcmVkdWNlIHRoZSBtaW5pbXVtLiBUaGVyZWZvcmUgdGhlIEVYQUNUIG9wdGltYWwgY292ZXIgcHJpY2UgaXMKCiAgICBjb3ZlcmNvc3RfYyhPXzEoRCkpPTQvOSA+IDEvMyA+IGxvZyg0LzMpLgoKVGh1cyByZXBsYWNpbmcgYzw9cCBieSBjPD1waGkocCkgaW4gdGhlIHJlYWxpemVkLWZhbWlseSB0aGVvcmVtIHdoaWxlIGtlZXBpbmcgaXRzCnNhbWUgcGFsZXR0ZSBLX0goZCkgaXMgRkFMU0UgaW4gZ2VuZXJhbCwgZXZlbiBpZiBhcmJpdHJhcnkgYWx0ZXJuYXRpdmUgY292ZXJzCnJhdGhlciB0aGFuIHRoZSBwcmVzY3JpYmVkIGNvdmVyIGFyZSBwZXJtaXR0ZWQuIFRoaXMgaXMgc3Ryb25nZXIgdGhhbiBtZXJlbHkKc2F5aW5nIHRoYXQgdGhlIGV4aXN0aW5nIHByb29mIGRvZXMgbm90IGVzdGFibGlzaCB0aGUgZXh0ZW5zaW9uLgoKSXQgZG9lcyBub3QgY29udHJhZGljdCB0aGUgb3JpZ2luYWwgUDE1LUIgYW1hbGdhbWF0aW9uOiB0aGF0IHNvdXJjZSBzZXBhcmF0ZWx5CnJlcXVpcmVzIGVhY2ggbG9jYWwgY292ZXIgdG8gbWVldCBpdHMgbG9jYWwgcGhpKHFfaSkgYnVkZ2V0LCB3aGljaCBmYWlscyBoZXJlLgpJdCBhbHNvIGRvZXMgbm90IHJlZnV0ZSBhIHRoZW9yZW0gYWxsb3dpbmcgbW9yZSBjb2xvcnM6IHdpdGggdHdvIGNvbG9ycyB0aGlzCnBhcnRpY3VsYXIgd2hvbGUgZ3JvdW5kIHNldCBpcyBwcm9wZXJseSBjb2xvcmFibGUsIHRoZSBvYnN0cnVjdGlvbiBpcyBlbXB0eSwKYW5kIHRoZSBlbXB0eSBmYW1pbHkgaGFzIHByaWNlIHplcm8uIE5vIGNvbmNsdXNpb24gYWJvdXQgdGhlIG9yaWdpbmFsNDA4LXNjYWxlCm9yIHVucmVzdHJpY3RlZCBwcml6ZSBmb2xsb3dzIGZyb20gYSBvbmUtY29sb3IgY291bnRlcmV4YW1wbGUuCgpUaGUgYWNjb21wYW55aW5nIHRocmVlIGZpbml0ZSB0ZXN0cyBlbnVtZXJhdGUgYWxsIGdlbmVyYXRvciBmYW1pbGllcyBvbiB0aGUKYWN0dWFsIHR3by1jb29yZGluYXRlIGdyb3VuZCBzZXQsIGNvbXB1dGUgdGhlIHByb2R1Y3QtbWVhc3VyZSBwcm9iYWJpbGl0eSBleGFjdGx5LAphbmQgY2hlY2sgdGhlIHJhdGlvbmFsIGNvbXBhcmlzb25zIHVzZWQgYWJvdmUuIFRoZSB0d28gZWxlbWVudGFyeSBsb2dhcml0aG0KaW5lcXVhbGl0aWVzIGFyZSBwcm92ZWQgaW4gdGhpcyBub3RlLCBub3QgcmVwbGFjZWQgYnkgZmxvYXRpbmctcG9pbnQgZXZhbHVhdGlvbnMuCg==", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/frontiers/full_price_20260924/PROOF.md": "# Full transformed-price budgets without a probability cutoff

**Object:** P15-FULL-TRANSFORMED-PRICE-20260924-v1.  
**Author:** OpenAI / ChatGPT. **Disposition:** author-side mathematical derivation; nonauthor review open.

[Research home](https://github.com/d6g8k5htny-coder/main) · [Math index](../../README.md) · [Original realization](../three_fronts_20260924/P15_REALIZED_COVERS.md) · [Demand-one counterexample](../three_fronts_20260924/P15_PRICE_BOUNDARY.md)

## 1. Exact scope and result

Use the original realized family, not arbitrary P15 inputs. H is a finite clutter of block supports, every edge has size at least two (empty H is allowed). The original coordinate blocks are disjoint, with

    |X_i|=a_i d_i+1,     a_i>=1, d_i>=2 integers.

The decreasing family D consists of U with |U intersect X_i|<=a_i in each block and with occupied-block support containing no H-edge. Its complete minimal original forbidders and its actual local restrictions are proved in P15-REALIZED-COVERS-20260924-v1, SHA256 `c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9`.

Write O_K(D) for sets not partitionable into at most K members of D. Let K_H(d) be the least palette size with |P_i|>=d_i and empty intersection over every H-edge. For K>=K_H(d), the specified family of full-block generators {X_i} covers O_K(D), regardless of probabilities or prices. A generator g costs product_(v in g)c_v. The empty generator costs one; an empty family costs zero.

Put phi(p)=min(1,-log(1-p)), with phi(1)=1. Define

    p_star=1-exp(-1),
    h_star=3-log(3e-2),
    rho_star=1/h_star.                                   (F1)

**Theorem F.** For EVERY independent original probability vector p in [0,1]^X, every price vector 0<=c_v<=phi(p_v), and the SAME palette K>=K_H(d),

    covercost_c(O_K(D)) <= min(1,rho_star[-log mu_p(D)]).  (F2)

Before capping, the union of full-block generators has price at most rho_star times the global hazard. The constant rho_star is optimal uniformly over this entire realized class, even when alternative generator covers are allowed. Explicitly,

    0.84547981724898672067 < rho_star
                            < 0.84547981724898672068 < 6/7. (F3)

Thus 6/7 is a simpler valid rational factor. The probability ceilings 1/4 and 3/7 are no longer required. Demand d_i>=2 is still essential to this uniform family guarantee. This is not an unrestricted downset/prize theorem; palette size remains K_H(d), which can depend on H and d.

The prior probability<=1/4 theorem, SHA `3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535`, gives the stronger factor16/27 on its smaller domain and should still be used there. The local-only3/7 note is a historical intermediate result, not a prerequisite here. No prior proof or counterexample is overwritten.

## 2. A general hazard interpolation lemma

Let A be any proper decreasing family on n>=1 coordinates containing the empty set. Put

    p_i(t)=1-exp(-t_i),     t in [0,1]^n,
    F_A(t)=-log mu_(p(t))(A),
    H_A=F_A(1,...,1)>0.

The probability is positive on this compact cube because the empty set is admitted and every p_i(t)<1. In one coordinate, after averaging over all others, its good-event probability is exactly

    mu(A)=A0+B0 exp(-t_i),     A0>=0, B0>=0.             (F4)

Here A0 is the probability of membership when that coordinate is present, and A0+B0 is the probability when it is absent. The inequality B0>=0 follows from decreasingness. Their sum is positive. Direct differentiation yields

    partial_i F_A = B0 exp(-t_i)/(A0+B0 exp(-t_i)),
    partial_i^2 F_A = -A0 B0 exp(-t_i)
                           /(A0+B0 exp(-t_i))^2 <= 0.    (F5)

Only SEPARATE coordinatewise concavity is asserted; joint concavity is not needed or claimed. Also F_A>=0. The chord inequality in coordinate i therefore gives

    F_A(t) >= t_i F_A(t with t_i=1).

Iterating across coordinates, keeping all factors nonnegative, proves

    F_A(t) >= (product_i t_i) H_A.                       (F6)

Now take arbitrary original probabilities p_i in [0,1], set t_i=phi(p_i), and let p'_i=1-exp(-t_i). Then p'_i<=p_i, including p_i=1. Decreasingness gives mu_p(A)<=mu_(p')(A), so

    -log mu_p(A) >= H_A product_i phi(p_i).              (F7)

This holds as an extended inequality if the left side is infinite. At a zero probability the product is zero; no division by it is performed. For any transformed prices,

    product_i c_i <= min(1, [-log mu_p(A)]/H_A).          (F8)

This is a PRICE estimate for the full-ground generator. It does not assert that this generator alone covers an arbitrary obstruction. That setwise property is supplied separately for the capacity construction below.

The constant1/H_A in the uncapped hazard comparison is exact: at every p_i=p_star and every c_i=1, the two sides of (F7) are equal. In particular a full-ground generator universally meets the capped hazard budget precisely when H_A>=1. The necessity uses that same reference vector; it does not infer coverage of arbitrary A.

## 3. Capacity families and the sharp worst case

For a capacity restriction A={S:|S|<=a} on n coordinates,

    H_(n,a)=-log P(Bin(n,p_star)<=a).                    (F9)

Our n=ad+1 and d>=2 imply n>=2a+1. Adding independent Bernoulli trials without raising the threshold can only decrease the good probability. It remains to compare odd majority tails. Let S~Bin(2a+1,p), with p>1/2. Directly adjoining two trials gives

    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)<0.                                (F10)

The ratio P(S=a+1)/P(S=a)=p/(1-p) proves the second equality. Since a>=1, the maximal odd-tail probability occurs at a=1,n=3. Consequently

    H_(n,a) >= H_(3,1)
       =-log[3exp(-2)-2exp(-3)]
       =3-log(3e-2)=h_star>1.                           (F11)

For the last inequality, e>2 and

    e^2-(3e-2)=(e-1)(e-2)>0,

so 3exp(-2)-2exp(-3)<exp(-1). The argument includes all capacities and demands in the stated class; it is not a finite-grid extrapolation.

Equations (F8)-(F11) give, for each actual local restriction and its full-block generator,

    price({X_i}) <= rho_star [-log mu_p(D_i)],            (F12)

and the price is at most one. Thus it also meets the original P15-B local phi(q_i) premise. The inequality price<=q_i is NOT required and is in general stronger than what is proved here; at p_star in a three-coordinate block it would be false.

## 4. Global assembly on the original coordinates

First assume all local good probabilities are positive. They are independent across disjoint coordinate blocks. Global goodness implies every local restriction is good, without independence of crossing failures, so

    mu_p(D)<=product_i mu_p(D_i),
    sum_i [-log mu_p(D_i)] <= -log mu_p(D).               (F13)

Sum (F12). The unchanged setwise palette argument gives coverage at K>=K_H(d); (F13) gives its budget. If its union price exceeds one, use the empty generator. This proves (F2). If a local good probability is zero, global goodness has probability zero and the price-one cap proves the assertion. If global goodness is zero for crossing reasons alone, the same cap applies. Zero-price generators are kept for setwise completeness.

For the established six blocks of409 coordinates (a_i=1,d_i=408, all15 four-block supports), the SAME816-label cover now works for every independent p_v in [0,1] and every c_v<=phi(p_v). Its whole-ground chromatic number remains818. No coordinates are cloned, and the full crossing family is retained. At sufficiently low probabilities the earlier16/27 budget is better; on the whole cube (F2) is valid.

## 5. Sharpness and the exact demand boundary

Take one block, a=1,d=2,n=3, no macro edges and K=2. Every proper subset is two-decomposable and the full triple is not. At p_i=p_star and c_i=1, every possible generator has price one, including the empty generator. Any cover of the nonempty obstruction therefore costs at least one, and one generator attains it. The available hazard is h_star. Replacing rho_star by any smaller constant in (F2) would make its right side strictly less than one. This proves sharpness even among alternative covers, not only for our chosen full-block cover.

If d=1, n=a+1 and K=1, the sole obstruction is again the full block. At p_i=p_star,c_i=1 every cover costs at least one, but

    mu_p(D)=1-p_star^(a+1)>1-p_star=exp(-1),

hence its hazard is less than one. The universal same-palette transformed-price guarantee is false in this demand-one family. This preserves and generalizes the earlier two-coordinate counterexample; it does not retract original P15-B, whose local-budget premise is missing in that case.

Thus d>=2 is sufficient for the realized capacity family on the full probability cube, while a uniform statement admitting all d=1 examples would be false. This is not a necessity claim for every multi-block instance with some demand one; other constraints may change its budget.

## 6. Exact numerical certificate and validation limits

The proof of the simpler bound rho_star<6/7 can be made with short rational certificates. The exponential series and its positive geometric tail give

    e < 31967/11760 < 87/32,
    87/32-31967/11760=11/23520.

The positive Taylor polynomial through degree5 satisfies

    sum_(j=0)^5 (11/6)^j/j! -197/32=26081/933120>0.

Therefore 3e-2<197/32<exp(11/6), giving h_star>7/6 and rho_star<6/7.

For (F3), full_price.py bounds e by its positive series plus a geometric tail. It encloses logarithms using binary reduction and

    log x = 2 sum_(j>=0) t^(2j+1)/(2j+1), t=(x-1)/(x+1),

on 1<=x<=2, with remainder bounded by2 t^(2m+1)/[(2m+1)(1-t^2)]. Exact Fraction endpoints are propagated monotonically through the binomial tail and logarithm, then reciprocated and rounded outward to20 decimal places. No floating-point value determines a certified endpoint.

The finite suite checks the recurrence against subset enumeration, the odd-majority identity, the coordinatewise derivative sign, exact constants and endpoint conventions, heterogeneous probability grids, and preservation of the demand-one counterexample. These checks support algebra and implementation; the continuum hazard inequality is the written proof, not a conclusion from the grid. No independent reviewer, formal checker, Gaussian/RN closure or unrestricted prize acceptance is claimed.

## 7. Source and reconnaissance

Project inputs are the unchanged realized-cover and price-boundary sources linked above, original P15-B (Drive19D-eHQAIXMGGy2ThZUfZ0GGjIKWm5C2j; SHA9b18b6e9abc90d18deef06ab12e3aa7794dad40e1618d99daa88e369c300e8c3), and the published restricted-price note (Math-PR4). This proof derives (F4)-(F13) directly rather than importing a theorem from an abstract.

Primary-source reconnaissance on24September2026 read the arXiv abstracts of Gunby–He–Narayanan, Down-set thresholds,2112.08525v2, and Warnke, Note on down-set thresholds,2310.11662v2. Their downset/expectation-threshold results provide neighboring context, not the hazard-transfer theorem above, and do not license arbitrary-downset closure. The bounded search did not establish novelty or historical priority. Attribution to classical separate concavity, Bernoulli conditioning, and binomial identities is not replaced by a project-specific invention claim.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/PROOF_INDEX.md": "# Proof availability index

This file links full proof text, exact reviews, and explicitly incomplete proof obligations. Local links open the retained files in this public repository; immutable external links identify sources still on other public branches. Scientific status is unchanged by this index. Review descriptions below report the linked records, checked on 2026-09-26; they do not replace the claim manifest or the source statements.

## Imported source bytes — publication only

[PR70](https://github.com/d6g8k5htny-coder/Math-/pull/70) landed these public imports at Math- commit `9d7b6802424fb4715b31999066aafca8ee2f3cca`.
Open the [custody ledger](https://github.com/d6g8k5htny-coder/Math-/blob/9d7b6802424fb4715b31999066aafca8ee2f3cca/imports/hardening_ebedb780/README.md) or [identity manifest](https://github.com/d6g8k5htny-coder/Math-/blob/9d7b6802424fb4715b31999066aafca8ee2f3cca/imports/hardening_ebedb780/MANIFEST.json) for paths, sizes, Git blobs, and SHA256 digests.
The nine `BYTE_COPY` IDs are `EC-014`, `EC-015`, `EC-021`, `P02-LM-001`, `P02-LM-002`, `P02-LM-005`, `P02-LM-007`, `P02-LM-008`, and `P15-B`.
Their destination root is [`imports/hardening_ebedb780/`](imports/hardening_ebedb780/); the source is `d6g8k5htny-coder/main@ebedb7802024fa557e9071e4c9cec7cddc474b89`.
The separate `main#59` carrier is a labeled `TRANSCRIPTION`, not original bytes and not one of the nine byte copies.
Verify custody with `python -B -S imports/hardening_ebedb780/verify.py`.
**Publication is not acceptance.** Source self-labels are quoted, not adopted; no verdict, `lemma_closed`, prize, premise, or landing claim changes here.
The shared [public inventory](https://github.com/d6g8k5htny-coder/main/tree/main/docs/public-math) remains the catalog; this pointer creates no second inventory.

## Reviewed scoped results

- D2 lifetime remainder: proof [frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md](frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md); [R1–R4 review](https://github.com/d6g8k5htny-coder/main/issues/67#issuecomment-5841270276) and [R5/R6 delta review](https://github.com/d6g8k5htny-coder/main/issues/67#issuecomment-5841782206) record ACCEPT for Theorem R at its stated existential `O(1)`-remainder scope. The delta identifies its exact parent imports and does not consume the still-open Theorem A cubic selection bound. Numerical constants/radii, a second coefficient, and RN/24-jet closure are outside this verdict. [main #67](https://github.com/d6g8k5htny-coder/main/issues/67) remains open for other bundled fronts.
- D3 SIDE24 coefficient: proof [coefficients/side24_v1/PROOF.md](coefficients/side24_v1/PROOF.md); [C1–C6 review](https://github.com/d6g8k5htny-coder/main/issues/65#issuecomment-5841269490) verifies the coefficient calculation; [reconciliation](https://github.com/d6g8k5htny-coder/main/issues/65#issuecomment-5841779222) closes the coefficient-review work package. Interpretation as the parent lifetime law retains the parent's separate dependency and review boundaries.
- D4 fixed-remote RN theorem: proof [frontiers/remote_window_20260924/PROOF.md](frontiers/remote_window_20260924/PROOF.md); [source-bound review](https://github.com/d6g8k5htny-coder/main/issues/76#issuecomment-5841783172) and [scoped reconciliation](https://github.com/d6g8k5htny-coder/main/issues/76#issuecomment-5841861362) record ACCEPT on the seven fixed-rho/fixed-eta interfaces. Shrinking spatial cutoffs, pin/intermediate regions, and shrinking witness separation are outside that review.
- D5 all-height fixed annulus: proof [frontiers/rn_annulus_bridge_20260925/PROOF.md](frontiers/rn_annulus_bridge_20260925/PROOF.md); review [reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md](reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md) records R1–R7 ACCEPT at fixed `d=2`, fixed `L`, compact positive-gap marks, and fixed annulus `1<A<B<infinity`. Pin, intermediate, and witness-collision complements remain open. This is the full reviewed candidate body, not a global D5/RN theorem.
- D5 fixed-annulus height-window fallback: proof [frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md](frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md); review [reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md](reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md).
- D5 two-scale S6-S21: proof [frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md](frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md); review [reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md](reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md).
- D5 inner-belt gradient density: proof [frontiers/axial_density_20260925/PROOF.md](frontiers/axial_density_20260925/PROOF.md); review [reviews/replacement_20260925_pr19_pr21/REVIEW.md](reviews/replacement_20260925_pr19_pr21/REVIEW.md) accepts corollary (1) on `|z|<=W r^2`. That acceptance is the density bound only.
- D5 fixed-transverse chart: proof [reviews/downstream_boundary_20260925/TRANSVERSE_BOUND_CANDIDATE.md](reviews/downstream_boundary_20260925/TRANSVERSE_BOUND_CANDIDATE.md) (byte-for-byte import of commit `32b80ee085dc6a40113d1e46e333cda50d57ba21`, blob `024d927779f79fadaf932541ea6474f2995f8c50`); review [reviews/pr16_fixed_transverse_nonauthor_20260925/REVIEW.md](reviews/pr16_fixed_transverse_nonauthor_20260925/REVIEW.md).
- Cumulative transfer correction: proof [reviews/collision_mechanism_20260925/CUMULATIVE_TRANSFER_CORRECTION.md](reviews/collision_mechanism_20260925/CUMULATIVE_TRANSFER_CORRECTION.md); review [reviews/d2_cumulative_correction_20260925/REVIEW.md](reviews/d2_cumulative_correction_20260925/REVIEW.md) accepts this correction only.
- P15 demand-one extension: exact counterexample [frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md](frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md); review pointer in [claims/LANDING_CLAIMS.json](claims/LANDING_CLAIMS.json) is [main #67](https://github.com/d6g8k5htny-coder/main/issues/67), disposition EXACT_COUNTEREXAMPLE.
- D6 P15 full price theorem: proof [frontiers/full_price_20260924/PROOF.md](frontiers/full_price_20260924/PROOF.md); [reviews/p15_full_price_nonauthor_20260926/REVIEW.md](reviews/p15_full_price_nonauthor_20260926/REVIEW.md) records ACCEPT for Theorem F on the stated realized disjoint-capacity/clutter family, with demands at least two, independent probabilities, and the same palette. That review leaves the landing disposition untouched; it does not accept arbitrary downsets, demand-one extension, or an unrestricted prize claim.

## Open or conditional results with complete proof text in GitHub

- D1 parent lifetime theorem: full proof [imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md](imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md); support [imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md](imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md). [D1-A–E review](https://github.com/d6g8k5htny-coder/main/issues/63#issuecomment-5841570965) accepts its exact Sections 8–15 interfaces. [main #63 was reopened](https://github.com/d6g8k5htny-coder/main/issues/63#issuecomment-5841830743): Theorem A's Sections 2–7 quantitative selection chain still awaits A1–A7 review. Its A3 target must include the additive [full congruence erratum](https://github.com/d6g8k5htny-coder/Math-/blob/d573b99d8792f3d5146c952737a4ba446a549e6f/imports/lifetime_parent_20260925/ERRATUM_CONGRUENCE.md), still on [PR64](https://github.com/d6g8k5htny-coder/Math-/pull/64); the immutable parent bytes remain unchanged.
- D1 Section 9 Borel elder-mark repair: [reviews/d1_section9_borel_repair_20260925/REPAIR.md](reviews/d1_section9_borel_repair_20260925/REPAIR.md). Author-side amendment; nonauthor re-review required. The parent mirror is unchanged.
- D4 RN count interface: [frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md](frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md).
- D5 thin-tube candidate: [frontiers/rn_thin_tube_20260925/PROOF.md](frontiers/rn_thin_tube_20260925/PROOF.md). Independent review is open. This file is distinct from the reviewed two-scale addendum and the reviewed fixed-annulus candidate.
- D5 contact-kernel tail note: [frontiers/contact_kernel_tail_20260925/NOTE.md](frontiers/contact_kernel_tail_20260925/NOTE.md). Author-side. Distinct from [reviews/contact_kernel_tail_20260925/](reviews/contact_kernel_tail_20260925/).
- D6 P15 realized covers: [frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md](frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md).
- D6 P15 restricted price theorem: [frontiers/price_budget_20260924/PROOF.md](frontiers/price_budget_20260924/PROOF.md).
- Collision/transfer note: [reviews/collision_mechanism_20260925/NOTE.md](reviews/collision_mechanism_20260925/NOTE.md). Sections B–C: [reviews/pr25_contact_kernel_20260925/REVIEW.md](reviews/pr25_contact_kernel_20260925/REVIEW.md) accepts R1–R4. [reviews/pr25_typed_transfer_nonauthor_20260925/REVIEW.md](reviews/pr25_typed_transfer_nonauthor_20260925/REVIEW.md) accepts R1–R2 and marks R3 AMEND_REQUIRED; that cumulative amendment is the separate reviewed correction above. Section A is outside both acceptances.
- Contact-kernel work: [reviews/contact_kernel_tail_20260925/KERNEL_TAILS_AND_SMALL_GAP.md](reviews/contact_kernel_tail_20260925/KERNEL_TAILS_AND_SMALL_GAP.md) and [reviews/contact_kernel_tail_20260925/ANNULUS_ASYMPTOTIC_BRIDGE.md](reviews/contact_kernel_tail_20260925/ANNULUS_ASYMPTOTIC_BRIDGE.md). The kernel note cites `TRANSVERSE_CONTACT_ASYMPTOTIC.md`. **SOURCE NOT FOUND IN GIT / RECOVERY OPEN** at [Math #56](https://github.com/d6g8k5htny-coder/Math-/issues/56). The proof note is unchanged; neither this index nor the nearby annulus note supplies the missing exposition.

## Open obligations without a complete proof yet

- D5 pin neighborhoods: retained derivations are [reviews/d5_finite_r_hermite_repair_20260925/REPAIR.md](reviews/d5_finite_r_hermite_repair_20260925/REPAIR.md) and [reviews/d5_finite_r_hermite_repair_20260925/C6_REMAINDERS.md](reviews/d5_finite_r_hermite_repair_20260925/C6_REMAINDERS.md), with M1–M7 and S1–S4 accepted in [reviews/replacement_20260925_pr19_pr21/REVIEW.md](reviews/replacement_20260925_pr19_pr21/REVIEW.md). The newer public [PR53 reconnaissance note](https://github.com/d6g8k5htny-coder/Math-/blob/9a6f8a660d4508ec273b67d67e6b3871ddf2aa19/reviews/pin_neighborhood_recon_20260926/NOTE.md) has an [AMEND review in PR55](https://github.com/d6g8k5htny-coder/Math-/blob/4e188e25b1e1ef560f3eeb75c0d354d2ccf0ea22/reviews/d5_pin_neighborhood_20260926/REVIEW.md). These sources are on unmerged branches. **NO COMPLETE PROOF YET:** the inner microdisk bound and the open collar to the reviewed annulus are not supplied by that reconnaissance. [Math #58](https://github.com/d6g8k5htny-coder/Math-/issues/58) tracks the microdisk derivation; the claimed summed pin-neighborhood bound remains AMEND.
- D5 intermediate scale r << |x| << rho: bounded on opposite sides by [frontiers/remote_window_20260924/PROOF.md](frontiers/remote_window_20260924/PROOF.md) and by the reviewed fixed-annulus proofs [frontiers/rn_annulus_bridge_20260925/PROOF.md](frontiers/rn_annulus_bridge_20260925/PROOF.md) and [frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md](frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md). NO COMPLETE PROOF YET: uniform growing-scaled-radius bridge.
- D5 shrinking multiple-witness collision: fixed-separation machinery is [frontiers/remote_window_20260924/PROOF.md](frontiers/remote_window_20260924/PROOF.md) section 6, (15)–(16), at fixed `eta>0`. NO COMPLETE PROOF YET: shrinking-separation factorial-moment/collision estimate.
- D0 historical CH-LIFT/Piece-2/24-jet obligations outside reviewed regional bypasses: see [frontiers/downstream_gate_20260925/GRAPH.json](frontiers/downstream_gate_20260925/GRAPH.json). NO COMPLETE PROOF YET where not explicitly superseded; absent historical carriers remain ABSENT.

## Repository rule

A reviewed/closed theorem or lemma must have its full proof or immutable byte-bound mirror in this repository plus the exact review/certificate. An open theorem with a complete candidate proof must link it here. An open item without a complete proof must link the strongest partial derivation and state the missing proof explicitly. Superseded/refuted work stays available. Tests and hashes are evidence, not substitutes for analytic proof. A navigation refresh records source availability and existing review scope; any change to [claims/LANDING_CLAIMS.json](claims/LANDING_CLAIMS.json) or the D0-D7 graph requires its own source-bound reconciliation through the existing validators.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/claims/LANDING_CLAIMS.json": "{
  "schema_version": 1,
  "object": "MATH-LANDING-CLAIMS-20260925-v1",
  "repository": "d6g8k5htny-coder/Math-",
  "audited_default_commit": "760340e921ac4ceda296b8118da936f1133e956e",
  "landing_path": "README.md",
  "live_queue": {
    "repo": "d6g8k5htny-coder/main",
    "issue": 86,
    "url": "https://github.com/d6g8k5htny-coder/main/issues/86",
    "required_state": "open"
  },
  "allowed_dispositions": [
    "HOLD_WITH_DOMAIN",
    "FAIL_CLOSED",
    "EXACT_COUNTEREXAMPLE",
    "REVIEWED_SCOPED",
    "ENGINEERING_HOLD"
  ],
  "claims": [
    {
      "claim_id": "side24-coefficient",
      "advertised_label": "Gaussian lifetime coefficient",
      "claim_type": "derived numerical enclosure of imported expression",
      "statement_path": "coefficients/side24_v1/PROOF.md",
      "statement_heading": "Theorem",
      "source": {
        "commit": "760340e921ac4ceda296b8118da936f1133e956e",
        "blob": "44b66f04f89fcd87383b3603fa69f1feb64cdddd"
      },
      "domain": "exact normalized SIDE24 periodized Gaussian model; dimensions d=2 and d=3; coefficient defined by parent main#63 Eq.15.2",
      "measure": "scalar coefficient in the parent per-unit-volume lifetime-density normalization",
      "required_dependencies": [
        {
          "kind": "support",
          "id": "main#63:eq15.2-parent",
          "path": "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md",
          "source": {
            "commit": "c39164254ad1529ed49543743598d5dcb24bab98",
            "blob": "dfed3b8d318a3ab1950957f393307733a4bef3f2"
          },
          "review": {
            "kind": "github_issue",
            "repo": "d6g8k5htny-coder/main",
            "number": 63,
            "url": "https://github.com/d6g8k5htny-coder/main/issues/63"
          },
          "required_for": "persistence interpretation"
        }
      ],
      "review": {
        "kind": "github_issue",
        "repo": "d6g8k5htny-coder/main",
        "number": 65,
        "url": "https://github.com/d6g8k5htny-coder/main/issues/65"
      },
      "disposition": "HOLD_WITH_DOMAIN",
      "disposition_reason": "parent source is now byte-bound in-tree; persistence interpretation remains conditional on open analytic review #63"
    },
    {
      "claim_id": "lifetime-remainder",
      "advertised_label": "Quantitative lifetime density",
      "claim_type": "derived theorem",
      "statement_path": "frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md",
      "statement_heading": "Theorem R",
      "source": {
        "commit": "760340e921ac4ceda296b8118da936f1133e956e",
        "blob": "247b3ecf80bfbe896948d5d489b2d5842a81c481"
      },
      "domain": "each fixed torus d>=2,L>0; all birth/gap marks, orientations and separations; finite ordinary H0 bars with essential global maximum excluded",
      "measure": "per-unit-volume lifetime density with respect to d ell",
      "required_dependencies": [
        {
          "kind": "support",
          "id": "main#63:matrix-cap-lifetime",
          "path": "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md",
          "source": {
            "commit": "c39164254ad1529ed49543743598d5dcb24bab98",
            "blob": "dfed3b8d318a3ab1950957f393307733a4bef3f2"
          },
          "review": {
            "kind": "github_issue",
            "repo": "d6g8k5htny-coder/main",
            "number": 63,
            "url": "https://github.com/d6g8k5htny-coder/main/issues/63"
          },
          "required_for": "marked Kac-Rice, global elder, regression and parent coefficient interfaces"
        },
        {
          "kind": "support",
          "id": "marked-cylinder-cap",
          "path": "imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md",
          "source": {
            "commit": "c39164254ad1529ed49543743598d5dcb24bab98",
            "blob": "0633aca3c2a2882b0de4399da0a75d64c2e6b2e1"
          },
          "review": {
            "kind": "github_issue",
            "repo": "d6g8k5htny-coder/main",
            "number": 63,
            "url": "https://github.com/d6g8k5htny-coder/main/issues/63"
          },
          "required_for": "deterministic sufficient pairing event"
        }
      ],
      "review": {
        "kind": "github_issue",
        "repo": "d6g8k5htny-coder/main",
        "number": 67,
        "url": "https://github.com/d6g8k5htny-coder/main/issues/67"
      },
      "disposition": "FAIL_CLOSED",
      "disposition_reason": "all named parent source bytes are now in-tree; theorem remains fail-closed because parent/global elder/Kac-Rice interfaces are still analytically open on #63"
    },
    {
      "claim_id": "rn-count-interface",
      "advertised_label": "RN critical-point counting",
      "claim_type": "derived logical interface and exact counterexamples",
      "statement_path": "frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md",
      "statement_heading": "Theorem N",
      "source": {
        "commit": "760340e921ac4ceda296b8118da936f1133e956e",
        "blob": "371fd6d17920f2eb3b1c5ec30297acf6daf1d385"
      },
      "domain": "abstract event/count implications plus pinned Gaussian weighted-count interface",
      "measure": "event probability, integer-valued count expectation, and endpoint-weighted Kac-Rice integral kept distinct",
      "required_dependencies": [],
      "review": {
        "kind": "github_issue",
        "repo": "d6g8k5htny-coder/main",
        "number": 67,
        "url": "https://github.com/d6g8k5htny-coder/main/issues/67"
      },
      "disposition": "HOLD_WITH_DOMAIN",
      "disposition_reason": "logical implications/counterexamples are in-tree; complete Gaussian numerator is a target rather than a discharged global RN theorem"
    },
    {
      "claim_id": "rn-fixed-remote-window",
      "advertised_label": "RN fixed-remote height window",
      "claim_type": "derived theorem",
      "statement_path": "frontiers/remote_window_20260924/PROOF.md",
      "statement_heading": "Theorem A",
      "source": {
        "commit": "760340e921ac4ceda296b8118da936f1133e956e",
        "blob": "b383bfcc88ec4ad497dff01fb6640e429ba24a84"
      },
      "domain": "fixed d>=2,L>0; fixed rho>0 spatial exclusion; compact birth interval and compact positive gap marks; between-pin height window",
      "measure": "expected critical-point count / physical volume and corresponding mean intensity",
      "required_dependencies": [
        {
          "kind": "external",
          "id": "marked-kac-rice-framework",
          "binding_status": "IMPORTED_FRAMEWORK",
          "reference": "arXiv:2304.07424",
          "required_for": "expected-count representation"
        }
      ],
      "review": {
        "kind": "github_issue",
        "repo": "d6g8k5htny-coder/main",
        "number": 76,
        "url": "https://github.com/d6g8k5htny-coder/main/issues/76"
      },
      "disposition": "HOLD_WITH_DOMAIN",
      "disposition_reason": "fixed-remote source exists; shrinking exclusion, collisions and global RN complement remain outside scope"
    },
    {
      "claim_id": "rn-fixed-annulus-window",
      "advertised_label": "RN reviewed fixed-annulus height window",
      "claim_type": "source-bound reviewed scoped theorem",
      "statement_path": "frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md",
      "statement_heading": "Candidate theorem",
      "source": {
        "commit": "760340e921ac4ceda296b8118da936f1133e956e",
        "blob": "081abc13c5e66342c13df2af2bd6b114f320486f",
        "reviewed_subject_commit": "2804dc1db27ef3b1fdef6bb350b486162692cc4a"
      },
      "domain": "d=2; fixed L; fixed scaled annulus 1<A0<=|y|<=B0<infinity; compact positive gap marks k_->0; all frames; between-pin height window",
      "measure": "expected index-j critical-point count in rE; physical area r^2 area(E)",
      "required_dependencies": [
        {
          "kind": "support",
          "id": "two-scale-s6-s21",
          "path": "frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md",
          "source": {
            "commit": "760340e921ac4ceda296b8118da936f1133e956e",
            "blob": "89cae3a9734f2ec7172cd0b6b0b3af3ddd355d73",
            "reviewed_subject_commit": "b2e1652f1374c3b45759324a1ad1fd4177458500"
          },
          "review": {
            "path": "reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md",
            "source": {
              "commit": "760340e921ac4ceda296b8118da936f1133e956e",
              "blob": "8988251631cab8e65eb2b01a08f7fc593b018570",
              "reviewed_subject_commit": "bc7d75454d30d84be9d46c210eefecde71835d1d"
            }
          }
        },
        {
          "kind": "external",
          "id": "marked-kac-rice-framework",
          "binding_status": "IMPORTED_FRAMEWORK",
          "reference": "arXiv:2304.07424",
          "required_for": "expected-count representation"
        }
      ],
      "review": {
        "kind": "local_file",
        "path": "reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md",
        "source": {
          "commit": "760340e921ac4ceda296b8118da936f1133e956e",
          "blob": "1f153966dae48d10574db0d272f75d08ca3a8b23"
        },
        "disposition": "ACCEPT",
        "scope": "eight declared interfaces for fixed-annulus between-pin-height-window theorem only"
      },
      "disposition": "REVIEWED_SCOPED",
      "disposition_reason": "nonauthor technical review accepts exact fixed-annulus scope; no global D5/RN/JETMOD transfer"
    },
    {
      "claim_id": "p15-realized-covers",
      "advertised_label": "P15 obstruction covers",
      "claim_type": "derived combinatorial theorem",
      "statement_path": "frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md",
      "statement_heading": "Theorem P",
      "source": {
        "commit": "760340e921ac4ceda296b8118da936f1133e956e",
        "blob": "173881916ccd0e738bdb41279e835e78e520fcbc"
      },
      "domain": "explicit realized capacity/clutter family on original coordinates",
      "measure": "finite generator-cover cost and integer palette threshold",
      "required_dependencies": [],
      "review": {
        "kind": "github_issue",
        "repo": "d6g8k5htny-coder/main",
        "number": 67,
        "url": "https://github.com/d6g8k5htny-coder/main/issues/67"
      },
      "disposition": "HOLD_WITH_DOMAIN",
      "disposition_reason": "scope is the realized family; no arbitrary-P15 extension"
    },
    {
      "claim_id": "p15-price-boundary",
      "advertised_label": "P15 failed extension",
      "claim_type": "exact counterexample",
      "statement_path": "frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md",
      "statement_heading": "Counterexample",
      "source": {
        "commit": "760340e921ac4ceda296b8118da936f1133e956e",
        "blob": "1d6946658e00e2446d68e8a4884425d4bcec62fb"
      },
      "domain": "one capacity-one demand-one block; same palette; transformed prices",
      "measure": "finite generator-cover price versus probability hazard",
      "required_dependencies": [],
      "review": {
        "kind": "github_issue",
        "repo": "d6g8k5htny-coder/main",
        "number": 67,
        "url": "https://github.com/d6g8k5htny-coder/main/issues/67"
      },
      "disposition": "EXACT_COUNTEREXAMPLE",
      "disposition_reason": "kills only the declared demand-one same-palette extension; does not refute d_i>=2 successors"
    },
    {
      "claim_id": "p15-price-budget-restricted",
      "advertised_label": "P15 valid price extension",
      "claim_type": "derived theorem",
      "statement_path": "frontiers/price_budget_20260924/PROOF.md",
      "statement_heading": "Theorem T1",
      "source": {
        "commit": "760340e921ac4ceda296b8118da936f1133e956e",
        "blob": "9b17d179d2408dae9ea497d3c6e5c6538d2c3b8b"
      },
      "domain": "realized capacity/clutter family; demands d_i>=2; probabilities p_v<=1/4; c_v<=phi(p_v); same palette",
      "measure": "generator-cover price compared with global hazard -log mu_p(D)",
      "required_dependencies": [
        {
          "kind": "claim",
          "id": "p15-realized-covers"
        }
      ],
      "review": {
        "kind": "github_issue",
        "repo": "d6g8k5htny-coder/main",
        "number": 67,
        "url": "https://github.com/d6g8k5htny-coder/main/issues/67"
      },
      "disposition": "HOLD_WITH_DOMAIN",
      "disposition_reason": "positive successor at restricted probability domain; independent theorem review not yet source-bound in manifest"
    },
    {
      "claim_id": "p15-full-price",
      "advertised_label": "P15 full probability range",
      "claim_type": "derived theorem with sharp factor",
      "statement_path": "frontiers/full_price_20260924/PROOF.md",
      "statement_heading": "Theorem F",
      "source": {
        "commit": "760340e921ac4ceda296b8118da936f1133e956e",
        "blob": "582180e41dca0ad815ad0f18574df42040912149"
      },
      "domain": "same realized capacity/clutter family; demands d_i>=2; all independent p_v in [0,1]; c_v<=phi(p_v); same palette",
      "measure": "generator-cover price compared with global hazard -log mu_p(D)",
      "required_dependencies": [
        {
          "kind": "support",
          "id": "p15-realized-covers:setwise-interfaces",
          "path": "frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md",
          "source": {
            "commit": "760340e921ac4ceda296b8118da936f1133e956e",
            "blob": "173881916ccd0e738bdb41279e835e78e520fcbc"
          },
          "review": {
            "kind": "local_file",
            "path": "reviews/p15_full_price_nonauthor_20260926/REVIEW.md",
            "source": {
              "commit": "1e1114f5eb8ef8cdbcde591bf74126274c250f88",
              "blob": "07db19f826763b8faa7414ba2e403d9c45bc0b6e"
            },
            "disposition": "ACCEPT",
            "scope": "Source exposure and sections 2/4: realized-family definition (P1), actual local restrictions (P2), and Theorem P2 full-block cover at K>=K_H(d), as used by Theorem F with d_i>=2; excludes the c_v<=p_v price theorem and broader parent acceptance"
          },
          "required_for": "actual capacity restrictions and setwise same-palette full-block coverage only; Theorem F derives its transformed-price budget separately"
        }
      ],
      "review": {
        "kind": "local_file",
        "path": "reviews/p15_full_price_nonauthor_20260926/REVIEW.md",
        "source": {
          "commit": "1e1114f5eb8ef8cdbcde591bf74126274c250f88",
          "blob": "07db19f826763b8faa7414ba2e403d9c45bc0b6e"
        },
        "disposition": "ACCEPT",
        "scope": "Theorem F on the realized disjoint capacity/clutter family with a_i>=1, d_i>=2, all independent p in [0,1]^X, c_v<=phi(p_v), same palette K>=K_H(d), sharp rho*=1/[3-log(3e-2)]"
      },
      "disposition": "REVIEWED_SCOPED",
      "disposition_reason": "source-bound xAI/Grok nonauthor technical review ACCEPTS Theorem F at its exact realized-family scope; no arbitrary-downset, demand-one, or unrestricted P15-prize transfer"
    },
    {
      "claim_id": "downstream-hard-gate",
      "advertised_label": "Downstream hard gate",
      "claim_type": "engineering integrity control",
      "statement_path": "frontiers/downstream_gate_20260925/README.md",
      "statement_heading": "What it enforces",
      "source": {
        "commit": "760340e921ac4ceda296b8118da936f1133e956e",
        "blob": "7f07316b733ab32aceeb982051c049d62fb1ef6f"
      },
      "domain": "machine dependency graph and repository-source transitions",
      "measure": "not a mathematical measure; loss-only revalidation/control state",
      "required_dependencies": [],
      "review": {
        "kind": "github_issue",
        "repo": "d6g8k5htny-coder/main",
        "number": 90,
        "url": "https://github.com/d6g8k5htny-coder/main/issues/90"
      },
      "disposition": "ENGINEERING_HOLD",
      "disposition_reason": "local integrity semantics exist; repository-wide external controlling-source binding remains unresolved"
    }
  ],
  "forbidden_global_inferences": [
    "global RN closure",
    "unrestricted P15 prize closure",
    "unconditional acceptance of the lifetime parent",
    "lemma_closed=true"
  ],
  "meaning": "machine-readable landing inventory; source/review identity and scope only, never theorem acceptance by itself"
}
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/imports/hardening_ebedb780/EC-014/proof.md.export.txt": "﻿TECHNICAL GATE UPDATE — 2026-07-22


C047R-AUD-001-v1.0 independently read File 4, re-derived the full matrix determinant, density Jacobian, both planted denominator mutations, and the contact-power ledger, and filed APPROVE EXACT SCOPE. The frozen AO48/CW/C047R gate is therefore satisfied. EC-014 is now HUMAN-APPROVAL-READY and remains nonterminal until Dylan M. Roy explicitly approves the exact §10 wording. No broader analytic, probabilistic, asymptotic, theorem, machine, release, or destructive claim follows.


Review: https://docs.google.com/document/d/1z9VnetmhM00hA_K6ikgPT64hrf6swtVSWN58Al7I-Co/edit
[[OBJ:C047R-AUD-001-v1.0]] [[QUEUE:EC-014]] [[STATUS:HUMAN-APPROVAL-READY]] [[STATUS:NOT-TERMINAL]]


GP-CLS-PROP-017-v1.0 — CONDITIONAL TERMINAL CLOSURE PACKAGE FOR EC-014


Corrected Six-Pin Pair-Frame Jacobian and Contact-Power Identity


Artifact ID: GP-CLS-PROP-017-v1.0
Prepared by: GP — OpenAI GPT-5.6 Thinking
Created: 2026-07-21
Class: CLS-PROP — complete additive terminal package pending one outside technical gate and Dylan approval
Authority: none until the stated gates pass
Canonical impact: NONE at current status
Queue item: EC-014


Current status:


    PACKAGE COMPLETE — AO48 OR CW/C047R SCOPE VERDICT REQUIRED;
    DYLAN M. ROY TERMINAL APPROVAL REQUIRED AFTER THAT VERDICT.


[[OBJ:GP-CLS-PROP-017-v1.0]] [[QUEUE:EC-014]] [[OBJ:GP-DER-061-v1.0]] [[OBJ:CL-DER-051-v1.0]] [[OBJ:CL-AUD-059-v1.0]] [[STATUS:CONDITIONAL-CLOSURE-PACKAGE]]


1. Proposed terminal label


    CLOSED — EXACT CORRECTED SIX-PIN PAIR-FRAME JACOBIAN AND CONTACT-POWER IDENTITY


2. Exact object proposed for closure


Let M=x_m=(-r/2,0), S=x_s=(+r/2,0), r>0, with longitudinal coordinate t and transverse coordinate s. The raw ordered vector is


    X_r = ( f(M), f(S), f_t(M), f_s(M), f_t(S), f_s(S) ).


The corrected ordered frame is


    Y_r = ( V^+, V^-_corr, G_t^+, G_t^-, G_s^+, G_s^- ),


where


    V^+       = [f(S)+f(M)]/2,
    V^-_corr  = [f(S)-f(M)-r(f_t(S)+f_t(M))/2]/r^3,
    G_t^+     = [f_t(S)+f_t(M)]/2,
    G_t^-     = [f_t(S)-f_t(M)]/r,
    G_s^+     = [f_s(S)+f_s(M)]/2,
    G_s^-     = [f_s(S)-f_s(M)]/r.


Under those exact row and column orders, Y_r=T_rX_r with


    T_r =
      [  1/2      1/2          0          0          0          0 ]
      [ -r^-3     r^-3    -1/(2r^2)      0    -1/(2r^2)      0 ]
      [   0        0          1/2         0         1/2         0 ]
      [   0        0         -r^-1        0          r^-1       0 ]
      [   0        0           0         1/2          0         1/2]
      [   0        0           0        -r^-1         0          r^-1].


The exact proposed terminal facts are only:


A. The displayed ordering and matrix are correct.


B. Under that ordering,


       det T_r = -r^-5.


   If a different column ordering is used, the sign may change by permutation parity, while the density invariant remains


       |det T_r| = r^-5.


C. Under the declared change-of-variables convention,


       p_X(x_r) = |det T_r| p_Y(y_r)
                = r^-5 p_Y(y_r).


D. For the canonical fold gap r^3/6 and the separate r^2 normalizer factor, the exact power ledger is


       (r^3/6) r^-5 r^2 = 1/6,


   with exponent cancellation 3-5+2=0.


3. Evidence package


Primary source:


- File 4 — The Pinning Lemma and Critical-Pair Palm Conditioning, §3.1–3.2, equations (3.1)–(3.4), Drive ID 1lbZzqFOwMubvnD0KBqT9pTlIIIXxUnTA.


GP reconstruction:


- GP-DER-061-v1.0, Drive ID 1LFs1OlJwHvPTjby9Vjfua3X9L3iQNey_gRu0crd0og8.
- Displays all 36 entries, a block determinant proof, exact arithmetic receipt, density convention, mutation, and power cancellation.


Independent non-GP reconstruction:


- CL-DER-051-v1.0, raw reconstruction Drive ID 1473ziDIe6j0Lf-mq-i68WWNWNqvJRU42Gfq6rNdTImY and narrative copy 1ldozsT3QmQwD8rFVTBCXJuLEm1WgNzgmTOXJFKUmCT4.
- Rebuilt the frame directly from File 4 before reading the GP derivation; exact determinant, density, two mutations, and power ledger agree.


Additional primary-source corroboration and scope read:


- CL-AUD-059-v1.0, Drive ID 1VHrkP1rMAUSbJ9BuPnzY4rpuXaWQKTBDXgdH6JpFeos.
- Independently regenerated all matrix entries with stdlib Fractions, detected both denominator-power mutations, recovered coalesced compatibility determinants 12 and 1/12, and confirmed the narrow four-fact scope.
- CL-AUD-059 explicitly states that it cannot satisfy the final AO48/CW-only gate.


4. Negative controls and sensitivity


The evidence package contains at least these decisive mutations:


M1. Replace the denominator r in G_t^- by r^2.


    Expected and observed determinant: -r^-6, not -r^-5.


M2. Replace the denominator r^3 in V^-_corr by r^2.


    Expected and observed determinant: -r^-4, not -r^-5.


The mutations show that the determinant exponent is sensitive to the exact normalized frame and is not an accidental symbolic simplification.


5. Independent-review status


Completed:


- GP exact derivation and execution.
- CL independent primary-source reconstruction.
- CL separate disjoint-tool primary-source corroboration and scope read.


Still required by the frozen EC-014 acceptance rule:


- one explicit scope inspection from AO48 or CW/C047R, a line that is neither GP nor CL.


CL-AUD-059 is strong corroboration but cannot manufacture the required different-line gate. Silence is not verification.


6. Exact scope exclusions


The proposed closure does NOT close, prove, imply, strengthen, or promote any of the following:


- uniform invertibility or spectral bounds for the corrected-frame covariance as r→0;
- convergence of Sigma(r) to Sigma(0);
- the coalesced covariance determinants 12 or 1/12, which remain compatibility facts outside the terminal object;
- existence, positivity, convergence, or value of z_r;
- positivity or convergence of a contact coefficient;
- a finite nonzero contact limit;
- any lifetime-density constant or exponent;
- adjacency, selected-branch capture, or elder-rule selection;
- P0.2, Theorem B, q_typed, q_adj, or a_r;
- exact-torus Gaussian regularity beyond the fixed finite-r algebra;
- GP-AUTO-034 activation, any q-machine root, active machine state, ballot, or external release.


The factor 1/6 is only the displayed algebraic power cancellation. It is not the value of a complete contact-limit coefficient.


7. Dependencies affected upon accepted closure


Affected:


- EC-014 leaves active attention and becomes a terminal exact-object record.
- Routine re-derivation of the matrix, determinant, density convention, two denominator-power sensitivities, and four-factor power ledger stops.
- Downstream documents may cite the exact terminal label for these four facts.
- The Easy Closure Queue, Closure Log, Recent Activity, Artifact Index, and Relation Index receive additive entries.


8. Dependencies explicitly unaffected


Unaffected:


- File 4 Lemma P1 and every uniform r→0 analytic assertion;
- exact finite-r six-pin conditional Gaussian laws and their outside acceptance gates;
- typed-to-fold Palm conditionalization;
- z_r and normalizer convergence;
- contact-limit analysis;
- elder-rule and adjacency probabilities;
- P0.2 stages V1–V5;
- Theorem B and the lifetime law;
- all open exact-field transfer and practical-r tasks;
- exact R0.2 ballot count;
- GP-AUTO-034, active machines, releases, and destructive workflows.


9. Required AO48 or CW/C047R response


The reviewer should file an additive response containing exactly:


Line/model identity:


Sources read:


Independence disclosure:


Verdict — choose one:


    APPROVE EXACT SCOPE
    APPROVE WITH AMENDMENT
    REJECT WITH DEFECT
    CANNOT VERIFY


The response must explicitly answer:


1. Does the declared raw ordering match File 4 (3.1)?
2. Does the corrected frame match File 4 (3.2)–(3.4)?
3. Is det T_r=-r^-5 under the declared ordering, with |det|=r^-5 invariant under sign-changing permutations?
4. Is p_X=r^-5p_Y the correct declared density convention?
5. Do the two planted mutations change the determinant power as stated?
6. Is (r^3/6)r^-5r^2=1/6 exact?
7. Does the terminal scope stop before every excluded analytic, probabilistic, asymptotic, theorem, and machine claim in §6?


Only `APPROVE EXACT SCOPE` or a fully incorporated `APPROVE WITH AMENDMENT` completes the technical gate.


10. Dylan M. Roy terminal approval requirement


After the outside scope gate passes, Dylan may approve by stating:


    “I approve EC-014 exactly within GP-CLS-PROP-017-v1.0’s declared four-fact object and exclusions. Record the terminal label CLOSED — EXACT CORRECTED SIX-PIN PAIR-FRAME JACOBIAN AND CONTACT-POWER IDENTITY, append the Closure Log, remove EC-014 from active attention, preserve all sources and reopening paths, and infer no contact-limit, adjacency, P0.2, Theorem B, machine, or release claim.”


No human approval is inferred from the current instruction to continue working in Drive. The named terminal decision remains required after the technical gate.


11. Prewritten register updates after both gates pass


Closure Log row:


Item:
    EC-014 corrected six-pin pair-frame Jacobian and contact-power identity


Exact object:
    Declared X_r/Y_r ordering and T_r; det T_r=-r^-5 under declared ordering; |det|=r^-5; p_X=r^-5p_Y; two denominator-power mutations; (r^3/6)r^-5r^2=1/6.


Evidence:
    File 4 (3.1)–(3.4); GP-DER-061; CL-DER-051; CL-AUD-059; final AO48/CW scope response.


Independent review:
    CL primary-source reconstruction plus AO48/CW final scope approval.


Dependencies affected:
    EC-014 active queue and repeated exact matrix/power checks.


Dependencies unaffected:
    all objects listed in §§6 and 8.


Terminal label:
    CLOSED — EXACT CORRECTED SIX-PIN PAIR-FRAME JACOBIAN AND CONTACT-POWER IDENTITY


Human approval:
    Dylan’s explicit post-gate approval.


Closure artifact:
    a new terminal GP-CLS record citing this package and the final responses.


Easy Closure Queue update:


    TERMINAL — REMOVED FROM ACTIVE ATTENTION


Relation update:


    terminal closure record TERMINALLY_CLOSES EC-014


12. Reopening path


Additive only. Reopen EC-014 on:


- a matrix-entry or ordering contradiction tied to the primary equations;
- a determinant sign/power error;
- a density-Jacobian convention defect;
- a mutation failure;
- an error in the four-factor power identity;
- evidence that the terminal record exceeded the declared scope.


A broader theorem defect does not reopen this algebraic object unless it demonstrates one of those exact failures.


13. Current disposition


    COMPLETE CONDITIONAL CLOSURE PACKAGE.
    TECHNICAL GATE 5 OPEN — AO48 OR CW/C047R.
    HUMAN TERMINAL APPROVAL OPEN — AFTER GATE 5.
    EC-014 REMAINS ACTIVE UNTIL BOTH EXPLICIT GATES PASS.


No closure, theorem promotion, machine change, ballot change, release, deletion, or destructive action occurs by publishing this package.


END GP-CLS-PROP-017-v1.0", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/coefficients/side24_v1/ENCLOSURE.json": "ewogICJjb25lX21vbWVudHMiOiB7CiAgICAiMiI6ICI0LzMiLAogICAgIjMiOiAiMjkvNi1zcXJ0KDYpIgogIH0sCiAgImRpbWVuc2lvbnMiOiB7CiAgICAiMiI6IHsKICAgICAgImxvd2VyIjogIjAuMDczNDA2OTE5MzA2MDM0MjcxMDMiLAogICAgICAidXBwZXIiOiAiMC4wNzM0MDY5MTkzMDYwMzQyNzEwNCIKICAgIH0sCiAgICAiMyI6IHsKICAgICAgImxvd2VyIjogIjAuMDQxNzc1OTMxODQwNTk4MzQzMzQiLAogICAgICAidXBwZXIiOiAiMC4wNDE3NzU5MzE4NDA1OTgzNDMzNSIKICAgIH0KICB9LAogICJpbWFnZV9sZWRnZXIiOiB7CiAgICAiY292YXJpYW5jZV9yZWxhdGl2ZV9ib3VuZCI6ICIzMTc2MzYwNzg3OTcxNy8yNTAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwIiwKICAgICJkZW5zaXR5X2NvbXBhcmlzb25fYmVsb3dfcmVwb3J0ZWQiOiB0cnVlLAogICAgImRlcml2YXRpdmVfYm91bmQiOiAiMTA1ODc4NjkyOTMyMzkvNTAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAiLAogICAgImV4cF9sb3dlcl9ndF8xMCI6IHRydWUsCiAgICAiaW1hZ2VfY29uc3RhbnQiOiAyMTE3NTczODU4NjQ3OCwKICAgICJyZWxhdGl2ZV9iZWxvd19lcHMiOiB0cnVlCiAgfSwKICAibWV0aG9kIjogIm91dHdhcmQgcmF0aW9uYWwgYXJpdGhtZXRpYzsgYW5hbHl0aWMgaW1hZ2UgYW5kIFN0aXJsaW5nIHJlbWFpbmRlciBib3VuZHMiLAogICJvYmplY3QiOiAiU0lERTI0LUNPRUZGSUNJRU5ULUQyMy0yMDI2MDkyNC12MSIsCiAgInJlbGF0aXZlX3BlcmlvZGl6YXRpb25fYm91bmQiOiAiMWUtMTA2IiwKICAic2NpZW50aWZpY19hY2NlcHRhbmNlIjogZmFsc2UsCiAgInNjb3BlIjogImNvZWZmaWNpZW50IG9mIGlzc3VlNjMgRXExNS4yOyBwYXJlbnQgdGhlb3JlbSB1bnJldmlld2VkIgp9Cg==", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md": "# Nonauthor review — PR28 all-height fixed-annulus bridge

Scientific effect: **NONE**. This file does not change `lemma_closed`, prizes, premises, or any scientific-status graph. It is not permission to promote the candidate, merge it, or treat (2) as a closed prerequisite.

## Claim

| Field | Value |
|---|---|
| Object | Math- pull request 28, queued from issue 29 after the PR25 review was released |
| Immutable commit | `dedc69e1b786f7ad148e6b66718277f4145c99cd` |
| Path | `frontiers/rn_annulus_bridge_20260925/PROOF.md` |
| Blob | `6f317515b3d417661f86e2fed09bc7d950899c2b` |
| Size | 16948 bytes |
| SHA256 | `d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05` |
| Author of the object | OpenAI / ChatGPT, session OA-D5-ANNULUS-BRIDGE-20260925 |
| Scope | Interfaces R1–R7 of that proof, at the fixed d=2, fixed L, compact birth, `k_- > 0`, and fixed annulus `1 < A < B < ∞` stated in Section 1 |
| Excluded | A new proof, any edit of the author source, child agents, PR22's height-window route, PR25's D2 correction, PR35, pin neighborhoods, `A → 1/2`, growing `B`, intermediate distances, witness collisions, `d ≥ 3`, numerical constants, elder selection, lifetime acceptance, and `k → 0` uniformity |
| State | ACTIVE on publication of this file. The 120-minute stale-claim convention runs from this commit's author timestamp. |
| Write scope | `reviews/pr28_annulus_bridge_nonauthor_20260925/` only |

## Reviewer provenance

| Field | Value |
|---|---|
| Provider | xAI |
| Model | Grok 4.7 (run id `grok-4.7-high-fast`) |
| Agent | Cursor cloud run `bc-872dce35-767b-4527-b323-bba1c989bed2` |
| Run URL | https://cursor.com/agents/bc-872dce35-767b-4527-b323-bba1c989bed2 |
| Account wrapper | Cursor application, owning user Electric_Universe_Theory |

Organizational independence is **not awarded**. A distinct Cursor session is not organizational independence. The shared workspace account does not separate this run from the account that committed the OpenAI text.

Provider independence is different from that organizational fact. The candidate's author is OpenAI. This reviewer is xAI Grok, not an OpenAI session, so the dispositions below are a cross-provider technical review rather than an OpenAI self-review.

## Source exposure

Read in full at the immutable commit above:

| Path | SHA256 |
|---|---|
| `frontiers/rn_annulus_bridge_20260925/PROOF.md` | `d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05` |
| `frontiers/rn_annulus_bridge_20260925/annulus_bridge.py` | `9def209d784ddac477ba41bdd0367ad3872889f4ac5d62919c04559d8354be9f` |
| `frontiers/rn_annulus_bridge_20260925/test_annulus_bridge.py` | `14142a3ad60c294e898fe12fa17bb984b49517640f32942eda1e5fdb489cfd1b` |
| `frontiers/rn_annulus_bridge_20260925/RECONNAISSANCE.md` | `646ccdabad8695a9cc0f5d7279bcd1eb0eb05f1869c5375324b6b4feebcf30ab` |

The author unittest was not executed and was not imported. Its 21 methods are not evidence for these dispositions.

Also read, as coordination rather than as proof: Math- issue 29, the pull request 28 body, and the four pull request 28 comments through the OpenAI full audit. That audit is source-exposed and same-provider. It is not this verdict, and none of its MATCH sentences was used as an input to the derivations below.

While branching from current `main`, `reviews/d5_finite_r_hermite_repair_20260925/C6_REMAINDERS.md` was visible. It was not used as a premise. The orders checked below were computed from the PR28 note.

No child agent was spawned. The author tree was not checked out and no file in it was edited.

## Method

Sections 3–8 were rederived from the six pins, the Hermite and affine interpolants, the two-row aspect matrix, the three-gradient Taylor identity, and the weighted count formula. Separately, `algebra_check.py` expands the finite identities in exact arithmetic over `Q`. A passing run checks those identities only.

```sh
python3 -B -S reviews/pr28_annulus_bridge_nonauthor_20260925/algebra_check.py -v
```

## Dispositions

| Interface | Disposition |
|---|---|
| R1 finite-r subtraction and remainders (9)–(11) | **ACCEPT** |
| R2 aspect-uniform rank (12) | **ACCEPT** |
| R3 full conditional C3 moments (14) | **ACCEPT** |
| R4 three-Hessian geometry (6)–(8) | **ACCEPT** |
| R5 original endpoint-only normalizer (5) | **ACCEPT** |
| R6 weighted Kac–Rice with no height factor (16) | **ACCEPT** |
| R7 crossover, absorption, and full cover (17)–(20), (2) | **ACCEPT** |

These accept the stated fixed-annulus upper bound and the seven interfaces that produce it. They do not accept a matching lower bound, a numerical constant, a fixed-remote bound, an all-scales RN theorem, a 3D result, or uniformity as `k_- → 0`.

## R1 — ACCEPT

The midpoint jet of the cubic Hermite interpolant of `g` and `g'` at `±a`, `a = r/2`, is exactly

`H(0) = s0 - a^2 d1/2`, `H'(0) = (3 d0 - s1)/2`, `H''(0) = d1`, `H'''(0) = 3(s1 - d0)/a^2`,

with `s0, d0, s1, d1` the endpoint averages and difference quotients in Section 3. Row reduction of the same four conditions reproduces those four numbers. Under (1) this is the target (4), including `H'''(0) = 12k` and `L_r = 0`. The finite-r target is fixed before any `δ` scaling.

The unconditional rows (9) subtract `H'_r(ru)` and `r v L'_r(0)` before the covariance is formed. The second subtraction is required. Without it, the transverse Taylor term `r v f_xz` leaves a summand of size `|β| / r` in `Y1`, which is not square-integrable uniformly as `r → 0`. Under the pins, `L'_r(0) = 0`, so (10) is an equality: zero gradient at `X` is exactly `Y = τ = (-d(u)/δ, 0)` with `d(u) = 6k(u^2 - 1/4)`.

On jets through order four, the axial identities are equalities:

`g'(ru) - H'_r(ru) = r^3 A_u f_xxxx(0)`,

`h(ru) - L_r(ru) = r^2 B_u f_xxz(0)`,

`h'(ru) - L'_r(0) = r u f_xxz(0)`,

with `A_u = u(u^2 - 1/4)/6` and `B_u = (u^2 - 1/4)/2`. Transport in the physical coordinate `rv` then gives the matrix in (11). The `f_xzz` contribution to the first numerator is exactly `(r v)^2 f_xzz / 2`, which is an error relative to (11), of size `O(v^2 / δ)` after normalization. The quartic and higher remainders produce the stated envelopes `C(r^2 + r|v| + v^2)/δ` and `C(r^2 + r|v| + r v^2)/δ`. Both are at most a constant times `δ`, because `(r + |v|)^2 ≤ 2 δ^2`. The `O_{L^p}(δ)` rate is therefore uniform in the aspect ratio on `a0 ≤ |u| ≤ B` and `δ ≤ δ0`.

## R2 — ACCEPT

The three `2 × 2` minors of

`M = [A_u α, u β, 0; 0, B_u α, β]`

are `A_u B_u α^2`, `A_u α β`, and `u β^2`. Hence

`det(M M^T) = A_u^2 B_u^2 α^4 + A_u^2 α^2 β^2 + u^2 β^4`.

Dropping the middle term and using `α^4 + β^4 = 1 - 2 α^2 β^2 ≥ 1/2` gives (12): the determinant is at least `min(A_u^2 B_u^2, u^2)/2`. On `a0 ≤ |u| ≤ B` with `a0 > 1`, both `A_u` and `B_u` are bounded away from zero, so the floor is a positive constant. At `α = 0` the first minor vanishes and the third minor `u β^2` keeps the rank; an axial-minor-only test would not. The trace of `M M^T` is bounded on the same chart, so the least eigenvalue is at least that floor divided by the trace.

`(f, f_x, f_xx, f_xxx, f_z, f_xz, f_xxxx, f_xxz, f_zz)` are nine distinct one-point monomials. A nonzero polynomial symbol cannot vanish on the rotated frequency lattice of `K_L`, because every Fourier weight of this periodized Gaussian is positive and a polynomial vanishing on `Z^2` is identically zero. The nine-jet covariance is positive definite, uniformly in the frame by compactness of `O(2)`. The conditional covariance of `(f_xxxx, f_xxz, f_zz)` given the first six jets is therefore positive definite, and `M` pushes it to a uniformly elliptic `2 × 2` matrix. The `O_{L^2}(δ)` error in (11), together with `U_r → U_0`, preserves a positive finite eigenvalue floor for the Schur complement `Σ = Cov_{Q_r}(Y)` when `δ ≤ δ0`. Conditioning on the six pins is conditioning on `U_r`, because the Hermite map is invertible.

## R3 — ACCEPT

`M_2` and `M_3` are bounded by a fixed multiple of the global `C^3` norm. Under `Q_r`, those moments stay finite and uniform in the base point: the unconditional Fourier series has Gaussian-decaying weights, Minkowski's inequality puts every fixed `C^m` supremum in every `L^p`, and the Gaussian regression onto the bounded pin target `v_r` adds a covariance correction whose derivatives stay bounded on the torus.

`Y` itself stays `L^2`-bounded as `δ → 0`, by (11) and the rank floor. Cauchy–Schwarz therefore bounds every derivative of `C(x) = Cov_{Q_r}(F(x), Y)` through order three, uniformly in `x`. The residual after regression on `Y` is independent of `Y` and has a uniformly bounded `C^3` sixth moment. On `Y = τ`, the conditional field is that residual plus a deterministic shift of `C^3` size at most `C |τ - m_Y|`. Section 5 gives `c/δ ≤ |τ - m_Y| ≤ C/δ` for small `δ`, so the conditional `C^3` sixth moment is at most `C δ^{-6}`. This is the full-field norm after every gradient pin, not a finite jet and not an unconditional moment. The rare conditional mean is retained.

Pathwise, `min(M_2^6, C (r/|v|)^6 M_3^6)` dominates the triple weight when `v ≠ 0`, and `M_2^6` dominates it on the axis. Expectation of a minimum is at most the minimum of the expectations, which is (15). No independence of the endpoint and witness Hessians is used.

## R4 — ACCEPT

With all three gradients zero and `v ≠ 0`, the integral remainder from `M` to `S` gives `||H_M e1|| ≤ r M_3 / 2`. The same remainder along the scaled displacement `d = (u + 1/2, v)` gives `||H_M d|| ≤ r |d|^2 M_3 / 2`. Eliminating the `e1` component produces

`|v| ||H_M e2|| ≤ r M_3 (|u + 1/2| + |d|^2) / 2`.

The operator norm is at most the sum of the two basis images. Hessian Lipschitz along the segments to `S` and `X` adds at most `M_3` times the segment length. For `|u|, |v| ≤ B` the resulting coefficient is at most `3B^2 + 2B + 1` under this integral convention, and `16(B + 1)^2` is larger for every `B ≥ 1`. The count uses only that some finite `C_B` exists. In dimension two, `|det H| ≤ ||H||^2`, so the product of the three absolute determinants is at most `C_B^6 r^6 |v|^{-6} M_3^6`. That is (7). The axis fallback (8) is the same product with each determinant bounded by `M_2^2`, and it does not divide by `v`. An endpoint-only smallness bound would leave `H_X` free; the lemma uses all three zeros.

## R5 — ACCEPT

The original normalizer is `Z_r = E_{Q_r}[F_2(H_M) F_1(H_S)]`, before any witness conditioning. The cubic interpolant alone has `H''_r(±r/2) = ±6 k r`, so the left pin `M` carries `-6kr`. For a pure cubic pinned field the identities

`det H_M / r = -6 k f_zz(0)`, `det H_S / r = 6 k f_zz(0)`, `f_xx(M) / r = -6k`

are exact. A quartic perturbation `f_xxxx(0)` moves `f_xx(0)` by exactly `-(r^2/24) f_xxxx(0)` and moves `det H_M / r` by a multiple of `r`. The general Taylor remainder, using the uniform `L^p` bounds of Section 3 and Hölder on the squared mixed entry, is the `O_{L^p}(r)` statement in Section 3. In particular `f_xxx(0) = 12k + O_{L^p}(r^2)` and the endpoint mixed derivatives are `O_{L^p}(r)`.

`f_zz(0)` appended to `U_0` is one more distinct monomial, so its conditional variance given the pins stays between two positive constants for small `r`, and its conditional mean stays bounded on the compact birth and gap intervals. The Gaussian measure of `[-2, -1]` is therefore at least some `p0 > 0`, uniformly in the stated marks and frames. On that event, after removing the `O(r^p)` set where any displayed remainder exceeds `3k_-`, one has `f_xx(M) < 0`, `det H_M > 0`, and `det H_S < 0`. For a symmetric `2 × 2` matrix, positive determinant and a negative diagonal entry force both eigenvalues to be negative. Thus `H_M` is negative definite, `H_S` is indefinite, and both absolute determinants are at least `3 k_- r`. Therefore `Z_r ≥ c_Z r^2`. No witness-conditioned factor replaces `Z_r`.

## R6 — ACCEPT

For each fixed `r > 0` the annulus `A > 1` stays away from the pins at scaled radius `1/2`. Distinct-site derivative monomials have positive definite covariance by the same Fourier argument as in R2, so the conditional law of `∇f(X)` given the pins is nondegenerate. The expectation under `Q_r^W` is the `Q_r` expectation of `W_r N_j` divided by `Z_r`. Kac–Rice applied to the gradient, with the nonnegative mark `W_r` times the index indicator, contributes one factor `|det H_X|`. That factor is already inside `F_j`, so (16) does not count it twice. `Q_r^W` is not used as a Gaussian law.

In dimension two each `F_j` extends continuously by zero through singular matrices, because the determinant factor vanishes on the index boundary. The product weight is continuous and nonnegative. The sixth-moment bound (14) makes the polynomial growth integrable, which is what truncation needs. Height is not a coordinate of the mark, and no coarea factor in the witness height is inserted. The parenthetical rewriting `≤ C' k r^3` in Section 1 uses `k ≥ k_-` only; the proof of (2) never multiplies by a height-window length, and the note correctly refuses uniformity as `k → 0`.

The external Kac–Rice references are framework for this representation. They are not the source of (13)–(20).

## R7 — ACCEPT

Divide (13) and (15) by (5). The Jacobian `det diag(r^2 δ, r δ) = r^3 δ^2` produces the `r^{-3} δ^{-2}` in the gradient density, and `Z_r^{-1}` produces `r^{-2}`. Together with the conditional sixth moment this is (17): `r^{-5} δ^{-8} exp(-c/δ^2) min(1, (r/|v|)^6)`.

On `|v| ≤ r` one has `r ≤ δ ≤ r √2`, so `δ^{-8} ≤ r^{-8}` and `exp(-c/δ^2) ≤ exp(-c/(2r^2))`. The minimum is 1, and the intensity is at most `C r^{-13} exp(-c/(2r^2))`. On `r ≤ |v|` the minimum contributes `(r/|v|)^6` and `|v| ≤ δ ≤ |v| √2`, so the intensity is at most `C r |v|^{-14} exp(-c/(2v^2))`.

The series `exp(c0/s^2) ≥ (c0/s^2)^7 / 7!` is exactly (18). The sixth positive term would leave `r^{-13} · r^{12} = r^{-1}` on the inner chart, which is not `O(r)`. The seventh term supplies `s^{14}`, cancels `r^{-13}` up to one power of `r`, and cancels `|v|^{-14}` exactly. Both pieces are therefore at most `C r` throughout the fixed strip `a0 ≤ |u| ≤ B`, `δ ≤ δ0`.

For the cover, `a0 = (A + 1)/2` satisfies `1 < a0 < B` whenever `1 < A < B`. The gap `A^2 - a0^2 = (3A + 1)(A - 1)/4` is positive, so a fixed `ε > 0` exists with `√(A^2 - ε^2) > a0`. Every annulus point with `|v| ≤ ε` then falls in the strip of Section 7 once `r` is small. On `|v| ≥ ε` the exact scaling `J = (f_x/r^2, f_z/r)` has Jacobian `r^3` back to the gradient. Its leading coefficient matrix on `(f_zz, f_xxz, f_xzz)` has `a,c1` minor `-v^3/2`, of size at least `ε^3/2`. Those three monomials are distinct from the six midpoint pins, so `J` has a uniform covariance floor and a bounded mean for small `r`. Conditioning on `J = 0` therefore shifts the field by a bounded `C^3` amount, and the conditional sixth moment stays `O(1)`. Estimate (7) contributes `O(r^6)`. Division by `Z_r` contributes `r^{-2}`. The product is `O(r)` on the off-axis chart as well.

The two charts cover `K_AB`. Physical area contributes `r^2`, so the expected all-height count on `rE` is at most `C r^3 area(E)`. Null chart boundaries do not affect the absolutely continuous intensity. There is one endpoint normalizer and one witness determinant, and no height-window Jacobian.

## Boundary of this acceptance

(2) is an upper bound for one fixed scaled annulus, one fixed period, dimension two, and gap marks bounded away from zero. The Gaussian constant `c` in (13) depends on `k_-` through `d(u) ≥ 6 k_-(a0^2 - 1/4)`. Markov's inequality upgrades (2) only to an upper bound on witness existence. The between-pin-height count is smaller and inherits the same upper bound; that inclusion does not put a height factor into the all-height ledger.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md": "# Nonauthor review — fixed-annulus height-window candidate

Scientific effect: **NONE**. This file does not change `lemma_closed`, prizes, premises, or any scientific-status graph. It does not promote a global RN statement, an all-height annulus theorem, or the separate PR28 candidate.

## Claim

| Field | Value |
|---|---|
| Object | Math- pull request 22, file as of the immutable commit below |
| Immutable commit | `2804dc1db27ef3b1fdef6bb350b486162692cc4a` |
| Path | `frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md` |
| Blob | `081abc13c5e66342c13df2af2bd6b114f320486f` |
| Size | 17646 bytes |
| SHA256 | `1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b` |
| Author of the object | OpenAI / ChatGPT |
| Scope | One witness in the fixed scaled annulus `1<A0<B0<∞`, dimension two, full periodic covariance at fixed `L`, compact positive marks, height window of length `k r^3` |
| Interfaces | The eight named below |
| Excluded | PR28 and every later PR22 blob, pin neighborhoods, `B0→∞`, `r≪distance≪ρ`, witness collisions, dimension three or more, `k_-→0`, uniformity in `L`, numerical 24-jet constants, a positive leading coefficient, a probability lower bound, and an all-height `O(r^3)` bound on the whole annulus |
| State | Delivery record on publication of this file |

The assigned subject was not retargeted. `PROOF.md` and `TWO_SCALE_ADDENDUM.md` were not edited.

## Reviewer provenance

| Field | Value |
|---|---|
| Provider | xAI |
| Model | Grok 4.7 (`grok-4.7-high-fast`) |
| Agent | Cursor cloud run `bc-3524e567-7204-4e06-a9f5-94d0fd3e7f9d` |
| Run URL | https://cursor.com/agents/bc-3524e567-7204-4e06-a9f5-94d0fd3e7f9d |
| Account wrapper | Cursor application, owning user Electric_Universe_Theory |

Organizational independence is **not awarded**. This run is not the PR16 session `bc-e46e875d-e53f-42ac-93d9-0d16eadab00c` and not the two-scale session `bc-ff620630-782c-4f77-b994-35d0967e5dce`. A distinct Cursor session is not organizational independence.

Provider separation is narrower. The candidate's author is OpenAI. This reviewer is xAI Grok, so the dispositions are a nonauthor technical review.

## Frozen records

`reviews/pr16_fixed_transverse_nonauthor_20260925/REVIEW.md` at `c360f46bf5d3e4bfbb77be98d5e671b5b834d403` is unchanged. Its fixed-chart `η>0` acceptance is not an input to the shrinking cutoff below. The PR25 Sections B–C review is not an input either. Neither file was edited.

## Source exposure

Read in full: the immutable candidate above.

Read as the imported inner bound, not re-derived: `TWO_SCALE_ADDENDUM.md` blob `89cae3a9734f2ec7172cd0b6b0b3af3ddd355d73`, 15902 bytes, SHA256 `079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d`. That blob is identical at parent `b2e1652f1374c3b45759324a1ad1fd4177458500` and at `2804dc1d`. The source-bound S6–S21 acceptance of that blob is `reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md` at `bc7d75454d30d84be9d46c210eefecde71835d1d`, recorded on Math- pull request 34. This review uses equation (S4) from that scope. It does not transfer that acceptance to PR28 or to any changed addendum.

Author unit tests were not used as evidence.

## Method

The continuum steps in §§2–7 and the gluing arithmetic in §§8–9 were checked against the displayed formulas. Separately, `algebra_check.py` (standard library only) checks the pin target, the degree-three contact expansion, the minor `t^6/24`, the triangular Jacobian `r^{-6}`, and the exponent budgets.

Command:

```sh
python3 -B -S reviews/pr22_fixed_annulus_nonauthor_20260925/algebra_check.py
```

Script SHA256: `e7141a60961ad26f344b22b52bc830f130a3d31f36aadb802ca59e750898fc45`.

## Dispositions

| Interface | Disposition |
|---|---|
| Covariance floor `c\|t\|^12` and `O(r)` perturbation | **ACCEPT** |
| Cutoff `r^{1/24}` | **ACCEPT** |
| Rare target in the full joint gradient/height density | **ACCEPT** |
| Conditioned `C^3` sixth moment | **ACCEPT** |
| All-three-Hessian `\|t\|` cost | **ACCEPT** |
| Exponential angular envelope | **ACCEPT** |
| Inner two-scale stitching | **ACCEPT** |
| Whole fixed-annulus height-window count | **ACCEPT** |

No interface is AMEND or BLOCKED. The count that follows is the height-window statement (A2) on this fixed annulus only.

## Covariance floor — ACCEPT

Under the six pins, the degree-three contact calculation gives

`J_r = d(u,k) + M(u,t) V_0 + O_{L^2}(r)`

with the displayed `3×4` matrix `M`. The quadratic `S` term and the cubic `C` term cancel in the third row. The surviving `T` coefficient is `(u^2-1/4)t/4` and the surviving `D` coefficient is `-t^3/12`. The second row of `M` keeps only `t S`; the order-`r^2` pieces of `f_z` become an `O(r)` remainder after division by `r`. That split is an identity on the truncated jet, not an extra hypothesis.

The conditional covariance `G` of `(S,T,C,D)` given the six contact jets is bounded above and below by positive multiples of the identity, uniformly in the frame, because those four monomials stay independent of the six `U_0` derivatives and the frame set is compact. The regression at `U_r=v_r` moves this covariance by `O(r^2)`.

The cross term between `M V_0` and an `O_{L^2}(r)` remainder makes the covariance error `O(r)` rather than `O(r^2)`. On the bounded scaled region,

`||Cov_{Q_r}(J_r) - M G M^T|| ≤ C r`.

The comparison is absolute. The minor of `M` on columns `(S,C,D)` equals `t^6/24`. Cauchy–Binet gives `det(M M^T) ≥ t^{12}/576`. The largest eigenvalue of `M M^T` stays bounded for `|u|,|t|≤B0`, and `G≥λ I`, so

`λ_min(M G M^T) ≥ c |t|^{12}`.

The power 12 is a lower bound, including at `u=0`. It is zero at `t=0`, which this interface does not claim to cover.

## Cutoff `r^{1/24}` — ACCEPT

The floor above is not a fixed-angle compactness argument, and it does not insert a shrinking `η` into the frozen PR16 constants. With `q=1/24` and `|t|≥r^q`,

`r/|t|^{12} ≤ r^{1-12q} = r^{1/2} → 0`.

Any `q` with `12q≥1` would leave a perturbation that does not tend to zero. For small `r`,

`Cov(J_r) ≥ c_1 |t|^{12} I`, `||Cov(J_r)^{-1}|| ≤ C |t|^{-12}`, `det(Cov(J_r))^{-1/2} ≤ C |t|^{-18}`.

On `|t|≥ε` the same conclusion follows by compactness, with room to spare. The cutoff is applied after the eigenfloor and the `O(r)` norm bound are already explicit.

## Rare target in the full joint density — ACCEPT

On the annulus, `|t|≤ε` with `ε^2<A0^2-A1^2` and `A1=(A0+1)/2>1` forces `|u|≥A1`. Then the first coordinate has conditional mean at least `d0/2>0` and variance at most `C(t^2+r^2)`. For `r≤|t|` the variance is `O(t^2)`. The `O(r)` covariance error does not add a bare `O(r)` to this upper bound: the remainder's second moment is `O(r^2)`, and `r=o(t^2)` throughout `|t|≥r^{1/24}`.

At gradient zero and height `b+r^3 τ`, the `J_r` target is `(0,0,τ)` with `τ∈[-k,0]`. For a positive definite covariance,

`z^T Σ^{-1} z ≥ z_1^2 / Σ_{11}`.

The first coordinate alone therefore contributes `exp(-c/t^2)` inside the full three-dimensional quadratic form. Correlations with the height coordinate cannot cancel it. The determinant prefactor is the separate bound `|t|^{-18}`. The unscaled map `(f_x,f_z,f)→J_r` is triangular, and its Jacobian determinant is exactly `r^{-6}` at every `r`; the `(r t/2) f_z` coupling does not change that determinant. Hence, on `r^{1/24}≤|t|≤ε`,

`p(grad=0, height=b+r^3 τ | pins) ≤ C r^{-6} |t|^{-18} exp(-c/t^2)`.

For `|t|≥ε` the same map and a uniform spectral gap give `p≤C r^{-6}` with no exponential. The joint determinant is not inferred from a marginal density.

## All-three-Hessian cost — ACCEPT

The three gradient zeros and the integral remainder give

`||H_M e_1||≤C r M_3`, `||H_M (u+1/2, t)^T||≤C r M_3`.

Those two directions have determinant `t`. For `t≠0`,

`||H_M||+||H_S||+||H_X|| ≤ C r |t|^{-1} M_3`,

after moving the Hessian by at most `O(r M_3)` from `M` to `S` and to `X`. Each determinant is quadratic, so

`W_r F_j(H_X) ≤ C r^6 |t|^{-6} M_3^6`

on the gradient-zero set. The constant depends on the fixed bounds `A0,B0` and is allowed to blow like `|t|^{-6}`. Smallness of an endpoint-only Hessian is not reused after the witness pin.

## Conditioned `C^3` moment — ACCEPT

`Q_r` has uniform `C^3` and `J_r` moments on the bounded scaled region. Each third derivative is stationary and its covariance against `J_r` is bounded by Cauchy–Schwarz, uniformly in the base point. Regression at `J_r=y` adds a Cameron–Martin shift of size at most `C |t|^{-12} |y-μ|` and does not increase the covariance. The original pins are almost-sure constants under `Q_r`, so they stay fixed. For `τ` in the compact window and `r^{1/24}≤|t|≤ε`,

`E[M_3^6 | pins, grad=0, height=b+r^3 τ] ≤ C |t|^{-72}`.

Minkowski's inequality on the pathwise product then gives one correlated triple-determinant expectation of order `r^6 |t|^{-78}`. No factorization between the endpoint Hessians and the witness Hessian is used. For `|t|≥ε` the inverse covariance stays bounded and the same expectation is `O(r^6)`.

## Exponential angular envelope — ACCEPT

The sites `M`, `S`, and `X` stay at least `r(A0-1/2)` apart. Distinct-site derivative evaluations are nondegenerate for this covariance because every lattice weight is positive. The weighted, height-disintegrated intensity is

`ρ = Z_r^{-1} ∫_{b-k r^3}^{b} p(grad=0, height=s) E[W_r F_j(H_X)|grad=0, height=s] ds`.

The cited Kac–Rice theorem is used only as this integral representation. The powers are computed here. The original normalizer is re-derived in §2 of the candidate, not quoted from the frozen PR16 review: `S_r=f_{zz}(0)` is conditionally Gaussian with bounded mean and variance bounded above and below, so `P(-2≤S_r≤-1)≥p_0>0`, and Markov removes an `O(r^p)` error event. The surviving event has `W_r≥c r^2`, hence `Z_r≥c_Z r^2`.

On `r^{1/24}≤|t|≤ε` the pieces are normalizer `r^{-2}`, density `r^{-6}|t|^{-18} exp(-c/t^2)`, triple-determinant moment `r^6|t|^{-78}`, and window length `k r^3`. The product is

`ρ ≤ C k r |t|^{-96} exp(-c/t^2)`.

The angular total is `18+72+6=96`. With `y=c/t^2`, the elementary bound `e^y≥y^{48}/48!` gives `|t|^{-96} exp(-c/t^2)≤48! c^{-48}`. Thus `ρ≤C k r` on that region. The same `O(k r)` bound holds for `|t|≥ε` by the non-exponential estimates. The `r` ledger is density `-6`, determinants `+6`, height `+3`, normalizer `-2`.

## Inner two-scale stitching — ACCEPT

This acceptance is the gluing step. It is not a second proof of S6–S21.

Equation (A25) is equation (S4) of the addendum blob named above:

`ρ_{all}(ru,rt) ≤ C r^{-5} δ^{-8} exp(-c/δ^2)`,

for `A≤|u|≤B` and `δ=√(r^2+t^2)≤δ_0`. Sections 2–7 of that addendum are the argument accepted at `bc7d754`. Inside `|t|<r^{1/24}` on this annulus, small `r` gives `|u|≥A1>1`, `|u|≤B0`, and `δ≤δ_0`, so the hypothesis of (S4) holds. A height restriction only decreases the intensity. The in-file minor algebra is the same rank input that review already accepted; it is not re-opened here.

The new arithmetic is the cutoff comparison. Here `δ≥r` and `δ^2≤2 r^{1/12}`, so

`ρ_{all} ≤ C r^{-13} exp(-c/(2 r^{1/12}))`.

The bound `e^y≥y^{168}/168!` produces `r^{14}`, and `r^{-13}·r^{14}=r`. Since `k≥k_->0`, this is `C' k r` with `C'=C/k_-`. That constant is not uniform as `k_-→0`, which the candidate already says.

## Whole fixed-annulus count — ACCEPT

Every point of `K` falls in `|t|≥r^{1/24}` or in `|t|<r^{1/24}`. Both pieces have height-window intensity at most `C k r` per physical area. The boundary circle has expected count zero because the Kac–Rice measure is absolutely continuous. Integrating over `r E_0`, whose area is `r^2 area(E_0)`, gives

`E_{Q_r^W} N_j(r E_0) ≤ C k r^3 area(E_0)`, `0<r≤r_*`.

The constant depends on `L,A0,B0` and the mark compacts, and it is uniform in the frame, in the Borel set `E_0⊂K`, and in the index `j`. The all-index sum changes only `C`. Markov's inequality bounds the probability of at least one such witness by the same order.

This is the height-restricted statement (A2). It does not give an all-height bound on the whole annulus. The outer region uses the shrinking height window; the inner strip uses the imported all-height tail. The two mechanisms are not interchangeable.

## What this review does not do

It does not edit an author source, flip a scientific flag, or award organizational independence. It does not accept PR28, a later rewrite of this candidate, a vanishing mark `k_-`, or a numerical radius. The finite rational script does not replace the covariance, conditioning, or Kac–Rice steps above.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md": "# Additive review of the two-scale addendum

**Claim.** This is the one next assignment on the existing session, after delivery of the PR19/PR21 review at `e34077f3f2482e3c9850afd26085f37afc7472a4`. That review is unchanged. This file does not reopen it.

**Immutable source.** Math- PR22 file `frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md` at commit `b2e1652f1374c3b45759324a1ad1fd4177458500`, blob `89cae3a9734f2ec7172cd0b6b0b3af3ddd355d73`, 15902 bytes, SHA256 `079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d`.

The PR22 branch head has since advanced. This review does not read `FIXED_ANNULUS_CANDIDATE.md`, later PR22 files, or PR28, and it does not transfer these dispositions to any later blob.

**Scope.** Sections S6–S21, together with the candidate bounds (S3)–(S5) that those sections are used to prove: finite-r subtraction, aspect-uniform `O(δ)` remainders, all three contact minors, the rare Gaussian target, extra-conditioned triple-Hessian moments, the original endpoint-only normalizer, the weighted count, and the power-width versus logarithmic-width quantifier order.

**Scientific effect: NONE.** ACCEPT means the stated interface follows from the stated hypotheses and from the cited weighted Kac–Rice theorem. It does not close a fixed scaled annulus, a global RN statement, or any status flag.

## Provenance

| Item | Value |
|---|---|
| Reviewer model | Grok 4.7, xAI (`grok-4.7-high-fast`) |
| Agent | Same Cursor cloud session `bc-ff620630-782c-4f77-b994-35d0967e5dce` |
| Provider | xAI. The addendum is an OpenAI-lane candidate. This is not an OpenAI session. |
| Source exposure | The addendum at the blob above, `two_scale.py` and `test_two_scale.py` at the same commit, and ar5iv HTML of arXiv:2103.10853 for Theorem 29. The owner’s same-provider algebra notes were not used as acceptance. |
| Prior verdict | PR19 `e93eade` and PR21 `b420099` remain ACCEPT on the interfaces already scored. Those arguments were rederived here only where the addendum repeats them. |

## Dispositions

Coordinates: witness `(x, z) = (r u, r t)`, `δ = √(r² + t²)`, `α = r/δ`, `β = t/δ`, with `A ≤ |u| ≤ B`, `A > 1`, and `δ ≤ δ₀`. The closed semicircle `α ≥ 0`, `α² + β² = 1` is a compactification of the aspect ratio. Physical points keep `α > 0`.

| Interface | Disposition | Ground |
|---|---|---|
| S6 | **ACCEPT** | The midpoint Hermite jet equals `(S0 − a² D1/2, (3 D0 − S1)/2, D1, 3(S1 − D0)/a², L(0), L'(0))`. Evaluation recovers the six observations, so the map is invertible. The label `S1` inside this display is the average slope. |
| S7 | **ACCEPT** | The six pins produce `v_r = (b − k r³/2, −(3/2) k r², 0, 12k, 0, 0)`, `L_r = 0`, and `H'(r u) = 6 k r² (u² − 1/4)`. |
| S8–S9 | **ACCEPT** | `Y` subtracts `r t L'(0)` before any pin substitution. For the monomial `x z` that term is the whole transverse contribution to `f_x`; without it the normalized component is order `1/r` or worse. Under the pins, `L_r = 0` and `grad f = diag(r² δ, r δ) [Y + (6k(u² − 1/4)/δ, 0)]`, with Jacobian determinant `r³ δ²`. |
| S10–S12 | **ACCEPT** | Cubic Hermite reproduction gives `g'(r u) − H'(r u) = r³ a(u) Q + O(r⁴)` with `a(u) = u(u² − 1/4)/6`. Affine interpolation gives `h'(r u) − L'(0) = r u T + O(r²)` and `h(r u) − L(r u) = r² b(u) T + O(r³)`, `b(u) = (u² − 1/4)/2`. Taylor expansion in `z = r t` then produces `Y = M(Q, T, S)ᵀ + O(δ)`, where `M` is the displayed 2×3 matrix, uniformly in the aspect ratio. Each remainder quotient is bounded by a constant times `(r² + r|t| + t²)/δ` or `(r² + r|t| + r t²)/δ`, and both are at most `3 δ` once `δ₀ ≤ 1`. There is no factor `1/α` or `1/β`. Value-interpolation coefficients are `O(1/r)` and derivative coefficients stay `O(1)` for bounded `u`, including `|u| > 1/2`. |
| S13–S14 | **ACCEPT** | The three minors are `a b α²`, `a α β`, and `u β²`. Cauchy–Binet gives `det(M Mᵀ) = a² b² α⁴ + a² α² β² + u² β⁴`. On `A ≤ |u| ≤ B`, both `a(u)² b(u)²` and `u²` are bounded below by a positive `m₀`. Hence `det(M Mᵀ) ≥ m₀(α⁴ + β⁴)`. For `α² + β² = 1`, `α⁴ + β⁴ ≥ 1/2`, with equality at `α² = β² = 1/2`. The trace of `M Mᵀ` is bounded on that compact set, so the least eigenvalue is uniformly positive at both aspect endpoints and between them. |
| S15 | **ACCEPT** | The nine jets `(U₀, Q, T, S)` are linearly independent in every frame: a nontrivial symbol polynomial cannot vanish on every rotated lattice frequency while every Fourier weight of `K_L` is positive. Compactness of `O(2)` and of the semicircle upgrades the rank of `M` to uniform eigenvalue bounds for `Cov(U₀, Y₀)`. The `O(δ)` convergence of Section 3 passes those bounds to `(U_r, Y)` for small `δ`, and the Schur complement stays between positive finite multiples of the identity. The conditional mean of `Y` stays bounded because `v_r` is bounded for compact marks. |
| Rare target and (S3) | **ACCEPT** | The zero-gradient condition is `Y = τ = (−d(u)/δ, 0)` with `d(u) = 6k(u² − 1/4) ≥ d₀ = 6 k₋ (A² − 1/4) > 0`. For small `δ`, `|τ − m_Y| ≥ d₀/(2δ)`. The Gaussian density bound under `λ I ≤ Σ ≤ Λ I` is `C exp(−c/δ²)`. Division by the Jacobian `r³ δ²` is (S3). |
| S16 | **ACCEPT** | Given only the pins, the nine Hessian entries at the two endpoints and the witness have bounded conditional moments. Cauchy–Schwarz and `Σ ≤ Λ I` bound `Cov(H, Y)`. A further condition `Y = τ` shifts the conditional mean by `O(1/δ)` and does not increase the conditional covariance. Each 2×2 determinant is quadratic, so the product of the three absolute determinants is `O(|H|⁶)`. The conditional sixth moment of a Gaussian with mean `O(1/δ)` and bounded covariance is `O(δ⁻⁶)`. |
| S17 | **ACCEPT** | With `f_{xxx}(0) = 12k + O(r²)` and `f_{xx}(0) = O(r²)`, evaluation at `x = ±r/2` gives `f_{xx}(M)/r = −6k + O(r)` and `f_{xx}(S)/r = 6k + O(r)`. The transverse pins force `f_{xz}` at both pins to be `O(r)` in `Lᵖ`, because `f_{xxz}(0)` has bounded moments. Multiplying by `f_{zz} = A_r + O(r)` gives the two determinant identities. |
| S18 | **ACCEPT** | `Var(A_r | U_r)` stays between two positive constants for small `r`, and the conditional mean stays bounded on the compact mark set. Thus `P(−2 ≤ A_r ≤ −1) ≥ p₀ > 0`. On that event the main terms are at least `6 k₋` in absolute value. Markov removes an `O(rᵖ)` probability where the scaled errors exceed `3 k₋`. The remaining event has probability at least `p₀/2` and lies in the index set `{H_M negative definite, det H_S < 0}`, with both absolute determinants at least `3 k₋ r`. Therefore `Z_r ≥ c_Z r²`. |
| S19 and (S4)–(S5) | **ACCEPT** | Stecconi, arXiv:2103.10853, Theorem 29, puts a measurable weight inside the conditional expectation of the Kac–Rice density. Its proof extends from bounded continuous positive weights to nonnegative Borel weights by monotone convergence; truncation covers the unbounded endpoint weight. For each fixed `r > 0` the witness set stays a positive distance from the pins, and the periodic field with full Fourier support keeps a nondegenerate gradient/Hessian jet there. Packing the witness Jacobian once into `F_j(H_w)` and the endpoint determinants into `W_r` produces (S19). Combining (S3), (S16), and `Z_r⁻¹ ≤ C r⁻²` produces (S4): the powers are `r⁻³ · r⁻² · δ⁻² · δ⁻⁶ = r⁻⁵ δ⁻⁸`. Physical area `dx dz = r² du dt` then produces the integral (S5). |
| S20 | **ACCEPT** | For `0 < γ ≤ 1`, `r ≤ 1`, and `ε = K r^γ`, one has `K r^γ ≤ √(r² + ε²) ≤ √(1 + K²) r^γ`. The map `s ↦ s⁻⁸ exp(−c/s²)` increases on a sufficiently small interval `(0, δ₀]` because its logarithmic derivative is positive for `s² < c/4`. The integral is then at most a constant times `r^γ · r⁻⁸γ exp(−c_γ / r^{2γ})`, and (S5) contributes another `r⁻³`. The resulting power is `−3 − 7γ`. For `γ = 1` the physical width is `O(r²)` and the count power is `r⁻¹⁰`. For `γ = 1/2` the physical width is `O(r^{3/2})` and the power is `r⁻¹³/²`. |
| S21 | **ACCEPT** | The quantifiers are `for each N there exists D_N`, in that order. For `ε = D_N / √log(1/r)` and small `r`, `s_max² ≤ 2 D_N² / log(1/r)`, so the exponential factor is at most `r^{c/(2 D_N²)}`. The increasing envelope and the interval length contribute `D_N⁻⁷ (log(1/r))^{7/2}`. The full bound is a constant times `r^{c/(2 D_N²) − 3} (log(1/r))^{7/2}`. The choice `D_N² ≤ c / [2(N+4)]` makes the exponent of `r` at least `N + 1`, and `r (log(1/r))^{7/2} → 0` absorbs the logarithm. One fixed `D` is not asserted to work for every `N`. |

## Computations performed

Python 3.12.3, standard library. `check_two_scale.py` checks the normalization identities

```text
(r³ a Q + r² t u T) / (r² δ) = α a Q + β u T,
(r² b T + r t S) / (r δ) = α b T + β S,
```

the Jacobian `r³ δ²`, the drift `6(u² − 1/4) = 45/2` at `u = 2`, the circle bound `α⁴ + β⁴ ≥ 1/2`, the count ledger `−3 − 2 + 2 = −3` and `−2 − 6 = −8`, and the powers `−10` and `−13/2`.

The same session fetched ar5iv HTML for arXiv:2103.10853. Theorem 29 is the weighted counting formula (4.3), and its proof reduces nonnegative Borel weights to the bounded continuous case by monotone convergence. Printed PDF page numbers are not recovered from that HTML rendering; the theorem statement and the nonnegative extension match the use in S19.

Author unit tests at this commit were not treated as analytic evidence.

## Left open

The addendum’s own exclusions stay open: a fixed positive scaled width `ε`, sites near the pins or near `u = 0`, intermediate distances, witness collisions, dimension greater than 2, the limit `k₋ = 0`, uniformity in `L`, numerical values of `C`, `c`, and `D_N`, and any elder or lifetime theorem. The later fixed-annulus candidate is not part of this blob and is not accepted.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/reviews/replacement_20260925_pr19_pr21/REVIEW.md": "# Replacement review of the finite-r Hermite repair and the inner-axial density

**Claim.** This is the one bounded replacement review requested in [Math- issue 23](https://github.com/d6g8k5htny-coder/Math-/issues/23). It is a fresh session. It does not retry Cursor agent 91fa or follow-up comment 5839326176, and it does not call that follow-up active.

**Sources actually read.**

| Target | Identity |
|---|---|
| Math- PR19 | head `e93eade078cac2e8b14aa39d402a3043b7cdb1c7` |
| C6 supplement | `reviews/d5_finite_r_hermite_repair_20260925/C6_REMAINDERS.md`, 8054 bytes, blob `2f8dc9badeea`, SHA256 `8260e567e46cad8892442a5baf59cc0cbcbbeaf860edb1e234379e666e035bad` |
| Repair note | `REPAIR.md`, blob `40c7ff79a1ca`, SHA256 `cc70ee30943492ac57512a12ff74b2907ebf9e64bcb36fff3f7a8d1dd6928413` |
| Math- PR21 | head `b420099b2440da3a8ba62f7000feacc9fc88069b` |
| Density proof | `frontiers/axial_density_20260925/PROOF.md`, 10858 bytes, blob `a72418d78fd3`, SHA256 `8b9376a69fda9f0f231d9502be839ae45d8006d1891ff3e700fa521cc96f6cb4` |

Both heads match the issue text, including the PROOF.md byte count and SHA256. Relative to merge-base `baca69c394ab42130c61771bee74e808703f1ce7`, each head only adds its own package and workflow. Later main commits that add the downstream transition gate are absent from these heads because the branches predate them.

**Scope.** Interfaces M1–M7 and S1–S4 from the C6 supplement, and equations (2)–(8) of the density proof, including the compact positive-mark quantifiers. The density statement (1) is scored only as the corollary of those equations. PR22’s weighted-tube extension was not read and is not accepted. No author file on either head was edited. No scientific register, `lemma_closed` flag, prize, or premise is changed by this review.

**Scientific effect: NONE.** An ACCEPT below means the stated interface follows from the stated hypotheses. It does not close a Gaussian count, a thin belt, or an RN/24-jet obligation.

## Provenance

| Item | Value |
|---|---|
| Reviewer model | Grok 4.7, xAI (`grok-4.7-high-fast`) |
| Agent | Cursor cloud session `bc-ff620630-782c-4f77-b994-35d0967e5dce` |
| Provider relative to the targets | xAI. Both targets are OpenAI-lane author candidates committed by `d6g8k5htny-coder`. This session is not an OpenAI session. |
| Source exposure | The author proofs, their tests, and the PR19/PR21/issue 23 comments were read. The derivations below were recomputed from the six pin equations and from the stated periodized Gaussian. This is an exposed technical review, not a sealed blind review. |
| Independence claimed | Provider-level nonauthor status relative to the OpenAI author lane. Different Cursor bcIds are not the ground for that claim. |
| Computations | Python 3.12.3, standard library only. Recorded in `check_interfaces.py`. |

## PR19 — finite-r C6 interfaces

Hypotheses used throughout: `B >= 1`, `0 < r <= 1`, `f` of class C6 on a neighborhood of the square `|x| <= B r`, `|z| <= B r`, with every partial of total order at most 6 bounded by one finite `M` on that square, and the six pins

```text
f(-r/2, 0) = b,  f(r/2, 0) = b - k r^3,
f_x(-r/2, 0) = f_x(r/2, 0) = f_z(-r/2, 0) = f_z(r/2, 0) = 0.
```

The square contains the midpoint, both pins, and every segment used by Taylor’s formula. A bound supported only on an annulus that omits those segments does not justify the expansions below.

Write `h = r/2` and `g(t) = f(t, 0)`. Lagrange remainders with the derivative ceiling `M` give the following, which were expanded and collected independently of `finite_r_contact.py`.

| ID | Disposition | Ground |
|---|---|---|
| M1 | **ACCEPT** | Average `g'(±h) = 0` through order 3. The odd terms cancel and `|g'(0) + (h^2/2) g'''(0)| <= M h^4/24`, which is `M r^4/384`. |
| M2 | **ACCEPT** | Difference of the order-4 expansion of `g'`, whose remainder uses `g^{(6)}`. Division by `2h` produces `M h^4/120 = M r^4/1920`. |
| M3 | **ACCEPT** | `g(h) - g(-h) = -8 k h^3` equals `2h g'(0) + (h^3/3) g'''(0) + E` with `|E| <= M h^5/60`. Substitute M1. The collected coefficient is `(3/20) M h^2 = (3/80) M r^2`. |
| M4 | **ACCEPT** | The pin average is `b - k r^3/2`. The order-3 even expansion plus M2 and `h <= 1/2` produce `M h^4 (1/8 + h^2/240) <= (121/960) M h^4 = (121/15360) M r^4`. |
| M5 | **ACCEPT** | Combine M1 and M3. `3/640 + 1/384 = 7/960`. |
| M6 | **ACCEPT** | The same averaging argument as M1, applied to `w(t) = f_z(t, 0)`, which vanishes at both pins. Order 4 of `w` is order 5 of `f`. |
| M7 | **ACCEPT** | The same difference argument as M2, applied to `w`. Order 5 of `w` is order 6 of `f`. |
| S1 | **ACCEPT** | Expand `f_x` through degree 2. The scaled defect is the M5 drift, the M3 cubic error, the two midpoint rows `f_xx` and `f_xz`, and a remainder at most `M r (2B)^3/6`. M2 and M7 give `|f_xx(0)|, |f_xz(0)| <= (27/640) M r^2` for `r <= 1`, and the two rows together contribute `27B/320`. The displayed `C_x` is that sum. The `r^2 <= r` absorption is inside the hypothesis `r <= 1`. |
| S2 | **ACCEPT** | Expand `f_z` through degree 1. M6 contributes `49/384`, M7 contributes `27B/640`, and the degree-2 remainder contributes `2 B^2`. |
| S3 | **ACCEPT** | Expand `f_z(ru, 0)` through degree 2 and keep the M6 term `-q/8` after division by `r^2`. The three contributions are `1/384`, `27B/640`, and `B^3/6`. |
| S4 | **ACCEPT** | Expand `f` through degree 3. The exact cubic and transverse leading terms cancel against `r H` and `a v^2/2` once M3–M6 are inserted. The remaining pieces are M4 (`121/15360`), the M5 and M6 evaluation errors (`7B/960 + B/384 = 19B/1920`), the midpoint quadratic rows (`81 B^2/1280`), the M3 error in `f_xxx` (`B^3/160`), and the degree-4 remainder (`2 B^4/3`). |

The multivariate remainder used for S1–S4 is `|R_m| <= M (|x| + |z|)^m / m!`. It follows by applying the one-variable Lagrange formula to `t -> f(tx, tz)` and the binomial bound on that derivative. On the square this is at most `M (2 B r)^m / m!`.

The constants are sufficient bounds. M1, M2, M6, and M7 are sharp for the triangle-inequality ceiling: the degree-5 longitudinal monomial, after the six pins are solved at `r = 1`, `k = 1`, has `|∂_x^5 f| = 120` and ceiling `M = 120`, and the M1 defect equals `120/384`. S1–S4 are not claimed to be optimal, and the fixture scan did not saturate them.

The pin-preserving quartic `(x^2 - r^2/4)^2` has vanishing value and gradient at both pins. Its scaled longitudinal derivative is `4 r u (u^2 - 1/4)`, hence `30 r` at `u = 2`. Under a derivative ceiling independent of `r`, this defect is not `O(r^2)`. The stated S1 rate is the rate the C6 hypothesis supports.

All six pins are used: the two height pins in M3 and M4, the two longitudinal derivative pins in M1 and M2, and the two transverse pins in M6 and M7. The scaled rows call those midpoint bounds. Positivity of `k` is not required for M1–M7 or S1–S4.

## PR21 — equations (2)–(8)

The model is the centered, variance-one periodization `K_L` on the torus of side `L`, conditioned on the same six pins, with `|b| <= B0`, `k ∈ [k0, k1]`, `k0 > 0`, `A <= |u| <= B`, `A > 1`, and `|w| <= W`. The witness is `R(r u, r^2 w)`. Gradients are components in the orthonormal frame `R`.

| ID | Disposition | Ground |
|---|---|---|
| (2) | **ACCEPT** | A general cubic `p + q x + s x^2/2 + t x^3/6` was matched to arbitrary value and derivative data at `±a` by rational elimination. The jet `(p, q, s, t)` equals `(S0 - a^2 D1/2, (3 D0 - S1)/2, D1, 3(S1 - D0)/a^2)`. Evaluation of that cubic recovers the four longitudinal observations, so the map is invertible for every `r > 0`. The linear interpolant of the two transverse values is the last pair in (2). |
| (3) | **ACCEPT** | Substituting the six pins produces `U_r = (b - k r^3/2, -(3/2) k r^2, 0, 12 k, 0, 0)` and `H'(r u) = 6 k r^2 (u^2 - 1/4)`. |
| (4) | **ACCEPT** | The displayed normalization is linear and unconditional. For the monomial `x z`, omitting `r^2 w L'(0)` leaves the witness value `w/r`. With the subtraction, the same monomial is normalized to `(0, 0)`. The subtraction is required before conditioning. |
| (5) | **ACCEPT** | Read as `‖U_r - U_0‖_2 = O(r^2)` and `‖Y_r - Y_0‖_2 = O(r)`, uniformly for frames in `O(2)` and `(u, w)` in the stated compact set. Cubic Hermite reproduction gives the quartic defect `(Q/24)(x^2 - a^2)^2`; its derivative at `r u` is `r^3 α(u) Q` with `α(u) = u(u^2 - 1/4)/6`. The next longitudinal contribution is `O(r^4)` before division by `r^3`. Linear interpolation of `h` contributes `r^2 β(u) T` with `β = (u^2 - 1/4)/2`, and `h'(r u) - L'(0) = r u T + O(r^2)`. The transverse Taylor step of width `r^2 w` then produces exactly `Y_0 = (α Q + u w T, β T + w S)`. Both components of `Y_r - Y_0` are `O(r)`. Fourier coefficients of `K_L` are positive and decay as `exp(-2 π^2 |n|^2/L^2)`, so every fixed derivative supremum has finite moments of every order, uniformly in the frame. The Hermite value coefficients at scale `r` grow at most like `1/r`, and the derivative coefficients stay bounded on `A <= |u| <= B`, so the Taylor defects are `O(r)` in `L^2` with a uniform implicit constant. Covariance convergence follows from Cauchy–Schwarz because the observations are centered. |
| (6) | **ACCEPT** | In coordinates `(Q, T, S)` the limit rows are `(α, u w, 0)` and `(0, β, w)`. Their `(Q, T)` minor is `α β = u (u^2 - 1/4)^2/12`, nonzero for `|u| >= A > 1`. Thus the two limit rows are independent modulo the six midpoint jets. A nontrivial linear combination of the nine jets `(f, f_x, f_xx, f_xxx, f_z, f_xz, Q, T, S)` has a nonzero symbol polynomial in the rotated frequency. Composition with an invertible rotation is still a polynomial, and a polynomial vanishing on `Z^2` is identically zero, so the symbol cannot vanish on every lattice frequency. Every Fourier weight is strictly positive, so the nine-dimensional covariance is positive definite in every frame. |
| (7) | **ACCEPT** | The joint covariance of `(U_0, Y_0)` is continuous in the frame and in `(u, w)`, and positive definite on the compact set `O(2) × {A <= |u| <= B} × {|w| <= W}`. Its least eigenvalue therefore has a positive minimum and its greatest eigenvalue is finite. `L^2` convergence (5) makes `Cov(U_r, Y_r)` uniformly close to that limit for small `r`. The Schur complement is continuous on the set where `Cov(U_r)` stays invertible, and `Cov(U_0)` is uniformly invertible, so `λ I <= Σ_r <= Λ I` for some `λ, Λ` independent of the frame and of `(u, w, b, k)` inside the stated ranges. The minimizing representation `v^T Σ v = min_u (u, v)^T Cov(u, v)` supplies the lower bound from the joint matrix; the upper bound is the `Y` block. The conditional mean `m_r = Cov(Y_r, U_r) Cov(U_r)^{-1} v_r` stays bounded because `v_r` stays bounded for `|b| <= B0` and `k <= k1`. |
| (8) | **ACCEPT** | Under the pins, `L_r = 0` and `grad f(X) = (6 k r^2 (u^2 - 1/4) + r^3 Y_{r1}, r^2 Y_{r2})`. The Jacobian determinant in `Y` is `r^5`. Therefore the conditional density at the origin in gradient space is `r^{-5}` times the conditional `Y`-density at `(-6 k (u^2 - 1/4)/r, 0)`. |

**Corollary (1): ACCEPT as an existence bound.** Let `δ = 6(A^2 - 1/4) > 0`. The target in (8) has length at least `δ k / r`. For `0 < r <= r_*` small enough that the covariance bounds of (7) hold, that `r_* <= δ k0 / (2 M0)` when `M0 > 0`, and that the whole pin-witness configuration sits inside one injectivity chart of the torus,

```text
|t - m_r| >= δ k / (2 r).
```

The two-dimensional Gaussian density with `λ I <= Σ <= Λ I` is at most `(2 π λ)^{-1} exp(-|t - m|^2 / (2 Λ))`. This is (1) with `C = (2 π λ)^{-1}` and `c = δ^2 / (8 Λ)`. These constants exist and depend only on `L, B0, k0, k1, A, B, W`. They are not numerical enclosures. The hypothesis `k0 > 0` is required to dominate the bounded regression mean uniformly.

The resulting object is the conditional density of the two-dimensional gradient at one witness, with respect to Lebesgue measure on gradient space. It includes no pin-density factor, no spatial Jacobian, and no endpoint Palm weight. The region is the inner belt `|z| <= W r^2`. A fixed-width scaled belt `|v| <= ε` is outside this estimate.

The centered finite-r vector `(S0, D0, D1, 3(S1 - D0)/a^2, L(0), L'(0))` differs from `U_r` by the shear `(V0 - r^2 V2/8, V1 - r^2 V3/24)` on the first two coordinates, with the other four fixed. That shear has determinant one, so it is another coordinate description of the same six observations.

## Computations performed

Python 3.12.3, standard library only. `check_interfaces.py` repeats the following exact checks.

- The fraction identities `3/640 + 1/384 = 7/960`, `1/24 + 1/1920 = 27/640`, `121/960 / 16 = 121/15360`, `7/960 + 1/384 = 19/1920`, and `27/1280 + 27/640 = 81/1280`.
- Closed-form Hermite jet against an independent 4×4 elimination, for generic rational data.
- Pin specialization (3), the determinant-one shear, the minor (6), and the Jacobian `r^5`.
- Quartic increment `30 r` at `u = 2`.
- M1 equality for the solved `x^5` fixture at `r = 1`.
- All eleven interfaces on 360 pin-solved polynomials: radii `1, 4/5, 1/2, 1/5, 1/31`, box scales `B ∈ {1, 2, 3}`, and the 22 free monomials through degree 6 together with two dense coefficient vectors. The comparison ceiling is the triangle bound on every partial of order at most 6, which is a valid `M`. Every ratio was at most 1. Largest observed ratios: M1, M2, M6, M7 equal to 1; M3 `2/3`; M4 `40/121`; M5 `1/14`; S1 `19902/113659`; S2 `540/4381`; S3 `6510/14443`; S4 `103680/841357`.
- Exact Lagrange extrapolation of the normalized monomial map through degree 6, on a small `(u, w)` grid, against `(α Q + u w T, β T + w S)`.
- The `x z` normalization with and without the `L'` subtraction.

A separate floating-point check at `L = 4`, summing lattice modes through radius 10, produced a positive-definite 9×9 axis-frame jet covariance (least eigenvalue about `0.302`) and, at `(u, w) = (1.5, 0.4)`, a positive-definite Schur complement (eigenvalues about `2.22` and `9.54`). That is one numerical instance. The general frame argument is the symbol argument in (6) and (7).

The author unit files were also executed from extracted copies of the two heads: 21 tests in the Hermite package and 15 tests in the density package, all passing. Those runs check the finite algebra in the fixtures. They are not the reason for the dispositions above.

## Imported gaps, left open

These items are outside the accepted interfaces. This review does not prove them and does not treat them as consequences.

- Conditional moments of a random derivative ceiling `M` after all six pins. The pathwise C6 inequalities do not license a deterministic `M` inside a Gaussian integral.
- Any weighted Kac–Rice count, height-conditioned density, Hessian-moment bound, endpoint Palm weight, or full normalizer.
- The belt `W r < |v| < η`, pin-witness collisions, intermediate scales, dimension 3, and numerical values of `C`, `c`, or `C_H`.
- PR22’s two-scale weighted-tube candidate. It was not reviewed.
- RN/24-jet closure, `lemma_closed`, and every campaign status flag.
- Effectivity of `r_*`, `λ`, and `Λ`. The density argument proves existence on a sufficiently small interval.

## Limits of this review

The Taylor and regression arguments above are analytic. The polynomial scan covers a finite family of degree at most 6; it corroborates the constants and does not replace the Lagrange derivation. The Gaussian bound is an existence result for one conditional gradient density on the inner belt.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/reviews/pr16_fixed_transverse_nonauthor_20260925/REVIEW.md": "# Nonauthor review — fixed-transverse count candidate

Scientific effect: **NONE**. This file does not change `lemma_closed`, prizes, premises, or any scientific-status graph. It is not permission to promote the candidate.

## Claim

| Field | Value |
|---|---|
| Object | Math- pull request 16 |
| Immutable commit | `32b80ee085dc6a40113d1e46e333cda50d57ba21` |
| Path | `reviews/downstream_boundary_20260925/TRANSVERSE_BOUND_CANDIDATE.md` |
| Blob | `024d927779f79fadaf932541ea6474f2995f8c50` |
| Size | 9902 bytes |
| SHA256 | `f64c954245f17bcbc64a5ccf58a60689cf2a2fd85362f8321c0f64ff66584e36` |
| Author of the object | OpenAI / ChatGPT, 25 September 2026 |
| Scope | Exact fixed-transverse dimension-two chart only: `A>1`, `B<∞`, `\|v\|≥η>0`, compact marks, qualitative `C` and `r_*` |
| Interfaces | R1, R2, R3, R4, R5 as named in Math- issue 24 |
| Excluded | Axis, thin belt, `η→0`, pin or witness collision, intermediate scales, dimension three, numerical constants, historical 24-jet / all-cell certificate, positive leading coefficient, probability lower bound |
| Also excluded | Math- issue 23, pull requests 19, 21, and 22, and any edit of the reviewed proof |
| State | ACTIVE on publication of this file. Existing 120-minute stale-claim convention runs from this commit's timestamp. |
| Write scope | `reviews/pr16_fixed_transverse_nonauthor_20260925/` only |

Issue 24 asked for an acknowledgment on the issue before ACTIVE. Creating that comment returned HTTP 403, `Resource not accessible by integration`. This file is the claim and the result.

## Reviewer provenance

| Field | Value |
|---|---|
| Provider | xAI |
| Model | Grok 4.7 (run id `grok-4.7-high-fast`) |
| Agent | Cursor cloud run `bc-e46e875d-e53f-42ac-93d9-0d16eadab00c` |
| Run URL | https://cursor.com/agents/bc-e46e875d-e53f-42ac-93d9-0d16eadab00c |
| Account wrapper | Cursor application, owning user Electric_Universe_Theory |

Organizational independence is **not awarded**. A distinct Cursor session is not organizational independence. The shared workspace account does not separate this run from the account that committed the OpenAI text.

Provider independence is different from that organizational fact. The candidate's author is OpenAI. This reviewer is xAI Grok, not an OpenAI session, so the dispositions below are a nonauthor technical review rather than an OpenAI self-review.

## Source exposure

Read in full: the immutable candidate above, Math- pull request 16 body and the three review-request comments, Math- issue 24, and the two meta-framework pull request 6 comments `5839347079` and `5839348136`.

Also read, as coordination rather than as proof: governance- pull request 4 `REVIEW_TOPOLOGY.md` at `6da327b520574ba88de27e70c6456e55326d5dbe`, and governance- pull request 3 file `amendments/20260925-math16-transverse-review.md` at `a1fc2c1f5b1a90d08c4b3cd20b418eeecf8fca1a`. That note is a `cursor[bot]` review whose model is UNKNOWN. It already records R1–R5 ACCEPT. It was not used as analytic evidence. The author's `test_transverse_repair.py` and `test_finite_pin_oracle.py` were not run and are not evidence for these dispositions.

## Method

The continuum argument was checked step by step against the displayed formulas. Separately, `algebra_check.py` (standard library only) expands the displayed cubic in exact rationals. A passing run of that script checks finite identities only.

Command:

```sh
python3 -B -S reviews/pr16_fixed_transverse_nonauthor_20260925/algebra_check.py
```

## Dispositions

| Interface | Disposition |
|---|---|
| R1 endpoint regression and full `Z_r/r^2` floor | **ACCEPT** |
| R2 joint gradient/height normalization and minor `v^6/24` | **ACCEPT** |
| R3 three critical gradients imply all three Hessians `O(r M_3)` | **ACCEPT** |
| R4 uniform conditional `C^3` sixth moment after the witness pins | **ACCEPT** |
| R5 weighted marked Kac-Rice ledger | **ACCEPT** |

No interface is AMEND, COUNTEREXAMPLE, or BLOCKED. A failed interface would have blocked the scoped count. None failed.

Scoped count statement, at this chart only:

`E_(Q_r^W) N_j(rE) ≤ C k r^3 area(E)` for `0<r≤r_*`,

is **ACCEPT** as a qualitative theorem on the declared domain. This acceptance does not award organizational independence and does not authorize a status flip.

## R1 — ACCEPT

The centered transform `U_r` evaluates to the stated target `(b−k r^3/2, −k r^2, 0, 12k, 0, 0)` on every field that meets the six pins. The fourth slot is the reason: `(6/r^2)·(0−2·(−k r^2))=12k`. On a one-variable jet, the same fourth slot has constant term exactly `φ'''(0)`, with the next term `r^2 φ^{(5)}(0)/40`. That is the contact identification `U_0=(f,f_x,f_xx,f_xxx,f_z,f_xz)` with target `(b,0,0,12k,0,0)`.

The periodized covariance has a strictly positive weight on every lattice mode. A finite list of derivative evaluations is therefore nondegenerate whenever those evaluations are linearly independent as distributions. Distinct multi-indices are independent, so both the six contact functionals and the appended `a=f_zz(0)` are jointly nondegenerate in every orthonormal frame. The frame circle and the mark rectangle are compact, the limiting covariance depends continuously on them, and a positive continuous function on a compact set has a positive minimum. For small `r` the transformed covariances stay uniformly invertible. Regression through `U_r`, rather than through the raw colliding pins, is what keeps `C^m` moments bounded.

On the displayed cubic, `f_xx(M)/r=−6k` and `f_xx(S)/r=6k` hold exactly. The mixed terms are `f_xz(M)=−q r/2` and `f_xz(S)=q r/2`, which is the stated `O(r)` size, and

`det H_M / r = −6 k a + 3 k c r − q^2 r/4`,

`det H_S / r = 6 k a + 3 k c r − q^2 r/4`.

The product of the leading terms is `−36 k^2 a^2`. The weight uses absolute determinants, so the limit density is `36 k^2 a^2`. For `k>0` and small `r`, `H_M` is negative definite and `H_S` has index one exactly on the side `a<0`, up to an error that is absorbed by uniform integrability away from the null set `a=0`. The conditional law of `a` given `U_0` is a nondegenerate Gaussian whose variance is the Schur complement of a positive-definite jet covariance, hence bounded below on the compact parameter set, while the conditional mean stays bounded because the target `(b,12k)` stays in a fixed compact. Therefore `E[a^2 1_{a<0} | U_0]` has a positive minimum `z_0`, and `Z_r ≥ z_* r^2` for small `r`. The floor uses the full endpoint weight. It does not import a numerical certificate.

## R2 — ACCEPT

The normalized witness

`J_r = (f_x/r^2, f_z/r, (f−b−(r v/2) f_z)/r^3)`

was expanded on the cubic. The first and third components are exactly the displayed limits, including the finite-pin shifts `u^2−1/4` and `2u^3−3u/2−1/2`. The second component is exactly

`a v + r·((q/2)(u^2−1/4)+c u v+(d/2) v^2)`,

so its limit is `a v`, as written. The height subtraction cancels the quadratic `a` term and the cubic `c` term; the surviving `q` coefficient is `q/4` and the surviving `d` coefficient is `−1/12`.

The Jacobian matrix of `(J_1,J_2,J_3)` in `(a,c,d)`, with the finite-`r` entries of `J_2` retained, has determinant exactly `v^6/24`. On `|v|≥η` this is at least `η^6/24`. Those three jets are unpinned, and `k` enters only as a pinned mean shift. The map is therefore a submersion uniformly on the fixed chart. The conditional law of `(a,q,c,d)` given `U_0` is a nondegenerate Gaussian, so the pushforward law of `J_r` has covariance bounded below for small `r`.

The raw map `(f_x,f_z,f)←J_r` is triangular with determinant `r^2·r·r^3=r^6`. At a critical point of height `b+r^3 τ` the `J_r`-target is `(0,0,τ)`. The Gaussian density of `J_r` is bounded on that compact target set, and

`p(grad f=0, f=b+r^3 τ | pins) ≤ C r^{−6}`.

The height factor `r^3` remains inside the later integral. It is not dropped in this interface.

## R3 — ACCEPT

This step is deterministic and uses only the three gradient zeros. From `grad f(S)=grad f(M)=0` and the integral remainder,

`H_M (S−M) = O(r^2 M_3)`.

Since `S−M=(r,0)`, both `f_xx(M)` and `f_xz(M)` are `O(r M_3)`. Expanding `f_z` from `M` to `X=(r u, r v)` and using `f_z(M)=f_z(X)=0` gives

`v f_zz(M) = −(u+1/2) f_xz(M) + O(r M_3)`.

On the chart, `|v|≥η` and `|(u,v)|≤B`, so `f_zz(M)=O(r M_3)`. Hessian Lipschitz control on the segments, whose lengths are `O(r)`, moves this bound to `S` and to `X`. In dimension two each determinant is quadratic in the Hessian, and three of them produce

`W_r |det H_X| ≤ C r^6 M_3^6`

on the event `grad f(X)=0`. The index indicator only shrinks the left side. The constant depends on `η` and `B`, which the candidate already allows. The estimate is false in the form `O(r M_3)` if `η=0`, and that case is outside the claimed chart.

## R4 — ACCEPT

`J_r` is a linear image of the field, and `Q_r` is Gaussian, so the regression coupling

`F + Cov(F,J_r) Cov(J_r)^{−1} (target−J_r)`

realizes the conditional law given `J_r=(0,0,τ)`. The endpoint pin functionals are almost-sure constants under `Q_r`, so their covariance with `J_r` vanishes and the pins survive.

Under `Q_r`, section 2 supplies uniform `L^2` bounds on derivatives and section 3 supplies uniform `L^2` bounds on `J_r`. Cauchy-Schwarz therefore bounds `sup |Cov(D^3 f, J_r)|` uniformly on the chart. The limiting covariance of `J_r` is positive definite by the minor in R2, so its inverse stays bounded for small `r`. The target `(0,0,τ)` with `τ∈[−k,0]` is compact. The conditional field is the original Gaussian plus a Cameron-Martin shift of bounded `C^3` size and with a smaller covariance, so

`E[M_3^6 | pins, J_r=(0,0,τ)] ≤ C`

uniformly for small `r`. No independence between the endpoint determinants and the witness determinant is required. Combined with the pathwise bound in R3,

`E[W_r |det H_X| 1_{index=j} | pins, grad=0, height=t] ≤ C r^6`.

## R5 — ACCEPT

The quantity `E_{Q_r}[W_r N_j(rE)]` is the intensity of critical points in `rE`, with height in `(b−k r^3, b)` and index `j`, weighted by the endpoint factor `W_r`. At each fixed `r>0` the witness chart stays a positive distance from both pins because `A>1`, so the three-point jet is nondegenerate and the conditional Kac-Rice formula applies. The weight is an integrable field functional: absolute determinants are continuous at singular matrices after the usual truncation, and the Gaussian moments from R4 close the limit.

The resulting integral is at most

`area(rE) · (k r^3) · (C r^{−6}) · (C r^6) = C k r^5 area(E)`,

because `area(rE)=r^2 area(E)`. Division by the full normalizer `Z_r≥z_* r^2` yields `C k r^3 area(E)`. Markov's inequality then bounds the probability of at least one such witness by the same order. That step does not reverse an event probability into an expectation.

The cited Armentano–Azaïs–León framework is used only as the expected-integral representation. The powers and the conditioning are the argument checked here. The ledger stops at the fixed chart. It does not extend to a vanishing transverse coordinate, a collision, an intermediate scale, or a 24-jet certificate.

## Boundary checks that stayed inside scope

The minor `v^6/24` is zero at `v=0`, so the uniform density bound really does need `η>0`. The candidate already excludes that limit. The same cubic satisfies all six pins while keeping the `−1/4` axial corrections, which is the finite-pin repair this chart uses. Those facts support R2 and R3 on the stated domain. They are not an extension of the domain.

## What this review does not do

- It does not edit `TRANSVERSE_BOUND_CANDIDATE.md` or any other author file.
- It does not accept Math- pull request 9, the axis or thin-belt charts, pull request 22's tube extension, or a program-level RN closure.
- It does not treat the governance- `cursor[bot]` ACCEPT, or any unittest, as the proof.
- It does not award organizational independence.
- It does not flip a scientific status bit.

## Computation record

`python3 -B -S reviews/pr16_fixed_transverse_nonauthor_20260925/algebra_check.py` exited 0. Script SHA256: `9f3580d4e6e99b7f3c7409a97123a2a1d20fa63f45a4cae0b8cbbe1046b98c38`. All printed checks passed, including the six pins, the exact `J_1` and `J_3`, the order-`r` formula for `J_2`, both the limiting and finite-`r` minors `v^6/24`, the `U_4` contact term, the two `det/r` expansions, and the exponent identity `2+3−6+6=5`, then `5−2=3`.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/reviews/d2_cumulative_correction_20260925/REVIEW.md": "IyBSZXZpZXcgb2YgdGhlIGN1bXVsYXRpdmUgdHJhbnNmZXIgY29ycmVjdGlvbiAoRDIpCgoqKkNsYWltLioqIE9uZSBib3VuZGVkIHJlLXJldmlldyBvZiB0aGUgYWRkaXRpdmUgRDIgY29ycmVjdGlvbiBvbmx5LiBUaGUgdHdvLXNjYWxlIFM24oCTUzIxIGFjY2VwdGFuY2Ugc3RheXMgYXQgYGJjN2Q3NTRgIGFuZCBpcyBub3QgcmVvcGVuZWQuCgoqKlNvdXJjZS4qKiBNYXRoLSBQUjI1IGhlYWQgYGQwNmE1NjJkYzc3MTc4OTRiNzVjM2FkZjI1MjhlY2Y5ZWE3NDNjNzNgLCBwYXRoIGByZXZpZXdzL2NvbGxpc2lvbl9tZWNoYW5pc21fMjAyNjA5MjUvQ1VNVUxBVElWRV9UUkFOU0ZFUl9DT1JSRUNUSU9OLm1kYCwgYmxvYiBgMDQ0YWM1ZmRhZjQwM2EzOGUzMzk4M2UzMWYwYWQ2OWY4ZTc2ZDZkNWAsIDMyNzIgYnl0ZXMsIFNIQTI1NiBgODNmNjUzMzkzZGM2MjQ1OTgwZjY4NDhlMmJmYzY1YWM5YWQ0YzdkODMwNGIwMjhiODg3NjQzNTZmZDM4MjViNmAuCgoqKkJvdW5kIGFtZW5kbWVudC4qKiBQUjMyIFIzIGF0IGAxODk2MjgxMTlmNjVkODQ1ZTI3MDc1OWUxYjJiMWU4NGRkYjRjZmUzYCwgZmlsZSBgcmV2aWV3cy9wcjI1X3R5cGVkX3RyYW5zZmVyX25vbmF1dGhvcl8yMDI2MDkyNS9SRVZJRVcubWRgLCBibG9iIGBmYThkYmU4YTVjYTk0ZGRmZDVkMGU3NDUyZTk2MGVhYTRhMWQ5YzQ2YC4gVGhlIHJlcXVpcmVkIGNoYW5nZSB3YXMgb25seSB0aGUgY3VtdWxhdGl2ZSBwYXJhZ3JhcGg6IHJldGFpbiBgaC8ozrogcl5tKeKGkjFgLCBkb21pbmF0ZSBgUl57zrErMX1gIGJ5IGEgbXVsdGlwbGUgb2YgYCjihJMvzropXs6yYCB0aHJvdWdoIHRoZSBsb3dlciBjb21wYXJpc29uLCBrZWVwIGRlcml2YXRpdmUgY29udHJvbHMgb24gRDEgYWxvbmUsIGFuZCBpbnNlcnQgYFJee86xKzF94oi8KOKEky/OuilezrJgIGJlZm9yZSB0aGUgY29uc3RhbnQgYDEvKM6xKzEpYC4KCioqTm90IHJldmlld2VkLioqIFBSMjUgc2VjdGlvbnMgQiBhbmQgQywgdGhlIGRlbnNpdHkgdGhlb3JlbSBEMeKAmXMgcHJvb2YsIFBSMjgsIFBSMzUsIGFuZCBQUjM2LiBObyBhdXRob3IgZmlsZSB3YXMgZWRpdGVkLgoKKipTY2llbnRpZmljIGVmZmVjdDogTk9ORS4qKgoKIyMgUHJvdmVuYW5jZQoKfCBJdGVtIHwgVmFsdWUgfAp8LS0tfC0tLXwKfCBSZXZpZXdlciBtb2RlbCB8IEdyb2sgNC43LCB4QUkgKGBncm9rLTQuNy1oaWdoLWZhc3RgKSB8CnwgQWdlbnQgfCBDdXJzb3IgY2xvdWQgc2Vzc2lvbiBgYmMtZmY2MjA2MzAtNzgyYy00Zjc3LWI5OTQtMzVkMDk2N2U1ZGNlYCB8CnwgUHJvdmlkZXIgfCB4QUkuIFRoZSBjb3JyZWN0aW9uIGlzIGFuIE9wZW5BSS1sYW5lIG5vdGUuIFRoaXMgaXMgbm90IGFuIE9wZW5BSSBzZXNzaW9uLiB8CnwgU291cmNlIGV4cG9zdXJlIHwgVGhlIGNvcnJlY3Rpb24gYmxvYiBhbmQgdGhlIFBSMzIgUjMgc2VjdGlvbiB3ZXJlIHJlYWQuIFRoZSBkaXNwb3NpdGlvbiBpcyBmcm9tIHJlZGVyaXZpbmcgdGhlIGN1bXVsYXRpdmUgbGltaXQsIG5vdCBmcm9tIHRoZSBhdXRob3LigJlzIHRlc3RzLiB8CgojIyBEaXNwb3NpdGlvbgoKKipBQ0NFUFQqKiBmb3IgdGhpcyBjb3JyZWN0aW9uIG9ubHkuCgpUaGUgY29ycmVjdGVkIHN0YXRlbWVudCBrZWVwcyBldmVyeSBwaWVjZSB0aGUgYW1lbmRtZW50IHJlcXVpcmVkLgoKMS4gKipSZXRhaW5lZCByYXRpby4qKiBIeXBvdGhlc2lzIDMgcmVxdWlyZXMgYGgocix6KS8ozrooeikgcl5tKeKGkjFgLCB0b2dldGhlciB3aXRoIGNvbnRpbnVpdHksIHN0cmljdCBpbmNyZWFzZSwgYW5kIGBoKDArLHopPTBgLiBUaGUgdHdvLXNpZGVkIGNvbXBhcmlzb24gYWxvbmUgaXMgbm8gbG9uZ2VyIHRyZWF0ZWQgYXMgZW5vdWdoIHRvIGZpeCB0aGUgY29uc3RhbnQuCgoyLiAqKkludmVyc2UgZXF1aXZhbGVuY2UuKiogSWYgYFJgIGlzIHRoZSBpbnZlcnNlIG9mIGBoKMK3LHopYCBhdCBsZXZlbCBg4oSTYCwgdGhlbiBgUuKGkjBgIGFzIGDihJPihpIwYCwgc28gdGhlIHJldGFpbmVkIHJhdGlvIGF0IGByPVJgIGlzIGDOuiBSXm0gLyDihJMg4oaSIDFgLiBSYWlzaW5nIHRvIHRoZSBwb3dlciBgzrI9KM6xKzEpL21gIGdpdmVzIGBSXnvOsSsxfSAvICjihJMvzropXs6yIOKGkiAxYC4gVGhlIHByb29mIHBsYWNlcyB0aGlzIGxpbWl0IGJlZm9yZSBpZGVudGlmeWluZyB0aGUgY29uc3RhbnQuCgozLiAqKkRvbWluYXRpb24uKiogYGgg4omlIGNfMCDOuiByXm1gIHdpdGggb25lIGZpeGVkIGBjXzA+MGAgZm9yY2VzIGB7aOKJpOKEk31gIGludG8gYHIg4omkICjihJMvKGNfMCDOuikpXnsxL219YCwgaW5jbHVkaW5nIHdoZW4gdGhhdCBjb21wYXJpc29uIHJhZGl1cyBleGNlZWRzIGByXzBgLiBXaXRoIGAw4omkQuKJpEdgIGFuZCBgzrE+LTFgLAogICBg4oSTXnstzrJ9IOKIq18wXntyXzB9IHJezrEgQiAxX3to4omk4oSTfSBkciDiiaQgY18wXnstzrJ9IEcgzrpeey3Osn0vKM6xKzEpYC4KICAgSHlwb3RoZXNpcyAyIG1ha2VzIHRoZSByaWdodC1oYW5kIHNpZGUgaW50ZWdyYWJsZS4gUG9pbnR3aXNlIGNvbnZlcmdlbmNlIG9mIHRoZSBub3JtYWxpemVkIGlubmVyIGludGVncmFsIGFuZCBkb21pbmF0ZWQgY29udmVyZ2VuY2UgZ2l2ZQogICBgbGltX3vihJPihpIwfSBOKOKEkykv4oSTXs6yID0gMS8ozrErMSkg4oirIEJfMCDOul57Lc6yfSBkzrtgLgoKNC4gKipEZXJpdmF0aXZlIHNlcGFyYXRpb24uKiogVGhlIGFyZ3VtZW50IHVzZXMgdGhlIGludmVyc2UgYW5kIHRoZSBpbmRpY2F0b3IuIEl0IGRvZXMgbm90IHVzZSBgaF9yYCBvciBhIGxvd2VyIGJvdW5kIG9uIGBoX3JgLiBUaGUgbm90ZSBsZWF2ZXMgdGhvc2UgY29udHJvbHMgb24gRDEgYW5kIGRvZXMgbm90IGluZmVyIGEgZGVuc2l0eSBhc3ltcHRvdGljIGZyb20gdGhlIGN1bXVsYXRpdmUgbGltaXQuCgo1LiAqKlplcm8gY29lZmZpY2llbnQuKiogVGhlIGlkZW50aXR5IGZvciB0aGUgbGltaXQgaW5jbHVkZXMgYSB6ZXJvIGludGVncmFsLiBJbiB0aGF0IGNhc2UgYE4o4oSTKT1vKOKEk17OsilgLiBBIHBvc2l0aXZlIGFzeW1wdG90aWMgZXF1aXZhbGVuY2UgaXMgc3RhdGVkIG9ubHkgd2hlbiB0aGUgaW50ZWdyYWwgaXMgcG9zaXRpdmUuCgpUaGUgZmFjdG9yIGAyXnstzrJ9YCBleGFtcGxlIG1hdGNoZXMgdGhlIGFtZW5kbWVudOKAmXMgYXJpdGhtZXRpYy4gRm9yIGBoPTIgzrogcl5tYCwgYM6xPTFgLCBgbT0zYCwgYM66PUI9MWAsIGFuZCBgUj0xLzJgLCBvbmUgaGFzIGDihJM9MS80YCBhbmQgYE494oirXzBeezEvMn0gciBkcj0xLzhgLiBUaGVuIGBOXjM9MS81MTJgIGFuZCBgKOKEk157Mi8zfS8yKV4zPTEvMTI4YC4gVGhlIG5vcm1hbGl6ZWQgcmF0aW8gaXMgYE4gLyAo4oSTXnsyLzN9LzIpID0gMl57LTIvM31gLCB3aGljaCBpcyB0aGUgY29uc3RhbnQgcHJvZHVjZWQgYnkgcmVwbGFjaW5nIGDOumAgd2l0aCBgMs66YCB3aGVuIHRoZSByYXRpbyBsaW1pdCBpcyBgMmAgcmF0aGVyIHRoYW4gYDFgLgoKIyMgQ29tcHV0YXRpb24KClB5dGhvbiAzLjEyLjMsIHN0YW5kYXJkIGxpYnJhcnksIGBjaGVja19jb3JyZWN0aW9uLnB5YDogdGhlIHZhbHVlcyBg4oSTPTEvNGAsIGBOPTEvOGAsIGBOXjM9MS81MTJgLCBhbmQgYCjihJNeezIvM30vMileMz0xLzEyOGAuIEN1YmluZyB0aGUgbm9ybWFsaXplZCByYXRpbyBzdGF5cyBpbnNpZGUgYGZyYWN0aW9ucy5GcmFjdGlvbmAgYW5kIGdpdmVzIGBOXjMgLyAo4oSTXjIvOCkgPSAxLzQgPSAoMl57Lc6yfSleM2Agd2l0aCBgzrI9Mi8zYC4K", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/reviews/p15_full_price_nonauthor_20260926/REVIEW.md": "# Nonauthor analytic review — P15 full transformed-price theorem

Scientific effect: **NONE**. This file does not change `lemma_closed`, prizes, premises, or `claims/LANDING_CLAIMS.json`. It does not accept an unrestricted downset theorem or an unrestricted P15 prize.

## Pickup

Math- issue 57 is in scope. The immutable subject is present at the pinned blob, byte length, and SHA256. This run is the single bounded review. No child agent was launched.

## Claim

| Field | Value |
|---|---|
| Object | `P15-FULL-TRANSFORMED-PRICE-20260924-v1`, Theorem F |
| Read at | `53320cbc8a4d15b9f675885a1d7760656bcc3b4f` |
| Path | `frontiers/full_price_20260924/PROOF.md` |
| Blob | `582180e41dca0ad815ad0f18574df42040912149` |
| Size | 11352 bytes |
| SHA256 | `87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9` |
| Author of the object | OpenAI / ChatGPT |
| Scope | Realized disjoint capacity/clutter family; `a_i>=1`, `d_i>=2`; every independent `p` in `[0,1]^X`; `0<=c_v<=phi(p_v)`; same palette `K>=K_H(d)`; uniform factor `rho_star=1/h_star` |
| Excluded | Arbitrary downsets, demand one as a uniform extension, unrestricted prize closure, and any flip of the landing disposition |
| State | Delivery record on publication of this file |

`frontiers/full_price_20260924/PROOF.md` was not edited.

## Reviewer provenance

| Field | Value |
|---|---|
| Provider | xAI |
| Model | Grok 4.7 (`grok-4.7-high-fast`) |
| Agent | Cursor cloud run `bc-3902d28e-89f5-40ac-9c3a-1afccff355ed` |
| Run URL | https://cursor.com/agents/bc-3902d28e-89f5-40ac-9c3a-1afccff355ed |
| Account wrapper | Cursor application, owning user Electric_Universe_Theory |

Organizational independence is not awarded. Provider separation is narrower: the proof's author is OpenAI, and this reviewer is xAI Grok, so the dispositions are a nonauthor technical review.

## Source exposure

Read in full: the immutable proof above.

Read as the cited setwise dependency, and checked for the local restriction and the full-block cover: `frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md`, 11467 bytes, SHA256 `c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9`. That is the digest named in the proof. The check uses (P1), (P2), and Theorem P2 there. It does not accept that note's `c_v<=p_v` price theorem, and it does not widen the note beyond the realized family.

Read as the two-coordinate predecessor of the demand-one boundary: `frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md`, 2266 bytes, SHA256 `498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b`.

Author unit tests were not used as evidence. No SMT transcript is in this tree; the issue states that the existing SMT pilot checks seven algebraic substeps and is not theorem acceptance. This review does not treat that pilot as acceptance.

## Method

Sections 1–6 of the proof were checked as written arguments. Separately, `algebra_check.py` (standard library only) checks the separate-derivative numerator, the odd-binomial form of (F10) and its sign on and off `(1/2,1)`, fixed-threshold augmentation, the rational `6/7` certificate, an independent enclosure of (F3), and the demand-one comparison `e>1`.

Command:

```sh
python3 -B -S reviews/p15_full_price_nonauthor_20260926/algebra_check.py
```

Script SHA256: `68c66cbeaab7941cafa7cf2d6f93d2e98543b5a040b7eede1433ffa2127cf4e9`. The run printed `all certificates passed`.

## Dispositions

| Slice | Disposition |
|---|---|
| 1. Coordinatewise hazard transform, separate concavity, chord, `p=0,1` | **ACCEPT** |
| 2. Capacity local event, binomial ratio, odd-majority worst case | **ACCEPT** |
| 3. Global hazard direction and disjoint-block independence | **ACCEPT** |
| 4. Full-block cover, same palette, realized family | **ACCEPT** |
| 5. Sharpness at capacity one, demand two, alternative covers | **ACCEPT** |
| 6. Demand-one boundary and exact theorem scope | **ACCEPT** |

Overall exact-scope disposition: **ACCEPT** Theorem F on the realized family stated in section 1 of the proof.

## 1. Coordinatewise hazard — ACCEPT

Let `A` be a proper decreasing family on `n>=1` coordinates that contains the empty set. On `t in [0,1]^n`, `p_i(t)=1-exp(-t_i)<1`, so the product measure of the empty set is positive and `F_A=-log mu_{p(t)}(A)` is finite. Properness at the all-ones vector gives `H_A=F_A(1,...,1)>0`, because every nonempty cylinder still has positive probability and some set lies outside `A`.

Fix coordinate `i` and average the others. Decreasingness splits the average into sets that remain admissible when `i` is present, with mass `A0`, and sets that are admissible only when `i` is absent, with mass `B0`. Thus

`mu(A)=A0+B0 exp(-t_i)`, `A0>=0`, `B0>=0`, `A0+B0>0`.

`B0>=0` is the decreasing constraint. Differentiating in `t_i` produces (F5). The numerator of the second derivative is `-A0 B0 exp(-t_i)`, so the second pure partial is `<=0`. That is separate concavity in each coordinate. Joint concavity is not used.

`F_A>=0` because `mu<=1`. A univariate concave function therefore lies above the chord from `0` to `1`, and the value at `0` drops out:

`F_A(t) >= t_i F_A(t with t_i=1)`.

Iterating in the remaining coordinates, with every `t_j>=0`, gives (F6).

For `p_i in [0,1]`, `phi(p)=min(1,-log(1-p))` with the stated value `phi(1)=1`. The comparison probabilities `p'_i=1-exp(-phi(p_i))` satisfy `p'<=p`. At `p=0`, `phi(0)=0`. On `(0,1-e^{-1}]`, `phi(p)=-log(1-p)` and `p'=p`. On `(1-e^{-1},1]`, `phi(p)=1` and `p'=1-e^{-1}`. No coordinate of `p'` equals `1`, so `F_A(phi(p))` never evaluates `log 0`. Coupling `p'` as a subset of `p` and using decreasingness gives `mu_p(A)<=mu_{p'}(A)`. If `mu_p(A)=0`, (F7) is the extended inequality `infinity >= H_A product phi(p_i)`. A zero factor `phi(p_i)=0` makes the product zero and is not used as a divisor.

Every admissible price satisfies `0<=c_i<=phi(p_i)<=1`, so the full-ground product is at most `1` and, by (F7), at most `[-log mu_p(A)]/H_A`. That is (F8), again in the extended sense when the hazard is infinite. Equality holds in (F7) at `p_i=1-e^{-1}` and `c_i=1`. The same reference vector is where the uncapped factor `1` meets `min(1,-log mu)` for every transformed price vector if and only if `H_A>=1`: sufficiency is `1/H_A<=1`, and necessity is the product `1` against hazard `H_A`. (F8) itself remains a price bound for that one generator. Coverage of an obstruction is a separate setwise fact.

## 2. Capacity worst case — ACCEPT

On one block the realized local restriction is exactly `{S:|S|<=a}`, by (P2) of the pinned realized-cover note. With `n=a d+1` and `d>=2`,

`n-(2a+1)=a(d-2)>=0`,

so `n>=2a+1`. For a fixed threshold, one added Bernoulli trial changes the good probability by `-p P(Bin(n)=a)`. At `p in (0,1)` this is strictly negative. Raising `n` above `2a+1` therefore strictly raises the hazard at `p_star`. The minimum of `H_(n,a)` occurs at `n=2a+1`.

For `S~Bin(2a+1,p)`, adjoining two trials gives

`P(Bin(2a+3,p)<=a+1)-P(S<=a)=(1-p)^2 P(S=a+1)-p^2 P(S=a)`.

The central binomial identity `C(2a+1,a)=C(2a+1,a+1)` makes the ratio of those two point masses `p/(1-p)`. Substitution then produces the second equality of (F10),

`p(1-2p) P(S=a)`.

The algebraic reduction is valid for every `p in [0,1]`. The factor `P(S=a)` is positive on `(0,1)` and zero at `p=1`. The factor `1-2p` is negative only for `p>1/2`. Strict negativity is therefore exactly the open interval `1/2<p<1`. Both endpoints give difference zero: at `p=1/2` by the linear factor, and at `p=1` because `P(S=a)=0`. The proof's sentence "with `p>1/2`" followed by "`<0`" is one endpoint wider than this interval. The only probability at which the worst-case comparison is used is `p_star=1-e^{-1}`. The rational enclosure of `e` gives `1/2<1-1/e_lo<p_star<1-1/e_hi<1`, so `p_star` is interior and (F10) applies strictly there. Theorem F and the reduction to `H_(3,1)` use that interior point, so the endpoint `p=1` does not require an amendment. The odd-tail good probability is then strictly decreasing in `a>=1`, and its maximum is at `a=1`, `n=3`.

The resulting value is

`P(Bin(3,p_star)<=1)=3e^{-2}-2e^{-3}`,

`H_(3,1)=3-log(3e-2)=h_star`.

Since `e>2`, `(e-1)(e-2)>0` rearranges to `3e^{-2}-2e^{-3}<e^{-1}`, hence `h_star>1`. Every larger capacity or demand in the stated class has hazard at least `h_star`. This comparison is an identity at `p_star`, not a grid extrapolation.

Equations (F8) and `H_(n,a)>=h_star` give (F12): the full-block price is at most `rho_star[-log mu_p(D_i)]` and at most `1`. Because `rho_star<1`, that price is also at most `min(1,-log mu_p(D_i))=phi(q_i)`. The stronger comparison `price<=q_i` fails when every `c_v=1` and `mu_p(D_i)>0`, which is the three-coordinate reference point: the generator price is `1` and `q_i<1`.

## 3. Global hazard direction — ACCEPT

Assume every local good probability is positive. The blocks are disjoint and the coordinates are independent, so the local events `{|U intersect X_i|<=a_i}` are independent and

`mu_p(intersection_i D_i)=product_i mu_p(D_i)`.

Global goodness is that intersection cut by the further requirement that the occupied-block support contains no edge of `H`. The inclusion `D subset intersection_i D_i` does not use independence of crossing failures. It supplies

`mu_p(D)<=product_i mu_p(D_i)`,

and the logarithm reverses the inequality to (F13). Summing (F12) bounds the union of the full-block generators by `rho_star[-log mu_p(D)]`.

Independence is used only for that product of local events. A crossing constraint can only make `mu_p(D)` smaller. If the union price exceeds one, the empty generator has price one. The switch is valid: the union price is already at most `rho_star` times the global hazard, so that product exceeds one and the capped right-hand side of (F2) equals one. If some local good probability is zero, then `mu_p(D)=0` and the same price-one cap gives (F2). If global goodness vanishes only because of a crossing event, the local sum remains a lower bound in the extended reals and the cap again gives (F2).

## 4. Full-block cover and realized family — ACCEPT

The price bound in sections 2–3 does not create the cover. For this `D`, the pinned note's Theorem P2 states that `G={X_1,...,X_b}` covers `O_K(D)` if and only if `K>=K_H(d)`.

Sufficiency: a set that meets no generator omits at least one vertex in every block, so each block has size at most `a_i d_i` and splits into at most `d_i` pieces of size at most `a_i`. Labels taken from palettes `P_i` with empty intersection along every edge of `H` put each color class inside `D`. Necessity: the set that omits one vertex in every block avoids every `X_i`, and any decomposition into members of `D` uses at least `d_i` colors in block `i` whose supports are independent sets of `H`. Below `K_H(d)` that set is an uncovered obstruction.

Both directions use the capacity-and-clutter description (P1). An arbitrary decreasing family need not have the full blocks as a cover at palette `K_H(d)`. Section 2 of the proof already separates the full-ground price estimate from obstruction coverage. The same-palette hypothesis of Theorem F is exactly `K>=K_H(d)` from (P7). Probabilities and prices do not enter that setwise statement. The six-block numerical illustration, with `K_H=816` and whole-ground chromatic number `818`, is an instance of this same cover; it is not a second theorem.

The realized-cover price theorem under `c_v<=p_v` is a different hypothesis. Theorem F replaces that price ceiling by `c_v<=phi(p_v)` and pays for the wider ceiling with the factor `rho_star` on the `d_i>=2` family.

## 5. Sharpness — ACCEPT

Take one block, `a=1`, `d=2`, `n=3`, empty `H`, and `K=2`. Then `K_H(d)=2`, `D` is the sets of size at most one, and `O_2(D)` is exactly the full triple. Every proper subset splits into two sets of size at most one.

At `p_i=p_star` and `c_i=1`, `phi(p_star)=1`, so every generator price is `1`, including the empty generator. A generator cover of the triple must contain at least one generator, because the empty family leaves the triple uncovered. Every alternative cover therefore costs at least one, and the full block attains one.

The hazard of this block is `h_star`, so the right-hand side of (F2) equals `min(1,rho_star h_star)=1`. Replacing `rho_star` by any smaller positive constant makes that right-hand side strictly smaller than one while every cover still costs at least one. The witness lies inside the realized class, so the uniform constant is sharp for the class. The argument counts every generator cover of this obstruction, not only `{X}`.

## 6. Demand one and exact scope — ACCEPT

If `d=1`, then `n=a+1` and, with empty `H`, `K_H(d)=1`. The only obstruction is the full block. At `p_i=p_star` and `c_i=1`, every cover still costs at least one. The good probability is `1-p_star^{a+1}`. For `a>=1` and `p_star in (0,1)`,

`p_star^{a+1}<p_star`,

so `mu_p(D)>1-p_star=e^{-1}` and the hazard is strictly less than one. Then

`min(1, rho_star[-log mu_p(D)]) < 1 <= covercost`.

The same-palette transformed-price bound (F2) is false on this demand-one family. For `a=1` the same comparison is `e>1`, which is the two-coordinate member `n=2`. That preserves the earlier boundary, where `p=1/2` and `c=2/3` already make every cover cost `4/9>log(4/3)`. The `p_star` witness is the uniform-factor form of that boundary. Original P15-B asks for a local `phi(q_i)` budget on each local cover; the demand-one reference point has full-block price `1` and local hazard below one, so that local premise is absent.

The theorem's positive statement remains the realized family with every `d_i>=2`. A single multi-block example that happens to have some demand equal to one can still have a large crossing penalty. Section 5 does not claim that every such mixed instance fails. It claims that no uniform statement with this palette and this transformed-price ceiling survives once every demand-one example is admitted, while `d_i>=2` is sufficient for the realized capacity family on the full probability cube.

The displayed scope in section 1 matches these slices: disjoint blocks, edges of size at least two, empty `H` allowed, `a_i>=1`, `d_i>=2`, independent `p`, prices through `phi`, palette `K_H(d)`, and uniform factor `rho_star`, with `6/7` as a coarser rational upper bound. The older factor `16/27` on probabilities at most `1/4` is a different theorem and was not re-proved here.

## Numerical certificate

The proof's rational bound was recomputed from the exponential series. The degree-7 tail gives

`e < 31967/11760 < 87/32`, `87/32-31967/11760=11/23520`,

and the degree-5 Taylor gap at `11/6` is exactly `26081/933120`. Thus `3e-2<197/32<exp(11/6)`, `h_star>7/6`, and `rho_star<6/7`.

An independent series enclosure of `e`, binary reduction of `3e-2`, and the odd logarithm remainder on `[1,2]` places `rho_star` in the open interval stated in (F3):

`0.84547981724898672067 < rho_star < 0.84547981724898672068 < 6/7`.

## Overall

**ACCEPT** the exact statement of Theorem F. The six slices close on that statement: the hazard transform and its boundary conventions, the reduction of every `d_i>=2` capacity hazard to `h_star` at an interior `p_star`, the one-sided use of disjoint-block independence, the realized full-block cover at `K_H(d)`, sharpness against every generator cover of the `a=1`, `d=2` triple, and a demand-one counterexample to dropping `d_i>=2`.

This acceptance is the scoped nonauthor reading of the pinned proof. It leaves the landing disposition untouched.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/main/f2e432ea5c86742e480c66624775bc9103343314/STATUS.md": "# 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.

## 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 |

## AMEND / open

| Object | Current reason | Source |
|---|---|---|
| **D5 — pin neighborhoods / microdisk** | The public reconnaissance has an AMEND review; the inner microdisk bound and collar to the reviewed annulus are not complete, and the claimed summed pin-neighborhood bound remains AMEND. | [Math proof index](https://github.com/d6g8k5htny-coder/Math-/blob/main/PROOF_INDEX.md) · [Math issue #58](https://github.com/d6g8k5htny-coder/Math-/issues/58) |
| **SARD-G A1/A6** | A1 remains AMEND as written; A6's slicing argument is conditionally valid but its source application remains AMEND until the required open-chart premise is repaired. | [Successor review](reviews/sard_g_successor_a1_a6_20260926/REVIEW.md) · [current 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.”
", "https://raw.githubusercontent.com/d6g8k5htny-coder/main/71400b94f6cb354a8cf7aba73ffede2138a64efa/reviews/sard_g_successor_a1_a6_20260926/REVIEW.md": "# PR122 strict-gradient successor: focused A1/A6 review

Review date: 2026-09-26. Repository: [d6g8k5htny-coder/main, PR122](https://github.com/d6g8k5htny-coder/main/pull/122). Exact reviewed head: `a1fc9581291b6f81c76c903c96a13955b51f8d54`.

**Disposition: A1 AMEND as written; A6's conditional slicing argument is valid, but its application to the stated chart predicate remains AMEND.** The strict gradient-exclusion repair fixes the equality-boundary defect identified in the previous review. A separate geometric boundary remains unspecified: the membership predicate does not require a hit of a finite section to lie in its relative interior. Under the closed-section interpretation explicitly used by the parent manuscript, a chart can contain a transverse endpoint hit and fail to be open. An analytic example below verifies this while all the stated numerical margins have strict slack.

This finding concerns the written chart definition. If “crossing” is intended to include an interior-hit requirement by definition, that convention must be made explicit and applied to every chart member, including the local branch-label sections. I found no such definition in the complete successor, its mapped parent manuscript, or its mapped specialist review. The example is not a counterexample to the desired almost-sure transversality theorem.

| Interface | Disposition on these source bytes | Delimited conclusion |
|---|---|---|
| A1: openness, countability, coverage | **AMEND** | Condition 1 now has the required strict threshold and a sound persistence argument. Finite rational data are countable. The membership rules for sections and first hits need the explicit robust geometric convention described below before openness of every `U_chi` follows. |
| A6: interval slicing | **Conditional argument verified; source application AMEND** | Given genuinely open charts, a C1 mismatch map, and the stated A2–A5 dependencies, the regular-zero and Borel/Tonelli argument works. The present invocation of A1 does not establish that premise for the written predicate. |

No new verdict is issued on A2–A5, finite-jet nondegeneracy, C103, or any downstream result. The full-Gaussian C103 corollary is not discharged by this review and remains on HOLD under the source's own review rule. No author proof, claim register, or scientific status was changed.

## 1. Source identity, authorship, and exposure

The reviewed Git tree is `c20b9638422c6cd594353aaae75a5e1a69fae3a6`. The [complete successor proof](https://github.com/d6g8k5htny-coder/main/blob/a1fc9581291b6f81c76c903c96a13955b51f8d54/research/q0/sard_g/SARD_G_EXECUTION_REPAIR_20260925.md) is `research/q0/sard_g/SARD_G_EXECUTION_REPAIR_20260925.md`.

| Reviewed object | Git blob | Bytes | SHA-256 |
|---|---|---:|---|
| Successor proof | `8f86e0c9ef91fde473e2344a3e461c31f63f8529` | 17,285 | `0fe23db6afc1834610572e307d85f303acfe61300a0c388bd262272857aa7ee4` |
| `SOURCE_MAP.json` | `78a2a4550bbd83071ba7089a2da2c0d6d37dbda3` | 1,354 | `934ae22905f9ac58a3854053202ebe61b79fc53805fdae964749cb9130f49b40` |
| `RECONNAISSANCE.md` | `63f5aa4c0ebfa27ba3b20fad11b5914ba974cd2e` | 1,426 | `90623b128f0de91cc29818bc12392b354a51995e2f4c1bf67a94dd8112db9330` |
| `chart_predicate_negative_control.py` | `7f41ea3a0b0301e0ecdb72de86d00b4d8d9da291` | 10,103 | `cd49c019e5491b15b003eff14f7be406edb6670174633b813db86b7b2bcf158d` |
| Parent Gaussian-transversality working source | `a0f4aa6ab6d0e21e7a24b4a6e1aa4fdebc40efdc` | 19,242 | `4a77f3b7ed390c0ebff3c580baa4d8a107bf3cf2b892c5927e5ffe005ad1c1fe` |
| KIMI-AUD-022 specialist review | `e968385a3bf4e8318a9ab6cb4f57818828f01b18` | 9,527 | `8efcd937502b67ab515d41435eace639000c287ce5e6773105953319f48429b8` |

The parent and specialist paths are pinned in the [source map at the reviewed head](https://github.com/d6g8k5htny-coder/main/blob/a1fc9581291b6f81c76c903c96a13955b51f8d54/research/q0/sard_g/SOURCE_MAP.json). Their full texts are public repository objects. In particular, the [complete parent manuscript](https://github.com/d6g8k5htny-coder/main/blob/a1fc9581291b6f81c76c903c96a13955b51f8d54/drive/mirrors/16_THEMATIC_RESEARCH_TRACKS/T2%20%E2%80%94%20SARD-G%20Transversality/01_TRANSVERSALITY_MANUSCRIPTS/02_GAUSSIAN_TRANSVERSALITY%20%E2%80%94%20WORKING-SOURCE%20%E2%80%94%2019242B%20%E2%80%94%20SHA4a77f3b7%20%E2%80%94%20ID19G4QeIu.md) supplies the closed-section convention discussed below.

The earlier [complete A1/A6 report](https://github.com/d6g8k5htny-coder/main/blob/cc18155abf912d3b8f25ac133ea42bb327287709/reviews/sard_g_a1_a6_20260926/REVIEW.md) reviewed head `6a7f1f6cfb49703b7b758343d65b3b65abe6b11b`, tree `f2deec3727a73ab803b13f314d1b62f9f9f404b4`. Its [old proof](https://github.com/d6g8k5htny-coder/main/blob/6a7f1f6cfb49703b7b758343d65b3b65abe6b11b/research/q0/sard_g/SARD_G_EXECUTION_REPAIR_20260925.md) is blob `a0e9f7d8960f785281fea5aef1bc8b011cbbb055`, 14,672 bytes, SHA-256 `6b04ad32e55c3e0c4f489e45f7687b0f96ec9e1ad25d01b2de5df50a6ab333d0`. The prior report itself is blob `e075929cfcb5e6d10b9f63b2a47c5b2612f85413`, 17,517 bytes, SHA-256 `b56f50ded406d5359c0990cf3aac2669c45917c4b351b4557c3693d9118b2273`; the local copy read for this review matches that public Git object exactly.

Reviewer: OpenAI / ChatGPT, Codex review agent. I did not author the successor proof or the previous report. I read the previous report before completing this review, and reused its elementary trigonometric field to test a different boundary mechanism. This is a source-exposed, nonblind, same-provider technical contribution with **zero organizational-independence credit**. It should not be represented as a fresh provider-independent confirmation. No child agents were used.

I read the complete successor proof, source map, reconnaissance, negative-control script, parent working manuscript, specialist review, and previous A1/A6 report. I checked that successor Sections 4–6 are byte-identical to those at both `6a7f1f6cfb49703b7b758343d65b3b65abe6b11b` and `d49be07074bd0696cc034757379771eae3c852de`: the block from `## 4.` up to `## 7.` is 3,264 bytes with SHA-256 `9300693aa97d54eae580042702d10d1086c82e7966f211259847a60807a04050`. Identity is not a new mathematical verdict. The source map's finite-jet input, blob `1bea9e62ef1ec621f51953dd3f5d5410fba616af`, was not re-proved here.

## 2. The old equality-margin defect is repaired

Successor Section 3 condition 1 now requires

$$m_K(f):=\min_K |\nabla f|>\eta,$$

not equality-permitting `m_K(f) >= eta`. Its estimate

$$|m_K(f)-m_K(g)|\leq\|\nabla f-\nabla g\|_\infty$$

correctly makes this condition open. A perturbation smaller than the actual slack preserves the bound. The same strict inequality appears in the later slicing discussion and in the amended negative-control decision. The previous scaling example at `m_K(f)=eta` is now excluded from that fixed chart, while choosing a smaller rational threshold preserves coverage of its connection.

The rest of the source's condition 1 argument is also sufficient locally. The unique critical point in the closed outer box lies inside its continuation neighborhood because the boundary is in the compact exclusion set. The implicit-function theorem continues its nondegenerate zero inside a small ball. The compact remainder of the outer box outside that ball has a positive gradient minimum, so small C1 perturbations create no other zero. C2 continuity preserves the index and the strict spectral gap. This addresses both the hidden-critical-point failure of an earlier predecessor and the later threshold-equality failure.

The geometric issue below has positive exclusion slack throughout. It does not revive either of those repaired examples.

## 3. What the section membership rules actually say

Successor Section 3 chooses a rational transverse line segment `Sigma` inside a rational tube. Condition 2 requires the declared local branches to meet their local sections uniquely and transversely. Condition 3 requires the branches to remain inside the tube until their unique first crossing of `Sigma`. Condition 4 requires strict speed, angle, and travel-time inequalities. Neither condition 2 nor condition 3 states that the hit lies in the section's relative interior, or assigns positive distance from its endpoints.

This is not resolved by a contrary definition in the mapped sources:

- Parent Section 8.4 explicitly discusses hitting a **fixed closed section** on the unique transverse first-crossing event. Its Section 8.3 lists tube, speed, angle, and time conditions without an endpoint exclusion.
- Parent Section 3 chooses a section through an interior point of the **orbit segment**. That locates a section along the orbit; it does not define every allowed hit to lie in the relative interior of the finite section.
- The specialist review calls this chart bookkeeping an execution-level clarification. It does not supply a global definition of crossing that excludes endpoint hits.
- The successor's coverage paragraph says to choose an “interior transverse section” when constructing a good chart around a connection. That is a choice made for coverage, not a restriction in the preceding definition of every `U_chi`.
- The assertions that all conditions have strict margins and that boundary parameters lie outside a chart interval do not supply the missing membership condition. A transverse endpoint hit can satisfy every numerical inequality that was actually listed.

For the following example, a transverse crossing of a closed line segment means a hit of that segment with nonzero velocity component normal to its supporting line. The crossing angle in the written predicate is then strictly positive, including at an endpoint. This is the closed-section interpretation supported by the parent. If instead a “section” is by definition relatively open, or “crossing” is by definition an interior hit, the example is excluded; that additional convention is precisely what needs to be stated. Merely changing to a relatively open segment also needs care about earlier contacts with its closure, as explained in Section 5 below.

## 4. Endpoint example with strict margins and persistent critical points

Work on the unit torus with ascending gradient flow and set

$$F(x,y)=\sin(2\pi x)\bigl(2-\cos(2\pi y)\bigr),\qquad a=(2\pi)^2.$$

Its first and second derivatives are

$$F_x=2\pi\cos(2\pi x)(2-\cos(2\pi y)),\qquad
F_y=2\pi\sin(2\pi x)\sin(2\pi y),$$

$$F_{xx}=-a\sin(2\pi x)(2-\cos(2\pi y)),\quad
F_{yy}=a\sin(2\pi x)\cos(2\pi y),\quad
F_{xy}=a\cos(2\pi x)\sin(2\pi y).$$

Since `2-cos(2 pi y)` is positive, the complete critical set is

$$x\in\{1/4,3/4\},\qquad y\in\{0,1/2\}.$$

At `p=(3/4,0)` the Hessian is `diag(a,-a)`, and at `q=(1/4,0)` it is `diag(-a,a)`. At `(1/4,1/2)` it is `diag(-3a,-a)`, and at `(3/4,1/2)` it is `diag(3a,a)`. Thus all four points are nondegenerate, and their critical values are respectively `-1,1,3,-3`. They are distinct. This verifies the Morse and distinct-critical-value properties stated for the generic fields in Section 2; it does not make any new probabilistic assertion about the finite-jet input.

The line `y=0` is invariant. In cover coordinates, the arc

$$3/4<x<5/4$$

has velocity `dx/dt=2 pi cos(2 pi x)>0`, and its two asymptotic endpoints are p and the lift `(5/4,0)` of q. It is an actual saddle-to-saddle connection.

Use square endpoint boxes centered at these lifts, with outer, inner, and continuation halfwidths

$$r_+=1/20,\qquad r_-=3/100,\qquad r_N=1/100.$$

Their required compact containments and disjointness hold. Each closed outer box has exactly its designated saddle. If K is the union of the two compact continuation complements, then

$$m=\min_K |\nabla F|>0.$$

One can choose the margins numerically. Write `(u,v)` for coordinates relative to either saddle, so `|u|,|v| <= 1/20` in its outer box. On K either `|u| >= 1/100`, giving `|F_x| >= 2 pi/25`, or `|v| >= 1/100`, giving `|F_y| > pi/25` because `cos(2 pi u) > 1/2`. These bounds use `sin t >= 2t/pi` for `0 <= t <= pi/2`. Hence `m > pi/25 > 3/25`. Choose `eta=1/20` and `delta=1`; in particular `eta<m/2`. These are strict exclusion and spectral margins, with no equality case.

Choose the rational local-section pairs as vertical closed segments with `-1/100 <= y <= 1/100`, at x-coordinates

$$73/100,\ 77/100\quad\hbox{for p},\qquad
123/100,\ 127/100\quad\hbox{for the lift of q}.$$

They lie inside the corresponding inner boxes. Track p's right unstable branch, whose local launch is at `x=77/100`, and q's left stable branch, whose local launch for backward traversal is at `x=123/100`. The local hits are unique, transverse, and in the relative interiors of these sections. Let the open rational polygonal tube be

$$T=(7/10,13/10)\times(-1/50,1/50)$$

in the same coordinate cover. It contains the connection and both tracked compact travel arcs. Define the central **closed** rational section by

$$\Sigma=\{(1,y):0\leq y\leq 1/200\}.$$

The entire section is inside T. Both tracked branches first hit it at `(1,0)`, its lower endpoint. Their x-coordinates are strictly monotone on the travel arcs, so neither branch has any earlier section hit, boundary hit, or tangent contact. At the hit the velocity is horizontal and normal to the vertical supporting line. The crossing-angle sine is exactly 1, so a declared lower bound `1/2` has strict slack.

On the compact horizontal arc `77/100 <= x <= 123/100`, the speed satisfies

$$|\nabla F|\geq 2\pi\sin(\pi/25)\geq 4\pi/25>12/25.$$

Here the middle inequality follows from `sin t >= 2t/pi` on `[0,pi/2]`. Thus a rational speed lower bound `1/4` is strict. Each launch-to-section distance is `23/100`, so each travel time is less than

$$\frac{23/100}{12/25}=\frac{23}{48}<1.$$

The rational upper time bound 1 is strict. As in the source's compact regular-segment construction, speed and travel time refer to finite travel from local sections; they cannot refer to travel starting at the equilibrium itself. The compact travel arcs have positive distance from the tube boundary: at least `1/50` at F. The tube is deliberately open and contains the arcs including their launch and terminal points. No tube-boundary ambiguity is used.

Under the stated closed-section interpretation, all four written membership conditions therefore hold for this fixed rational tuple chi, and `D_chi(F)=0`.

Now translate vertically:

$$F_\varepsilon(x,y)=F(x,y+\varepsilon),\qquad \varepsilon>0.$$

These are smooth torus fields and `F_epsilon -> F` in C2. Their entire critical sets are obtained by shifting those of F down by epsilon. In particular the designated saddles are exactly

$$p_\varepsilon=(3/4,-\varepsilon),\qquad
q_\varepsilon=(5/4,-\varepsilon)$$

in the selected cover. Their Hessians remain exactly `diag(a,-a)` and `diag(-a,a)`. The other two critical points remain a minimum and a maximum, with the same Hessians and the same distinct critical values as before. For `0<epsilon<1/200`, each designated saddle stays strictly inside its continuation square; the explicit critical set shows that no other critical point enters either closed outer box. There is no loss of uniqueness, no spectral degeneration, and no critical-value collision.

On the fixed compact set K, uniform gradient convergence gives

$$\min_K|\nabla F_\varepsilon|\geq m-\|\nabla F_\varepsilon-\nabla F\|_\infty>m/2>\eta$$

for all sufficiently small positive epsilon. Thus condition 1 remains satisfied with the same strict margins.

The translated connection is the line `y=-epsilon`. Its branch-label hits still lie in the interiors of the same local sections. Its finite travel arcs remain strictly inside T; their distance from the horizontal tube boundary is greater than `3/200` for `epsilon<1/200`. Their horizontal dynamics, speed estimates, angles with the vertical supporting lines, and supporting-line travel times are identical to those for F. The central supporting line is crossed once at `(1,-epsilon)`, which lies **below** the closed segment Sigma. No later hit of Sigma can occur, since x is monotone along the connection and tends to its saddle endpoint.

Consequently `F_epsilon` fails the section-hit requirement while preserving the other listed conditions, and

$$F\in U_\chi,\qquad F_\varepsilon\notin U_\chi,\qquad
F_\varepsilon\longrightarrow F\text{ in }C^2.$$

This proves nonopenness for the parent-supported closed-section reading of the written predicate. The failure occurs at a Morse connection with distinct critical values and with strictly positive gradient-exclusion slack. It is different from the old equality-threshold counterexample, which the successor correctly excludes.

## 5. The bounded geometric amendment needed for A1

A sufficient repair is to state the robust geometric membership conditions, rather than infer them from speed, angle, and time bounds. This report does not edit the author source.

For the central section, require the selected hit to lie in the relative interior of its fixed finite segment and require it to be the first hit of the **closed** segment, with no earlier contact of any kind. Equivalently, an open-section convention can be used if it also excludes earlier contact with the closed section's boundary. Apply the corresponding interior-hit and local uniqueness conditions to the branch-label sections. The reference branch must start away from the relevant section and have a positive finite travel time.

This convention supplies the needed first-hit argument. At an interior transverse hit, the implicit-function theorem tracks a nearby hit on the supporting line, and the positive endpoint distance keeps it in the finite segment. Outside a small time neighborhood of that hit, the earlier compact orbit prefix is disjoint from the closed section, hence has positive distance from it. Continuous dependence preserves that separation. Local transversality gives the unique hit in the remaining time neighborhood. A merely unique first **crossing** does not by itself exclude an earlier noncrossing tangent contact or, for a relatively open section, an earlier endpoint contact with its closure.

Likewise, say explicitly that the compact travelled arcs, including launch and terminal points, lie in the open tube. Compact containment then gives positive tube-boundary clearance, so a separate rational clearance parameter is unnecessary. If a closed tube is used instead, strict positive clearance must be imposed. The current numerical bounds alone do not establish this. The endpoint counterexample already uses an open tube with positive clearance, so this observation is a clarification of the general predicate, not an additional mechanism needed for that example.

These strengthened geometric conditions are open using the local branch and flow-dependence results that remain the A2 dependency. Their role is to specify the domain on which those results apply. This report does not issue a new A2 regularity verdict.

The amendment is compatible with connection coverage. At a genuine nondegenerate connection, take a compact regular orbit arc, a sufficiently small transverse flow-box section through an interior point of that arc, and a tube around the compact travelled pieces. The arc is injective; along a nonconstant ascending gradient trajectory, the field value strictly increases. Shrinking the section separates it from compact earlier prefixes, and its hit can be chosen in the relative interior. Choose the endpoint local sections with the same interior and separation properties. All these clearances and the numerical margins can then be preserved by small rational approximations of the finite geometric data. The already repaired endpoint boxes admit a strictly smaller rational eta. Thus the suitably restricted rational charts still cover genuine connections.

Finite rational tuples remain countable. There is no need to select a first admissible chart, or to choose charts measurably as a function of the field. A1 can be closed by this bounded clarification and its openness argument; no new transversality theorem is suggested by this review.

## 6. A6: valid conditional slicing and its exact measurable conclusion

The exact successor says that `I_g,chi` is open because `U_chi` is open. The geometric issue above prevents that implication from being justified for the written predicate. That is why the source application remains AMEND. The following conditional lemma is valid and isolates what remains to be supplied.

Assume that `U_chi` is genuinely open in X, that `D_chi` is C1 on it as supplied by A2, that its derivative is nonzero on H at the relevant connections as supplied by A3–A4, and that A5 supplies the stated countable directions and independent Gaussian decompositions. No new acceptance of these dependencies is made here. For a fixed pair `(chi,j)`, set

$$E_{\chi,j}=\{f\in U_\chi:D_\chi(f)=0,\ dD_\chi(f)[h_j]\ne0\}.$$

Both displayed functions are continuous on the open chart. Consequently E is Borel in X. Write the A5 joint law of `(g_j,xi_j)` as `nu_j x gamma`, where gamma is standard Gaussian measure. The map

$$T_j:X\times\mathbb R\longrightarrow X,\qquad T_j(g,\xi)=g+\xi h_j$$

is continuous, so `T_j^{-1}(E_chi,j)` is a Borel event in the product space. This explicitly supplies the measurability needed to integrate the scalar sections. There is no requirement to enumerate interval components or zeros measurably in g.

For each fixed residual g,

$$I_{g,\chi}=\{\xi:g+\xi h_j\in U_\chi\}$$

is open in the real line and hence is a countable union of disjoint open intervals. On this open set the chain rule gives

$$F_g(\xi)=D_\chi(g+\xi h_j),\qquad
F_g'(\xi)=dD_\chi(g+\xi h_j)[h_j].$$

Every zero counted by E has nonzero derivative and is isolated among the zeros. There are at most countably many such regular zeros: assign each an isolating interval from the countable rational basis, so distinct regular zeros receive distinct isolating basis intervals. Accumulation at a nonregular zero or at an excluded chart boundary does not alter countability. Since gamma has a density, each such scalar section has gamma measure zero. Tonelli then gives

$$\mu(E_{\chi,j})=
\int_X\int_{\mathbb R}{\bf1}_{E_{\chi,j}}(g+\xi h_j)
\,d\gamma(\xi)\,d\nu_j(g)=0.$$

The countable union over chi and j is a Borel null set containing the generic connection event, conditional on the stated coverage and directional nonvanishing inputs. If the connection event itself has not separately been shown Borel, the precise immediate conclusion is outer measure zero and therefore measurability and measure zero in the completed Gaussian probability space. Together with the assumed full-measure generic set, this gives the almost-sure conclusion. No analytic-set projection and no measurable first-chart selection are needed.

The lemma does not require all points of a Gaussian shift line to be Morse. A global degeneracy elsewhere on the torus can be harmless to a selected local chart. Successor Section 8's statement about degenerate or boundary parameters lying outside the interval must concern parameters that actually invalidate that chart. An endpoint hit cannot simply be declared outside the interval after the fact if the membership predicate admits it.

As in the previous report, the conditional A5 premise used here is a countable family with covariance images dense in H, not an assumption that the Banach dual `X*` is norm separable. This delimits the premise of the slicing calculation without issuing a new A5 verdict.

## 7. Validation and limits

I ran the unmodified source control with

```text
python -B -S research/q0/sard_g/chart_predicate_negative_control.py
```

It exited 0 and printed `negative control passed`. The added threshold checks reject binary minimum values 0.5 and 1.0 and accept 1.5 at eta 1.0. Those checks confirm the implemented strict comparison. The other control cases use sampled gradient minima and exercise the hidden-critical-point and isolated-saddle predicates. They do not certify arbitrary gradient minima or test branch hits, finite-section endpoints, tube clearance, first-hit persistence, or Gaussian measurability. Their passing result does not resolve the geometric counterexample.

The analytic example above needs no numerical simulation. Its critical points, Hessians, branch geometry, and margin persistence are derived explicitly. The Borel and slicing calculation is likewise displayed rather than inferred from an engineering check. The finite-jet input, invariant-manifold regularity theorem, endpoint-distribution calculation, RKHS injection, Gaussian decomposition, C103 regional estimates, Theorem B, RN/JETMOD, and all 3D claims were not re-proved or newly accepted.

The source worktree remained clean at the exact head and tree listed above. This reviewer made no remote comment and no source edit for this task. The report is prepared separately for the coordinating agent to review and publish. Its technical findings confer no organizational-independence credit and no scientific promotion.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/main/71400b94f6cb354a8cf7aba73ffede2138a64efa/incoming/side24-identity-replay-20260926/IDENTITY.json": "ewogICJzY2hlbWEiOiAxLAogICJzY2llbnRpZmljX2VmZmVjdCI6ICJOT05FIiwKICAicmV2aWV3X3N0YXR1cyI6ICJSRVZJRVdfUkVRVUlSRUQiLAogICJzb3VyY2VzIjogWwogICAgewogICAgICAicmVwb3NpdG9yeSI6ICJkNmc4azVodG55LWNvZGVyL01hdGgtIiwKICAgICAgInBhdGgiOiAiY29lZmZpY2llbnRzL3NpZGUyNF92MS9FTkNMT1NVUkUuanNvbiIsCiAgICAgICJjb21taXQiOiAiOWQ3YjY4MDI0MjRmYjQ3MTViMzE5OTkwNjZhYWZjYThlZTJmM2NjYSIsCiAgICAgICJzaGEyNTYiOiAiNzJiNmNkOTJkMzEzOTRjZGFmNWRhODkxOWE1ZDU0OGU5MDIyMjhhZjFmMDk1Y2MxODQxNThhNzFkODI4NzgxMSIKICAgIH0KICBdLAogICJhcnRpZmFjdHMiOiBbCiAgICB7CiAgICAgICJwYXRoIjogIlJFU1VMVC5tZCIsCiAgICAgICJieXRlcyI6IDExMTgsCiAgICAgICJzaGEyNTYiOiAiZmE0MGE2YjhhZmM0MTM2NDYwODExNDVkNmQ1ZDdiMDFjYzRiNWI0ZGRlYzMyZjRjNmU4MmNhYTM5OWUzOGNkOCIKICAgIH0sCiAgICB7CiAgICAgICJwYXRoIjogIm91dHB1dC5qc29uIiwKICAgICAgImJ5dGVzIjogMzYyLAogICAgICAic2hhMjU2IjogIjgxM2JjZjVkODFlMWQ1ZDUyZDM3YzExMmRmMjM3MTY3MDE4MDlmMDNlN2I1NTkzOWEyYWZiMmU4ZTU3NzQxYmUiCiAgICB9CiAgXQp9Cg==", "https://raw.githubusercontent.com/d6g8k5htny-coder/main/71400b94f6cb354a8cf7aba73ffede2138a64efa/incoming/side24-identity-replay-20260926/output.json": "ewogICJraW5kIjogInNvdXJjZS1pZGVudGl0eS1yZXBsYXkiLAogICJzY2llbnRpZmljX2VmZmVjdCI6ICJOT05FIiwKICAicmV2aWV3X3N0YXR1cyI6ICJSRVZJRVdfUkVRVUlSRUQiLAogICJzY2llbnRpZmljX2FjY2VwdGFuY2UiOiBmYWxzZSwKICAiZGltZW5zaW9ucyI6IHsKICAgICIyIjogewogICAgICAibG93ZXIiOiAiMC4wNzM0MDY5MTkzMDYwMzQyNzEwMyIsCiAgICAgICJ1cHBlciI6ICIwLjA3MzQwNjkxOTMwNjAzNDI3MTA0IgogICAgfSwKICAgICIzIjogewogICAgICAibG93ZXIiOiAiMC4wNDE3NzU5MzE4NDA1OTgzNDMzNCIsCiAgICAgICJ1cHBlciI6ICIwLjA0MTc3NTkzMTg0MDU5ODM0MzM1IgogICAgfQogIH0KfQo=", "https://raw.githubusercontent.com/d6g8k5htny-coder/main/71400b94f6cb354a8cf7aba73ffede2138a64efa/docs/notebooks/SIDE24_PUBLIC_COEFFICIENTS.ipynb": "{
 "cells": [
  {
   "cell_type": "markdown",
   "id": "scope",
   "metadata": {},
   "source": [
    "# SIDE24 public coefficient viewer\n",
    "\n",
    "**NON-CERTIFYING visualization of already published numbers.** This notebook displays the published coefficient intervals for dimensions 2 and 3. It does not prove a theorem, perform a new enclosure, simulate a random field, or evaluate a lifetime law.\n",
    "\n",
    "The exact input is [`coefficients/side24_v1/ENCLOSURE.json`](https://github.com/d6g8k5htny-coder/Math-/blob/9d7b6802424fb4715b31999066aafca8ee2f3cca/coefficients/side24_v1/ENCLOSURE.json) from public `Math-` commit `9d7b6802424fb4715b31999066aafca8ee2f3cca`: **1090 bytes**, SHA256 `72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811`.\n",
    "\n",
    "Read the [pinned coefficient proof and scope](https://github.com/d6g8k5htny-coder/Math-/blob/9d7b6802424fb4715b31999066aafca8ee2f3cca/coefficients/side24_v1/PROOF.md). The retained source says `scientific_acceptance: false` and describes its parent theorem as unreviewed; this notebook preserves those original fields. Later [scoped coefficient review](https://github.com/d6g8k5htny-coder/main/issues/65#issuecomment-5841269490) and [current program status](https://github.com/d6g8k5htny-coder/main/blob/main/STATUS.md) are separate records. Their links do not promote the parent theorem or change this source.\n",
    "\n",
    "Run the cells in order. Fetching and identity checks use only Python's standard library. Matplotlib, if already installed (as in Colab), draws the optional chart; no package installation is required for the exact table.\n",
    "\n",
    "The committed preview was executed locally from the exact verified bytes in the public Git checkout, supplied at the fetch boundary. Re-running the fetch cell retrieves and verifies the pinned public URL directly.\n"
   ]
  },
  {
   "cell_type": "code",
   "id": "fetch-verified-bytes",
   "metadata": {},
   "execution_count": 1,
   "outputs": [
    {
     "output_type": "stream",
     "name": "stdout",
     "text": [
      "Verified: 9d7b6802424fb4715b31999066aafca8ee2f3cca coefficients/side24_v1/ENCLOSURE.json\n",
      "Bytes: 1090 SHA256: 72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811\n",
      "Original scientific_acceptance: False\n",
      "Original scope: coefficient of issue63 Eq15.2; parent theorem unreviewed\n"
     ]
    }
   ],
   "source": [
    "import hashlib\n",
    "import json\n",
    "import urllib.request\n",
    "from decimal import Decimal, localcontext\n",
    "\n",
    "SOURCE_COMMIT = \"9d7b6802424fb4715b31999066aafca8ee2f3cca\"\n",
    "SOURCE_PATH = \"coefficients/side24_v1/ENCLOSURE.json\"\n",
    "SOURCE_URL = (\n",
    "    \"https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/\"\n",
    "    + SOURCE_COMMIT + \"/\" + SOURCE_PATH\n",
    ")\n",
    "EXPECTED_BYTES = 1090\n",
    "EXPECTED_SHA256 = \"72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811\"\n",
    "\n",
    "\n",
    "def decode_verified_source(raw):\n",
    "    # Check raw bytes before JSON decoding or plotting. Never fall back to a mutable ref.\n",
    "    if len(raw) != EXPECTED_BYTES:\n",
    "        raise ValueError(\"Source byte count mismatch; refusing to display this input\")\n",
    "    if hashlib.sha256(raw).hexdigest() != EXPECTED_SHA256:\n",
    "        raise ValueError(\"Source SHA256 mismatch; refusing to display this input\")\n",
    "    source = json.loads(raw.decode(\"utf-8\"))\n",
    "    if source.get(\"scientific_acceptance\") is not False:\n",
    "        raise ValueError(\"Unexpected source acceptance field\")\n",
    "    return source\n",
    "\n",
    "\n",
    "with urllib.request.urlopen(SOURCE_URL, timeout=30) as response:\n",
    "    raw_source = response.read(EXPECTED_BYTES + 1)\n",
    "source = decode_verified_source(raw_source)\n",
    "print(\"Verified:\", SOURCE_COMMIT, SOURCE_PATH)\n",
    "print(\"Bytes:\", len(raw_source), \"SHA256:\", hashlib.sha256(raw_source).hexdigest())\n",
    "print(\"Original scientific_acceptance:\", source[\"scientific_acceptance\"])\n",
    "print(\"Original scope:\", source[\"scope\"])\n"
   ]
  },
  {
   "cell_type": "code",
   "id": "exact-decimal-table",
   "metadata": {},
   "execution_count": 2,
   "outputs": [
    {
     "output_type": "stream",
     "name": "stdout",
     "text": [
      "Exact published endpoints (open intervals):\n",
      "d=2: 0.07340691930603427103 < c < 0.07340691930603427104\n",
      "d=3: 0.04177593184059834334 < c < 0.04177593184059834335\n",
      "Published relative_periodization_bound: 1e-106\n",
      "NON-CERTIFYING display; original scientific_acceptance remains False\n"
     ]
    }
   ],
   "source": [
    "# Keep the published endpoint strings intact; Decimal arithmetic is used only\n",
    "# to choose a midpoint for display. No float is used to validate an interval.\n",
    "if set(source[\"dimensions\"]) != {\"2\", \"3\"}:\n",
    "    raise ValueError(\"Unexpected dimension set\")\n",
    "rows = []\n",
    "with localcontext() as context:\n",
    "    context.prec = 50\n",
    "    for dimension in (\"2\", \"3\"):\n",
    "        record = source[\"dimensions\"][dimension]\n",
    "        lower_text, upper_text = record[\"lower\"], record[\"upper\"]\n",
    "        if not isinstance(lower_text, str) or not isinstance(upper_text, str):\n",
    "            raise ValueError(\"Published decimal endpoints must remain strings\")\n",
    "        lower, upper = Decimal(lower_text), Decimal(upper_text)\n",
    "        if not lower.is_finite() or not upper.is_finite() or not Decimal(0) < lower < upper:\n",
    "            raise ValueError(\"Invalid published interval\")\n",
    "        rows.append({\n",
    "            \"dimension\": dimension,\n",
    "            \"lower\": lower_text,\n",
    "            \"upper\": upper_text,\n",
    "            \"display_midpoint\": (lower + upper) / Decimal(2),\n",
    "        })\n",
    "\n",
    "print(\"Exact published endpoints (open intervals):\")\n",
    "for row in rows:\n",
    "    print(\"d=\" + row[\"dimension\"] + \": \" + row[\"lower\"] + \" < c < \" + row[\"upper\"])\n",
    "print(\"Published relative_periodization_bound:\", source[\"relative_periodization_bound\"])\n",
    "print(\"NON-CERTIFYING display; original scientific_acceptance remains\", source[\"scientific_acceptance\"])\n"
   ]
  },
  {
   "cell_type": "markdown",
   "id": "chart-boundary",
   "metadata": {},
   "source": [
    "## Optional approximate chart\n",
    "\n",
    "Bar heights are floating-point conversions of the decimal midpoints. The published interval widths are about `1e-20`, far below this chart's resolution, so the bars do **not** show enclosure precision or an error probability. Use the exact endpoint strings above for the original intervals. The chart creates no new coefficient, constant, theorem, or scientific verdict.\n"
   ]
  },
  {
   "cell_type": "code",
   "id": "approximate-chart",
   "metadata": {},
   "execution_count": 3,
   "outputs": [
    {
     "output_type": "display_data",
     "metadata": {},
     "data": {
      "image/png": "iVBORw0KGgoAAAANSUhEUgAAA0gAAAIcCAYAAADMj46OAAAAOnRFWHRTb2Z0d2FyZQBNYXRwbG90bGliIHZlcnNpb24zLjEwLjgsIGh0dHBzOi8vbWF0cGxvdGxpYi5vcmcvwVt1zgAAAAlwSFlzAAASdAAAEnQB3mYfeAAAl39JREFUeJzs3Xd8jff///HnSWQSIkTsGLFjj7Q1QhVFW9SqKlUU1Vq1qRrVfm3VoaU0Vq1qqaraq1RFi2qsWiG1icSKqOT6/SE5P8fJdK4I/Tzut9u5tee9Xu/rODk5r7yv631ZDMMwBAAAAACQU2ZPAAAAAAAeFyRIAAAAAJCABAkAAAAAEpAgAQAAAEACEiQAAAAASECCBAAAAAAJSJAAAAAAIAEJEgAAAAAkIEECAAAAgAQkSAAAAACQgAQJAAAAABKQIAEAAABAAhIkAAAAAEhAggQAAAAACUiQAAAAACABCRIAAAAAJCBBAgAAAIAEJEgAAAAAkIAECQAAAAASkCABQAZbtGiRKleuLC8vL1ksFvXt29dat27dOj3zzDPy9vaWxWJR8+bNJUl169aVxWJ56JhbtmyRxWLRqFGjHJs8gMeKxWJR3bp1bcpGjRoli8WiLVu2PLJ5FClSREWKFHlk8YBHiQQJeEzFxcXpq6++UnBwsHx8fOTi4qI8efKoQoUK6tq1q1auXGnTPvEL8YO/OBPL7394enoqX758qlOnjgYOHKi9e/cmO48iRYrY9X/wMWfOHGv7o0ePavz48Xr22WdVqFAhubq6ys/PT82aNdPmzZvTdOyxsbEKDAyUxWJRwYIF0/yaPY527typ9u3b6/r163rrrbc0cuRIPf/885Kk8PBwNWvWTCdPnlTnzp01cuRIvfLKK5k8Y8d16tRJFotF4eHhjzx2eHi49X0ZFBSUbLvU3lsbNmxQ27ZtVbhwYbm7u8vb21vVq1fX6NGjdfXq1ST7zJkzxxp70KBBSbZJ/Hl87bXX0ndgCUJDQ9WlSxeVKlVKXl5ecnNzk7+/v1q1aqWlS5cqLi7O2vb+1yKlx/3/TolftO9/uLu7KyAgQN26dbO2TevY9z8Sv7wnJv8PfplPLE/u0alTJ127dk1FixaVi4uLQkNDk32dpk6dKovFopYtW1rLEsd5UGK5v7+/bt++neR4iZ+Dd+/eTbL+77//1rvvvqsqVapYP699fHwUFBSkAQMG6I8//kh2rgAeP1kyewIA7MXFxemFF17QmjVr5O3traZNm6pgwYK6c+eODhw4oIULF+rw4cN66aWX0jymv7+/OnXqJEm6c+eOLl26pD179mjSpEmaNGmSXn31Vc2YMUPZsmVLsn+fPn3k7e2dZF2lSpWs/z9ixAgtWbJEZcuWVZMmTeTj46MjR45o5cqVWrlypaZNm6bevXunONdhw4bp1KlTaT62x9lPP/0kwzA0b948PfPMMzZ1GzZs0O3btzV58mS9+uqrNnXz5s3TrVu3HjpujRo1dOjQIeXOnfuhx3jShYaGavHixelKOmNjY9W1a1ctWLBAHh4eaty4sUqWLKkbN25o06ZNGjVqlD777DN99913qlOnTrLjfPLJJ3r77bfl7+9vxqHo33//Ve/evfXll1/K2dlZwcHBatq0qdzc3PTPP/9o06ZN+u6779SyZUstW7bMpm+OHDlsVi0flNTPdXBwsPWPLVeuXNGmTZv01VdfadmyZdq1a5d8fX01cuRIu36jR4+WpCTr0rra8PrrryfZtlKlSsqePbvmz5+v4OBgvfbaa9q7d6+yZs1q0y4sLExDhw5Vvnz5NHPmzDTFlKTTp0/r448/1pAhQ9LcxzAMjRkzRmPGjFF8fLyqVKmitm3bysfHR9evX9f+/fv16aefavLkyfrss8/09ttvp3ns9HjnnXf0yiuvqHDhwhkyPvA/xwDw2Jk/f74hyahYsaIRFRVlV3/z5k1j06ZNNmWbN282JBnBwcFpKk+0d+9eo3z58oYk4/nnn7er9/f3NyQZJ0+eTNPcQ0JCjD179tiVb9myxXBxcTFcXV2Ns2fPJtt/8+bNhsViMb744gtDklGgQIE0xX1cvfHGG8m+fqNHjzYkGZs3b37k88pIr7/+erreM2Y6efKkIckoXLiw4eLiYhQtWtSIjY21a5fceyvx36tKlSrG6dOnberi4+ONTz/91HBycjKyZctmHDx40KY+JCTEkGQEBAQYkoxXX33VbvzEn8f27dun67jefPNNQ5JRvnx54/Dhw3b1d+/eNebNm2e0atXKWpb4Wvj7+6c5zsiRIw1JxsiRI23K4+LijCZNmhiSjE6dOiXbX5KR2leL4ODgJN/3yZUnZejQoYYk480337Qpj42NNSpWrGhYLBZj7dq1aZqbJCNnzpyGj4+PkSNHDuPSpUt2bRI/B//991+b8lGjRhmSjEKFChnbt29Pcq4XLlwwhg4danz44YepHldapPR5/ij5+/un670FPElIkIDH0FtvvWVIMqZOnZrmPg+bIBnGvV/gvr6+hiRj+fLlNnXpTZBS0qBBA0OSsWzZsiTro6OjDX9/f+O5554zDCP5L7GpuXnzpjFu3DijatWqRrZs2YysWbMapUuXNnr16mWcP3/epu3Zs2eNnj17Gv7+/oaLi4uRO3duo0WLFsbvv/+e7PgLFy406tata+TIkcNwc3MzSpcubXzwwQfG7du3rW0Svywn9UipLvHLYeKXxaSsXbvWeOGFFwxfX1/D1dXVKFiwoPHSSy8Z69evt7ZJ/Hd/8IuuYRjGlStXjCFDhhilS5c23N3djezZsxvPPvus3RfK+48jJCTE2LRpkxEcHGxky5bN8PLyMpo0aWKXJCR3XPd/kTp+/Ljx5ptvGsWLFzfc3d2NnDlzGoGBgUb37t2Ny5cvJ/u6p0ViUlCzZk2jT58+hiRj0qRJdu2Sem/98ssv1i/LKSXxgwcPNiRZ36eJEl+rYcOGGZUrVzYsFouxe/dumzYPkyBt377dkGT4+PikOC/DMGzeg2YmSIZhGEuXLjUkGeXKlUu2/6NKkO7cuWNUrVrVkGT88MMP1vKBAwcakozevXuneW6J74WpU6cakox33nnHrk1SCdLx48eNLFmyGK6urkZYWFiqc34wuUpJbGysMWbMGKNYsWKGq6urUaRIEWP48OHG7du3k/w8T/x3e/C127Ztm/HCCy8YBQoUMFxdXQ0/Pz8jKCjIGDVqlE27xD9qHD9+3Jg8ebJRqlQpw83NzShQoIDRt29fIzo6OsnX5MH3VlRUlDFhwgSjXr16RoECBayfqS+++KLx66+/2rSNjIw0PDw8jGLFihnx8fFJvg4vvPCCIcnu5wjIaFyDBDyGcuXKJeneee2PQp48edS9e3dJ0jfffJNhcVxcXCRJWbIkfXZv7969dfXqVc2ePfuhY1y9elXPPPOMhgwZohs3bqhz58566623VKZMGYWEhOjQoUPWtidPnlS1atU0ffp0FS9eXP3791ejRo30008/6ZlnntGqVavsxu/cubNeffVVHTt2TC1bttTbb78tHx8fjRgxQs8//7z1GoVKlSpp5MiRqlixoqR7pyiOHDlSI0eOtNYFBwdLundKUWJdaqchjRw5Uo0aNdKWLVvUqFEj9e/fX/Xr19ehQ4e0YMGCVF+fU6dOqWrVqho3bpx8fX3Vo0cPtW3bVocOHdLzzz+vr776Ksl+q1atUsOGDZU9e3b16NFDtWvX1urVqxUcHKzLly/bzC+pY048xevcuXOqXr26QkJCVK5cOfXu3VsdOnRQ0aJFNX/+fJ07d84mbuK1Hw9zPdP7778vb29vffjhh4qMjEy1feKxv/nmm8qXL1+y7QYPHiw3Nzdt2LBBJ0+etKu3WCyaNGmSDMPQgAED0j3vByWeJtatW7cU5yVJbm5uDsdLTeLPcWZycXGxngbZtWtXXbhwQdu2bdPkyZNVrlw5jR8/Pt1jvv322ypevLhmzJiho0ePpto+JCREd+/eVatWrVSuXLlU2yf3ufcgwzDUpk0bvf/++7JYLHrnnXf0wgsv6Ouvv1abNm3SNIYkrVmzRnXr1tX27dtVv3599e/fX82bN5ebm5umT5+eZJ9+/frpgw8+UHBwsPr06aPcuXPr448/1rPPPpvs9Vn3O3TokIYPHy4nJyc1bdpU7777rho0aKBNmzapTp06WrNmjbVtzpw59corr+jEiRPasGGD3VgRERH6+eefVbVqVVWrVi3Nxw2YIrMzNAD29uzZY7i4uBgWi8V47bXXjO+++84IDw9PsY8jK0iGYRgbNmywnpp0v8S/nPbp08cYOXJkko+YmJhUjyk8PNxwc3MzPD09jcjISLv677//3pBkzJo1y1qmh1hBateunSHJ6NGjhxEXF2dTd/36dZtTFhs2bGhIMsaOHWvTbseOHYazs7Ph4+NjXL9+3VqeuELQokUL49atWzZ9Ev+C+/HHH9uUp3S6WXJ/9TWMpFeQ1q5da0gyihYtavzzzz92fSIiIqz/n9wKUnBwsGGxWIxFixbZlF+9etWoWLGi4e7ubrPKlnjMzs7OxoYNG2z6DBkyxJBkjB8/Ps3H/MknnyT5OhmGYdy4ccPudU3vCub9K0iGYRgTJ040JBn9+vWzaZfUe6tYsWKGJGPdunWpxnnmmWcMScb8+fOtZYmv1fDhww3DMIymTZvarXA8zApS4rzuXyFMi8TXIkeOHMn+7H7xxRc2fZJbQbp7967RqFGjZFdYEsmEFaTXX389ybkm5fPPPzckGQ0aNDD8/f0NV1dXY9++fema2/3vhW+//db6M36/pFaQ6tWrZ/eZZYZvvvnGkGQ89dRTNp+tV65csb4X0rKC9PLLLxuSknw9HjyNMPFnNleuXDa/a+Li4qzjjBkzxqZPcitISZ2iGBERYeTLl88oXbq0Tfnu3bsNSUbLli3t+iQe08yZM+3qgIxGggQ8ppYsWWLkzZvX5jQlHx8fo3nz5sbKlSvt2juaIB06dMiQZHh4eNiUJ34xSOlx9erVFMe+ffu2UbNmTUOSMWHCBLv68+fPG7lz5zYaN25sU57eBOnChQuGk5OTkS9fPuPGjRspto2IiLAmhHfu3LGrf+211wxJxty5c61llSpVMrJkyZLk8d69e9fIlSuXUb16dZtyMxOkxNNNvv/++xSPzTCSTpD27dtnSLK5TuV+K1asMCQZn3/+ubUs8Ut/Ul/oT5w4keSXm7QkSDNmzEj1GAzDMI4dO2YcOnQoyX+jpDyYIN2+fdsoUqSI4erqahw/ftzaLqn3loeHhyHJOHToUKpx2rZta5ccPpggHThwwHB2djZKly5t/WL9MAlSeuZ1v8TXIqVHxYoVbfokvieDg4OtiUmvXr2M0qVLG5KMsmXLGhcuXEg2phkJUnKP5CReG5Xc50tqc3vwvfD0008bkoxffvnFWpZUglSmTBlDkvHzzz/bjXny5Em7BC+tp0w/99xzhiS760wN4/+/x9KTIB05ciTVmIk/sw8mQYZx71RCJycno0iRIjbl6b0GqVevXoYk49SpUzbl1apVM7JkyWKcO3fOWnb37l2jYMGChpeXl80fqYBHhV3sgMdUmzZt1KJFC23evFnbt2/X3r17tX37dq1YsUIrVqxQx44drdsKm8EwDElKdryTJ08+1D0v4uLi1KFDB+3YsUNt27ZN8pSjN998U3fv3tWsWbPSPf79du/erfj4eNWpU8duZ6sHJW5tXrt27SRPGXr22We1YMEC7d27Vx07dtStW7f0559/Wk85SYqbm5vNKXxm++2332SxWKzbhKfXzp07JUnR0dFJ3h/p0qVLkpTkMSR1ikuhQoUkKdltr5Py0ksvadiwYXr77be1du1aNWrUSDVr1lTZsmWTfO8VL148zWMnxc3NTR999JFeffVVDRkyREuXLnVovPQoW7asunTpopkzZ2rmzJnq2bNnku327dunFStW2JR5e3unuPNcevj7+6f7FMWtW7dq69atNmWVKlXSli1blCNHDlPmlZzNmzfb3a4gJZMmTdLq1auVN29e9e/f3+H4kydP1jPPPKMBAwbot99+e6gxwsPDrTv6JfL390/Tv+mePXvk5OSkWrVq2dWl53Vp3769vv/+ewUFBalt27aqV6+eatasmeL29omn/d6vWLFiKlSokMLDwxUVFZXsbqaJduzYoWnTpmnnzp26ePGi7ty5Y1N/5swZm932evbsqc6dO+vrr7/WsGHDJEmrV6/WP//8o7feeivZnVWBjESCBDzGXFxc1LBhQzVs2FDSvWTju+++U+fOnTVv3jy1aNHCemNRR509e1aS5Ovra8p40r35vvbaa/r222/Vpk0bLViwwO5L8Lx58/Tjjz9q7ty5yp8/v0PxoqKiJEkFChRItW10dLQkJXtNR2J54phXr16VYRi6dOmS3RefRyUqKko5c+aUh4fHQ/W/cuWKJGn9+vVav359su1u3LhhV5bUl6LEayruv/dOavz9/RUaGqpRo0ZpzZo1+v777yXdS7YGDBiQ6hbwD+OVV17R1KlT9e233+q3337TU089lWS7vHnz6uTJk4qIiFDp0qVTHDMiIkKSUn3PjhkzRgsXLtTo0aPVoUOHJNvs27cvxS/T+fLl04kTJ3TmzJlU52WWkSNHatSoUYqPj9eZM2c0adIkffLJJ2rTpo1+/vlnOTk9PpcwJ/48uLm5mTKvp59+Wq1atdKyZcu0ZMkStW3bNsl2efPm1aFDh6yfnferW7eu9Y9Od+/eTdd1W9HR0dZ7KSUVM61efvllrVq1SpMnT9bXX3+tGTNmSJKqVq2q//u//1ODBg3s+vj5+SU5Vt68eXXq1ClFR0enmCAtX75crVq1kru7uxo0aKDixYsra9ascnJy0pYtW7R161bFxsba9HnllVfUv39/ffXVVxoyZIicnJys190lXhsLPGqPzyccgFQ5OzurTZs26tevnyRp06ZNpo2deBPXlG6umR7//vuv2rVrp8WLF+vVV1/VwoULk7xIec+ePZLubVTw4I0hpXt/bUx8npisJCfxF/eZM2dSnV/iX8HPnz+fZH3iZgGJ7RL/W7lyZRn3Tk9O9pFRvL29dfXqVcXExDxU/8RjmDZtWorzDwkJMXPadsqUKaMlS5boypUr+v333zVu3DjFx8erT58+Dm3QkZzETRMkpbhpQuJf7JO6YPx+V69etd74s2bNmim29fPz08CBA3Xx4kWNGzcuyTadOnWy+ze4f8UncV4bN25MMVZGcHJyUqFChTRt2jS1atVK69at02efffbI5/Go/d///Z9cXFw0dOhQuxWQRIn/9mb/u+TIkUORkZH6999/7eqS+7xKTtOmTbVp0yZdvXpVGzduVL9+/XTgwAG98MILOnjwoF37CxcuJDlOYtzUVg9HjBghV1dX/f7771qxYoUmT56sMWPGaNSoUSpVqlSSfTw8PNSpUyeFh4dr3bp11s0ZgoKCrBu+AI8aCRLwBPLy8pIk076MX7x40frXxfbt2zs83p07d9S6dWt9++236tixo+bPny9nZ+ck2z799NPq0qVLkg9J8vT0tD5PbYeuGjVqyMnJSdu2bdPNmzdTbFu5cmVJ0vbt2607z90vMWGsUqWKJClbtmwqV66cDhw4kKYd0TLCU089JcMwbHaCSm9/Sfrll1/MnJadxH/r1FaWsmTJoqpVq2rw4MFatGiRJNmdamaWOnXqqFmzZtqxY4e+++67JNt07dpVkjRr1qxkvyhK907pio2N1XPPPaeiRYumGnvAgAHKnz+/pk6dqn/++Sfdc+/WrZuke7vZpTQvSXZ/nTfT5MmT5ebmpjFjxujatWsZFudxEBAQoJ49e+rkyZP69NNPk2zTqVMnZcmSRcuWLTP11NoqVaooPj5e27dvt6vbsmXLQ42ZNWtWPfvss5oyZYqGDRumO3fu6Oeff7Zr9+BplZJ04sQJRUREqEiRIqmeXnfs2DGVLVtWZcqUsSlP7ngSvfXWW7JYLJoxY4Zmz56tuLg4Vo+QqUiQgMfQokWLtH79esXHx9vVnT9/3rodcZ06dRyO9eeff6pBgwa6fPmymjRpopdeesmh8WJjY9WiRQv98MMP6tKli0JCQlI87aVt27aaNWtWkg/p3lawic9TO7XM19dXr7zyis6dO6cBAwbYvX43btywnlpXsGBBNWjQQOHh4XbXFO3atUsLFy5Uzpw51aJFC2v5u+++qzt37qhz585JrmZdvXrVuiKWEXr16iVJ6t+/f5KrZKmtnFWrVk21a9fW999/r6+//jrJNn/99ZcuXrzo0DwTt6k/ffq0Xd0ff/xh/Te4X+IXf09PT5vy48eP6/Dhw0n+NT29xo8fryxZsmjIkCFJ1tepU0cdOnRQZGSkXnjhhSSTmS+//FLjx49XtmzZNG3atDTF9fT01AcffKCYmJiHOj2zZs2aevPNN3XlyhU9//zzSW5BHR8fr0WLFiV7Gp8ZChcubJ3H5MmTMyzO4+L+beKTOu20ePHieu+993Tnzh01btxYv/76a5LjpLby/aA33nhDkjR8+HCbrbUjIyM1duzYNI+zbdu2JP/4k9zPmnRvdfnUqVPW5/Hx8Ro4cKDi4+Ot80pJkSJFdPToUZvTDg3D0KhRo5JcsUpUokQJ1a9fX6tWrdKXX34pb29vvfLKK6nGAzIK1yABj6Fdu3Zp2rRpyps3r2rVqmX9K/XJkyf1008/KSYmRs2aNVOrVq3SPGZ4eLj1wvx///1Xly9f1h9//GE9Vei1117Tl19+mWz/jz/+ONm/HtatW9d68XCPHj20evVq5c6dWwUKFNCYMWNSbG+2zz77TGFhYfryyy+t9wpydXXVyZMntXbtWq1cudIa+8svv1TNmjU1cOBArVu3TtWqVVNERIS+/fZbOTk5KSQkxLpaJ927B9Iff/xhvW9So0aNVLhwYUVGRurkyZPatm2b3njjjRRfR0c0bNhQ7733nsaOHasyZcqoefPmKlSokC5cuKDt27frqaee0pw5c1IcY+HChXr22WfVpUsXffLJJwoKCpK3t7f++ecf7d+/X2FhYdq5c6fy5Mnz0POsX7++Jk6cqDfffFMtW7aUl5eXvL299c4772j+/PmaMWOGatWqpeLFiytnzpw6fvy4fvzxR7m5udldxF6/fn2dOnXqoTcJuV+pUqXUrVu3ZO8BI91bpbl7964WLVqkUqVKqXHjxipRooRu3rypzZs3KywsTLly5dJ3332nsmXLpjl2p06d9PHHH+uvv/56qLl//vnncnZ21pdffqkyZcqobt26qlixotzc3HTmzBlt2rRJ//zzT5KfCVFRUUluynH/3NL62g4bNkyzZ8/W1KlT1atXL+XOnfuhjudJ4OPjo2HDhmnQoEHJtnn//fdlGIY++OAD1axZU1WrVlWNGjXk4+OjqKgohYeHW0/ZTOsftNq1a6clS5Zo5cqVCgwMVLNmzfTvv/9q2bJlql69uo4fP56mcXr37q0zZ86oZs2aKlKkiFxdXfXHH39o06ZN8vf3TzIBqVmzpipVqqS2bdsqR44cWrt2rf78809VrVo1xdchUb9+/dSjRw9VrlxZLVu2lIuLi3bs2KGDBw/qxRdf1I8//phs3549e2rDhg26cOGCevXq9dDXWgKmeFTb5QFIu9OnTxufffaZ0bx5c6NkyZKGl5eX4eLiYuTNm9do3LixMX/+fLt7/KS2zff9D3d3dyNv3rxG7dq1jQEDBhh79+5Ndi5p2eb7/q2kU9uq98H2KVE6t/lOdOPGDWPs2LFG+fLlDQ8PDyNbtmxGmTJljD59+thtUfzPP/8YPXr0MAoXLmy4uLgYuXLlMpo1a2aEhoYmO/6PP/5oNG3a1PD19TVcXFwMPz8/o3r16sbw4cPttmI2c5vvRD/99JPRqFEjI2fOnIarq6tRsGBBo3nz5sbGjRutbZK7D5JhGMa1a9eMDz/80KhSpYqRNWtWw93d3ShSpIjRpEkTY8aMGTZbpCduKxwSEpLkXJJ6zxmGYUyePNkoXbq04erqakiybgf822+/GT169DAqVKhg5MyZ03B3dzeKFy9udOrUyfjrr7/sxnH0PkgPunjxopE9e/ZU31tr1641WrVqZRQoUMBwdXU1smfPblSpUsUYOXKkceXKlST7PLjN94PWrFlj/RlIzzbf9/vtt9+Mzp07GyVKlDCyZs1q8++/ZMkSm8+FtGzz/eD7L7n7IN3v3XffNSQZ7777rl1d4pgpSW2b76R+HlKSeJypbTmd3NxSei8kbhOf2Pf+bb7vd/jwYaNv375GxYoVjRw5chhZsmQxcubMaVSrVs3o27ev8ccff6TrmGJjY43Ro0cbRYsWNVxdXQ1/f39j2LBhxu3bt9O8zfeSJUuMV155xQgICDCyZs1qeHl5GeXKlTOGDRtmXLx40aZ/4ufU8ePHjUmTJhmlSpUy3NzcjPz58xt9+vQxoqOj7eaY3DbfISEhRsWKFQ1PT08jV65cRvPmzY39+/en+HlnGPe29s6dO7chyQgLC0vX6wWYzWIYGXhFMQAAAB5rnTp10ty5c01ZqX1YJ06cUEBAgGrWrJnh10kCqeEaJAAAAGSqSZMmyTAMvfPOO5k9FYBrkAAAAPDonT59WgsXLtTRo0cVEhKiihUrqnXr1pk9LYAECQAAAI/eiRMnNHToUHl6eqpBgwb64osvHqubEON/F9cgAQAAAEAC0nQAAAAASECCBAAAAAAJSJAAAAAAIAEJEgAAAAAkIEF6BG7fvq0DBw7o9u3bmT0VAAAAACkgQXoEjh8/rsDAQB0/fjyzpwIAAAAgBSRIAAAAAJCABAkAAAAAEpAgAQAAAEACEiQAAAAASECCBAAAAAAJSJAAAAAAIAEJEgAAAAAkIEECAAAAgAQkSAAAAACQgAQJAAAAABKQIAEAAABAAhIkAAAAAEhAggQAAAAACUiQAAAAACABCRIAAAAAJCBBAgAAAIAEJEgAAAAAkIAECQAAAAASkCABAAAAQAISJAAAAABIQIIEAAAAAAlIkAAAAAAgQRazB/zzzz+1Y8cOHTx4UJcvX5bFYlHu3LlVpkwZPfPMM6pUqZLZIQEAAADAFKYkSBcvXtT06dM1b948nTp1SoZhyNXVVTlz5pRhGIqKitKdO3dksVhUuHBhvf7663rrrbfk5+dnRngAAAAAMIXDp9gNHjxYxYoV08yZM/XCCy9oxYoV+ueff3T79m2dO3dO58+f1+3bt/XPP/9oxYoVeuGFF/TVV1+pePHiGjp0qBnHAAAAAACmcHgFadu2bVqwYIGaNWsmi8WSbLv8+fMrf/78evHFF/XJJ5/ohx9+0IQJExwNDwAAAACmsRiGYWT2JP7rDhw4oMDAQIWFhalcuXKZPR0AAAAAyTB9F7tt27bp0qVLydZfunRJ27ZtMzssAAAAADjM9ASpXr16Wr9+fbL1mzZtUr169cwOCwAAAAAOMz1BSu2MvdjYWDk7O5sdFgAAAAAcZso236dPn1Z4eLj1+eHDh5M8jS4qKkozZsyQv7+/GWEBAAAAwFSmJEghISEaPXq0LBaLLBaLPvzwQ3344Yd27QzDkLOzs2bMmGFGWAAAAAAwlSkJUps2bRQYGCjDMNSmTRv17t1btWvXtmljsViUNWtWVapUiRvEAgAAAHgsmZIglSlTRmXKlJF0bzWpTp06Klq0qBlDAwAAAMAjY0qCdL/XX3/d7CEBAAAA4JEwPUGSpEOHDikkJEQnTpzQ1atX7Xa2s1gs2rhxY0aEBgAAAICHZnqCNH/+fL3xxhtycXFRqVKllDNnTrs2qW0FDgAAAACZwfQEadSoUapcubJ+/vln5c6d2+zhAQAAACDDmH6j2LNnz6pz584kRwAAAACeOKYnSBUqVNDZs2fNHhYAAAAAMpzpCdKUKVM0e/Zs/frrr2YPDQAAAAAZyvRrkMaPH68cOXKodu3aKlu2rAoXLixnZ2ebNhaLRT/88IPZoQEAAADAIaYnSPv375fFYlHhwoV148YNHTx40K6NxWIxOywAAAAAOMz0BCk8PNzsIQEAAADgkTD9GiQAAAAAeFI5vIJ0+vRpSVLhwoVtnqcmsT0AAAAAPC4cXkEqUqSIihYtqjt37tg8T+3xsGJjYzV48GDlz59fHh4eCgoK0vr169PU98yZM2rTpo28vb2VPXt2NWvWTCdOnLBrFx0drUGDBqlEiRLy8PCQv7+/unTpkubkDwAAAMCTyeEVpK+//loWi0UuLi42zzNKp06dtGzZMvXt21clSpTQnDlz1KRJE23evFm1atVKtt+NGzdUr149RUdHa9iwYXJxcdHUqVMVHBysffv2KVeuXJKk+Ph4NWjQQAcPHlTPnj1VsmRJHTt2TNOnT9fatWt16NAheXl5ZdjxAQAAAMg8FsMwjMyeRFqFhoYqKChIEydO1IABAyRJt2/fVmBgoPLkyZPivZcmTJigwYMHKzQ0VNWrV5ckHT58WIGBgRo0aJA++ugjSdKvv/6qmjVr6rPPPtPbb79t7R8SEqLOnTvr+++/V4sWLdI17wMHDigwMFBhYWEqV65ceg8bAAAAwCOS4Zs0xMTEKCYmxpSxli1bJmdnZ3Xr1s1a5u7uri5dumjnzp2KiIhIsW/16tWtyZEklS5dWvXr19fSpUutZdeuXZMk+fn52fTPly+fJMnDw8OUYwEAAADw+MmQBOn06dN644035Ofnp2zZsilbtmzy8/NT586dderUqYced+/evSpZsqSyZ89uU16jRg1J0r59+5LsFx8fr/3796tatWp2dTVq1NDx48d1/fp1SVK1atWUNWtWjRgxQps2bdKZM2e0detWDRo0SNWrV9dzzz330PMHAAAA8Hgz/T5Ihw8fVq1atRQVFaUGDRqoTJky1vJ58+bpxx9/1Pbt21WqVKl0j33u3DnrSs79EsvOnj2bZL/IyEjFxsam2rdUqVLKnTu3lixZojfffFP169e3tmvUqJGWLVumLFlSfskuXryoS5cu2ZQdO3ZMkhQXF6e4uLgU+wMAAABIP2dnZ1PGMT1BGjJkiJycnLR3716VL1/epi4sLEz169fXkCFDtHz58nSPHRMTIzc3N7tyd3d3a31y/SSlua+vr68qV66sd955R+XKldO+ffs0YcIEvfHGG/r2229TnOP06dM1evToJOtu3rxpXakCAAAAYB5vb29TxjE9Qdq6dav69+9vlxxJUmBgoN555x1NmTLlocb28PBQbGysXfnt27et9cn1k5SmvidOnFC9evU0b948tWzZUpLUrFkzFSlSRJ06ddLPP/+sxo0bJzvHnj17qnXr1jZlx44dU/PmzZU1a1Z2wAMAAAAeY6YnSP/++2+KGxl4enrq33//faix8+XLpzNnztiVnzt3TpKUP3/+JPv5+PjIzc3N2i6lvnPmzNHt27f1wgsv2LR76aWXJEk7duxIMUHKkyeP8uTJk2Sds7OzaUt/AAAAAMxn+iYNlStX1qxZsxQdHW1Xd+3aNc2ePVtVqlR5qLErVaqkv//+27rTXKJdu3ZZ65Pi5OSk8uXL6/fff7er27Vrl4oVK2Zd2blw4YIMw7C7Vigxqbt79+5DzR0AAADA48/0BGn06NE6fvy4SpcurWHDhmnOnDmaM2eOhg4dqtKlS+v48ePJXqOTmlatWikuLk4zZ860lsXGxiokJERBQUEqVKiQpHu76B0+fNiu7+7du22SpCNHjmjTpk02p8SVLFlShmHYbP0tSYsWLZJ0LwEEAAAA8N+UITeK3bBhgwYOHKg///zTprxSpUqaOHGize5w6dWmTRstX75c/fr1U0BAgObOnavQ0FBt3LhRderUkSTVrVtXW7du1f2Hdv36dVWuXFnXr1/XgAED5OLioilTpiguLk779u2Tr6+vJOnKlSsKDAxUZGSkevTooXLlymnPnj2aNWuWSpcurT179sjV1TVdc+ZGsQAAAMCTIUMSpETnz5+33vfI399fefPmdXjM27dva8SIEVqwYIGuXr2qChUq6IMPPlCjRo2sbZJKkCTpn3/+Ub9+/bRu3TrFx8erbt26mjp1qgICAmzanTlzRu+//742b96sM2fOKFeuXHrhhRf00UcfKXfu3OmeMwkSAAAA8GTI0AQJ95AgAQAAAE8G069BkqRLly5pwIABKlu2rDw9PeXp6amyZctqwIABunDhQkaEBAAAAACHmZ4gHThwQOXLl9eUKVOUI0cOtW7dWq1bt1aOHDk0ZcoUVahQQWFhYWaHBQAAAACHmZ4gvf3224qLi9OuXbu0c+dOzZ07V3PnztXOnTv122+/KS4uTr169TI7LPDQYmNjNXjwYOXPn18eHh4KCgrS+vXr09T3zJkzatOmjby9vZU9e3Y1a9ZMJ06csGkzZ84cWSyWZB/ffPONte3y5cvVqFEj5c+fX25ubipYsKBatWqV6h8Vjh8/Lnd3d1ksliS3s4+KilK3bt3k6+urrFmzql69etqzZ0+SY12/fl2DBg1S0aJF5ebmpgIFCqhVq1a6deuWTbv169erVq1a8vT0VM6cOdWqVSuFh4fbtLly5YomTpyoOnXqyNfXV97e3nrqqae0ZMmSFI8HAAAgs5h+o9jQ0FANGzZM1atXt6urUaOG+vTpo//7v/8zOyzw0Dp16qRly5apb9++KlGihObMmaMmTZpo8+bNqlWrVrL9bty4oXr16ik6OlrDhg2Ti4uLpk6dquDgYO3bt0+5cuWSJNWpU0fz58+36z916lT9+eefNrs6/vXXX8qZM6f69Omj3Llz6/z58/r6669Vo0YN7dy5UxUrVkxyLv369VOWLFkUGxtrVxcfH6+mTZvqzz//1MCBA5U7d25Nnz5ddevW1R9//KESJUpY20ZHRys4OFj//POPunXrpoCAAF26dEm//PKLYmNj5enpKUlatWqVmjVrpipVqmjcuHG6du2apk2bplq1amnv3r3WXSF37typ4cOHq0mTJnrvvfeUJUsWfffdd3rllVd08ODBh97yHwAAIMMYJvP39zcmTpyYbP2ECRMMf39/s8M+1sLCwgxJRlhYWGZPBQ/YtWuXIcnmPRsTE2MUL17cePrpp1PsO378eEOSERoaai07dOiQ4ezsbAwdOjTFvrdu3TK8vLyMBg0apDrH8+fPG1myZDG6d++eZP2aNWsMV1dX47333jMkGbt377apX7JkiSHJ+Pbbb61lFy9eNLy9vY127drZtH3rrbcMb29v48SJEynOqWzZskZAQIARGxtrLdu3b5/h5ORkvPvuu9ayEydOGOHh4TZ94+PjjWeffdZwc3Mzbty4kfLBAwAAPGKmn2LXt29fffHFFzp//rxd3dmzZ/XFF1+ob9++ZocFHsqyZcvk7Oysbt26Wcvc3d3VpUsX7dy5UxERESn2rV69us1qaenSpVW/fn27Gw0/6Mcff9T169fVvn37VOeYJ08eeXp6Kioqyq7u33//VZ8+fdSnTx8VL1482Xn6+fnp5Zdftpb5+vqqTZs2+uGHH6yrTlFRUQoJCVG3bt1UtGhR3blzJ8kVqcjISB08eFAtWrSwuSdYxYoVVaZMGS1evNhaVrRoUfn7+9v0t1gsat68uWJjY+1ORwQAAMhspidI8fHxypYtmwICAtShQweNHj1ao0eP1muvvaaSJUsqe/bsio+P15QpU6yPqVOnmj0NIE327t1rfV/er0aNGpKkffv2JdkvPj5e+/fvV7Vq1ezqatSooePHj+v69evJxv3mm2/k4eFhk7TcLyoqSpcuXdJff/2lrl276tq1a0neYPnjjz/W1atX9d577yUba+/evapSpYqcnGx/3GvUqKFbt27p77//liRt375dt2/fVkBAgFq1aiVPT095eHioZs2aNq9DYtLk4eFhF8vT01Nnz55N8g8k90usf5j7igEAAGQk069BGjBggPX/77/4PNH+/ftt2kj3/qLcr18/s6cCpOrcuXPKly+fXXli2dmzZ5PsFxkZqdjY2FT7lipVKsm+a9asUfPmzeXl5ZXk+E899ZSOHDkiScqWLZvee+89denSxabN+fPn9cEHH2jSpEl2Cd6Dx1inTp0U51m+fHkdPXpUkjR06FAVL15c8+bNU3R0tEaPHq1nn31WBw4cUL58+eTn5ydvb2/t2LHDZrwrV67o4MGDku5tXpHcjaEjIyM1a9Ys1a5dO8nXDwAAIDOZniCdPHnS7CGBDBMTEyM3Nze7cnd3d2t9cv0kPVTfZcuW6c6dOymeXhcSEqJr167pxIkTCgkJUUxMjOLi4mxWgQYPHqxixYqpa9euyY6TOI+0zPPGjRuS7v3BYuPGjcqWLZskqXLlynr66af1+eefa+zYsXJyclL37t01fvx4DR06VJ07d9a1a9c0aNAg3blzJ8Vjj4+PV/v27RUVFaVPP/00xXkDAABkBtMTpAevNwAeZx4eHkleZ3P79m1rfXL9JD1U32+++UY+Pj5q3LhxsvN6+umnrf//yiuvqEyZMpKkSZMmSZJ+++03zZ8/Xxs3brQ7dS6puaZlnon/ffHFF63JkXRvNato0aL69ddfrWVjxozR5cuXNWHCBI0bN06S1LBhQ3Xp0kVffvmlTf/79erVS2vWrNG8efOS3ZEPAAAgM5l+DRLwJMmXL5/OnTtnV55Ylj9//iT7+fj4yM3NLd19T58+rV9++UWtW7eWi4tLmuaYM2dOPfvsszanrA4aNEi1a9dW0aJFFR4ervDwcF2+fNka//Tp0+k+xsT/+vn52bXNkyePrl69an3u6uqqWbNm6ezZs9q2bZuOHDmitWvXKjo6Wk5OTgoICLAbY/To0Zo+fbrGjRunDh06pOnYAQAAHjWHV5CKFi0qi8WSrj4Wi0XHjx93NDTgsEqVKmnz5s26du2azXU8u3btstYnxcnJSeXLl0/ypqy7du1SsWLFkry+aNGiRTIMI027190vJiZG0dHR1uenT5/WqVOnVLRoUbu2L730knLkyGHd9a5SpUr65ZdfFB8fb7PatGvXLnl6eqpkyZKSpKpVq0q6d/3Qg86ePavSpUvblfv5+VkTqri4OG3ZskVBQUF2K0iff/65Ro0apb59+2rw4MHpOnYAAIBHyeEVpODgYLtH1qxZFR4eLk9PT1WuXFmVK1eWp6enwsPDlS1btiQvGAcyQ6tWrRQXF6eZM2day2JjYxUSEqKgoCAVKlRI0r2E5PDhw3Z9d+/ebZMkHTlyRJs2bVLr1q2TjLdw4UIVLlw42RvQXrx40a4sPDxcGzdutNkxb+bMmVq+fLnNo1evXpLunYZ3/2pTq1atdOHCBX3//ffWssuXL+vbb7/Viy++aL0+qVSpUqpYsaJ++OEH62qUJK1bt04RERFq0KBBknNONGnSJJ07d079+/e3KV+yZIl69+6t9u3ba8qUKSmOAQAAkNkshmEYZg64YsUKvfHGG1q2bJndtsTr169XmzZtNGfOHDVr1szMsI+1AwcOKDAwUGFhYSpXrlxmTwcPaNOmjZYvX65+/fopICBAc+fOVWhoqDZu3GhN5uvWrautW7fq/h+X69evq3Llyrp+/boGDBggFxcXTZkyRXFxcdq3b598fX1t4oSFhal8+fIaMmSI/u///i/Jufj5+al+/fqqVKmScubMqaNHj2r27Nm6deuWNm7cqGeeeSbZ45gzZ47eeOMN7d692yaZiouLU61atRQWFqaBAwcqd+7cmj59uk6fPq3du3fb7LS3efNmNWjQQAEBAerevbuio6M1ZcoU5cuXT3/88Yd1ZWjBggX67rvvVKdOHWXLlk0bNmzQ0qVL1bVrV3311VfW8UJDQ1W7dm3lyJFD48ePtzut8JlnnlGxYsVS+ycCAAB4dMy+82z58uWNESNGJFv/3nvvGYGBgWaHfayFhYUZkoywsLDMngqSEBMTYwwYMMDImzev4ebmZlSvXt1Ys2aNTZvg4GAjqR+XiIgIo1WrVkb27NmNbNmyGS+88IJx9OjRJOMMGTLEkGTs378/2bmMHDnSqFatmpEzZ04jS5YsRv78+Y1XXnklxT6JQkJCDEnG7t277eoiIyONLl26GLly5TI8PT2N4ODgJNsZhmGsX7/eeOqppwx3d3fDx8fH6NChg3Hu3DmbNrt27TLq1Klj5MyZ03B3dzcqVqxofPnll0Z8fHySc0ruERISkupxAQAAPEqmryB5eHho3Lhx6tOnT5L1H3/8sYYNG6Zbt26ZGfaxxgoSAAAA8GQwfRe74sWLKyQkxHpPlftdv35dX3/9NafUAAAAAHgsmX4fpLFjx6pVq1YqXbq0OnXqZN3u9+jRo5o7d64uXLigb7/91uywAAAAAOAw0xOk5s2ba/Xq1Ro8eLA++ugjm7pKlSpp9uzZatSokdlhAQAAAMBhpidIktSwYUM1bNhQ58+f16lTpyRJ/v7+yps3b0aEAwAAAABTZEiClChv3rwkRQAAAACeGA4nSPPmzZMkdejQQRaLxfo8NR07dnQ0NAAAAACYyuFtvp2cnGSxWBQTEyNXV1c5OaW+MZ7FYlFcXJwjYZ8oj8s23yW7Xs602ADS5+9ZuTN7CgAA/E9yeAXp5MmTkiRXV1eb5wAAAADwpHE4QfL390/xOQAAAAA8KUy/USwAAAAAPKkyZBe77du36+uvv9aJEyd09epVPXiZk8Vi0Z9//pkRoQEAAADgoZmeIE2ZMkUDBw6Uu7u7SpUqJR8fH7NDAAAAAECGMD1BmjhxomrWrKkff/xROXLkMHt4AAAAAMgwpl+DdOvWLbVv357kCAAAAMATx/QEqV69evrrr7/MHhYAAAAAMpzpCdKnn36qjRs3atKkSYqMjDR7eAAAAADIMKYnSIUKFVL37t01ZMgQ+fr6KmvWrMqePbvNg9PvAAAAADyOTN+k4f3339eHH36oAgUKqFq1aiRDAAAAAJ4YpidIX375pZo2baoVK1bIyYn70AIAAAB4cpiewdy5c0dNmzYlOQIAAADwxDE9i3nhhRf0yy+/mD0sAAAAAGQ40xOkkSNH6uDBg+rZs6f++OMPXbp0SZGRkXYPAAAAAHjcmH4NUqlSpSRJ+/bt04wZM5JtFxcXZ3ZoAAAAAHBIhuxiZ7FYzB4WAAAAADKc6QnSqFGjzB4SAAAAAB4JtpoDAAAAgAQkSAAAAACQgAQJAAAAABKQIAEAAABAAhIkAAAAAEhAggQAAAAACTIkQbp27ZrGjRunRo0aqXLlygoNDZUkRUZGasqUKTp27FhGhAUAAAAAh5h+H6R//vlHwcHBioiIUIkSJXT48GHduHFDkuTj46MZM2bo1KlTmjZtmtmhAQAAAMAhpidIAwcO1PXr17Vv3z7lyZNHefLksalv3ry5Vq1aZXZYAAAAAHCY6afYrVu3Tr1791bZsmVlsVjs6osVK6aIiAizwwIAAACAw0xPkGJiYuTr65ts/fXr180OCQAAAACmMD1BKlu2rLZt25Zs/YoVK1S5cmWzwwIAAACAw0xPkPr27avFixdr/Pjxio6OliTFx8fr2LFj6tChg3bu3Kl+/fqZHRYAAAAAHGb6Jg2vvfaaTp06pffee0/Dhw+XJD3//PMyDENOTk766KOP1Lx5c7PDAgAAAIDDTE+QJGn48OHq0KGDvvvuOx07dkzx8fEqXry4Xn75ZRUrViwjQgIAAACAw0xPkE6fPi1fX18VLlw4yVPpYmJidOnSJRUuXNjs0AAAAADgENOvQSpatKiWL1+ebP3KlStVtGhRs8MCAAAAgMNMT5AMw0ix/t9//5WTk+lhAQAAAMBhppxid+3aNUVFRVmfX7lyRadPn7ZrFxUVpcWLFytfvnxmhAUAAAAAU5mSIE2dOlVjxoyRJFksFvXt21d9+/ZNsq1hGBo7dqwZYQEAAADAVKYkSA0bNlS2bNlkGIYGDRqkdu3aqUqVKjZtLBaLsmbNqqpVq6patWpmhAUAAAAAU5mSID399NN6+umnJUk3b95Uy5YtFRgYaMbQAAAAAPDImL7N98iRI80eEgAAAAAeiQy5Uawk7dixQ3v27FF0dLTi4+Nt6iwWi0aMGJFRoQEAAADgoZieIEVGRqpp06YKDQ2VYRiyWCzWrb8T/58ECQAAAMDjyPQbEg0cOFD79+/XwoULdeLECRmGobVr1+rvv/9Wjx49VKlSJZ09e9bssAAAAADgMNMTpNWrV6t79+5q27atvLy87gVxclJAQIA+//xzFSlSJNktwAEAAAAgM5meIEVFRalcuXKSpGzZskmSbty4Ya1v2LCh1q5da3ZYAAAAAHCY6QlS/vz5df78eUmSm5ub8uTJoz///NNaf+bMGVksFrPDAgAAAIDDTN+koU6dOlq/fr2GDx8uSWrbtq0mTJggZ2dnxcfH6+OPP1ajRo3MDgsAAAAADjM9QXr33Xe1fv16xcbGys3NTaNGjdKBAwesu9bVqVNHn376qdlhAQAAAMBhpidI5cuXV/ny5a3Pc+bMqQ0bNigqKkrOzs7WjRsAAAAA4HGTYTeKfZC3t/ejCgUAAAAADyXDEqRt27bpxIkTunr1qvVGsYksFov69euXUaEBAAAA4KGYniDt27dPbdu21bFjx+wSo0QkSAAAAAAeR6YnSF27dtXFixf15ZdfKigoSDly5DA7BAAAAABkCNPvg3TgwAENGzZMb775pipUqCB/f/8kHw8rNjZWgwcPVv78+eXh4aGgoCCtX78+TX3PnDmjNm3ayNvbW9mzZ1ezZs104sSJJNteuHBB3bt3V4ECBeTu7q4iRYqoS5cuDz1vAAAAAI8/01eQSpQokaE3gu3UqZOWLVumvn37qkSJEpozZ46aNGmizZs3q1atWsn2u3HjhurVq6fo6GgNGzZMLi4umjp1qoKDg7Vv3z7lypXL2jYiIkI1a9aUJPXo0UMFChTQ2bNnFRoammHHBQAAACDzmZ4gjRo1Sv3791e7du1UoEABU8cODQ3V4sWLNXHiRA0YMECS1LFjRwUGBmrQoEH69ddfk+07ffp0HT16VKGhoapevbokqXHjxgoMDNTkyZP10UcfWdt2795dWbJk0e7du20SJwAAAAD/baYnSC+//LJu376tUqVKqX79+ipYsKCcnZ1t2lgsFk2bNi3dYy9btkzOzs7q1q2btczd3V1dunTRsGHDFBERoUKFCiXbt3r16tbkSJJKly6t+vXra+nSpdYE6fDhw/r55581ffp05cqVS7dv35azs7NcXFzSPV8AAAAATxbTE6StW7fqrbfe0q1bt/Tjjz8m2eZhE6S9e/eqZMmSyp49u015jRo1JN3bQS+pBCk+Pl779+9X586d7epq1KihdevW6fr16/Ly8tKGDRskSX5+fqpfv742bdokZ2dnNWjQQF988YWKFCmS7nkDAAAAeDKYniD16tVL2bNn17JlyxQUFGSXzDji3Llzypcvn115YtnZs2eT7BcZGanY2NhU+5YqVUpHjx6VJHXr1k3Vq1fXkiVLdPr0aY0ePVrPPfec9u/fL09Pz2TnePHiRV26dMmm7NixY5KkuLg4xcXFpeFIAfyv47MCAID0efCstYdleoJ07NgxjRs3Tg0aNDB7aMXExMjNzc2u3N3d3VqfXD9Jaep748YNSVLevHn1008/ycnp3kZ/BQsWVLt27bRw4UJ17do12TlOnz5do0ePTrLu5s2bun79erJ9ASARnxUAAKSPt7e3KeOYniCVK1dO0dHRZg8rSfLw8FBsbKxd+e3bt631yfWTlKa+if9t06aNNTmSpNatW6tDhw769ddfU0yQevbsqdatW9uUHTt2TM2bN1fWrFnl5eWVbN+MdzUTYwNIj8z9rAAA4H+X6QnSpEmT1L59ezVq1Mh6bZBZ8uXLpzNnztiVnzt3TpKUP3/+JPv5+PjIzc3N2i6lvon/9fPzs2nn7OysXLly6erVlJOMPHnyKE+ePEnWOTs7m7b0B+C/jc8KAAAyh+kJ0uTJk+Xl5aWnn35aZcuWVeHChZPcxe6HH35I99iVKlXS5s2bde3aNZtrm3bt2mWtT4qTk5PKly+v33//3a5u165dKlasmPWvtVWrVpUku0Tszp07unz5snx9fdM9bwAAAABPBqfUm6TP/v37dfv2bRUuXFg3btzQwYMH9ddff9k9HkarVq0UFxenmTNnWstiY2MVEhKioKAg6w52p0+f1uHDh+367t692yZJOnLkiDZt2mRzSlzdunWVJ08effPNN9bT7yRpzpw5iouLy5BrqwAAAAA8HiyGYRiZPYn0aNOmjZYvX65+/fopICBAc+fOVWhoqDZu3Kg6depIupfkbN26Vfcf2vXr11W5cmVdv35dAwYMkIuLi6ZMmaK4uDjt27fPZmVo3rx5ev3111W9enV16NBBp0+f1rRp0/TUU09p8+bN6T715cCBAwoMDFRYWJjKlStnzgvxEEp2vZxpsQGkz9+zcmf2FAAA+J9k+il2GW3evHkaMWKE5s+fr6tXr6pChQpatWqVNTlKjpeXl7Zs2aJ+/fpp7Nixio+PV926dTV16lS70+Y6duwoV1dXjRs3TgMHDpS3t7e6d++ujz76iOsCAAAAgP8wh1eQTp8+LUkqXLiwzfPUJLb/X8AKEoD0YgUJAIDM4fAKUpEiRWSxWBQTEyNXV1fr89RwE0QAAAAAjxuHE6Svv/5aFotFLi4uNs8BAAAA4EnjcILUqVOnFJ8DAAAAwJPC9G2+Y2JiUm1z6tQps8MCAAAAgMNMT5AqVKigHTt2JFv/xRdfqHz58maHBQAAAACHmZ4gubu7Kzg4WAMGDFBsbKy1PCIiQg0bNtTbb7/NzVYBAAAAPJZMT5D27NmjgQMHatq0aapcubJ27dqlWbNmKTAwUH/88YcWLFig7777zuywAAAAAOAw0xMkFxcX/d///Z+2b9+uuLg4PfPMM+revbvq1q2rAwcO6NVXXzU7JAAAAACYwvQEKdGJEyd0+fJlubq6yjAM3blzRw7ekxYAAAAAMpTpCdLly5fVqlUrtW/fXkFBQTp+/Ljmz5+v0NBQlStXTgsWLDA7JAAAAACYwvQEqWzZslq3bp1mzJih1atXK3/+/Grfvr3CwsL0zDPPqGPHjmrRooXZYQEAAADAYaYnSIGBgdq/f7/efPNNm/J8+fJp1apVmj17trZs2WJ2WAAAAABwWBazB9y0aVOK9W+88YYaNmxodlgAAAAAcJjpCVKirVu36qefftKpU6ckSf7+/mratKmCg4NVoECBjAoLAAAAAA/N9ATpzp07ateunVasWCHDMOTt7S1JioqK0uTJk9WiRQstWrRILi4uZocGAAAAAIeYfg3S6NGjtXz5cvXv31/nzp1TZGSkIiMjdf78eQ0YMEDff/+9xowZY3ZYAAAAAHCY6QnSwoUL9frrr2vChAny8/OzlufJk0fjx49Xx44dNX/+fLPDAgAAAIDDTE+Qzp07p6CgoGTrg4KCdP78ebPDAgAAAIDDTE+QChYsmOI23lu3blXBggXNDgsAAAAADjM9QXr99de1dOlS9ejRQ0eOHFFcXJzi4+N15MgRvfXWW/r222/VqVMns8MCAAAAgMNM38Vu2LBhOn78uGbOnKmvvvpKTk73crD4+HgZhqHXX39dw4YNMzssAAAAADjM9ATJ2dlZc+bM0bvvvqvVq1fb3AepSZMmqlChgtkhAQAAAMAUpiZIt27dUu3atfXmm2+qR48eJEMAAAAAniimXoPk6empkydPymKxmDksAAAAADwSpm/S8Pzzz2vt2rVmDwsAAAAAGc70BGnEiBH6+++/1aFDB23fvl1nzpxRZGSk3QMAAAAAHjemb9JQrlw5SdLBgwe1cOHCZNvFxcWZHRoAAAAAHGJ6gvT+++9zDRIAAACAJ5LpCdKoUaPMHhIAAAAAHgnTE6T7GYahS5cuSZJ8fX1ZWQIAAADwWDN9kwbp3vVHrVq1Uvbs2ZUvXz7ly5dP2bNnV6tWrRQWFpYRIQEAAADAYaavIP3yyy9q3Lix4uPj1axZM5UsWVKSdOTIEa1cuVI///yz1qxZo9q1a5sdGgAAAAAcYnqC1K9fP+XJk0dbt25VoUKFbOoiIiJUp04dvfvuu9q9e7fZoQEAAADAIaafYnfgwAH17NnTLjmSpEKFCumtt97SgQMHzA4LAAAAAA4zPUHy9/dXbGxssvV37txJMnkCAAAAgMxmeoL0/vvv65NPPtG+ffvs6vbu3atPP/2UrcABAAAAPJZMvwbpt99+k5+fn6pWrapnnnlGAQEBkqSjR49q586dCgwM1M6dO7Vz505rH4vFomnTppk9FQAAAABIF4thGIaZAzo5pX9RymKxKC4uzsxpPFYOHDigwMBAhYWFqVy5cpk2j5JdL2dabADp8/es3Jk9BQAA/ieZvoIUHx9v9pAAAAAA8EhkyI1iAQAAAOBJZPoKUqKwsDCtXr1a4eHhkqQiRYqocePGKl++fEaFBAAAAACHmJ4gxcbGqnv37po/f74Mw7BekxQfH6+hQ4eqffv2mjVrllxdXc0ODQAAAAAOMf0Uu8GDB2vevHl66623dOjQId2+fVuxsbE6dOiQevTooQULFmjQoEFmhwUAAAAAh5m+i13u3LnVtGlTzZ07N8n6Dh066Oeff9bly/87O6qxix2A9GIXOwAAMofpK0j//vuvnnrqqWTrn3nmGd29e9fssAAAAADgMNMTpEaNGmnt2rXJ1q9Zs0YNGzY0OywAAAAAOMz0TRo++OADtWnTRi+//LLefvttBQQESJKOHj2qzz//XKdOndKSJUsUGRlp08/Hx8fsqQAAAABAupieIJUpU0aS9Ndff+mHH36wqUu83Kls2bJ2/eLi4syeCgAAAACki+kJ0vvvvy+LxWL2sAAAAACQ4UxPkEaNGmX2kAAAAADwSJi+SQMAAAAAPKlMX0FKtGPHDu3Zs0fR0dGKj4+3qbNYLBoxYkRGhQYAAACAh2J6ghQZGammTZsqNDRUhmHIYrFYN2dI/H8SJAAAAACPI9NPsRs4cKD279+vhQsX6sSJEzIMQ2vXrtXff/+tHj16qFKlSjp79qzZYQEAAADAYaYnSKtXr1b37t3Vtm1beXl53Qvi5KSAgAB9/vnnKlKkiPr27Wt2WAAAAABwmOkJUlRUlMqVKydJypYtmyTpxo0b1vqGDRtq7dq1ZocFAAD4nxAbG6vBgwcrf/788vDwUFBQkNavX5+mvmfOnFGbNm3k7e2t7Nmzq1mzZjpx4kSKfbZv3y6LxSKLxaLLly/b1B05ckT9+vXTM888I3d3d1ksFoWHh9uNsWXLFusYST0+/PBDa9u6desm287FxcVm3CJFiiTZrkePHnZzWL9+vWrVqiVPT0/lzJlTrVq1SnKu/fr1U5UqVeTj4yNPT0+VKVNGo0aNsvk+i/82069Byp8/v86fPy9JcnNzU548efTnn3+qWbNmku79YHKfJAAAgIfTqVMnLVu2TH379lWJEiU0Z84cNWnSRJs3b1atWrWS7Xfjxg3Vq1dP0dHRGjZsmFxcXDR16lQFBwdr3759ypUrl12f+Ph49erVS1mzZtXNmzft6nfu3KlPPvlEZcuWVZkyZbRv374kY5cpU0bz58+3K58/f77WrVunhg0bWsuGDx+url272rS7efOmevToYdMuUaVKldS/f3+bspIlS9o8X7VqlZo1a6YqVapo3LhxunbtmqZNm6ZatWpp79698vX1tbbdvXu3ateurTfeeEPu7u7au3evxo0bpw0bNmjbtm1ycmIT6P860xOkOnXqaP369Ro+fLgkqW3btpowYYKcnZ0VHx+vjz/+WI0aNTI7LAAAwH9eaGioFi9erIkTJ2rAgAGSpI4dOyowMFCDBg3Sr7/+mmzf6dOn6+jRowoNDVX16tUlSY0bN1ZgYKAmT56sjz76yK7PzJkzFRERoa5du2ratGl29S+99JKioqLk5eWlSZMmJZsg+fn56bXXXrMrHz16tEqUKGGdjyQ1aNDArt2CBQskSe3bt7erK1CgQJJj32/w4MEqVqyYduzYIVdXV0nSiy++aE2YJk+ebG27fft2u/7FixfXgAEDFBoaqqeeeirFWHjymZ4Cv/vuu3rppZcUGxsr6d6NY5966imNGDFCI0eOVNWqVfXpp5+aHRYAAOA/b9myZXJ2dla3bt2sZe7u7urSpYt27typiIiIFPtWr17dJhkpXbq06tevr6VLl9q1j4yM1HvvvacxY8bI29s7yTF9fHys15ynV2hoqI4dO5Zk0vOghQsXKmvWrNYzkh50586dJFe4pHvHcfDgQbVo0cKaHElSxYoVVaZMGS1evDjV+EWKFJF071IS/PeZniCVL19e7777rtzc3CRJOXPm1IYNGxQZGano6Ght2bJF+fLlMzssAADAf97evXtVsmRJZc+e3aa8Ro0akpTsCk58fLz279+vatWq2dXVqFFDx48f1/Xr123KR4wYobx586p79+7mTP4B33zzjaSkV4Xud+nSJa1fv17NmzdX1qxZ7eo3bdokT09PZcuWTUWKFLFb6Ur8o72Hh4ddX09PT509e9Z6eUiiu3fv6vLlyzp79qzWrVun9957T15eXtbXGf9tGXaj2Acl95cHAAAApM25c+eS/ENzYllyt1KJjIxUbGxsqn1LlSolSdq/f79mzJih1atXy9nZ2azpW8XFxWnJkiWqUaOGAgICUmy7ZMkS3b17N8lEqkKFCqpVq5ZKlSqlK1euaM6cOerbt6/Onj2r8ePHS7p3ep+3t7d27Nhh0/fKlSs6ePCgpHvXyOfNm9da9/vvv+vpp5+2Pi9VqpRWrlwpHx+fhz5mPDkcXkFatGiR9Uaw6WEYhhYtWuRoeAAAgP8ZMTEx1rN07ufu7m6tT66fpDT37d27txo3bpzkpghm2Lhxoy5cuJDm0+t8fX2TvDZp5cqVGjRokJo1a6bOnTtr69atatSokaZMmaJ//vlH0r3bzXTv3l0bN27U0KFDdfToUf3xxx9q06aN7ty5I8n+dStbtqzWr1+vFStWaNCgQcqaNSu72P0PcThB6tu3r0qWLKkJEybo5MmTqbY/duyYPvroIwUEBKhfv36OhgcAAPif4eHhYT1l7H63b9+21ifXT1Ka+i5ZskS//vqrzcYFZvvmm2/k7Oystm3bptjuxIkT2rlzp9q2bassWVI/8clisahfv366e/eutmzZYi0fM2aMunTpogkTJqhkyZKqVq2asmTJoi5dukj6/7emSZQ9e3Y999xzatasmcaPH6/+/furWbNm+vPPP9N/sHjiOHyK3YkTJ/Txxx9r8uTJGjp0qIoUKaIqVaqoaNGiypkzpwzD0NWrV3Xy5En9/vvvioiIUK5cudS7d28SJAAAgHTIly+fzpw5Y1d+7tw5Sfdut5IUHx8fubm5Wdul1HfgwIFq3bq1XF1drfcJStycICIiQnfu3Ek2TlrExMRo+fLleu655+Tn55di24ULF0pK/Tql+xUqVEjSvdMKE7m6umrWrFn68MMP9ffff8vPz08lS5bUq6++Kicnp1RP83v55ZfVoUMHLV68WBUrVkzzXPBkcjhBypo1q4YPH67Bgwfrxx9/1A8//KBff/1V33//vfXUO4vFouLFiys4OFjNmjXTiy++aHejLwAAAKSsUqVK2rx5s65du2azUcOuXbus9UlxcnJS+fLl9fvvv9vV7dq1S8WKFbPuRhcREaGFCxdak5P7ValSRRUrVkx2M4i0WLlypa5fv57m0+uKFy+erq21E298e/+9jRL5+flZk7K4uDht2bJFQUFBditID4qNjVV8fLyio6PTPA88uUzbpCFLlixq0aKFWrRoIenemy4xc/fx8cmQC/wAAAD+l7Rq1UqTJk3SzJkzrfdBio2NVUhIiIKCgqyrJ6dPn9atW7dUunRpm75DhgzR77//bt3N7siRI9q0aZN1LElavny5XdzFixdryZIlmjdvngoWLOjQMSxcuFCenp7W74zJ2bt3rw4dOqQRI0YkWR8ZGakcOXLYfMf8999/NW7cOLm6uqpevXopjj9p0iSdO3fO5vYzUVFRypo1q90f8mfNmiVJSe4CiP+eDNvFztnZOcnMHQAAAA8nKChIrVu31tChQ3Xx4kUFBARo7ty5Cg8P1+zZs63tOnbsqK1bt9pspNWzZ0999dVXatq0qQYMGCAXFxdNmTJFfn5+6t+/v7Vd8+bN7eImrhg1btxYuXPntpZHR0dbE4zEXeI+++wzeXt7y9vbW++8847NOJGRkfr555/VsmXLVFdtUtsGfOXKlRo7dqxatWqlokWLKjIyUgsXLlRYWJg++ugjm13pFixYoO+++0516tRRtmzZtGHDBi1dulRdu3ZVy5Ytre22bNmi3r17q1WrVipRooTu3LmjX375Rd9//72qVauW6g1p8d/wyLb5BgAAgOPmzZunESNGaP78+bp69aoqVKigVatWqU6dOin28/Ly0pYtW9SvXz+NHTtW8fHxqlu3rqZOnfrQf9S+evWq3QpP4uYO/v7+dgnSt99+q3///VevvvpqiuPGx8dr8eLFqlKlinXr8QeVL19eZcuW1YIFC3Tp0iW5urqqUqVKWrp0qVq3bm3TtmTJkoqMjNQHH3ygmJgYlSpVSl9++aXNDXcTx6xXr55++OEHnTt3ToZhqHjx4nr//fc1cOBAmxvN4r/LYjzMHt1IlwMHDigwMFBhYWEqV65cps2jZNfLmRYbQPr8PSt36o0AAIDpHN7mGwAAAAD+K0iQAAAAACABCRIAAAAAJDA9QSpWrJhWrlyZbP2qVatUrFgxs8MCAAAAgMNMT5DCw8N148aNZOtv3LihU6dOmR0WAAAAAByWIafYWSyWZOt2794tb2/vjAgLAAAAAA4x5T5I06ZN07Rp0yTdS4769u2r4cOH27WLjo5WVFRUqnvfAwAAeA/uk9lTAJBGUeOnZfYUTGNKgpQnTx7r/X3Cw8NVoEABFShQwKaNxWJR1qxZVbVqVfXs2dOMsAAAAABgKlMSpHbt2qldu3aSpHr16um9995T/fr1zRjaTmxsrN5//32bu0ePHTtWDRo0SLXvmTNn1K9fP61bt07x8fGqV6+epk6dmuKmEdu3b1ft2rUlSZcuXVLu3Ny8EQAAAPivMiVBut/mzZvNHtJGp06dtGzZMvXt21clSpTQnDlz1KRJE23evFm1atVKtt+NGzdUr149RUdHa9iwYXJxcdHUqVMVHBysffv2KVeuXHZ94uPj1atXL2XNmlU3b97MyMMCAAAA8BgwPUFKdPDgQZ04cUJXr16VYRh29R07dkz3mKGhoVq8eLEmTpyoAQMGWMcJDAzUoEGD9Ouvvybbd/r06Tp69KhCQ0NVvXp1SVLjxo0VGBioyZMn66OPPrLrM3PmTEVERKhr167Wa6wAAAAA/HeZniAdP35cr732mkJDQ5NMjKR71yM9TIK0bNkyOTs7q1u3btYyd3d3denSRcOGDVNERIQKFSqUbN/q1atbkyNJKl26tOrXr6+lS5faJUiRkZF67733NGbMGF28eDHdcwUAAADw5DF9m+/u3bvrr7/+0scff6w9e/bo5MmTdo8TJ0481Nh79+5VyZIllT17dpvyGjVqSJL27duXZL/4+Hjt379f1apVs6urUaOGjh8/ruvXr9uUjxgxQnnz5lX37t0faq4AAAAAnjymryDt2LFDw4YNU69evcweWufOnVO+fPnsyhPLzp49m2S/yMhIxcbGptq3VKlSkqT9+/drxowZWr16tZydndM1x4sXL+rSpUs2ZceOHZMkxcXFKS4uLl3jAfjfxGcFAOBJ8jj83krv9/bkmJ4g5c6dWzly5DB7WElSTEyM3Nzc7Mrd3d2t9cn1k5Tmvr1791bjxo3VsGHDdM9x+vTpGj16dJJ1N2/etFupAoCk8FkBAHiSPA6/t7y9vU0Zx/QEqUePHlqwYIHefvtt07K4RB4eHoqNjbUrv337trU+uX6S0tR3yZIl+vXXXxUWFvZQc+zZs6dat25tU3bs2DE1b95cWbNmlZeX10ONa46rmRgbQHpk7mcFAADp81/6vWV6glSyZEnFxcWpYsWK6ty5swoVKpRkovTyyy+ne+x8+fLpzJkzduXnzp2TJOXPnz/Jfj4+PnJzc7O2S6nvwIED1bp1a7m6uio8PFySFBUVJUmKiIjQnTt3ko0j3btpbp48eZKsc3Z2Nj1pBPDfxGcFAOBJ8l/6vWV6gtS2bVvr/yduxf0gi8XyUOcpVqpUSZs3b9a1a9dsNmrYtWuXtT4pTk5OKl++vH7//Xe7ul27dqlYsWLWrDciIkILFy7UwoUL7dpWqVJFFStWTHYzCAAAAABPtifqRrGtWrXSpEmTNHPmTGvyFRsbq5CQEAUFBVm3+D59+rRu3bql0qVL2/QdMmSIfv/9d+tudkeOHNGmTZtsErnly5fbxV28eLGWLFmiefPmqWDBghl2fAAAAAAyl+kJUnBwsNlDWgUFBal169YaOnSoLl68qICAAM2dO1fh4eGaPXu2tV3Hjh21detWm/sw9ezZU1999ZWaNm2qAQMGyMXFRVOmTJGfn5/69+9vbde8eXO7uIkrRo0bN1bu3Lkz7PgAAAAAZC7TE6REsbGx2rNnjy5evKiaNWualljMmzdPI0aM0Pz583X16lVVqFBBq1atUp06dVLs5+XlpS1btqhfv34aO3as4uPjVbduXU2dOlW+vr6mzA0AAADAk81i3L/MYpJPPvlEo0aNUnR0tCRp/fr1evbZZ3X58mWVLl1aEyZMUOfOnc0O+9g6cOCAAgMDFRYWpnLlymXaPEp2vZxpsQGkz9+zWK0GvAf3yewpAEijqPHTMnsKpnEye8CQkBD17dtXzz//vGbPnm1zmlvu3Ln17LPPavHixWaHBQAAAACHmZ4gTZ48Wc2aNdPChQv14osv2tVXrVpVBw4cMDssAAAAADjM9ATp2LFjaty4cbL1Pj4+unLlitlhAQAAAMBhpidI3t7eunw5+WtdDh48qLx585odFgAAAAAcZnqC1KRJE82cOVNRUVF2dQcOHNBXX32ll156yeywAAAAAOAw0xOksWPHKi4uToGBgXrvvfdksVg0d+5cvfbaa6pWrZry5Mmj999/3+ywAAAAAOAw0xOk/Pnz648//tDzzz+vJUuWyDAMzZ8/Xz/++KPatWun3377jZutAgAAAHgsZciNYvPkyaNZs2Zp1qxZunTpkuLj4+Xr6ysnJ9PzMQAAAAAwTYYkSPfz9fXN6BAAAAAAYAqHE6QxY8bIYrFo+PDhcnJy0pgxY1LtY7FYNGLECEdDAwAAAICpLIZhGI4M4OTkJIvFopiYGLm6uqbpNDqLxaK4uDhHwj5RDhw4oMDAQIWFhalcuXKZNo+SXZPffh3A4+XvWVyrCXgP7pPZUwCQRlHjp2X2FEzj8ApSfHx8is8BAAAA4EnBrgkAAAAAkMD0BOnkyZP68ccfk63/8ccfFR4ebnZYAAAAAHCY6bvYDRgwQNeuXdOLL76YZP3nn38ub29vLV682OzQAAAAAOAQ01eQdu7cqQYNGiRbX79+ff3yyy9mhwUAAAAAh5meIF29elVeXl7J1mfLlk1XrlwxOywAAAAAOMz0BKlw4cLasWNHsvW//PKLChYsaHZYAAAAAHCY6QlSu3bttGjRIn3yySc2W37HxcVp2rRpWrJkiV599VWzwwIAAACAw0zfpGHo0KHavn27+vbtqw8//FClSpWSJB05ckSXLl1S3bp1NXz4cLPDAgAAAIDDTF9BcnNz07p16zR79mzVqFFDly9f1uXLl1WjRg19/fXX2rBhg9zc3MwOCwAAAAAOM30FSZKcnJz0xhtv6I033siI4QEAAAAgQ5i+ggQAAAAATyqHV5Dq1asnJycnrV27VlmyZNGzzz6bah+LxaKNGzc6GhoAAAAATOVwgmQYhs1udfHx8bJYLKn2AQAAAIDHjcMJ0pYtW1J8DgAAAABPCoevQfLx8dF3331nfT5mzBiFhYU5OiwAAAAAPHIOJ0g3btzQzZs3rc9HjRql/fv3OzosAAAAADxyDp9iV7x4cS1btky1a9dW9uzZJUk3b95UZGRkiv18fHwcDQ0AAAAApnI4QRo2bJjeeOMN/fTTT5Lu7VDXo0cP9ejRI8V+cXFxjoYGAAAAAFM5nCB16NBBNWrU0JYtW3ThwgWNGjVKLVq0UIUKFcyYHwAAAAA8Mg4nSNeuXVNAQIBKlSolSQoJCdHrr7+ul156yeHJAQAAAMCj5PAmDTlz5tSSJUusz+vWrSs/Pz9HhwUAAACAR87hBMnV1VWxsbHW5/PmzdPx48cdHRYAAAAAHjmHT7ErXbq0Zs2apSJFiihHjhwyDEPh4eHas2dPiv2qVKniaGgAAAAAMJXDCdL//d//qW3btnruueck3dvFbsSIERoxYkSS7Q3DkMViYRc7AAAAAI8dhxOk559/XidPntTu3bt14cIFderUSd26ddPTTz9txvwAAAAA4JFxOEGS7t30tVGjRpLu7WLXunVr1a9f34yhAQAAAOCRMSVBut/mzZvNHhIAAAAAHgmHd7FLyunTp9WjRw+VKlVKPj4+2rZtmyTp8uXL6t27t/bu3ZsRYQEAAADAIaavIB08eFC1a9dWfHy8goKCdOzYMd29e1eSlDt3bm3fvl03b97U7NmzzQ4NAAAAAA4xPUEaNGiQvL299dtvv8lisShPnjw29U2bNrW5sSwAAAAAPC5MP8Vu27Zteuutt+Tr6yuLxWJXX7hwYZ05c8bssAAAAADgMNMTpPj4eHl6eiZbf+nSJbm5uZkdFgAAAAAcZnqCVKVKFf30009J1t29e1eLFy/WU089ZXZYAAAAAHCY6QnS0KFDtWbNGr311lsKCwuTJF24cEEbNmxQw4YNdejQIQ0ZMsTssAAAAADgMNM3aWjcuLHmzJmjPn36aObMmZKk1157TYZhKHv27Jo3b57q1KljdlgAAAAAcJjpCZIkdejQQS+//LLWrVunY8eOKT4+XsWLF1ejRo3k5eWVESEBAAAAwGEZkiBJUtasWdWiRYuMGh4AAAAATJdhCdLWrVv1008/6dSpU5Ikf39/NW3aVMHBwRkVEgAAAAAcYnqCdOfOHbVr104rVqyQYRjy9vaWJEVFRWny5Mlq0aKFFi1aJBcXF7NDAwAAAIBDTN/FbvTo0Vq+fLn69++vc+fOKTIyUpGRkTp//rwGDBig77//XmPGjDE7LAAAAAA4zPQEaeHChXr99dc1YcIE+fn5Wcvz5Mmj8ePHq2PHjpo/f77ZYQEAAADAYaYnSOfOnVNQUFCy9UFBQTp//rzZYQEAAADAYaYnSAULFtSWLVuSrd+6dasKFixodlgAAAAAcJjpCdLrr7+upUuXqkePHjpy5Iji4uIUHx+vI0eO6K233tK3336rTp06mR0WAAAAABxm+i52w4YN0/HjxzVz5kx99dVXcnK6l4PFx8fLMAy9/vrrGjZsmNlhAQAAAMBhpidIzs7OmjNnjt59912tXr3a5j5ITZo0UYUKFcwOCQAAAACmyLAbxVaoUIFkCAAAAMATxfRrkPbs2aPp06cnWz99+nTt27fP7LAAAAAA4DDTE6Thw4drw4YNydZv2rRJ7733ntlhAQAAAMBhpidIf/zxh2rXrp1sfe3atfX777+bHRYAAAAAHGZ6gnT9+nVlyZL8pU1OTk6Kjo42OywAAAAAOMz0BKlEiRJat25dsvVr1qxRsWLFzA4LAAAAAA4zPUHq0qWLfvrpJ7377ruKioqylkdFRalfv35as2aNunTpYnZYAAAAAHCY6dt89+7dW/v27dPHH3+sTz75RPnz55cknT17VvHx8erQoYP69etndlgAAAAAcJjpCZLFYlFISIg6duyo7777TidOnJAkNWvWTC1btlTdunXNDgkAAAAApsiwG8XWq1dP9erVy6jhAQAAAMB0pl+DBAAAAABPKhIkAAAAAEhAggQAAAAACUiQAAAAACABCRIAAAAAJCBBAgAAAIAEDm/z3blz53T3sVgsmj17tqOhAQAAAMBUDidImzZtksVisSm7deuWLl26JEnKmTOnJOnq1auSJF9fX2XNmtXRsAAAAABgOodPsQsPD9fJkyetj59++kkuLi4aNmyYLl68qCtXrujKlSu6ePGihg4dKldXV/30008PHS82NlaDBw9W/vz55eHhoaCgIK1fvz5Nfc+cOaM2bdrI29tb2bNnV7NmzXTixAmbNhERERo9erRq1KihnDlzKnfu3Kpbt642bNjw0HMGAAAA8GQw/RqkXr16qXHjxho7dqxy585tLc+dO7c+/PBDPf/88+rVq9dDj9+pUydNmTJF7du317Rp0+Ts7KwmTZpo+/btKfa7ceOG6tWrp61bt2rYsGEaPXq09u7dq+DgYF25csXa7ocfftD48eMVEBCgsWPHasSIEbp+/boaNGigkJCQh543AAAAgMefw6fYPei3335Tq1atkq2vXLmyFi1a9FBjh4aGavHixZo4caIGDBggSerYsaMCAwM1aNAg/frrr8n2nT59uo4eParQ0FBVr15dktS4cWMFBgZq8uTJ+uijjyRJ9erV0+nTp22Sux49eqhSpUp6//339cYbbzzU3AEAAAA8/kxfQfLx8dHPP/+cbP3q1avl7e39UGMvW7ZMzs7O6tatm7XM3d1dXbp00c6dOxUREZFi3+rVq1uTI0kqXbq06tevr6VLl1rLypUrZ5McSZKbm5uaNGmif/75R9evX3+ouQMAAAB4/JmeIHXv3l2rVq1Ss2bNtGHDBoWHhys8PFzr16/XSy+9pJ9//lk9evR4qLH37t2rkiVLKnv27DblNWrUkCTt27cvyX7x8fHav3+/qlWrZldXo0YNHT9+PNXE5/z58/L09JSnp+dDzR0AAADA48/0U+zee+89xcbGauLEiVq1apVtsCxZNGTIEL333nsPNfa5c+eUL18+u/LEsrNnzybZLzIyUrGxsan2LVWqVJL9jx07pu+//16tW7eWs7NzinO8ePGidQe/+/tLUlxcnOLi4lLsDwCS+KwAADxRHoffW6l9T08r0xMkSfrggw/Up08frV+/XqdPn5Yk+fv767nnnrM7fS09YmJi5ObmZlfu7u5urU+un6SH6nvr1i21bt1aHh4eGjduXKpznD59ukaPHp1k3c2bNzlFD0Ca8FkBAHiSPA6/tx72Mp4HZUiCJN3bta5du3amjunh4aHY2Fi78tu3b1vrk+snKd194+Li9Morr+jgwYP6+eeflT9//lTn2LNnT7Vu3dqm7NixY2revLmyZs0qLy+vVMfIOFczMTaA9MjczwoAANLnv/R7K0MSpLi4OH377bfavHmzLl68qDFjxqh8+fKKjo7Wxo0bVbNmTfn5+aV73Hz58unMmTN25efOnZOkZBMYHx8fubm5Wdulte+bb76pVatW6ZtvvtGzzz6bpjnmyZNHefLkSbLO2dnZtKU/AP9tfFYAAJ4k/6XfW6Zv0hAVFaWaNWvq1Vdf1aJFi7Ry5UrrNTnZsmVT7969NW3atIcau1KlSvr777917do1m/Jdu3ZZ65Pi5OSk8uXL6/fff7er27Vrl4oVK2aX9Q4cOFAhISGaOnWq6SthAAAAAB5PpidIQ4YM0YEDB7R27VqdOHFChmFY65ydndWqVSutXr36ocZu1aqV4uLiNHPmTGtZbGysQkJCFBQUpEKFCkmSTp8+rcOHD9v13b17t02SdOTIEW3atMnulLiJEydq0qRJGjZsmPr06fNQcwUAAADw5DH9FLsVK1aoV69eatCgga5cuWJXX7JkSc2ZM+ehxg4KClLr1q01dOhQXbx4UQEBAZo7d67Cw8M1e/Zsa7uOHTtq69atNslZz5499dVXX6lp06YaMGCAXFxcNGXKFPn5+al///7WdsuXL9egQYNUokQJlSlTRgsWLLCZQ4MGDR7q9EAAAAAAjz/TE6To6GgVLVo02fp///1Xd+/efejx582bpxEjRmj+/Pm6evWqKlSooFWrVqlOnTop9vPy8tKWLVvUr18/jR07VvHx8apbt66mTp0qX19fa7s///xTknT06FF16NDBbpzNmzeTIAEAAAD/UaYnSMWLF9eePXuSrV+3bp3Kli370OO7u7tr4sSJmjhxYrJttmzZkmR5wYIF9e2336Y4/qhRozRq1KiHnh8AAACAJ5fp1yB17dpVX3/9tZYsWWI9xc1isSg2NlbDhw/XmjVr1L17d7PDAgAAAIDDTF9B6tOnjw4cOKB27dpZb9b06quv6sqVK7p79666d++uLl26mB0WAAAAABxmeoJksVj01Vdf6fXXX9eyZct09OhRxcfHq3jx4mrTpk2q1woBAAAAQGbJkBvFSlKtWrVUq1atjBoeAAAAAExn+jVIAAAAAPCkMj1BMgxDM2bMUI0aNZQ7d245OzvbPbJkybCFKwAAAAB4aKZnKoMGDdKUKVNUqVIlvfbaa8qZM6fZIQAAAAAgQ5ieIM2dO1ctW7bU0qVLzR4aAAAAADKU6afYxcTE6LnnnjN7WAAAAADIcKYnSPXr19fu3bvNHhYAAAAAMpzpCdL06dP122+/6aOPPtKVK1fMHh4AAAAAMozD1yB5eXnJYrHYlN29e1cjRozQiBEj5O7uLmdnZ5t6i8Wi6OhoR0MDAAAAgKkcTpBatmxplyABAAAAwJPI4QRpzpw5JkwDAAAAADKf6dcgAQAAAMCTyvQEaePGjZo4caJN2ddff63ChQvLz89P/fr1U1xcnNlhAQAAAMBhpidIo0aN0p9//ml9/tdff6l79+7y9fVV3bp19cknn2jSpElmhwUAAAAAh5meIB06dEjVqlWzPp8/f76yZ8+uX375RUuWLNGbb76pefPmmR0WAAAAABxmeoJ08+ZNZc+e3fp8zZo1ev755+Xp6SlJql69uk6dOmV2WAAAAABwmOkJUqFChbR7925J0rFjxxQWFqaGDRta6yMjI+Xm5mZ2WAAAAABwmMPbfD+offv2GjNmjM6cOaMDBw4oZ86catasmbX+jz/+UMmSJc0OCwAAAAAOMz1BGj58uO7cuaPVq1ercOHCmjNnjry9vSXdWz3asmWL+vTpY3ZYAAAAAHCY6QlSlixZ9OGHH+rDDz+0q/Px8dH58+fNDgkAAAAApuBGsQAAAACQwOEVpM6dO8tisWjmzJlydnZW586dU+1jsVg0e/ZsR0MDAAAAgKkcTpA2bdokJycnxcfHy9nZWZs2bZLFYkmxT2r1AAAAAJAZHE6QwsPDU3wOAAAAAE8KrkECAAAAgAQkSAAAAACQwOFT7JycnNJ9TZHFYtHdu3cdDQ0AAAAApnI4QXr//ffZdAEAAADAf4LDCdKoUaNMmAYAAAAAZD6uQQIAAACABBmSIF26dEkDBgxQ2bJl5enpKU9PT5UtW1YDBgzQhQsXMiIkAAAAADjM9ATpwIEDKl++vKZMmaIcOXKodevWat26tXLkyKEpU6aoQoUKCgsLMzssAAAAADjM4WuQHvT2228rLi5Ou3btUvXq1W3qQkND1aRJE/Xq1UubN282OzQAAAAAOMT0FaTQ0FD16dPHLjmSpBo1aqhPnz7atWuX2WEBAAAAwGGmJ0h58uSRu7t7svXu7u7KkyeP2WEBAAAAwGGmJ0h9+/bVF198ofPnz9vVnT17Vl988YX69u1rdlgAAAAAcJjD1yBNmTLFrixbtmwKCAhQixYtFBAQIEk6evSoVqxYoYCAABmG4WhYAAAAADCdxXAwW3FySv8ilMViUVxcnCNhnygHDhxQYGCgwsLCVK5cuUybR8mulzMtNoD0+XtW7syeApDpvAf3yewpAEijqPHTMnsKpnF4BenkyZNmzAMAAAAAMp3DCZK/v78Z8wAAAACATGf6Jg0AAAAA8KQy/UaxRYsWlcViSbGNxWLR8ePHzQ4NAAAAAA4xPUEKDg62S5Di4uJ06tQp7dixQ4GBgapcubLZYQEAAADAYaYnSHPmzEm27s8//1SjRo3Uvn17s8MCAAAAgMMe6TVIFStWVPfu3TV48OBHGRYAAAAA0uSRb9Lg5+engwcPPuqwAAAAAJCqR5ogXblyRbNnz1bBggUfZVgAAAAASBPTr0F69tlnkyyPiorS4cOHdefOHc2fP9/ssAAAAADgMNMTpPj4eLtd7CwWi4oWLarnnntOnTt3VunSpc0OCwAAAAAOMz1B2rJli9lDAgAAAMAjYVqCdPv2bf3www86efKkcufOraZNmypfvnxmDQ8AAAAAGc6UBOnixYt65plndPLkSRmGIUny9PTUihUr9Nxzz5kRAgAAAAAynCm72H3wwQcKDw9Xv379tGrVKn388cfy8PBQ9+7dzRgeAAAAAB4JU1aQ1q1bp44dO2rSpEnWMj8/P7366qs6cuSISpUqZUYYAAAAAMhQpqwgnT59WrVq1bIpq1WrlgzD0IULF8wIAQAAAAAZzpQEKTY2Vu7u7jZlic/v3r1rRggAAAAAyHCm7WIXHh6uPXv2WJ9HR0dLko4ePSpvb2+79lWqVDErNAAAAACYwrQEacSIERoxYoRdec+ePW2eG4Yhi8WiuLg4s0IDAAAAgClMSZBCQkLMGAYAAAAAMpUpCdLrr79uxjAAAAAAkKlM2aQBAAAAAP4LSJAAAAAAIAEJEgAAAAAkIEECAAAAgAQkSAAAAACQgAQJAAAAABKQIAEAAABAAhIkAAAAAEhAggQAAAAACUiQAAAAACABCRIAAAAAJCBBAgAAAIAEJEgAAAAAkIAECQAAAAASPHEJUmxsrAYPHqz8+fPLw8NDQUFBWr9+fZr6njlzRm3atJG3t7eyZ8+uZs2a6cSJE0m2nT17tsqUKSN3d3eVKFFCn376qZmHAQAAAOAx9MQlSJ06ddKUKVPUvn17TZs2Tc7OzmrSpIm2b9+eYr8bN26oXr162rp1q4YNG6bRo0dr7969Cg4O1pUrV2zazpgxQ127dlW5cuX06aef6umnn1bv3r01fvz4jDw0AAAAAJksS2ZPID1CQ0O1ePFiTZw4UQMGDJAkdezYUYGBgRo0aJB+/fXXZPtOnz5dR48eVWhoqKpXry5Jaty4sQIDAzV58mR99NFHkqSYmBgNHz5cTZs21bJlyyRJb775puLj4/XBBx+oW7duypkzZwYfKQAAAIDM8EStIC1btkzOzs7q1q2btczd3V1dunTRzp07FRERkWLf6tWrW5MjSSpdurTq16+vpUuXWss2b96sK1euqGfPnjb93377bd28eVM//fSTiUcEAAAA4HHyRCVIe/fuVcmSJZU9e3ab8ho1akiS9u3bl2S/+Ph47d+/X9WqVbOrq1Gjho4fP67r169bY0iya1u1alU5OTlZ6wEAAAD89zxRp9idO3dO+fLlsytPLDt79myS/SIjIxUbG5tq31KlSuncuXNydnZWnjx5bNq5uroqV65cycZIdPHiRV26dMmm7ODBg5KkI0eOKC4uLsX+GSn26rVMiw0gffbvz556I+A/Lu7yldQbAXgs7N+/P7OnIGdnZxUvXlzu7u4OjfNEJUgxMTFyc3OzK098EWJiYpLtJylNfWNiYuTq6prkOO7u7snGSDR9+nSNHj06ybqWLVum2BcAElX8PrNnAABA2lX8+pvMnoIkKSwsTOXKlXNojCcqQfLw8FBsbKxd+e3bt631yfWTlKa+Hh4eunPnTpLj3L59O9kYiXr27KnWrVvblF27dk1///23ypcvn2SSBjysY8eOqXnz5lqxYoUCAgIyezoAAKSI31vIaMWLF3d4jCcqQcqXL5/OnDljV37u3DlJUv78+ZPs5+PjIzc3N2u7lPrmy5dPcXFxunjxos1pdnfu3NGVK1eSjZEoT548dqfnSdLTTz+dYj/AEQEBAQ7/tQQAgEeF31t4nD1RmzRUqlRJf//9t65ds72WZteuXdb6pDg5Oal8+fL6/fff7ep27dqlYsWKycvLy2aMB9v+/vvvio+PTzYGAAAAgCffE5UgtWrVSnFxcZo5c6a1LDY2ViEhIQoKClKhQoUkSadPn9bhw4ft+u7evdsm8Tly5Ig2bdpkc0rcs88+Kx8fH33xxRc2/b/44gt5enqqadOmGXFoAAAAAB4DT9QpdkFBQWrdurWGDh2qixcvKiAgQHPnzlV4eLhmz55tbdexY0dt3bpVhmFYy3r27KmvvvpKTZs21YABA+Ti4qIpU6bIz89P/fv3t7bz8PDQBx98oLffflutW7dWo0aN9Msvv2jBggX68MMP5ePj80iPGQAAAMCj80QlSJI0b948jRgxQvPnz9fVq1dVoUIFrVq1SnXq1Emxn5eXl7Zs2aJ+/fpp7Nixio+PV926dTV16lT5+vratO3Zs6dcXFw0efJkrVy5UoUKFdLUqVPVp0+fjDw0IN18fX01cuRIu/cwAACPI35v4UlgMe5fZgEAAACA/2FP1DVIAAAAAJCRSJAAAAAAIAEJEgAAAAAkIEECAAAAgAQkSMBjYNSoUbJYLJk9DQAAUsXvLPzXkSAB/6M2btyozp07q2TJkvL09FSxYsXUtWtXnTt3LrOnBgCAjW3btumll15SoUKF5O7urrx58+r555/Xjh07Mntq+A964u6DBMAcgwcPVmRkpFq3bq0SJUroxIkT+uyzz7Rq1Srt27dPefPmzewpAgAgSfr777/l5OSkHj16KG/evLp69aoWLFigOnXq6KefftLzzz+f2VPEfwgJEvA/asqUKapVq5acnP7/QvLzzz+v4OBgffbZZxo7dmwmzg4AgP+va9eu6tq1q01Zz549VaxYMX388cckSDAVp9gBj9j27dtVvXp1ubu7q3jx4poxY0amzKNOnTo2yVFimY+Pjw4dOpQpcwIAPF4el99ZSfH09JSvr6+ioqIyeyr4j2EFCXiE/vrrLzVs2FC+vr4aNWqU7t69q5EjR8rPzy9N/W/duqVbt26l2s7Z2Vk5c+ZM9/xu3LihGzduKHfu3OnuCwD4b3kcf2ddu3ZNd+7c0eXLlzVv3jyFhYVp2LBhaeoLpBUJEvAIvf/++zIMQ7/88osKFy4sSWrZsqXKly+fpv4TJkzQ6NGjU23n7++v8PDwdM/v448/1p07d9S2bdt09wUA/Lc8jr+z2rRpo7Vr10qSXF1d1b17d40YMSJNfYG0shiGYWT2JID/BXFxcfLy8lKzZs20aNEim7qmTZtq9erVSu3H8cSJEzpx4kSqsTw8PFSzZs10zW/btm2qX7++Xn75ZS1ZsiRdfQEA/y2P6++sffv26dKlS4qIiNDcuXNVvHhxffLJJ8qWLVua+gNpwQoS8IhcunRJMTExKlGihF1dqVKltHr16lTHKFasmIoVK2b63A4fPqwWLVooMDBQs2bNMn18AMCT5XH9nVWpUiXr/7/22muqUqWKOnXqpGXLlpkaB//bSJCAJ0jiNUKpcXZ2lq+vb5rGjIiIUMOGDZUjRw6tXr1aXl5ejk4TAIAM+Z11P1dXV7300ksaN26cYmJi5OHh8TDTBOyQIAGPiK+vrzw8PHT06FG7uiNHjqRpjEmTJpl6PveVK1fUsGFDxcbGauPGjcqXL1+a5gEA+G97HH9nJSUmJkaGYej69eskSDAN1yABj1CLFi20Zs0aHTlyxHrB66FDh1S+fHnFxcU90vO5b968qWeffVaHDh3S5s2bVbVq1bQfCADgP+9x+p118eJF5cmTx6YsKipKFSpUkCSdPn061ThAWpEgAY/Q/v37FRQUpDx58qhnz566e/euPv30U/n5+Wn//v2p/rIxU/PmzfXDDz+oc+fOqlevnk1dtmzZ1Lx580c2FwDA4+dx+p1VtWpVFSxY0Dqf06dPKyQkRGfPntWSJUvUqlWrRzYX/PeRIAGP2LZt2/Tuu+/qr7/+UsGCBTVo0CCdO3dOo0ePfqS/bIoUKaJTp04lWefI6Q4AgP+Ox+V31ueff67Fixfr8OHDioqKUs6cOfXUU09p4MCBql279iObB/43kCABAAAAQAKnzJ4AAAAAADwuSJAAAAAAIAEJEgAAAAAkIEECAAAAgAQkSAAAAACQgAQJAAAAABKQIAEAAABAAhIkAAAAAEhAggQAAAAACUiQAAAAACABCRIAAAAAJCBBAgAAAIAEJEgAAAAAkIAECQAAAAASkCABAAAAQAISJAAAAABIQIIEAAAAAAlIkAAAAAAgAQkSAAAAACQgQQIAAACABCRIAAAAAJCABAkAAAAAEpAgAQAAAEACEiQAAAAASECCBAAAAAAJSJAAAAAAIAEJEv7zRo0aJYvFYn3kz59fLVu21PHjx61tLBaLPvvss0ycZdKqVaumTp06pdimbt26slgs6tq1q11dRESEnJycZLFYtGXLlnTFXrp0qebMmZNkvFatWqVrrJQUKVJEAwYMMG28hzFhwoR0vz73i4iIUMuWLeXl5aUcOXLolVde0cWLF1Ptt2rVKlksFoWHh0uStmzZYvNevf/RqFEja79OnTqpWrVqaZrbqVOn1K5dO/n4+MjT01MVK1bUmjVrbNqsX79eNWvWVI4cOeTn56cWLVroyJEjdmN99dVXKlGihNzd3VW1alVt3LjRpn7Dhg1q27at/P395enpqcDAQH322WeKi4tLdn4//PCDLBaL3fHs3r1bb7zxhgICAuTp6alSpUpp9OjRun37drJj7d27V87OzsqdO7dd3Y4dO1SlShW5u7vLYrEkO0anTp1S/Zlz1MO+5zPyc+px+Dk0299//61Ro0YpKioqs6dimrS+jx+Uns8MAFKWzJ4A8CjkyJHD+qXwxIkTGjFihOrXr68DBw4oa9as2rlzp4oWLZrJs3x42bJl0/fff68vvvhCLi4u1vLFixcra9asunHjRrrHXLp0qS5fvpzhXxaXL1+uXLlyZWiM1EyYMEHvvPOO6tatm+6+d+/e1fPPPy/DMDRnzhzFx8dr6NChaty4sUJDQ+Xs7JzmsapUqaKdO3falJ0+fVpt27ZV48aN0z23iIgIPf3006pYsaJCQkKUNWtW7du3TzExMdY2f/zxh5o2barmzZtr5MiRun79usaMGaPnnntOBw4cUPbs2SVJixYtUo8ePTRq1CjVqlVLISEheuGFF7R7924FBgZKkmbOnKlbt25p7NixKlSokLZv367+/fvr5MmTmjx5st38bt++rX79+snPz8+ubsmSJTp+/LgGDx6sEiVKaP/+/RoxYoT279+v7777zq69YRh655135Ovrq7t379rVd+/eXXny5NHatWvl5uaW7tfSTA/7nn/SP6cetb///lujR49Wp06d5O3tndnTMcXj9D4G/stIkPA/IUuWLHrqqackSU899ZQKFy6s2rVra/Xq1WrdurW17kkVHBysX375RWvXrtULL7xgLV+8eLFeeuklLVy4MBNnl7LKlStn9hQc8u233+rw4cM6fPiwSpQoIUkqVaqUKlasqOXLl6drtS179ux278VffvlFTk5OatOmTbrnNnDgQBUvXlw//fSTnJzunTDw3HPP2c3fx8dHCxcuVJYs934llChRQhUrVtSOHTusidmoUaP0+uuva8SIEZLuvef27t2rcePGacGCBZKk6dOn26ze1K1bV7du3dLUqVP10Ucf2X2hmzhxogoUKKDixYsrLCzMpm7IkCF2Y7m7u6t79+46deqU/P39bdovWLBAFy5cUOfOnTVz5ky71+Lw4cPq1q2bgoOD0/4CmiwmJkYeHh4P/Z5/0j+n4LjH4X0M/C/gFDv8T6pataokWU9tevDUlcTTyBYuXKiAgABlz55djRs31j///GNtEx4eLovFoqVLl6p79+7KkSOHChYsqJEjRyo+Pt4mXlhYmJo2bSovLy95eXmpdevWOn/+vF2bmjVryt3dXWXKlNHKlSvTfDzu7u5q1qyZFi9ebC07evSo9uzZo1deecWu/bx581SrVi35+PgoZ86cqlevnn7//XdrfadOnfTdd99p6/9r78yjoriyP/5laUK3zdJsooCgRCGgGINKIjBAEBAZEARXGCEwOo7RaJBlgjggaJC4DuqgmByNCq4RGQfNBDSSiCDkiJqDIJOjiCgurAEDCHh/f2hXKLobGpL8PGPe55z+o95y+71XVbfq1rvvvoICzsUrMTGRJ6O/sRkMfV17pK4geXl5sLOzw7Bhw+Dk5ITy8nJePRUVFWzduhUrV66Enp4edHV1sWLFCjx9+pQrk5iYKNfdqvf5trCwQENDA9atW8f1dTDudlevXoW5uTlnHAGAnZ0djI2NkZuby6URERITE2FkZAQtLS0sWrQIP/7444DyDx8+DBcXF4wcOVIm79SpU7C2toampiacnJxw48YNLq+lpQUnT57EsmXLOONIHl1dXRCJRJxxBID72k5EAJ7PulZVVfGMNFVVVcyZMwdnz57l0uSN9aRJk9DR0YHGxkZeek1NDT755BP84x//kNsuRbIA4P79+7z01tZWxMbGYvPmzdDQ0ODlSd0We3p6sHLlSqioqPwqs6JXr16Fu7s7RCIRJBIJgoOD8fDhQy5fqh8yMzOxaNEi6OrqwtfXF4B8d7adO3fCzMwMw4YNg7+/P86dOydzLQ5FTwHPjc0JEyZALBbD1NQUwcHBMvpHGQbSG1K++eYbuLm5QSwWQ0dHB66urigrK+PypW6fBgYGEIlEsLOz433E6ejoQExMDMzMzPDaa69h4sSJOHPmDO8/pGOYnJwMY2NjiMViBAcHo6WlBcDz8y4d79GjR0NFRQUWFhYAgLq6OoSHh2PMmDEQCoUYN24c4uPjebpjMPr9+vXr8PX1ha6uLsRiMaZOnYq8vDwuv7GxEUuWLMHw4cOhqamJadOm4fLly4Ma+/6uY2XPS2+am5vx5z//GSNHjoSmpiZGjRqFxYsX88oo89xiMF5VmIHE+F0iNYyMjY0Vlrl8+TJ27tyJLVu2ICMjA1euXMGSJUtkysXExEAsFuPEiRMICQlBUlISTpw4weX/8MMPcHR0REdHBw4dOoT9+/ejvLwcvr6+3Atoe3s7vLy80NbWhqysLMTHx2PVqlWoqalRuk8LFixATk4O5z51+PBhODg4yHXJqa6uxqJFi3D8+HFkZWXBzMwMzs7OuHXrFgBg7dq1cHNzw6RJk1BUVISioiLeGidlx2ao1NTUIDo6GmvWrMHhw4fx6NEjzJs3jxsvKVu2bEFtbS0yMzMRHx+PjIwMrFmzZlD/lZ2dDR0dHURERHB9feuttwA8N9akL1WK6OjokHkpBwANDQ1UVFRwx2lpaUhKSsKSJUtw4sQJCIVCxMTE9Cu7qqoKZWVlWLBggUzenTt3EBkZibVr1yIrKwstLS3w8vLi1uhcuXIFXV1dUFFRgaOjIwQCAUxNTZGSksIbx5CQENy/fx+pqaloamrC3bt3ERkZCWtra7i7uwN4/tUaAKytrXlteOONN9DY2IjHjx8r7ENRURF0dXVhZGTES1+9ejXmzp3LjbUyFBUVQVVVFZaWlrz0pKQkvPHGG/D395ep09ttcfXq1SgqKuJmwYbK48ePudmxrKws7NixAwUFBfDw8OC9ZANAVFQUtLS0cPz4ccTFxcmVl52djRUrVsDPzw/Z2dmws7NDRESEUm1R5l589OgR4uLikJubi+3bt+PWrVt49913ZV70B2IgvQE8f5F3d3eHQCDA559/jqNHj8LZ2Rn37t3j2vLOO++gtLQUmzdvxunTpxEREYG7d+9yMoKCgrB//37ExcXh9OnTmDJlCvz8/HD16lVeew4fPoz8/Hzs3bsXW7duRW5uLqen3nrrLWzevBkAcPLkSRQVFSE7OxsAUF9fDz09PWzduhVffvkloqOjsW/fPqxYsUKmzwPp98rKSjg6OqKurg67d+9GdnY2AgICuP50dnZi+vTpyM/Px6ZNm3Dq1CkYGhpi+vTpPGNjIF3T33WszHnpS2RkJC5evIht27bhP//5Dz7++GPemiZlnlsMxisNMRivOAkJCaSvr09dXV3U1dVFN2/eJFdXV9LS0qL79+8TEREA2rFjB1fHxcWFtLW1qbGxkUvbtm0bAaCffvqJiIhu375NAOhPf/oT7/8mTpxI8+bN445DQkJo3Lhx1NnZyaVVVVWRqqoq/fvf/yYiol27dpG6ujrdvXuXK3Px4kUCQKGhof32z8XFhQIDA6mrq4v09fXp2LFjRERkY2ND27Zto++//54A0Ndffy23fk9PD3V1dZGVlRWtW7eOSw8MDCQXFxe5/zfQ2AwGc3NzWr16NXccGhpKampqVFVVxaVlZ2cTAKqoqODSAJCVlRX19PRwaevXryehUEgNDQ1E9PO570vf862vr08JCQky5cLDw8nS0rLf9qelpZGGhgbV19dzaffu3SM1NTUaO3YsERF1d3fTiBEjaOnSpby606dPJwB0+/ZtubLXrVtHAoGA64+U0NBQAkCFhYVcWnV1NampqVF6ejoREWVlZREA0tbWptjYWDp//jytXbuWVFVVadeuXTx5eXl5pKurSwAIAFlbW9OdO3e4/EOHDhEAampqkqkHgG7evCm3/eXl5aSpqSkztufOnSNtbW168OAB1x97e3u5MqTU1dWRoaGhzP1QWVlJQqGQrl+/TkTKn3NFhIaGDnjPxcbGko6ODrW0tHBpxcXFBICysrKI6Gf94O/vL1O/7zU/efJkmjlzJq/MX//6V5n7dih6qi/d3d1UW1tLAKigoEBhmwZCkd54++23yd7enp49eya33t/+9jcSiUSc7u1Lfn4+AaALFy7w0p2dnSkoKIjXXolEQq2trVzaoUOHSEVFhW7cuEFERKdPn+73/pLS1dVFmZmZ9Nprr3F6Wln9Pn/+fDIxMVE43p9++ikJBAKePuvq6qIxY8ZQVFQUl6aMriEa+DpWdF763mO2traUlpamUI4yzy0G41WGzSAxfhc0NDRAIBBAIBDAysoKt27dwtGjRzFixAiFdaZMmQKJRMId29jYAAD3JVSKp6cn79jGxobn4pKfn4+AgACoqqqiu7sb3d3dGD16NCwsLDg3iJKSEtjb28PU1JSr5+joKPPVvT/U1dURGBiII0eO4Pr166isrFS4bqWiogIBAQEYPnw41NTUIBAIcPPmTVRVVSn1XwONTU9PD9fX7u7uQX9xtLCw4LmsSeX3dR2aNWsWz31s9uzZaG9vl1nPMlQ+++wz/PDDD/2WWbhwITQ1NREREYGamhpUV1fjvffeAwCubXfv3kVdXR1mzZrFqzt79ux+ZR85cgSenp7Q09OTyTMyMsK0adO4Y3Nzc9jb26OkpATAz+5x3t7e2LhxI9zc3JCUlITQ0FCkpKRw9crLy7Fw4ULMnj0b+fn5yMnJgUQiwcyZM5VyAVREU1MTAgMDYWdnx5s56e7uxgcffIA1a9bIDc4gj6dPn2Lu3LkQi8XYtm0bL2/lypUICwvDhAkThtzWwVJSUgJPT08ugAUAODg4wMLCAhcvXuSV9fHx6VdWd3c3ysrK4Ofnx0vve6wIZfTU2bNnMW3aNOjo6EBdXZ3TM8re71IG0htPnjzB5cuXERoaqjDC2vnz5zFjxgyFujc/Px/GxsZwdHTk6RB3d3cZtzEPDw+IxWLuOCAgAESE0tLSfvtBRNi+fTtsbGwgFAohEAgQHByMzs5OmVn7gfT7+fPnMW/ePAiFQoX9sbe3x+jRo7m+AM/X8PXujzK6RhFD0edvvvkmNm3ahH/+859yyynz3GIwXmWYgcT4XaCjo4PS0lJ89913qK2tRXV19YBRwfpGPZK6UfUNMyyvXO8y9fX1SE1N5Qw06e/WrVucG8aDBw/kGkODMZAAYP78+Thz5gwyMjLg7Owsd91Ka2srPD09cffuXWzduhXffvstSktLMXHixH5DKPdmoLGRuthIfwUFBYPqh7Jj33d8pMd1dXWD+r9fgr6+PrKyslBcXAxzc3OMHj0aIpEIM2fO5Fw4pa40itorj2vXrqGiokKue52iukZGRlzfpS/Nbm5uvDLvvvsuamtrOeNn7dq1GDt2LD777DO4u7vDz88Pubm5uH37Nj799FOeLOn6DilNTU28fCkdHR2YNWsWOjs78a9//Yvngrh37160tLQgLCwMzc3NaG5uxtOnT9HT04Pm5mZ0dXXxZBERFi1ahPLycpw5c4b3X2fPnkVhYSEiIyM5WR0dHSAiNDc3o7OzU+7Y/VLq6urkGnfDhw+XWWs1kBFYX1+Pnp4eGBoa8tL7HitioHultLQUfn5+MDU1xcGDB1FUVITi4mJeGWVQRm80NTWBiPr98NTQ0NBvfn19PR48eCCjLxMTE3lueIDsPSASiSAWiwe8/7dv346oqCgEBAQgJycHJSUl2LVrF4DB63dl+lNcXCzTn3379sn0ZygMVZ/v3LkT/v7+SEpKgpWVFcaOHctbw6rMc4vBeJVhUewYvwvU1dVf2h4Qenp6CAgIkLtPkXQhurGxMbfOozfK7KXTGxcXF0gkEqSnp3MP/L4UFRWhtrYWeXl5vDUlfV9+fwl79uxBa2srd2xlZfWrye5N3/GRHktfWDQ1NWXWhEhf6n9NfHx8UFtbi6qqKmhra8PU1BTjx4/nIgpKDSVF7ZXHkSNHIBQKZWad+qv76NEj2NraAni+PgiAzOyd9Fg6u1VZWSljREkkEpibm3N7hUmvk8rKSl70uMrKSujp6fFe5nt6erBw4ULcuHEDhYWFMgbCzZs3UVtbK9dwkEgkOHjwIEJCQri0VatWIScnR+Z6lcpqa2vjzTb2lpWcnIz4+HiZvF/KiBEj5I7/w4cPuQAwUgbaq8bAwABqamoy67j6W9c1GLKzs2FoaIijR49ybblz586g5SijNyQSCVRVVfs1UPT19fvN19PTg4mJCU6dOjVgm/qeg59++gltbW39GizA88iNQUFB2LBhA5fWO8DJYFCmP5MnT0Z6erpM3q8Rpnuo+lxXVxdpaWlIS0vD9evX8cknnyA4OBh2dnawsbFR6rnFYLzKMAOJwfiNke63ZG9vr/BlacqUKcjMzERtbS3n/lJYWDhoA0lVVRVxcXHIz89XGF5aGsSh98P50qVLqK6u5r3c9f1SOhh+K4OoLzk5OUhJSeFe9k+ePAmhUMjty2NqaorW1lbcu3cPJiYmAICvvvpKRs4v6asUdXV1zr2poKAAlZWV3GJuMzMzGBsbIycnBzNmzODqnDx5UqG8I0eOwNfXl+dC1JtHjx7h0qVLnJtdTU0Nrly5wrn3WVhYwNbWFufPn8fSpUu5eufOnYOlpSUn19zcnBdhDHj+Vby6uppbND5mzBiMGzcOx48f5zasffbsGY4fPy4zE7ts2TJ8+eWXyM/Pl3sdLF++XCaYwsaNG3H79m3s2bOHM+wAICUlBTt37sSxY8fg5OQkIysoKAhvvvkmL23//v3Izs5GTk7Ob7ZnkIODA9LT09Ha2gotLS0Az2dqqqur5bazP9TV1TFp0iTk5OTgL3/5C5c+mCiW/dHe3g6BQMDTPZmZmUOSA/SvN4YNGwYHBwccOHAAy5cvl6vv3N3dkZaWhocPH8o1kt3d3bFlyxaIxWIZg7gveXl5aGtr467l7Oxs3qbDimae29vbZYyToYyJtL3Hjh3Dhg0boKmpKTf/q6++wqhRowbtEaAMyurz/rCzs8OmTZuQmZmJyspK2NjYKPXcYjBeZZiBxGD8xiQmJmLq1Knw8fFBeHg4DAwMcO/ePeTl5SEsLAyurq547733sH79evj4+CAxMRHt7e1Yu3btkL7ULV++HMuXL1eY//bbb0MsFmPx4sWIiYlBbW0tEhMTOQNCirW1NXJycnDq1CmYmppi5MiRcl32Xiatra2YM2cOFi9ejPLyciQnJ+P999/n1uzMmDEDQqEQ4eHh3Ialu3fvlpFjbW2N3NxczJgxA2KxGFZWVtDS0kJERAQKCgoGXBsQHR0NR0dHiMVilJSUYMOGDYiPj+de8NTU1BATE4OoqCgYGBjA2dkZX3zxBS/KXW+Ki4tRXV0ts96mNwYGBggJCcH69eshFAqRkJAAIyMjXgjr5ORkBAYGIjo6Gp6enrhw4QIOHjyIAwcOcGWWLl0Kf39/hIWFYcGCBXjy5AlSU1OhoaGB4OBgrlxiYiJCQkJgYWEBR0dHfP755/jvf//LC8/88ccfIyMjAx999BFUVVU5Vy7g+doNbW1tvP7663j99dd5fdm/fz/q6+t5G/VmZWUhLi4OYWFhMDEx4cmytLSEoaEhTE1Neev2gOdR1AQCwZA2/VWWyMhIpKenw8vLC7GxsWhra+NCaQcGBg5a3kcffYTAwEAsX74cfn5+KCws5ELE9xeiXRk8PDywfft2rFq1Cr6+vrh06RK3b9VgUFZvbNy4EdOnT4e3tzeWLFnCbcQ9efJk/PGPf8SHH36IAwcOwNnZGWvWrIGZmRkqKirw5MkTxMTEwMPDA15eXvDw8EBsbCxsbW3x448/4urVq+jo6OCtnxMKhfDx8UF0dDTq6uoQHR2NgIAA7kOF1EDfs2cP5s+fD5FIhAkTJsDDwwNpaWlwcHCApaUlMjMzh7z+JyEhAVOmTMEf/vAHrF69Gvr6+igrK4O+vj7Cw8OxaNEi7N69G66uroiKisKYMWPQ0NCAkpISGBsb48MPPwQApXXNUM9LX5ycnBAQEIDx48dDRUUFe/fuxbBhwzB16lQAyj23GIxXmpcWHoLB+H9CUVSr3kBOdKjAwEBema+//poA0Pfff09EP0c5On36NK+cvIhcFRUVFBgYSBKJhDQ1NcnS0pKWLFnCi1p37do1euedd0hDQ4PGjRtH2dnZZG9vr3QUO0XIi2J39uxZsrW1JU1NTZowYQLl5ubKyHn8+DH5+/uTRCIhAFwkMmXGZjDIi2LXd/zkjTUA2rJlC73//vukq6tL2tratGzZMuro6ODVPXPmDNnY2JBQKCQnJye6ceOGzPn+7rvvyMHBgUQiEW+sQkNDydzcfMA+zJkzhwwNDUlDQ4PGjx9PGRkZMmWePXtG8fHxZGBgQGKxmBYuXEiZmZlyo2ytXLmSdHR0ZPrSd4y++OILGjt2LGloaNC0adPkjv/BgwfJ2tqaBAIBWVpaclHuenP06FGaPHkyaWlpkaGhIXl7e1NZWZlMuYyMDLK0tCQNDQ2aNGkS5efn8/JdXFy4SHh9f4qiKPbuT980RbL27dunUNb/RxQ7IqIrV66Qm5sbCYVC0tHRoQULFnBR+YgU6wci+RHj0tLSyMTEhIRCIXl7e9OxY8cIAO88DEVPERGlpqaSqakpiUQicnd3p6qqKhlZykSxU0ZvEBFduHCBnJ2dubFxdXXl9aO6uprmzp1Lurq6JBQKyc7Ojg4fPszld3R00N///neytLQkgUBAw4cPJy8vL170NHNzc4qMjKSEhAQyMjIikUhE8+fPl4m0uHnzZho1ahSpqalx93JrayuFhYWRRCIhiURCERERXMS7oej3a9eukbe3N4nFYhKLxTR16lTevdHc3EwffPABmZqakkAgIBMTEwoICKCLFy/y5Cqja+Rdx8qcl77tjoqKovHjx5NYLObO0TfffMOTq8xzi8F4VVEhYgHtGQzG/x4qKirYsWNHv7NlDMZgkc7A7d+//6W2Y/369diwYQMaGxsVRkj7PWNhYYGgoCBuryMGg8H4NWEudgwGg8FgvEQeP36MlJQUuLm5QSQS4dtvv0VqaioiIiKYccRgMBgvAWYgMRgMBoPxEtHQ0EBlZSUOHDiAlpYWjBgxAitXrkRycvLLbhqDwWD8LmEGEoPB+J+EeQczXhV0dHRw5syZl92M/ymqq6tfdhMYDMYrDFuDxGAwGAwGg8FgMBgv+GXxQxkMBoPBYDAYDAbjFYIZSAwGg8FgMBgMBoPxAmYgMRgMBoPBYDAYDMYLmIHEYDAYDAaDwWAwGC9gBhKDwWAwGAwGg8FgvIAZSAwGg8FgMBgMBoPxAmYgMRgMBoPBYDAYDMYLmIHEYDAYDAaDwWAwGC9gBhKDwWAwGAwGg8FgvOD/ACm2LqN4TBIfAAAAAElFTkSuQmCC",
      "text/plain": [
       "NON-CERTIFYING SIDE24 coefficient display; pinned public input."
      ]
     }
    }
   ],
   "source": [
    "try:\n",
    "    import matplotlib.pyplot as plt\n",
    "except ImportError:\n",
    "    print(\"Matplotlib is unavailable. The verified exact table above is complete.\")\n",
    "else:\n",
    "    dimensions = [\"d = \" + row[\"dimension\"] for row in rows]\n",
    "    approximate_midpoints = [float(row[\"display_midpoint\"]) for row in rows]\n",
    "    fig, ax = plt.subplots(figsize=(7, 4.5))\n",
    "    bars = ax.bar(dimensions, approximate_midpoints, color=[\"#2563eb\", \"#0f766e\"], width=0.55)\n",
    "    ax.set_ylim(0, max(approximate_midpoints) * 1.25)\n",
    "    ax.set_ylabel(\"Published coefficient (approximate midpoint)\")\n",
    "    ax.set_title(\"SIDE24 coefficients: NON-CERTIFYING display\")\n",
    "    ax.spines[[\"top\", \"right\"]].set_visible(False)\n",
    "    ax.grid(axis=\"y\", alpha=0.2)\n",
    "    ax.set_axisbelow(True)\n",
    "    for bar, value in zip(bars, approximate_midpoints):\n",
    "        ax.text(bar.get_x() + bar.get_width() / 2, value + 0.0015,\n",
    "                format(value, \".8f\"), ha=\"center\")\n",
    "    fig.text(0.5, 0.025, \"Pinned Math- input: \" + SOURCE_COMMIT[:12] + \" | original acceptance: false\",\n",
    "             ha=\"center\", fontsize=9)\n",
    "    fig.tight_layout(rect=(0, 0.06, 1, 1))\n",
    "    plt.show()\n"
   ]
  },
  {
   "cell_type": "markdown",
   "id": "reproduction",
   "metadata": {},
   "source": [
    "## Reproduction and contribution boundary\n",
    "\n",
    "The fetch cell refuses missing, changed, oversized, or differently hashed input. It never substitutes current `main`, another JSON file, or generated samples. Retain the pinned URL and expected digest when sharing the notebook.\n",
    "\n",
    "Submit new results through the [public contribution process](https://github.com/d6g8k5htny-coder/main/blob/main/CONTRIBUTING.md). A chart or successful run is review material, not permission to edit `STATUS.md`, `PROOF_INDEX.md`, `claims/`, or `lemma_closed`.\n"
   ]
  }
 ],
 "metadata": {
  "kernelspec": {
   "display_name": "Python 3",
   "language": "python",
   "name": "python3"
  },
  "language_info": {
   "name": "python",
   "version": "3.12.14"
  },
  "colab": {
   "provenance": []
  },
  "source_replay": {
   "mode": "local public Git bytes injected into the fetch boundary",
   "repository": "d6g8k5htny-coder/Math-",
   "commit": "9d7b6802424fb4715b31999066aafca8ee2f3cca",
   "path": "coefficients/side24_v1/ENCLOSURE.json",
   "sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811",
   "scientific_effect": "NONE",
   "python_version": "3.12.14",
   "matplotlib_version": "3.10.8"
  }
 },
 "nbformat": 4,
 "nbformat_minor": 5
}
", "https://raw.githubusercontent.com/d6g8k5htny-coder/main/71400b94f6cb354a8cf7aba73ffede2138a64efa/incoming/side24-identity-replay-20260926/RESULT.md": "IyBQdWJsaWMgaW50YWtlIHNvdXJjZS1pZGVudGl0eSByZXBsYXkKClNjaWVudGlmaWMgZWZmZWN0OiAqKk5PTkUqKi4gUmV2aWV3IHN0YXR1czogKipSRVZJRVdfUkVRVUlSRUQqKi4KClRoaXMgcGFja2FnZSBleGVyY2lzZXMgdGhlIG5ldyBwdWJsaWMtaW50YWtlIGxhbmUgdXNpbmcgYWxyZWFkeSBwdWJsaWMgU0lERTI0IGJ5dGVzLiBTb3VyY2U6IE1hdGgtIGNvbW1pdCBgOWQ3YjY4MDI0MjRmYjQ3MTViMzE5OTkwNjZhYWZjYThlZTJmM2NjYWAsIGBjb2VmZmljaWVudHMvc2lkZTI0X3YxL0VOQ0xPU1VSRS5qc29uYC4KCk1ldGhvZDogcmVhZCB0aGUgZXhhY3QgcHVibGljIEdpdCBieXRlcywgY2hlY2sgMTA5MCBieXRlcyBhbmQgU0hBLTI1NiBgNzJiNmNkOTJkMzEzOTRjZGFmNWRhODkxOWE1ZDU0OGU5MDIyMjhhZjFmMDk1Y2MxODQxNThhNzFkODI4NzgxMWAsIHBhcnNlIEpTT04sIGFuZCBjb3B5IG9ubHkgdGhlIGV4YWN0IGVuZHBvaW50IHN0cmluZ3MgYW5kIG9yaWdpbmFsIGFjY2VwdGFuY2UgZmxhZyB0byBvdXRwdXQuanNvbi4gUHl0aG9uIHN0YW5kYXJkIGxpYnJhcnkgaGFzaGxpYi9qc29uOyBubyBudW1lcmljYWwgcmVjb21wdXRhdGlvbiBvciBmaWVsZCBzaW11bGF0aW9uLgoKUmVzdWx0OiBzb3VyY2UgaWRlbnRpdHkgbWF0Y2hlZC4gQm90aCBleGFjdCBpbnRlcnZhbHMgcmV0YWluIGRpc3RpbmN0IHN0cmluZyBlbmRwb2ludHMgYW5kIHNjaWVudGlmaWNfYWNjZXB0YW5jZSByZW1haW5zIGZhbHNlLiBUaGlzIGVzdGFibGlzaGVzIGEgcGFja2FnaW5nIGFuZCBpZGVudGl0eSByZXBsYXkgb25seTsgaXQgaXMgbm90IGFuIGFuYWx5dGljIHJldmlldywgYSBib3VuZCwgb3IgYWRvcHRpb24gb2YgdGhlIHNvdXJjZS4KCkF1dGhvcnNoaXAvZXhwb3N1cmU6IE9wZW5BSS9Db2RleCwgc291cmNlLWV4cG9zZWQuIFplcm8gb3JnYW5pemF0aW9uYWwtaW5kZXBlbmRlbmNlIGNyZWRpdC4gVGhlIGxpdmUgZ3VhcmQgZXhlcmNpc2UgdXNlcyBhIHNhbWUtcmVwb3NpdG9yeSBpbmNvbWluZy1wYXRoIFBSLCBub3QgYW4gZXh0ZXJuYWwgY29udHJpYnV0b3IgYWNjb3VudC4gSXQgZG9lcyBub3QgZGVtb25zdHJhdGUgaW5zdGFsbGVkIGJyYW5jaCBwcm90ZWN0aW9uLgo=", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md": "# Uniform matrix-cap selection and unrestricted short-lifetime asymptotics

**Object:** UNIFORM-MATRIX-CAP-LIFETIME-20260924-v1.  
**Author:** OpenAI / ChatGPT, 24 September 2026.  
**Disposition:** author-side mathematical candidate; no nonauthor acceptance, formal verification, numerical finite-band certificate, or program-level closure is asserted.

This is an additive continuation of MARKED-CYLINDER-CAP-20260924-v1, SHA256 `0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc`, reproduced unchanged in `sources/`. It addresses the matrix-probability, angular-uniformity, compact-mark, and lifetime-composition interfaces of campaign #61. It does **not** extend the predecessor's numerical constants to new parameters. Instead it derives new, non-numerically-evaluated constants by a uniform Gaussian argument.

## 1. Model, convention, and the three theorems

Fix a dimension d >= 2 and a side length L > 0. On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance

    K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)
             / sum_{n in Z^d} exp(-|Ln|^2/2).

In particular d=3, L=24 is an actual three-dimensional SIDE24 application. No replacement by a nonperiodic covariance is made. Fix compact intervals B=[b_-,b_+] and K=[k_-,k_+] with 0<k_-<=k_+<infinity. Unless stated otherwise, constants may depend on d,L,B,K. They do not depend on radius, birth within B, gap mark within K, or orientation.

Let R be an orthonormal frame, with axial unit vector u=R e_1. For sufficiently small r>0, use the embedded local cylinder centered at the origin with pins

    M=-(r/2)u,     S=(r/2)u,
    f(M)=b,        f(S)=s=b-k r^3,
    grad f(M)=grad f(S)=0.

Q_{r,b,k,R} is the continuous Gaussian regression law at these 2(d+1) observations, not a conditioning on a positive-probability event. A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue. Set

    W_r = |det H_M det H_S| 1{H_M<0, index(H_S)=d-1},
    Z_r = E_Q W_r,       dQ^W = (W_r/Z_r)dQ.

The index counts negative eigenvalues. The FULL normalizer Z_r has no extra pin-density, coordinate Jacobian, or adjacency condition. Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S.

**Theorem A (uniform selection candidate).** There exist r_*>0 and C<infinity such that, for all 0<r<=r_*, b in B, k in K, and all orthonormal frames,

    0 <= 1-p_r(b,k,R) <= C r^3.                         (1.1)

The proof includes a positive full-normalizer lower bound Z_r>=z_* r^2 and the full transverse-matrix boundary layer, including simultaneous small transverse eigenvalues. It does not presume isotropy under arbitrary rotations of the torus.

**Theorem B (compact-mark density candidate).** Suppose B and K have positive lengths. Count ordered maximum/saddle pairs with 0<distance<=r_*, birth in B, and scaled gap (f(M)-f(S))/distance^3 in K. 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. These densities admit versions with

    nu_cand(ell) ~ c_{B,K} ell^(-1/3),
    nu_eld (ell) ~ c_{B,K} ell^(-1/3),       c_{B,K}>0,
    0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),    (1.2)

as ell decreases to zero. An exact finite-dimensional Gaussian integral for c_{B,K} appears in Section 11.

Theorem B is a COMPACT MARK WINDOW result, especially its quantitative difference estimate. Theorem C below separately removes the mark and distance restrictions for the LEADING asymptotic. There is no stated numerical value of C, r_*, z_*, or c_{B,K}, and no claim that r_*=1/20. The new asymptotic normalizer proof does not replace or re-certify the historical H3 finite-band floor.

**Theorem C (unrestricted finite-lifetime leading density candidate).** For the same fixed torus and dimension, let nu_cand^all(ell) count ALL ordered maximum/index-(d-1)-saddle pairs with height difference ell>0, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume. There is a positive finite constant c_{d,L} such that

    nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),
    nu_eld^all(ell)  ~ c_{d,L} ell^(-1/3).                (1.3)

All birth heights, all positive scaled-gap marks and all spatial separations on the torus are included in (1.3). The essential global-maximum class is excluded from the finite-lifetime count. The constant is an explicitly identified finite Gaussian/angular integral, with the birth and gap integrals analytically eliminated in Section 15. No elementary closed form or numerical enclosure is claimed. Crucially, the compact-window O(ell^(2/3)) DIFFERENCE estimate in (1.2) is not asserted for the unrestricted densities. Theorem C has a separate domination and off-diagonal proof, not a change of label on Theorem B.

## 2. Positive Fourier spectrum and finite-jet rank

Poisson summation gives

    K_L(z)=sum_{n in Z^d} a_n exp(2 pi i n.z/L),
    a_n=exp(-2 pi^2 |n|^2/L^2) / sum_j exp(-2 pi^2 |j|^2/L^2)>0.

Thus every Fourier mode has positive variance, and sum_n sqrt(a_n)(1+|n|)^q is finite for every q. A real sine/cosine expansion therefore converges in every C^q norm in every finite L^p norm. In particular the field has a smooth version and all finite moments of its global derivative suprema exist.

Any finite list of distinct derivative evaluation functionals at distinct sites is linearly independent. Indeed a vanishing-variance linear combination must annihilate every Fourier mode because every a_n is positive. As a distribution it is a finite sum of derivatives of point masses with every Fourier coefficient zero, so it is zero. Smooth test functions supported at one site and with arbitrarily prescribed finite jets show that every coefficient is zero. At one site in a rotated frame the same assertion also follows from a polynomial P(R^T n) vanishing on all n in Z^d: the invertible rotation reduces this to a polynomial vanishing on the full integer lattice, hence the polynomial is zero.

Only lists without repeated derivative functionals are called distinct. A Hessian is parametrized by its independent symmetric entries, not by d^2 allegedly independent entries.

These arguments justify positive covariance for the original pins at each pair of distinct points and for every residual jet list modulo the pins used below. They also explain why finitely many observed modes or a numerically positive sampled covariance would not suffice for this proof.

## 3. An exact nonsingular contact frame for all orientations

Write x for the axial coordinate and y_1,...,y_m for the transverse coordinates, m=d-1. On the line y=0 set a=-r/2, c=r/2. Order the original observations as

    O_r=(f(a), f_x(a), f(c), f_x(c),
         f_y1(a),f_y1(c), ..., f_ym(a),f_ym(c)).

This is a permutation and orthogonal re-expression of the specified physical pins. Define U_r=T_r O_r by four axial rows

    U0 = (f(a)+f(c))/2,
    U1 = (f(c)-f(a))/r,
    U2 = (f_x(c)-f_x(a))/r,
    U3 = (6/r^2)[f_x(a)+f_x(c)-2(f(c)-f(a))/r],           (3.1)

and, for every transverse direction j, two rows

    Vj0=(f_yj(a)+f_yj(c))/2,
    Vj1=(f_yj(c)-f_yj(a))/r.

The transformation is invertible for r>0 and has exact absolute determinant

    |det T_r| = (12/r^4)(1/r)^m = 12 r^(-(d+3)).          (3.2)

The prescribed target becomes exactly

    v_r=(b-k r^3/2, -k r^2, 0, 12k, 0,...,0).            (3.3)

This is not an approximate transformation, and the factor 12 in (3.2) is retained in the lifetime ledger.

Taylor formulas with integral remainders give mean-square convergence, uniformly over frames, of U_r to the contact jet

    U0*=(f, f_x, f_xx, f_xxx,
          f_y1,f_xy1,...,f_ym,f_xym) at 0.                (3.4)

The potentially dangerous U3 cancellation is an averaged third derivative, not a subtraction of uncontrolled random values. Uniform convergence of its covariances, and of cross-covariances with any fixed finite derivative order, follows either from those integral formulas or from the rapidly summable Fourier series. The target v_r converges uniformly on B x K to v_0=(b,0,0,12k,0,...,0).

The functionals in (3.4) are distinct. Hence their covariance Sigma_0(R) is positive definite by Section 2. Its entries are continuous in R. The orthogonal group is compact, so its least eigenvalue has a positive uniform minimum. Consequently Sigma_r(R) remains uniformly positive definite for all sufficiently small r; Sigma_r and Sigma_r^{-1} converge uniformly.

This compactness argument establishes existence, not an evaluated interval enclosure. It never equates Sigma_r at different orientations. Full torus rotational invariance is neither assumed nor true in general.

Let A_r=D_y^2 f(M), represented by its m(m+1)/2 independent entries. Append these entries to U_r. At r=0 the extra functionals are f_yi_yj, i<=j; none duplicates a functional in (3.4). The enlarged covariance is therefore uniformly positive definite at contact and for small r. Its Schur complement shows that the Q-law of A_r has covariance uniformly bounded above and uniformly bounded away from zero. Its mean is uniformly bounded. In symmetric-matrix Lebesgue coordinates it has a density satisfying

    density_Q(A) <= C_0 exp(-c_0 ||A||_F^2),              (3.5)

for fixed positive C_0,c_0. This remains valid after any change of eigenvector orientation. Orthogonal invariance of the density is not required.

## 4. Uniform conditional derivative moments and the independent residual

Because Sigma_r^{-1} and v_r are uniformly bounded, the regression energy v_r^T Sigma_r^{-1}v_r is uniformly bounded. For each unconditioned standardized Fourier coefficient xi, covariance Cauchy-Schwarz bounds its conditional mean by the square root of this energy, and its conditional centered variance by one. Minkowski's inequality and the summable Fourier coefficients then give, for every finite p and derivative order q,

    sup_{r,b,k,R} || ||f||_{C^q(X)} ||_{L^p(Q)} < infinity. (4.1)

The same proof applies to a centered residual after further conditioning on A_r. Write, in one full-field Gaussian coupling,

    f(z)=mu_r(z)+B_r(z).(A_r-E_Q A_r)+g_r(z),             (4.2)

where g_r is jointly independent of the entire symmetric matrix A_r. The regression coefficient B_r and its derivatives through order four are uniformly bounded, by the uniform inverse covariance from Section 3 and bounded derivative cross-covariances. The residual has uniformly bounded C^4 moments of every finite order.

Independence in (4.2) is not asserted separately for Hessian entries, endpoint variables, or sampled derivative maxima. All residual evaluations are orthogonal to A_r; Gaussian independence on a countable dense collection and continuity give independence of the random smooth field. The residual's internal correlations are retained.

Let J_r=1+||g_r||_{C^4(X)}, with a fixed coordinate norm. The partial-block operator norms of the cap theorem differ from this coordinate norm by finite constants depending only on d. Hence, for M3,M4 on the local cylinder,

    M3 <= K_0(J_r+||A_r||_F),
    M4 <= K_0(J_r+||A_r||_F),
    J_r >= 1,  J_r independent of A_r,
    sup ||J_r||_p < infinity for every finite p.           (4.3)

No inverse Hessian moment is used. Gaussian pin covariance and random field Hessians are different objects.

## 5. Endpoint identities and the actual full normalizer

For either pin i in {M,S}, put

    alpha_i=f_xx(i)/r,    beta_i=grad_y f_x(i)/r,
    A_i=D_y^2 f(i),
    H_i=[[r alpha_i, r beta_i^T], [r beta_i,A_i]].

The two gradient pins imply the vector and scalar average bounds

    |alpha_i| <= M3/2,         ||beta_i|| <= M3/2,
    ||A_S-A_M||_op <= r M3.                               (5.1)

For example integral_a^c f_xx=0; subtract this average at an endpoint and integrate the M3-Lipschitz bound. For beta use the average of grad_y f_x and its vector derivative. This does not invoke a simultaneous vector Rolle zero.

The exact height identity gives a weighted mean of f_xxx equal to 12k on [a,c]. Variation of f_xxx over that interval is at most rM4. The same average calculation yields

    |alpha_M+6k| <= r M4/2,
    |alpha_S-6k| <= r M4/2.                               (5.2)

The block determinant identity, valid even when alpha_i or A_i is zero, is

    det H_i/r = alpha_i det A_i
                -r beta_i^T adj(A_i) beta_i.              (5.3)

By (4.1),(5.1), det H_i/r and W_r/r^2 have uniformly bounded moments of every finite order.

Let A_0 be D_y^2 f(0) under regression on U0*=v_0. Its law is a full-support nondegenerate Gaussian on symmetric matrices. Finite-dimensional Gaussian regression gives uniform convergence of the means and covariances of A_M to those of A_0. Equations (5.1),(5.2) imply that the congruence-scaled endpoint Hessians converge, in probability uniformly over parameters, to

    diag(-6k,A_0) at M,        diag(6k,A_0) at S.

Here the congruence uses diag(sqrt(r),I), so its off-diagonal entries are sqrt(r) beta_i. The limiting matrices are nonsingular almost surely. This follows from the full matrix density and k>=k_->0. Thus the type indicator converges to 1{A_0<0}. Uniform integrability from (5.3) gives

    Z_r/r^2 -> z_0(b,k,R)
       := (6k)^2 E[det(A_0)^2 1{A_0<0}],                 (5.4)

uniformly on the compact parameter set.

For completeness, uniformity can be checked by a subsequence argument: any allegedly bad sequence of parameters has a convergent subsequence; continuous Gaussian means/covariances, (5.2), and uniform integrability give the stated limit on that subsequence. The discontinuity set of the type indicator has Gaussian probability zero. Equation (3.5) supplies a common integrable majorant.

The right side of (5.4) is continuous and strictly positive: the Gaussian law has positive density on an open negative-definite matrix ball. Compactness therefore yields

    0<z_*<=Z_r/r^2<=z^*<infinity                         (5.5)

after reducing r_* if needed. This is a proof of a full asymptotic normalizer floor, not the historical numerical floor 17/10, and it involves neither an added pin density nor a restricted good-event normalization.

## 6. The double soft-eigenvalue factor in the typed weight

Write m=d-1. On the maximum support let B=-A_M>0, with eigenvalues

    0<lambda_1<=...<=lambda_m=Lambda.

Let h=M3. Since H_M<0, alpha_M<0 and the negative transverse Schur complement is

    B - (r/(-alpha_M)) beta_M beta_M^T >0.

Determinant monotonicity on positive-definite matrices therefore gives

    |det H_M| <= r (h/2) det B.                           (6.1)

This is a canceled-pivot bound: no estimate of 1/alpha_M is taken.

From ||A_S+B||<=rh, the ordered singular values of A_S are at most lambda_j+rh. The adjugate norm is at most the product of the largest m-1 such bounds. With the empty product equal to one when m=1, (5.3) gives

    |det H_S| <= r(h/2) [lambda_1+(3/2)rh]
                         product_{j=2}^m(lambda_j+rh).

Hence the actual typed weight satisfies

    W_r <= (r^2 h^2/4) lambda_1[lambda_1+(3/2)rh]
                    product_{j=2}^m lambda_j(lambda_j+rh). (6.2)

The second soft factor includes the saddle mixed-square term. Omitting it, or replacing it by an unrelated order-one factor, changes the radius power. No Gaussian-entry independence is needed for (6.2).

## 7. Full matrix boundary-layer integration, including corank intersections

By the predecessor's deterministic marked-cylinder theorem, pairing and the one-branch conclusion hold on

    G_r={lambda_min(-A_M)>[4/(3k)]rM3^2,
                                      rM4<=3k/10}.

On typed support A_M<0 automatically. It suffices to control G_r^c directly, not infer a converse from a local path-event bound.

First suppose m>=2. In (4.3) absorb sqrt(m) into K and set U=J_r+Lambda>=1. Then h<=KU. Failure of the depth condition is contained in

    0<lambda_1<=D r U^2,       D=4K^2/(3k_-).             (7.1)

Unlike a scalar strip argument, this width may depend on the largest eigenvalue. That dependence is retained in the integral. J_r, but not the eigenvalues within B, is independent of B.

Symmetric-matrix eigenvalue coordinates have volume factor equal to a fixed constant times product_{i<j}|lambda_j-lambda_i| times angular volume. One way to see the factor is to differentiate B=O diag(lambda) O^T: an infinitesimal rotation in the ij plane changes the off-diagonal coordinate by (lambda_j-lambda_i) times that angular increment. The angular space is compact; repeated-eigenvalue strata are Lebesgue null. Its finite multiplicity is absorbed into the constant. This is a change of variables for Lebesgue measure, **not a claim that the conditional matrix is GOE**.

Using (3.5), angular integration, and 0<=lambda_i<=Lambda, the resulting eigenvalue measure is bounded by

    C exp(-c sum lambda_i^2) Lambda^[m(m-1)/2]
                     d lambda_1 ... d lambda_m.          (7.2)

In (6.2), with r<=1, all factors other than lambda_1[lambda_1+(3/2)rh] are bounded by C r^2 U^(2m). Condition on J_r and lambda_2,...,lambda_m. Extend the positive majorant's lambda_1 integration from the actual interval to [0,DrU^2]. Then

    integral lambda_1(lambda_1+E rU) d lambda_1
       = r^3[(D^3/3)U^6+(ED^2/2)U^5]
       <= C r^3 U^6.                                    (7.3)

The Gaussian factor involving lambda_1 can be dropped for this upper bound. Equations (6.2),(7.2),(7.3) give

    E_Q[W_r 1{depth failure}] <= C r^5 E integral
       (J_r+Lambda)^(2m+6) Lambda^[m(m-1)/2]
       exp(-c sum_{j=2}^m lambda_j^2)
       d lambda_2 ... d lambda_m <= C' r^5.              (7.4)

The last integral is finite by Gaussian polynomial integrability and the uniform moment of J_r of order 2m+6. All lambda_2,...,lambda_m are integrated over their ordered positive domain. In particular **lambda_2 is not bounded away from zero**. The possible corank-two and higher intersections are included, with only nonnegative polynomial powers. There is no angular singularity or inverse-eigenvalue moment left to certify.

For m=1 the largest and smallest eigenvalues coincide; using (7.3) with Lambda held fixed would be invalid. Write lambda=-A_M>0 and use h<=K(J_r+lambda). Depth failure implies

    lambda<=Dr(J_r+lambda)^2
            <=2DrJ_r^2+2Dr lambda^2.

It is contained in the union

    0<lambda<=4DrJ_r^2,     or     lambda>1/(4Dr).          (7.5)

The large-lambda branch is retained. On the near branch, h<=K(1+4D)J_r^2 for r<=1, J_r>=1. The bounded scalar density, (6.2), and direct integration in lambda give a numerator <=C r^5 E J_r^10. On the far branch, direct fourth-moment Markov with the actual weight gives

    E_Q[(W_r/r^2)1_far]
       <=(4Dr)^4 E_Q[(W_r/r^2)lambda^4] <=C r^4.          (7.6)

Thus the scalar numerator is <=C r^5+C' r^6. This separate argument is why the all-dimension statement does not silently drop the scalar far branch.

Finally, for every dimension, the fourth-derivative exception is bounded directly by

    E_Q[(W_r/r^2)1{rM4>3k_-/10}]
       <=[10r/(3k_-)]^4 E_Q[(W_r/r^2)M4^4] <=C r^4.      (7.7)

This is a pointwise Markov bound followed by a joint moment estimate. It is not Cauchy-Schwarz with a missing square root. All joint moments in (7.6),(7.7) are finite by Sections 4-5.

Divide the numerators by the FULL lower bound (5.5). The result is

    Q^W(G_r^c)<=C_3 r^3+C_4 r^4<=C r^3.                 (7.8)

## 8. Pinned genericity and global event measurability

The following argument applies at every fixed positive r and parameter, not on an asserted common probability-one set for uncountably many laws.

Away from the pins, consider (grad f(x),Hf(x)v), with ||v||=1. Its range has dimension 2d; its parameter manifold has dimension 2d-1. Modulo the pin observations, these functionals have full covariance rank: gradient and Hessian orders are distinct, and the map H -> Hv from symmetric matrices onto R^d is surjective. For two distinct unpinned points, the map

    (grad f(x),grad f(y),f(x)-f(y))

has range dimension 2d+1 and parameter dimension 2d. For a tie to a pinned height use (grad f(x),f(x)-b), or the analogous s map, with dimensions d+1 and d.

Exhaust the relevant domains by compact sets separated from pins and from coincident points; use finitely many sphere charts when v occurs. Covariance positivity from Section 2 and compactness give bounded Gaussian densities on each such set. An elementary overdetermined-zero lemma applies: on a mesh of size epsilon, a random C^1 map from dimension q to dimension p>q, with derivative norm bounded by N, could have a zero only if one of O(epsilon^-q) mesh values has norm O(N epsilon). The density bound makes the probability O(N^p epsilon^(p-q)), tending to zero. First fix N, then let N increase; the random derivative norm is almost surely finite. This proves absence of all these zeros.

Pinned Hessians have a full density on their symmetric entries for fixed distinct pins, so their determinants are nonzero almost surely. The pinned heights differ because k,r>0. Countable exhaustion now proves that Q is almost surely Morse with distinct critical values. The transfer to Q^W follows by absolute continuity and 0<Z_r<infinity.

The ordinary elder event is Borel. For fixed pins define the maximin connection level

    d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t)),

with supremum of an empty set equal to -infinity. The event d_f(M)>h can be represented by a countable union of polygonal-path tests, with rational interior vertices and endpoints, all staying strictly above h and with endpoint value above f(M). Strict clearances allow approximation by such paths. For variable M, use countably many coordinate charts and an initial segment depending continuously on M. These are Borel tests in (M,f). Thus equality d_f(M)=f(S) is Borel. On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint.

On G_r the unchanged deterministic cap theorem controls every boundary exit and supplies a connection through S to a point higher than b. Therefore the GLOBAL ordinary elder partner is S, not merely a local adjacency candidate. Equations (7.8) and the full-probability locus prove Theorem A. The cap theorem also gives exactly one actual ascending branch to M. It does not identify that branch with the transverse ridge.

## 9. A source-bound weighted Kac-Rice interface

For clarity, this section specifies why a global elder mark is admissible; a formula for local Hessian index alone would not suffice.

Apply Kac-Rice first on compact spatial pair domains separated from the diagonal, to the Gaussian vector field (grad f(x),grad f(y)). It is C^1 and has positive definite point covariance for x!=y by Section 2. Its derivative is block diagonal with Jacobian |det H_x det H_y|. Conditional laws of the whole smooth field depend continuously on the imposed gradient values by finite-dimensional Gaussian regression. Derivative moments are locally bounded.

The expected-integral extension in Armentano-Azais-Leon, *On a general Kac-Rice formula for the measure of a level set*, arXiv:2304.07424v3, Theorem 7.1, gives the identity for bounded nonnegative continuous weights in the location and an additional Gaussian field mark. It is enough first to use cylinder weights depending on finitely many fixed evaluations of f and its derivatives through order two. Their conditional distributions depend continuously on the imposed gradients by Gaussian regression, so the paper's continuity requirements hold. The field is a random element of the separable C^2 space on the torus. On each compact pair domain the two measures on location x C^2 are finite, by the unweighted formula. Cylinder evaluations on a countable dense set, together with location coordinates, generate this Borel sigma-algebra. Equality on their bounded continuous test-function algebra gives equality of the Borel measures by the monotone-class theorem. This extends the identity to bounded Borel global marks, rather than pretending the elder indicator is continuous or lower semicontinuous. No independence between the mark and gradient field is assumed.

Use the Borel elder mark from Section 8 and the type indicators. Disintegrate the two heights using their nondegenerate joint Gaussian density conditional on the gradients. This gives the full-pin density times E_Q[W] for candidates, and the same quantity times p_r for selected pairs. The continuous Gaussian regression kernel defines the canonical density version; the underlying measure identity is unaffected by height-null-set choices.

Exhaust the off-diagonal spatial domain toward r=0. The r dr bound proved in the next section makes the expectations locally integrable, and nonnegative monotone convergence completes the near-diagonal formula. No finite-grid approximation of the continuum field is substituted.

## 10. Exact radial ledger: the dimension cancels

Let pi_r(R;v_r) denote the density of U_r at (3.3). Since U_r=T_r O_r,

    density_{O_r}(specified pins)
           =12 r^(-(d+3)) pi_r(R;v_r).                   (10.1)

Use midpoint z, directed separation h=r u, birth b, and gap mark k. The change from the ordered pair (M,S) to (z,h) has absolute determinant one. Polar separation contributes r^(d-1) dr d sigma(u), where sigma is ordinary, NOT probability-normalized, surface area on S^(d-1). The height change (f(M),f(S))=(b,b-k r^3), at fixed r, contributes r^3 db dk. There is no factor 1/2: maximum/saddle pairs are ordered by their different roles.

Consequently the candidate intensity per unit midpoint volume is

    r A_r(b,k,u) dr db dk d sigma(u),
    A_r=12 pi_r(R;v_r) (Z_r/r^2).                        (10.2)

The powers are

    spatial (d-1) + height-mark 3 + pin -(d+3)
                         + determinant-normalizer 2 = 1.

By Sections 3 and 5,

    A_r -> A_0=12 pi_0(R;v_0) z_0(b,k,R)>0               (10.3)

uniformly and with a uniform finite upper bound. Although frames were used in the proof, (10.2) is invariant under a rotation of the transverse frame: the original zero-gradient law and determinant weight are unchanged by that orthogonal coordinate change. Thus it is a function of u alone. Uniformity was proved on the compact orthogonal group and descends to the sphere; no nonexistent global continuous transverse frame on the sphere is assumed.

The selected intensity is r A_r p_r with the same measures. This supplies the domination needed below, rather than assuming a fixed-axis statement can be integrated.

## 11. Lifetime pushforward and the exact compact coefficient

For ell<k_- r_*^3, every k in K gives r=(ell/k)^(1/3)<r_*. At fixed k,

    r (dr/dell) = (1/3) k^(-2/3) ell^(-1/3).             (11.1)

Hence a version of the candidate density is

    nu_cand(ell)=ell^(-1/3) integral_{B x K x S^(d-1)}
        A_{(ell/k)^(1/3)}(b,k,u)/(3 k^(2/3))
                                     db dk d sigma(u),  (11.2)

and nu_eld has an additional factor p_{(ell/k)^(1/3)}. Uniform convergence and compact domination give the common positive leading coefficient

    c_{B,K}=4 integral_{B x K x S^(d-1)}
           k^(-2/3) pi_0(R;v_0) z_0(b,k,R)
                                     db dk d sigma(u).  (11.3)

In (11.3), z_0=(6k)^2 E[det(A_0)^2 1{A_0<0}], with A_0's actual conditional covariance. Formula (11.3) is an identified Gaussian integral, not an evaluated closed form. There is no isotropic GOE substitution and no unexamined image-tail truncation.

The pointwise selection estimate supplies the stronger difference statement

    0<=nu_cand(ell)-nu_eld(ell)
      <= C ell^(2/3) integral_{B x K x S^(d-1)}
                           A^*/(3 k^(5/3)) db dk d sigma,

which is finite because k>=k_->0. This proves (1.2). It is an O(ell^(2/3)) difference, not a claim that either density separately has a second-order expansion with that remainder. Convergence of A_r to A_0 was not assigned a numerical rate.

## 12. Short bars, moments, and the exact remaining boundary

Integrating the density versions gives the following expected per-unit-volume results for the same spatial/mark-restricted populations:

    E N_eld(0,t] ~ (3/2)c_{B,K} t^(2/3),
    0<=E[N_cand(0,t]-N_eld(0,t]]<=C t^(5/3).             (12.1)

For any real q>-2/3,

    E sum_{selected, ell<=t} ell^q
           ~ c_{B,K} t^(q+2/3)/(q+2/3).                 (12.2)

The same leading expression holds for candidates. For q>-5/3 the nonselected difference alone satisfies

    E sum_{candidate but not selected, ell<=t} ell^q
                              <= C_q t^(q+5/3).         (12.3)

For q<=-2/3 the two individual expectations in (12.2) are infinite for every sufficiently small positive t, because their densities have a positive ell^(-1/3) leading term. Equation (12.3) concerns the nonselected counting measure directly, not subtraction of two infinities. In particular the compact-window inverse-lifetime threshold is p<2/3 for integrability of ell^(-p), with logarithmic divergence at p=2/3. This is unrelated to the inverse-Hessian/Schur thresholds in issue #56.

The corresponding unrestricted cumulative and individual-moment corollaries follow from Theorem C with c_{d,L} in place of c_{B,K}, by the same integrable-power argument. The compact-window nonselected difference rates (12.1),(12.3) are not automatically unrestricted rates.

## 13. Removing all birth and gap cutoffs by a direct intensity majorant

The covariance Sigma_r of U_r depends on radius and frame, NOT on the imposed target. Section 3 therefore supplies a fixed r_0>0, independent of b and k, on which its eigenvalues are bounded above and away from zero. Reduce r_0 below the torus injectivity scale and below one. Do NOT require a globally uniform lower bound for Z_r or a globally uniform constant in (1.1).

For every b in R, k>0 and 0<r<=r_0, the exact target (3.3) satisfies

    |v_r| <= C(|b|+k),
    |v_r|^2 >= c(b^2+k^2),                               (13.1)

with fixed c,C>0. For the second inequality it suffices to use its two coordinates b-k r^3/2 and 12k: if r<=1, then b^2<=2(b-k r^3/2)^2+k^2/2. Thus the invertible covariance bound yields

    pi_r(R;v_r) <= C exp[-c(b^2+k^2)].                    (13.2)

Conditional Fourier-coefficient means are bounded by C|v_r| and their centered variances by one. The same summability/Minkowski proof as Section 4 now gives the TARGET-GROWTH bound

    E_Q (1+||f||_{C^3})^p <= C_p(1+|b|+k)^p              (13.3)

for every fixed finite p, uniformly over r and frames on this r_0 band. This is not the compact-target bound (4.1) applied outside its scope; it is its explicit polynomial-growth version.

By (5.1),(5.3), for r<=1,

    |det H_i|/r <= C (1+||f||_{C^3})^d,
    0<=W_r/r^2<=C(1+||f||_{C^3})^(2d).

These inequalities remain true when k is arbitrarily small; no division by k or by Z_r has occurred. Combining with (13.2),(13.3) gives the full unnormalized-intensity majorant

    0<=A_r(b,k,u)=12 pi_r(R;v_r) Z_r/r^2
      <= C(1+|b|+k)^(2d) exp[-c(b^2+k^2)] =: H(b,k).    (13.4)

For every fixed positive r and every b,k>0, Z_r is positive and finite: append BOTH endpoint Hessians to the distinct-site pins; the full residual Gaussian density is positive on a product of an open maximum cone and an open index-(d-1) cone. Thus p_r is defined, even though no globally uniform lower floor has been used. For every fixed b,k>0, Theorem A on a compact neighborhood implies p_r->1 as r->0.

At a fixed lifetime ell, the near-pair restriction r<=r_0 is exactly k>=ell/r_0^3. After the exact change (11.1),

    ell^(1/3) nu_cand^near(ell)
       = integral_{R x (0,infinity) x S^(d-1)}
           1{k>=ell/r_0^3} A_{(ell/k)^(1/3)}(b,k,u)
                       /(3 k^(2/3)) db dk d sigma,       (13.5)

with the integrand defined to be zero where the indicator is zero. The selected near density has the additional factor p_r. Both integrands are dominated by H(b,k)/(3 k^(2/3)). This majorant is integrable: the k exponent -2/3 is strictly greater than -1 at zero, and Gaussian tails absorb the polynomial at infinity and in b. This explicitly handles the shrinking-k boundary where a compact-window selection constant can blow up.

For each fixed b,k>0,u, the indicator tends to one, A_r->A_0 and p_r->1. Dominated convergence therefore gives the same limit for the two near densities:

    c_{d,L}=4 integral_{R x (0,infinity) x S^(d-1)}
           k^(-2/3) pi_0(R;v_0) z_0(b,k,R)
                            db dk d sigma(u),           (13.6)
    0<c_{d,L}<infinity.

In particular c_{B,K} increases to c_{d,L} along an exhausting sequence of mark rectangles. This step uses the unnormalized product pi_r Z_r, not an unjustified globally uniform Q^W probability bound. It proves an unrestricted leading limit; it does not invent a quantitative unrestricted remainder from dominated convergence.

## 14. The off-diagonal contribution is bounded, not silently discarded

On the compact set of spatial pairs with torus distance at least r_0, the ORIGINAL full-pin covariance is uniformly positive definite. Every distinct-site jet list has full rank by Section 2, and compactness applies without a diagonal singularity. Its inverse is uniformly bounded. For 0<ell<=1, the original target is (b,0,...,0,b-ell,0,...,0), whose squared norm is at least b^2. Its Gaussian density is therefore at most C exp(-c b^2).

Conditional endpoint determinant-product moments on this domain are at most C(1+|b|)^(2d). The Kac-Rice height transformation (f(M),f(S))=(b,b-ell) has absolute determinant ONE here. Integrating over b and the compact relative-position domain gives

    0<=nu_eld^far(ell)<=nu_cand^far(ell)<=C,  0<ell<=1.   (14.1)

No remote-critical count bound conditional on a rare cap failure is inferred. Equation (14.1) is an unconditional off-diagonal height-density bound proved directly from a NONSINGULAR covariance on a fixed compact set. It is not the old shrinking-annulus RN enclosure and does not discharge that numerical obligation.

The near and far populations cover all distinct pairs (a distance boundary may be assigned to either; it is spatially null). Stationarity converts the spatial integral into a per-unit-volume density. Combining (13.5)-(13.6) with ell^(1/3) times (14.1) proves Theorem C. On the almost-sure Morse distinct-critical-value locus, each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death. Thus the selected full-pair count is precisely the finite-bar count, not just a local proxy. The essential global-maximum class is not counted.

## 15. Analytically eliminate birth and gap from the leading coefficient

This simplification uses inversion symmetry/parity of a stationary real covariance, NOT rotational isotropy. At the contact point write G=grad f and t_u=partial_u^3 f. Let V_u=H_f u, expressed in the frame R; it has d coordinates (f_xx,f_xy1,...,f_xym). Let A_u be the transverse Hessian block on u-perp.

All odd derivatives (G,t_u) are jointly independent of the even derivatives (f,V_u,A_u), since every odd derivative of the even covariance at zero vanishes. Put

    tau_u^2=Var(t_u | G=0)>0,
    D_u=E[(det A_u)^2 1{A_u<0} | V_u=0].                 (15.1)

Here A_u conditional on V_u=0 is an actual centered nondegenerate Gaussian symmetric matrix, not automatically GOE. Finite-jet rank proves tau_u>0, positive densities p_G(0),p_Vu(0), and D_u>0. All are continuous in the frame and invariant under transverse-frame changes.

The contact density and cone moment factor as

    pi_0(R;v_0)=p_(f,V_u)(b,0) p_G(0) phi_tau_u(12k),
    z_0=(6k)^2 E[(det A_u)^2 1{A_u<0} | f=b,V_u=0],

where phi_tau is the centered scalar Gaussian density of standard deviation tau. Integrating b by ordinary Gaussian disintegration gives p_Vu(0) D_u. Thus (13.6) becomes

    c_{d,L}=144 integral_{S^(d-1)} p_G(0) p_Vu(0) D_u
                        [integral_0^infinity k^(4/3)
                                   phi_tau_u(12k) dk] d sigma.

The scalar integral can be evaluated exactly. With t=12k and the elementary gamma integral,

    144 integral_0^infinity k^(4/3) phi_tau(12k) dk
      = Gamma(7/6) tau^(4/3) / [24^(1/3) sqrt(pi)].

Consequently the full leading coefficient is

    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).            (15.2)

This eliminates both unbounded mark integrals. The remaining angular and negative-definite-cone expectation are finite, strictly positive and specified by derivatives of the EXACT periodized covariance. Formula (15.2) is an explicit finite-dimensional Gaussian representation, not a reported elementary closed form or numerical enclosure. The factor24 is a numerical Jacobian/gamma factor, NOT the side length L; it is the same factor for every L. Changing the field amplitude by a>0 scales the coefficient by a^(-2/3), consistent with nu_(af)(ell)=a^(-1)nu_f(ell/a); this is an additional normalization check.

## 16. Supplied interfaces, retained limits, and review

**Interfaces supplied by this candidate:** the actual transverse matrix boundary argument (including d=3); a uniform compact-mark asymptotic full normalizer; all orientations without false isotropy; the global Borel marked Kac-Rice interface; exact pin/radial/lifetime factors; compact-window leading density and quantitative selection difference; a separate integrable unnormalized Gaussian majorant removing ALL birth/gap cutoffs; an off-diagonal bound completing ALL spatial separations; the unrestricted finite-bar leading density and its cumulative/moment consequences; and analytic elimination of birth and gap in its coefficient.

**Not supplied:** a numerical r_* or C on a prescribed band; a globally uniform O(r^3) probability constant over unbounded b,k; the compact O(ell^(2/3)) difference as an unrestricted remainder; an elementary closed form or numerical enclosure of (15.2); a rigorously evaluated lower coefficient for pairing failure; the original numerical H3/LPW replay; a shrinking-annulus RN certificate; a24-jet displacement enclosure; formal proof verification; nonauthor mathematical acceptance; or unrestricted P15 prize closure. No historical scientific status is changed by this author-side proof.

The exact-arithmetic program checks pin transforms/targets, block determinants, finite typed-matrix envelopes, spectral Jacobians, radius/lifetime exponents, explicit small-eigenvalue integral models, global target coercivity and coefficient scaling. Semantic mutations challenge the load-bearing factors. These are finite algebra/implementation controls, NOT Gaussian simulation or proof of continuum estimates.

Priority nonauthor review: (i) desingularized full residual covariance; (ii) uniform all-field moments and independent-matrix regression; (iii) both soft determinant factors; (iv) eigenvalue integration retaining the random largest-eigenvalue width and all corank strata; (v) scalar far branch; (vi) full-normalizer type convergence; (vii) continuous-to-Borel marked Kac-Rice extension; (viii) every factor in the pin/lifetime ledger; (ix) target-growth bound (13.3) and integrability at k=0 in (13.5); (x) distinct-site compact covariance in the far domain; and (xi) parity, b-disintegration and the gamma factor in (15.2).

### Primary-source attribution

Armentano, Azais and Leon, arXiv:2304.07424v3, Sections 2 and 7, supply established Gaussian Kac-Rice/expected-integral background. The precise full-field/Borel and pair application is explained in Section 9, not attributed wholesale to that paper. Curry, *The Fiber of the Persistence Map for Functions on the Interval*, arXiv:1706.06059v2, Section 3, supplies elder-rule background; the all-dimensional separating cap is the explicitly identified in-project predecessor. Beliaev, Cammarota and Wigman, *No repulsion between critical points for planar Gaussian random fields*, arXiv:1911.03455, is neighboring two-point/index-asymptotic work, not a source of our elder-selection conclusion. No priority or novelty claim follows from this bounded reconnaissance.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/main/a12c178c0f857a130cf434e9efd44233a038195b/incoming/side24-chart-claude-20260926/RESULT.md": "# main#141 — regenerated SIDE24 coefficient chart (review material, scientific effect NONE)

## What this package is

- Task: [d6g8k5htny-coder/main#141](https://github.com/d6g8k5htny-coder/main/issues/141), task type `chart`.
- Package id: `incoming/side24-chart-claude-20260926/`.
- Scientific effect: **NONE**. Review status: `REVIEW_REQUIRED`. This is a byte-checked
  re-reading of one pinned public JSON file plus an approximate picture of two of its
  numbers. It is submitted for review only and changes no scientific register.

## Source identity

| field | value |
|---|---|
| repository | `d6g8k5htny-coder/Math-` |
| commit | `9d7b6802424fb4715b31999066aafca8ee2f3cca` |
| path | `coefficients/side24_v1/ENCLOSURE.json` |
| bytes | 1090 |
| SHA-256 | `72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811` |
| git blob | `57af39a05e14ed0ba8ebc00a9b4aca4dffb067c7` |

The bytes were read with `git show 9d7b6802424fb4715b31999066aafca8ee2f3cca:coefficients/side24_v1/ENCLOSURE.json`
from a clone of `Math-`, and their length, SHA-256 and git blob id were compared against
the values above **before** any JSON parsing. A byte-exact copy is committed at
`source/ENCLOSURE.json` so the package is self-contained; the generator refuses (exit 2,
nothing written) if that copy, or any `--source` override, differs in length or SHA-256, and
it refuses if the parsed `scientific_acceptance` is anything but exactly `false`.

## Exact endpoints

Copied verbatim from the source as strings; never parsed through float and re-printed
(`repr(float(s)) != s` for every endpoint, which is why verbatim copying matters).

| dimension | lower (verbatim) | upper (verbatim) | cone moment (verbatim) | enclosure width (exact `Fraction(upper) - Fraction(lower)`) |
|---|---|---|---|---|
| 2 | `0.07340691930603427103` | `0.07340691930603427104` | `4/3` | `1/100000000000000000000` |
| 3 | `0.04177593184059834334` | `0.04177593184059834335` | `29/6-sqrt(6)` | `1/100000000000000000000` |

Other fields copied unchanged into `output.json`: `object` = `SIDE24-COEFFICIENT-D23-20260924-v1`,
`scope` = `coefficient of issue63 Eq15.2; parent theorem unreviewed`,
`method` = `outward rational arithmetic; analytic image and Stirling remainder bounds`,
`scientific_acceptance` = `false`.

## Independent regeneration of the pinned script

`coefficient.py` (SHA-256 `03ae6d0f15160cb681f9bbb19a84dc861c3a0db3e881291ea621061cc90c86ab`, blob
`c2d3ff339f2b9953ec08e676240cdc5edcb17a3e`) and `test_coefficient.py` (SHA-256
`81689b5394e2e949058929570ec072ccb1d4fe93cd0d36a4b258431547d02dd3`, blob
`fa9beaab7d6fcb4f0a0c5a91c6d80b455c98a912`) were copied from the same pinned commit into a
scratch directory outside this package (they are not committed here) and run with CPython
3.11.15 on Linux:

| command | wall time | exit | record |
|---|---|---|---|
| `python -B -S coefficient.py` | 0.831 s | 0 | [`regeneration/coefficient_run.txt`](regeneration/coefficient_run.txt) |
| `python -B -S -m unittest test_coefficient -v` | 1.006 s | 0 (`Ran 30 tests`, `OK`) | [`regeneration/test_run.txt`](regeneration/test_run.txt) |

Both records reproduce stdout and stderr verbatim; nothing was stripped. Byte comparison,
done programmatically (`bytes(stdout) == bytes(ENCLOSURE.json)`): the 1090 bytes that the
pinned script prints to stdout are **identical** to the pinned `ENCLOSURE.json`
(same length 1090, same SHA-256 `72b6cd92…7811`). `coefficient.py` writes no file, so there is
no written `ENCLOSURE.json` to diff; the stdout comparison is the whole comparison. This
reproduces the enclosure endpoints exactly by re-running the author's exact-arithmetic
script; it is not a review of the script's mathematics.

## The chart

![APPROXIMATE comparison of the d=2 and d=3 enclosures](chart_side24_d2_d3.png)

`chart_side24_d2_d3.png` is **APPROXIMATE** and **NON-CERTIFYING**. The two bars on one
shared vertical axis (0 to 0.08) have heights taken from `float()` approximations of the exact
lower endpoints, quantised to whole pixels; the verbatim endpoint strings, the exact widths and
the cone moments are printed beside each bar so the picture never stands in for the strings.
The enclosure width (`1/10^20`) is **arithmetic uncertainty of the specified expression, not a
finite-radius error band**, and is far below one pixel, so no error bar is drawn; the chart
says so in its footer, and `output.json` says so in `chart.note` and `non_certifying_note`.
The image is 1200x600 8-bit RGB with a fixed palette (surface `#fcfcfb`, ink `#0b0b0b`/`#52514e`,
bar `#2a78d6`), no timestamps, and a deflate stream produced by a fixed-Huffman encoder in the
generator rather than a zlib compressor, so the bytes do not depend on which zlib build the
interpreter links.

## How to reproduce

The public-intake lane accepts only `.md/.txt/.json/.csv/.png` files, so the generator and
its unit tests are **not** in this package (see "Deviation" below). They are standard-library
Python 3.11 and are bound here by digest: `regenerate.py` SHA-256 is recorded in
[`identity_detail.json`](identity_detail.json) under `generator`. With the two scripts in a
directory `GEN` and a bare checkout of this branch:

```
python3 -B -S GEN/regenerate.py --package incoming/side24-chart-claude-20260926 --check
# prints: regenerate: OK (4 files identical)
cd GEN && SIDE24_PACKAGE=/path/to/incoming/side24-chart-claude-20260926 python3 -B -S -m unittest test_regenerate -v
```

`--check` regenerates `output.json`, the PNG, `identity_detail.json` and `IDENTITY.json` into
a temporary directory and compares them byte-for-byte with the committed files; any difference
lists the paths and exits 1. The unit tests are negative controls: a one-byte change in the
source is refused before parsing with nothing written; `scientific_acceptance: true` (and `0`,
`null`, `"false"`, or a missing key) is refused; `--check` reports a one-byte change in
`output.json`, in the PNG, or in any non-generated file; the endpoint strings in `output.json`
are byte-equal to the source and not float round-trippable; the PNG parses (signature, IHDR,
every chunk CRC, IDAT inflating to exactly `height*(1+3*width)` bytes, not one flat colour, only
palette colours); the deflate stream round-trips through `zlib.decompress`; and every identity
row matches recomputed digests.

## Deviation from the task text, and why

Issue #141 was written before `main` gained the `public-intake` guard (PR #145,
`tools/public_intake_check.py`), which this PR must pass. That guard refuses any file that is
not `.md/.txt/.json/.csv/.png`, and requires `IDENTITY.json` to have exactly the keys
`schema`, `scientific_effect`, `review_status`, `sources`, `artifacts`, with three-key artifact
rows. Consequently: (1) `regenerate.py` and `test_regenerate.py` are kept outside the package
and offered for a maintainer-sponsored engineering PR, as `CONTRIBUTING.md` asks, rather than
smuggled in under another extension; (2) `IDENTITY.json` follows the checker schema exactly,
and the per-file git blob ids, the source blob, the generator identity and the tree-hash note
live in `identity_detail.json`, which `IDENTITY.json` covers like any other artifact.

## What this does NOT establish

- No theorem was reviewed. The source itself says `parent theorem unreviewed`, and this
  package does not touch that status.
- `scientific_acceptance` remains `false`; nothing here moves it.
- No live field draws, no lifetime solver, no new arithmetic: the numbers are copied
  strings and one exact subtraction.
- The chart is an illustration; it carries no mathematical content and its widths are not
  error bands.
- Nothing here changes ACCEPT/AMEND rows, `STATUS`, `PROOF_INDEX`, `LANDING_CLAIMS`,
  `claims`, prizes or `lemma_closed`; no mathematical PR is merged; publication into
  `incoming/` is review material only.

## Independence

This package was produced by an agent (Claude) working for the same account that authored
task #141 (`d6g8k5htny-coder`); it earns **zero organizational-independence credit**. Source
exposure: the pinned `ENCLOSURE.json`, `coefficient.py`, `test_coefficient.py` and `PROOF.md`
at the pinned commit, and issue #141 (plus this repository's `CONTRIBUTING.md` and intake
checker for packaging rules) were read. The technical result (byte identity of the regenerated
stdout with the pinned file; exact copy of the endpoint strings) is recorded above separately
from that zero credit.

## Identity

[`IDENTITY.json`](IDENTITY.json) (public-intake schema) lists every file in this package
except itself with byte count and SHA-256; [`identity_detail.json`](identity_detail.json)
adds git blob ids, the source and generator identities, and the note that neither identity
file can contain its own digest. Digests of the files that do not depend on this document:

| path | bytes | SHA-256 | git blob |
|---|---|---|---|
| `source/ENCLOSURE.json` | 1090 | `72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811` | `57af39a05e14ed0ba8ebc00a9b4aca4dffb067c7` |
| `output.json` | 1724 | `478fb7620ea5947855006ab7af448010fdd5cc31581407b1f86d4b87ce5de2eb` | `bfc8372e866a6a3321615323c7badc62fdb0aa4c` |
| `chart_side24_d2_d3.png` | 49375 | `29aad932a160f35389c5a00e995f8cfac72932eba7d60d69b5a01815853461b7` | `dd68944dc0e97cf732d7471f01c8c01d97ee1653` |
| `regeneration/coefficient_run.txt` | 2016 | `924d7cbf3a0f0dd3b4b0bbf9ff516566582f5710f3aa41441ad4b2e2287e3950` | `728de5adb57d7b508e26636b9ca91dbc3919ce97` |
| `regeneration/test_run.txt` | 3474 | `3dea29af8ecad450e29533da4b918e033360924fd1032fa4d3fd93331fe0c017` | `c4f08f152c20841f710efde8de3a6c5b25927965` |

The identity of the whole package is its git tree hash,
`git rev-parse <commit>:incoming/side24-chart-claude-20260926`. The first commit of this
package, `4aa316f34cf0f48125e5287c0ac435de0c9007f2`, had package tree hash
**`adea4d2d7d0313176b42117caea47bbbd23944bc`**. Because recording that value changes this
file, and therefore `IDENTITY.json` and `identity_detail.json`, it is written here in a second
commit rather than by amending; only `RESULT.md` and the two identity files differ between the
two commits, and the tree hash of the PR head is the one printed by the command above on it.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/main/a12c178c0f857a130cf434e9efd44233a038195b/incoming/side24-chart-claude-20260926/IDENTITY.json": "ewogICJzY2hlbWEiOiAxLAogICJzY2llbnRpZmljX2VmZmVjdCI6ICJOT05FIiwKICAicmV2aWV3X3N0YXR1cyI6ICJSRVZJRVdfUkVRVUlSRUQiLAogICJzb3VyY2VzIjogWwogICAgewogICAgICAicmVwb3NpdG9yeSI6ICJkNmc4azVodG55LWNvZGVyL01hdGgtIiwKICAgICAgInBhdGgiOiAiY29lZmZpY2llbnRzL3NpZGUyNF92MS9FTkNMT1NVUkUuanNvbiIsCiAgICAgICJjb21taXQiOiAiOWQ3YjY4MDI0MjRmYjQ3MTViMzE5OTkwNjZhYWZjYThlZTJmM2NjYSIsCiAgICAgICJzaGEyNTYiOiAiNzJiNmNkOTJkMzEzOTRjZGFmNWRhODkxOWE1ZDU0OGU5MDIyMjhhZjFmMDk1Y2MxODQxNThhNzFkODI4NzgxMSIKICAgIH0KICBdLAogICJhcnRpZmFjdHMiOiBbCiAgICB7CiAgICAgICJwYXRoIjogIlJFU1VMVC5tZCIsCiAgICAgICJieXRlcyI6IDEwMjIxLAogICAgICAic2hhMjU2IjogIjNiZTE0Y2E1MDEzMTY0ZTQ2MWEyYmM3MmMzMTdmZDM2OTRmOTQ3ODM4MjZkNGU1ZDg1MjRkMzExMzM1NzQ1MDIiCiAgICB9LAogICAgewogICAgICAicGF0aCI6ICJjaGFydF9zaWRlMjRfZDJfZDMucG5nIiwKICAgICAgImJ5dGVzIjogNDkzNzUsCiAgICAgICJzaGEyNTYiOiAiMjlhYWQ5MzJhMTYwZjM1Mzg5YzVhMDBlOTk1ZjhjZmFjNzI5MzJlYmE3ZDYwZDY5YjVhMDE4MTU4NTM0NjFiNyIKICAgIH0sCiAgICB7CiAgICAgICJwYXRoIjogImlkZW50aXR5X2RldGFpbC5qc29uIiwKICAgICAgImJ5dGVzIjogMjYwNSwKICAgICAgInNoYTI1NiI6ICJlYmRhYWFmMGE1MDljYmE1ZGVmNTM3ODVmNjcwODZiMjdkMzk5NGYzNGYwZWE4ODVjZDE0ZTE0ZDQ1MDdmNGYxIgogICAgfSwKICAgIHsKICAgICAgInBhdGgiOiAib3V0cHV0Lmpzb24iLAogICAgICAiYnl0ZXMiOiAxNzI0LAogICAgICAic2hhMjU2IjogIjQ3OGZiNzYyMGVhNTk0Nzg1NTAwNmFiN2FmNDQ4MDEwZmRkNWNjMzE1ODE0MDdiMWY4NmQ0Yjg3Y2U1ZGUyZWIiCiAgICB9LAogICAgewogICAgICAicGF0aCI6ICJyZWdlbmVyYXRpb24vY29lZmZpY2llbnRfcnVuLnR4dCIsCiAgICAgICJieXRlcyI6IDIwMTYsCiAgICAgICJzaGEyNTYiOiAiOTI0ZDdjYmYzYTBmMGRkM2I0YjBiYmY5ZmY1MTY1NjY1ODJmNTcxMGYzYWE0MTQ0MWFkNGIyZTIyODdlMzk1MCIKICAgIH0sCiAgICB7CiAgICAgICJwYXRoIjogInJlZ2VuZXJhdGlvbi90ZXN0X3J1bi50eHQiLAogICAgICAiYnl0ZXMiOiAzNDc0LAogICAgICAic2hhMjU2IjogIjNkZWEyOWFmOGVjYWQ0NTBlMjk1MzNkYTRiOTE4ZTAzMzM2MDkyNGZkMTAzMmZhNGQzZmQ5MzMzMWZlMGMwMTciCiAgICB9LAogICAgewogICAgICAicGF0aCI6ICJzb3VyY2UvRU5DTE9TVVJFLmpzb24iLAogICAgICAiYnl0ZXMiOiAxMDkwLAogICAgICAic2hhMjU2IjogIjcyYjZjZDkyZDMxMzk0Y2RhZjVkYTg5MTlhNWQ1NDhlOTAyMjI4YWYxZjA5NWNjMTg0MTU4YTcxZDgyODc4MTEiCiAgICB9CiAgXQp9Cg==", "https://raw.githubusercontent.com/d6g8k5htny-coder/main/a12c178c0f857a130cf434e9efd44233a038195b/incoming/side24-chart-claude-20260926/output.json": "ewogICJ0YXNrIjogImQ2ZzhrNWh0bnktY29kZXIvbWFpbiMxNDEiLAogICJwYWNrYWdlIjogImluY29taW5nL3NpZGUyNC1jaGFydC1jbGF1ZGUtMjAyNjA5MjYiLAogICJzY2llbnRpZmljX2VmZmVjdCI6ICJOT05FIiwKICAic291cmNlIjogewogICAgInJlcG9zaXRvcnkiOiAiZDZnOGs1aHRueS1jb2Rlci9NYXRoLSIsCiAgICAiY29tbWl0IjogIjlkN2I2ODAyNDI0ZmI0NzE1YjMxOTk5MDY2YWFmY2E4ZWUyZjNjY2EiLAogICAgInBhdGgiOiAiY29lZmZpY2llbnRzL3NpZGUyNF92MS9FTkNMT1NVUkUuanNvbiIsCiAgICAiYnl0ZXMiOiAxMDkwLAogICAgInNoYTI1NiI6ICI3MmI2Y2Q5MmQzMTM5NGNkYWY1ZGE4OTE5YTVkNTQ4ZTkwMjIyOGFmMWYwOTVjYzE4NDE1OGE3MWQ4Mjg3ODExIiwKICAgICJnaXRfYmxvYiI6ICI1N2FmMzlhMDVlMTRlZDBiYThlYmMwMGE5YjRhY2E0ZGZmYjA2N2M3IgogIH0sCiAgIm9iamVjdCI6ICJTSURFMjQtQ09FRkZJQ0lFTlQtRDIzLTIwMjYwOTI0LXYxIiwKICAic2NvcGUiOiAiY29lZmZpY2llbnQgb2YgaXNzdWU2MyBFcTE1LjI7IHBhcmVudCB0aGVvcmVtIHVucmV2aWV3ZWQiLAogICJtZXRob2QiOiAib3V0d2FyZCByYXRpb25hbCBhcml0aG1ldGljOyBhbmFseXRpYyBpbWFnZSBhbmQgU3RpcmxpbmcgcmVtYWluZGVyIGJvdW5kcyIsCiAgImNvbmVfbW9tZW50cyI6IHsKICAgICIyIjogIjQvMyIsCiAgICAiMyI6ICIyOS82LXNxcnQoNikiCiAgfSwKICAiZGltZW5zaW9ucyI6IHsKICAgICIyIjogewogICAgICAibG93ZXIiOiAiMC4wNzM0MDY5MTkzMDYwMzQyNzEwMyIsCiAgICAgICJ1cHBlciI6ICIwLjA3MzQwNjkxOTMwNjAzNDI3MTA0IgogICAgfSwKICAgICIzIjogewogICAgICAibG93ZXIiOiAiMC4wNDE3NzU5MzE4NDA1OTgzNDMzNCIsCiAgICAgICJ1cHBlciI6ICIwLjA0MTc3NTkzMTg0MDU5ODM0MzM1IgogICAgfQogIH0sCiAgImVuY2xvc3VyZV93aWR0aCI6IHsKICAgICIyIjogIjEvMTAwMDAwMDAwMDAwMDAwMDAwMDAwIiwKICAgICIzIjogIjEvMTAwMDAwMDAwMDAwMDAwMDAwMDAwIgogIH0sCiAgInNjaWVudGlmaWNfYWNjZXB0YW5jZSI6IGZhbHNlLAogICJjaGFydCI6IHsKICAgICJmaWxlIjogImNoYXJ0X3NpZGUyNF9kMl9kMy5wbmciLAogICAgImtpbmQiOiAiYXBwcm94aW1hdGUiLAogICAgIm5vdGUiOiAiYmFyIGhlaWdodHMgYXJlIGZsb2F0IGFwcHJveGltYXRpb25zIG9mIHRoZSBleGFjdCBlbmRwb2ludHM7IGVuY2xvc3VyZSB3aWR0aHMgKH4xZS0yMCkgYXJlIGFyaXRobWV0aWMgdW5jZXJ0YWludHkgYW5kIGFyZSBub3QgZHJhd24gYXMgYSBmaW5pdGUtcmFkaXVzIGVycm9yIGJhbmQiCiAgfSwKICAibm9uX2NlcnRpZnlpbmdfbm90ZSI6ICJOT04tQ0VSVElGWUlORzogdGhlIFBORyBpcyBpbGx1c3RyYXRpdmUgb25seS4gSXRzIGJhciBoZWlnaHRzIGFyZSBmbG9hdCBhcHByb3hpbWF0aW9ucyBvZiB0aGUgdmVyYmF0aW0gZW5kcG9pbnQgc3RyaW5ncyBpbiB0aGlzIGZpbGUsIHF1YW50aXNlZCB0byBwaXhlbHM7IGl0IGVzdGFibGlzaGVzIG5vdGhpbmcgYWJvdXQgdGhlIGNvZWZmaWNpZW50LCB0aGUgZW5jbG9zdXJlIG9yIHRoZSBwYXJlbnQgdGhlb3JlbS4gT25seSB0aGUgc3RyaW5ncyB1bmRlciBcImRpbWVuc2lvbnNcIiBhbmQgXCJjb25lX21vbWVudHNcIiBhcmUgZXhhY3QsIGFuZCB0aGV5IGFyZSBieXRlIGNvcGllcyBvZiB0aGUgc291cmNlLiIKfQo=", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md": "# D1 Theorem A selection chain — source-bound reconciliation

**Object:** D1-CHAIN-RECONCILIATION-20260928-v1.
**Reconciler:** Anthropic Claude, Claude Code session `session_017Mi3hxjaxV45x6zo6o1ee3`.
**Effect:** register reconciliation. This record introduces **no new mathematical claim** about the parent. It binds
existing nonauthor reviews to exact source bytes, discharges every residual item they left open, reviews the two
parent sections that no earlier review covered (§§11–12), and states the resulting scoped status. The register edits
it justifies are listed in §9. `lemma_closed`, prizes and premises are untouched.

## 1. The reconciled object and its reading rule

The D1 parent is OpenAI/ChatGPT's UNIFORM-MATRIX-CAP-LIFETIME-20260924-v1, with the imported deterministic
MARKED-CYLINDER-CAP-20260924-v1. The parent bytes are immutable. The object reconciled here is the parent **read
together with** the three amendments in the table below. Every consumer must cite this identity set, not the parent
alone.

| Role | Path (Math-) | Git blob | Bytes | SHA256 |
|---|---|---|---|---|
| Parent (P) | `imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md` | `dfed3b8d318a3ab1950957f393307733a4bef3f2` | 40261 | `9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7` |
| Cap import (CAP) | `imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md` | `0633aca3c2a2882b0de4399da0a75d64c2e6b2e1` | 15160 | `0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc` |
| Amendment E1: congruence erratum | `imports/lifetime_parent_20260925/ERRATUM_CONGRUENCE.md` | `213594d6ca6a86fb938110f4d166d9ce275a02d0` | 1782 | `bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028` |
| Amendment E2: §9 replacement v1.1 | `reviews/d1_section9_borel_repair_20260925/REPAIR.md` | `fe9b9ce4999908bb3814b500ee2d0ceb0c6f704a` | 9062 | `845abf9f9c99d672c2a10a887b5a2e7206a3d2de3d876f35f75ff6e2dc13e62f` |
| Amendment E3: wording W1 and embedding radius | this record, §5 | — | — | — |

**Reading rule.**

- Read P §5 with E1. The congruence factor is `D_r = diag(r^{-1/2}, I)`, not the displayed `diag(√r, I)`.
- Read P §9 as replaced by E2.
- Read P l. 165 with W1 (§5 below).
- Read P §1's "sufficiently small r" as including the explicit embedding bound `r < L/(4√2)` (§5 below).

No formula of P changes.

**Machine binding.** Each component above is also its own source node in the hard-gate graph
(`frontiers/downstream_gate_20260925/GRAPH.json`), required by the D1 node: E1, E2, CAP (whole file; only §§1–5
are consumed) and this record's directory, which carries E3 and `LEDGER.json`. A byte change or deletion of any
component therefore proposes D1, D2 and D3 for revalidation even when P's bytes are unchanged (§9, §10).

**Name collision.** "Theorem A" here always means P (1.1). The fixed-remote mean-measure theorem in
`frontiers/remote_window_20260924/PROOF.md` is also called "Theorem A". That is a different theorem (D4), and
nothing in this record concerns it.

## 2. Reconciled statements

The model is P §1:

- the exact L-periodized Gaussian field on `R^d/(LZ^d)`, for fixed `d >= 2` and `L > 0`;
- the six pins, generally `2(d+1)` observations;
- the typed weight `W_r` and the FULL normalizer `Z_r = E_Q W_r`;
- `p_r(b,k,R)`, the `Q^W`-probability that the global ordinary superlevel elder partner of `M` is `S`.

The three statements below are accepted at existential scope. There is no numerical `C`, `r_*`, `z_*`, `c_{B,K}`
or `c_{d,L}`.

- **Theorem A (P 1.1).** For compact `B` and `K ⊂ (0,∞)`, there are `C` and `r_* > 0` such that
  `0 <= 1 - p_r <= C r^3`. This holds uniformly over `b ∈ B`, `k ∈ K`, all orthonormal frames and `0 < r <= r_*`.
- **Theorem B (P 1.2).** Let `B` and `K ⊂ (0,∞)` be compact intervals **of positive length** (P l. 37; a singleton
  interval gives zero mark-window intensity). The compact-window densities satisfy
  `ν_cand ~ ν_eld ~ c_{B,K} ℓ^{-1/3}` with `c_{B,K} > 0`. Their difference satisfies `0 <= ν_cand - ν_eld <= C ℓ^{2/3}`.
- **Theorem C (P 1.3).** All births, all positive gaps and all separations are included, and the essential class is
  excluded. Then `ν_cand^all ~ ν_eld^all ~ c_{d,L} ℓ^{-1/3}` with `0 < c_{d,L} < ∞` given by (15.2). This is the
  leading term only: no unrestricted remainder or difference rate is included.
- **§12 corollaries.** These are the cumulative and moment consequences (12.1)–(12.3) and their unrestricted leading
  forms.

**Sharpness in d = 2 (composition, separately sourced).** In the plane, the direct lower bound
`1 - p_r >= c r^3` combines with Theorem A to give `1 - p_r = Θ(r^3)` and `ν_cand - ν_eld = Θ(ℓ^{2/3})` on compact
marks. The lower bound is (E2) of `frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md`,
blob `aaefc8da…`, reviewed in `reviews/d1_elder_lower_claude_20260928/`. **No lower bound is asserted for `d >= 3`.**

## 3. The four components of the chain

| Component | Sections | Output | Interfaces |
|---|---|---|---|
| (I) Matrix-cap normalizer | P §§2–5 with E1 and W1 | `Z_r/r^2 -> z_0 > 0` uniformly; floor `z_* r^2 <= Z_r <= z^* r^2` (5.4)–(5.5) | A1, A2, A4, A3 |
| (II) Cubic pairing-defect bound | P §§6–7 | `E_Q[W_r 1_{G_r^c}] <= C r^5`, hence `Q^W(G_r^c) <= C r^3` (7.8) | A5, A6, A7 |
| (III) Global elder selection | CAP §§2–5 and P §8 | on `G_r` ∩ {Morse, distinct values}, the global elder partner of `M` is `S`; hence `1-p_r <= Q^W(G_r^c)` | CAP, D1-A |
| (IV) Marked Kac–Rice and lifetime | E2 (§9), P §§10–15 | intensity identities, radial ledger, pushforward, majorant, off-diagonal bound, coefficient (15.2) | D1-B/E2, D1-C, §11, §12, D1-D, D1-E |

Theorem A = (I) + (II) + (III). Theorem B = Theorem A + (IV) through §11. Theorem C = (IV) + Theorem A, which gives
`p_r -> 1` pointwise in §13.

## 4. Interface ledger

**Providers.** OpenAI is the author of P, CAP, E1 and E2. The nonauthor providers are xAI/Grok and Anthropic/Claude.
All lanes share one GitHub account, so no organizational independence is claimed anywhere. The full machine-readable
ledger, with every review locator, is `LEDGER.json`.

**Review records.**

| ID | Provider and session | Record | Verdicts |
|---|---|---|---|
| G1 | xAI Grok 4.7 via Cursor, `bc-ce4bf0bc` | [main#63 comment 5841570965](https://github.com/d6g8k5htny-coder/main/issues/63#issuecomment-5841570965) | D1-A–E ACCEPT |
| C1 | Anthropic Claude, this session | `reviews/d1_theorem_a_nonauthor_20260928/REVIEW.md` (blob `bc11369c…`, Math-#106 v2) and [main#63 comment 5873873903](https://github.com/d6g8k5htny-coder/main/issues/63#issuecomment-5873873903) | A1–A7, CAP, Theorem A and E2 C1–C6 ACCEPT; W1 |
| G2 | xAI Grok, Lucas lane | `reviews/d1_section9_borel_grok_lucas_20260928/REVIEW.md` (blob `48ea9ad5…`) | E2 C1–C6 ACCEPT. Narrative record; its runner is absent. |
| G3 | xAI Grok via Cursor, replay rounds 3–9 | main `incoming/grok-session-20260926-replay/` | Partial slices; see the table below |
| G4 | xAI Grok 4.7 via Cursor, `bc-81faa729` and `bc-dfbce246` | [main#67 5841270276](https://github.com/d6g8k5htny-coder/main/issues/67#issuecomment-5841270276), [5841782206](https://github.com/d6g8k5htny-coder/main/issues/67#issuecomment-5841782206) | While reviewing D2, re-derived P (6.2), the depth-failure integral, the m=1 split, and the far and M4 Markov pieces. Also checked the (11.3) = (13.6) coefficient identity. |
| C2 | Anthropic Claude, this record | §6 below | §11 and §12 ACCEPT; spot re-derivations of (13.1), (13.4) and (15.2) |
| O1 | OpenAI technical review of Math-#106, [5341593068](https://github.com/d6g8k5htny-coder/Math-/pull/106#pullrequestreview-5341593068) | — | Confirms W1 and the A5/A6 fixtures. **Author provider, so non-discharge.** |

**Interfaces.** "Full" means a nonauthor provider re-derived the whole interface. "Partial" means a nonauthor provider
checked part of it; partial checks never discharge on their own. `reconciliation_check.py` computes the full-depth
counts from `LEDGER.json`.

| Interface | P lines | Claim | Full-depth nonauthor ACCEPT | Partial second-provider check |
|---|---|---|---|---|
| S1 §1 | 9–53 | model, conventions, statements of A–C | G1, C1 (xAI, Anthropic) | — |
| A1 §2 | 54–68 | positive spectrum, jet rank, smooth version | C1 | G3 "qualitative positivity OK" |
| A2 §3 | 69–114 | contact frame, `12 r^{-(d+3)}`, uniform gap, (3.5) | C1 (including the gap proof) | G3 certified `det T_r` |
| A4 §4 | 115–137 | (4.1)–(4.3), independent residual | C1 | — |
| A3 §5 | 138–183 | (5.1)–(5.5), type convergence, UI, floor | C1 (O1 agrees but is author-provider) | G3 UI-majorant structure and `A_M -> A_0` |
| A3-E1 | erratum | `D_r = diag(r^{-1/2}, I)` | C1, G3 | — |
| A5 (6.1) | 184–197 | canceled-pivot bound, all m | C1 | G3 (m=1) |
| A6 (6.2) | 198–211 | two soft factors, including the 3/2 saddle term | C1, G4 | — |
| A7 §7 | 212–275 | `r^5` numerators, corank strata, m=1 far branch, M4, (7.8) | C1 | G4 numerator structure |
| CAP §§1–5 | cap 1–168 | deterministic separating cap, global maximin | C1, G3 | — |
| D1-A §8 | 276–297 | pinned genericity, Borel elder event, `G_r =>` partner S | G1, C1 | — |
| D1-B §9 | 298–309 | Borel marked Kac–Rice as written | G1 | — |
| D1-B-E2 | E2 | §9 replacement v1.1, C1–C6 | C1, G2 | — |
| D1-C §10 | 310–336 | radial ledger `r A_r dr db dk dσ` | G1 | C1 (#123 E9 check) |
| §11 | 337–364 | pushforward, (11.3), difference (1.2) | C2 | G4 ((11.1) and the (11.3) identity) |
| §12 | 365–385 | cumulative and moment corollaries | C2 | — |
| D1-D §§13–14 | 386–446 | target-growth majorant, `k -> 0`, off-diagonal (14.1) | G1 | C2 spot checks |
| D1-E §15 | 447–481 | parity, disintegration, (15.2) | G1 | C2 gamma factor |

Every interface has a full-depth ACCEPT from at least one nonauthor provider. Six have full-depth ACCEPTs from both
nonauthor providers: S1, A3-E1, A6, CAP, D1-A and D1-B-E2. Nine more have a partial check by the other provider. Three
have a single provider at any depth: A4, §12, and D1-B. D1-B is the original §9 text, which the reading rule replaces by
D1-B-E2 (two providers), so it needs no second check. The project's established reconciliations (D2, D3, D4, D6 in STATUS)
each rest on one provider-distinct nonauthor review, so this meets the existing bar. §8 invites second-provider checks,
prioritized by that gap, but they are not a precondition.

## 5. Residual items and their discharge

Every item that an earlier record left open, AMEND or "not closed" is listed below with where it is discharged.

| Open item | Raised in | Discharge |
|---|---|---|
| A3: wrong congruence factor `diag(√r,I)` | main#63 5841947606; G3 `A3_TYPE_CONVERGENCE` C1 | E1, landed by Math-#64 at `d8f5505`. Algebra confirmed by G3 and C1. |
| A3: UI of `W_r/r^2` | G3 C4 | C1 A3 item 4: `sup E(W_r/r^2)^2 < ∞` from (5.3), (5.1), `‖A_S‖ <= ‖A_M‖ + rM3` and A4. G3 `A3_UI_MAJORANT` gives the same majorant. |
| A3: type-indicator convergence under `D_r` | G3 | C1 W1: Slutsky joint convergence in law. The discontinuity set lies in `{det A_0 = 0}`, which is null (C1 item 5). |
| A3: `z_* > 0` | G3 C3 | C1: `A_0` is a nondegenerate Gaussian on `Sym_m`, so it charges the open cone `{A < 0}`. Continuity plus compactness gives (5.5). |
| A3: `A_M -> A_0` uniformly | G3 `A_M_TO_A0` (conditional on A1–A2) | C1 A3 item 3 and A1–A2 below. |
| A2: "single missing estimate", the uniform Gramian gap | G3 `A2_RESIDUAL_GAP` | C1 A2. Each coordinate of `U_r ⊕ vec A_r` is `∫ ∂^α f(tu) dμ_r(t)` with `μ_r -> δ_0`, so the covariance is jointly continuous on `[0,r_0] × O(d)`. It is positive definite at `r=0` by A1. Compactness gives `λ_min >= c_* > 0`. This is existential, which is all Theorem A claims. |
| A5 for `m >= 2` | G3 table | C1 A5: `det H_M = rα det(B' )` with `B' = A - (r/α)ββ^T`, and `0 < -B' <= B` on typed support. Symbolic for m=1,2,3; probed on 1,962 exact instances. |
| A7 `r^5` integrals; far branch | G3 table; C1 v1 | C1 A7, and G4. The v2 correction is that `λ >= 1/(Dr)` lies in the **majorant** event, not necessarily in depth failure. The far branch is kept in the upper bound. |
| Cap pairing: embedded chart and Morse/§8 | G3 `EMBEDDED_CHART_AND_MORSE`, `CAP_PAIRING_IDENTITIES` | §8 by G1 and C1. The embedding radius is made explicit below. |
| Embedding radius not displayed | G3 `EMBEDDED_CHART_AND_MORSE` ("AMEND the slogan") | Below: `r < L/(4√2)`. |
| §9 write-up gap (monotone-class passage) | Math-PR112 review, recorded in E2 | E2 v1.1, reviewed by C1 and G2. C1 withdrew the theorem-number objection on primary-source grounds (arXiv:2304.07424v3, Theorems 2.1, 2.2, 7.1, Remarks 7–8). |
| §§11–12 never reviewed | This reconciliation (line audit) | §6 below. |
| "Second non-Claude review of W1 and A2 before integration" | C1 request | W1 is wording only and is confirmed by O1 (non-discharge) and G3's in-law route. For A2 see the provider note in §4. The request stands as §8's open invitation. It is not a blocker under the existing bar. |

**W1 (wording; proof unchanged).** P l. 165 says the scaled endpoint Hessians converge "in probability" to
`diag(∓6k, A_0)`. Correctly:

- `D_r H_M D_r - diag(-6k, A_M)` and `D_r H_S D_r - diag(6k, A_M)` tend to 0 in probability, by (5.1), (5.2) and
  `‖A_S - A_M‖ <= rM3`;
- `A_M -> A_0` in law.

Slutsky then gives joint convergence in law, and continuous mapping applies off the null set `{det A_0 = 0}`. P's
subsequence paragraph (l. 176) already argues in law.

**Embedding radius.** Let `D = [-2r, 2r] × B̄(0, 2r)`, the cap cylinder, which contains all of `G_r`'s geometry. Then
`D ⊂ B̄(0, 2√2 r)`. On `R^d/(LZ^d)` the exponential chart at any point is injective on the open ball of radius
`L/2`. So `D` is embedded whenever `2√2 r < L/2`, that is `r < L/(4√2)`. Theorem A's existential `r_*` may be, and is,
taken below this. This makes explicit what P §1 says with "for sufficiently small r".

## 6. Review of the previously unreviewed §§11–12 (C2)

The line audit found that no earlier record reviewed P lines 337–384. G1 lists 215–217, 276–296, 298–308,
88–94 and 310–335, 386–445, and 447–480. C1 assumed that D1-A–E covered "§§10–15", which it did not. Both sections
were reviewed here from the bytes.

**§11 — ACCEPT.**

- (11.1): `r = (ℓ/k)^{1/3}` gives `r dr/dℓ = (1/3) k^{-2/3} ℓ^{-1/3}`.
- Restriction: for `ℓ < k_- r_*^3`, every `k ∈ K` has `r < r_*`, so the whole pushforward stays inside Theorem A's
  range.
- (11.2): at fixed `(b,k,u)`, pushing `r A_r dr` forward to `ℓ` gives `ℓ^{-1/3} A_{(ℓ/k)^{1/3}}/(3k^{2/3}) dℓ`.
  Integrating over `B × K × S^{d-1}` gives the density version; `ν_eld` carries the extra factor `p_r`.
- (11.3): as `ℓ -> 0`, `A_r -> A_0` uniformly with a uniform bound (10.3), and `p_r -> 1` uniformly by Theorem A.
  Dominated convergence on the compact domain gives `ℓ^{1/3} ν -> ∫ A_0/(3k^{2/3}) = 4∫ k^{-2/3} π_0 z_0 = c_{B,K}`,
  using `A_0 = 12 π_0 z_0`. Positivity follows from `π_0, z_0 > 0` on a set of positive measure. G4 verified the same
  identity in (13.6)'s form.
- Difference: `ν_cand - ν_eld = ℓ^{-1/3}∫ A_r(1-p_r)/(3k^{2/3})`. Theorem A gives `<= ℓ^{-1/3} ∫ A^* C r^3/(3k^{2/3})`
  with `r^3 = ℓ/k`, so the bound is `C ℓ^{2/3} ∫ A^*/(3k^{5/3})`. This is finite because `k >= k_- > 0`, which proves
  (1.2). The exponent `ℓ^{2/3} k^{-5/3}` is checked exactly.

**§12 — ACCEPT.**

- (12.1): `∫_0^t c ℓ^{-1/3}(1+o(1)) dℓ = (3/2)c t^{2/3}(1+o(1))`, and `∫_0^t C ℓ^{2/3} = (3/5)C t^{5/3}`.
- (12.2): for `q > -2/3` the integrand `ℓ^{q-1/3}` is integrable at 0, giving `c t^{q+2/3}/(q+2/3)`.
- (12.3): for `q > -5/3`, `∫_0^t ℓ^q C ℓ^{2/3} = C t^{q+5/3}/(q+5/3)`.
- For `q <= -2/3`, each individual expectation diverges because `c > 0`. (12.3) is stated for the nonselected measure
  directly, not as a difference of infinities.
- The unrestricted leading forms follow from Theorem C in the same way. The compact difference rates are correctly
  **not** extended.

**Spot re-derivations for §§13–15.** These do not replace G1; they are a second provider's check.

- (13.1): `(b - kr^3/2)^2 + 144k^2 >= (b^2+k^2)/2` for `r <= 1`. Checked exactly at sample rationals and by the
  inequality `b^2 <= 2(b - kr^3/2)^2 + k^2/2`.
- (13.4): `W_r/r^2 <= C(1+‖f‖_{C^3})^{2d}` follows from (5.1) and (5.3) with no division by `k`.
- (15.2): with `t = 12k` and `w = s^2/2`, `144∫_0^∞ k^{4/3}φ_τ(12k)dk = Γ(7/6)τ^{4/3}/(24^{1/3}√π)`. Checked
  numerically to relative `1e-9` in `reconciliation_check.py`, and exactly for the power bookkeeping.

## 7. Consumption contract

| Consumer | Consumes from D1 | After this reconciliation |
|---|---|---|
| D2 Theorem R, `frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md` (blob `247b3ecf…`) | The §8 comparison `1-p_r <= Q^W(G_r^c)`, §9 (read as E2), §10, §14 (14.1), and (15.2) as `c`. **Not** (1.1). | Every consumed interface is reconciled. `claims` moves FAIL_CLOSED -> REVIEWED_SCOPED at Theorem R's stated `O(1)` scope. |
| D3 SIDE24 coefficient, `coefficients/side24_v1/PROOF.md` (blob `44b66f04…`) | (15.2) as the leading coefficient of Theorem C | The persistence interpretation is reconciled. `claims` moves HOLD_WITH_DOMAIN -> REVIEWED_SCOPED. The arithmetic acceptance (#65) is unchanged. |
| Direct lower bound, `ELDER_LOWER_AND_DENSITY_GAP.md` (E4)/(E11) | Theorem A (1.1) upper half, §§9–11 | The two-sided planar composition is now fully sourced. (E2) itself stays as reviewed in #123. |
| D4 fixed-remote (RM), RC (#110), IW (#107), #120 | P's model and observation **conventions** only, plus RM's own "Theorem A" | Unaffected. No D1 theorem is consumed. |
| Any new consumer | — | Cite the §1 identity set, this record, and a scope no larger than §2. |

**Still not consumable.**

- Numerical `C`, `r_*`, `z_*`, `c_{B,K}` or `c_{d,L}`.
- (1.2)'s difference rate outside compact marks.
- Any lower bound for `d >= 3`.
- A globally uniform `O(r^3)` constant over unbounded marks.
- RN, 24-jet, JETMOD or H3/LPW numerical certificates.
- `lemma_closed`, any prize, or "unconditional acceptance of the lifetime parent", which is a forbidden global
  inference in `claims/LANDING_CLAIMS.json`. This acceptance is scoped.

## 8. Independence, lineage and requests

**Dual role.** The reconciler is also reviewer C1 of A1–A7, CAP and E2, and reviewer C2 of §§11–12. This is disclosed
rather than hidden.

**What the reconciliation relies on, and what it does not.** Nothing here is accepted on the strength of a green test,
a hash, a same-provider review or O1. Every interface rests on a written nonauthor derivation.

**Merge.** The register PR carrying this record must be merged by a non-Claude lane after reading it. Claude does not
self-merge.

**Invitation.** A second-provider check is invited in this priority order:

1. A4 and §12, which have one provider at any depth;
2. the full-depth gaps behind partial checks: A2's uniform gap, A5 for `m >= 2`, A7's division by the floor, and
   §11's difference bound;
3. the reverse direction for D1-C, D1-D and D1-E, where xAI is full-depth and Claude is partial.

Any lane may return COUNTEREXAMPLE with an exact equation. That would reopen only the affected interface and its
dependents, and the graph's reverse-impact rule would mark them REVALIDATION_REQUIRED.

## 9. Register transitions justified by this record

Math-, in the same PR:

- `PROOF_INDEX.md`: D1 moves to "Reviewed scoped results" with the §2 scope. The §9 repair is recorded as reviewed by
  C1 and G2. The D2 entry is updated to name its reconciled imports.
- `claims/LANDING_CLAIMS.json`:
  - `lifetime-remainder` FAIL_CLOSED -> REVIEWED_SCOPED;
  - `side24-coefficient` HOLD_WITH_DOMAIN -> REVIEWED_SCOPED;
  - dependency reviews are bound to local review files.
- `frontiers/downstream_gate_20260925/GRAPH.json`:
  - `math.uniform-matrix-cap-lifetime` AUTHOR_SIDE_CANDIDATE -> PROVED_REVIEWED, with this record as evidence and
    the §2 scope. It is the only classification that satisfies a still-required premise, and D2 and D3 require it.
  - D2 and D3 gain `review_disposition: ACCEPT` metadata under the existing convention (commit `cc3a991`).
  - Four reading-rule component nodes (E1, E2, CAP and this record's directory) are added as `PROVED_REVIEWED`
    source nodes with required edges from D1. Each carries the ledger reviews its role needs: C1 and G3 for E1 and
    CAP, C1 and G2 for E2. This record is an Anthropic, nonauthor record; its W1 and radius items were raised in C1
    and G3 and its §6 is C2. OpenAI's technical check of this record (review 5345687857) is listed as author-provider
    non-discharge. This closes the gap that review found: before it, E1, E2 and W1 were named only in metadata, so
    editing them left D1's source snapshot unchanged.
  - No node becomes `controlling`. Satisfying D2's and D3's required edge to D1 is not promotion: their own
    classifications stay author-side, so `promotion_allowed` still refuses both.
  - The fail-closed tests are kept on a pre-reconciliation fixture, so they still prove that an unreviewed parent
    blocks both dependents. New tests make real two-commit edits and deletions of each component with P unchanged,
    and require D1, D2 and D3 to be proposed `REVALIDATION_REQUIRED`. An unrelated edit must propose nothing, and
    the pre-binding graph is shown to miss the component edit.

main, in a companion PR pinned to this record's merged commit:

- `STATUS.md`: D1 moves from AMEND/open to ACCEPT — scoped.
- The glossary's D1 row is updated.
- The museum and shop projections are regenerated.

## 10. Checks

`reconciliation_check.py` (Python standard library):

1. Binds every §1 source and every local review record by Git blob, bytes and SHA256.
2. Cross-checks the hard-gate graph against `LEDGER.json`:
   - D1 is bound to P's exact bytes;
   - E1, E2, CAP and this directory are D1 source nodes behind required edges;
   - each component node carries exactly the ledger reviews of its interfaces;
   - the record's author provider differs from P's;
   - two negative controls (a dropped edge; an author-only review basis) are rejected.
3. Validates `LEDGER.json`:
   - every interface has at least one nonauthor ACCEPT;
   - author-provider reviews are non-discharge;
   - P's §§1–16 line ranges are fully covered;
   - every residual item has a discharge pointer.
4. Re-verifies the reading-rule mathematics exactly:
   - E1 congruence versus the displayed factor;
   - (5.3), (6.1) and (6.2) on exact rational instances;
   - (7.3) and the (7.5) split;
   - the cap constants and κ-scaling;
   - the embedding radius, the radial and lifetime ledgers, (11.1)–(11.3), the difference exponent and the §12
     integrals;
   - the (13.1) coercivity bound;
   - the (15.2) gamma factor, numerically.
5. Rejects nine semantic mutants.

A green run is evidence that the bookkeeping and finite identities hold. It is not the analytic review, which lives in
C1, G1, G2, G4 and §6.
", "https://raw.githubusercontent.com/d6g8k5htny-coder/Math-/d6628da09384728992dcbe6e921cc28ba85aebb0/README.md": "# Mathematics — proofs, calculations, and open reviews

[Research home](https://github.com/d6g8k5htny-coder/main) · [Topic guide](https://github.com/d6g8k5htny-coder/main/blob/main/docs/RESEARCH_INDEX.md) · [Run the checks](https://github.com/d6g8k5htny-coder/main/blob/main/docs/REPRODUCE.md) · [Claim manifest](claims/LANDING_CLAIMS.json) · [Proof availability](PROOF_INDEX.md) · [Work queue](https://github.com/d6g8k5htny-coder/main/issues/86)

## Read a result

| Topic | Proof or entry point | Review and scope |
|---|---|---|
| Gaussian lifetime coefficient | [SIDE24 dimensions 2 and 3](coefficients/side24_v1/PROOF.md) | [main #65](https://github.com/d6g8k5htny-coder/main/issues/65); conditional on the parent lifetime formula |
| Quantitative lifetime density | [Bounded unrestricted remainder](frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md) | [main #67](https://github.com/d6g8k5htny-coder/main/issues/67); parent interfaces remain under review |
| RN critical-point counting | [Probability-to-count interface](frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md) | Exact implications and counterexamples; the Gaussian triple integral is not evaluated |
| RN fixed-remote height window | [Cubic count and contact kernel](frontiers/remote_window_20260924/PROOF.md) | Actual count bound on a fixed remote region; shrinking spatial cutoffs and witness collisions remain outside scope |
| RN reviewed fixed-annulus height window | [Fixed scaled-annulus theorem](frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md) | [Source-bound nonauthor review](reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md) accepts the fixed d=2 annulus / compact positive-gap / between-pin-window scope only; no global D5/RN/JETMOD closure |
| P15 obstruction covers | [Original-coordinate realization](frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md) | Specified family and cover; 816 versus whole-ground 818 |
| P15 failed extension | [Price-range counterexample](frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md) | Unrestricted same-palette transformed-price extension is false |
| P15 valid price extension | [Low-probability transformed-price budget](frontiers/price_budget_20260924/PROOF.md) | New sufficient hypotheses: demand at least 2 and probabilities at most 1/4 |
| P15 full probability range | [Full transformed-price budget and sharp constant](frontiers/full_price_20260924/PROOF.md) | Demands at least 2; every independent probability vector; same palette; sharp uniform factor 1/[3-log(3e-2)] |
| Downstream hard gate | [Fail-closed promotion control](frontiers/downstream_gate_20260925/README.md) | [main #90](https://github.com/d6g8k5htny-coder/main/issues/90) / [#86](https://github.com/d6g8k5htny-coder/main/issues/86); integrity only; `lemma_closed` stays false |

Each row is governed by its exact statement, source identity, domain, dependencies, and review object in [claims/LANDING_CLAIMS.json](claims/LANDING_CLAIMS.json). Some rows remain author-side or fail-closed; the fixed-annulus height-window row has a scoped nonauthor technical review. A merge or green test never broadens a claim beyond that recorded scope. The counterexample and the restricted successor concern different hypotheses. The full-range successor removes the probability cutoff, not the demand or realized-family hypotheses; the older 16/27 factor remains better on its smaller domain.

## Run a calculation

All commands below use the Python standard library and run from this repository root.

```sh
python -B -S coefficients/side24_v1/coefficient.py
python -B -S -m unittest discover -s coefficients/side24_v1 -p 'test_*.py' -v
python -B -S -m unittest discover -s frontiers/three_fronts_20260924 -p 'test_*.py' -v
python -B -S frontiers/remote_window_20260924/remote_window.py
python -B -S -m unittest discover -s frontiers/remote_window_20260924 -p 'test_*.py' -v
python -B -S frontiers/price_budget_20260924/price_budget.py
python -B -S -m unittest discover -s frontiers/price_budget_20260924 -p 'test_*.py' -v
python -B -S frontiers/full_price_20260924/full_price.py
python -B -S -m unittest discover -s frontiers/full_price_20260924 -p 'test_*.py' -v
python -B -S frontiers/downstream_gate_20260925/hard_gate.py
python -B -S -m unittest discover -s frontiers/downstream_gate_20260925 -p 'test_*.py' -v
```

The full-price package has 36 distinct tests and seven semantic mutation controls. Run `python -B -S frontiers/full_price_20260924/run_validation.py --output /tmp/full-price-new-run` for both modes; choose a new output directory outside the source tree. `--mode normal` or `--mode optimized` permits bounded split runs. Finite probability grids are checks, not the proof of the full-cube statement.

[Full reproduction guide](https://github.com/d6g8k5htny-coder/main/blob/main/docs/REPRODUCE.md) explains normal/optimized runs, mutation controls, and pinned versus current-source replay. [Frontier directory](frontiers/README.md) groups the packages. Older dated source files are retained unchanged; use the review links for subsequent corrections.

## Where the other work lives

[main](https://github.com/d6g8k5htny-coder/main) holds the campaign, reviews and legacy research-branch links. [meta-framework](https://github.com/d6g8k5htny-coder/meta-framework) holds exact source identities; [query-](https://github.com/d6g8k5htny-coder/query-) looks them up; [trial](https://github.com/d6g8k5htny-coder/trial) checks integration; [google-drive](https://github.com/d6g8k5htny-coder/google-drive) carries selected public replicas. Private experiments are not exported through those public routes.

Byte copies of eight hardening-branch lemma proofs and the P15-B proof, plus a transcription of closed [main #59](https://github.com/d6g8k5htny-coder/main/issues/59), are in the [custody ledger](imports/hardening_ebedb780/README.md). That ledger is source availability only. It does not adopt source labels and does not change `lemma_closed`, prizes, premises, or the claim manifest.
"}
\ No newline at end of file
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node-result.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node-result.json
new file mode 100644
index 000000000..82bac34f1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node-result.json
@@ -0,0 +1,59 @@
+{
+ "argv": [
+ "node",
+ "--test",
+ "tests/test_atlas_controls.mjs",
+ "tests/test_atlas_formal_evidence.mjs",
+ "tests/test_atlas_formal_source_bridge.mjs",
+ "tests/test_atlas_reader_experience.mjs",
+ "tests/test_atlas_relationships.mjs",
+ "tests/test_atlas_resilience.mjs",
+ "tests/test_atlas_spatial.mjs",
+ "tests/test_atlas_spatial_labels.mjs",
+ "tests/test_brand_identity.mjs",
+ "tests/test_catalog_query.mjs",
+ "tests/test_compare_categories.mjs",
+ "tests/test_compare_source_panel.mjs",
+ "tests/test_current_inventory_acquisition.mjs",
+ "tests/test_current_observation_coherence.mjs",
+ "tests/test_current_site.mjs",
+ "tests/test_current_site_resume.mjs",
+ "tests/test_current_site_shell.mjs",
+ "tests/test_curvature_export.mjs",
+ "tests/test_dependency_viewer.mjs",
+ "tests/test_explore_models.mjs",
+ "tests/test_figure_png.mjs",
+ "tests/test_library_discovery.mjs",
+ "tests/test_library_source_search.mjs",
+ "tests/test_measurement_model.mjs",
+ "tests/test_museum_conditionals.mjs",
+ "tests/test_museum_conditionals_cli.mjs",
+ "tests/test_museum_conditionals_paths.mjs",
+ "tests/test_museum_conditionals_startup.mjs",
+ "tests/test_museum_frontend.mjs",
+ "tests/test_museum_geometry.mjs",
+ "tests/test_museum_identity.mjs",
+ "tests/test_node_status_atlas.mjs",
+ "tests/test_palette_export.mjs",
+ "tests/test_pin_export.mjs",
+ "tests/test_public_shop_app.mjs",
+ "tests/test_public_shop_frontend.mjs",
+ "tests/test_reader_experience.mjs",
+ "tests/test_reader_jump.mjs",
+ "tests/test_reader_navigation.mjs",
+ "tests/test_reading_list_citation.mjs",
+ "tests/test_research_desk.mjs",
+ "tests/test_snapshot_compare.mjs",
+ "tests/test_source_quote.mjs",
+ "tests/test_source_reference.mjs",
+ "tests/test_teaching_export.mjs",
+ "tests/test_workspace_navigation.mjs"
+ ],
+ "started": "2026-10-29T18:01:50.342380+00:00",
+ "finished": "2026-10-29T18:02:04.211672+00:00",
+ "exit": 0,
+ "seconds": 13.869299891999617,
+ "museum_pins": 34,
+ "shop_pins": 4,
+ "commit": "6fc021839072d8c34f41e18e77b0f618c53baa15"
+}
\ No newline at end of file
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node.stderr b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node.stderr
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node.stdout b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node.stdout
new file mode 100644
index 000000000..bea63ac27
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node.stdout
@@ -0,0 +1,772 @@
+✔ only the current query is announced after 500ms of quiet, even if its count repeats (2.622053ms)
+✔ hidden documents and page-cache transitions cancel pending speech and resume current results (0.953018ms)
+✔ Exact admitted claim/source identity exposes only the pinned arithmetic companion (3.932991ms)
+✔ Source-identical documents at another recorded revision retain their actual current pin (0.983433ms)
+✔ changed scope leaves the mapping unavailable (1.154726ms)
+✔ extra graph field leaves the mapping unavailable (0.870626ms)
+✔ changed source blob leaves the mapping unavailable (0.841924ms)
+✔ changed source size leaves the mapping unavailable (0.857807ms)
+✔ changed fingerprint leaves the mapping unavailable (0.760403ms)
+✔ missing source leaves the mapping unavailable (0.620446ms)
+✔ changed formal manifest leaves the mapping unavailable (1.123951ms)
+✔ An equal-looking different node ID is never inferred to be covered (0.557394ms)
+✔ Other actual claims keep missing mappings explicit (0.294385ms)
+✔ The actual older committed observation has a different manifest and remains unmapped (5.552993ms)
+✔ An execution for another revision cannot attach to the artifact (1.122068ms)
+✔ A fabricated accepted alignment cannot replace the pinned adverse record (0.816296ms)
+✔ Explicit current-manifest bridge exposes the historical artifact without rebinding its execution or review (4.31177ms)
+✔ an unknown manifest cannot use the explicit bridge (1.291007ms)
+✔ a wrong manifest size cannot use the explicit bridge (0.839511ms)
+✔ duplicate formal inventory cannot use the explicit bridge (0.698102ms)
+✔ changed claim scope cannot use the explicit bridge (0.799761ms)
+✔ an extra claim coverage field cannot use the explicit bridge (0.77171ms)
+✔ another declaration cannot replace the pinned evidence (1.043141ms)
+✔ a forged receipt with the same commit cannot replace the pinned evidence (0.92059ms)
+✔ a fabricated accepted review cannot replace the pinned evidence (1.625662ms)
+✔ An equally named different claim and prototype key remain unmapped (0.733303ms)
+✔ The separately pinned corrected manifest links only to historical execution, never to a transferred alignment (0.833622ms)
+✔ original refuses identical duplicate proof-source entries (1.041949ms)
+✔ original refuses conflicting duplicate proof-source entries (1.084002ms)
+✔ 8228 refuses identical duplicate proof-source entries (1.015981ms)
+✔ 8228 refuses conflicting duplicate proof-source entries (1.477753ms)
+✔ a22f refuses identical duplicate proof-source entries (1.029171ms)
+✔ a22f refuses conflicting duplicate proof-source entries (0.833822ms)
+✔ Atlas begins with its task and working search before the source inventory (2.617427ms)
+✔ The selector is the sole view switch while controller compatibility stays present (0.379961ms)
+✔ Secondary navigation is disclosed and graph-specific tools have a separate scope (0.423255ms)
+✔ Neighborhood coverage stays available without delaying the useful graph or list (0.350819ms)
+✔ The historical viewer is explicitly archived with preserved entry fragments (0.373552ms)
+✔ A closed historical archive cannot conceal a failed source or refused bookmark (0.207156ms)
+✔ Sharing the selected source snapshot remains a visible reading action (0.144674ms)
+✔ Atlas layout loads after current styles without replacing the shared brand (0.169681ms)
+✔ dependency and dependent cards preserve parallel typed source edges in their actual direction (2.193511ms)
+✔ an admitted isolated node has two explicit empty groups (0.223721ms)
+✔ missing and prototype names cannot acquire inferred connections (0.192875ms)
+✔ late optional data patches the currently selected node rather than its request-time selection (2.866956ms)
+✔ an older optional response cannot overwrite the newer acquisition even when it ignores abort (1.138592ms)
+✔ focused operational evidence is retained until focus leaves its section (1.170359ms)
+✔ a refused or no-longer-known selection receives no late substituted resume (1.575598ms)
+✔ pagehide aborts the request and suppresses an uncooperative late response (1.104231ms)
+✔ a persisted pageshow acquires current optional records once and preserves null fallback (1.141747ms)
+✔ missing cancellation platform does not prevent primary reading or late status coordination (2.509016ms)
+✔ spatial projection keeps directed typed recorded edges and never mutates evidence (2.481666ms)
+✔ dependency focus retains only selected dependent and its recorded direct dependencies (0.294585ms)
+✔ empty/filtered selection and ceiling never invent source nodes (1.909861ms)
+✔ actual wrapped label sizes stay inside the viewport and do not overlap (1.649797ms)
+✔ selected claim takes priority over nearer coincident nodes without changing identifiers (0.266504ms)
+✔ labels leave a distinct unselected node clear for actual canvas picking (1.25963ms)
+✔ camera-depth order and identifier ties are deterministic and inputs remain unchanged (1.373179ms)
+✔ empty/tiny viewports and invalid or clipped points never create invalid rectangles (0.2712ms)
+✔ edge anchors retain an in-bounds readable label when space permits (0.262748ms)
+✔ a150-node dense projection keeps a selected ID readable without pretending every label fits (2.968065ms)
+✔ brand assets exist and declare no scientific authority (4.333491ms)
+✔ dark and light text, links and state labels meet 4.5:1 contrast (2.148695ms)
+✔ buttons and focus ring have explicit contrast (0.405189ms)
+✔ palette tokens are actually applied, not decorative metadata (3.944858ms)
+✔ all public pages load local branding after legacy styles with no CSP relaxation (3.534171ms)
+✔ light, reduced-motion, forced-color and print modes are supplied (0.542792ms)
+✔ status classes retain redundant patterns and non-brand acceptance color (0.715487ms)
+✔ decorative SVGs are self-contained, named and contain no scripts or external embeds (0.757689ms)
+✔ body links remain underlined and keyboard focus is not removed (0.816005ms)
+✔ navigation and grids can reflow on small screens (0.837267ms)
+✔ styles do not hide evidence, scope disclaimers or refusal states (1.376363ms)
+✔ low-contrast adversarial palette fails the same numerical threshold (0.145706ms)
+✔ the museum figure focus ring keeps its 3px width, 4px offset and the clip room drawn for it (17.712057ms)
+✔ the conditional-route card leaves room inside its clip for the focus ring of its summaries and links (8.533106ms)
+✔ a bookmarked combined search restores the one exact proof and source link (116.976041ms)
+✔ typing preserves unrelated parameters, fragment and history state; share link only includes filters (37.680496ms)
+✔ popstate restores filters and pagination without rewriting history or stealing focus (42.350034ms)
+✔ clear filters recovers from no matches and resets pagination with search focus (39.249714ms)
+✔ unknown repository and duplicate parameters use documented first-value rules (40.86485ms)
+✔ encoded punctuation stays inert search text (27.354351ms)
+✔ catalog readiness uses the latest location while sources are still loading (27.656408ms)
+✔ an unavailable inventory keeps new controls unavailable and infers no results (18.325733ms)
+✔ a refused history update leaves filtering and the explicit search link usable (42.369418ms)
+✔ restored empty filters preserve the ordinary initial 50-row catalog (36.185632ms)
+✔ malformed UTF-8 query escapes remain inert and are canonically encoded in the link (45.56889ms)
+✔ verified category counts expose content and references directly without changing the source selection (36.05794ms)
+✔ changing categories resets both pagers and retains native selector focus (13.958201ms)
+✔ All preserves ordered overlapping categories and complete edge multiplicity (11.892549ms)
+✔ an empty category reports zero results with both pagers hidden (8.700248ms)
+✔ selection changes clear category state and ignore an older in-flight comparison (8.510242ms)
+✔ payload refusal and malformed history discard category results and announcements (9.42202ms)
+✔ Compare source panel demand loader exists (1.239291ms)
+✔ An explicit current-source query requests even the empty source search (1.589158ms)
+✔ Only a target in the actual source panel requests its verifier (1.752099ms)
+✔ Both pagers use distinct identities and ordinary, non-live count spans (6.958009ms)
+✔ acquisition: four owner cases: metadata, multiple excerpts, exact graph/reference, unresolved directory node (15.915903ms)
+✔ acquisition: new observation keeps older classification source unchanged (3.933811ms)
+✔ acquisition: same path in other allowed repository stays metadata (1.357265ms)
+✔ acquisition: whole-file reference and excerpt identities remain separate (1.124821ms)
+✔ acquisition: identical inventory duplicate (0.86636ms)
+✔ acquisition: conflicting inventory duplicate (11.079217ms)
+✔ acquisition: graph blob conflict (3.212546ms)
+✔ acquisition: graph bytes conflict (0.966698ms)
+✔ acquisition: graph missing exact inventory (0.793833ms)
+✔ acquisition: graph incorrect pin (1.367811ms)
+✔ acquisition: reference blob conflict (1.275163ms)
+✔ acquisition: reference bytes conflict (0.747154ms)
+✔ acquisition: reference missing exact inventory (1.838872ms)
+✔ acquisition: reference incorrect pin (0.976312ms)
+✔ acquisition: duplicate reference acquisition (0.860622ms)
+✔ acquisition: graph reference overlap (1.845997ms)
+✔ acquisition: excerpt missing exact row despite same path in Math (0.754985ms)
+✔ acquisition: excerpt incorrect pin (0.809075ms)
+✔ acquisition: excerpt duplicate id (0.819191ms)
+✔ acquisition: excerpt duplicate span (1.167375ms)
+✔ acquisition: excerpt digest mismatch (1.748983ms)
+✔ acquisition: excerpt lone surrogate (0.621518ms)
+✔ acquisition: excerpt boolean line (0.511165ms)
+✔ acquisition: excerpt empty id (0.518787ms)
+✔ acquisition: excerpt invalid range (0.450636ms)
+✔ acquisition: excerpt unsafe path (0.850877ms)
+✔ acquisition: malformed references collection (2.055958ms)
+✔ acquisition: malformed equations collection (0.20281ms)
+✔ acquisition: malformed sources collection (0.762126ms)
+✔ acquisition: invalid boolean inventory bytes (0.566817ms)
+✔ acquisition: inventory bytes exceed admitted bound (0.727415ms)
+✔ acquisition: graph points at Main (0.740134ms)
+✔ acquisition: invalid inventory repository (0.665563ms)
+✔ acquisition: independent errors sorted deduplicated (2.07141ms)
+✔ acquisition: non-string inventory repository is unavailable not an exception (1.257688ms)
+✔ acquisition: non-string reference repository is unavailable not an exception (0.960789ms)
+✔ acquisition: unsafe encoded inventory path (0.511726ms)
+✔ acquisition: lone surrogate inventory path (0.522532ms)
+✔ acquisition: excerpt line exceeds JS safe integer (0.338891ms)
+✔ acquisition: overlapping distinct spans are preserved (0.429745ms)
+✔ acquisition: integer-valued JSON byte number follows shared numeric semantics (0.563943ms)
+✔ acquisition: well-formed Unicode path boundary counts codepoints (0.570703ms)
+✔ acquisition: huge JSON byte number is unavailable not an exception (0.854833ms)
+✔ acquisition: graph identity array has malformed input disposition (0.637532ms)
+✔ current row keeps excerpt identities separate and renders hostile source text inertly (4.14288ms)
+✔ coherent canonical response needs one request and preserves the advertised observation (9.291847ms)
+✔ mixed publication recovers once at the page digest while retaining the same abort signal (2.365275ms)
+✔ persistent digest mismatch refuses after two requests and never admits the old observation (1.409873ms)
+✔ byte-count mismatch may recover but the recovery bytes are checked as strictly (1.954748ms)
+✔ HTTP refusal is not retried as an integrity mismatch (0.412529ms)
+✔ network failure is not retried and does not replace source identity (0.31104ms)
+✔ invalid schema with a correct digest is refused without a recovery request (1.361281ms)
+✔ fallback HTTP refusal remains unavailable (1.006707ms)
+✔ absence of digest verification cannot trigger an unverified fallback (0.737539ms)
+✔ aborted acquisition makes no recovery request (0.597924ms)
+✔ invalid advertised identity is rejected before a request can construct an injected URL (3.652436ms)
+✔ coherent canonical response needs one request and preserves the advertised observation (12.868481ms)
+✔ mixed publication recovers once at the page digest while retaining the same abort signal (3.479806ms)
+✔ persistent digest mismatch refuses after two requests and never admits the old observation (15.383627ms)
+✔ byte-count mismatch may recover but the recovery bytes are checked as strictly (1.253482ms)
+✔ HTTP refusal is not retried as an integrity mismatch (0.329376ms)
+✔ network failure is not retried and does not replace source identity (0.215979ms)
+✔ invalid schema with a correct digest is refused without a recovery request (1.065484ms)
+✔ fallback HTTP refusal remains unavailable (0.693104ms)
+✔ absence of digest verification cannot trigger an unverified fallback (0.462954ms)
+✔ aborted acquisition makes no recovery request (0.508542ms)
+✔ invalid advertised identity is rejected before a request can construct an injected URL (0.443775ms)
+✔ resume projection labels exact snapshot identity and separates review records from operational state (0.853672ms)
+✔ closed issues and accepted dispositions do not invent completion, ownership or a task link (0.235938ms)
+✔ lookalike operational metadata in the graph is never promoted to next action, owner or stop (0.226024ms)
+✔ missing fields stay explicitly not recorded (0.231241ms)
+✔ stale or disagreeing clocks change only the freshness state and keep every warning (0.46084ms)
+✔ shared source hashes do not transfer review fields or the explicit task pointer (0.161028ms)
+✔ only exact public review URLs link; issue numbers and other strings stay inert (0.369095ms)
+✔ unknown and prototype identifiers have no resume projection (0.166106ms)
+✔ explicit task records are frozen operational pointers to public records (0.469053ms)
+✔ static node pages render the identical projection for every real node and the fixtures (131.612048ms)
+✔ narrow startup and history fallback use List while an explicit Graph choice survives (0.560748ms)
+✔ implicit viewport defaults adapt in both directions and unknown view values are not preferences (0.383977ms)
+✔ enhancement moves the exact admitted DOM into stable labelled panels without a history write (1.500747ms)
+✔ horizontal arrow keys wrap focus without changing the selected panel or URL (0.418108ms)
+✔ activating a tab changes the visible panel exactly once and preserves one tab stop (0.450345ms)
+✔ node selection reveals Evidence before focus even when Diagnostics was selected (0.316027ms)
+✔ restoring absent or unknown panel values returns to browse without rewriting the address (0.338951ms)
+✔ layout URLs preserve all scientific pins, historical filters and independent searches (0.707044ms)
+✔ unmodified direct browse activation exits reading and focuses the browse entry point (0.807042ms)
+✔ modified browse clicks retain native open-link behavior (0.50063ms)
+✔ reader Back and Forward use ordinary browser history without creating entries (0.405449ms)
+✔ restoring history moves focus out of the now hidden reading or browse region (0.344829ms)
+✔ changing viewport repairs focus only when the currently focused browse content is hidden (0.397988ms)
+✔ the browse reading button enters Evidence and reset removes only presentation state (0.249649ms)
+✔ widening the viewport moves focus off mobile-only reader and browse controls (1.030542ms)
+✔ resize repairs focus after the renderer removes a focused source or graph child (0.818199ms)
+✔ resize recovers a mobile control blurred by CSS before the media change event (0.448152ms)
+✔ implicit graph-to-list resize repairs a connected hidden stage and preserves outside focus (0.479959ms)
+✔ native modified and auxiliary Browse use the current independent source filter without writing history (2.332556ms)
+✔ acquisition: four owner cases: metadata, multiple excerpts, exact graph/reference, unresolved directory node (5.667458ms)
+✔ acquisition: new observation keeps older classification source unchanged (0.666043ms)
+✔ acquisition: same path in other allowed repository stays metadata (0.735907ms)
+✔ acquisition: whole-file reference and excerpt identities remain separate (0.689749ms)
+✔ acquisition: identical inventory duplicate (0.795555ms)
+✔ acquisition: conflicting inventory duplicate (0.423205ms)
+✔ acquisition: graph blob conflict (0.686835ms)
+✔ acquisition: graph bytes conflict (0.53475ms)
+✔ acquisition: graph missing exact inventory (0.559787ms)
+✔ acquisition: graph incorrect pin (0.502473ms)
+✔ acquisition: reference blob conflict (0.46025ms)
+✔ acquisition: reference bytes conflict (0.604823ms)
+✔ acquisition: reference missing exact inventory (0.705983ms)
+✔ acquisition: reference incorrect pin (0.639455ms)
+✔ acquisition: duplicate reference acquisition (0.600778ms)
+✔ acquisition: graph reference overlap (0.771219ms)
+✔ acquisition: excerpt missing exact row despite same path in Math (0.878568ms)
+✔ acquisition: excerpt incorrect pin (0.376877ms)
+✔ acquisition: excerpt duplicate id (0.503834ms)
+✔ acquisition: excerpt duplicate span (0.461391ms)
+✔ acquisition: excerpt digest mismatch (0.551986ms)
+✔ acquisition: excerpt lone surrogate (0.631863ms)
+✔ acquisition: excerpt boolean line (0.615199ms)
+✔ acquisition: excerpt empty id (0.489273ms)
+✔ acquisition: excerpt invalid range (0.69691ms)
+✔ acquisition: excerpt unsafe path (0.462493ms)
+✔ acquisition: malformed references collection (0.659925ms)
+✔ acquisition: malformed equations collection (0.432028ms)
+✔ acquisition: malformed sources collection (0.958476ms)
+✔ acquisition: invalid boolean inventory bytes (3.717132ms)
+✔ acquisition: inventory bytes exceed admitted bound (2.683183ms)
+✔ acquisition: graph points at Main (0.853051ms)
+✔ acquisition: invalid inventory repository (0.635739ms)
+✔ acquisition: independent errors sorted deduplicated (0.469363ms)
+✔ acquisition: non-string inventory repository is unavailable not an exception (0.50739ms)
+✔ acquisition: non-string reference repository is unavailable not an exception (0.570102ms)
+✔ acquisition: unsafe encoded inventory path (0.441352ms)
+✔ acquisition: lone surrogate inventory path (0.613897ms)
+✔ acquisition: excerpt line exceeds JS safe integer (0.49436ms)
+✔ acquisition: overlapping distinct spans are preserved (0.603231ms)
+✔ acquisition: integer-valued JSON byte number follows shared numeric semantics (0.548801ms)
+✔ acquisition: well-formed Unicode path boundary counts codepoints (0.936264ms)
+✔ acquisition: huge JSON byte number is unavailable not an exception (0.547629ms)
+✔ acquisition: graph identity array has malformed input disposition (0.734325ms)
+✔ current row keeps excerpt identities separate and renders hostile source text inertly (3.022415ms)
+✔ current snapshot rejects invalid identities and preserves literal source values (0.813101ms)
+✔ freshness separates future, stale and current observations (0.111745ms)
+✔ source links bind safe paths to pinned commits and reject executable targets (0.302587ms)
+✔ focus expansion deduplicates multi-parent nodes and enforces render ceiling (0.553168ms)
+✔ five metadata axes and explicit mapping gaps never infer kernel or review approval (0.241097ms)
+✔ search and independent URL state preserve exact identifiers and reject unknown node (0.433851ms)
+✔ hash mismatch and malformed payload refuse current rendering (2.08199ms)
+✔ global graph search finds unloaded nodes and bounds large catalogs (2.984219ms)
+✔ equation and graph share bookmarks refuse changed main source instead of substituting (0.171904ms)
+✔ graph search filter survives source-bound URL state (0.100779ms)
+✔ prototype property names cannot become fabricated graph nodes (0.488822ms)
+✔ current reverse reach counts distinct nodes in a required diamond and excludes root (9.739999ms)
+✔ current required routes return one shortest route per unresolved research target (0.5827ms)
+✔ context-only unresolved targets affect all-edge reach but earn no required route (0.231552ms)
+✔ context shortcuts do not erase longer required routes and parallel edges count once (0.296358ms)
+✔ unresolved target kinds and classifications match the existing source vocabulary (0.336687ms)
+✔ actual graph retains the p15 boundary 1/0 and CH-LIFT 3/0 regressions (9.132101ms)
+✔ full reach and required routes do not depend on filtered or capped viewport (1.066816ms)
+✔ bounded graph windows expose complete match and frontier counts with paging (7.18174ms)
+✔ graph filters apply to complete matches without altering raw node labels or edges (0.345791ms)
+✔ equation text filtering retains inert literal content and bounded complete counts (1.075459ms)
+✔ atlas offset equation search and exact metadata filters survive URL state (0.422825ms)
+✔ the real admitted inspector exposes the exact source-linked arithmetic companion without parent coverage (38.846939ms)
+✔ claim summary puts exact scope and pinned source before continuation metadata (7.708718ms)
+✔ controller owns an explicit formal gap even without the spatial rendering platform (5.878424ms)
+✔ same-claim layout preserves disclosures while changed and refused claims reset their projection (8.932907ms)
+✔ missing source and scope stay explicit and recorded notes are not labelled hypotheses (6.107713ms)
+✔ atlas Graph and List apply each bookmarked exact metadata filter without changing source evidence (55.639884ms)
+✔ atlas metadata filters page the complete matching set and disclose the exact bookmark constraints (19.926227ms)
+✔ atlas filter bookmarks persist through search, node selection, reload and Back (17.773377ms)
+✔ atlas refuses mismatched source bookmarks before applying metadata filters (5.795583ms)
+✔ node identifiers and recorded source paths require own literal string fields (0.370738ms)
+✔ static reading links retain one advertised material archive among source links (0.637221ms)
+✔ static reading links refuse missing ambiguous and unsafe archive addresses (0.562371ms)
+✔ refused source identity survives view changes Share reload and history (63.78808ms)
+✔ initial Share and every non-adopting control preserve a refused identity (4.580036ms)
+✔ explicit current diagnostic selection alone may adopt current source pins (5.499204ms)
+✔ resume projection labels exact snapshot identity and separates review records from operational state (6.907294ms)
+✔ closed issues and accepted dispositions do not invent completion, ownership or a task link (0.376426ms)
+✔ lookalike operational metadata in the graph is never promoted to next action, owner or stop (0.351359ms)
+✔ missing fields stay explicitly not recorded (0.308857ms)
+✔ stale or disagreeing clocks change only the freshness state and keep every warning (4.928031ms)
+✔ shared source hashes do not transfer review fields or the explicit task pointer (0.31794ms)
+✔ only exact public review URLs link; issue numbers and other strings stay inert (0.466439ms)
+✔ unknown and prototype identifiers have no resume projection (0.324379ms)
+✔ explicit task records are frozen operational pointers to public records (1.35387ms)
+✔ static node pages render the identical projection for every real node and the fixtures (144.733798ms)
+✔ narrow startup and history fallback use List while an explicit Graph choice survives (1.207814ms)
+✔ implicit viewport defaults adapt in both directions and unknown view values are not preferences (0.280254ms)
+✔ enhancement moves the exact admitted DOM into stable labelled panels without a history write (1.958613ms)
+✔ horizontal arrow keys wrap focus without changing the selected panel or URL (0.431798ms)
+✔ activating a tab changes the visible panel exactly once and preserves one tab stop (0.544364ms)
+✔ node selection reveals Evidence before focus even when Diagnostics was selected (0.48054ms)
+✔ restoring absent or unknown panel values returns to browse without rewriting the address (0.424527ms)
+✔ layout URLs preserve all scientific pins, historical filters and independent searches (0.547589ms)
+✔ unmodified direct browse activation exits reading and focuses the browse entry point (2.836049ms)
+✔ modified browse clicks retain native open-link behavior (0.627507ms)
+✔ reader Back and Forward use ordinary browser history without creating entries (0.293543ms)
+✔ restoring history moves focus out of the now hidden reading or browse region (0.855664ms)
+✔ changing viewport repairs focus only when the currently focused browse content is hidden (0.25769ms)
+✔ the browse reading button enters Evidence and reset removes only presentation state (0.20963ms)
+✔ widening the viewport moves focus off mobile-only reader and browse controls (0.644021ms)
+✔ resize repairs focus after the renderer removes a focused source or graph child (0.695708ms)
+✔ resize recovers a mobile control blurred by CSS before the media change event (0.977835ms)
+✔ implicit graph-to-list resize repairs a connected hidden stage and preserves outside focus (0.413631ms)
+✔ native modified and auxiliary Browse use the current independent source filter without writing history (0.868302ms)
+✔ export records bounded current parameters, eigenvalues and zero boundary meaning (3.154861ms)
+✔ negative decimal grid eigenvalues stay canonical across figure model, metadata, citation and footer (7.685003ms)
+✔ accepted floating-point step tolerance normalizes before classifying and replaying the figure (5.680092ms)
+✔ invalid, out-of-range or off-step parameters and false timestamps are refused (0.550704ms)
+✔ citation keeps only the canonical figure permalink and pinned teaching source (0.35224ms)
+✔ SVG retains actual geometry, concrete theme, aria names and visible teaching footer (0.9482ms)
+✔ DOM capture accepts actual plain labels with empty class and omits exported classes (2.699087ms)
+✔ light theme colors are exported from the captured record (0.829425ms)
+✔ inherited native system font stacks remain self-contained without remote font syntax (0.606266ms)
+✔ all diagram text and attribute values are XML escaped (0.72413ms)
+✔ XML-forbidden BMP noncharacters are refused in every displayed text kind (3.069725ms)
+✔ blank, stale or unsupported diagram content is refused instead of exported (3.388656ms)
+✔ clipboard absence exposes manual citation and never permits copy (0.463916ms)
+✔ clipboard denial preserves the current manual text and reports failure (0.253294ms)
+✔ pending clipboard writes are serialized and cannot report stale settings as copied (0.315626ms)
+✔ capture refusal clears the current citation text and blocks a later copy (0.598334ms)
+✔ capture refusal during a pending copy clears text and cannot claim stale success or fallback (0.472398ms)
+✔ a successful current write reports success, while unavailable figures block later writes (0.20983ms)
+✔ evidence shows recorded links without promoting missing review or formal evidence (2.737694ms)
+✔ evidence retains unsafe paths as metadata and never turns a reference into verification (0.515902ms)
+✔ all-records and exact classification filters intersect text without relabeling nodes (23.155344ms)
+✔ saved filters restore exact state and visibly reject unknown classifications (3.691273ms)
+✔ recorded context keeps reading-rule order and resolves only recorded same-graph references (2.25401ms)
+✔ absent context is visibly not recorded and is never inferred from dependencies (2.463479ms)
+✔ unresolved and unsafe context references stay literal without executable destinations (2.086397ms)
+✔ malformed context preserves complete recorded values instead of inventing references (2.270434ms)
+✔ context presentation does not change graph edges, impact ranking, classifications or existing search (2.468907ms)
+✔ dependency startup preserves complete source metadata and search after 0 ms digest delay (53.52216ms)
+✔ dependency startup preserves complete source metadata and search after 150 ms digest delay (169.189526ms)
+✔ dependency startup preserves complete source metadata and #object-evidence after 0 ms digest delay (31.641134ms)
+✔ dependency startup preserves complete source metadata and #object-evidence after 150 ms digest delay (167.553917ms)
+✔ dependency startup preserves complete source metadata and #object-audit after 0 ms digest delay (15.652913ms)
+✔ dependency startup preserves complete source metadata and #object-audit after 150 ms digest delay (176.874774ms)
+✔ dependency startup preserves complete source metadata and #object-reading-context after 0 ms digest delay (19.417954ms)
+✔ dependency startup preserves complete source metadata and #object-reading-context after 150 ms digest delay (165.698394ms)
+✔ the pinned graph is complete and structurally valid (1.02523ms)
+✔ unresolved targets include open leaves with no recorded dependents (1.507795ms)
+✔ unresolved targets rank by transitive impact without hiding zero-impact leaves (1.359125ms)
+✔ downstream counts keep all-edge reach separate from required-only reach (1.070477ms)
+✔ the pinned snapshot keeps its recorded counterexample and 19 differing counts (3.417095ms)
+✔ reach labels state their edge scope and do not describe reach as blocking (1.648384ms)
+✔ search covers ids, notes, source paths, classifications and edge relations (1.581484ms)
+✔ the app verifies graph bytes against a compiled source identity before parsing (2.667404ms)
+✔ classification styling and metadata preserve source review lineage (1.873136ms)
+✔ classification CSS identifiers use locale-neutral ASCII case folding (0.214928ms)
+✔ dependency paths use required source edges and retain relation metadata (3.202367ms)
+✔ saved node links fail visibly instead of selecting an unrelated node (1.278325ms)
+✔ provenance pins the exact Math source bytes and labels the snapshot boundary (0.732486ms)
+✔ the viewer page exposes its source boundary and accessible interaction contract (1.627743ms)
+✔ the evidence table keeps automatic layout and breaks words only in Source detail (2.352197ms)
+✔ the three schema-absent evidence lanes read identically for different nodes and never claim a failure (1.777966ms)
+✔ recorded review text quotes the disposition and provider(s), names review fields recorded without one, and reports absence only when no review field exists (1.831896ms)
+✔ the static classification options and token list equal the pinned graph and stay disabled until verified (1.185698ms)
+✔ the static vocabulary quotes exactly the classifications, layers, kinds and non-discharge tokens of the pinned graph (1.219217ms)
+✔ the unresolved-target sentence names exactly the viewer list rule (0.94464ms)
+✔ the page states the rendered bytes as PROVENANCE pins them and dates its currency read (11.908097ms)
+✔ the cone classifies signs, retaining both zero-eigenvalue boundaries (2.383022ms)
+✔ cone weight is determinant squared only on the negative-definite side (0.280386ms)
+✔ halving pin distance divides cubic gap by eight and annulus radii by two (0.389437ms)
+✔ remote membership uses fixed distance and an open height window (0.247467ms)
+✔ all eight three-object subsets receive the correct capacity-one partition (0.347325ms)
+✔ models reject invalid or unrepresentable teaching parameters (0.688881ms)
+✔ shared parameters restore all three experiments, including empty selection (0.859615ms)
+✔ invalid numeric links are reported and defaulted without clamping or partial coercion (1.102985ms)
+✔ invalid choices cannot invent regions or objects (0.254918ms)
+✔ sharing serializes current controls and preserves section and unrelated query fields (0.437919ms)
+✔ curvature presets draw and commit the selected controls with matching share and export state (2.110289ms)
+✔ unknown curvature presets leave controls and current figure untouched (0.138125ms)
+✔ PNG embeds exact structured figure metadata and UTF-8 citation without changing image chunks (4.610404ms)
+✔ PNG refuses malformed signature, truncated or oversized chunks, corrupt CRC and trailing bytes (1.846106ms)
+✔ PNG refuses missing or misplaced required chunks, mismatched dimensions and preexisting text metadata (2.07086ms)
+✔ PNG refuses unbounded or unsupported metadata, citations and target dimensions (1.749794ms)
+✔ controller downloads once only after asynchronous preparation and final unchanged recapture (1.164076ms)
+✔ controller coalesces repeated activation while a preparation is pending (0.503116ms)
+✔ changed or tampered final SVG, metadata or citation refuses download (0.953623ms)
+✔ control revision cancels work even after a change away and back (0.51947ms)
+✔ late failure from an invalidated operation cannot erase newer successful state (0.718675ms)
+✔ capture, preparation, null result and download errors stay explicit and allow retry (2.041086ms)
+✔ unready controller cannot prepare or download a figure (0.206777ms)
+✔ PNG refuses an empty image-data stream even when chunk CRCs and dimensions are valid (0.312023ms)
+✔ rasterizer refuses missing canvas context before image work and releases canvas storage (0.826085ms)
+✔ rasterizer image decode, dimension, encoder and null-output failures release all resources (1.364533ms)
+✔ rasterizer is bounded by its timeout and abort signal, with no late image callbacks (7.819682ms)
+✔ existing and unknown collection bookmarks retain Files while explicit text survives (2.639834ms)
+✔ collection links preserve literal query and independent state without changing the target (0.37782ms)
+✔ an excerpt link retains exact source commit, literal filename and complete line range (0.344751ms)
+✔ invalid or missing excerpt ranges cannot become invented source line identities (0.172125ms)
+✔ search links preserve literal text and unrelated page state (1.355189ms)
+✔ empty queries remove only the current-source parameter (0.210452ms)
+✔ no initialization on another page or before snapshot admission (0.302038ms)
+✔ aggregate count uses area, all realizations, and bin width exactly once (4.065476ms)
+✔ twice the count gives twice the mass and density (0.334125ms)
+✔ adding zero-count realizations still increases the denominator (0.293165ms)
+✔ a wider synthetic bin preserves mass and divides density by its width (0.342998ms)
+✔ zero counts produce valid zero estimates without a fabricated positive floor (0.363058ms)
+✔ counts and realization totals reject fractions, unsafe integers, and nonnumbers (0.913904ms)
+✔ only positive ordered finite bin edges are accepted (0.60013ms)
+✔ normalization refuses unsafe exposure and overflow or underflow in positive density (0.401085ms)
+✔ input parsing rejects blanks instead of turning them into zero counts (1.316882ms)
+✔ decimal input, including scientific notation, reaches the same normalization (1.366465ms)
+✔ decimal conversion cannot round a fractional count to an integer or a nonzero input to zero (0.622102ms)
+✔ six complete inputs feed exactly one conditional conclusion (9.622343ms)
+✔ the normalization and fixed lower comparison are retained (1.961568ms)
+✔ measurability and almost-everywhere quantifiers are retained (0.804583ms)
+✔ positive and zero cases and the density non-implication remain explicit (1.084928ms)
+✔ changed source bytes are refused before projection (1.465462ms)
+✔ integer and mutable commit identities are refused (0.510847ms)
+✔ a numeric hash cannot be coerced into a string (0.289309ms)
+✔ private repository and changed proof paths are refused (0.381666ms)
+✔ redirected URL and changed blob or size are refused (0.460843ms)
+✔ deleting H3 cannot silently weaken the route (2.345968ms)
+✔ ALL cannot become ANY (2.255334ms)
+✔ self dependency or unknown nodes are refused (2.898306ms)
+✔ invented acceptance and independence fields are refused (11.50849ms)
+✔ rendering exposes hypotheses, exact identity, and application boundary (1.57165ms)
+✔ a failed load clears any earlier ready view and says so in the status line (0.572028ms)
+✔ a page without the status line still shows the refusal in the host, without a role (0.319624ms)
+✔ the source fixture is complete and immutable (1.21454ms)
+✔ museum HTML has the route host, navigation and module without replacing existing cards (1.669665ms)
+✔ CLI projects the exact source and produces deterministic JSON (103.428168ms)
+✔ CLI rejects altered manifest bytes (51.32353ms)
+✔ CLI refuses missing or repeated conditional claim (76.231933ms)
+✔ CLI rejects weakened projection in check mode (126.232322ms)
+✔ CLI rejects nonlocal manifest and malformed hash types (136.416223ms)
+✔ CLI refuses missing input and unknown options (78.342602ms)
+✔ CLI rejects source substitution (46.688123ms)
+✔ the pull_request filter keeps every earlier path and adds the shared museum fixture (1.702424ms)
+✔ a fixture-only change was missed before and now runs the conditional suites (0.445159ms)
+✔ existing matching paths stay matched and unrelated paths stay excluded (0.224893ms)
+✔ every local file the conditional suites and replay tool load triggers the workflow (3.329325ms)
+✔ a verified startup renders the route from the selected claim proof bytes (32.846209ms)
+✔ the museum page and the conditional route share one verified startup and byte cache (9.743984ms)
+✔ a rejected startup is not retained for a later caller (3.324958ms)
+✔ changed proof bytes clear an earlier view and infer nothing (2.156607ms)
+✔ a manifest proof that is not the audited descriptor is refused before its bytes are fetched (2.055437ms)
+✔ a stale manifest stops before any pinned remote request (1.442058ms)
+✔ a page without the route container is left untouched (0.591958ms)
+✔ a verified route: the outcome is written to the attached role="status" line after the host changes (3.420851ms)
+✔ a verified route: nothing inserted into the route host carries a role or is live (2.142867ms)
+✔ a changed museum.json at startup: the outcome is written to the attached role="status" line after the host changes (16.011605ms)
+✔ a changed museum.json at startup: nothing inserted into the route host carries a role or is live (1.340998ms)
+✔ a stale manifest: the outcome is written to the attached role="status" line after the host changes (1.72675ms)
+✔ a stale manifest: nothing inserted into the route host carries a role or is live (1.353256ms)
+✔ a manifest proof that is not the audited descriptor: the outcome is written to the attached role="status" line after the host changes (1.576276ms)
+✔ a manifest proof that is not the audited descriptor: nothing inserted into the route host carries a role or is live (2.918586ms)
+✔ changed proof bytes: the outcome is written to the attached role="status" line after the host changes (2.103459ms)
+✔ changed proof bytes: nothing inserted into the route host carries a role or is live (2.039043ms)
+✔ an unavailable museum module: the outcome is written to the attached role="status" line after the host changes (0.612498ms)
+✔ an unavailable museum module: nothing inserted into the route host carries a role or is live (0.375887ms)
+✔ a manifest without the route claim: the outcome is written to the attached role="status" line after the host changes (0.601712ms)
+✔ a manifest without the route claim: nothing inserted into the route host carries a role or is live (0.358852ms)
+✔ museum.html has exactly one route status line: static, role="status", directly before an empty host (0.248579ms)
+✔ on a first run the static Verifying… line receives no write while the route is verified (2.958516ms)
+✔ an older page without the status line shows one plain Verifying… paragraph in the host until the refusal replaces it (1.073311ms)
+✔ an older page without the status line still shows the refusal as a plain paragraph in the host (1.057538ms)
+✔ an older page without the status line draws only the route on success (9.662403ms)
+✔ relative links resolve from the quoting source directory and commit, not the proof or live branch (5.624768ms)
+✔ quoted exact review comments and intentionally mutable source pointers keep their identities (1.438622ms)
+✔ unrecognized schemes, foreign destinations, encoded traversal and malformed identities stay literal (0.341937ms)
+✔ source HTML is always text and unsupported Markdown retains its literal spelling (1.584489ms)
+✔ every committed quote retains all wording and its original source independently of formatting (5.020311ms)
+✔ unsupported parenthesized destinations and Markdown link titles stay wholly literal (0.857862ms)
+✔ museum exposes source-bound rendering rather than silently omitting the page (0.129332ms)
+✔ a delayed initial museum bookmark still reaches its verified claim when untouched (40.985295ms)
+✔ museum wheel while verifying sources cancels delayed focus and scroll (5.359625ms)
+✔ museum keydown while verifying sources cancels delayed focus and scroll (5.083566ms)
+✔ museum pointerdown while verifying sources cancels delayed focus and scroll (2.975511ms)
+✔ museum focusin while verifying sources cancels delayed focus and scroll (4.57399ms)
+✔ museum hashchange while verifying sources cancels delayed focus and scroll (3.948142ms)
+✔ museum popstate while verifying sources cancels delayed focus and scroll (2.794773ms)
+✔ museum pagehide while verifying sources cancels delayed focus and scroll (25.490406ms)
+✔ full reviewed bullets, the reconciled D1 row and both AMEND rows retain their classes and source wording (1.239117ms)
+✔ source display cannot promote a counterexample or an AMEND row (0.794588ms)
+✔ a genuine source elsewhere in the index cannot replace this claim proof or scope (0.560011ms)
+✔ replay command must occur exactly in the verified replay source (1.923541ms)
+✔ lifetime source identity must match D2 and packets must use the pinned main snapshot (1.042615ms)
+✔ malformed, mutable and falsely displayed source identities are refused before fetch (0.292985ms)
+✔ verified source bytes are required before a claim can be presented (1.269211ms)
+✔ streamed responses stop at the byte cap and cancel the reader (0.904861ms)
+✔ a stalled response body is aborted within its request deadline (15.389483ms)
+✔ review comment pointers cannot masquerade as byte-frozen comment content (0.543206ms)
+✔ the accepted D1 row binds its STATUS quote, index-pinned proof and byte-bound review (1.008505ms)
+✔ packet index refuses a foreign packet, changed scientific effect and mismatched result path (1.564089ms)
+✔ new landed chart packet requires its exact separate main commit and remains engineering-only (1.023888ms)
+✔ rendered claims use declared HTML containers, complete identities and literal disclaimer (5.361548ms)
+✔ museum manifest must match the config byte count and SHA-256 before source projection (2.793801ms)
+✔ museum.html keeps its two evidence live regions and a separate current observation region (0.784012ms)
+✔ brand.css keeps the route status line visible and in the error colour when it refuses (0.930529ms)
+✔ refused cards carry no role and are not live; the museum status line counts every one of them (3.785812ms)
+✔ an unknown exhibit is counted in the museum status line like any other unavailable view (3.853212ms)
+✔ a declared exhibit that cannot be shown is counted in the museum status line (4.096762ms)
+✔ the dependency-record join map binds each card to its graph node by exact path and SHA-256, never by title (0.99208ms)
+✔ a coherent old browser cache cannot hide the newly pinned packet (12.78693ms)
+✔ a mixed new config and stale museum manifest fails closed (2.521408ms)
+✔ actual pinned museum renders all cards and rejects cross-claim source, scope and replay substitutions (14.227971ms)
+✔ verified claim quotes expose readable source and exact review citations (3.440921ms)
+✔ readable presentation retains the exact original source quote in a disclosure (4.880525ms)
+✔ packet cards render in manifest order when the first packet arrives last (14.809663ms)
+✔ a refused packet keeps its manifest slot when the other packet arrives later (7.665903ms)
+✔ every refused packet is counted in the museum status line (8.157773ms)
+✔ a rendered packet replaces its Verifying placeholder (7.748922ms)
+✔ EC014 rejects degenerate pins and retains the declared raw and corrected row orders (2.565603ms)
+✔ remote membership keeps rho fixed and excludes all heights outside the open pin window (0.259644ms)
+✔ annulus membership uses scaled coordinates with fixed A and B in dimension two (0.309248ms)
+✔ P15 exact finite example partitions every proper subset and rejects the full triple (0.453972ms)
+✔ unsupported kinds and mismatched source descriptors do not render geometry or request CDN code (0.66151ms)
+✔ all static exhibits render with no WebGL or CDN dependency and preserve excluded regions (2.810606ms)
+✔ remote exclusion and annulus open complements are filled by defined SVG hatches (0.790192ms)
+✔ P15 vertex toggles change the actual decomposition result (0.665226ms)
+✔ EC014 retains complete two-dimensional content when WebGL is missing or CDN fails (1.813168ms)
+✔ EC014 live status follows the visible view through 3D, 2D and back (3.249687ms)
+✔ correct source bytes cannot acquire a different valid-looking commit (1.192198ms)
+✔ exported projection preserves the complete audited source descriptor (6.235103ms)
+✔ offline CLI refuses coherent hash-correct source relabeling (58.828104ms)
+✔ published node-status records are real graph nodes with a valid owner and no mathematical flags (134.396384ms)
+✔ a record with an owner but no evidence_url fails validation (303.182525ms)
+✔ closed schema, evidence pattern, and primary source_rev are enforced (1011.785924ms)
+✔ pinned rev equals the blob or tree commit segment (275.587264ms)
+✔ carried_forward resolution_url uses the shared comment pattern (364.462994ms)
+✔ released_url keeps the owner object and the atlas says released (122.202067ms)
+✔ resume projection shows a node-status view and refuses an owner without evidence (509.352724ms)
+✔ a valid observed_at and source_rev refresh still validates and renders (188.526283ms)
+✔ the atlas resume section passes the published node-status view into resumeProjection (2.402061ms)
+✔ lifetime continuation exposes conditional R1 evidence without promoting the general graph claim (134.444063ms)
+✔ all eight selections export the displayed capacity-one assignments with 1-based IDs (3.230689ms)
+✔ the failed triple explicitly records an attempted placement rather than a valid partition (0.449496ms)
+✔ normalization sorts without mutating input and excludes unrelated state from the permalink (0.186096ms)
+✔ malformed selections and noncanonical or false ISO timestamps are refused (0.489515ms)
+✔ metadata carries the exact pinned finite source and non-certifying scope (0.389096ms)
+✔ plaintext citations identify selected objects, actual empty groups and failed placement (1.377933ms)
+✔ expected nodes match every current drawPalette selection including empty labels and failed connectors (2.033895ms)
+✔ SVG preserves displayed geometry and both concrete themes with source metadata and a readable scope footer (20.766904ms)
+✔ stale selection, labels, connectors, arbitrary roots and missing content are refused (2.193592ms)
+✔ the visible footer records the same ISO generation timestamp as export metadata (1.079881ms)
+✔ inherited native font stacks on actual non-text primitives remain self-contained (1.051088ms)
+✔ unsupported active, resource, nested or hidden content cannot pass a matching geometry export (3.127766ms)
+✔ pin metadata records current bounded controls, teaching choices, scale geometry and full pinned source identities (2.95437ms)
+✔ only displayed hundredth-tick controls and canonical ISO times are accepted (0.996567ms)
+✔ citation includes selected highlight, full sources, qualitative limits and a feature-only permalink (0.574872ms)
+✔ expected geometry matches the actual independent annulus and remote records at both comparison settings (17.541332ms)
+✔ pin export refuses stale pins, ring width, height window, remote path, labels and extra resources (4.410588ms)
+✔ the visible pin footer records the same ISO generation timestamp as metadata (1.347267ms)
+Public shop base interactions passed: 2138 original rows, exact decimals, search and selection.
+✔ SIDE24 always identifies the engineering exhibit before the controls (1.258455ms)
+✔ count cards and every status row retain their own source context (2.360849ms)
+✔ repository and path filters combine with search and reset pagination (16.882966ms)
+✔ query view shows its pin and the local byte-check command without a live ref control (0.334346ms)
+✔ brand assets exist and declare no scientific authority (2.082837ms)
+✔ dark and light text, links and state labels meet 4.5:1 contrast (1.194971ms)
+✔ buttons and focus ring have explicit contrast (0.374595ms)
+✔ palette tokens are actually applied, not decorative metadata (4.442726ms)
+✔ all public pages load local branding after legacy styles with no CSP relaxation (1.770705ms)
+✔ light, reduced-motion, forced-color and print modes are supplied (0.91004ms)
+✔ status classes retain redundant patterns and non-brand acceptance color (0.737934ms)
+✔ decorative SVGs are self-contained, named and contain no scripts or external embeds (0.726056ms)
+✔ body links remain underlined and keyboard focus is not removed (0.854126ms)
+✔ navigation and grids can reflow on small screens (0.652948ms)
+✔ styles do not hide evidence, scope disclaimers or refusal states (1.237154ms)
+✔ low-contrast adversarial palette fails the same numerical threshold (0.192426ms)
+✔ the museum figure focus ring keeps its 3px width, 4px offset and the clip room drawn for it (16.086526ms)
+✔ the conditional-route card leaves room inside its clip for the focus ring of its summaries and links (8.59453ms)
+✔ valid source preserves exact strings (47.736041ms)
+✔ local pinned data bypasses an older response while still verifying current bytes (4.682932ms)
+✔ digest mismatch refuses data (4.369978ms)
+✔ byte count mismatch refuses data (0.487253ms)
+✔ mutable branch URL refused before request (0.170893ms)
+✔ HTTP failure gives no data (0.51239ms)
+✔ status snapshot counts are selected rows (1.087712ms)
+✔ unknown category refused (0.233366ms)
+✔ changed count refused (0.118255ms)
+✔ promotion authority refused (0.109012ms)
+✔ coefficient endpoints remain distinct exactly (0.205755ms)
+✔ float endpoints refused (0.117444ms)
+✔ coefficient acceptance flag cannot be flipped (0.084355ms)
+✔ catalog points at immutable public paths (0.153027ms)
+✔ catalog rejects private repo and traversal (0.119587ms)
+✔ correct bytes cannot be attributed to a different commit (0.212405ms)
+✔ correct bytes cannot be attributed to a different path (0.15513ms)
+✔ Home explains the landscape before publication machinery (1.49105ms)
+✔ Explore reaches a real local control and result before source publication (1.088935ms)
+✔ Research opens with questions, explicit editorial date and an accessible preserved archive (1.116205ms)
+✔ Research reading map routes to all four preserved introductory paths (1.978132ms)
+✔ Library routes present-day discovery separately from dated records (0.681961ms)
+✔ Deep archived fragments reveal every ancestor without focus or history writes (1.587984ms)
+✔ Repeated eligible same-page links reopen collapsed fragment ancestors without focus writes (0.43808ms)
+✔ Fragment restoration leaves modified, prevented and nonlocal navigation untouched (2.692211ms)
+✔ current readers expose consistent native task links with real destinations (12.12965ms)
+✔ missing and already-enhanced menus receive no extra listeners (0.342988ms)
+✔ workspace refreshes configuration before validating current source pins (82.930463ms)
+✔ catalog hashes remain metadata-only through pagination and filtering (45.877867ms)
+✔ initial Library navigation is restored only after delayed layout and failed sources settle (27.628425ms)
+✔ existing section bookmarks all receive keyboard focus after rendering (83.654035ms)
+✔ empty, unknown and malformed fragments never trigger a correction (173.919767ms)
+✔ reader wheel during loading prevents delayed scrolling and focus stealing (19.831608ms)
+✔ reader touchstart during loading prevents delayed scrolling and focus stealing (37.895619ms)
+✔ reader touchmove during loading prevents delayed scrolling and focus stealing (26.286385ms)
+✔ reader keydown during loading prevents delayed scrolling and focus stealing (20.527149ms)
+✔ reader pointerdown during loading prevents delayed scrolling and focus stealing (19.986497ms)
+✔ reader pointermove during loading prevents delayed scrolling and focus stealing (34.916945ms)
+✔ reader focusin during loading prevents delayed scrolling and focus stealing (21.333704ms)
+✔ reader hashchange during loading prevents delayed scrolling and focus stealing (19.579519ms)
+✔ reader popstate during loading prevents delayed scrolling and focus stealing (32.133433ms)
+✔ reader pagehide during loading prevents delayed scrolling and focus stealing (35.469208ms)
+✔ unpressed pointer movement while sources load does not cancel Library navigation (23.127919ms)
+✔ a changed fragment is not restored even without a hashchange event (18.970521ms)
+✔ changing a fragment and returning to it leaves the pending correction cancelled (18.653621ms)
+✔ browser fragment scrolling and layout shifts do not count as reader intent (34.402998ms)
+✔ a refused configuration still reveals the requested unavailable section (2.557712ms)
+✔ a missing target is harmless after loading and removes temporary observers (27.848932ms)
+✔ reader movement between source settlement and final rendering prevents correction (29.97244ms)
+✔ an import refusal does not leave the separate query source loading forever (32.040756ms)
+✔ a config refusal settles every pending source note (2.190407ms)
+✔ a query refusal preserves verified import custody information (32.328623ms)
+✔ a successful query remains usable when the unrelated import source fails (21.962386ms)
+✔ the static proof link names the pinned proof that the script also assigns (0.337801ms)
+✔ a refused pinned source names the pinned GitHub route beside the refusal (26.616035ms)
+✔ a fetch that throws is reported as an unreachable pinned source, and other errors pass through (1.832496ms)
+✔ a bookmarked combined search restores the one exact proof and source link (23.522459ms)
+✔ typing preserves unrelated parameters, fragment and history state; share link only includes filters (23.755144ms)
+✔ popstate restores filters and pagination without rewriting history or stealing focus (28.647546ms)
+✔ clear filters recovers from no matches and resets pagination with search focus (28.534518ms)
+✔ unknown repository and duplicate parameters use documented first-value rules (31.850925ms)
+✔ encoded punctuation stays inert search text (21.832964ms)
+✔ catalog readiness uses the latest location while sources are still loading (20.219132ms)
+✔ an unavailable inventory keeps new controls unavailable and infers no results (19.81306ms)
+✔ a refused history update leaves filtering and the explicit search link usable (32.832229ms)
+✔ restored empty filters preserve the ordinary initial 50-row catalog (16.390457ms)
+✔ malformed UTF-8 query escapes remain inert and are canonically encoded in the link (20.550454ms)
+✔ every former landing section routes to its preserved workspace section (0.988345ms)
+✔ new home fragments and untrusted fragments never become redirect destinations (0.145556ms)
+✔ browser entry follows a bookmarked section and future hash changes (0.796872ms)
+✔ the reader home does not preload the technical inventory or source viewer (0.275588ms)
+✔ verified source cards become reachable after asynchronous rendering (2.007596ms)
+✔ saved source hands exact fields to the same-site reference builder (5.502987ms)
+✔ Git blob alone never becomes a file SHA-256 or inferred author/review field (0.81639ms)
+✔ valid punctuation and Unicode roundtrip without changing the literal Git path (0.607751ms)
+✔ valid reading-list paths outside the Cite contract return explicit unavailable signal (1.730239ms)
+✔ queries and malformed or overprivileged imported records cannot become references (1.090556ms)
+✔ imported notes refuse raw duplicate schema and source identity keys (3.943035ms)
+✔ source-button identity matches legal filename URI spellings without conflating path segments (0.370419ms)
+✔ valid entries retain exact identities and normalize only search whitespace (1.223914ms)
+✔ entries require exact plain JSON data records with no inherited or executable fields (0.544377ms)
+✔ unexpected keys never become imported links, statuses or inferred metadata (0.375577ms)
+✔ required properties and string types cannot be coerced or defaulted (1.265136ms)
+✔ source repositories and commits must name an allowed owner and exact immutable commit (0.441695ms)
+✔ source paths reject absolute, dot, empty, backslash, URL and control segments (0.55994ms)
+✔ dates reject calendar overflow, offsets and invalid timestamp types (1.342289ms)
+✔ Git blobs, SHA-256 and byte counts retain distinct validated types (0.713959ms)
+✔ search filters are bounded inert text with collection-specific repositories (0.657995ms)
+✔ source links are reconstructed from exact pins with literal raw Git path encoding (0.404609ms)
+✔ current search links omit every catalog and unrelated parameter (0.309309ms)
+✔ catalog search links omit current parameters and roundtrip all catalog filters (0.280256ms)
+✔ blank saved searches restore their collection all-files view (0.223171ms)
+✔ entry identity separates source pins and normalized collection search contexts (1.029787ms)
+✔ list parsing rejects malformed JSON, schema drift and unexpected root fields (0.617946ms)
+✔ 128 KiB input ceiling uses UTF-8 bytes before JSON parsing (5.830293ms)
+✔ merge validates every entry before returning and leaves inputs unchanged (0.679027ms)
+✔ deduplication keeps first context and enriches absent identity metadata (0.743562ms)
+✔ conflicting byte, Git blob or SHA-256 identity metadata rejects the entire merge (1.171997ms)
+✔ capacity counts unique entries and overflow is atomic (4.807842ms)
+✔ exported JSON carries only strict schema data and roundtrips identity types (0.61382ms)
+✔ export rejects oversized identities instead of creating an unimportable file (1.096325ms)
+✔ combined UTF-8 export size rejects additions atomically even below entry capacity (9.612169ms)
+✔ comparison model is implemented (4.073068ms)
+✔ literal fields preserve array order and number versus boolean (0.302899ms)
+✔ real retained archives distinguish pin moves from blob/byte moves (376.560497ms)
+✔ payload integrity refuses byte and digest mismatch (2.969251ms)
+✔ unsafe public paths and unsupported versions refuse (0.571818ms)
+✔ duplicate inventory identities refuse; complete edge multiplicity survives (54.347472ms)
+✔ schema2 validates projection and refuses to describe omitted inventory as deleted (39.706338ms)
+✔ registry binds selected own descriptors and metadata publication (10.035156ms)
+✔ bounded acquisition refuses oversized responses and follows no redirects (32.580244ms)
+✔ publication acquisition verifies registry hash before admitting choices (46.255606ms)
+✔ page advertised identity refuses a different publication (1.404262ms)
+✔ decoded byte identity survives HTTP content encoding (0.725506ms)
+✔ raw duplicate node IDs refuse even when exact byte digest matches (5.865375ms)
+✔ strict raw JSON refuses escaped equivalent keys and accepts scoped nested keys (0.650605ms)
+✔ raw duplicate metadata and hash-matching registry keys refuse (6.247321ms)
+✔ producer-admitted identical current/archive bytes retain distinct typed selections (119.938108ms)
+✔ material selection labels distinguish archive semantic ID from exact payload digest and bytes (0.675732ms)
+✔ relative links resolve from the quoting source directory and commit, not the proof or live branch (1.159779ms)
+✔ quoted exact review comments and intentionally mutable source pointers keep their identities (0.2832ms)
+✔ unrecognized schemes, foreign destinations, encoded traversal and malformed identities stay literal (0.287386ms)
+✔ source HTML is always text and unsupported Markdown retains its literal spelling (3.00856ms)
+✔ every committed quote retains all wording and its original source independently of formatting (4.508864ms)
+✔ unsupported parenthesized destinations and Markdown link titles stay wholly literal (1.4504ms)
+✔ builds an immutable repository or file reference without attributing authorship (3.326581ms)
+✔ rejects mutable refs, unsupported repositories and ambiguous or unsafe paths (0.790431ms)
+✔ allows unicode file names and unambiguous encoded URL delimiters (0.837782ms)
+✔ real form wiring clears stale output and announces a corrected reference (0.80946ms)
+✔ coefficient exports preserve exact narrow decimal enclosures and pinned identity (1.554764ms)
+✔ coefficient exports retain strict SIDE24 bounds and paste-ready display math (0.414955ms)
+✔ coefficient exports refuse rounded numbers, reversed enclosures and mutable sources (0.346694ms)
+✔ interval copying locks all formats until the actual write finishes and handles denial (0.832695ms)
+✔ copy sends exactly the displayed pinned commands and never executes them (0.439552ms)
+✔ clipboard refusal provides manual fallback without success (1.462438ms)
+✔ unsupported clipboard leaves the command block readable and gives fallback (0.189361ms)
+✔ reproduction controls have static fallback and an explicit live announcement (8.619927ms)
+✔ optional file digest is preserved as supplied metadata with explicit unverified JSON (0.493021ms)
+✔ rejects misleading or malformed digest identities (0.617075ms)
+✔ reference links roundtrip exact unicode identity and preserve unrelated URL fields (0.760607ms)
+✔ malformed shared references are refused without partial source identity (0.364621ms)
+✔ reference workflow copies selected representations and invalidates stale outputs (0.763392ms)
+✔ shared reference restoration and Back reject invalid state without publishing old output (0.494022ms)
+✔ clipboard rejection and delayed completion do not claim a stale copy succeeded (0.539069ms)
+✔ rejects malformed percent and UTF-8 links rather than substituting source path bytes (0.41824ms)
+✔ a pending clipboard operation prevents a newer reference from overtaking it (0.448084ms)
+✔ BibTeX is an honest source template with exact immutable identity and optional supplied digest (0.400724ms)
+✔ BibTeX escapes accepted path specials as literal text without changing Unicode or JSON identity (0.33012ms)
+✔ BibTeX renders, copies, clears on edits and restores with Back/Forward source identity (0.787537ms)
+✔ BibTeX shares the copy lock with every format and stale completion cannot announce success (0.568593ms)
+✔ denied and unavailable clipboard preserve selectable BibTeX and explain manual fallback (0.51258ms)
+✔ legal unmatched and nested path braces produce parser-safe literal text (64.077118ms)
+✔ sanitized export keeps current labels, concrete styles, opaque background and safely escaped metadata (3.648529ms)
+✔ exact expected nodes reject missing geometry, stale coordinates, labels, classes and root state (0.992751ms)
+✔ unsupported resources and unbounded or invisible styles refuse serialization (1.820178ms)
+✔ capture reads displayed primitives and their concrete computed styles (1.622926ms)
+✔ capture refuses hidden root or primitives, nested content, effects and non-SVG children (0.903018ms)
+✔ capture refuses CSS numeric geometry that overrides current circle and rectangle attributes (1.465683ms)
+✔ rounded rectangle height requires a matching native used-height witness (0.655241ms)
+✔ captured Chromium attribute parsing need not equal JavaScript Float32 conversion (0.284782ms)
+✔ native height equality cannot admit real CSS overrides sharing a rounded string (1.023187ms)
+✔ rectangle height witness is finite, bounded and fail-closed (7.945749ms)
+✔ native representation check is bounded to positive rectangle height roundoff (2.50265ms)
+✔ capture refuses auto rectangle dimensions that suppress otherwise current native geometry (0.345783ms)
+✔ capture compares effective auto corner radii and preserves native rounded and square rectangles (0.491318ms)
+✔ capture refuses root opacity that would be lost from the opaque standalone export (0.466311ms)
+✔ capture token-compares computed path geometry and refuses hidden or overridden paths (0.969707ms)
+✔ manual fallback exposes complete current text and blocks unavailable clipboard writes (0.576905ms)
+✔ pending copies serialize writes and never claim success after control changes (0.331061ms)
+✔ refusal and failed citation builds invalidate pending writes without reviving cleared fallback text (0.454263ms)
+✔ current clipboard success and denial report only the current figure state (0.502886ms)
+✔ workspace refreshes configuration before validating current source pins (79.80683ms)
+✔ catalog hashes remain metadata-only through pagination and filtering (55.175308ms)
+✔ initial Library navigation is restored only after delayed layout and failed sources settle (30.328037ms)
+✔ existing section bookmarks all receive keyboard focus after rendering (69.14826ms)
+✔ empty, unknown and malformed fragments never trigger a correction (167.421269ms)
+✔ reader wheel during loading prevents delayed scrolling and focus stealing (39.783998ms)
+✔ reader touchstart during loading prevents delayed scrolling and focus stealing (20.301314ms)
+✔ reader touchmove during loading prevents delayed scrolling and focus stealing (23.15294ms)
+✔ reader keydown during loading prevents delayed scrolling and focus stealing (31.594508ms)
+✔ reader pointerdown during loading prevents delayed scrolling and focus stealing (25.103873ms)
+✔ reader pointermove during loading prevents delayed scrolling and focus stealing (21.749961ms)
+✔ reader focusin during loading prevents delayed scrolling and focus stealing (34.008562ms)
+✔ reader hashchange during loading prevents delayed scrolling and focus stealing (31.759798ms)
+✔ reader popstate during loading prevents delayed scrolling and focus stealing (25.651183ms)
+✔ reader pagehide during loading prevents delayed scrolling and focus stealing (34.728238ms)
+✔ unpressed pointer movement while sources load does not cancel Library navigation (30.038687ms)
+✔ a changed fragment is not restored even without a hashchange event (25.196779ms)
+✔ changing a fragment and returning to it leaves the pending correction cancelled (19.737638ms)
+✔ browser fragment scrolling and layout shifts do not count as reader intent (27.53147ms)
+✔ a refused configuration still reveals the requested unavailable section (2.276635ms)
+✔ a missing target is harmless after loading and removes temporary observers (36.613213ms)
+✔ reader movement between source settlement and final rendering prevents correction (19.760692ms)
+✔ an import refusal does not leave the separate query source loading forever (19.633494ms)
+✔ a config refusal settles every pending source note (1.72649ms)
+✔ a query refusal preserves verified import custody information (21.49664ms)
+✔ a successful query remains usable when the unrelated import source fails (27.913677ms)
+✔ the static proof link names the pinned proof that the script also assigns (0.449526ms)
+✔ a refused pinned source names the pinned GitHub route beside the refusal (23.135209ms)
+✔ a fetch that throws is reported as an unreachable pinned source, and other errors pass through (2.155285ms)
+ℹ tests 763
+ℹ suites 0
+ℹ pass 763
+ℹ fail 0
+ℹ cancelled 0
+ℹ skipped 0
+ℹ todo 0
+ℹ duration_ms 13815.938973
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode-optimized.stderr b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode-optimized.stderr
new file mode 100644
index 000000000..050c73b62
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode-optimized.stderr
@@ -0,0 +1,15 @@
+test_changed_byte_is_not_hidden (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_changed_byte_is_not_hidden) ... ok
+test_clean_root_run_prevents_package_bytecode (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_clean_root_run_prevents_package_bytecode) ... ok
+test_dirty_bytecode_is_preserved_and_rejected (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_dirty_bytecode_is_preserved_and_rejected) ... ok
+test_discovery_keeps_neighbours_and_same_basename (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_discovery_keeps_neighbours_and_same_basename) ... ok
+test_empty_cache_directory_is_accepted (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_empty_cache_directory_is_accepted) ... ok
+test_exclusion_is_exact (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_exclusion_is_exact) ... ok
+test_explicit_B_baseline_works (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_explicit_B_baseline_works) ... ok
+test_extra_file_is_not_hidden (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_extra_file_is_not_hidden) ... ok
+test_missing_file_is_not_hidden (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_missing_file_is_not_hidden) ... ok
+test_neighbour_failures_are_not_suppressed (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_neighbour_failures_are_not_suppressed) ... ok
+
+----------------------------------------------------------------------
+Ran 10 tests in 6.163s
+
+OK
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode-optimized.stdout b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode-optimized.stdout
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode.stderr b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode.stderr
new file mode 100644
index 000000000..c193ddead
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode.stderr
@@ -0,0 +1,15 @@
+test_changed_byte_is_not_hidden (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_changed_byte_is_not_hidden) ... ok
+test_clean_root_run_prevents_package_bytecode (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_clean_root_run_prevents_package_bytecode) ... ok
+test_dirty_bytecode_is_preserved_and_rejected (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_dirty_bytecode_is_preserved_and_rejected) ... ok
+test_discovery_keeps_neighbours_and_same_basename (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_discovery_keeps_neighbours_and_same_basename) ... ok
+test_empty_cache_directory_is_accepted (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_empty_cache_directory_is_accepted) ... ok
+test_exclusion_is_exact (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_exclusion_is_exact) ... ok
+test_explicit_B_baseline_works (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_explicit_B_baseline_works) ... ok
+test_extra_file_is_not_hidden (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_extra_file_is_not_hidden) ... ok
+test_missing_file_is_not_hidden (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_missing_file_is_not_hidden) ... ok
+test_neighbour_failures_are_not_suppressed (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_neighbour_failures_are_not_suppressed) ... ok
+
+----------------------------------------------------------------------
+Ran 10 tests in 2.426s
+
+OK
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode.stdout b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode.stdout
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-install.stderr b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-install.stderr
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-install.stdout b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-install.stdout
new file mode 100644
index 000000000..1ab544b25
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-install.stdout
@@ -0,0 +1,12 @@
+Collecting pytest==8.3.5
+ Downloading pytest-8.3.5-py3-none-any.whl.metadata (7.6 kB)
+Collecting iniconfig (from pytest==8.3.5)
+ Downloading iniconfig-2.3.1-py3-none-any.whl.metadata (2.8 kB)
+Requirement already satisfied: packaging in /opt/codex/runtimes/codex-primary-runtime/dependencies/python/lib/python3.12/site-packages (from pytest==8.3.5) (26.3)
+Collecting pluggy<2,>=1.5 (from pytest==8.3.5)
+ Downloading pluggy-1.7.0-py3-none-any.whl.metadata (5.0 kB)
+Downloading pytest-8.3.5-py3-none-any.whl (343 kB)
+Downloading pluggy-1.7.0-py3-none-any.whl (27 kB)
+Downloading iniconfig-2.3.1-py3-none-any.whl (7.6 kB)
+Installing collected packages: pluggy, iniconfig, pytest
+Successfully installed iniconfig-2.3.1 pluggy-1.7.0 pytest-8.3.5
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-interruption.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-interruption.json
new file mode 100644
index 000000000..d142d0f63
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-interruption.json
@@ -0,0 +1,6 @@
+{
+ "status": "INTERRUPTED_NO_COMPLETION",
+ "last_log_observed": "2026-10-29T18:02:28.322991+00:00",
+ "evidence": "environment restart, no driver/result process survived, prior exec session unknown",
+ "not_claimed": "No Python PASS or test-failure attribution from this attempt"
+}
\ No newline at end of file
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-skips.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-skips.json
new file mode 100644
index 000000000..d3080c335
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-skips.json
@@ -0,0 +1,30 @@
+{
+ "schema": "cbz.regression-skips.v1",
+ "scope": "Observed unexecuted tests, not manufactured PASS and not removed/disabled. Existing skip boundaries require canonical final G5 disposition.",
+ "source_commit": "6fc021839072d8c34f41e18e77b0f618c53baa15",
+ "skipped": [
+ "test_kernel_enforces_cpu_memory_and_process_limits (test_architecture_sandbox.ArchitectureSandbox.test_kernel_enforces_cpu_memory_and_process_limits) ... skipped 'requires hosted restricted container'",
+ "test_network_namespace_has_no_external_interface_or_route (test_architecture_sandbox.ArchitectureSandbox.test_network_namespace_has_no_external_interface_or_route) ... skipped 'requires hosted restricted container'",
+ "test_nonroot_and_no_new_privileges (test_architecture_sandbox.ArchitectureSandbox.test_nonroot_and_no_new_privileges) ... skipped 'requires hosted restricted container'",
+ "test_output_quota_stops_disk_exhaustion_and_cleanup_recovers_space (test_architecture_sandbox.ArchitectureSandbox.test_output_quota_stops_disk_exhaustion_and_cleanup_recovers_space) ... skipped 'requires hosted restricted container'",
+ "test_source_mount_is_read_only_and_environment_has_no_publishing_secret (test_architecture_sandbox.ArchitectureSandbox.test_source_mount_is_read_only_and_environment_has_no_publishing_secret) ... skipped 'requires hosted restricted container'",
+ "test_525_composition (test_graph_binding_check.Composition525Test.test_525_composition) ... skipped '29b7d596 or Math- dbe6c0a1 unavailable'",
+ "test_real_records_cited_artifacts_when_present (test_living_project_validation.RealRecordTests.test_real_records_cited_artifacts_when_present) ... skipped 'no real record cites repo artifact paths; missing-artifact checks are not exercised'",
+ "test_real_records_dependencies_when_present (test_living_project_validation.RealRecordTests.test_real_records_dependencies_when_present) ... skipped 'no real record carries depends_on; dependency checks are not exercised. depends_on is not interface v0. Dependency validation is not proof verification.'",
+ "test_real_records_evidence_id_pattern (test_living_project_validation.RealRecordTests.test_real_records_evidence_id_pattern) ... skipped 'no real record has evidence_url, released_url, or resolution_url; the evidence id pattern is not exercised on records/node_status'",
+ "test_real_records_fresh_against_live_source_head (test_living_project_validation.RealRecordTests.test_real_records_fresh_against_live_source_head) ... skipped 'fresh records eng.d0-packet-allowlist-fix, eng.hard-gate, math.lifetime-remainder, math.side24-coefficient are not compared to a live source head; tools/validate_node_status.py performs no network fetch, so this check is skipped instead of passed'",
+ "test_real_records_owner_released_url_consistency (test_living_project_validation.RealRecordTests.test_real_records_owner_released_url_consistency) ... skipped 'every real record has owner null; owner/released_url consistency is not exercised (released_url must stay on the owner object and must not clear it)'",
+ "test_changed_byte_is_not_hidden (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_changed_byte_is_not_hidden) ... skipped 'installed pytest required'",
+ "test_clean_root_run_prevents_package_bytecode (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_clean_root_run_prevents_package_bytecode) ... skipped 'installed pytest required'",
+ "test_dirty_bytecode_is_preserved_and_rejected (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_dirty_bytecode_is_preserved_and_rejected) ... skipped 'installed pytest required'",
+ "test_discovery_keeps_neighbours_and_same_basename (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_discovery_keeps_neighbours_and_same_basename) ... skipped 'installed pytest required'",
+ "test_empty_cache_directory_is_accepted (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_empty_cache_directory_is_accepted) ... skipped 'installed pytest required'",
+ "test_exclusion_is_exact (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_exclusion_is_exact) ... skipped 'installed pytest required'",
+ "test_explicit_B_baseline_works (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_explicit_B_baseline_works) ... skipped 'installed pytest required'",
+ "test_extra_file_is_not_hidden (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_extra_file_is_not_hidden) ... skipped 'installed pytest required'",
+ "test_missing_file_is_not_hidden (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_missing_file_is_not_hidden) ... skipped 'installed pytest required'",
+ "test_neighbour_failures_are_not_suppressed (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_neighbour_failures_are_not_suppressed) ... skipped 'installed pytest required'"
+ ],
+ "count": 21,
+ "gate": "G5 not represented as100% execution"
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-start.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-start.json
new file mode 100644
index 000000000..3b64d23ab
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-start.json
@@ -0,0 +1,265 @@
+{
+ "argv": [
+ "python",
+ "-B",
+ "-m",
+ "unittest",
+ "discover",
+ "-s",
+ "tests",
+ "-v"
+ ],
+ "commit": "6fc021839072d8c34f41e18e77b0f618c53baa15",
+ "started": "2026-10-29T18:00:48.939227+00:00",
+ "source_sha256": {
+ "tests/browser-requirements.txt": "05b3a77f3aa648cdcee6c1dea416ac85754a9b3b417456ba451984d16d10738a",
+ "tests/casefold/test_source_isolation_casefold.py": "ee9149d49a566fe1c37ed1af0efbf7bf7cb6d686c5dc5ed5ebe2c16572acbd58",
+ "tests/fixtures/artifact_index_p2_trailing_suffix.json": "0a49c41eda400a2e71a20ad73a33877432e5adae784399d90a998de8d9a18bdc",
+ "tests/fixtures/atlas_formal_bridge_profiles/8228-manifest.json": "1a09020f0706abd506824f54fca76df9daa533749350b9ab6b818e0bbe9ed744",
+ "tests/fixtures/atlas_formal_bridge_profiles/README.md": "c208e0fb1e9ff5d9062826e63ff37ca79eac1cd0ddafa5e428787d6fbc0791cf",
+ "tests/fixtures/atlas_formal_bridge_profiles/a22f-README.md.txt": "137e7c7ed44d732042d803eb4a0ee75f9ddc6475950a2bb6226a7711a44be14b",
+ "tests/fixtures/atlas_formal_bridge_profiles/a22f-REVIEW_LANE.md.txt": "54d32104aa012e917ef40b73fa3a40228d023249b339cf30fe4bdb7dcbfed414",
+ "tests/fixtures/atlas_formal_bridge_profiles/a22f-manifest.json": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0",
+ "tests/fixtures/atlas_formal_build_3b39/README.md.txt": "54436dfd808547d9da9ce0a2ad64b0e5935bb755844fef99b298281c49044aaa",
+ "tests/fixtures/atlas_formal_build_3b39/REVIEW_LANE.md.txt": "887f56209471fc0194d601a4f8a0c82eb75852e1c97da0400c16d447669e6340",
+ "tests/fixtures/atlas_formal_build_3b39/formal_gate_check.py.txt": "21c355e02ac6e01337d10465a3105b34b93f832586ee60aa2430f662a90cd8b7",
+ "tests/fixtures/atlas_formal_build_3b39/manifest.json": "8dfcfe4e9296bca47eede517f37b546ea420ec6b51944b7c16164a906b40e090",
+ "tests/fixtures/atlas_formal_build_3b39/test_formal_gate.py.txt": "4286136d8b24eca9b26d1e7b12933bed5b0961809b362a60c3af7bf46e6ed4b6",
+ "tests/fixtures/atlas_formal_projection.json": "7b36e2376f4010444108e81f316293ef3b3834d767e0900f68d684c760af2db1",
+ "tests/fixtures/cumulative_transfer_source.txt": "83f653393dc6245980f6848e2bfc65ac9ad4c7d8304b028b88764356fd3825b6",
+ "tests/fixtures/current_inventory_acquisition_cases.json": "050ca99cbb4c7d71f6e739726314d2450d2819c794ea0e71acf177d4cac54b12",
+ "tests/fixtures/current_inventory_legacy_live_hashes.json": "5fa7cfdde633171b0f99e8180bfe266edbc1ef67a05d4c94d91d1f1ebaefa854",
+ "tests/fixtures/current_live_pre_resume_hashes.json": "2f929a24c4ffb5d1e9ea36559635f5801b2037029bbf226f6fd028aa57f0b221",
+ "tests/fixtures/current_site_publication/pre_r1_resume.json": "fe0f8b2c014334635d402dd32f6134d205b8b9ffd4f691b38f7b6949b4ef89ba",
+ "tests/fixtures/dependency_source_bindings.json": "a1c7378f66ee433faf680ed56cc45fd2ccac5754d545b192cdb50c2a83025a17",
+ "tests/fixtures/formal_scope_cc2989.md": "350732d7a501fd37d15632b13bd2ac30b8a6d87259b9a3b0931639041a1cfb84",
+ "tests/fixtures/museum_fixture.mjs": "5cab7aacc297e1d62d8fcb95de64435f42395a74cb9c6ef82bd6b6d288a34bc8",
+ "tests/fixtures/node_status/math-463-released.json": "69a4f8dd4a286bb3f637df6e61a39ce304a77c507f49388aa336f5e99f10f192",
+ "tests/fixtures/node_status_refresh/current_revs.json": "38b8f85d47486c8885ac6f32c340922d3110a24eebbd9128225f77dcbfc4578a",
+ "tests/fixtures/node_status_refresh/fresh.json": "e304ba99cd7792a8cbbfc915447c10728bca6a4935ac1664fe3686665ad49b1c",
+ "tests/fixtures/node_status_refresh/issue.json": "fe0b3371a28128c81a90c0accc384df17cda5169d3d0b97754f70dda853cf17a",
+ "tests/fixtures/node_status_refresh/stale.json": "65d7ab8f4b2af80f73e66ab64293792d3e7ab6a30c8181a355f60eeed73e8021",
+ "tests/fixtures/node_status_refresh/unknown.json": "d87ef78478948e710747a6e452dafdd82d5e56eae79355d3c4c286c26be62f29",
+ "tests/fixtures/persistent_status_legacy.json": "4f9b85023c5473a84c25169f1692af144456a9d9bb4470148b6ee5bfa4557d55",
+ "tests/fixtures/status_f2e432e.md": "039d4fea921a5e9602340ab8580404ef709588ca72f45c52f865f4644da51da3",
+ "tests/test_active_board_routing.py": "26c5cf756daddb5b442f4e8affa942346efe39f8a312709b0b2eba5e7005b47a",
+ "tests/test_architecture_artifact_index.py": "a403c84cd547a342876ac21b3ebd3eb456620d30c5eec0d79e7ccd509fd60b04",
+ "tests/test_architecture_binding.py": "523d03dffb84656fdeebd62c73a5f479ecc0b416ff3ec94d4881c8005fcacfcf",
+ "tests/test_architecture_claim_selection_transfer.py": "d36b8b17e2354c14b60b5d3c48580ea15cab3b152960bf62764553c70f655d2a",
+ "tests/test_architecture_cli_boundaries.py": "8b45b7d60f86d743cfbb8e3706a1d32d049a7fc557656f243bbbc5ebb97a578c",
+ "tests/test_architecture_evidence_adapter.py": "f95f99bd044981aa7928a7bcad25a4473420a8935e16b7e8ff6288b8354b1894",
+ "tests/test_architecture_evidence_path.py": "1038f3638b4e3772d7b96526d7721f8d4d6d772a70166ab80e9bc9f66b610a7e",
+ "tests/test_architecture_evidence_topology_diagnostic.py": "dac82c4827322fb887ebf887b815a51a69f5e7ba47c1357cb1457f5b70fb2387",
+ "tests/test_architecture_graph_artifact_readback.py": "dd3c5b3f2011ae3f7582514eae0fb79f25257d5bf54f40a99585d21dff65116e",
+ "tests/test_architecture_graph_export.py": "92cf35857d9c6418c5fd5d536d261c06b72bdd18dcea4d16cd0faf4fc8cacc1d",
+ "tests/test_architecture_receipt.py": "56b01ae5ae5faf37675ee84771d81cb81a13c2224658067d37220724013fc84a",
+ "tests/test_architecture_sandbox.py": "6f9281005cf62b2d061f3a0381fa6c1b79999dbb5813758ae1f4fd0f870fbe78",
+ "tests/test_architecture_side24_coefficient_binding.py": "ad151ccd1871acc1b073272625e2b962ce3a7ee04082676453911df83b8b4ab2",
+ "tests/test_architecture_site_graph_bundle.py": "80ac5d83af8204964de454f3df89933e6b21c2149ac44e3e61483e3118f1187f",
+ "tests/test_architecture_unittest_timing_probe.py": "70796eb7986308b4cb431b34d841e22ae474b58c1fdc393bd5f60c724ef7e1c3",
+ "tests/test_atlas_controls.mjs": "8539446ca52505a1dbb8edbd20217023367cbfd4709aea9b1f04c94c39a76f6f",
+ "tests/test_atlas_focus_geometry.py": "e87c54ac2c263c6bcfd6836023ac623fdab3ba52202e90c40dead7cbdb8141c6",
+ "tests/test_atlas_formal_evidence.mjs": "06d917654cfb99af48e6fb6de7a85ec20be2fbc21ffe8c1d3987ef0cdb8a2913",
+ "tests/test_atlas_formal_evidence_build.py": "67bd4e6a55d9e02a1108d73438777f36e4c2b7357a28a9b690bd4c909bbd1148",
+ "tests/test_atlas_formal_source_bridge.mjs": "31c6b6e66f15874eacdafbf23adb948473927401643196cdab2e92a05b1f60ed",
+ "tests/test_atlas_formal_source_bridge.py": "ac10c9e6bf7530ea877f18caf1bc1f32caab89445e0b6e5d2bffe401ff2c882b",
+ "tests/test_atlas_reader_experience.mjs": "7c6aa238a518109411b3e61d348f53e8536a03d2ef0fdbdc26b7cf19437eac89",
+ "tests/test_atlas_reader_scroll.py": "4a6bcbd588113a9fe0864e0a56cd8cc56f715b1b7ec5ded018d8860a600446b5",
+ "tests/test_atlas_relationships.mjs": "d711415a3a951cf6fad923ba944b744e0a76e39d4f21b62132f89394f054f8e1",
+ "tests/test_atlas_resilience.mjs": "741a954dbfb327c2e965a3fce226a02d17e1bf968366c62ed0b4a8510cc0b77c",
+ "tests/test_atlas_spatial.mjs": "b9b9af683bad0a5c894e5aa700d8edf85e891113026cdc6a58207df5ba1133a1",
+ "tests/test_atlas_spatial_labels.mjs": "06056d5bf6b88d700995905fa434aab054ae6c27fd910911cf8f994df3a4a92e",
+ "tests/test_board_links.py": "0fca44ed2dfdf77be1551094d7cb9e3f3713bc6cffb43bf86500c5c90e5b0f1e",
+ "tests/test_board_links_raw_json.py": "2ac670b1ae824d5e665560c983eecfa0392ec4d381d0ff80ed26b5318aba5520",
+ "tests/test_board_links_url_errors.py": "328e342e663d504c4b2ca1c7bba485ce02bcc6295e74592ada8e2fbb721703a3",
+ "tests/test_brand_identity.mjs": "f101c8a3c76c91ca4e67910cd754e676d2eefeae043f46219663937c92c09e0a",
+ "tests/test_catalog_query.mjs": "6bbd9481758d0d5b6741a7ed13ba3b7a04125108378b0c1b98a61e15aed07104",
+ "tests/test_cbz_audit.py": "347fb2ee14f6ac69e67604f22cd29995bf18724fe3f12d75b29faf61e728247b",
+ "tests/test_cbz_baseline.py": "fb0def6cced0b901bdbb9138a8402d273d267d5d2eaf8e35e32ca101b2e4d587",
+ "tests/test_cbz_lean_check.py": "8642d2bb63acf3d9ab56c89dad4132449f6b9b964431ca14ce9cf52ed3eac3d6",
+ "tests/test_cbz_refs.py": "87894edca7a54974ff53af31e8d3a696643633c148d591d410709b28881916de",
+ "tests/test_cbz_storage.py": "5efc1289a0d13e266cd1143b7f6b1946efb29a24deba718eb0170093f67b1295",
+ "tests/test_compare_categories.mjs": "68182d38f365d7ef98da6c8c1e6c677f16d0657e7e158df211e3e12b39b32ad0",
+ "tests/test_compare_source_panel.mjs": "4bca6e043b16ee10876aec19d29696a16e630ce57cffb5ca995e51abac32155d",
+ "tests/test_coordination_lock_check.py": "543371b0afb87d40d599a07f90120cf4a4cc787c81ddc50190c6a4c09d381687",
+ "tests/test_current_inventory_acquisition.mjs": "11166b8b5a778a1aebc87026a4e8c35d5c733db777e925dc979bbf89148658ac",
+ "tests/test_current_inventory_acquisition.py": "680378befe3c0cb264241f35a0222bdcb2dc8a541be17a7b6dc1e0e539ba0595",
+ "tests/test_current_observation_coherence.mjs": "017e70f834f5757e0766302226e077b7c4b92ba9b4ea321d2c01cc5176366b14",
+ "tests/test_current_site.mjs": "15e8e28428477c582239bd635943387edfe739d8860c488305e3611b59385150",
+ "tests/test_current_site_browser_contract.py": "ad16d1cbf37468409d8fbf3ae95e3511257dfd057f9ad771d21e91811409eecd",
+ "tests/test_current_site_build.py": "356819ec74e00fa78e2a4c788523556cce0bef4303dbd6be35f4b6fc6015aa51",
+ "tests/test_current_site_data.py": "abe09b871643bfd9e7ca0d7d8404f1670d14a64cff4fdbf1478ba4d9560285c0",
+ "tests/test_current_site_history.py": "11eaa3818c4e9930c933ce45915e74c39fb104b7d800b6c59b09f51f8a7a9e67",
+ "tests/test_current_site_native_base.py": "ff6d8a5e6eb1fc051ce9f3a57e28e3c654c186c3fdd77f193596ffc518b2787b",
+ "tests/test_current_site_native_registry.py": "32da9cfb1684817a69030a20e85356bf571697e7dfc7532c417839915364a9cc",
+ "tests/test_current_site_persistent_status.py": "2f7870085cb224d6458c81238f3de6dc91acff8c73ca4cfe9657affa134ffd1f",
+ "tests/test_current_site_publication.py": "60b4cec31a382dfc250ae3d29627e89ce6653ec27220fcb975509a054aabf2e8",
+ "tests/test_current_site_resume.mjs": "f3e4c8ddda311673e0d6fb8a6ac51b52a518351024d10d1d6542ea2476120aa7",
+ "tests/test_current_site_shell.mjs": "75fbc86730163b9dd98308aa6031c1601bd63dc75aa9c22660407f3789cf6fe2",
+ "tests/test_current_site_stylesheet_order.py": "34be490c59e5f66d76ba4813f23461c1feff00a76ac4bd3de7b9ad09eda2a7e4",
+ "tests/test_curvature_export.mjs": "d22b6b9239c1fd7ec36977e5f155653bc8718c73c723ddcb25c3e70acc6c0dd4",
+ "tests/test_d5_shrinking_witness.py": "af6936b60006b527b3b68ed9b695af923b166683f2a7c5921b651be7059021a1",
+ "tests/test_dependency_source_binding.py": "75edf94d9b6c45ce18523862b6e312cc44b72aca38f1e7eb6f32a9876626e73b",
+ "tests/test_dependency_viewer.mjs": "a15bcb32b05ebdd2ea6152166153d6c66584223a06f5e10a327a8036e553617a",
+ "tests/test_drive_id_scan.py": "5bd868e54c42a20b1bc7245ec4262be3c844d3e51807c15d16a0e2b86a22d4a5",
+ "tests/test_dropbox_reconcile.py": "62d80b88fcdad4c4dfef151f1551197648113db92a3d1d16be747b2855376c75",
+ "tests/test_evidence_path.py": "b75c262c2376bd5952c32354408ae8ed8370cf982788ed8f0a4b1839f72cf687",
+ "tests/test_exact_sample_shrinking_bin.py": "63e59fadac910846b8425975e67230a055992c2087c32a8cd2341e01948be3be",
+ "tests/test_explore_models.mjs": "9ff140148fbeb088c664f482a754661819c4f609f8180b2ad34df5f9a696a2d7",
+ "tests/test_figure_png.mjs": "c820936cbf60c31262bb1a24f1548e31a2e471b28ea78cdee58d8e4f1bb36baa",
+ "tests/test_formal_execution_context.py": "0751ca299c72a821c2130e66fb00cd9f6e79cb9fd5a9a4147b70bfdf99ddd353",
+ "tests/test_formal_gate.py": "2b13ad83b03d2b45f4be70ce03af597c195563a1ed0bd3983a2b7040068a3a84",
+ "tests/test_formal_workflow_shell.py": "3d29a169da19ab648b65c3939d244b211233ea705bd50b538e8d1953f0a88086",
+ "tests/test_graph_artifact_bindings_v2.py": "b0a48735ef7e0f5f45cf83e68c65deb0939eff6fb117c939a98282a715e1460f",
+ "tests/test_graph_binding_check.py": "e151abf4eae86384305d17ddba07d16e31b2dc062786054e975488a5e65e2828",
+ "tests/test_library_discovery.mjs": "faf20763f61489c28783da73d8b92374191f7c41f3cf88a241ca57adffc51366",
+ "tests/test_library_source_search.mjs": "980c6576281a799eb170056896050c265461d0913a02c4f4001fa7e9c381fc30",
+ "tests/test_living_project_validation.py": "71a1fcba1dd118d91326289cd788bca1c8a1fe673ffd267eab0790974ea73190",
+ "tests/test_measurement_model.mjs": "83c8b3d0a8e2e95f06a697fea846fa2088a41e81809c64fc3e201665757cd223",
+ "tests/test_museum_conditionals.mjs": "ec358beae99c477ad8f4272fd50813ef7d8874e13b9097e8ba9f15bac79c173f",
+ "tests/test_museum_conditionals_cli.mjs": "48310479d97a5b6c116d5a4a0f4bf925e1faf0e70da54775166ad2f1ed241634",
+ "tests/test_museum_conditionals_paths.mjs": "ad6416f09b22a6ee3c2fdf876939be385efac52f0a4d4124de1420464b547de0",
+ "tests/test_museum_conditionals_startup.mjs": "3b69f603a3128029caacc8bbc9af43e5898802124506887bdc887b1982d16d71",
+ "tests/test_museum_data.py": "0eff026523881a6818a103cdd1e23006a082a3545423c2fe4f19182d08d24da7",
+ "tests/test_museum_frontend.mjs": "1bc61e0202cc6c147bbdd1357d7075f239f8a1bacda405404de09ba138507c72",
+ "tests/test_museum_geometry.mjs": "cc5a9ee15b27ccb10f96f0a77f79238e03b67b42efbcb6aeebbc9dddff1a9da0",
+ "tests/test_museum_identity.mjs": "db894ec40b2c3d437aaa748110181ae8c9dc37636108deaccac87070b47c3728",
+ "tests/test_navigation.py": "2a0e8eb79cfbdcbcbbc3237545ebdbbe8c859b0f71cad0f8a8fc46062829e314",
+ "tests/test_navigation_discovery.py": "5bc38e6b23292e73d1a295c2d8f281f7215b88b87bf45c4ca6ff335e0f1d1422",
+ "tests/test_navigation_manifest.py": "bff5158f65c182c4a80519e8bf8824c18294e1d067bd1e9acad0d970d7078657",
+ "tests/test_navigation_workflow.py": "fac899b807edf049479dacd449736d861ccf363d9b914994646c5e80935d75db",
+ "tests/test_node_status_atlas.mjs": "1b4d0f5dcae7f1004056c76978f5282a96a157c08d7a629cd798f2fc0ed66e3d",
+ "tests/test_node_status_refresh.py": "dbca3e03dc714038fd2161eaf16e205ea810e1d45487d5e52c97bb8d6a6da8a5",
+ "tests/test_palette_export.mjs": "3c98a48d02bd269e872e0bd4188ad01f6e4bbcd110c94d30cfa65831420d4eda",
+ "tests/test_periodic_certificate_dependencies.py": "c820b3725940dd25abf7bb68a1f23da1f1f3c04bab4187f29924362b2821d645",
+ "tests/test_periodic_pilot_custody.py": "7b2960401d47e2a48385fca6e8311e2dad03df4e15d313fa561a009d16afdacf",
+ "tests/test_periodic_pilot_custody_oserror.py": "b69a4477064fe1d42a285df5674e9cd180fddc62294c3ef20e896458f1ec86dd",
+ "tests/test_pickup_fence.py": "d8771777c62f31868a46be269ecc7e5d3d822e6186e853c3c1acc1d83c49d362",
+ "tests/test_pin_export.mjs": "0df96caec47e26767d6639d270060d998454aaadf6d81789ca6e22dde0ff7801",
+ "tests/test_public_intake.py": "d4c28d0972de547b3f262659e863170b085aad3a170afc3cbd1a125e3d140152",
+ "tests/test_public_intake_artifact_identity_control.py": "51a7b8c70c1b06ebf092de3e32af53f8dd48d5efc5dd7480efd85e3064c431e0",
+ "tests/test_public_shop_app.mjs": "dcc2a3cb66a7877ca0fe941ae8a1e1a7058dcaf913fc25f3dacc726a5a5ef896",
+ "tests/test_public_shop_browser_contract.py": "c45fd974735bc9f2bba62c2d6c1afda1dbc1badf581c2d1b6284eba952f3d78c",
+ "tests/test_public_shop_check_identity_control.py": "e0434d4678f608958a27e33d3056c13602376050aa8a24d172b1ecd809935202",
+ "tests/test_public_shop_data.py": "f081685965bc34d542ae08311d11b3de5d6343e5554410d25cdcd15c8444c082",
+ "tests/test_public_shop_frontend.mjs": "98eeb82fea6d73f24ef9be15ce839feeb76608c4ce79e81a27df946d0d46fd4f",
+ "tests/test_public_vector_index.py": "237bf7b94d616f7686a1d161d45c079df84f75694bf5bda1a543c349e8bf1075",
+ "tests/test_pytest_bytecode_policy.py": "025e631470545010a9bb33e92a1e5f84c5313aa62c7c0e1ac71d980e595c3295",
+ "tests/test_reader_experience.mjs": "a135963b747399235afa9ae7ec53d6d0571e1353e7a6f577cdb9f85d7130e380",
+ "tests/test_reader_jump.mjs": "227a52ca9f4bc337b257ea867356fa10dc84582dfd1ffed7b335e1c5e99a4583",
+ "tests/test_reader_links.py": "66e66891a890defc616723bdc76dab7b6af3919a584054c9713eb519c53882ac",
+ "tests/test_reader_navigation.mjs": "f33a92bae9aa0d1ec5cbdfb703e42826f85a59c4350899ce78f877adfa6e764e",
+ "tests/test_reading_list_citation.mjs": "7bbdb892e8898d8da21401473d877e6c6175ca86267f7377c2fe33db7913723c",
+ "tests/test_release_snapshot.py": "ebe0243e35023f311e4229c15d99719f6b3141502b9f61a4f6478703a747c146",
+ "tests/test_required_formal_binding_control.py": "feddcf6679744431922e10d2de99a0edfaf090b86067847da095bb57db6c2df4",
+ "tests/test_required_formal_check.py": "37dece6d29d470f0c7ecda729e5fba61bd4808647976345ba108a02d6245ac5b",
+ "tests/test_research_delivery.py": "ea78adf62306716937bc654abaf3fd388145ba0058945be3ac81fb4073e1fc7f",
+ "tests/test_research_desk.mjs": "0c7e3d3ee64477b1c6b37514a7388fe0948a52726cfc19fbcd0cf79db2057fc5",
+ "tests/test_semantic_memory_benchmark.py": "945616152e9d50631890049fbe575cd67f925cc30257d2d60ee5d4542a6294d6",
+ "tests/test_site_asset_release.py": "e79d0e886c4201aa241d893a2a405938b7082a0753c26265e780e77b555cc5d0",
+ "tests/test_site_csp.py": "1d6caef1cb503538b41c48878601891b4e9f0774601fc1aa242d0bda0aac0b03",
+ "tests/test_site_graph_capture.py": "44eb872c01e510fddc8942c818b4f98aa0a305fc1c5109686c7d7ada9331964c",
+ "tests/test_site_graph_projection.py": "0c49edf48527532c8dfd91277a24fffabc51b6e3b2a17529b8e69cfb6a3a08a5",
+ "tests/test_snapshot_compare.mjs": "c88bee61162434ed34ce748aef65a2cb9737eeae42b1e0a06ddcc9ef5b28fbfb",
+ "tests/test_source_quote.mjs": "68c821e2f7698f06854166d5a73b1f647fc913c4fd9b514ffec8681868d1ebe3",
+ "tests/test_source_reference.mjs": "cfb3ab0624216c4d0422e0aae17d71b74e73cfd84dff3d9600d8037ea2518816",
+ "tests/test_st_contract_pilot.py": "193bd7099c964ba1870decb180e88fe4e0559bd6ce5e9ede6ff0bdede7642699",
+ "tests/test_teaching_export.mjs": "8317e834b7f1b5a640fffb89ae186a37f9669e7baada97fa458fb57f288f4eb0",
+ "tests/test_workspace_landing.py": "dfa26545041881fa0b995f2fd1de14cc3367597580e9145ead494c89cbc111d9",
+ "tests/test_workspace_navigation.mjs": "134bf1fbcb65353e489da2ce7ebfff62f1cc37996a9673bd806bc11c0baeb1bb",
+ "tools/CBZNonvacuity.lean": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f",
+ "tools/architecture_check_binding.py": "266e15903c0cd43e38b52d3f1d2fd52455f0f059dd6071ac246723cd84dc5010",
+ "tools/architecture_evidence_adapter.py": "ad759f3fcf9f877fb3a95d62d1306f2b743c4b5565578b7b046c5db1004e3996",
+ "tools/architecture_graph_artifact_readback.py": "88b3e2440a779017706b7ef7bf364cb58471c510e608c554936a6c69361acfb6",
+ "tools/architecture_run_receipt.py": "a4bb66325f64422398ff726bc1c448afb284498275e5894a7d1af6b25fba9890",
+ "tools/artifact_index_export.py": "2083bbe457cf2a4b85a2ecf74325bb1ff4118c07259ab7d760d7611cea3da966",
+ "tools/atlas_accessibility_audit.py": "e133b8c5a7df0b261d676cd3d686c92607b90a9305f92d0d0bbca4675e5e3bac",
+ "tools/atlas_accessibility_regression.py": "1d110123a301fb65cc90860cc3548aaa842dd41e27ea846b9ea02b2e51845a69",
+ "tools/atlas_accessible_list_browser_check.py": "56adadba47f85c0a7c83b103a914f9c19fe465ac027021f90e59b649911f47b2",
+ "tools/atlas_approachable_browser_check.py": "99f567499dcee942b11a627afeb7a02589a8c8a41d787453b46d19b725313103",
+ "tools/atlas_claim_summary_browser_check.py": "55b15ed1ccd16b5276afe8c1d23d1538da837f611621e70dfbcd1952d51ccbc1",
+ "tools/atlas_formal_evidence_browser_check.py": "4ce981b7b9c0d422f099fcd8556a144d01de8a6c18de9431a6a045fecce55af7",
+ "tools/atlas_formal_evidence_build.py": "dbc6c7fbc9114c719dac4426fe46479747ec5ecd1a8e5549a9b5a36a1e418635",
+ "tools/atlas_formal_source_bridge.py": "b37bf20034e685fefac770b6056b1a1fc2343e4b58922be9e83c1b4499c4a6a9",
+ "tools/atlas_live_controls_browser_check.py": "b7c318a19c79f3da06734723a0f65d831d0ee140bd07dc451e11c25c4193aeca",
+ "tools/atlas_refusal_browser_check.py": "639b9f4295273ff2c6fb5c0221dc1bd998804b84d38edb6f1efffa12c6fb6c28",
+ "tools/atlas_relationships_browser_check.py": "8a6a1c57fd5382a61b0cb11af1ed632bf6a1c71cc70098afe340c5607e4f5b87",
+ "tools/atlas_resilience_browser_check.py": "1c760214db84a1ec011be66f78d62f569ec191f15e0ccbb93b14f94651a8e972",
+ "tools/atlas_source_bridge_browser_check.py": "d6379bbea06a82c553193ab9a3705ad43cc95b9a21998609b7636dd51a1e04c5",
+ "tools/atlas_spatial_browser_check.py": "915b6f6bca3e81fb39ebf250363eee3daf4f2a8a76f41c2e90f2754b1dcea881",
+ "tools/atlas_spatial_labels_browser_check.py": "97d13995e52e584b06ffa2cd842661a4326fd32612610e3a7a3004a3e76d612e",
+ "tools/atlas_webgl_fallback_browser_check.py": "7abd99767a6acb456c29be3e92210d13a2ce2d507c344639a304fba9a9055959",
+ "tools/cbz_audit.py": "d18f74984b6a5d4c2834119b9ee804d6e71942f306a7801035acdb04f66a7d47",
+ "tools/cbz_baseline.py": "095c6e9eb5adb7174720e9c5ad5194ba62b413d37b5d43e6d49bc04b0b592b46",
+ "tools/cbz_lean_check.py": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d",
+ "tools/cbz_refs.py": "f26c6f8f13aac2b967a8c03cf4ca9643a875a93ebd0855a732576e8fdceaca85",
+ "tools/cbz_storage.py": "c829d392e00601d7876a2530a8bff02b7f913cff7bed2dec29df69d796b4ff9a",
+ "tools/check_board_links.py": "ac06814542cba062bd59d9b552cb11da88dc7b8801ba4c3bd8deca12adf27f33",
+ "tools/claim_selection_transfer.py": "0ab937d571d2127f910fcb3fac2b12265f1b4e1ab5a040c0ed21dfd48559c745",
+ "tools/compare_experience_browser_check.py": "962713a9786e624b13a1e3588dae19570ab21679f4e3a25224a515836f38d80c",
+ "tools/coordination_lock_check.py": "f4eb848846de62abc8a5cb06ea327b6eaf0e2b4c410d100fb842530f43d5f4f1",
+ "tools/current_inventory_acquisition.py": "21772aefe0d0cdf0150619ab148450dc63aafdc85e8bcc651d24a86a476b8640",
+ "tools/current_site_browser_check.py": "37eef561d73d9494773b5e200e7ad65b4b1885e09528a7e1fe5144fda214873b",
+ "tools/current_site_build.py": "2a963a61d01db3fbb96979860e9c4af9f4b79140d00b73cc1b0d8a18b4a2d3eb",
+ "tools/current_site_data.py": "3a42f2be7ae51d6196449766283b711203133b59b97c0ad14f08fecadc733a96",
+ "tools/current_site_history.py": "40e911492527635a9428858b2242a947321e75c940f9da957e291ce030e60f49",
+ "tools/current_site_native_registry.py": "98f71d14fa4a9beb5f6f49fd8976a14887bcc9a00f6608cac880469466aa3fdc",
+ "tools/current_site_publication.py": "16a7d9a5ffd9f33a0d68afcb391dfebb82a1188bfba486ce6cb93898412ca1a7",
+ "tools/dependency_source_bindings.py": "6e1231544d12a2193b5e4d103628ac5a12c4ba5a8cb9188e9cd0ed20e885a98e",
+ "tools/dropbox_reconcile.py": "19c96b15f96eaeaddb2e90222fb58a8b7b97808653ce146a7457bb8d5cc7732d",
+ "tools/evidence_path.py": "e93db0c283c5778d4b95efabc5574d2a5c6cac0451dab67742d67a94b7d8ea00",
+ "tools/evidence_topology_diagnostic.py": "5b54faf2e076c0ee5674ee298b4c3ec8cdaaf60f2edf25267026fb2b11ae52fa",
+ "tools/excerpt_source_save_browser_check.py": "e611cec3edc6b468d30650b671ab08b3437b590a2f52b816e9eb00e6c34aa127",
+ "tools/figure_png_browser_check.py": "67105c43d0d095d5e870c228019bc09ca351c884fde0716125735b955d0e2b8a",
+ "tools/formal_execution_context.py": "0f81c1b07e850d27ac53f2610f127896fcab314043d37f023502d2d53bd53db2",
+ "tools/formal_gate_check.py": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5",
+ "tools/graph_binding_check.py": "2fc0b3d374492ba58e153ba8a1337ca8193167549cdcdb322df6e003c26c2c82",
+ "tools/hypergraph/README.md": "6f0048c948d26a7f6f764f4f1391a85be86e737293f8a820a8afc3f427b88f37",
+ "tools/hypergraph/inputs.json": "347ffc8a1a83049c2d5776690b393d491ad0e1e4fdb99804ec7db7211e8cfb6d",
+ "tools/hypergraph/math_hypergraph.py": "9614af35bedffbe7263c96d66ffdca92dcff3a57fcbc3d5127fa7ce685f1c8b8",
+ "tools/hypergraph/requirements.txt": "346f933759899c53e91134ecb154b36331079f220a49b708c4fdb5ef83eb5080",
+ "tools/hypergraph/test_artifacts.py": "651d9ab9945d257159a661f2e4f22f77c9c8693fc09213ee345460328c5f4403",
+ "tools/hypergraph/test_math_hypergraph.py": "69b553b5f3513179f9736d103522a0b7b2c655aac1fce72f499f3b0312f0d1c7",
+ "tools/library_discovery_browser_check.py": "a424629d30a7f0a14635ca38f6f89493cd627023b30947348c5e4f4f81dd222c",
+ "tools/library_source_search_browser_check.py": "49885136b7128ba3542bf32bc173b9a007309ea2e4d703371d92cc336d49275e",
+ "tools/museum_check.py": "ddc08fd1813471c1f951c28b89acdc41c7936b111aef1632a2dc2691f0329dc5",
+ "tools/museum_conditionals.mjs": "33148dfec91a5e3ef493716700bb7f6bf6bf7e73e2d4a643c4954a09e45f4623",
+ "tools/museum_data.py": "720c9a3e0397fc75a941681d68c2b47348837f04d194ca255c80325a1139381d",
+ "tools/navigation_check.py": "f8f8264d7c3e5da94d7e4a5cfb0a9ea07b299f039a049dd9e0eff60d96721648",
+ "tools/node_status_refresh.py": "30a0a87852e46c679de2528ff029ae14834b75b6d49d18cdfc3893b8d7f01f29",
+ "tools/periodic_pilot_custody.py": "84424de638c4d70975d9806596aa12515184035adb1473d554c3d0260d119472",
+ "tools/persistent_status_browser_check.py": "c7916ef456fd5ff37d9e367f4e6b5cccc9987e05be8c1c66e463a103bf4815c7",
+ "tools/privacy/drive_id_scan.py": "70806c7df83c156a5a47466016328bef5e9c218e4ed1344ecc0a68d7295fc06a",
+ "tools/proof_graph_export.py": "e5970975d23ca62acfe9f27d47c5b74e39366d8107a98affab2d989e89b320e6",
+ "tools/public_intake_check.py": "528465b1dca63cd52ae0c76ebe844cdaaaf0dfb67c9ea8665c2343385492c9df",
+ "tools/public_shop_browser_check.py": "d9255d25d4f96c62c53f42c41ae31ec023267fa0e64891776fa0c7a1677477c7",
+ "tools/public_shop_check.py": "89eff715667672ed1c97e47786c6df3fcf5a9c347ac2460486ab8ff32eddf15b",
+ "tools/public_shop_data.py": "e37d2949b6731a622d4c1b52da105d086abf3264bbcc213dbde596ef6d4eac5e",
+ "tools/public_vector_index.py": "408fdc99b2a262b521d53e0dce967acaceb0edf20f5555b42b13d4faa29cf5c5",
+ "tools/reader_jump_browser_check.py": "7c430e27c07c02e7e067192a23ea00be28b82dd6bcd443c7c631966b32064ebd",
+ "tools/reading_list_citation_browser_check.py": "a34c2dd4c9823bae717f29e5fcea636f8610316dd3bb3e0cc137fe2425cb36ea",
+ "tools/release_snapshot.py": "3799f749f4d0003ace889ede22285a11cb4f270b369fd122d1f6ced182e2a11c",
+ "tools/required_formal_check.py": "8eeb96bfa7471fb56747919fa2dfcba395182af737523cb1cf7091da28b1ebde",
+ "tools/research_delivery.py": "88d6e30182ae682d27f4d156f6c935f8373168ca6ff14d3141cd69c4b036d3a3",
+ "tools/research_desk_browser_check.py": "c2c22f0357b3e3dab65bac784b4289dad9d94c23a800f6412cb16310b7b0451e",
+ "tools/research_desk_continuity_browser_check.py": "f76679193dd4035476aa4b35afeebd05d9c12d4d8cc28ce7f3332dda981e099b",
+ "tools/research_desk_undo_browser_check.py": "09a298f133bfccd0a746b0ea9bb34bbf7bd8986f7baa07b946d401b0578e9a5f",
+ "tools/research_reading_browser_check.py": "1fdb1a9804460dfb1153be7abc777b573976f8c43a484479f379aaa6860914f1",
+ "tools/semantic_memory_experiment.py": "dbc5990ca0a7e2c6e50b1dbcfd2b761c843ef9097260795840ab8094b939696a",
+ "tools/site_asset_release.py": "390ea41ad0b4426913757c186e341dfcc1d1abcdafce505f51607a3dd31c0ffd",
+ "tools/site_graph_capture.py": "5353d5cc1e507f4dd8ef37a27ea1a1f0fa54ce9f90adac71c5462ab7001d2bc4",
+ "tools/snapshot_compare_browser_check.py": "b8b4e1c49368f8ae68862d4515b7805e7219d846193b7bfc6d4c6183e7e9cdc4",
+ "tools/source_census_20260927/EMBEDDED_RECOVERY.md": "c9f3332c5076b9bdc1fe5df06e45404544d57bb4723aa8c35cda529c5285c1dd",
+ "tools/source_census_20260927/README.md": "0dc40a4211223bdecd2cc4e23863918bc52dd49e33be28ac27c6550b93648610",
+ "tools/source_census_20260927/source_census.py": "ec53f0f15176d0e436e8d0a90ef323f20696d50567c1d42adf91304a693ea63e",
+ "tools/source_census_20260927/test_source_census.py": "6800939d8dcce2693ecfc9a77f5b35128535dee7c50895cc1d34e602311ed44a",
+ "tools/source_census_20260927/test_unpack_sources.py": "a7f0a8ddc5bb74c541c60052e7fa4d84e8c1ef646430a9a6af505655beca6e6a",
+ "tools/source_census_20260927/test_workflow_nonzero_discovery.py": "6fc5da2310a05e72b675a657e6d41d4f336ae8fe293a7d13b3c3bcee07c6af90",
+ "tools/source_census_20260927/unpack_sources.py": "60bddb2540a436d2467377b8dc2bf924ecfe1aeab098a81723cc3e8bcbc07b9f",
+ "tools/source_list_continuity_browser_check.py": "54cc653827ffdb48b1779b6f846046c1944c7c89678b6c06a3fcdb823cb4b0ea",
+ "tools/unittest_timing_probe.py": "094208b302059810971f4ed42bf687b814bbfd93a3c5ac871deab3075d475a26",
+ "tools/validate_node_status.py": "9ccadda867e00617b42177e8aee067c64bd6e52fbc79ec8fddc82653dfbc6375",
+ "tools/website_navigation_browser_check.py": "b188864d10bcc2f1b4ec82d86e50d30186e4114d1f8a06d62e27d6165f668cf4",
+ "tools/workspace_landing_check.py": "b46f1a6a9eae000877be80cb96727eb81a4a0c116162030f066ea799505077fa"
+ }
+}
\ No newline at end of file
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python.stderr b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python.stderr
new file mode 100644
index 000000000..c0fb79b8a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python.stderr
@@ -0,0 +1,311 @@
+test_research_index_matches_agent_entry (test_active_board_routing.RepositoryRoutingTests.test_research_index_matches_agent_entry) ... ok
+test_all_active_links_are_checked (test_active_board_routing.RoutingContractTests.test_all_active_links_are_checked) ... ok
+test_canonical_label_is_case_insensitive (test_active_board_routing.RoutingContractTests.test_canonical_label_is_case_insensitive) ... ok
+test_canonical_label_target_mismatch_is_refused (test_active_board_routing.RoutingContractTests.test_canonical_label_target_mismatch_is_refused) ... ok
+test_canonical_link_must_exist_and_be_unique (test_active_board_routing.RoutingContractTests.test_canonical_link_must_exist_and_be_unique) ... ok
+test_case_and_whitespace_normalization (test_active_board_routing.RoutingContractTests.test_case_and_whitespace_normalization) ... ok
+test_every_stale_active_link_is_reported (test_active_board_routing.RoutingContractTests.test_every_stale_active_link_is_reported) ... ok
+test_fence_closes_only_with_same_character (test_active_board_routing.RoutingContractTests.test_fence_closes_only_with_same_character) ... ok
+test_fence_with_info_string_does_not_close (test_active_board_routing.RoutingContractTests.test_fence_with_info_string_does_not_close) ... ok
+test_fenced_canonical_example_does_not_add_ambiguity (test_active_board_routing.RoutingContractTests.test_fenced_canonical_example_does_not_add_ambiguity) ... ok
+test_fenced_examples_are_ignored (test_active_board_routing.RoutingContractTests.test_fenced_examples_are_ignored) ... ok
+test_four_space_indent_is_not_a_fence (test_active_board_routing.RoutingContractTests.test_four_space_indent_is_not_a_fence) ... ok
+test_future_rollover_needs_no_hardcoded_board_update (test_active_board_routing.RoutingContractTests.test_future_rollover_needs_no_hardcoded_board_update) ... ok
+test_historical_links_and_comment_anchors_remain_allowed (test_active_board_routing.RoutingContractTests.test_historical_links_and_comment_anchors_remain_allowed) ... ok
+test_image_is_not_an_active_navigation_link (test_active_board_routing.RoutingContractTests.test_image_is_not_an_active_navigation_link) ... ok
+test_label_and_target_are_both_checked (test_active_board_routing.RoutingContractTests.test_label_and_target_are_both_checked) ... ok
+test_matching_active_and_current (test_active_board_routing.RoutingContractTests.test_matching_active_and_current) ... ok
+test_missing_active_label_is_not_vacuous_success (test_active_board_routing.RoutingContractTests.test_missing_active_label_is_not_vacuous_success) ... ok
+test_only_exact_active_labels_qualify (test_active_board_routing.RoutingContractTests.test_only_exact_active_labels_qualify) ... ok
+test_only_exact_canonical_labels_qualify (test_active_board_routing.RoutingContractTests.test_only_exact_canonical_labels_qualify) ... ok
+test_shorter_or_different_fence_does_not_close_example (test_active_board_routing.RoutingContractTests.test_shorter_or_different_fence_does_not_close_example) ... ok
+test_stale_active_board_is_detected (test_active_board_routing.RoutingContractTests.test_stale_active_board_is_detected) ... ok
+test_wrong_destination_variants_are_refused (test_active_board_routing.RoutingContractTests.test_wrong_destination_variants_are_refused) ... ok
+test_all_49_explicit_graph_nodes_remain_unmapped_without_a_binding (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_all_49_explicit_graph_nodes_remain_unmapped_without_a_binding) ... ok
+test_all_cli_flags_are_required_once_and_only_full_names_are_accepted (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_all_cli_flags_are_required_once_and_only_full_names_are_accepted) ... ok
+test_all_formatted_cells_are_strings_including_private_and_unselected_cells (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_all_formatted_cells_are_strings_including_private_and_unselected_cells) ... ok
+test_artifact_ids_are_globally_unique_and_valid_even_on_unselected_native_rows (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_artifact_ids_are_globally_unique_and_valid_even_on_unselected_native_rows) ... ok
+test_base64_is_strict_canonical_and_not_merely_decodable_to_the_expected_bytes (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_base64_is_strict_canonical_and_not_merely_decodable_to_the_expected_bytes) ... ok
+test_binding_roles_are_nonempty_unique_strings_from_the_exact_six_role_set (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_binding_roles_are_nonempty_unique_strings_from_the_exact_six_role_set) ... ok
+test_capture_identity_timestamp_and_declared_source_are_strictly_typed (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_capture_identity_timestamp_and_declared_source_are_strictly_typed) ... ok
+test_changed_input_components_cannot_replace_independently_supplied_pins (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_changed_input_components_cannot_replace_independently_supplied_pins) ... ok
+test_collection_limits_accept_4096_and_refuse_4097_without_duplicate_shortcuts (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_collection_limits_accept_4096_and_refuse_4097_without_duplicate_shortcuts) ... ok
+test_decoded_capture_limit_is_4_mib_of_original_bytes_not_base64_length (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_decoded_capture_limit_is_4_mib_of_original_bytes_not_base64_length) ... ok
+test_default_zero_offsets_and_unknown_native_annotations_are_private_and_inert (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_default_zero_offsets_and_unknown_native_annotations_are_private_and_inert) ... ok
+test_duplicate_keys_refuse_in_packet_wrappers_and_native_private_annotations (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_duplicate_keys_refuse_in_packet_wrappers_and_native_private_annotations) ... ok
+test_each_of_the_five_independent_expected_pins_must_match (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_each_of_the_five_independent_expected_pins_must_match) ... ok
+test_exact_header_order_names_types_and_single_header_are_required (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_exact_header_order_names_types_and_single_header_are_required) ... ok
+test_exact_public_projection_is_stable_and_retains_original_row_positions (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_exact_public_projection_is_stable_and_retains_original_row_positions) ... ok
+test_explicit_six_roles_and_bindings_sort_without_inferred_acceptance (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_explicit_six_roles_and_bindings_sort_without_inferred_acceptance) ... ok
+test_forged_column_policies_cannot_publish_source_notes_priority_or_topics (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_forged_column_policies_cannot_publish_source_notes_priority_or_topics) ... ok
+test_formatted_cell_limit_counts_utf8_bytes_in_public_private_and_unselected_rows (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_formatted_cell_limit_counts_utf8_bytes_in_public_private_and_unselected_rows) ... ok
+test_graph_ids_and_bindings_require_explicit_known_unique_identities (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_graph_ids_and_bindings_require_explicit_known_unique_identities) ... ok
+test_grid_dimensions_are_exact_integers_and_bound_all_declared_blocks (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_grid_dimensions_are_exact_integers_and_bound_all_declared_blocks) ... ok
+test_invalid_cli_digests_and_private_argument_values_are_never_echoed (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_invalid_cli_digests_and_private_argument_values_are_never_echoed) ... ok
+test_json_nesting_is_bounded_in_unknown_native_annotations_without_schema_masking (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_json_nesting_is_bounded_in_unknown_native_annotations_without_schema_masking) ... ok
+test_malformed_utf8_json_and_multiple_documents_refuse_at_both_input_layers (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_malformed_utf8_json_and_multiple_documents_refuse_at_both_input_layers) ... ok
+test_native_offsets_match_range_positions_and_refuse_boolean_float_or_missing_nonzero (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_native_offsets_match_range_positions_and_refuse_boolean_float_or_missing_nonzero) ... ok
+test_native_sheet_block_row_and_cell_shapes_and_cardinalities_are_enforced (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_native_sheet_block_row_and_cell_shapes_and_cardinalities_are_enforced) ... ok
+test_native_spreadsheet_worksheet_and_title_must_match_declared_metadata (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_native_spreadsheet_worksheet_and_title_must_match_declared_metadata) ... ok
+test_nonfinite_numbers_and_numeric_overflow_refuse_even_in_unknown_native_annotations (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_nonfinite_numbers_and_numeric_overflow_refuse_even_in_unknown_native_annotations) ... ok
+test_nonheader_rows_may_omit_only_trailing_private_source_and_notes_cells (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_nonheader_rows_may_omit_only_trailing_private_source_and_notes_cells) ... ok
+test_nonheader_rows_outside_ten_to_twelve_cells_and_short_headers_refuse (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_nonheader_rows_outside_ten_to_twelve_cells_and_short_headers_refuse) ... ok
+test_p2_synthetic_trailing_suffix_fixture_projects_with_its_independent_pins (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_p2_synthetic_trailing_suffix_fixture_projects_with_its_independent_pins) ... ok
+test_packet_wrappers_are_closed_and_schema_versions_have_exact_integer_types (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_packet_wrappers_are_closed_and_schema_versions_have_exact_integer_types) ... ok
+test_policy_array_order_is_pinned_even_when_public_rows_have_the_same_order (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_policy_array_order_is_pinned_even_when_public_rows_have_the_same_order) ... ok
+test_policy_ids_are_nonempty_unique_valid_and_present_in_native_rows (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_policy_ids_are_nonempty_unique_valid_and_present_in_native_rows) ... ok
+test_public_unicode_empty_cells_and_historical_scope_are_preserved_without_promotion (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_public_unicode_empty_cells_and_historical_scope_are_preserved_without_promotion) ... ok
+test_ranges_require_exact_title_a_to_l_syntax_order_and_nonoverlap (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_ranges_require_exact_title_a_to_l_syntax_order_and_nonoverlap) ... ok
+test_stdin_limit_is_16_mib_of_bytes_including_legal_json_whitespace (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_stdin_limit_is_16_mib_of_bytes_including_legal_json_whitespace) ... ok
+test_urls_paths_and_code_are_inert_data_without_fetch_execution_or_filesystem_writes (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_urls_paths_and_code_are_inert_data_without_fetch_execution_or_filesystem_writes) ... ok
+test_artifact_id_requires_positive_ascii_decimal_without_leading_zero (test_architecture_binding.ArchitectureBindingContract.test_artifact_id_requires_positive_ascii_decimal_without_leading_zero) ... ok
+test_artifact_name_is_exactly_bound_to_current_run_and_attempt (test_architecture_binding.ArchitectureBindingContract.test_artifact_name_is_exactly_bound_to_current_run_and_attempt) ... ok
+test_attempt_ten_is_a_positive_decimal_not_a_single_digit (test_architecture_binding.ArchitectureBindingContract.test_attempt_ten_is_a_positive_decimal_not_a_single_digit) ... ok
+test_commit_format_cannot_be_authorized_by_an_equally_invalid_native_commit (test_architecture_binding.ArchitectureBindingContract.test_commit_format_cannot_be_authorized_by_an_equally_invalid_native_commit) ... ok
+test_deeply_nested_json_is_refused_without_a_success_envelope (test_architecture_binding.ArchitectureBindingContract.test_deeply_nested_json_is_refused_without_a_success_envelope) ... ok
+test_duplicate_top_level_keys_are_refused_even_when_last_value_is_valid (test_architecture_binding.ArchitectureBindingContract.test_duplicate_top_level_keys_are_refused_even_when_last_value_is_valid) ... ok
+test_each_current_native_argument_is_used_for_identity_binding (test_architecture_binding.ArchitectureBindingContract.test_each_current_native_argument_is_used_for_identity_binding) ... ok
+test_each_duplicate_output_key_is_refused_even_when_last_value_is_valid (test_architecture_binding.ArchitectureBindingContract.test_each_duplicate_output_key_is_refused_even_when_last_value_is_valid) ... ok
+test_each_expected_native_identity_argument_is_required (test_architecture_binding.ArchitectureBindingContract.test_each_expected_native_identity_argument_is_required) ... ok
+test_each_non_success_result_is_refused (test_architecture_binding.ArchitectureBindingContract.test_each_non_success_result_is_refused) ... ok
+test_each_of_the_eight_outputs_is_required (test_architecture_binding.ArchitectureBindingContract.test_each_of_the_eight_outputs_is_required) ... ok
+test_each_output_rejects_an_empty_string (test_architecture_binding.ArchitectureBindingContract.test_each_output_rejects_an_empty_string) ... ok
+test_each_output_rejects_non_string_identities_without_coercion (test_architecture_binding.ArchitectureBindingContract.test_each_output_rejects_non_string_identities_without_coercion) ... ok
+test_each_top_level_field_is_required (test_architecture_binding.ArchitectureBindingContract.test_each_top_level_field_is_required) ... ok
+test_extra_output_fields_are_refused (test_architecture_binding.ArchitectureBindingContract.test_extra_output_fields_are_refused) ... ok
+test_extra_top_level_fields_are_refused (test_architecture_binding.ArchitectureBindingContract.test_extra_top_level_fields_are_refused) ... ok
+test_invalid_or_multiple_json_documents_are_refused (test_architecture_binding.ArchitectureBindingContract.test_invalid_or_multiple_json_documents_are_refused) ... ok
+test_non_finite_json_numbers_are_refused (test_architecture_binding.ArchitectureBindingContract.test_non_finite_json_numbers_are_refused) ... ok
+test_non_object_top_level_values_are_refused (test_architecture_binding.ArchitectureBindingContract.test_non_object_top_level_values_are_refused) ... ok
+test_other_valid_native_identities_are_accepted_and_preserved (test_architecture_binding.ArchitectureBindingContract.test_other_valid_native_identities_are_accepted_and_preserved) ... ok
+test_outputs_must_be_an_object (test_architecture_binding.ArchitectureBindingContract.test_outputs_must_be_an_object) ... ok
+test_receipt_and_artifact_sha256_require_lowercase_64_hex_digits (test_architecture_binding.ArchitectureBindingContract.test_receipt_and_artifact_sha256_require_lowercase_64_hex_digits) ... ok
+test_repository_substitution_and_case_drift_are_refused (test_architecture_binding.ArchitectureBindingContract.test_repository_substitution_and_case_drift_are_refused) ... ok
+test_run_and_attempt_decimal_format_cannot_be_authorized_by_invalid_native_args (test_architecture_binding.ArchitectureBindingContract.test_run_and_attempt_decimal_format_cannot_be_authorized_by_invalid_native_args) ... ok
+test_stale_attempt_is_refused_even_with_a_matching_stale_artifact_name (test_architecture_binding.ArchitectureBindingContract.test_stale_attempt_is_refused_even_with_a_matching_stale_artifact_name) ... ok
+test_stale_checked_commit_is_refused (test_architecture_binding.ArchitectureBindingContract.test_stale_checked_commit_is_refused) ... ok
+test_stale_run_is_refused_even_with_a_matching_stale_artifact_name (test_architecture_binding.ArchitectureBindingContract.test_stale_run_is_refused_even_with_a_matching_stale_artifact_name) ... ok
+test_valid_current_run_has_exact_stable_non_scientific_output (test_architecture_binding.ArchitectureBindingContract.test_valid_current_run_has_exact_stable_non_scientific_output) ... ok
+test_valid_json_at_exact_stdin_byte_limit_is_accepted (test_architecture_binding.ArchitectureBindingContract.test_valid_json_at_exact_stdin_byte_limit_is_accepted) ... ok
+test_valid_json_over_stdin_byte_limit_is_refused (test_architecture_binding.ArchitectureBindingContract.test_valid_json_over_stdin_byte_limit_is_refused) ... ok
+test_cli_refusal_opaque_and_no_stdout (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_cli_refusal_opaque_and_no_stdout) ... ok
+test_cli_success_is_deterministic_and_nonadmitting (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_cli_success_is_deterministic_and_nonadmitting) ... ok
+test_conditional_mean_requires_explicit_premise (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_conditional_mean_requires_explicit_premise) ... ok
+test_duplicate_json_keys_and_scientific_claim_injection_refuse (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_duplicate_json_keys_and_scientific_claim_injection_refuse) ... ok
+test_event_probability_alone_does_not_control_expected_count (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_event_probability_alone_does_not_control_expected_count) ... ok
+test_event_scope_mismatch_refuses (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_event_scope_mismatch_refuses) ... ok
+test_finite_moment_cannot_satisfy_cubic_goal_without_more (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_finite_moment_cannot_satisfy_cubic_goal_without_more) ... ok
+test_float_and_boolean_moment_orders_refuse (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_float_and_boolean_moment_orders_refuse) ... ok
+test_holder_growing_moment_has_beta_penalty (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_holder_growing_moment_has_beta_penalty) ... ok
+test_holder_inequality_comparison_only (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_holder_inequality_comparison_only) ... ok
+test_holder_p2_is_three_halves_not_three (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_holder_p2_is_three_halves_not_three) ... ok
+test_holder_p4_is_nine_quarters (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_holder_p4_is_nine_quarters) ... ok
+test_invalid_identity_value_refuses (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_invalid_identity_value_refuses) ... ok
+test_json_float_constant_and_length_refuse (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_json_float_constant_and_length_refuse) ... ok
+test_nonexact_or_out_of_scope_exponents_refuse (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_nonexact_or_out_of_scope_exponents_refuse) ... ok
+test_rare_count_exact_counterexample (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_rare_count_exact_counterexample) ... ok
+test_scope_dimensions_reject_cross_population (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_scope_dimensions_reject_cross_population) ... ok
+test_source_pins_are_fixed_but_not_implicitly_verified (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_source_pins_are_fixed_but_not_implicitly_verified) ... ok
+test_unconditional_count_not_supported (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_unconditional_count_not_supported) ... ok
+test_unknown_key_and_extra_count_premise_refuse (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_unknown_key_and_extra_count_premise_refuse) ... ok
+test_wrong_source_rate_refuses (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_wrong_source_rate_refuses) ... ok
+test_artifact_index_broken_stdout_has_one_opaque_refusal_and_exit_one (test_architecture_cli_boundaries.ArchitectureCliBoundaryContract.test_artifact_index_broken_stdout_has_one_opaque_refusal_and_exit_one) ... ok
+test_artifact_index_symlink_cannot_read_synthetic_private_input (test_architecture_cli_boundaries.ArchitectureCliBoundaryContract.test_artifact_index_symlink_cannot_read_synthetic_private_input) ... ok
+test_graph_readback_broken_stdout_has_one_opaque_refusal_and_exit_one (test_architecture_cli_boundaries.ArchitectureCliBoundaryContract.test_graph_readback_broken_stdout_has_one_opaque_refusal_and_exit_one) ... ok
+test_graph_readback_symlink_cannot_read_synthetic_private_input (test_architecture_cli_boundaries.ArchitectureCliBoundaryContract.test_graph_readback_symlink_cannot_read_synthetic_private_input) ... ok
+test_actual_proof_byte_change_preserves_old_join_loss_and_fresh_origin_recovery (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_actual_proof_byte_change_preserves_old_join_loss_and_fresh_origin_recovery) ... ok
+test_affected_alignment_references_deduplicate_full_original_identity (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_affected_alignment_references_deduplicate_full_original_identity) ... ok
+test_alignment_partial_coverage_stale_scope_or_lineage_remains_original_stale_record (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_alignment_partial_coverage_stale_scope_or_lineage_remains_original_stale_record) ... ok
+test_all_expected_context_flags_are_required_unique_and_syntax_checked (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_all_expected_context_flags_are_required_unique_and_syntax_checked) ... ok
+test_binding_context_digest_covers_graph_sources_slices_every_null_row_and_domain (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_binding_context_digest_covers_graph_sources_slices_every_null_row_and_domain) ... ok
+test_binding_review_successor_does_not_clear_unreplaced_group_or_failed_main_join (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_binding_review_successor_does_not_clear_unreplaced_group_or_failed_main_join) ... ok
+test_canonical_record_numeric_types_are_changes_even_when_python_equality_agrees (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_canonical_record_numeric_types_are_changes_even_when_python_equality_agrees) ... ok
+test_captured_code_and_paths_remain_inert_packet_data (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_captured_code_and_paths_remain_inert_packet_data) ... ok
+test_claimed_binding_context_has_closed_exact_schema_even_without_regression (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_claimed_binding_context_has_closed_exact_schema_even_without_regression) ... ok
+test_closed_packet_capture_binding_and_formal_wrappers_refuse_extra_or_missing_keys (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_closed_packet_capture_binding_and_formal_wrappers_refuse_extra_or_missing_keys) ... ok
+test_complete_formal_scope_is_retained_without_authenticated_or_fuzzy_joins (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_complete_formal_scope_is_retained_without_authenticated_or_fuzzy_joins) ... ok
+test_conflicting_bytes_for_one_immutable_git_identity_anywhere_are_refused (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_conflicting_bytes_for_one_immutable_git_identity_anywhere_are_refused) ... ok
+test_decoded_capture_limit_and_embedded_json_depth_and_duplicate_keys_are_bounded (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_decoded_capture_limit_and_embedded_json_depth_and_duplicate_keys_are_bounded) ... ok
+test_deleted_and_added_nodes_use_union_edges_but_only_survivors_get_proposals (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_deleted_and_added_nodes_use_union_edges_but_only_survivors_get_proposals) ... ok
+test_deleted_formal_mapping_retains_original_review_and_holds_surviving_shared_mapping (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_deleted_formal_mapping_retains_original_review_and_holds_surviving_shared_mapping) ... ok
+test_dependency_regression_stales_shared_whole_alignment_without_erasing_kernel (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_dependency_regression_stales_shared_whole_alignment_without_erasing_kernel) ... ok
+test_distinct_original_alignment_identities_are_retained_and_canonically_sorted (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_distinct_original_alignment_identities_are_retained_and_canonically_sorted) ... ok
+test_duplicate_and_nonfinite_json_and_oversized_packets_are_refused (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_duplicate_and_nonfinite_json_and_oversized_packets_are_refused) ... ok
+test_elaborated_comment_only_types_are_incomplete_but_real_types_remain_current (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_elaborated_comment_only_types_are_incomplete_but_real_types_remain_current) ... ok
+test_elaborated_target_coverage_is_required_and_silent_checker_is_valid (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_elaborated_target_coverage_is_required_and_silent_checker_is_valid) ... ok
+test_equal_hash_proof_selector_offsets_still_require_binding_context (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_equal_hash_proof_selector_offsets_still_require_binding_context) ... ok
+test_exact_successor_review_cannot_clear_shared_alignment_with_one_unresolved_main_join (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_exact_successor_review_cannot_clear_shared_alignment_with_one_unresolved_main_join) ... ok
+test_expected_native_context_mismatch_is_valid_stale_not_authentication (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_expected_native_context_mismatch_is_valid_stale_not_authentication) ... ok
+test_explicit_successor_graph_review_clears_only_its_exact_regression_context (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_explicit_successor_graph_review_clears_only_its_exact_regression_context) ... ok
+test_failed_or_skipped_incomplete_run_and_expected_failure_never_become_positive_kernel (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_failed_or_skipped_incomplete_run_and_expected_failure_never_become_positive_kernel) ... ok
+test_git_capture_checks_exact_raw_byte_count_sha_blob_and_canonical_base64 (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_git_capture_checks_exact_raw_byte_count_sha_blob_and_canonical_base64) ... ok
+test_graph_context_changes_revalidate_all_nodes_and_preserve_context (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_graph_context_changes_revalidate_all_nodes_and_preserve_context) ... ok
+test_graph_node_and_edge_admission_limits_cover_both_snapshots_and_alias_captures (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_graph_node_and_edge_admission_limits_cover_both_snapshots_and_alias_captures) ... ok
+test_main_alignment_author_binds_retained_manifest_lineage_without_relabeling (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_alignment_author_binds_retained_manifest_lineage_without_relabeling) ... ok
+test_main_bound_dependency_lock_matches_native_package_names_and_revisions (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_bound_dependency_lock_matches_native_package_names_and_revisions) ... ok
+test_main_known_package_captures_require_bound_or_unbound_component_membership (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_known_package_captures_require_bound_or_unbound_component_membership) ... ok
+test_main_manifest_capture_path_is_the_fixed_native_workflow_default (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_manifest_capture_path_is_the_fixed_native_workflow_default) ... ok
+test_main_manifest_package_requires_nonempty_native_text_even_when_receipt_matches (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_manifest_package_requires_nonempty_native_text_even_when_receipt_matches) ... ok
+test_main_native_producer_requires_its_fixed_toolchain_and_Lean_version (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_native_producer_requires_its_fixed_toolchain_and_Lean_version) ... ok
+test_main_negative_control_logs_must_be_present_under_exact_receipt_bound_names (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_negative_control_logs_must_be_present_under_exact_receipt_bound_names) ... ok
+test_main_negative_control_logs_need_the_native_rejection_evidence (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_negative_control_logs_need_the_native_rejection_evidence) ... ok
+test_main_ordered_declarations_namespaces_and_root_imports_match_the_native_inventory (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_ordered_declarations_namespaces_and_root_imports_match_the_native_inventory) ... ok
+test_main_origin_repository_policy_and_selected_utf8_sources_match_native_reads (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_origin_repository_policy_and_selected_utf8_sources_match_native_reads) ... ok
+test_main_origin_source_is_distinct_from_its_bound_local_copy (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_origin_source_is_distinct_from_its_bound_local_copy) ... ok
+test_main_original_version_log_is_required_and_matches_the_entire_trimmed_receipt_value (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_original_version_log_is_required_and_matches_the_entire_trimmed_receipt_value) ... ok
+test_main_placeholder_lineage_cannot_be_current_even_with_coherent_author_bindings (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_placeholder_lineage_cannot_be_current_even_with_coherent_author_bindings) ... ok
+test_main_positive_execution_log_basenames_cannot_be_reused_by_registered_negative_controls (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_positive_execution_log_basenames_cannot_be_reused_by_registered_negative_controls) ... ok
+test_main_prohibited_proof_constructs_follow_native_comment_and_word_boundary_rules (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_prohibited_proof_constructs_follow_native_comment_and_word_boundary_rules) ... ok
+test_main_receipt_log_alphabet_preserves_safe_extras_and_math_boundary (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_receipt_log_alphabet_preserves_safe_extras_and_math_boundary) ... ok
+test_main_registered_control_decide_body_cannot_consume_another_diagnostic (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_decide_body_cannot_consume_another_diagnostic) ... ok
+test_main_registered_control_explicit_quoted_diagnostics_remain_unknown (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_explicit_quoted_diagnostics_remain_unknown) ... ok
+test_main_registered_control_large_embedded_cr_diagnostic_remains_unknown (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_large_embedded_cr_diagnostic_remains_unknown) ... ok
+test_main_registered_control_native_diagnostic_crlf_remains_current (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_native_diagnostic_crlf_remains_current) ... ok
+test_main_registered_control_native_error_diagnostics_remain_current (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_native_error_diagnostics_remain_current) ... ok
+test_main_registered_control_quoted_diagnostics_do_not_establish_lean_rejection (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_quoted_diagnostics_do_not_establish_lean_rejection) ... ok
+test_main_registered_control_summaries_do_not_establish_lean_rejection (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_summaries_do_not_establish_lean_rejection) ... ok
+test_main_registered_control_warnings_do_not_establish_lean_rejection (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_warnings_do_not_establish_lean_rejection) ... ok
+test_main_registered_lean_suffix_and_visible_captured_lean_inventory_match_native_scope (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_lean_suffix_and_visible_captured_lean_inventory_match_native_scope) ... ok
+test_main_registered_mutation_source_preconditions_hold_before_builtin_overrides (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_mutation_source_preconditions_hold_before_builtin_overrides) ... ok
+test_main_required_control_file_floor_and_captured_toolchain_bytes_match_native_source_check (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_required_control_file_floor_and_captured_toolchain_bytes_match_native_source_check) ... ok
+test_main_surplus_control_outcomes_refuse_but_missing_outcomes_remain_incomplete (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_surplus_control_outcomes_refuse_but_missing_outcomes_remain_incomplete) ... ok
+test_main_target_requires_exact_source_identity_and_explicit_statement_slice (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_target_requires_exact_source_identity_and_explicit_statement_slice) ... ok
+test_math_alignment_checks_every_proposer_normalized_lineage_and_target_scope (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_math_alignment_checks_every_proposer_normalized_lineage_and_target_scope) ... ok
+test_math_native_receipt_does_not_acquire_main_only_native_fields (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_math_native_receipt_does_not_acquire_main_only_native_fields) ... ok
+test_math_negative_control_log_inventory_keeps_its_distinct_native_names (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_math_negative_control_log_inventory_keeps_its_distinct_native_names) ... ok
+test_math_optional_proposer_scopes_preserve_historical_schema_and_every_lineage (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_math_optional_proposer_scopes_preserve_historical_schema_and_every_lineage) ... ok
+test_math_source_and_version_records_keep_their_separate_historical_boundary (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_math_source_and_version_records_keep_their_separate_historical_boundary) ... ok
+test_minimal_unchanged_packet_is_deterministic_unknown_and_inert (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_minimal_unchanged_packet_is_deterministic_unknown_and_inert) ... ok
+test_native_SCOPE_file_cannot_be_substituted_by_another_manifest_bound_file (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_native_SCOPE_file_cannot_be_substituted_by_another_manifest_bound_file) ... ok
+test_native_expected_context_changes_only_kernel_not_statement_alignment (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_native_expected_context_changes_only_kernel_not_statement_alignment) ... ok
+test_native_manifest_file_coverage_and_receipt_log_hashes_cannot_contradict_captures (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_native_manifest_file_coverage_and_receipt_log_hashes_cannot_contradict_captures) ... ok
+test_native_negative_control_outcomes_cannot_swap_Lean_and_axiom_gate_rejections (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_native_negative_control_outcomes_cannot_swap_Lean_and_axiom_gate_rejections) ... ok
+test_native_receipt_and_logs_share_parent_and_fixed_basename_with_null_receipt_preserved (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_native_receipt_and_logs_share_parent_and_fixed_basename_with_null_receipt_preserved) ... ok
+test_original_axioms_dump_cannot_contradict_receipt_target_scope_or_values (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_original_axioms_dump_cannot_contradict_receipt_target_scope_or_values) ... ok
+test_partial_successful_target_inventory_is_retained_but_not_current_kernel (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_partial_successful_target_inventory_is_retained_but_not_current_kernel) ... ok
+test_proof_only_change_stales_whole_manifest_alignment_without_statement_change (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_proof_only_change_stales_whole_manifest_alignment_without_statement_change) ... ok
+test_proof_selector_change_or_loss_requires_context_without_erasing_current_kernel (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_proof_selector_change_or_loss_requires_context_without_erasing_current_kernel) ... ok
+test_required_cycle_and_boolean_coercion_are_refused_but_context_cycle_is_valid (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_required_cycle_and_boolean_coercion_are_refused_but_context_cycle_is_valid) ... ok
+test_retrofit_failed_evidence_remains_recorded_without_positive_kernel_or_computation (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_retrofit_failed_evidence_remains_recorded_without_positive_kernel_or_computation) ... ok
+test_run_artifact_is_not_a_git_file_and_raw_hashes_and_native_bindings_must_match (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_run_artifact_is_not_a_git_file_and_raw_hashes_and_native_bindings_must_match) ... ok
+test_source_availability_loss_is_unresolved_and_propagates_without_guessed_slices (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_source_availability_loss_is_unresolved_and_propagates_without_guessed_slices) ... ok
+test_statement_and_proof_slice_bounds_types_and_hashes_are_exact_bytes (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_statement_and_proof_slice_bounds_types_and_hashes_are_exact_bytes) ... ok
+test_statement_change_uses_removed_and_context_edges_and_names_exact_review (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_statement_change_uses_removed_and_context_edges_and_names_exact_review) ... ok
+test_unknown_native_format_or_packet_authentication_claim_is_refused (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_unknown_native_format_or_packet_authentication_claim_is_refused) ... ok
+test_unknown_or_duplicate_explicit_node_target_binding_is_a_contradiction (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_unknown_or_duplicate_explicit_node_target_binding_is_a_contradiction) ... ok
+test_unmapped_similar_node_does_not_invent_an_affected_alignment_record (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_unmapped_similar_node_does_not_invent_an_affected_alignment_record) ... ok
+test_unscoped_source_change_is_unknown_not_a_guessed_statement_or_proof_split (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_unscoped_source_change_is_unknown_not_a_guessed_statement_or_proof_split) ... ok
+test_cli_refuses_unknown_node (test_architecture_evidence_path.EvidencePathArchitectureTests.test_cli_refuses_unknown_node) ... ok
+test_complete_path_for_synthetic_bound_node (test_architecture_evidence_path.EvidencePathArchitectureTests.test_complete_path_for_synthetic_bound_node) ... ok
+test_generic_unbound_node_reports_missing_binding (test_architecture_evidence_path.EvidencePathArchitectureTests.test_generic_unbound_node_reports_missing_binding) ... ok
+test_https_evidence_values_and_existing_limits_are_preserved (test_architecture_evidence_path.EvidencePathArchitectureTests.test_https_evidence_values_and_existing_limits_are_preserved) ... ok
+test_inputs_are_not_mutated (test_architecture_evidence_path.EvidencePathArchitectureTests.test_inputs_are_not_mutated) ... ok
+test_invalid_numeric_https_hosts_are_missing (test_architecture_evidence_path.EvidencePathArchitectureTests.test_invalid_numeric_https_hosts_are_missing) ... ok
+test_malformed_https_evidence_authorities_are_missing (test_architecture_evidence_path.EvidencePathArchitectureTests.test_malformed_https_evidence_authorities_are_missing) ... ok
+test_malformed_node_id_is_refused (test_architecture_evidence_path.EvidencePathArchitectureTests.test_malformed_node_id_is_refused) ... ok
+test_missing_empty_or_traversal_path_is_not_a_pinned_source (test_architecture_evidence_path.EvidencePathArchitectureTests.test_missing_empty_or_traversal_path_is_not_a_pinned_source) ... ok
+test_missing_receipt_and_review_are_named_not_padded (test_architecture_evidence_path.EvidencePathArchitectureTests.test_missing_receipt_and_review_are_named_not_padded) ... ok
+test_non_sha_commit_in_identity_is_not_a_pinned_source (test_architecture_evidence_path.EvidencePathArchitectureTests.test_non_sha_commit_in_identity_is_not_a_pinned_source) ... ok
+test_punctured_pin_projection_is_explicitly_missing (test_architecture_evidence_path.EvidencePathArchitectureTests.test_punctured_pin_projection_is_explicitly_missing) ... ok
+test_raw_url_whitespace_controls_and_backslashes_are_missing (test_architecture_evidence_path.EvidencePathArchitectureTests.test_raw_url_whitespace_controls_and_backslashes_are_missing) ... ok
+test_repository_punctured_pin_is_missing_via_cli (test_architecture_evidence_path.EvidencePathArchitectureTests.test_repository_punctured_pin_is_missing_via_cli) ... ok
+test_source_path_is_serialized_as_url_path_data (test_architecture_evidence_path.EvidencePathArchitectureTests.test_source_path_is_serialized_as_url_path_data) ... ok
+test_unknown_node_is_refused (test_architecture_evidence_path.EvidencePathArchitectureTests.test_unknown_node_is_refused) ... ok
+test_valid_numeric_and_nonnumeric_https_hosts_are_preserved (test_architecture_evidence_path.EvidencePathArchitectureTests.test_valid_numeric_and_nonnumeric_https_hosts_are_preserved) ... ok
+test_added_node_is_reported_without_attribute_change (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_added_node_is_reported_without_attribute_change) ... ok
+test_boolean_number_metadata_changes_are_reported (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_boolean_number_metadata_changes_are_reported) ... ok
+test_boolean_number_node_changes_are_reported (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_boolean_number_node_changes_are_reported) ... ok
+test_connected_tree (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_connected_tree) ... ok
+test_deeply_nested_parsed_values_keep_comparison_semantics (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_deeply_nested_parsed_values_keep_comparison_semantics) ... ok
+test_deleted_node_and_edge (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_deleted_node_and_edge) ... ok
+test_deterministic_output (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_deterministic_output) ... ok
+test_duplicate_graph_json_object_key_refuses (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_duplicate_graph_json_object_key_refuses) ... ok
+test_dynamic_snapshot_changes (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_dynamic_snapshot_changes) ... ok
+test_loop_is_one_cell (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_loop_is_one_cell) ... ok
+test_nested_boolean_number_metadata_changes_are_reported (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_nested_boolean_number_metadata_changes_are_reported) ... ok
+test_nested_boolean_number_node_changes_are_reported (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_nested_boolean_number_node_changes_are_reported) ... ok
+test_no_comparison_without_both_flags (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_no_comparison_without_both_flags) ... ok
+test_node_metadata_changes_not_scientifically_interpreted (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_node_metadata_changes_not_scientifically_interpreted) ... ok
+test_other_parsed_value_changes_remain_reported (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_other_parsed_value_changes_remain_reported) ... ok
+test_parallel_directed_cells_are_not_collapsed (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_parallel_directed_cells_are_not_collapsed) ... ok
+test_parsed_value_equivalence_does_not_invent_changes (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_parsed_value_equivalence_does_not_invent_changes) ... ok
+test_reject_nonboolean_edge_required_and_unknown_field (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_reject_nonboolean_edge_required_and_unknown_field) ... ok
+test_reject_nonfinite_and_bare_empty_nodes (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_reject_nonfinite_and_bare_empty_nodes) ... ok
+test_required_subgraph_keeps_all_vertices (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_required_subgraph_keeps_all_vertices) ... ok
+test_single_vertex_and_no_edges (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_single_vertex_and_no_edges) ... ok
+test_source_size_limit (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_source_size_limit) ... ok
+test_top_level_metadata_keys_are_compared_by_name (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_top_level_metadata_keys_are_compared_by_name) ... ok
+test_two_disconnected_edges (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_two_disconnected_edges) ... ok
+test_undirected_cycle (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_undirected_cycle) ... ok
+test_unknown_endpoint_and_duplicate_edge_refuse (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_unknown_endpoint_and_duplicate_edge_refuse) ... ok
+test_wrong_comparison_digest_refuses (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_wrong_comparison_digest_refuses) ... ok
+test_wrong_source_digest_refuses (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_wrong_source_digest_refuses) ... ok
+test_actual_deflate_expansion_cannot_exceed_a_small_declared_size (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_actual_deflate_expansion_cannot_exceed_a_small_declared_size) ... ok
+test_all_89_literal_ids_are_required_even_with_a_coherent_substitute_count (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_all_89_literal_ids_are_required_even_with_a_coherent_substitute_count) ... ok
+test_all_native_flags_are_required_unique_and_opaque_on_argument_refusal (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_all_native_flags_are_required_unique_and_opaque_on_argument_refusal) ... ok
+test_all_twelve_manifest_hashes_and_closed_row_format_are_checked (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_all_twelve_manifest_hashes_and_closed_row_format_are_checked) ... ok
+test_both_complete_suites_and_receipt_mode_counts_and_id_lists_must_agree (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_both_complete_suites_and_receipt_mode_counts_and_id_lists_must_agree) ... ok
+test_captured_paths_code_urls_and_annotations_are_inert_with_calibrated_observers (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_captured_paths_code_urls_and_annotations_are_inert_with_calibrated_observers) ... ok
+test_crc_incomplete_deflate_and_unused_compressed_tail_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_crc_incomplete_deflate_and_unused_compressed_tail_are_refused) ... ok
+test_duplicate_case_alias_nul_and_unsafe_archive_member_names_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_duplicate_case_alias_nul_and_unsafe_archive_member_names_are_refused) ... ok
+test_each_closed_member_is_required_and_additional_members_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_each_closed_member_is_required_and_additional_members_are_refused) ... ok
+test_each_receipt_evidence_hash_is_required_exact_and_independently_recomputed (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_each_receipt_evidence_hash_is_required_exact_and_independently_recomputed) ... ok
+test_equal_additional_passing_inventory_includes_nonunderscore_unittest_names (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_equal_additional_passing_inventory_includes_nonunderscore_unittest_names) ... ok
+test_exact_4096_inventory_is_valid_and_coherent_4097_is_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_exact_4096_inventory_is_valid_and_coherent_4097_is_refused) ... ok
+test_exact_64_container_depth_is_valid_and_65_is_refused_in_native_annotations (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_exact_64_container_depth_is_valid_and_65_is_refused_in_native_annotations) ... ok
+test_exact_member_limits_accept_bounded_content_and_one_over_refuses (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_exact_member_limits_accept_bounded_content_and_one_over_refuses) ... ok
+test_failed_skipped_or_expected_negative_results_never_qualify_as_passing (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_failed_skipped_or_expected_negative_results_never_qualify_as_passing) ... ok
+test_fixed_exporter_diagnostics_cannot_claim_a_different_output_or_leak_on_refusal (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_fixed_exporter_diagnostics_cannot_claim_a_different_output_or_leak_on_refusal) ... ok
+test_graph_seven_root_fields_and_all_five_source_pins_cannot_be_replaced (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_graph_seven_root_fields_and_all_five_source_pins_cannot_be_replaced) ... ok
+test_input_is_one_regular_nofollow_file_and_fifo_never_waits_for_a_writer (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_input_is_one_regular_nofollow_file_and_fifo_never_waits_for_a_writer) ... ok
+test_json_duplicates_nonfinite_unicode_and_multiple_documents_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_json_duplicates_nonfinite_unicode_and_multiple_documents_are_refused) ... ok
+test_local_central_or_descriptor_contradictions_and_overlap_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_local_central_or_descriptor_contradictions_and_overlap_are_refused) ... ok
+test_log_duplicates_multiple_runs_footer_and_terminal_success_are_exact (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_log_duplicates_multiple_runs_footer_and_terminal_success_are_exact) ... ok
+test_malformed_result_looking_extras_cannot_hide_behind_valid_89_ids_and_footer (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_malformed_result_looking_extras_cannot_hide_behind_valid_89_ids_and_footer) ... ok
+test_native_context_and_both_external_byte_pins_cannot_be_substituted (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_native_context_and_both_external_byte_pins_cannot_be_substituted) ... ok
+test_native_text_files_and_original_receipt_context_must_match_expected_native_four (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_native_text_files_and_original_receipt_context_must_match_expected_native_four) ... ok
+test_original_receipt_external_pin_survives_coherent_manifest_regeneration (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_original_receipt_external_pin_survives_coherent_manifest_regeneration) ... ok
+test_other_native_context_attempt_ten_and_declared_artifact_id_are_preserved (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_other_native_context_attempt_ten_and_declared_artifact_id_are_preserved) ... ok
+test_producer_receipt_schema_types_authority_and_closed_native_objects_are_exact (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_producer_receipt_schema_types_authority_and_closed_native_objects_are_exact) ... ok
+test_public_graph_keeps_49_dictionary_ids_55_edges_and_distinct_recorded_axes (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_public_graph_keeps_49_dictionary_ids_55_edges_and_distinct_recorded_axes) ... ok
+test_raw_zip_at_exact_64_mib_passes_and_one_byte_over_is_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_raw_zip_at_exact_64_mib_passes_and_one_byte_over_is_refused) ... ok
+test_runtime_inspect_and_original_receipt_image_identity_are_consistent (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_runtime_inspect_and_original_receipt_image_identity_are_consistent) ... ok
+test_small_member_budgets_and_exact_128_byte_positive_decimal_are_enforced (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_small_member_budgets_and_exact_128_byte_positive_decimal_are_enforced) ... ok
+test_special_attributes_encryption_and_unsupported_flags_or_methods_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_special_attributes_encryption_and_unsupported_flags_or_methods_are_refused) ... ok
+test_stored_deflated_descriptors_and_member_or_manifest_order_are_valid (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_stored_deflated_descriptors_and_member_or_manifest_order_are_valid) ... ok
+test_truncation_prefix_tail_multidisk_zip64_comments_and_extras_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_truncation_prefix_tail_multidisk_zip64_comments_and_extras_are_refused) ... ok
+test_typed_node_edge_and_dimensions_cannot_change_under_unchanged_source_pins (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_typed_node_edge_and_dimensions_cannot_change_under_unchanged_source_pins) ... ok
+test_unreferenced_interior_gap_or_hidden_local_record_is_refused_with_coherent_offsets (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_unreferenced_interior_gap_or_hidden_local_record_is_refused_with_coherent_offsets) ... ok
+test_valid_archive_is_one_stable_non_scientific_unit_with_original_receipt (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_valid_archive_is_one_stable_non_scientific_unit_with_original_receipt) ... ok
+test_caller_pinned_provenance_cannot_authorize_different_gate_code (test_architecture_graph_export.ArchitectureGraphExportContract.test_caller_pinned_provenance_cannot_authorize_different_gate_code) ... ok
+test_classification_and_proof_review_text_cannot_manufacture_evidence (test_architecture_graph_export.ArchitectureGraphExportContract.test_classification_and_proof_review_text_cannot_manufacture_evidence) ... ok
+test_context_only_cycle_is_allowed_without_changing_gate_semantics (test_architecture_graph_export.ArchitectureGraphExportContract.test_context_only_cycle_is_allowed_without_changing_gate_semantics) ... ok
+test_default_trust_rejects_self_consistent_changed_graph_and_provenance (test_architecture_graph_export.ArchitectureGraphExportContract.test_default_trust_rejects_self_consistent_changed_graph_and_provenance) ... ok
+test_dimensions_describe_only_explicit_recorded_metadata (test_architecture_graph_export.ArchitectureGraphExportContract.test_dimensions_describe_only_explicit_recorded_metadata) ... ok
+test_duplicate_graph_json_keys_are_rejected_after_identity_validation (test_architecture_graph_export.ArchitectureGraphExportContract.test_duplicate_graph_json_keys_are_rejected_after_identity_validation) ... ok
+test_duplicate_provenance_json_keys_are_rejected_before_gate_import (test_architecture_graph_export.ArchitectureGraphExportContract.test_duplicate_provenance_json_keys_are_rejected_before_gate_import) ... ok
+test_exact_source_bound_hard_gate_validator_is_called (test_architecture_graph_export.ArchitectureGraphExportContract.test_exact_source_bound_hard_gate_validator_is_called) ... ok
+test_failed_export_preserves_an_earlier_valid_export (test_architecture_graph_export.ArchitectureGraphExportContract.test_failed_export_preserves_an_earlier_valid_export) ... ok
+test_gate_identity_is_checked_before_untrusted_gate_executes (test_architecture_graph_export.ArchitectureGraphExportContract.test_gate_identity_is_checked_before_untrusted_gate_executes) ... ok
+test_graph_identity_is_checked_before_gate_import (test_architecture_graph_export.ArchitectureGraphExportContract.test_graph_identity_is_checked_before_gate_import) ... ok
+test_missing_required_dependency_is_rejected_by_pinned_hard_gate (test_architecture_graph_export.ArchitectureGraphExportContract.test_missing_required_dependency_is_rejected_by_pinned_hard_gate) ... ok
+test_pinned_49_node_55_edge_export_is_deterministic_and_preserves_records (test_architecture_graph_export.ArchitectureGraphExportContract.test_pinned_49_node_55_edge_export_is_deterministic_and_preserves_records) ... ok
+test_required_dependency_cycle_is_rejected_by_pinned_hard_gate (test_architecture_graph_export.ArchitectureGraphExportContract.test_required_dependency_cycle_is_rejected_by_pinned_hard_gate) ... ok
+test_same_size_gate_change_is_rejected_by_sha_before_import (test_architecture_graph_export.ArchitectureGraphExportContract.test_same_size_gate_change_is_rejected_by_sha_before_import) ... ok
+test_source_byte_counts_are_validated_even_when_sha_matches (test_architecture_graph_export.ArchitectureGraphExportContract.test_source_byte_counts_are_validated_even_when_sha_matches) ... ok
+test_symlink_source_directory_is_rejected (test_architecture_graph_export.ArchitectureGraphExportContract.test_symlink_source_directory_is_rejected) ... ok
+test_symlink_source_files_are_rejected_before_gate_import (test_architecture_graph_export.ArchitectureGraphExportContract.test_symlink_source_files_are_rejected_before_gate_import) ... ok
+test_attempt_ten_and_other_native_repository_are_preserved (test_architecture_receipt.ArchitectureReceiptContract.test_attempt_ten_and_other_native_repository_are_preserved) ... ok
+test_changed_node_or_edge_is_refused_even_when_graph_source_pins_are_unchanged (test_architecture_receipt.ArchitectureReceiptContract.test_changed_node_or_edge_is_refused_even_when_graph_source_pins_are_unchanged) ... ok
+test_directory_or_fifo_member_is_refused_without_waiting_for_a_writer (test_architecture_receipt.ArchitectureReceiptContract.test_directory_or_fifo_member_is_refused_without_waiting_for_a_writer) ... ok
+test_duplicate_json_keys_are_refused_even_when_last_value_is_valid (test_architecture_receipt.ArchitectureReceiptContract.test_duplicate_json_keys_are_refused_even_when_last_value_is_valid) ... ok
+test_duplicate_test_identity_or_multiple_runs_are_refused (test_architecture_receipt.ArchitectureReceiptContract.test_duplicate_test_identity_or_multiple_runs_are_refused) ... ok
+test_each_expected_host_identity_argument_is_used_and_required (test_architecture_receipt.ArchitectureReceiptContract.test_each_expected_host_identity_argument_is_used_and_required) ... ok
+test_each_native_identity_file_must_match_current_host_arguments (test_architecture_receipt.ArchitectureReceiptContract.test_each_native_identity_file_must_match_current_host_arguments) ... ok
+test_each_required_sandbox_control_rejects_skipped_failed_or_error_status (test_architecture_receipt.ArchitectureReceiptContract.test_each_required_sandbox_control_rejects_skipped_failed_or_error_status) ... ok
+test_each_staged_member_is_required (test_architecture_receipt.ArchitectureReceiptContract.test_each_staged_member_is_required) ... ok
+test_each_staged_member_must_be_regular_and_cannot_be_a_symlink (test_architecture_receipt.ArchitectureReceiptContract.test_each_staged_member_must_be_regular_and_cannot_be_a_symlink) ... ok
+test_each_staged_member_over_16_mib_is_refused (test_architecture_receipt.ArchitectureReceiptContract.test_each_staged_member_over_16_mib_is_refused) ... ok
+test_empty_or_zero_discovered_test_logs_are_refused_in_each_mode (test_architecture_receipt.ArchitectureReceiptContract.test_empty_or_zero_discovered_test_logs_are_refused_in_each_mode) ... ok
+test_every_graph_source_pin_is_required_and_cannot_be_substituted (test_architecture_receipt.ArchitectureReceiptContract.test_every_graph_source_pin_is_required_and_cannot_be_substituted) ... ok
+test_every_required_identity_is_needed_even_when_53_other_tests_are_ok (test_architecture_receipt.ArchitectureReceiptContract.test_every_required_identity_is_needed_even_when_53_other_tests_are_ok) ...
\ No newline at end of file
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python.stdout b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python.stdout
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python-result.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python-result.json
new file mode 100644
index 000000000..c51fb23c1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python-result.json
@@ -0,0 +1,18 @@
+{
+ "argv": [
+ "python",
+ "-B",
+ "-m",
+ "unittest",
+ "discover",
+ "-s",
+ "tests",
+ "-v"
+ ],
+ "commit": "6fc021839072d8c34f41e18e77b0f618c53baa15",
+ "started": "2026-10-29T18:04:35.046601+00:00",
+ "finished": "2026-10-29T18:10:18.243879+00:00",
+ "seconds": 343.19728532800036,
+ "exit": 0,
+ "changed_sources": []
+}
\ No newline at end of file
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python-start.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python-start.json
new file mode 100644
index 000000000..ca3da8209
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python-start.json
@@ -0,0 +1,265 @@
+{
+ "argv": [
+ "python",
+ "-B",
+ "-m",
+ "unittest",
+ "discover",
+ "-s",
+ "tests",
+ "-v"
+ ],
+ "commit": "6fc021839072d8c34f41e18e77b0f618c53baa15",
+ "started": "2026-10-29T18:04:35.046601+00:00",
+ "source_sha256": {
+ "tests/browser-requirements.txt": "05b3a77f3aa648cdcee6c1dea416ac85754a9b3b417456ba451984d16d10738a",
+ "tests/casefold/test_source_isolation_casefold.py": "ee9149d49a566fe1c37ed1af0efbf7bf7cb6d686c5dc5ed5ebe2c16572acbd58",
+ "tests/fixtures/artifact_index_p2_trailing_suffix.json": "0a49c41eda400a2e71a20ad73a33877432e5adae784399d90a998de8d9a18bdc",
+ "tests/fixtures/atlas_formal_bridge_profiles/8228-manifest.json": "1a09020f0706abd506824f54fca76df9daa533749350b9ab6b818e0bbe9ed744",
+ "tests/fixtures/atlas_formal_bridge_profiles/README.md": "c208e0fb1e9ff5d9062826e63ff37ca79eac1cd0ddafa5e428787d6fbc0791cf",
+ "tests/fixtures/atlas_formal_bridge_profiles/a22f-README.md.txt": "137e7c7ed44d732042d803eb4a0ee75f9ddc6475950a2bb6226a7711a44be14b",
+ "tests/fixtures/atlas_formal_bridge_profiles/a22f-REVIEW_LANE.md.txt": "54d32104aa012e917ef40b73fa3a40228d023249b339cf30fe4bdb7dcbfed414",
+ "tests/fixtures/atlas_formal_bridge_profiles/a22f-manifest.json": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0",
+ "tests/fixtures/atlas_formal_build_3b39/README.md.txt": "54436dfd808547d9da9ce0a2ad64b0e5935bb755844fef99b298281c49044aaa",
+ "tests/fixtures/atlas_formal_build_3b39/REVIEW_LANE.md.txt": "887f56209471fc0194d601a4f8a0c82eb75852e1c97da0400c16d447669e6340",
+ "tests/fixtures/atlas_formal_build_3b39/formal_gate_check.py.txt": "21c355e02ac6e01337d10465a3105b34b93f832586ee60aa2430f662a90cd8b7",
+ "tests/fixtures/atlas_formal_build_3b39/manifest.json": "8dfcfe4e9296bca47eede517f37b546ea420ec6b51944b7c16164a906b40e090",
+ "tests/fixtures/atlas_formal_build_3b39/test_formal_gate.py.txt": "4286136d8b24eca9b26d1e7b12933bed5b0961809b362a60c3af7bf46e6ed4b6",
+ "tests/fixtures/atlas_formal_projection.json": "7b36e2376f4010444108e81f316293ef3b3834d767e0900f68d684c760af2db1",
+ "tests/fixtures/cumulative_transfer_source.txt": "83f653393dc6245980f6848e2bfc65ac9ad4c7d8304b028b88764356fd3825b6",
+ "tests/fixtures/current_inventory_acquisition_cases.json": "050ca99cbb4c7d71f6e739726314d2450d2819c794ea0e71acf177d4cac54b12",
+ "tests/fixtures/current_inventory_legacy_live_hashes.json": "5fa7cfdde633171b0f99e8180bfe266edbc1ef67a05d4c94d91d1f1ebaefa854",
+ "tests/fixtures/current_live_pre_resume_hashes.json": "2f929a24c4ffb5d1e9ea36559635f5801b2037029bbf226f6fd028aa57f0b221",
+ "tests/fixtures/current_site_publication/pre_r1_resume.json": "fe0f8b2c014334635d402dd32f6134d205b8b9ffd4f691b38f7b6949b4ef89ba",
+ "tests/fixtures/dependency_source_bindings.json": "a1c7378f66ee433faf680ed56cc45fd2ccac5754d545b192cdb50c2a83025a17",
+ "tests/fixtures/formal_scope_cc2989.md": "350732d7a501fd37d15632b13bd2ac30b8a6d87259b9a3b0931639041a1cfb84",
+ "tests/fixtures/museum_fixture.mjs": "5cab7aacc297e1d62d8fcb95de64435f42395a74cb9c6ef82bd6b6d288a34bc8",
+ "tests/fixtures/node_status/math-463-released.json": "69a4f8dd4a286bb3f637df6e61a39ce304a77c507f49388aa336f5e99f10f192",
+ "tests/fixtures/node_status_refresh/current_revs.json": "38b8f85d47486c8885ac6f32c340922d3110a24eebbd9128225f77dcbfc4578a",
+ "tests/fixtures/node_status_refresh/fresh.json": "e304ba99cd7792a8cbbfc915447c10728bca6a4935ac1664fe3686665ad49b1c",
+ "tests/fixtures/node_status_refresh/issue.json": "fe0b3371a28128c81a90c0accc384df17cda5169d3d0b97754f70dda853cf17a",
+ "tests/fixtures/node_status_refresh/stale.json": "65d7ab8f4b2af80f73e66ab64293792d3e7ab6a30c8181a355f60eeed73e8021",
+ "tests/fixtures/node_status_refresh/unknown.json": "d87ef78478948e710747a6e452dafdd82d5e56eae79355d3c4c286c26be62f29",
+ "tests/fixtures/persistent_status_legacy.json": "4f9b85023c5473a84c25169f1692af144456a9d9bb4470148b6ee5bfa4557d55",
+ "tests/fixtures/status_f2e432e.md": "039d4fea921a5e9602340ab8580404ef709588ca72f45c52f865f4644da51da3",
+ "tests/test_active_board_routing.py": "26c5cf756daddb5b442f4e8affa942346efe39f8a312709b0b2eba5e7005b47a",
+ "tests/test_architecture_artifact_index.py": "a403c84cd547a342876ac21b3ebd3eb456620d30c5eec0d79e7ccd509fd60b04",
+ "tests/test_architecture_binding.py": "523d03dffb84656fdeebd62c73a5f479ecc0b416ff3ec94d4881c8005fcacfcf",
+ "tests/test_architecture_claim_selection_transfer.py": "d36b8b17e2354c14b60b5d3c48580ea15cab3b152960bf62764553c70f655d2a",
+ "tests/test_architecture_cli_boundaries.py": "8b45b7d60f86d743cfbb8e3706a1d32d049a7fc557656f243bbbc5ebb97a578c",
+ "tests/test_architecture_evidence_adapter.py": "f95f99bd044981aa7928a7bcad25a4473420a8935e16b7e8ff6288b8354b1894",
+ "tests/test_architecture_evidence_path.py": "1038f3638b4e3772d7b96526d7721f8d4d6d772a70166ab80e9bc9f66b610a7e",
+ "tests/test_architecture_evidence_topology_diagnostic.py": "dac82c4827322fb887ebf887b815a51a69f5e7ba47c1357cb1457f5b70fb2387",
+ "tests/test_architecture_graph_artifact_readback.py": "dd3c5b3f2011ae3f7582514eae0fb79f25257d5bf54f40a99585d21dff65116e",
+ "tests/test_architecture_graph_export.py": "92cf35857d9c6418c5fd5d536d261c06b72bdd18dcea4d16cd0faf4fc8cacc1d",
+ "tests/test_architecture_receipt.py": "56b01ae5ae5faf37675ee84771d81cb81a13c2224658067d37220724013fc84a",
+ "tests/test_architecture_sandbox.py": "6f9281005cf62b2d061f3a0381fa6c1b79999dbb5813758ae1f4fd0f870fbe78",
+ "tests/test_architecture_side24_coefficient_binding.py": "ad151ccd1871acc1b073272625e2b962ce3a7ee04082676453911df83b8b4ab2",
+ "tests/test_architecture_site_graph_bundle.py": "80ac5d83af8204964de454f3df89933e6b21c2149ac44e3e61483e3118f1187f",
+ "tests/test_architecture_unittest_timing_probe.py": "70796eb7986308b4cb431b34d841e22ae474b58c1fdc393bd5f60c724ef7e1c3",
+ "tests/test_atlas_controls.mjs": "8539446ca52505a1dbb8edbd20217023367cbfd4709aea9b1f04c94c39a76f6f",
+ "tests/test_atlas_focus_geometry.py": "e87c54ac2c263c6bcfd6836023ac623fdab3ba52202e90c40dead7cbdb8141c6",
+ "tests/test_atlas_formal_evidence.mjs": "06d917654cfb99af48e6fb6de7a85ec20be2fbc21ffe8c1d3987ef0cdb8a2913",
+ "tests/test_atlas_formal_evidence_build.py": "67bd4e6a55d9e02a1108d73438777f36e4c2b7357a28a9b690bd4c909bbd1148",
+ "tests/test_atlas_formal_source_bridge.mjs": "31c6b6e66f15874eacdafbf23adb948473927401643196cdab2e92a05b1f60ed",
+ "tests/test_atlas_formal_source_bridge.py": "ac10c9e6bf7530ea877f18caf1bc1f32caab89445e0b6e5d2bffe401ff2c882b",
+ "tests/test_atlas_reader_experience.mjs": "7c6aa238a518109411b3e61d348f53e8536a03d2ef0fdbdc26b7cf19437eac89",
+ "tests/test_atlas_reader_scroll.py": "4a6bcbd588113a9fe0864e0a56cd8cc56f715b1b7ec5ded018d8860a600446b5",
+ "tests/test_atlas_relationships.mjs": "d711415a3a951cf6fad923ba944b744e0a76e39d4f21b62132f89394f054f8e1",
+ "tests/test_atlas_resilience.mjs": "741a954dbfb327c2e965a3fce226a02d17e1bf968366c62ed0b4a8510cc0b77c",
+ "tests/test_atlas_spatial.mjs": "b9b9af683bad0a5c894e5aa700d8edf85e891113026cdc6a58207df5ba1133a1",
+ "tests/test_atlas_spatial_labels.mjs": "06056d5bf6b88d700995905fa434aab054ae6c27fd910911cf8f994df3a4a92e",
+ "tests/test_board_links.py": "0fca44ed2dfdf77be1551094d7cb9e3f3713bc6cffb43bf86500c5c90e5b0f1e",
+ "tests/test_board_links_raw_json.py": "2ac670b1ae824d5e665560c983eecfa0392ec4d381d0ff80ed26b5318aba5520",
+ "tests/test_board_links_url_errors.py": "328e342e663d504c4b2ca1c7bba485ce02bcc6295e74592ada8e2fbb721703a3",
+ "tests/test_brand_identity.mjs": "f101c8a3c76c91ca4e67910cd754e676d2eefeae043f46219663937c92c09e0a",
+ "tests/test_catalog_query.mjs": "6bbd9481758d0d5b6741a7ed13ba3b7a04125108378b0c1b98a61e15aed07104",
+ "tests/test_cbz_audit.py": "347fb2ee14f6ac69e67604f22cd29995bf18724fe3f12d75b29faf61e728247b",
+ "tests/test_cbz_baseline.py": "fb0def6cced0b901bdbb9138a8402d273d267d5d2eaf8e35e32ca101b2e4d587",
+ "tests/test_cbz_lean_check.py": "8642d2bb63acf3d9ab56c89dad4132449f6b9b964431ca14ce9cf52ed3eac3d6",
+ "tests/test_cbz_refs.py": "87894edca7a54974ff53af31e8d3a696643633c148d591d410709b28881916de",
+ "tests/test_cbz_storage.py": "5efc1289a0d13e266cd1143b7f6b1946efb29a24deba718eb0170093f67b1295",
+ "tests/test_compare_categories.mjs": "68182d38f365d7ef98da6c8c1e6c677f16d0657e7e158df211e3e12b39b32ad0",
+ "tests/test_compare_source_panel.mjs": "4bca6e043b16ee10876aec19d29696a16e630ce57cffb5ca995e51abac32155d",
+ "tests/test_coordination_lock_check.py": "543371b0afb87d40d599a07f90120cf4a4cc787c81ddc50190c6a4c09d381687",
+ "tests/test_current_inventory_acquisition.mjs": "11166b8b5a778a1aebc87026a4e8c35d5c733db777e925dc979bbf89148658ac",
+ "tests/test_current_inventory_acquisition.py": "680378befe3c0cb264241f35a0222bdcb2dc8a541be17a7b6dc1e0e539ba0595",
+ "tests/test_current_observation_coherence.mjs": "017e70f834f5757e0766302226e077b7c4b92ba9b4ea321d2c01cc5176366b14",
+ "tests/test_current_site.mjs": "15e8e28428477c582239bd635943387edfe739d8860c488305e3611b59385150",
+ "tests/test_current_site_browser_contract.py": "ad16d1cbf37468409d8fbf3ae95e3511257dfd057f9ad771d21e91811409eecd",
+ "tests/test_current_site_build.py": "356819ec74e00fa78e2a4c788523556cce0bef4303dbd6be35f4b6fc6015aa51",
+ "tests/test_current_site_data.py": "abe09b871643bfd9e7ca0d7d8404f1670d14a64cff4fdbf1478ba4d9560285c0",
+ "tests/test_current_site_history.py": "11eaa3818c4e9930c933ce45915e74c39fb104b7d800b6c59b09f51f8a7a9e67",
+ "tests/test_current_site_native_base.py": "ff6d8a5e6eb1fc051ce9f3a57e28e3c654c186c3fdd77f193596ffc518b2787b",
+ "tests/test_current_site_native_registry.py": "32da9cfb1684817a69030a20e85356bf571697e7dfc7532c417839915364a9cc",
+ "tests/test_current_site_persistent_status.py": "2f7870085cb224d6458c81238f3de6dc91acff8c73ca4cfe9657affa134ffd1f",
+ "tests/test_current_site_publication.py": "60b4cec31a382dfc250ae3d29627e89ce6653ec27220fcb975509a054aabf2e8",
+ "tests/test_current_site_resume.mjs": "f3e4c8ddda311673e0d6fb8a6ac51b52a518351024d10d1d6542ea2476120aa7",
+ "tests/test_current_site_shell.mjs": "75fbc86730163b9dd98308aa6031c1601bd63dc75aa9c22660407f3789cf6fe2",
+ "tests/test_current_site_stylesheet_order.py": "34be490c59e5f66d76ba4813f23461c1feff00a76ac4bd3de7b9ad09eda2a7e4",
+ "tests/test_curvature_export.mjs": "d22b6b9239c1fd7ec36977e5f155653bc8718c73c723ddcb25c3e70acc6c0dd4",
+ "tests/test_d5_shrinking_witness.py": "af6936b60006b527b3b68ed9b695af923b166683f2a7c5921b651be7059021a1",
+ "tests/test_dependency_source_binding.py": "75edf94d9b6c45ce18523862b6e312cc44b72aca38f1e7eb6f32a9876626e73b",
+ "tests/test_dependency_viewer.mjs": "a15bcb32b05ebdd2ea6152166153d6c66584223a06f5e10a327a8036e553617a",
+ "tests/test_drive_id_scan.py": "5bd868e54c42a20b1bc7245ec4262be3c844d3e51807c15d16a0e2b86a22d4a5",
+ "tests/test_dropbox_reconcile.py": "62d80b88fcdad4c4dfef151f1551197648113db92a3d1d16be747b2855376c75",
+ "tests/test_evidence_path.py": "b75c262c2376bd5952c32354408ae8ed8370cf982788ed8f0a4b1839f72cf687",
+ "tests/test_exact_sample_shrinking_bin.py": "63e59fadac910846b8425975e67230a055992c2087c32a8cd2341e01948be3be",
+ "tests/test_explore_models.mjs": "9ff140148fbeb088c664f482a754661819c4f609f8180b2ad34df5f9a696a2d7",
+ "tests/test_figure_png.mjs": "c820936cbf60c31262bb1a24f1548e31a2e471b28ea78cdee58d8e4f1bb36baa",
+ "tests/test_formal_execution_context.py": "0751ca299c72a821c2130e66fb00cd9f6e79cb9fd5a9a4147b70bfdf99ddd353",
+ "tests/test_formal_gate.py": "2b13ad83b03d2b45f4be70ce03af597c195563a1ed0bd3983a2b7040068a3a84",
+ "tests/test_formal_workflow_shell.py": "3d29a169da19ab648b65c3939d244b211233ea705bd50b538e8d1953f0a88086",
+ "tests/test_graph_artifact_bindings_v2.py": "b0a48735ef7e0f5f45cf83e68c65deb0939eff6fb117c939a98282a715e1460f",
+ "tests/test_graph_binding_check.py": "e151abf4eae86384305d17ddba07d16e31b2dc062786054e975488a5e65e2828",
+ "tests/test_library_discovery.mjs": "faf20763f61489c28783da73d8b92374191f7c41f3cf88a241ca57adffc51366",
+ "tests/test_library_source_search.mjs": "980c6576281a799eb170056896050c265461d0913a02c4f4001fa7e9c381fc30",
+ "tests/test_living_project_validation.py": "71a1fcba1dd118d91326289cd788bca1c8a1fe673ffd267eab0790974ea73190",
+ "tests/test_measurement_model.mjs": "83c8b3d0a8e2e95f06a697fea846fa2088a41e81809c64fc3e201665757cd223",
+ "tests/test_museum_conditionals.mjs": "ec358beae99c477ad8f4272fd50813ef7d8874e13b9097e8ba9f15bac79c173f",
+ "tests/test_museum_conditionals_cli.mjs": "48310479d97a5b6c116d5a4a0f4bf925e1faf0e70da54775166ad2f1ed241634",
+ "tests/test_museum_conditionals_paths.mjs": "ad6416f09b22a6ee3c2fdf876939be385efac52f0a4d4124de1420464b547de0",
+ "tests/test_museum_conditionals_startup.mjs": "3b69f603a3128029caacc8bbc9af43e5898802124506887bdc887b1982d16d71",
+ "tests/test_museum_data.py": "0eff026523881a6818a103cdd1e23006a082a3545423c2fe4f19182d08d24da7",
+ "tests/test_museum_frontend.mjs": "1bc61e0202cc6c147bbdd1357d7075f239f8a1bacda405404de09ba138507c72",
+ "tests/test_museum_geometry.mjs": "cc5a9ee15b27ccb10f96f0a77f79238e03b67b42efbcb6aeebbc9dddff1a9da0",
+ "tests/test_museum_identity.mjs": "db894ec40b2c3d437aaa748110181ae8c9dc37636108deaccac87070b47c3728",
+ "tests/test_navigation.py": "2a0e8eb79cfbdcbcbbc3237545ebdbbe8c859b0f71cad0f8a8fc46062829e314",
+ "tests/test_navigation_discovery.py": "5bc38e6b23292e73d1a295c2d8f281f7215b88b87bf45c4ca6ff335e0f1d1422",
+ "tests/test_navigation_manifest.py": "bff5158f65c182c4a80519e8bf8824c18294e1d067bd1e9acad0d970d7078657",
+ "tests/test_navigation_workflow.py": "fac899b807edf049479dacd449736d861ccf363d9b914994646c5e80935d75db",
+ "tests/test_node_status_atlas.mjs": "1b4d0f5dcae7f1004056c76978f5282a96a157c08d7a629cd798f2fc0ed66e3d",
+ "tests/test_node_status_refresh.py": "dbca3e03dc714038fd2161eaf16e205ea810e1d45487d5e52c97bb8d6a6da8a5",
+ "tests/test_palette_export.mjs": "3c98a48d02bd269e872e0bd4188ad01f6e4bbcd110c94d30cfa65831420d4eda",
+ "tests/test_periodic_certificate_dependencies.py": "c820b3725940dd25abf7bb68a1f23da1f1f3c04bab4187f29924362b2821d645",
+ "tests/test_periodic_pilot_custody.py": "7b2960401d47e2a48385fca6e8311e2dad03df4e15d313fa561a009d16afdacf",
+ "tests/test_periodic_pilot_custody_oserror.py": "b69a4477064fe1d42a285df5674e9cd180fddc62294c3ef20e896458f1ec86dd",
+ "tests/test_pickup_fence.py": "d8771777c62f31868a46be269ecc7e5d3d822e6186e853c3c1acc1d83c49d362",
+ "tests/test_pin_export.mjs": "0df96caec47e26767d6639d270060d998454aaadf6d81789ca6e22dde0ff7801",
+ "tests/test_public_intake.py": "d4c28d0972de547b3f262659e863170b085aad3a170afc3cbd1a125e3d140152",
+ "tests/test_public_intake_artifact_identity_control.py": "51a7b8c70c1b06ebf092de3e32af53f8dd48d5efc5dd7480efd85e3064c431e0",
+ "tests/test_public_shop_app.mjs": "dcc2a3cb66a7877ca0fe941ae8a1e1a7058dcaf913fc25f3dacc726a5a5ef896",
+ "tests/test_public_shop_browser_contract.py": "c45fd974735bc9f2bba62c2d6c1afda1dbc1badf581c2d1b6284eba952f3d78c",
+ "tests/test_public_shop_check_identity_control.py": "e0434d4678f608958a27e33d3056c13602376050aa8a24d172b1ecd809935202",
+ "tests/test_public_shop_data.py": "f081685965bc34d542ae08311d11b3de5d6343e5554410d25cdcd15c8444c082",
+ "tests/test_public_shop_frontend.mjs": "98eeb82fea6d73f24ef9be15ce839feeb76608c4ce79e81a27df946d0d46fd4f",
+ "tests/test_public_vector_index.py": "237bf7b94d616f7686a1d161d45c079df84f75694bf5bda1a543c349e8bf1075",
+ "tests/test_pytest_bytecode_policy.py": "025e631470545010a9bb33e92a1e5f84c5313aa62c7c0e1ac71d980e595c3295",
+ "tests/test_reader_experience.mjs": "a135963b747399235afa9ae7ec53d6d0571e1353e7a6f577cdb9f85d7130e380",
+ "tests/test_reader_jump.mjs": "227a52ca9f4bc337b257ea867356fa10dc84582dfd1ffed7b335e1c5e99a4583",
+ "tests/test_reader_links.py": "66e66891a890defc616723bdc76dab7b6af3919a584054c9713eb519c53882ac",
+ "tests/test_reader_navigation.mjs": "f33a92bae9aa0d1ec5cbdfb703e42826f85a59c4350899ce78f877adfa6e764e",
+ "tests/test_reading_list_citation.mjs": "7bbdb892e8898d8da21401473d877e6c6175ca86267f7377c2fe33db7913723c",
+ "tests/test_release_snapshot.py": "ebe0243e35023f311e4229c15d99719f6b3141502b9f61a4f6478703a747c146",
+ "tests/test_required_formal_binding_control.py": "feddcf6679744431922e10d2de99a0edfaf090b86067847da095bb57db6c2df4",
+ "tests/test_required_formal_check.py": "37dece6d29d470f0c7ecda729e5fba61bd4808647976345ba108a02d6245ac5b",
+ "tests/test_research_delivery.py": "ea78adf62306716937bc654abaf3fd388145ba0058945be3ac81fb4073e1fc7f",
+ "tests/test_research_desk.mjs": "0c7e3d3ee64477b1c6b37514a7388fe0948a52726cfc19fbcd0cf79db2057fc5",
+ "tests/test_semantic_memory_benchmark.py": "945616152e9d50631890049fbe575cd67f925cc30257d2d60ee5d4542a6294d6",
+ "tests/test_site_asset_release.py": "e79d0e886c4201aa241d893a2a405938b7082a0753c26265e780e77b555cc5d0",
+ "tests/test_site_csp.py": "1d6caef1cb503538b41c48878601891b4e9f0774601fc1aa242d0bda0aac0b03",
+ "tests/test_site_graph_capture.py": "44eb872c01e510fddc8942c818b4f98aa0a305fc1c5109686c7d7ada9331964c",
+ "tests/test_site_graph_projection.py": "0c49edf48527532c8dfd91277a24fffabc51b6e3b2a17529b8e69cfb6a3a08a5",
+ "tests/test_snapshot_compare.mjs": "c88bee61162434ed34ce748aef65a2cb9737eeae42b1e0a06ddcc9ef5b28fbfb",
+ "tests/test_source_quote.mjs": "68c821e2f7698f06854166d5a73b1f647fc913c4fd9b514ffec8681868d1ebe3",
+ "tests/test_source_reference.mjs": "cfb3ab0624216c4d0422e0aae17d71b74e73cfd84dff3d9600d8037ea2518816",
+ "tests/test_st_contract_pilot.py": "193bd7099c964ba1870decb180e88fe4e0559bd6ce5e9ede6ff0bdede7642699",
+ "tests/test_teaching_export.mjs": "8317e834b7f1b5a640fffb89ae186a37f9669e7baada97fa458fb57f288f4eb0",
+ "tests/test_workspace_landing.py": "dfa26545041881fa0b995f2fd1de14cc3367597580e9145ead494c89cbc111d9",
+ "tests/test_workspace_navigation.mjs": "134bf1fbcb65353e489da2ce7ebfff62f1cc37996a9673bd806bc11c0baeb1bb",
+ "tools/CBZNonvacuity.lean": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f",
+ "tools/architecture_check_binding.py": "266e15903c0cd43e38b52d3f1d2fd52455f0f059dd6071ac246723cd84dc5010",
+ "tools/architecture_evidence_adapter.py": "ad759f3fcf9f877fb3a95d62d1306f2b743c4b5565578b7b046c5db1004e3996",
+ "tools/architecture_graph_artifact_readback.py": "88b3e2440a779017706b7ef7bf364cb58471c510e608c554936a6c69361acfb6",
+ "tools/architecture_run_receipt.py": "a4bb66325f64422398ff726bc1c448afb284498275e5894a7d1af6b25fba9890",
+ "tools/artifact_index_export.py": "2083bbe457cf2a4b85a2ecf74325bb1ff4118c07259ab7d760d7611cea3da966",
+ "tools/atlas_accessibility_audit.py": "e133b8c5a7df0b261d676cd3d686c92607b90a9305f92d0d0bbca4675e5e3bac",
+ "tools/atlas_accessibility_regression.py": "1d110123a301fb65cc90860cc3548aaa842dd41e27ea846b9ea02b2e51845a69",
+ "tools/atlas_accessible_list_browser_check.py": "56adadba47f85c0a7c83b103a914f9c19fe465ac027021f90e59b649911f47b2",
+ "tools/atlas_approachable_browser_check.py": "99f567499dcee942b11a627afeb7a02589a8c8a41d787453b46d19b725313103",
+ "tools/atlas_claim_summary_browser_check.py": "55b15ed1ccd16b5276afe8c1d23d1538da837f611621e70dfbcd1952d51ccbc1",
+ "tools/atlas_formal_evidence_browser_check.py": "4ce981b7b9c0d422f099fcd8556a144d01de8a6c18de9431a6a045fecce55af7",
+ "tools/atlas_formal_evidence_build.py": "dbc6c7fbc9114c719dac4426fe46479747ec5ecd1a8e5549a9b5a36a1e418635",
+ "tools/atlas_formal_source_bridge.py": "b37bf20034e685fefac770b6056b1a1fc2343e4b58922be9e83c1b4499c4a6a9",
+ "tools/atlas_live_controls_browser_check.py": "b7c318a19c79f3da06734723a0f65d831d0ee140bd07dc451e11c25c4193aeca",
+ "tools/atlas_refusal_browser_check.py": "639b9f4295273ff2c6fb5c0221dc1bd998804b84d38edb6f1efffa12c6fb6c28",
+ "tools/atlas_relationships_browser_check.py": "8a6a1c57fd5382a61b0cb11af1ed632bf6a1c71cc70098afe340c5607e4f5b87",
+ "tools/atlas_resilience_browser_check.py": "1c760214db84a1ec011be66f78d62f569ec191f15e0ccbb93b14f94651a8e972",
+ "tools/atlas_source_bridge_browser_check.py": "d6379bbea06a82c553193ab9a3705ad43cc95b9a21998609b7636dd51a1e04c5",
+ "tools/atlas_spatial_browser_check.py": "915b6f6bca3e81fb39ebf250363eee3daf4f2a8a76f41c2e90f2754b1dcea881",
+ "tools/atlas_spatial_labels_browser_check.py": "97d13995e52e584b06ffa2cd842661a4326fd32612610e3a7a3004a3e76d612e",
+ "tools/atlas_webgl_fallback_browser_check.py": "7abd99767a6acb456c29be3e92210d13a2ce2d507c344639a304fba9a9055959",
+ "tools/cbz_audit.py": "d18f74984b6a5d4c2834119b9ee804d6e71942f306a7801035acdb04f66a7d47",
+ "tools/cbz_baseline.py": "095c6e9eb5adb7174720e9c5ad5194ba62b413d37b5d43e6d49bc04b0b592b46",
+ "tools/cbz_lean_check.py": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d",
+ "tools/cbz_refs.py": "f26c6f8f13aac2b967a8c03cf4ca9643a875a93ebd0855a732576e8fdceaca85",
+ "tools/cbz_storage.py": "c829d392e00601d7876a2530a8bff02b7f913cff7bed2dec29df69d796b4ff9a",
+ "tools/check_board_links.py": "ac06814542cba062bd59d9b552cb11da88dc7b8801ba4c3bd8deca12adf27f33",
+ "tools/claim_selection_transfer.py": "0ab937d571d2127f910fcb3fac2b12265f1b4e1ab5a040c0ed21dfd48559c745",
+ "tools/compare_experience_browser_check.py": "962713a9786e624b13a1e3588dae19570ab21679f4e3a25224a515836f38d80c",
+ "tools/coordination_lock_check.py": "f4eb848846de62abc8a5cb06ea327b6eaf0e2b4c410d100fb842530f43d5f4f1",
+ "tools/current_inventory_acquisition.py": "21772aefe0d0cdf0150619ab148450dc63aafdc85e8bcc651d24a86a476b8640",
+ "tools/current_site_browser_check.py": "37eef561d73d9494773b5e200e7ad65b4b1885e09528a7e1fe5144fda214873b",
+ "tools/current_site_build.py": "2a963a61d01db3fbb96979860e9c4af9f4b79140d00b73cc1b0d8a18b4a2d3eb",
+ "tools/current_site_data.py": "3a42f2be7ae51d6196449766283b711203133b59b97c0ad14f08fecadc733a96",
+ "tools/current_site_history.py": "40e911492527635a9428858b2242a947321e75c940f9da957e291ce030e60f49",
+ "tools/current_site_native_registry.py": "98f71d14fa4a9beb5f6f49fd8976a14887bcc9a00f6608cac880469466aa3fdc",
+ "tools/current_site_publication.py": "16a7d9a5ffd9f33a0d68afcb391dfebb82a1188bfba486ce6cb93898412ca1a7",
+ "tools/dependency_source_bindings.py": "6e1231544d12a2193b5e4d103628ac5a12c4ba5a8cb9188e9cd0ed20e885a98e",
+ "tools/dropbox_reconcile.py": "19c96b15f96eaeaddb2e90222fb58a8b7b97808653ce146a7457bb8d5cc7732d",
+ "tools/evidence_path.py": "e93db0c283c5778d4b95efabc5574d2a5c6cac0451dab67742d67a94b7d8ea00",
+ "tools/evidence_topology_diagnostic.py": "5b54faf2e076c0ee5674ee298b4c3ec8cdaaf60f2edf25267026fb2b11ae52fa",
+ "tools/excerpt_source_save_browser_check.py": "e611cec3edc6b468d30650b671ab08b3437b590a2f52b816e9eb00e6c34aa127",
+ "tools/figure_png_browser_check.py": "67105c43d0d095d5e870c228019bc09ca351c884fde0716125735b955d0e2b8a",
+ "tools/formal_execution_context.py": "0f81c1b07e850d27ac53f2610f127896fcab314043d37f023502d2d53bd53db2",
+ "tools/formal_gate_check.py": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5",
+ "tools/graph_binding_check.py": "2fc0b3d374492ba58e153ba8a1337ca8193167549cdcdb322df6e003c26c2c82",
+ "tools/hypergraph/README.md": "6f0048c948d26a7f6f764f4f1391a85be86e737293f8a820a8afc3f427b88f37",
+ "tools/hypergraph/inputs.json": "347ffc8a1a83049c2d5776690b393d491ad0e1e4fdb99804ec7db7211e8cfb6d",
+ "tools/hypergraph/math_hypergraph.py": "9614af35bedffbe7263c96d66ffdca92dcff3a57fcbc3d5127fa7ce685f1c8b8",
+ "tools/hypergraph/requirements.txt": "346f933759899c53e91134ecb154b36331079f220a49b708c4fdb5ef83eb5080",
+ "tools/hypergraph/test_artifacts.py": "651d9ab9945d257159a661f2e4f22f77c9c8693fc09213ee345460328c5f4403",
+ "tools/hypergraph/test_math_hypergraph.py": "69b553b5f3513179f9736d103522a0b7b2c655aac1fce72f499f3b0312f0d1c7",
+ "tools/library_discovery_browser_check.py": "a424629d30a7f0a14635ca38f6f89493cd627023b30947348c5e4f4f81dd222c",
+ "tools/library_source_search_browser_check.py": "49885136b7128ba3542bf32bc173b9a007309ea2e4d703371d92cc336d49275e",
+ "tools/museum_check.py": "ddc08fd1813471c1f951c28b89acdc41c7936b111aef1632a2dc2691f0329dc5",
+ "tools/museum_conditionals.mjs": "33148dfec91a5e3ef493716700bb7f6bf6bf7e73e2d4a643c4954a09e45f4623",
+ "tools/museum_data.py": "720c9a3e0397fc75a941681d68c2b47348837f04d194ca255c80325a1139381d",
+ "tools/navigation_check.py": "f8f8264d7c3e5da94d7e4a5cfb0a9ea07b299f039a049dd9e0eff60d96721648",
+ "tools/node_status_refresh.py": "30a0a87852e46c679de2528ff029ae14834b75b6d49d18cdfc3893b8d7f01f29",
+ "tools/periodic_pilot_custody.py": "84424de638c4d70975d9806596aa12515184035adb1473d554c3d0260d119472",
+ "tools/persistent_status_browser_check.py": "c7916ef456fd5ff37d9e367f4e6b5cccc9987e05be8c1c66e463a103bf4815c7",
+ "tools/privacy/drive_id_scan.py": "70806c7df83c156a5a47466016328bef5e9c218e4ed1344ecc0a68d7295fc06a",
+ "tools/proof_graph_export.py": "e5970975d23ca62acfe9f27d47c5b74e39366d8107a98affab2d989e89b320e6",
+ "tools/public_intake_check.py": "528465b1dca63cd52ae0c76ebe844cdaaaf0dfb67c9ea8665c2343385492c9df",
+ "tools/public_shop_browser_check.py": "d9255d25d4f96c62c53f42c41ae31ec023267fa0e64891776fa0c7a1677477c7",
+ "tools/public_shop_check.py": "89eff715667672ed1c97e47786c6df3fcf5a9c347ac2460486ab8ff32eddf15b",
+ "tools/public_shop_data.py": "e37d2949b6731a622d4c1b52da105d086abf3264bbcc213dbde596ef6d4eac5e",
+ "tools/public_vector_index.py": "408fdc99b2a262b521d53e0dce967acaceb0edf20f5555b42b13d4faa29cf5c5",
+ "tools/reader_jump_browser_check.py": "7c430e27c07c02e7e067192a23ea00be28b82dd6bcd443c7c631966b32064ebd",
+ "tools/reading_list_citation_browser_check.py": "a34c2dd4c9823bae717f29e5fcea636f8610316dd3bb3e0cc137fe2425cb36ea",
+ "tools/release_snapshot.py": "3799f749f4d0003ace889ede22285a11cb4f270b369fd122d1f6ced182e2a11c",
+ "tools/required_formal_check.py": "8eeb96bfa7471fb56747919fa2dfcba395182af737523cb1cf7091da28b1ebde",
+ "tools/research_delivery.py": "88d6e30182ae682d27f4d156f6c935f8373168ca6ff14d3141cd69c4b036d3a3",
+ "tools/research_desk_browser_check.py": "c2c22f0357b3e3dab65bac784b4289dad9d94c23a800f6412cb16310b7b0451e",
+ "tools/research_desk_continuity_browser_check.py": "f76679193dd4035476aa4b35afeebd05d9c12d4d8cc28ce7f3332dda981e099b",
+ "tools/research_desk_undo_browser_check.py": "09a298f133bfccd0a746b0ea9bb34bbf7bd8986f7baa07b946d401b0578e9a5f",
+ "tools/research_reading_browser_check.py": "1fdb1a9804460dfb1153be7abc777b573976f8c43a484479f379aaa6860914f1",
+ "tools/semantic_memory_experiment.py": "dbc5990ca0a7e2c6e50b1dbcfd2b761c843ef9097260795840ab8094b939696a",
+ "tools/site_asset_release.py": "390ea41ad0b4426913757c186e341dfcc1d1abcdafce505f51607a3dd31c0ffd",
+ "tools/site_graph_capture.py": "5353d5cc1e507f4dd8ef37a27ea1a1f0fa54ce9f90adac71c5462ab7001d2bc4",
+ "tools/snapshot_compare_browser_check.py": "b8b4e1c49368f8ae68862d4515b7805e7219d846193b7bfc6d4c6183e7e9cdc4",
+ "tools/source_census_20260927/EMBEDDED_RECOVERY.md": "c9f3332c5076b9bdc1fe5df06e45404544d57bb4723aa8c35cda529c5285c1dd",
+ "tools/source_census_20260927/README.md": "0dc40a4211223bdecd2cc4e23863918bc52dd49e33be28ac27c6550b93648610",
+ "tools/source_census_20260927/source_census.py": "ec53f0f15176d0e436e8d0a90ef323f20696d50567c1d42adf91304a693ea63e",
+ "tools/source_census_20260927/test_source_census.py": "6800939d8dcce2693ecfc9a77f5b35128535dee7c50895cc1d34e602311ed44a",
+ "tools/source_census_20260927/test_unpack_sources.py": "a7f0a8ddc5bb74c541c60052e7fa4d84e8c1ef646430a9a6af505655beca6e6a",
+ "tools/source_census_20260927/test_workflow_nonzero_discovery.py": "6fc5da2310a05e72b675a657e6d41d4f336ae8fe293a7d13b3c3bcee07c6af90",
+ "tools/source_census_20260927/unpack_sources.py": "60bddb2540a436d2467377b8dc2bf924ecfe1aeab098a81723cc3e8bcbc07b9f",
+ "tools/source_list_continuity_browser_check.py": "54cc653827ffdb48b1779b6f846046c1944c7c89678b6c06a3fcdb823cb4b0ea",
+ "tools/unittest_timing_probe.py": "094208b302059810971f4ed42bf687b814bbfd93a3c5ac871deab3075d475a26",
+ "tools/validate_node_status.py": "9ccadda867e00617b42177e8aee067c64bd6e52fbc79ec8fddc82653dfbc6375",
+ "tools/website_navigation_browser_check.py": "b188864d10bcc2f1b4ec82d86e50d30186e4114d1f8a06d62e27d6165f668cf4",
+ "tools/workspace_landing_check.py": "b46f1a6a9eae000877be80cb96727eb81a4a0c116162030f066ea799505077fa"
+ }
+}
\ No newline at end of file
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python.stderr b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python.stderr
new file mode 100644
index 000000000..a59b665fe
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python.stderr
@@ -0,0 +1,1697 @@
+test_research_index_matches_agent_entry (test_active_board_routing.RepositoryRoutingTests.test_research_index_matches_agent_entry) ... ok
+test_all_active_links_are_checked (test_active_board_routing.RoutingContractTests.test_all_active_links_are_checked) ... ok
+test_canonical_label_is_case_insensitive (test_active_board_routing.RoutingContractTests.test_canonical_label_is_case_insensitive) ... ok
+test_canonical_label_target_mismatch_is_refused (test_active_board_routing.RoutingContractTests.test_canonical_label_target_mismatch_is_refused) ... ok
+test_canonical_link_must_exist_and_be_unique (test_active_board_routing.RoutingContractTests.test_canonical_link_must_exist_and_be_unique) ... ok
+test_case_and_whitespace_normalization (test_active_board_routing.RoutingContractTests.test_case_and_whitespace_normalization) ... ok
+test_every_stale_active_link_is_reported (test_active_board_routing.RoutingContractTests.test_every_stale_active_link_is_reported) ... ok
+test_fence_closes_only_with_same_character (test_active_board_routing.RoutingContractTests.test_fence_closes_only_with_same_character) ... ok
+test_fence_with_info_string_does_not_close (test_active_board_routing.RoutingContractTests.test_fence_with_info_string_does_not_close) ... ok
+test_fenced_canonical_example_does_not_add_ambiguity (test_active_board_routing.RoutingContractTests.test_fenced_canonical_example_does_not_add_ambiguity) ... ok
+test_fenced_examples_are_ignored (test_active_board_routing.RoutingContractTests.test_fenced_examples_are_ignored) ... ok
+test_four_space_indent_is_not_a_fence (test_active_board_routing.RoutingContractTests.test_four_space_indent_is_not_a_fence) ... ok
+test_future_rollover_needs_no_hardcoded_board_update (test_active_board_routing.RoutingContractTests.test_future_rollover_needs_no_hardcoded_board_update) ... ok
+test_historical_links_and_comment_anchors_remain_allowed (test_active_board_routing.RoutingContractTests.test_historical_links_and_comment_anchors_remain_allowed) ... ok
+test_image_is_not_an_active_navigation_link (test_active_board_routing.RoutingContractTests.test_image_is_not_an_active_navigation_link) ... ok
+test_label_and_target_are_both_checked (test_active_board_routing.RoutingContractTests.test_label_and_target_are_both_checked) ... ok
+test_matching_active_and_current (test_active_board_routing.RoutingContractTests.test_matching_active_and_current) ... ok
+test_missing_active_label_is_not_vacuous_success (test_active_board_routing.RoutingContractTests.test_missing_active_label_is_not_vacuous_success) ... ok
+test_only_exact_active_labels_qualify (test_active_board_routing.RoutingContractTests.test_only_exact_active_labels_qualify) ... ok
+test_only_exact_canonical_labels_qualify (test_active_board_routing.RoutingContractTests.test_only_exact_canonical_labels_qualify) ... ok
+test_shorter_or_different_fence_does_not_close_example (test_active_board_routing.RoutingContractTests.test_shorter_or_different_fence_does_not_close_example) ... ok
+test_stale_active_board_is_detected (test_active_board_routing.RoutingContractTests.test_stale_active_board_is_detected) ... ok
+test_wrong_destination_variants_are_refused (test_active_board_routing.RoutingContractTests.test_wrong_destination_variants_are_refused) ... ok
+test_all_49_explicit_graph_nodes_remain_unmapped_without_a_binding (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_all_49_explicit_graph_nodes_remain_unmapped_without_a_binding) ... ok
+test_all_cli_flags_are_required_once_and_only_full_names_are_accepted (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_all_cli_flags_are_required_once_and_only_full_names_are_accepted) ... ok
+test_all_formatted_cells_are_strings_including_private_and_unselected_cells (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_all_formatted_cells_are_strings_including_private_and_unselected_cells) ... ok
+test_artifact_ids_are_globally_unique_and_valid_even_on_unselected_native_rows (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_artifact_ids_are_globally_unique_and_valid_even_on_unselected_native_rows) ... ok
+test_base64_is_strict_canonical_and_not_merely_decodable_to_the_expected_bytes (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_base64_is_strict_canonical_and_not_merely_decodable_to_the_expected_bytes) ... ok
+test_binding_roles_are_nonempty_unique_strings_from_the_exact_six_role_set (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_binding_roles_are_nonempty_unique_strings_from_the_exact_six_role_set) ... ok
+test_capture_identity_timestamp_and_declared_source_are_strictly_typed (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_capture_identity_timestamp_and_declared_source_are_strictly_typed) ... ok
+test_changed_input_components_cannot_replace_independently_supplied_pins (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_changed_input_components_cannot_replace_independently_supplied_pins) ... ok
+test_collection_limits_accept_4096_and_refuse_4097_without_duplicate_shortcuts (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_collection_limits_accept_4096_and_refuse_4097_without_duplicate_shortcuts) ... ok
+test_decoded_capture_limit_is_4_mib_of_original_bytes_not_base64_length (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_decoded_capture_limit_is_4_mib_of_original_bytes_not_base64_length) ... ok
+test_default_zero_offsets_and_unknown_native_annotations_are_private_and_inert (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_default_zero_offsets_and_unknown_native_annotations_are_private_and_inert) ... ok
+test_duplicate_keys_refuse_in_packet_wrappers_and_native_private_annotations (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_duplicate_keys_refuse_in_packet_wrappers_and_native_private_annotations) ... ok
+test_each_of_the_five_independent_expected_pins_must_match (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_each_of_the_five_independent_expected_pins_must_match) ... ok
+test_exact_header_order_names_types_and_single_header_are_required (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_exact_header_order_names_types_and_single_header_are_required) ... ok
+test_exact_public_projection_is_stable_and_retains_original_row_positions (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_exact_public_projection_is_stable_and_retains_original_row_positions) ... ok
+test_explicit_six_roles_and_bindings_sort_without_inferred_acceptance (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_explicit_six_roles_and_bindings_sort_without_inferred_acceptance) ... ok
+test_forged_column_policies_cannot_publish_source_notes_priority_or_topics (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_forged_column_policies_cannot_publish_source_notes_priority_or_topics) ... ok
+test_formatted_cell_limit_counts_utf8_bytes_in_public_private_and_unselected_rows (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_formatted_cell_limit_counts_utf8_bytes_in_public_private_and_unselected_rows) ... ok
+test_graph_ids_and_bindings_require_explicit_known_unique_identities (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_graph_ids_and_bindings_require_explicit_known_unique_identities) ... ok
+test_grid_dimensions_are_exact_integers_and_bound_all_declared_blocks (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_grid_dimensions_are_exact_integers_and_bound_all_declared_blocks) ... ok
+test_invalid_cli_digests_and_private_argument_values_are_never_echoed (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_invalid_cli_digests_and_private_argument_values_are_never_echoed) ... ok
+test_json_nesting_is_bounded_in_unknown_native_annotations_without_schema_masking (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_json_nesting_is_bounded_in_unknown_native_annotations_without_schema_masking) ... ok
+test_malformed_utf8_json_and_multiple_documents_refuse_at_both_input_layers (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_malformed_utf8_json_and_multiple_documents_refuse_at_both_input_layers) ... ok
+test_native_offsets_match_range_positions_and_refuse_boolean_float_or_missing_nonzero (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_native_offsets_match_range_positions_and_refuse_boolean_float_or_missing_nonzero) ... ok
+test_native_sheet_block_row_and_cell_shapes_and_cardinalities_are_enforced (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_native_sheet_block_row_and_cell_shapes_and_cardinalities_are_enforced) ... ok
+test_native_spreadsheet_worksheet_and_title_must_match_declared_metadata (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_native_spreadsheet_worksheet_and_title_must_match_declared_metadata) ... ok
+test_nonfinite_numbers_and_numeric_overflow_refuse_even_in_unknown_native_annotations (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_nonfinite_numbers_and_numeric_overflow_refuse_even_in_unknown_native_annotations) ... ok
+test_nonheader_rows_may_omit_only_trailing_private_source_and_notes_cells (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_nonheader_rows_may_omit_only_trailing_private_source_and_notes_cells) ... ok
+test_nonheader_rows_outside_ten_to_twelve_cells_and_short_headers_refuse (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_nonheader_rows_outside_ten_to_twelve_cells_and_short_headers_refuse) ... ok
+test_p2_synthetic_trailing_suffix_fixture_projects_with_its_independent_pins (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_p2_synthetic_trailing_suffix_fixture_projects_with_its_independent_pins) ... ok
+test_packet_wrappers_are_closed_and_schema_versions_have_exact_integer_types (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_packet_wrappers_are_closed_and_schema_versions_have_exact_integer_types) ... ok
+test_policy_array_order_is_pinned_even_when_public_rows_have_the_same_order (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_policy_array_order_is_pinned_even_when_public_rows_have_the_same_order) ... ok
+test_policy_ids_are_nonempty_unique_valid_and_present_in_native_rows (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_policy_ids_are_nonempty_unique_valid_and_present_in_native_rows) ... ok
+test_public_unicode_empty_cells_and_historical_scope_are_preserved_without_promotion (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_public_unicode_empty_cells_and_historical_scope_are_preserved_without_promotion) ... ok
+test_ranges_require_exact_title_a_to_l_syntax_order_and_nonoverlap (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_ranges_require_exact_title_a_to_l_syntax_order_and_nonoverlap) ... ok
+test_stdin_limit_is_16_mib_of_bytes_including_legal_json_whitespace (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_stdin_limit_is_16_mib_of_bytes_including_legal_json_whitespace) ... ok
+test_urls_paths_and_code_are_inert_data_without_fetch_execution_or_filesystem_writes (test_architecture_artifact_index.ArtifactIndexProjectionContractTests.test_urls_paths_and_code_are_inert_data_without_fetch_execution_or_filesystem_writes) ... ok
+test_artifact_id_requires_positive_ascii_decimal_without_leading_zero (test_architecture_binding.ArchitectureBindingContract.test_artifact_id_requires_positive_ascii_decimal_without_leading_zero) ... ok
+test_artifact_name_is_exactly_bound_to_current_run_and_attempt (test_architecture_binding.ArchitectureBindingContract.test_artifact_name_is_exactly_bound_to_current_run_and_attempt) ... ok
+test_attempt_ten_is_a_positive_decimal_not_a_single_digit (test_architecture_binding.ArchitectureBindingContract.test_attempt_ten_is_a_positive_decimal_not_a_single_digit) ... ok
+test_commit_format_cannot_be_authorized_by_an_equally_invalid_native_commit (test_architecture_binding.ArchitectureBindingContract.test_commit_format_cannot_be_authorized_by_an_equally_invalid_native_commit) ... ok
+test_deeply_nested_json_is_refused_without_a_success_envelope (test_architecture_binding.ArchitectureBindingContract.test_deeply_nested_json_is_refused_without_a_success_envelope) ... ok
+test_duplicate_top_level_keys_are_refused_even_when_last_value_is_valid (test_architecture_binding.ArchitectureBindingContract.test_duplicate_top_level_keys_are_refused_even_when_last_value_is_valid) ... ok
+test_each_current_native_argument_is_used_for_identity_binding (test_architecture_binding.ArchitectureBindingContract.test_each_current_native_argument_is_used_for_identity_binding) ... ok
+test_each_duplicate_output_key_is_refused_even_when_last_value_is_valid (test_architecture_binding.ArchitectureBindingContract.test_each_duplicate_output_key_is_refused_even_when_last_value_is_valid) ... ok
+test_each_expected_native_identity_argument_is_required (test_architecture_binding.ArchitectureBindingContract.test_each_expected_native_identity_argument_is_required) ... ok
+test_each_non_success_result_is_refused (test_architecture_binding.ArchitectureBindingContract.test_each_non_success_result_is_refused) ... ok
+test_each_of_the_eight_outputs_is_required (test_architecture_binding.ArchitectureBindingContract.test_each_of_the_eight_outputs_is_required) ... ok
+test_each_output_rejects_an_empty_string (test_architecture_binding.ArchitectureBindingContract.test_each_output_rejects_an_empty_string) ... ok
+test_each_output_rejects_non_string_identities_without_coercion (test_architecture_binding.ArchitectureBindingContract.test_each_output_rejects_non_string_identities_without_coercion) ... ok
+test_each_top_level_field_is_required (test_architecture_binding.ArchitectureBindingContract.test_each_top_level_field_is_required) ... ok
+test_extra_output_fields_are_refused (test_architecture_binding.ArchitectureBindingContract.test_extra_output_fields_are_refused) ... ok
+test_extra_top_level_fields_are_refused (test_architecture_binding.ArchitectureBindingContract.test_extra_top_level_fields_are_refused) ... ok
+test_invalid_or_multiple_json_documents_are_refused (test_architecture_binding.ArchitectureBindingContract.test_invalid_or_multiple_json_documents_are_refused) ... ok
+test_non_finite_json_numbers_are_refused (test_architecture_binding.ArchitectureBindingContract.test_non_finite_json_numbers_are_refused) ... ok
+test_non_object_top_level_values_are_refused (test_architecture_binding.ArchitectureBindingContract.test_non_object_top_level_values_are_refused) ... ok
+test_other_valid_native_identities_are_accepted_and_preserved (test_architecture_binding.ArchitectureBindingContract.test_other_valid_native_identities_are_accepted_and_preserved) ... ok
+test_outputs_must_be_an_object (test_architecture_binding.ArchitectureBindingContract.test_outputs_must_be_an_object) ... ok
+test_receipt_and_artifact_sha256_require_lowercase_64_hex_digits (test_architecture_binding.ArchitectureBindingContract.test_receipt_and_artifact_sha256_require_lowercase_64_hex_digits) ... ok
+test_repository_substitution_and_case_drift_are_refused (test_architecture_binding.ArchitectureBindingContract.test_repository_substitution_and_case_drift_are_refused) ... ok
+test_run_and_attempt_decimal_format_cannot_be_authorized_by_invalid_native_args (test_architecture_binding.ArchitectureBindingContract.test_run_and_attempt_decimal_format_cannot_be_authorized_by_invalid_native_args) ... ok
+test_stale_attempt_is_refused_even_with_a_matching_stale_artifact_name (test_architecture_binding.ArchitectureBindingContract.test_stale_attempt_is_refused_even_with_a_matching_stale_artifact_name) ... ok
+test_stale_checked_commit_is_refused (test_architecture_binding.ArchitectureBindingContract.test_stale_checked_commit_is_refused) ... ok
+test_stale_run_is_refused_even_with_a_matching_stale_artifact_name (test_architecture_binding.ArchitectureBindingContract.test_stale_run_is_refused_even_with_a_matching_stale_artifact_name) ... ok
+test_valid_current_run_has_exact_stable_non_scientific_output (test_architecture_binding.ArchitectureBindingContract.test_valid_current_run_has_exact_stable_non_scientific_output) ... ok
+test_valid_json_at_exact_stdin_byte_limit_is_accepted (test_architecture_binding.ArchitectureBindingContract.test_valid_json_at_exact_stdin_byte_limit_is_accepted) ... ok
+test_valid_json_over_stdin_byte_limit_is_refused (test_architecture_binding.ArchitectureBindingContract.test_valid_json_over_stdin_byte_limit_is_refused) ... ok
+test_cli_refusal_opaque_and_no_stdout (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_cli_refusal_opaque_and_no_stdout) ... ok
+test_cli_success_is_deterministic_and_nonadmitting (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_cli_success_is_deterministic_and_nonadmitting) ... ok
+test_conditional_mean_requires_explicit_premise (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_conditional_mean_requires_explicit_premise) ... ok
+test_duplicate_json_keys_and_scientific_claim_injection_refuse (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_duplicate_json_keys_and_scientific_claim_injection_refuse) ... ok
+test_event_probability_alone_does_not_control_expected_count (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_event_probability_alone_does_not_control_expected_count) ... ok
+test_event_scope_mismatch_refuses (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_event_scope_mismatch_refuses) ... ok
+test_finite_moment_cannot_satisfy_cubic_goal_without_more (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_finite_moment_cannot_satisfy_cubic_goal_without_more) ... ok
+test_float_and_boolean_moment_orders_refuse (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_float_and_boolean_moment_orders_refuse) ... ok
+test_holder_growing_moment_has_beta_penalty (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_holder_growing_moment_has_beta_penalty) ... ok
+test_holder_inequality_comparison_only (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_holder_inequality_comparison_only) ... ok
+test_holder_p2_is_three_halves_not_three (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_holder_p2_is_three_halves_not_three) ... ok
+test_holder_p4_is_nine_quarters (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_holder_p4_is_nine_quarters) ... ok
+test_invalid_identity_value_refuses (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_invalid_identity_value_refuses) ... ok
+test_json_float_constant_and_length_refuse (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_json_float_constant_and_length_refuse) ... ok
+test_nonexact_or_out_of_scope_exponents_refuse (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_nonexact_or_out_of_scope_exponents_refuse) ... ok
+test_rare_count_exact_counterexample (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_rare_count_exact_counterexample) ... ok
+test_scope_dimensions_reject_cross_population (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_scope_dimensions_reject_cross_population) ... ok
+test_source_pins_are_fixed_but_not_implicitly_verified (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_source_pins_are_fixed_but_not_implicitly_verified) ... ok
+test_unconditional_count_not_supported (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_unconditional_count_not_supported) ... ok
+test_unknown_key_and_extra_count_premise_refuse (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_unknown_key_and_extra_count_premise_refuse) ... ok
+test_wrong_source_rate_refuses (test_architecture_claim_selection_transfer.ClaimSelectionEngineering.test_wrong_source_rate_refuses) ... ok
+test_artifact_index_broken_stdout_has_one_opaque_refusal_and_exit_one (test_architecture_cli_boundaries.ArchitectureCliBoundaryContract.test_artifact_index_broken_stdout_has_one_opaque_refusal_and_exit_one) ... ok
+test_artifact_index_symlink_cannot_read_synthetic_private_input (test_architecture_cli_boundaries.ArchitectureCliBoundaryContract.test_artifact_index_symlink_cannot_read_synthetic_private_input) ... ok
+test_graph_readback_broken_stdout_has_one_opaque_refusal_and_exit_one (test_architecture_cli_boundaries.ArchitectureCliBoundaryContract.test_graph_readback_broken_stdout_has_one_opaque_refusal_and_exit_one) ... ok
+test_graph_readback_symlink_cannot_read_synthetic_private_input (test_architecture_cli_boundaries.ArchitectureCliBoundaryContract.test_graph_readback_symlink_cannot_read_synthetic_private_input) ... ok
+test_actual_proof_byte_change_preserves_old_join_loss_and_fresh_origin_recovery (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_actual_proof_byte_change_preserves_old_join_loss_and_fresh_origin_recovery) ... ok
+test_affected_alignment_references_deduplicate_full_original_identity (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_affected_alignment_references_deduplicate_full_original_identity) ... ok
+test_alignment_partial_coverage_stale_scope_or_lineage_remains_original_stale_record (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_alignment_partial_coverage_stale_scope_or_lineage_remains_original_stale_record) ... ok
+test_all_expected_context_flags_are_required_unique_and_syntax_checked (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_all_expected_context_flags_are_required_unique_and_syntax_checked) ... ok
+test_binding_context_digest_covers_graph_sources_slices_every_null_row_and_domain (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_binding_context_digest_covers_graph_sources_slices_every_null_row_and_domain) ... ok
+test_binding_review_successor_does_not_clear_unreplaced_group_or_failed_main_join (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_binding_review_successor_does_not_clear_unreplaced_group_or_failed_main_join) ... ok
+test_canonical_record_numeric_types_are_changes_even_when_python_equality_agrees (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_canonical_record_numeric_types_are_changes_even_when_python_equality_agrees) ... ok
+test_captured_code_and_paths_remain_inert_packet_data (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_captured_code_and_paths_remain_inert_packet_data) ... ok
+test_claimed_binding_context_has_closed_exact_schema_even_without_regression (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_claimed_binding_context_has_closed_exact_schema_even_without_regression) ... ok
+test_closed_packet_capture_binding_and_formal_wrappers_refuse_extra_or_missing_keys (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_closed_packet_capture_binding_and_formal_wrappers_refuse_extra_or_missing_keys) ... ok
+test_complete_formal_scope_is_retained_without_authenticated_or_fuzzy_joins (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_complete_formal_scope_is_retained_without_authenticated_or_fuzzy_joins) ... ok
+test_conflicting_bytes_for_one_immutable_git_identity_anywhere_are_refused (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_conflicting_bytes_for_one_immutable_git_identity_anywhere_are_refused) ... ok
+test_decoded_capture_limit_and_embedded_json_depth_and_duplicate_keys_are_bounded (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_decoded_capture_limit_and_embedded_json_depth_and_duplicate_keys_are_bounded) ... ok
+test_deleted_and_added_nodes_use_union_edges_but_only_survivors_get_proposals (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_deleted_and_added_nodes_use_union_edges_but_only_survivors_get_proposals) ... ok
+test_deleted_formal_mapping_retains_original_review_and_holds_surviving_shared_mapping (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_deleted_formal_mapping_retains_original_review_and_holds_surviving_shared_mapping) ... ok
+test_dependency_regression_stales_shared_whole_alignment_without_erasing_kernel (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_dependency_regression_stales_shared_whole_alignment_without_erasing_kernel) ... ok
+test_distinct_original_alignment_identities_are_retained_and_canonically_sorted (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_distinct_original_alignment_identities_are_retained_and_canonically_sorted) ... ok
+test_duplicate_and_nonfinite_json_and_oversized_packets_are_refused (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_duplicate_and_nonfinite_json_and_oversized_packets_are_refused) ... ok
+test_elaborated_comment_only_types_are_incomplete_but_real_types_remain_current (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_elaborated_comment_only_types_are_incomplete_but_real_types_remain_current) ... ok
+test_elaborated_target_coverage_is_required_and_silent_checker_is_valid (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_elaborated_target_coverage_is_required_and_silent_checker_is_valid) ... ok
+test_equal_hash_proof_selector_offsets_still_require_binding_context (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_equal_hash_proof_selector_offsets_still_require_binding_context) ... ok
+test_exact_successor_review_cannot_clear_shared_alignment_with_one_unresolved_main_join (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_exact_successor_review_cannot_clear_shared_alignment_with_one_unresolved_main_join) ... ok
+test_expected_native_context_mismatch_is_valid_stale_not_authentication (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_expected_native_context_mismatch_is_valid_stale_not_authentication) ... ok
+test_explicit_successor_graph_review_clears_only_its_exact_regression_context (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_explicit_successor_graph_review_clears_only_its_exact_regression_context) ... ok
+test_failed_or_skipped_incomplete_run_and_expected_failure_never_become_positive_kernel (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_failed_or_skipped_incomplete_run_and_expected_failure_never_become_positive_kernel) ... ok
+test_git_capture_checks_exact_raw_byte_count_sha_blob_and_canonical_base64 (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_git_capture_checks_exact_raw_byte_count_sha_blob_and_canonical_base64) ... ok
+test_graph_context_changes_revalidate_all_nodes_and_preserve_context (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_graph_context_changes_revalidate_all_nodes_and_preserve_context) ... ok
+test_graph_node_and_edge_admission_limits_cover_both_snapshots_and_alias_captures (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_graph_node_and_edge_admission_limits_cover_both_snapshots_and_alias_captures) ... ok
+test_main_alignment_author_binds_retained_manifest_lineage_without_relabeling (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_alignment_author_binds_retained_manifest_lineage_without_relabeling) ... ok
+test_main_bound_dependency_lock_matches_native_package_names_and_revisions (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_bound_dependency_lock_matches_native_package_names_and_revisions) ... ok
+test_main_known_package_captures_require_bound_or_unbound_component_membership (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_known_package_captures_require_bound_or_unbound_component_membership) ... ok
+test_main_manifest_capture_path_is_the_fixed_native_workflow_default (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_manifest_capture_path_is_the_fixed_native_workflow_default) ... ok
+test_main_manifest_package_requires_nonempty_native_text_even_when_receipt_matches (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_manifest_package_requires_nonempty_native_text_even_when_receipt_matches) ... ok
+test_main_native_producer_requires_its_fixed_toolchain_and_Lean_version (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_native_producer_requires_its_fixed_toolchain_and_Lean_version) ... ok
+test_main_negative_control_logs_must_be_present_under_exact_receipt_bound_names (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_negative_control_logs_must_be_present_under_exact_receipt_bound_names) ... ok
+test_main_negative_control_logs_need_the_native_rejection_evidence (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_negative_control_logs_need_the_native_rejection_evidence) ... ok
+test_main_ordered_declarations_namespaces_and_root_imports_match_the_native_inventory (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_ordered_declarations_namespaces_and_root_imports_match_the_native_inventory) ... ok
+test_main_origin_repository_policy_and_selected_utf8_sources_match_native_reads (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_origin_repository_policy_and_selected_utf8_sources_match_native_reads) ... ok
+test_main_origin_source_is_distinct_from_its_bound_local_copy (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_origin_source_is_distinct_from_its_bound_local_copy) ... ok
+test_main_original_version_log_is_required_and_matches_the_entire_trimmed_receipt_value (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_original_version_log_is_required_and_matches_the_entire_trimmed_receipt_value) ... ok
+test_main_placeholder_lineage_cannot_be_current_even_with_coherent_author_bindings (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_placeholder_lineage_cannot_be_current_even_with_coherent_author_bindings) ... ok
+test_main_positive_execution_log_basenames_cannot_be_reused_by_registered_negative_controls (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_positive_execution_log_basenames_cannot_be_reused_by_registered_negative_controls) ... ok
+test_main_prohibited_proof_constructs_follow_native_comment_and_word_boundary_rules (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_prohibited_proof_constructs_follow_native_comment_and_word_boundary_rules) ... ok
+test_main_receipt_log_alphabet_preserves_safe_extras_and_math_boundary (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_receipt_log_alphabet_preserves_safe_extras_and_math_boundary) ... ok
+test_main_registered_control_decide_body_cannot_consume_another_diagnostic (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_decide_body_cannot_consume_another_diagnostic) ... ok
+test_main_registered_control_explicit_quoted_diagnostics_remain_unknown (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_explicit_quoted_diagnostics_remain_unknown) ... ok
+test_main_registered_control_large_embedded_cr_diagnostic_remains_unknown (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_large_embedded_cr_diagnostic_remains_unknown) ... ok
+test_main_registered_control_native_diagnostic_crlf_remains_current (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_native_diagnostic_crlf_remains_current) ... ok
+test_main_registered_control_native_error_diagnostics_remain_current (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_native_error_diagnostics_remain_current) ... ok
+test_main_registered_control_quoted_diagnostics_do_not_establish_lean_rejection (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_quoted_diagnostics_do_not_establish_lean_rejection) ... ok
+test_main_registered_control_summaries_do_not_establish_lean_rejection (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_summaries_do_not_establish_lean_rejection) ... ok
+test_main_registered_control_warnings_do_not_establish_lean_rejection (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_control_warnings_do_not_establish_lean_rejection) ... ok
+test_main_registered_lean_suffix_and_visible_captured_lean_inventory_match_native_scope (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_lean_suffix_and_visible_captured_lean_inventory_match_native_scope) ... ok
+test_main_registered_mutation_source_preconditions_hold_before_builtin_overrides (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_registered_mutation_source_preconditions_hold_before_builtin_overrides) ... ok
+test_main_required_control_file_floor_and_captured_toolchain_bytes_match_native_source_check (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_required_control_file_floor_and_captured_toolchain_bytes_match_native_source_check) ... ok
+test_main_surplus_control_outcomes_refuse_but_missing_outcomes_remain_incomplete (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_surplus_control_outcomes_refuse_but_missing_outcomes_remain_incomplete) ... ok
+test_main_target_requires_exact_source_identity_and_explicit_statement_slice (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_main_target_requires_exact_source_identity_and_explicit_statement_slice) ... ok
+test_math_alignment_checks_every_proposer_normalized_lineage_and_target_scope (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_math_alignment_checks_every_proposer_normalized_lineage_and_target_scope) ... ok
+test_math_native_receipt_does_not_acquire_main_only_native_fields (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_math_native_receipt_does_not_acquire_main_only_native_fields) ... ok
+test_math_negative_control_log_inventory_keeps_its_distinct_native_names (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_math_negative_control_log_inventory_keeps_its_distinct_native_names) ... ok
+test_math_optional_proposer_scopes_preserve_historical_schema_and_every_lineage (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_math_optional_proposer_scopes_preserve_historical_schema_and_every_lineage) ... ok
+test_math_source_and_version_records_keep_their_separate_historical_boundary (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_math_source_and_version_records_keep_their_separate_historical_boundary) ... ok
+test_minimal_unchanged_packet_is_deterministic_unknown_and_inert (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_minimal_unchanged_packet_is_deterministic_unknown_and_inert) ... ok
+test_native_SCOPE_file_cannot_be_substituted_by_another_manifest_bound_file (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_native_SCOPE_file_cannot_be_substituted_by_another_manifest_bound_file) ... ok
+test_native_expected_context_changes_only_kernel_not_statement_alignment (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_native_expected_context_changes_only_kernel_not_statement_alignment) ... ok
+test_native_manifest_file_coverage_and_receipt_log_hashes_cannot_contradict_captures (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_native_manifest_file_coverage_and_receipt_log_hashes_cannot_contradict_captures) ... ok
+test_native_negative_control_outcomes_cannot_swap_Lean_and_axiom_gate_rejections (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_native_negative_control_outcomes_cannot_swap_Lean_and_axiom_gate_rejections) ... ok
+test_native_receipt_and_logs_share_parent_and_fixed_basename_with_null_receipt_preserved (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_native_receipt_and_logs_share_parent_and_fixed_basename_with_null_receipt_preserved) ... ok
+test_original_axioms_dump_cannot_contradict_receipt_target_scope_or_values (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_original_axioms_dump_cannot_contradict_receipt_target_scope_or_values) ... ok
+test_partial_successful_target_inventory_is_retained_but_not_current_kernel (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_partial_successful_target_inventory_is_retained_but_not_current_kernel) ... ok
+test_proof_only_change_stales_whole_manifest_alignment_without_statement_change (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_proof_only_change_stales_whole_manifest_alignment_without_statement_change) ... ok
+test_proof_selector_change_or_loss_requires_context_without_erasing_current_kernel (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_proof_selector_change_or_loss_requires_context_without_erasing_current_kernel) ... ok
+test_required_cycle_and_boolean_coercion_are_refused_but_context_cycle_is_valid (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_required_cycle_and_boolean_coercion_are_refused_but_context_cycle_is_valid) ... ok
+test_retrofit_failed_evidence_remains_recorded_without_positive_kernel_or_computation (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_retrofit_failed_evidence_remains_recorded_without_positive_kernel_or_computation) ... ok
+test_run_artifact_is_not_a_git_file_and_raw_hashes_and_native_bindings_must_match (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_run_artifact_is_not_a_git_file_and_raw_hashes_and_native_bindings_must_match) ... ok
+test_source_availability_loss_is_unresolved_and_propagates_without_guessed_slices (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_source_availability_loss_is_unresolved_and_propagates_without_guessed_slices) ... ok
+test_statement_and_proof_slice_bounds_types_and_hashes_are_exact_bytes (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_statement_and_proof_slice_bounds_types_and_hashes_are_exact_bytes) ... ok
+test_statement_change_uses_removed_and_context_edges_and_names_exact_review (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_statement_change_uses_removed_and_context_edges_and_names_exact_review) ... ok
+test_unknown_native_format_or_packet_authentication_claim_is_refused (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_unknown_native_format_or_packet_authentication_claim_is_refused) ... ok
+test_unknown_or_duplicate_explicit_node_target_binding_is_a_contradiction (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_unknown_or_duplicate_explicit_node_target_binding_is_a_contradiction) ... ok
+test_unmapped_similar_node_does_not_invent_an_affected_alignment_record (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_unmapped_similar_node_does_not_invent_an_affected_alignment_record) ... ok
+test_unscoped_source_change_is_unknown_not_a_guessed_statement_or_proof_split (test_architecture_evidence_adapter.ArchitectureEvidenceAdapterContract.test_unscoped_source_change_is_unknown_not_a_guessed_statement_or_proof_split) ... ok
+test_cli_refuses_unknown_node (test_architecture_evidence_path.EvidencePathArchitectureTests.test_cli_refuses_unknown_node) ... ok
+test_complete_path_for_synthetic_bound_node (test_architecture_evidence_path.EvidencePathArchitectureTests.test_complete_path_for_synthetic_bound_node) ... ok
+test_generic_unbound_node_reports_missing_binding (test_architecture_evidence_path.EvidencePathArchitectureTests.test_generic_unbound_node_reports_missing_binding) ... ok
+test_https_evidence_values_and_existing_limits_are_preserved (test_architecture_evidence_path.EvidencePathArchitectureTests.test_https_evidence_values_and_existing_limits_are_preserved) ... ok
+test_inputs_are_not_mutated (test_architecture_evidence_path.EvidencePathArchitectureTests.test_inputs_are_not_mutated) ... ok
+test_invalid_numeric_https_hosts_are_missing (test_architecture_evidence_path.EvidencePathArchitectureTests.test_invalid_numeric_https_hosts_are_missing) ... ok
+test_malformed_https_evidence_authorities_are_missing (test_architecture_evidence_path.EvidencePathArchitectureTests.test_malformed_https_evidence_authorities_are_missing) ... ok
+test_malformed_node_id_is_refused (test_architecture_evidence_path.EvidencePathArchitectureTests.test_malformed_node_id_is_refused) ... ok
+test_missing_empty_or_traversal_path_is_not_a_pinned_source (test_architecture_evidence_path.EvidencePathArchitectureTests.test_missing_empty_or_traversal_path_is_not_a_pinned_source) ... ok
+test_missing_receipt_and_review_are_named_not_padded (test_architecture_evidence_path.EvidencePathArchitectureTests.test_missing_receipt_and_review_are_named_not_padded) ... ok
+test_non_sha_commit_in_identity_is_not_a_pinned_source (test_architecture_evidence_path.EvidencePathArchitectureTests.test_non_sha_commit_in_identity_is_not_a_pinned_source) ... ok
+test_punctured_pin_projection_is_explicitly_missing (test_architecture_evidence_path.EvidencePathArchitectureTests.test_punctured_pin_projection_is_explicitly_missing) ... ok
+test_raw_url_whitespace_controls_and_backslashes_are_missing (test_architecture_evidence_path.EvidencePathArchitectureTests.test_raw_url_whitespace_controls_and_backslashes_are_missing) ... ok
+test_repository_punctured_pin_is_missing_via_cli (test_architecture_evidence_path.EvidencePathArchitectureTests.test_repository_punctured_pin_is_missing_via_cli) ... ok
+test_source_path_is_serialized_as_url_path_data (test_architecture_evidence_path.EvidencePathArchitectureTests.test_source_path_is_serialized_as_url_path_data) ... ok
+test_unknown_node_is_refused (test_architecture_evidence_path.EvidencePathArchitectureTests.test_unknown_node_is_refused) ... ok
+test_valid_numeric_and_nonnumeric_https_hosts_are_preserved (test_architecture_evidence_path.EvidencePathArchitectureTests.test_valid_numeric_and_nonnumeric_https_hosts_are_preserved) ... ok
+test_added_node_is_reported_without_attribute_change (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_added_node_is_reported_without_attribute_change) ... ok
+test_boolean_number_metadata_changes_are_reported (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_boolean_number_metadata_changes_are_reported) ... ok
+test_boolean_number_node_changes_are_reported (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_boolean_number_node_changes_are_reported) ... ok
+test_connected_tree (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_connected_tree) ... ok
+test_deeply_nested_parsed_values_keep_comparison_semantics (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_deeply_nested_parsed_values_keep_comparison_semantics) ... ok
+test_deleted_node_and_edge (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_deleted_node_and_edge) ... ok
+test_deterministic_output (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_deterministic_output) ... ok
+test_duplicate_graph_json_object_key_refuses (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_duplicate_graph_json_object_key_refuses) ... ok
+test_dynamic_snapshot_changes (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_dynamic_snapshot_changes) ... ok
+test_loop_is_one_cell (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_loop_is_one_cell) ... ok
+test_nested_boolean_number_metadata_changes_are_reported (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_nested_boolean_number_metadata_changes_are_reported) ... ok
+test_nested_boolean_number_node_changes_are_reported (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_nested_boolean_number_node_changes_are_reported) ... ok
+test_no_comparison_without_both_flags (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_no_comparison_without_both_flags) ... ok
+test_node_metadata_changes_not_scientifically_interpreted (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_node_metadata_changes_not_scientifically_interpreted) ... ok
+test_other_parsed_value_changes_remain_reported (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_other_parsed_value_changes_remain_reported) ... ok
+test_parallel_directed_cells_are_not_collapsed (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_parallel_directed_cells_are_not_collapsed) ... ok
+test_parsed_value_equivalence_does_not_invent_changes (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_parsed_value_equivalence_does_not_invent_changes) ... ok
+test_reject_nonboolean_edge_required_and_unknown_field (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_reject_nonboolean_edge_required_and_unknown_field) ... ok
+test_reject_nonfinite_and_bare_empty_nodes (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_reject_nonfinite_and_bare_empty_nodes) ... ok
+test_required_subgraph_keeps_all_vertices (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_required_subgraph_keeps_all_vertices) ... ok
+test_single_vertex_and_no_edges (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_single_vertex_and_no_edges) ... ok
+test_source_size_limit (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_source_size_limit) ... ok
+test_top_level_metadata_keys_are_compared_by_name (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_top_level_metadata_keys_are_compared_by_name) ... ok
+test_two_disconnected_edges (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_two_disconnected_edges) ... ok
+test_undirected_cycle (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_undirected_cycle) ... ok
+test_unknown_endpoint_and_duplicate_edge_refuse (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_unknown_endpoint_and_duplicate_edge_refuse) ... ok
+test_wrong_comparison_digest_refuses (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_wrong_comparison_digest_refuses) ... ok
+test_wrong_source_digest_refuses (test_architecture_evidence_topology_diagnostic.EvidenceTopologyDiagnostic.test_wrong_source_digest_refuses) ... ok
+test_actual_deflate_expansion_cannot_exceed_a_small_declared_size (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_actual_deflate_expansion_cannot_exceed_a_small_declared_size) ... ok
+test_all_89_literal_ids_are_required_even_with_a_coherent_substitute_count (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_all_89_literal_ids_are_required_even_with_a_coherent_substitute_count) ... ok
+test_all_native_flags_are_required_unique_and_opaque_on_argument_refusal (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_all_native_flags_are_required_unique_and_opaque_on_argument_refusal) ... ok
+test_all_twelve_manifest_hashes_and_closed_row_format_are_checked (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_all_twelve_manifest_hashes_and_closed_row_format_are_checked) ... ok
+test_both_complete_suites_and_receipt_mode_counts_and_id_lists_must_agree (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_both_complete_suites_and_receipt_mode_counts_and_id_lists_must_agree) ... ok
+test_captured_paths_code_urls_and_annotations_are_inert_with_calibrated_observers (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_captured_paths_code_urls_and_annotations_are_inert_with_calibrated_observers) ... ok
+test_crc_incomplete_deflate_and_unused_compressed_tail_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_crc_incomplete_deflate_and_unused_compressed_tail_are_refused) ... ok
+test_duplicate_case_alias_nul_and_unsafe_archive_member_names_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_duplicate_case_alias_nul_and_unsafe_archive_member_names_are_refused) ... ok
+test_each_closed_member_is_required_and_additional_members_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_each_closed_member_is_required_and_additional_members_are_refused) ... ok
+test_each_receipt_evidence_hash_is_required_exact_and_independently_recomputed (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_each_receipt_evidence_hash_is_required_exact_and_independently_recomputed) ... ok
+test_equal_additional_passing_inventory_includes_nonunderscore_unittest_names (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_equal_additional_passing_inventory_includes_nonunderscore_unittest_names) ... ok
+test_exact_4096_inventory_is_valid_and_coherent_4097_is_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_exact_4096_inventory_is_valid_and_coherent_4097_is_refused) ... ok
+test_exact_64_container_depth_is_valid_and_65_is_refused_in_native_annotations (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_exact_64_container_depth_is_valid_and_65_is_refused_in_native_annotations) ... ok
+test_exact_member_limits_accept_bounded_content_and_one_over_refuses (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_exact_member_limits_accept_bounded_content_and_one_over_refuses) ... ok
+test_failed_skipped_or_expected_negative_results_never_qualify_as_passing (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_failed_skipped_or_expected_negative_results_never_qualify_as_passing) ... ok
+test_fixed_exporter_diagnostics_cannot_claim_a_different_output_or_leak_on_refusal (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_fixed_exporter_diagnostics_cannot_claim_a_different_output_or_leak_on_refusal) ... ok
+test_graph_seven_root_fields_and_all_five_source_pins_cannot_be_replaced (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_graph_seven_root_fields_and_all_five_source_pins_cannot_be_replaced) ... ok
+test_input_is_one_regular_nofollow_file_and_fifo_never_waits_for_a_writer (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_input_is_one_regular_nofollow_file_and_fifo_never_waits_for_a_writer) ... ok
+test_json_duplicates_nonfinite_unicode_and_multiple_documents_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_json_duplicates_nonfinite_unicode_and_multiple_documents_are_refused) ... ok
+test_local_central_or_descriptor_contradictions_and_overlap_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_local_central_or_descriptor_contradictions_and_overlap_are_refused) ... ok
+test_log_duplicates_multiple_runs_footer_and_terminal_success_are_exact (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_log_duplicates_multiple_runs_footer_and_terminal_success_are_exact) ... ok
+test_malformed_result_looking_extras_cannot_hide_behind_valid_89_ids_and_footer (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_malformed_result_looking_extras_cannot_hide_behind_valid_89_ids_and_footer) ... ok
+test_native_context_and_both_external_byte_pins_cannot_be_substituted (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_native_context_and_both_external_byte_pins_cannot_be_substituted) ... ok
+test_native_text_files_and_original_receipt_context_must_match_expected_native_four (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_native_text_files_and_original_receipt_context_must_match_expected_native_four) ... ok
+test_original_receipt_external_pin_survives_coherent_manifest_regeneration (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_original_receipt_external_pin_survives_coherent_manifest_regeneration) ... ok
+test_other_native_context_attempt_ten_and_declared_artifact_id_are_preserved (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_other_native_context_attempt_ten_and_declared_artifact_id_are_preserved) ... ok
+test_producer_receipt_schema_types_authority_and_closed_native_objects_are_exact (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_producer_receipt_schema_types_authority_and_closed_native_objects_are_exact) ... ok
+test_public_graph_keeps_49_dictionary_ids_55_edges_and_distinct_recorded_axes (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_public_graph_keeps_49_dictionary_ids_55_edges_and_distinct_recorded_axes) ... ok
+test_raw_zip_at_exact_64_mib_passes_and_one_byte_over_is_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_raw_zip_at_exact_64_mib_passes_and_one_byte_over_is_refused) ... ok
+test_runtime_inspect_and_original_receipt_image_identity_are_consistent (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_runtime_inspect_and_original_receipt_image_identity_are_consistent) ... ok
+test_small_member_budgets_and_exact_128_byte_positive_decimal_are_enforced (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_small_member_budgets_and_exact_128_byte_positive_decimal_are_enforced) ... ok
+test_special_attributes_encryption_and_unsupported_flags_or_methods_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_special_attributes_encryption_and_unsupported_flags_or_methods_are_refused) ... ok
+test_stored_deflated_descriptors_and_member_or_manifest_order_are_valid (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_stored_deflated_descriptors_and_member_or_manifest_order_are_valid) ... ok
+test_truncation_prefix_tail_multidisk_zip64_comments_and_extras_are_refused (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_truncation_prefix_tail_multidisk_zip64_comments_and_extras_are_refused) ... ok
+test_typed_node_edge_and_dimensions_cannot_change_under_unchanged_source_pins (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_typed_node_edge_and_dimensions_cannot_change_under_unchanged_source_pins) ... ok
+test_unreferenced_interior_gap_or_hidden_local_record_is_refused_with_coherent_offsets (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_unreferenced_interior_gap_or_hidden_local_record_is_refused_with_coherent_offsets) ... ok
+test_valid_archive_is_one_stable_non_scientific_unit_with_original_receipt (test_architecture_graph_artifact_readback.ArchitectureGraphArtifactReadbackContract.test_valid_archive_is_one_stable_non_scientific_unit_with_original_receipt) ... ok
+test_caller_pinned_provenance_cannot_authorize_different_gate_code (test_architecture_graph_export.ArchitectureGraphExportContract.test_caller_pinned_provenance_cannot_authorize_different_gate_code) ... ok
+test_classification_and_proof_review_text_cannot_manufacture_evidence (test_architecture_graph_export.ArchitectureGraphExportContract.test_classification_and_proof_review_text_cannot_manufacture_evidence) ... ok
+test_context_only_cycle_is_allowed_without_changing_gate_semantics (test_architecture_graph_export.ArchitectureGraphExportContract.test_context_only_cycle_is_allowed_without_changing_gate_semantics) ... ok
+test_default_trust_rejects_self_consistent_changed_graph_and_provenance (test_architecture_graph_export.ArchitectureGraphExportContract.test_default_trust_rejects_self_consistent_changed_graph_and_provenance) ... ok
+test_dimensions_describe_only_explicit_recorded_metadata (test_architecture_graph_export.ArchitectureGraphExportContract.test_dimensions_describe_only_explicit_recorded_metadata) ... ok
+test_duplicate_graph_json_keys_are_rejected_after_identity_validation (test_architecture_graph_export.ArchitectureGraphExportContract.test_duplicate_graph_json_keys_are_rejected_after_identity_validation) ... ok
+test_duplicate_provenance_json_keys_are_rejected_before_gate_import (test_architecture_graph_export.ArchitectureGraphExportContract.test_duplicate_provenance_json_keys_are_rejected_before_gate_import) ... ok
+test_exact_source_bound_hard_gate_validator_is_called (test_architecture_graph_export.ArchitectureGraphExportContract.test_exact_source_bound_hard_gate_validator_is_called) ... ok
+test_failed_export_preserves_an_earlier_valid_export (test_architecture_graph_export.ArchitectureGraphExportContract.test_failed_export_preserves_an_earlier_valid_export) ... ok
+test_gate_identity_is_checked_before_untrusted_gate_executes (test_architecture_graph_export.ArchitectureGraphExportContract.test_gate_identity_is_checked_before_untrusted_gate_executes) ... ok
+test_graph_identity_is_checked_before_gate_import (test_architecture_graph_export.ArchitectureGraphExportContract.test_graph_identity_is_checked_before_gate_import) ... ok
+test_missing_required_dependency_is_rejected_by_pinned_hard_gate (test_architecture_graph_export.ArchitectureGraphExportContract.test_missing_required_dependency_is_rejected_by_pinned_hard_gate) ... ok
+test_pinned_49_node_55_edge_export_is_deterministic_and_preserves_records (test_architecture_graph_export.ArchitectureGraphExportContract.test_pinned_49_node_55_edge_export_is_deterministic_and_preserves_records) ... ok
+test_required_dependency_cycle_is_rejected_by_pinned_hard_gate (test_architecture_graph_export.ArchitectureGraphExportContract.test_required_dependency_cycle_is_rejected_by_pinned_hard_gate) ... ok
+test_same_size_gate_change_is_rejected_by_sha_before_import (test_architecture_graph_export.ArchitectureGraphExportContract.test_same_size_gate_change_is_rejected_by_sha_before_import) ... ok
+test_source_byte_counts_are_validated_even_when_sha_matches (test_architecture_graph_export.ArchitectureGraphExportContract.test_source_byte_counts_are_validated_even_when_sha_matches) ... ok
+test_symlink_source_directory_is_rejected (test_architecture_graph_export.ArchitectureGraphExportContract.test_symlink_source_directory_is_rejected) ... ok
+test_symlink_source_files_are_rejected_before_gate_import (test_architecture_graph_export.ArchitectureGraphExportContract.test_symlink_source_files_are_rejected_before_gate_import) ... ok
+test_attempt_ten_and_other_native_repository_are_preserved (test_architecture_receipt.ArchitectureReceiptContract.test_attempt_ten_and_other_native_repository_are_preserved) ... ok
+test_changed_node_or_edge_is_refused_even_when_graph_source_pins_are_unchanged (test_architecture_receipt.ArchitectureReceiptContract.test_changed_node_or_edge_is_refused_even_when_graph_source_pins_are_unchanged) ... ok
+test_directory_or_fifo_member_is_refused_without_waiting_for_a_writer (test_architecture_receipt.ArchitectureReceiptContract.test_directory_or_fifo_member_is_refused_without_waiting_for_a_writer) ... ok
+test_duplicate_json_keys_are_refused_even_when_last_value_is_valid (test_architecture_receipt.ArchitectureReceiptContract.test_duplicate_json_keys_are_refused_even_when_last_value_is_valid) ... ok
+test_duplicate_test_identity_or_multiple_runs_are_refused (test_architecture_receipt.ArchitectureReceiptContract.test_duplicate_test_identity_or_multiple_runs_are_refused) ... ok
+test_each_expected_host_identity_argument_is_used_and_required (test_architecture_receipt.ArchitectureReceiptContract.test_each_expected_host_identity_argument_is_used_and_required) ... ok
+test_each_native_identity_file_must_match_current_host_arguments (test_architecture_receipt.ArchitectureReceiptContract.test_each_native_identity_file_must_match_current_host_arguments) ... ok
+test_each_required_sandbox_control_rejects_skipped_failed_or_error_status (test_architecture_receipt.ArchitectureReceiptContract.test_each_required_sandbox_control_rejects_skipped_failed_or_error_status) ... ok
+test_each_staged_member_is_required (test_architecture_receipt.ArchitectureReceiptContract.test_each_staged_member_is_required) ... ok
+test_each_staged_member_must_be_regular_and_cannot_be_a_symlink (test_architecture_receipt.ArchitectureReceiptContract.test_each_staged_member_must_be_regular_and_cannot_be_a_symlink) ... ok
+test_each_staged_member_over_16_mib_is_refused (test_architecture_receipt.ArchitectureReceiptContract.test_each_staged_member_over_16_mib_is_refused) ... ok
+test_empty_or_zero_discovered_test_logs_are_refused_in_each_mode (test_architecture_receipt.ArchitectureReceiptContract.test_empty_or_zero_discovered_test_logs_are_refused_in_each_mode) ... ok
+test_every_graph_source_pin_is_required_and_cannot_be_substituted (test_architecture_receipt.ArchitectureReceiptContract.test_every_graph_source_pin_is_required_and_cannot_be_substituted) ... ok
+test_every_required_identity_is_needed_even_when_53_other_tests_are_ok (test_architecture_receipt.ArchitectureReceiptContract.test_every_required_identity_is_needed_even_when_53_other_tests_are_ok) ... ok
+test_evidence_directory_or_generated_parent_symlink_is_refused (test_architecture_receipt.ArchitectureReceiptContract.test_evidence_directory_or_generated_parent_symlink_is_refused) ... ok
+test_graph_and_runtime_inspect_require_strict_json (test_architecture_receipt.ArchitectureReceiptContract.test_graph_and_runtime_inspect_require_strict_json) ... ok
+test_graph_root_schema_and_non_scientific_flags_are_exact (test_architecture_receipt.ArchitectureReceiptContract.test_graph_root_schema_and_non_scientific_flags_are_exact) ... ok
+test_invalid_matching_host_identity_does_not_authorize_bad_commit_or_decimal (test_architecture_receipt.ArchitectureReceiptContract.test_invalid_matching_host_identity_does_not_authorize_bad_commit_or_decimal) ... ok
+test_later_all_ok_test_methods_are_counted_and_bound (test_architecture_receipt.ArchitectureReceiptContract.test_later_all_ok_test_methods_are_counted_and_bound) ... ok
+test_malformed_extra_result_lines_cannot_be_ignored_before_the_success_footer (test_architecture_receipt.ArchitectureReceiptContract.test_malformed_extra_result_lines_cannot_be_ignored_before_the_success_footer) ... ok
+test_malformed_foreign_or_shortname_mismatched_test_identities_are_refused (test_architecture_receipt.ArchitectureReceiptContract.test_malformed_foreign_or_shortname_mismatched_test_identities_are_refused) ... ok
+test_missing_extra_or_forged_dimension_cannot_manufacture_scientific_evidence (test_architecture_receipt.ArchitectureReceiptContract.test_missing_extra_or_forged_dimension_cannot_manufacture_scientific_evidence) ... ok
+test_native_repository_argument_must_have_owner_and_repository_components (test_architecture_receipt.ArchitectureReceiptContract.test_native_repository_argument_must_have_owner_and_repository_components) ... ok
+test_nested_record_types_cannot_change_even_when_python_values_compare_equal (test_architecture_receipt.ArchitectureReceiptContract.test_nested_record_types_cannot_change_even_when_python_values_compare_equal) ... ok
+test_non_finite_numbers_are_refused_even_in_additional_inspect_fields (test_architecture_receipt.ArchitectureReceiptContract.test_non_finite_numbers_are_refused_even_in_additional_inspect_fields) ... ok
+test_nonunderscore_unittest_names_are_accepted_as_additional_controls (test_architecture_receipt.ArchitectureReceiptContract.test_nonunderscore_unittest_names_are_accepted_as_additional_controls) ... ok
+test_nonunderscore_unittest_prefix_malformed_results_are_not_diagnostics (test_architecture_receipt.ArchitectureReceiptContract.test_nonunderscore_unittest_prefix_malformed_results_are_not_diagnostics) ... ok
+test_nonzero_or_malformed_container_exit_is_refused (test_architecture_receipt.ArchitectureReceiptContract.test_nonzero_or_malformed_container_exit_is_refused) ... ok
+test_normal_and_optimized_must_discover_the_same_additional_passing_tests (test_architecture_receipt.ArchitectureReceiptContract.test_normal_and_optimized_must_discover_the_same_additional_passing_tests) ... ok
+test_runtime_inspect_is_one_linux_amd64_image_with_the_fixed_digest (test_architecture_receipt.ArchitectureReceiptContract.test_runtime_inspect_is_one_linux_amd64_image_with_the_fixed_digest) ... ok
+test_skip_or_failure_in_additional_discovered_test_is_also_refused (test_architecture_receipt.ArchitectureReceiptContract.test_skip_or_failure_in_additional_discovered_test_is_also_refused) ... ok
+test_summary_must_report_exact_discovered_count_and_terminal_ok (test_architecture_receipt.ArchitectureReceiptContract.test_summary_must_report_exact_discovered_count_and_terminal_ok) ... ok
+test_valid_53_test_receipt_is_exact_deterministic_and_preserves_staged_bytes (test_architecture_receipt.ArchitectureReceiptContract.test_valid_53_test_receipt_is_exact_deterministic_and_preserves_staged_bytes) ... ok
+test_valid_inspected_image_id_is_preserved_instead_of_hardcoded (test_architecture_receipt.ArchitectureReceiptContract.test_valid_inspected_image_id_is_preserved_instead_of_hardcoded) ... ok
+test_valid_log_at_exact_16_mib_limit_is_accepted (test_architecture_receipt.ArchitectureReceiptContract.test_valid_log_at_exact_16_mib_limit_is_accepted) ... ok
+test_valid_log_larger_than_64_kib_is_accepted_and_raw_bytes_are_hashed (test_architecture_receipt.ArchitectureReceiptContract.test_valid_log_larger_than_64_kib_is_accepted_and_raw_bytes_are_hashed) ... ok
+test_kernel_enforces_cpu_memory_and_process_limits (test_architecture_sandbox.ArchitectureSandbox.test_kernel_enforces_cpu_memory_and_process_limits) ... skipped 'requires hosted restricted container'
+test_network_namespace_has_no_external_interface_or_route (test_architecture_sandbox.ArchitectureSandbox.test_network_namespace_has_no_external_interface_or_route) ... skipped 'requires hosted restricted container'
+test_nonroot_and_no_new_privileges (test_architecture_sandbox.ArchitectureSandbox.test_nonroot_and_no_new_privileges) ... skipped 'requires hosted restricted container'
+test_output_quota_stops_disk_exhaustion_and_cleanup_recovers_space (test_architecture_sandbox.ArchitectureSandbox.test_output_quota_stops_disk_exhaustion_and_cleanup_recovers_space) ... skipped 'requires hosted restricted container'
+test_source_mount_is_read_only_and_environment_has_no_publishing_secret (test_architecture_sandbox.ArchitectureSandbox.test_source_mount_is_read_only_and_environment_has_no_publishing_secret) ... skipped 'requires hosted restricted container'
+test_one_existing_node_exact_four_object_lineage (test_architecture_side24_coefficient_binding.Side24SourceImplementationBindings.test_one_existing_node_exact_four_object_lineage) ... ok
+test_actual_builder_manifest_capacity_refusal_preserves_every_existing_site_byte (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_actual_builder_manifest_capacity_refusal_preserves_every_existing_site_byte) ... ok
+test_admitted_positive_preserves_three_exact_buffers_and_five_paths (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_admitted_positive_preserves_three_exact_buffers_and_five_paths) ... ok
+test_builder_all_none_options_preserve_exact_legacy_behavior (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_builder_all_none_options_preserve_exact_legacy_behavior) ... ok
+test_changed_current_payload_regenerates_consistent_native_aliases_without_math_churn (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_changed_current_payload_regenerates_consistent_native_aliases_without_math_churn) ... ok
+test_changed_native_binding_preserves_current_json_and_all_math_snapshots_and_aliases (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_changed_native_binding_preserves_current_json_and_all_math_snapshots_and_aliases) ... ok
+test_closed_native_fields_types_and_fixed_source_are_required (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_closed_native_fields_types_and_fixed_source_are_required) ... ok
+test_constructed_projection_or_dataclass_cannot_replace_raw_archive_admission (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_constructed_projection_or_dataclass_cannot_replace_raw_archive_admission) ... ok
+test_current_payload_exact_16_mib_passes_and_one_over_or_wrong_type_refuses (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_current_payload_exact_16_mib_passes_and_one_over_or_wrong_type_refuses) ... ok
+test_each_comparable_native_pin_mismatch_refuses_after_valid_positive (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_each_comparable_native_pin_mismatch_refuses_after_valid_positive) ... ok
+test_every_emitted_page_manifest_and_aggregate_obeys_actual_public_caps (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_every_emitted_page_manifest_and_aggregate_obeys_actual_public_caps) ... ok
+test_fixed_source_literals_are_escaped_and_forged_hostile_records_are_rejected (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_fixed_source_literals_are_escaped_and_forged_hostile_records_are_rejected) ... ok
+test_manifest_actual_64_kib_boundary_and_one_over_use_otherwise_admitted_native_context (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_manifest_actual_64_kib_boundary_and_one_over_use_otherwise_admitted_native_context) ... ok
+test_manifest_is_closed_canonical_and_binds_exact_four_files_without_cycle (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_manifest_is_closed_canonical_and_binds_exact_four_files_without_cycle) ... ok
+test_native_builder_malformed_or_unserializable_payload_refuses_before_any_write (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_native_builder_malformed_or_unserializable_payload_refuses_before_any_write) ... ok
+test_native_generated_destination_conflict_refuses_before_existing_bytes_change (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_native_generated_destination_conflict_refuses_before_existing_bytes_change) ... ok
+test_native_mode_still_refuses_other_root_page_marker_defects (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_native_mode_still_refuses_other_root_page_marker_defects) ... ok
+test_native_namespace_and_asset_symlinks_refuse_before_any_write (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_native_namespace_and_asset_symlinks_refuse_before_any_write) ... ok
+test_native_to_legacy_fallback_refuses_before_any_write (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_native_to_legacy_fallback_refuses_before_any_write) ... ok
+test_page_preserves_distinct_build_producer_math_contexts_and_evidence_qualifiers (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_page_preserves_distinct_build_producer_math_contexts_and_evidence_qualifiers) ... ok
+test_partial_or_broken_reserved_native_state_forbids_legacy_mode (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_partial_or_broken_reserved_native_state_forbids_legacy_mode) ... ok
+test_private_archive_and_diagnostic_members_never_enter_any_public_output (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_private_archive_and_diagnostic_members_never_enter_any_public_output) ... ok
+test_real_builder_emits_exact_bundle_and_preserves_payload_and_history (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_real_builder_emits_exact_bundle_and_preserves_payload_and_history) ... ok
+test_real_builder_refuses_bad_native_pin_and_truncation_before_any_site_write (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_real_builder_refuses_bad_native_pin_and_truncation_before_any_site_write) ... ok
+test_real_builder_refuses_every_partial_native_input_without_legacy_fallback (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_real_builder_refuses_every_partial_native_input_without_legacy_fallback) ... ok
+test_real_builder_refuses_wrong_native_types_before_writing (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_real_builder_refuses_wrong_native_types_before_writing) ... ok
+test_repeated_bundle_is_deterministic_and_does_not_mutate_inputs (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_repeated_bundle_is_deterministic_and_does_not_mutate_inputs) ... ok
+test_repeated_complete_native_build_preserves_every_emitted_site_byte (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_repeated_complete_native_build_preserves_every_emitted_site_byte) ... ok
+test_same_artifact_existing_native_bytes_conflict_refuses_without_repair (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_same_artifact_existing_native_bytes_conflict_refuses_without_repair) ... ok
+test_strict_build_context_accepts_256_char_repository_and_refuses_invalid_values (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_strict_build_context_accepts_256_char_repository_and_refuses_invalid_values) ... ok
+test_svg_keyboard_links_resolve_to_all_49_distinct_node_cards_with_five_axes (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_svg_keyboard_links_resolve_to_all_49_distinct_node_cards_with_five_axes) ... ok
+test_truncated_archive_is_refused_even_with_matching_new_archive_digest (test_architecture_site_graph_bundle.NativeGraphBundleContract.test_truncated_archive_is_refused_even_with_matching_new_archive_digest) ... ok
+test_all_native_outcomes_and_order_are_preserved (test_architecture_unittest_timing_probe.TimingProbeTests.test_all_native_outcomes_and_order_are_preserved) ... ok
+test_buffered_output_and_failure_reporting_are_retained (test_architecture_unittest_timing_probe.TimingProbeTests.test_buffered_output_and_failure_reporting_are_retained) ... ok
+test_cli_usage_errors_keep_native_nonzero_exit (test_architecture_unittest_timing_probe.TimingProbeTests.test_cli_usage_errors_keep_native_nonzero_exit) ... ok
+test_empty_discovery_retains_native_version_specific_exit (test_architecture_unittest_timing_probe.TimingProbeTests.test_empty_discovery_retains_native_version_specific_exit) ... ok
+test_existing_symlink_journal_does_not_touch_target (test_architecture_unittest_timing_probe.TimingProbeTests.test_existing_symlink_journal_does_not_touch_target) ... ok
+test_failfast_and_name_selection_match_native_cli (test_architecture_unittest_timing_probe.TimingProbeTests.test_failfast_and_name_selection_match_native_cli) ... ok
+test_import_and_class_setup_failures_are_not_hidden (test_architecture_unittest_timing_probe.TimingProbeTests.test_import_and_class_setup_failures_are_not_hidden) ... ok
+test_interrupted_test_leaves_flushed_unmatched_start (test_architecture_unittest_timing_probe.TimingProbeTests.test_interrupted_test_leaves_flushed_unmatched_start) ... ok
+test_journal_is_exclusive_and_fixture_is_not_executed (test_architecture_unittest_timing_probe.TimingProbeTests.test_journal_is_exclusive_and_fixture_is_not_executed) ... ok
+test_journal_write_failure_is_visible_and_latched (test_architecture_unittest_timing_probe.TimingProbeTests.test_journal_write_failure_is_visible_and_latched) ... ok
+test_midrun_flush_error_cannot_return_success (test_architecture_unittest_timing_probe.TimingProbeTests.test_midrun_flush_error_cannot_return_success) ... ok
+test_missing_parent_is_failure_before_discovery (test_architecture_unittest_timing_probe.TimingProbeTests.test_missing_parent_is_failure_before_discovery) ... ok
+test_nonisolated_named_module_imports_match_native (test_architecture_unittest_timing_probe.TimingProbeTests.test_nonisolated_named_module_imports_match_native) ... ok
+test_setup_teardown_module_skip_and_subtest_errors_match_native (test_architecture_unittest_timing_probe.TimingProbeTests.test_setup_teardown_module_skip_and_subtest_errors_match_native) ... ok
+test_success_has_live_start_stop_and_native_result (test_architecture_unittest_timing_probe.TimingProbeTests.test_success_has_live_start_stop_and_native_result) ... ok
+test_keyboard_focus_ring_fits_inside_the_list_scroll_boundary (test_atlas_focus_geometry.AtlasListFocusGeometry.test_keyboard_focus_ring_fits_inside_the_list_scroll_boundary) ... ok
+test_actual_adverse_review_is_retained_without_turning_one_aligned_row_into_package_acceptance (test_atlas_formal_evidence_build.FormalConnectionAssembly.test_actual_adverse_review_is_retained_without_turning_one_aligned_row_into_package_acceptance) ... ok
+test_changed_graph_scope_is_refused_even_with_same_fingerprint (test_atlas_formal_evidence_build.FormalConnectionAssembly.test_changed_graph_scope_is_refused_even_with_same_fingerprint) ... ok
+test_changed_proof_bytes_are_refused (test_atlas_formal_evidence_build.FormalConnectionAssembly.test_changed_proof_bytes_are_refused) ... ok
+test_exact_proof_source_connects_to_original_checked_closed_declaration (test_atlas_formal_evidence_build.FormalConnectionAssembly.test_exact_proof_source_connects_to_original_checked_closed_declaration) ... ok
+test_live_manifest_drift_is_refused_before_historical_evidence_is_rebound (test_atlas_formal_evidence_build.FormalConnectionAssembly.test_live_manifest_drift_is_refused_before_historical_evidence_is_rebound) ... ok
+test_missing_named_claim_cannot_use_an_equally_named_source (test_atlas_formal_evidence_build.FormalConnectionAssembly.test_missing_named_claim_cannot_use_an_equally_named_source) ... ok
+test_modified_execution_archive_is_not_trusted (test_atlas_formal_evidence_build.FormalConnectionAssembly.test_modified_execution_archive_is_not_trusted) ... ok
+test_same_name_or_fingerprint_with_wrong_blob_is_refused (test_atlas_formal_evidence_build.FormalConnectionAssembly.test_same_name_or_fingerprint_with_wrong_blob_is_refused) ... ok
+test_another_observation_cannot_overwrite_an_existing_qualified_record (test_atlas_formal_source_bridge.CorrectedManifestBridgeCLI.test_another_observation_cannot_overwrite_an_existing_qualified_record) ... ok
+test_changed_graph_scope_does_not_reuse_a_document_fingerprint (test_atlas_formal_source_bridge.CorrectedManifestBridgeCLI.test_changed_graph_scope_does_not_reuse_a_document_fingerprint) ... ok
+test_changed_historical_control_data_is_not_executed_or_accepted (test_atlas_formal_source_bridge.CorrectedManifestBridgeCLI.test_changed_historical_control_data_is_not_executed_or_accepted) ... ok
+test_changed_original_evidence_or_archive_is_refused (test_atlas_formal_source_bridge.CorrectedManifestBridgeCLI.test_changed_original_evidence_or_archive_is_refused) ... ok
+test_corrupt_generated_record_is_refused_by_check (test_atlas_formal_source_bridge.CorrectedManifestBridgeCLI.test_corrupt_generated_record_is_refused_by_check) ... ok
+test_crlf_altered_derivation_is_refused_without_rewriting_its_bytes (test_atlas_formal_source_bridge.CorrectedManifestBridgeCLI.test_crlf_altered_derivation_is_refused_without_rewriting_its_bytes) ... ok
+test_current_bridge_reproduces_original_evidence_and_records_only_two_control_changes (test_atlas_formal_source_bridge.CorrectedManifestBridgeCLI.test_current_bridge_reproduces_original_evidence_and_records_only_two_control_changes) ... ok
+test_duplicate_manifest_inventory_is_not_silently_selected (test_atlas_formal_source_bridge.CorrectedManifestBridgeCLI.test_duplicate_manifest_inventory_is_not_silently_selected) ... ok
+test_every_changed_registered_file_is_refused_without_publishing_a_bridge (test_atlas_formal_source_bridge.CorrectedManifestBridgeCLI.test_every_changed_registered_file_is_refused_without_publishing_a_bridge) ... ok
+test_resigned_new_manifest_is_not_an_approved_bridge (test_atlas_formal_source_bridge.CorrectedManifestBridgeCLI.test_resigned_new_manifest_is_not_an_approved_bridge) ... ok
+test_another_observation_cannot_overwrite_an_existing_qualified_record (test_atlas_formal_source_bridge.SourceBridgeCLI.test_another_observation_cannot_overwrite_an_existing_qualified_record) ... ok
+test_changed_graph_scope_does_not_reuse_a_document_fingerprint (test_atlas_formal_source_bridge.SourceBridgeCLI.test_changed_graph_scope_does_not_reuse_a_document_fingerprint) ... ok
+test_changed_historical_control_data_is_not_executed_or_accepted (test_atlas_formal_source_bridge.SourceBridgeCLI.test_changed_historical_control_data_is_not_executed_or_accepted) ... ok
+test_changed_original_evidence_or_archive_is_refused (test_atlas_formal_source_bridge.SourceBridgeCLI.test_changed_original_evidence_or_archive_is_refused) ... ok
+test_corrupt_generated_record_is_refused_by_check (test_atlas_formal_source_bridge.SourceBridgeCLI.test_corrupt_generated_record_is_refused_by_check) ... ok
+test_crlf_altered_derivation_is_refused_without_rewriting_its_bytes (test_atlas_formal_source_bridge.SourceBridgeCLI.test_crlf_altered_derivation_is_refused_without_rewriting_its_bytes) ... ok
+test_current_bridge_reproduces_original_evidence_and_records_only_two_control_changes (test_atlas_formal_source_bridge.SourceBridgeCLI.test_current_bridge_reproduces_original_evidence_and_records_only_two_control_changes) ... ok
+test_duplicate_manifest_inventory_is_not_silently_selected (test_atlas_formal_source_bridge.SourceBridgeCLI.test_duplicate_manifest_inventory_is_not_silently_selected) ... ok
+test_every_changed_registered_file_is_refused_without_publishing_a_bridge (test_atlas_formal_source_bridge.SourceBridgeCLI.test_every_changed_registered_file_is_refused_without_publishing_a_bridge) ... ok
+test_resigned_new_manifest_is_not_an_approved_bridge (test_atlas_formal_source_bridge.SourceBridgeCLI.test_resigned_new_manifest_is_not_an_approved_bridge) ... ok
+test_new_selection_after_a_long_read_keeps_its_heading_visible (test_atlas_reader_scroll.AtlasReaderScroll.test_new_selection_after_a_long_read_keeps_its_heading_visible) ... ok
+test_allowed_owner_keys_pass (test_board_links.BoardLinks.test_allowed_owner_keys_pass) ... ok
+test_bad_item_status_fails (test_board_links.BoardLinks.test_bad_item_status_fails) ... ok
+test_carried_forward_dict_instead_of_list_fails (test_board_links.BoardLinks.test_carried_forward_dict_instead_of_list_fails) ... ok
+test_carried_item_extra_key_fails (test_board_links.BoardLinks.test_carried_item_extra_key_fails) ... ok
+test_carried_item_id_must_be_string (test_board_links.BoardLinks.test_carried_item_id_must_be_string) ... ok
+test_carried_item_not_dict_fails (test_board_links.BoardLinks.test_carried_item_not_dict_fails) ... ok
+test_carried_item_without_id_fails (test_board_links.BoardLinks.test_carried_item_without_id_fails) ... ok
+test_carried_item_without_source_url_fails (test_board_links.BoardLinks.test_carried_item_without_source_url_fails) ... ok
+test_carried_item_without_text_fails (test_board_links.BoardLinks.test_carried_item_without_text_fails) ... ok
+test_carried_open_items_are_preserved (test_board_links.BoardLinks.test_carried_open_items_are_preserved) ... ok
+test_cli_exit_status_and_no_writes (test_board_links.BoardLinks.test_cli_exit_status_and_no_writes) ... ok
+test_comment_url_pattern (test_board_links.BoardLinks.test_comment_url_pattern) ... ok
+test_consistent_chain_passes (test_board_links.BoardLinks.test_consistent_chain_passes) ... ok
+test_duplicate_item_id_fails (test_board_links.BoardLinks.test_duplicate_item_id_fails) ... ok
+test_duplicate_node_id_fails (test_board_links.BoardLinks.test_duplicate_node_id_fails) ... ok
+test_link_to_absent_record_fails (test_board_links.BoardLinks.test_link_to_absent_record_fails) ... ok
+test_link_url_not_http_fails (test_board_links.BoardLinks.test_link_url_not_http_fails) ... ok
+test_malformed_link_fails (test_board_links.BoardLinks.test_malformed_link_fails) ... ok
+test_malformed_released_url_fails (test_board_links.BoardLinks.test_malformed_released_url_fails) ... ok
+test_missing_reciprocal_link_fails (test_board_links.BoardLinks.test_missing_reciprocal_link_fails) ... ok
+test_null_owner_is_not_inferred (test_board_links.BoardLinks.test_null_owner_is_not_inferred) ... ok
+test_open_item_dropped_by_successor_fails (test_board_links.BoardLinks.test_open_item_dropped_by_successor_fails) ... ok
+test_owner_extra_key_fails (test_board_links.BoardLinks.test_owner_extra_key_fails) ... ok
+test_owner_without_id_fails (test_board_links.BoardLinks.test_owner_without_id_fails) ... ok
+test_owner_without_pickup_url_fails (test_board_links.BoardLinks.test_owner_without_pickup_url_fails) ... ok
+test_refresh_error_must_be_string_or_null (test_board_links.BoardLinks.test_refresh_error_must_be_string_or_null) ... ok
+test_released_owner_missing_evidence_url_fails (test_board_links.BoardLinks.test_released_owner_missing_evidence_url_fails) ... ok
+test_released_owner_missing_id_fails (test_board_links.BoardLinks.test_released_owner_missing_id_fails) ... ok
+test_released_owner_with_evidence_passes (test_board_links.BoardLinks.test_released_owner_with_evidence_passes) ... ok
+test_resolved_without_resolution_url_fails (test_board_links.BoardLinks.test_resolved_without_resolution_url_fails) ... ok
+test_trailing_newline_in_url_fails (test_board_links.BoardLinks.test_trailing_newline_in_url_fails) ... ok
+test_zero_leading_comment_ids_fail (test_board_links.BoardLinks.test_zero_leading_comment_ids_fail) ... ok
+test_array_nested_names_are_checked (test_board_links_raw_json.RawBoardJSON.test_array_nested_names_are_checked) ... ok
+test_dropped_open_item_cannot_be_hidden (test_board_links_raw_json.RawBoardJSON.test_dropped_open_item_cannot_be_hidden) ... ok
+test_equal_valued_duplicate_is_still_ambiguous (test_board_links_raw_json.RawBoardJSON.test_equal_valued_duplicate_is_still_ambiguous) ... ok
+test_escaped_names_are_compared_after_decoding (test_board_links_raw_json.RawBoardJSON.test_escaped_names_are_compared_after_decoding) ... ok
+test_nested_item_status_cannot_be_replaced (test_board_links_raw_json.RawBoardJSON.test_nested_item_status_cannot_be_replaced) ... ok
+test_nested_owner_evidence_cannot_be_replaced (test_board_links_raw_json.RawBoardJSON.test_nested_owner_evidence_cannot_be_replaced) ... ok
+test_other_file_errors_are_not_silenced (test_board_links_raw_json.RawBoardJSON.test_other_file_errors_are_not_silenced) ... ok
+test_owner_cannot_be_hidden_by_later_null (test_board_links_raw_json.RawBoardJSON.test_owner_cannot_be_hidden_by_later_null) ... ok
+test_separate_objects_can_reuse_the_same_names (test_board_links_raw_json.RawBoardJSON.test_separate_objects_can_reuse_the_same_names) ... ok
+test_cli_accepts_valid_http_urls (test_board_links_url_errors.BoardLinkUrlErrors.test_cli_accepts_valid_http_urls) ... ok
+test_cli_reports_parser_errors_for_both_link_directions (test_board_links_url_errors.BoardLinkUrlErrors.test_cli_reports_parser_errors_for_both_link_directions) ... ok
+test_multiple_bad_urls_preserve_other_validation_findings (test_board_links_url_errors.BoardLinkUrlErrors.test_multiple_bad_urls_preserve_other_validation_findings) ... ok
+test_other_invalid_inputs_remain_validation_errors (test_board_links_url_errors.BoardLinkUrlErrors.test_other_invalid_inputs_remain_validation_errors) ... ok
+test_parser_errors_are_reported_for_both_link_directions (test_board_links_url_errors.BoardLinkUrlErrors.test_parser_errors_are_reported_for_both_link_directions) ... ok
+test_valid_http_urls_keep_their_existing_behavior (test_board_links_url_errors.BoardLinkUrlErrors.test_valid_http_urls_keep_their_existing_behavior) ... ok
+test_all_declared_proof_suffixes_are_enumerated (test_cbz_audit.AuditContract.test_all_declared_proof_suffixes_are_enumerated) ... ok
+test_all_declared_trust_tokens_and_nonmatching_names (test_cbz_audit.AuditContract.test_all_declared_trust_tokens_and_nonmatching_names) ... ok
+test_archive_and_other_proof_format_are_explicit_gaps (test_cbz_audit.AuditContract.test_archive_and_other_proof_format_are_explicit_gaps) ... ok
+test_archive_declared_signatures_and_suffixes_and_negative (test_cbz_audit.AuditContract.test_archive_declared_signatures_and_suffixes_and_negative) ... ok
+test_archive_magic_without_extension_is_gap (test_cbz_audit.AuditContract.test_archive_magic_without_extension_is_gap) ... ok
+test_certified_lean_float_and_unsupported_certifier (test_cbz_audit.AuditContract.test_certified_lean_float_and_unsupported_certifier) ... ok
+test_certified_python_exact_arithmetic_and_string_are_not_float_hits (test_cbz_audit.AuditContract.test_certified_python_exact_arithmetic_and_string_are_not_float_hits) ... ok
+test_certified_python_float_literals_and_calls_are_findings (test_cbz_audit.AuditContract.test_certified_python_float_literals_and_calls_are_findings) ... ok
+test_cli_invalid_json_manifest_is_explicit_failure (test_cbz_audit.AuditContract.test_cli_invalid_json_manifest_is_explicit_failure) ... ok
+test_cli_json_and_failure_exit (test_cbz_audit.AuditContract.test_cli_json_and_failure_exit) ... ok
+test_comment_then_real_token_and_unicode_name (test_cbz_audit.AuditContract.test_comment_then_real_token_and_unicode_name) ... ok
+test_compiled_lean_artifacts_are_explicit_coverage_gaps (test_cbz_audit.AuditContract.test_compiled_lean_artifacts_are_explicit_coverage_gaps) ... ok
+test_complete_tracked_inventory_including_hidden_and_spaces (test_cbz_audit.AuditContract.test_complete_tracked_inventory_including_hidden_and_spaces) ... ok
+test_coverage_gap_binds_exact_bytes_and_tool_source (test_cbz_audit.AuditContract.test_coverage_gap_binds_exact_bytes_and_tool_source) ... ok
+test_each_real_placeholder_and_axiom_is_visible (test_cbz_audit.AuditContract.test_each_real_placeholder_and_axiom_is_visible) ... ok
+test_empty_scan_cli_is_incomplete_nonzero (test_cbz_audit.AuditContract.test_empty_scan_cli_is_incomplete_nonzero) ... ok
+test_empty_tree_never_manufactures_layer_a_green (test_cbz_audit.AuditContract.test_empty_tree_never_manufactures_layer_a_green) ... ok
+test_explicit_noncertifying_float_is_not_a_bound_finding (test_cbz_audit.AuditContract.test_explicit_noncertifying_float_is_not_a_bound_finding) ... ok
+test_invalid_python_certifier_is_gap (test_cbz_audit.AuditContract.test_invalid_python_certifier_is_gap) ... ok
+test_invalid_utf8_in_lean_is_gap (test_cbz_audit.AuditContract.test_invalid_utf8_in_lean_is_gap) ... ok
+test_json_numbers_and_duplicate_keys_refused_valid_roundtrip (test_cbz_audit.AuditContract.test_json_numbers_and_duplicate_keys_refused_valid_roundtrip) ... ok
+test_kernel_check_bypass_is_a_trust_finding (test_cbz_audit.AuditContract.test_kernel_check_bypass_is_a_trust_finding) ... ok
+test_lfs_pointer_is_not_mistaken_for_source (test_cbz_audit.AuditContract.test_lfs_pointer_is_not_mistaken_for_source) ... ok
+test_nested_comments_strings_and_quoted_identifiers_are_not_keywords (test_cbz_audit.AuditContract.test_nested_comments_strings_and_quoted_identifiers_are_not_keywords) ... ok
+test_non_git_root_is_explicit_gap (test_cbz_audit.AuditContract.test_non_git_root_is_explicit_gap) ... ok
+test_python_complex_literals_are_floating_point (test_cbz_audit.AuditContract.test_python_complex_literals_are_floating_point) ... ok
+test_quarantine_missing_reason_owner_or_attempts_is_invalid (test_cbz_audit.AuditContract.test_quarantine_missing_reason_owner_or_attempts_is_invalid) ... ok
+test_quarantine_preserves_findings_and_requires_independent_isolation (test_cbz_audit.AuditContract.test_quarantine_preserves_findings_and_requires_independent_isolation) ... ok
+test_raw_lean_strings_hide_only_string_contents (test_cbz_audit.AuditContract.test_raw_lean_strings_hide_only_string_contents) ... ok
+test_registry_bad_roles_duplicates_and_traversal_refused (test_cbz_audit.AuditContract.test_registry_bad_roles_duplicates_and_traversal_refused) ... ok
+test_registry_extends_proof_candidate_inventory (test_cbz_audit.AuditContract.test_registry_extends_proof_candidate_inventory) ... ok
+test_registry_hash_and_unknown_file_refused (test_cbz_audit.AuditContract.test_registry_hash_and_unknown_file_refused) ... ok
+test_replaced_tracked_file_kind_is_gap (test_cbz_audit.AuditContract.test_replaced_tracked_file_kind_is_gap) ... ok
+test_subdirectory_request_scans_repository_root (test_cbz_audit.AuditContract.test_subdirectory_request_scans_repository_root) ... ok
+test_submodule_is_explicit_gap (test_cbz_audit.AuditContract.test_submodule_is_explicit_gap) ... ok
+test_symlink_ancestor_is_gap_even_when_destination_is_readable (test_cbz_audit.AuditContract.test_symlink_ancestor_is_gap_even_when_destination_is_readable) ... ok
+test_symlink_is_gap_and_never_followed (test_cbz_audit.AuditContract.test_symlink_is_gap_and_never_followed) ... ok
+test_tracked_worktree_deletion_is_never_skipped (test_cbz_audit.AuditContract.test_tracked_worktree_deletion_is_never_skipped) ... ok
+test_trust_escape_hatches_and_quoted_trust_names (test_cbz_audit.AuditContract.test_trust_escape_hatches_and_quoted_trust_names) ... ok
+test_ui_float_is_not_mathematical_certification_finding (test_cbz_audit.AuditContract.test_ui_float_is_not_mathematical_certification_finding) ... ok
+test_unmerged_index_stages_are_coverage_gaps (test_cbz_audit.AuditContract.test_unmerged_index_stages_are_coverage_gaps) ... ok
+test_unterminated_lexemes_and_interpolation_are_gaps (test_cbz_audit.AuditContract.test_unterminated_lexemes_and_interpolation_are_gaps) ... ok
+test_untracked_proof_is_visible_gap (test_cbz_audit.AuditContract.test_untracked_proof_is_visible_gap) ... ok
+test_changed_command_invalidates_receipt (test_cbz_baseline.BaselineTests.test_changed_command_invalidates_receipt) ... ok
+test_closed_cannot_depend_transitively_on_quarantine (test_cbz_baseline.BaselineTests.test_closed_cannot_depend_transitively_on_quarantine) ... ok
+test_cold_start_checks_executable_entrypoints_without_theorem_claim (test_cbz_baseline.BaselineTests.test_cold_start_checks_executable_entrypoints_without_theorem_claim) ... ok
+test_custom_axiom_cannot_be_closed (test_cbz_baseline.BaselineTests.test_custom_axiom_cannot_be_closed) ... ok
+test_declared_allowed_axioms_cannot_admit_custom_axioms (test_cbz_baseline.BaselineTests.test_declared_allowed_axioms_cannot_admit_custom_axioms) ... ok
+test_duplicate_json_key_is_refused (test_cbz_baseline.BaselineTests.test_duplicate_json_key_is_refused) ... ok
+test_exit_two_is_incomplete_rather_than_an_observed_failure (test_cbz_baseline.BaselineTests.test_exit_two_is_incomplete_rather_than_an_observed_failure) ... ok
+test_forged_pass_without_process_logs_is_refused (test_cbz_baseline.BaselineTests.test_forged_pass_without_process_logs_is_refused) ... ok
+test_live_proof_tamper_fails (test_cbz_baseline.BaselineTests.test_live_proof_tamper_fails) ... ok
+test_missing_offline_dependency_is_incomplete (test_cbz_baseline.BaselineTests.test_missing_offline_dependency_is_incomplete) ... ok
+test_missing_receipts_are_incomplete_never_green (test_cbz_baseline.BaselineTests.test_missing_receipts_are_incomplete_never_green) ... ok
+test_offline_pin_object_and_manifest_checked (test_cbz_baseline.BaselineTests.test_offline_pin_object_and_manifest_checked) ... ok
+test_output_inside_source_root_refused (test_cbz_baseline.BaselineTests.test_output_inside_source_root_refused) ... ok
+test_receipt_log_tampering_is_refused (test_cbz_baseline.BaselineTests.test_receipt_log_tampering_is_refused) ... ok
+test_receipts_bind_actual_execution_and_stale_source_is_refused (test_cbz_baseline.BaselineTests.test_receipts_bind_actual_execution_and_stale_source_is_refused) ... ok
+test_timeout_is_recorded_incomplete (test_cbz_baseline.BaselineTests.test_timeout_is_recorded_incomplete) ... ok
+test_unknown_proof_status_refused (test_cbz_baseline.BaselineTests.test_unknown_proof_status_refused) ... ok
+test_unlisted_mission_tool_refused (test_cbz_baseline.BaselineTests.test_unlisted_mission_tool_refused) ... ok
+test_all_same_named_true_witnesses_rejected (test_cbz_lean_check.CensusProtocolTests.test_all_same_named_true_witnesses_rejected) ... ok
+test_audit_generator_refuses_missing_or_duplicate_boundary (test_cbz_lean_check.CensusProtocolTests.test_audit_generator_refuses_missing_or_duplicate_boundary) ... ok
+test_audit_generator_refuses_module_injection (test_cbz_lean_check.CensusProtocolTests.test_audit_generator_refuses_module_injection) ... ok
+test_changed_known_finite_premise_rejected (test_cbz_lean_check.CensusProtocolTests.test_changed_known_finite_premise_rejected) ... ok
+test_definition_not_promoted_to_proof (test_cbz_lean_check.CensusProtocolTests.test_definition_not_promoted_to_proof) ... ok
+test_duplicate_declaration_rejected (test_cbz_lean_check.CensusProtocolTests.test_duplicate_declaration_rejected) ... ok
+test_duplicate_json_key_rejected (test_cbz_lean_check.CensusProtocolTests.test_duplicate_json_key_rejected) ... ok
+test_each_weakened_witness_type_rejected (test_cbz_lean_check.CensusProtocolTests.test_each_weakened_witness_type_rejected) ... ok
+test_exact_witness_types_accepted (test_cbz_lean_check.CensusProtocolTests.test_exact_witness_types_accepted) ... ok
+test_false_premise_not_promoted (test_cbz_lean_check.CensusProtocolTests.test_false_premise_not_promoted) ... ok
+test_forged_count_and_missing_module_rejected (test_cbz_lean_check.CensusProtocolTests.test_forged_count_and_missing_module_rejected) ... ok
+test_honest_theorem_accepted (test_cbz_lean_check.CensusProtocolTests.test_honest_theorem_accepted) ... ok
+test_known_finite_premise_retained (test_cbz_lean_check.CensusProtocolTests.test_known_finite_premise_retained) ... ok
+test_missing_end_or_unknown_line_rejected (test_cbz_lean_check.CensusProtocolTests.test_missing_end_or_unknown_line_rejected) ... ok
+test_missing_target_rejected (test_cbz_lean_check.CensusProtocolTests.test_missing_target_rejected) ... ok
+test_partial_membership_witness_rejected (test_cbz_lean_check.CensusProtocolTests.test_partial_membership_witness_rejected) ... ok
+test_project_axiom_declaration_rejected (test_cbz_lean_check.CensusProtocolTests.test_project_axiom_declaration_rejected) ... ok
+test_unused_definition_with_custom_axiom_rejected (test_cbz_lean_check.CensusProtocolTests.test_unused_definition_with_custom_axiom_rejected) ... ok
+test_witness_contract_import_injection_rejected (test_cbz_lean_check.CensusProtocolTests.test_witness_contract_import_injection_rejected) ... ok
+test_actual_tag_fetch_rejects_forged_advertised_readback (test_cbz_refs.RefSafetyTests.test_actual_tag_fetch_rejects_forged_advertised_readback) ... ok
+test_archive_has_unique_parents_exact_manifest_and_recoverable_content (test_cbz_refs.RefSafetyTests.test_archive_has_unique_parents_exact_manifest_and_recoverable_content) ... ok
+test_archive_head_must_be_detached_at_archive_commit (test_cbz_refs.RefSafetyTests.test_archive_head_must_be_detached_at_archive_commit) ... ok
+test_cli_default_json_does_not_create_snapshot (test_cbz_refs.RefSafetyTests.test_cli_default_json_does_not_create_snapshot) ... ok
+test_credential_urls_rejected_without_echoing_secret (test_cbz_refs.RefSafetyTests.test_credential_urls_rejected_without_echoing_secret) ... ok
+test_default_branch_change_refuses_prune (test_cbz_refs.RefSafetyTests.test_default_branch_change_refuses_prune) ... ok
+test_default_is_read_only_machine_plan (test_cbz_refs.RefSafetyTests.test_default_is_read_only_machine_plan) ... ok
+test_existing_output_and_tag_are_never_overwritten (test_cbz_refs.RefSafetyTests.test_existing_output_and_tag_are_never_overwritten) ... ok
+test_fetch_race_removes_partial_output_and_keeps_remote_work (test_cbz_refs.RefSafetyTests.test_fetch_race_removes_partial_output_and_keeps_remote_work) ... ok
+test_final_readback_rejects_changes_instead_of_partial_success (test_cbz_refs.RefSafetyTests.test_final_readback_rejects_changes_instead_of_partial_success) ... ok
+test_finished_archive_retains_no_original_branch_refs (test_cbz_refs.RefSafetyTests.test_finished_archive_retains_no_original_branch_refs) ... ok
+test_invalid_ref_names_are_refused (test_cbz_refs.RefSafetyTests.test_invalid_ref_names_are_refused) ... ok
+test_lease_rejects_branch_changed_after_final_preflight_atomically (test_cbz_refs.RefSafetyTests.test_lease_rejects_branch_changed_after_final_preflight_atomically) ... ok
+test_local_archive_tree_tampering_is_detected (test_cbz_refs.RefSafetyTests.test_local_archive_tree_tampering_is_detected) ... ok
+test_missing_original_annotated_tag_ref_is_rejected_before_gc (test_cbz_refs.RefSafetyTests.test_missing_original_annotated_tag_ref_is_rejected_before_gc) ... ok
+test_moved_original_branch_refuses_all_deletions (test_cbz_refs.RefSafetyTests.test_moved_original_branch_refuses_all_deletions) ... ok
+test_prune_requires_actual_remote_archive_readback (test_cbz_refs.RefSafetyTests.test_prune_requires_actual_remote_archive_readback) ... ok
+test_publish_then_atomic_prune_preserves_default_policy_and_tag (test_cbz_refs.RefSafetyTests.test_publish_then_atomic_prune_preserves_default_policy_and_tag) ... ok
+test_receipt_hash_tampering_is_detected (test_cbz_refs.RefSafetyTests.test_receipt_hash_tampering_is_detected) ... ok
+test_remote_inventory_does_not_spawn_one_git_process_per_ref (test_cbz_refs.RefSafetyTests.test_remote_inventory_does_not_spawn_one_git_process_per_ref) ... ok
+test_server_rejection_is_atomic_and_never_silent_success (test_cbz_refs.RefSafetyTests.test_server_rejection_is_atomic_and_never_silent_success) ... ok
+test_source_index_and_worktrees_untouched (test_cbz_refs.RefSafetyTests.test_source_index_and_worktrees_untouched) ... ok
+test_tag_only_blob_and_tree_refs_are_required_even_before_gc (test_cbz_refs.RefSafetyTests.test_tag_only_blob_and_tree_refs_are_required_even_before_gc) ... ok
+test_tampered_manifest_fails_before_remote_mutation (test_cbz_refs.RefSafetyTests.test_tampered_manifest_fails_before_remote_mutation) ... ok
+test_unexpected_archive_head_or_tag_is_rejected (test_cbz_refs.RefSafetyTests.test_unexpected_archive_head_or_tag_is_rejected) ... ok
+test_unexpected_new_ref_refuses_all_deletions (test_cbz_refs.RefSafetyTests.test_unexpected_new_ref_refuses_all_deletions) ... ok
+test_already_shared_inodes_not_planned (test_cbz_storage.StorageTests.test_already_shared_inodes_not_planned) ... ok
+test_archive_selection_excludes_mutable_small_symlink_and_caches (test_cbz_storage.StorageTests.test_archive_selection_excludes_mutable_small_symlink_and_caches) ... ok
+test_changed_input_refused_before_link (test_cbz_storage.StorageTests.test_changed_input_refused_before_link) ... ok
+test_cli_tampered_sha_refused_without_mutation (test_cbz_storage.StorageTests.test_cli_tampered_sha_refused_without_mutation) ... ok
+test_distinct_xattr_same_bytes_modes_owners_refused (test_cbz_storage.StorageTests.test_distinct_xattr_same_bytes_modes_owners_refused) ... ok
+test_forged_escape_and_operations_refused (test_cbz_storage.StorageTests.test_forged_escape_and_operations_refused) ... ok
+test_mode_mismatch_excluded (test_cbz_storage.StorageTests.test_mode_mismatch_excluded) ... ok
+test_race_before_replace_refused_and_temp_removed (test_cbz_storage.StorageTests.test_race_before_replace_refused_and_temp_removed) ... ok
+test_race_symlink_refused (test_cbz_storage.StorageTests.test_race_symlink_refused) ... ok
+test_real_apply_preserves_bytes_modes_and_idempotence (test_cbz_storage.StorageTests.test_real_apply_preserves_bytes_modes_and_idempotence) ... ok
+test_symlinks_excluded_and_ancestor_refused (test_cbz_storage.StorageTests.test_symlinks_excluded_and_ancestor_refused) ... ok
+test_xattr_added_before_replace_refused (test_cbz_storage.StorageTests.test_xattr_added_before_replace_refused) ... ok
+test_xattr_enumeration_failure_refused (test_cbz_storage.StorageTests.test_xattr_enumeration_failure_refused) ... ok
+test_commit_must_be_exact_full_existing_commit (test_coordination_lock_check.CoordinationLockTests.test_commit_must_be_exact_full_existing_commit) ... ok
+test_different_owner_is_conflict (test_coordination_lock_check.CoordinationLockTests.test_different_owner_is_conflict) ... ok
+test_dirty_tree_replacement_is_ignored (test_coordination_lock_check.CoordinationLockTests.test_dirty_tree_replacement_is_ignored) ... ok
+test_duplicate_keys_and_invalid_json_hold (test_coordination_lock_check.CoordinationLockTests.test_duplicate_keys_and_invalid_json_hold) ... ok
+test_freshness_window_boundary_is_observation_only (test_coordination_lock_check.CoordinationLockTests.test_freshness_window_boundary_is_observation_only) ... ok
+test_future_observation_is_unknown_and_hold (test_coordination_lock_check.CoordinationLockTests.test_future_observation_is_unknown_and_hold) ... ok
+test_git_blob_replacement_cannot_substitute_null_owner (test_coordination_lock_check.CoordinationLockTests.test_git_blob_replacement_cannot_substitute_null_owner) ... ok
+test_git_environment_cannot_redirect_source (test_coordination_lock_check.CoordinationLockTests.test_git_environment_cannot_redirect_source) ... ok
+test_malformed_record_fields_and_refresh_errors_hold (test_coordination_lock_check.CoordinationLockTests.test_malformed_record_fields_and_refresh_errors_hold) ... ok
+test_matching_owner_reports_exact_pinned_source_and_age_without_authority (test_coordination_lock_check.CoordinationLockTests.test_matching_owner_reports_exact_pinned_source_and_age_without_authority) ... ok
+test_missing_blob_is_hold (test_coordination_lock_check.CoordinationLockTests.test_missing_blob_is_hold) ... ok
+test_missing_input_and_stops_are_preserved_and_hold (test_coordination_lock_check.CoordinationLockTests.test_missing_input_and_stops_are_preserved_and_hold) ... ok
+test_missing_or_blank_claimant_is_observe_only (test_coordination_lock_check.CoordinationLockTests.test_missing_or_blank_claimant_is_observe_only) ... ok
+test_missing_record_is_hold (test_coordination_lock_check.CoordinationLockTests.test_missing_record_is_hold) ... ok
+test_nonregular_blob_is_refused (test_coordination_lock_check.CoordinationLockTests.test_nonregular_blob_is_refused) ... ok
+test_null_owner_is_hold (test_coordination_lock_check.CoordinationLockTests.test_null_owner_is_hold) ... ok
+test_numeric_parse_anomalies_are_blocked_before_raw_fields_are_reported (test_coordination_lock_check.CoordinationLockTests.test_numeric_parse_anomalies_are_blocked_before_raw_fields_are_reported) ... ok
+test_oversize_blob_is_hold (test_coordination_lock_check.CoordinationLockTests.test_oversize_blob_is_hold) ... ok
+test_record_node_identity_must_match_map_key (test_coordination_lock_check.CoordinationLockTests.test_record_node_identity_must_match_map_key) ... ok
+test_recorded_stale_and_unknown_hold_even_when_recent (test_coordination_lock_check.CoordinationLockTests.test_recorded_stale_and_unknown_hold_even_when_recent) ... ok
+test_release_url_preserves_owner_and_requires_explicit_handoff (test_coordination_lock_check.CoordinationLockTests.test_release_url_preserves_owner_and_requires_explicit_handoff) ... ok
+test_repeated_matching_pickups_never_manufacture_authority_or_write (test_coordination_lock_check.CoordinationLockTests.test_repeated_matching_pickups_never_manufacture_authority_or_write) ... ok
+test_runtime_clock_is_current_utc_when_now_is_omitted (test_coordination_lock_check.CoordinationLockTests.test_runtime_clock_is_current_utc_when_now_is_omitted) ... ok
+test_source_revision_identity_mismatch_holds (test_coordination_lock_check.CoordinationLockTests.test_source_revision_identity_mismatch_holds) ... ok
+test_stale_age_holds_without_expiring_owner (test_coordination_lock_check.CoordinationLockTests.test_stale_age_holds_without_expiring_owner) ... ok
+test_times_require_real_strict_utc (test_coordination_lock_check.CoordinationLockTests.test_times_require_real_strict_utc) ... ok
+test_unknown_schema_and_extra_fields_hold (test_coordination_lock_check.CoordinationLockTests.test_unknown_schema_and_extra_fields_hold) ... ok
+test_wrong_remote_holds_before_reading_record (test_coordination_lock_check.CoordinationLockTests.test_wrong_remote_holds_before_reading_record) ... ok
+test_shared_projection_cases (test_current_inventory_acquisition.AcquisitionConformance.test_shared_projection_cases) ... ok
+test_any_bad_association_removes_every_positive_label_in_current_output (test_current_inventory_acquisition.InventoryPresentation.test_any_bad_association_removes_every_positive_label_in_current_output) ... ok
+test_current_rows_explain_content_scope_and_escape_source_labels (test_current_inventory_acquisition.InventoryPresentation.test_current_rows_explain_content_scope_and_escape_source_labels) ... ok
+test_date_objects_have_separate_meanings_and_no_invented_classification_date (test_current_inventory_acquisition.InventoryPresentation.test_date_objects_have_separate_meanings_and_no_invented_classification_date) ... ok
+test_exact_predecessor_maps_restore_but_one_changed_descriptor_refuses_all_writes (test_current_inventory_acquisition.InventoryPresentation.test_exact_predecessor_maps_restore_but_one_changed_descriptor_refuses_all_writes) ... ok
+test_live_static_index_uses_same_annotations_and_keeps_unresolved_node (test_current_inventory_acquisition.InventoryPresentation.test_live_static_index_uses_same_annotations_and_keeps_unresolved_node) ... ok
+test_pre_resume_annotated_live_output_stays_byte_exact_for_both_style_orders (test_current_inventory_acquisition.InventoryPresentation.test_pre_resume_annotated_live_output_stays_byte_exact_for_both_style_orders) ... ok
+test_predecessor_live_output_stays_byte_exact_for_both_style_orders (test_current_inventory_acquisition.InventoryPresentation.test_predecessor_live_output_stays_byte_exact_for_both_style_orders) ... ok
+test_missing_and_malformed_source_write_failure_report (test_current_site_browser_contract.BrowserReportFailureTests.test_missing_and_malformed_source_write_failure_report) ... ok
+test_published_overlay_and_snapshot_only_static_reading_have_separate_exact_expectations (test_current_site_browser_contract.ResumeContractTests.test_published_overlay_and_snapshot_only_static_reading_have_separate_exact_expectations) ... ok
+test_wrong_shared_fields_phantom_links_and_false_operational_state_are_refused (test_current_site_browser_contract.ResumeContractTests.test_wrong_shared_fields_phantom_links_and_false_operational_state_are_refused) ... ok
+test_default_full_and_archived_source_sections_retain_baseline_bytes (test_current_site_build.CurrentSiteBuildTests.test_default_full_and_archived_source_sections_retain_baseline_bytes) ... ok
+test_equation_digest_binds_the_exact_text_instead_of_only_digest_format (test_current_site_build.CurrentSiteBuildTests.test_equation_digest_binds_the_exact_text_instead_of_only_digest_format) ... ok
+test_every_node_has_static_evidence_metadata_and_typed_neighbor_navigation (test_current_site_build.CurrentSiteBuildTests.test_every_node_has_static_evidence_metadata_and_typed_neighbor_navigation) ... ok
+test_formal_remains_script_free_when_research_has_age_updates (test_current_site_build.CurrentSiteBuildTests.test_formal_remains_script_free_when_research_has_age_updates) ... ok
+test_hostile_metadata_is_inert_and_research_uses_only_the_shared_loader (test_current_site_build.CurrentSiteBuildTests.test_hostile_metadata_is_inert_and_research_uses_only_the_shared_loader) ... ok
+test_incomplete_existing_snapshot_is_refused_without_filling_missing_pages (test_current_site_build.CurrentSiteBuildTests.test_incomplete_existing_snapshot_is_refused_without_filling_missing_pages) ... ok
+test_invalid_payload_or_missing_marker_fails_before_any_site_write (test_current_site_build.CurrentSiteBuildTests.test_invalid_payload_or_missing_marker_fails_before_any_site_write) ... ok
+test_known_snapshot_is_not_rewritten_after_asset_release_and_conflicts_refuse_before_writes (test_current_site_build.CurrentSiteBuildTests.test_known_snapshot_is_not_rewritten_after_asset_release_and_conflicts_refuse_before_writes) ... ok
+test_live_node_pages_resume_from_recorded_review_without_inventing_task_state (test_current_site_build.CurrentSiteBuildTests.test_live_node_pages_resume_from_recorded_review_without_inventing_task_state) ... ok
+test_main_pages_keep_dated_status_before_closed_sources_and_scope (test_current_site_build.CurrentSiteBuildTests.test_main_pages_keep_dated_status_before_closed_sources_and_scope) ... ok
+test_non_directory_node_destination_is_refused_before_any_write (test_current_site_build.CurrentSiteBuildTests.test_non_directory_node_destination_is_refused_before_any_write) ... ok
+test_removed_and_renamed_nodes_keep_their_snapshot_and_source_bound_aliases (test_current_site_build.CurrentSiteBuildTests.test_removed_and_renamed_nodes_keep_their_snapshot_and_source_bound_aliases) ... ok
+test_repeated_large_source_references_are_refused_before_static_rendering (test_current_site_build.CurrentSiteBuildTests.test_repeated_large_source_references_are_refused_before_static_rendering) ... ok
+test_research_template_allows_the_same_origin_current_module (test_current_site_build.CurrentSiteBuildTests.test_research_template_allows_the_same_origin_current_module) ... ok
+test_script_blocked_research_refuses_before_any_site_write (test_current_site_build.CurrentSiteBuildTests.test_script_blocked_research_refuses_before_any_site_write) ... ok
+test_source_links_only_resolve_the_exact_math_inventory_and_external_links_stay_separate (test_current_site_build.CurrentSiteBuildTests.test_source_links_only_resolve_the_exact_math_inventory_and_external_links_stay_separate) ... ok
+test_two_offline_builds_are_identical_and_preserve_historical_bytes (test_current_site_build.CurrentSiteBuildTests.test_two_offline_builds_are_identical_and_preserve_historical_bytes) ... ok
+test_unknown_nested_zip_cannot_hide_in_an_unregistered_snapshot (test_current_site_build.CurrentSiteBuildTests.test_unknown_nested_zip_cannot_hide_in_an_unregistered_snapshot) ... ok
+test_absent_equations_stay_absent_instead_of_being_invented (test_current_site_data.CurrentSiteDataTests.test_absent_equations_stay_absent_instead_of_being_invented) ... ok
+test_complete_observation_preserves_graph_and_exact_equation_lines (test_current_site_data.CurrentSiteDataTests.test_complete_observation_preserves_graph_and_exact_equation_lines) ... ok
+test_dangling_contextual_edge_is_refused (test_current_site_data.CurrentSiteDataTests.test_dangling_contextual_edge_is_refused) ... ok
+test_default_ref_is_resolved_once_and_all_reads_are_immutable (test_current_site_data.CurrentSiteDataTests.test_default_ref_is_resolved_once_and_all_reads_are_immutable) ... ok
+test_duplicate_tree_paths_are_refused (test_current_site_data.CurrentSiteDataTests.test_duplicate_tree_paths_are_refused) ... ok
+test_explicit_commit_response_must_match_the_requested_pin (test_current_site_data.CurrentSiteDataTests.test_explicit_commit_response_must_match_the_requested_pin) ... ok
+test_explicit_pins_do_not_resolve_a_moving_default_ref (test_current_site_data.CurrentSiteDataTests.test_explicit_pins_do_not_resolve_a_moving_default_ref) ... ok
+test_failed_refresh_preserves_existing_output (test_current_site_data.CurrentSiteDataTests.test_failed_refresh_preserves_existing_output) ... ok
+test_hostile_formula_text_is_kept_inert_and_byte_exact (test_current_site_data.CurrentSiteDataTests.test_hostile_formula_text_is_kept_inert_and_byte_exact) ... ok
+test_invalid_explicit_commit_is_refused_without_reads (test_current_site_data.CurrentSiteDataTests.test_invalid_explicit_commit_is_refused_without_reads) ... ok
+test_invalid_observation_time_is_refused_before_network_reads (test_current_site_data.CurrentSiteDataTests.test_invalid_observation_time_is_refused_before_network_reads) ... ok
+test_inventory_includes_new_public_sources_and_omits_operational_copies (test_current_site_data.CurrentSiteDataTests.test_inventory_includes_new_public_sources_and_omits_operational_copies) ... ok
+test_malformed_graph_is_refused (test_current_site_data.CurrentSiteDataTests.test_malformed_graph_is_refused) ... ok
+test_missing_graph_fields_are_refused_without_inference (test_current_site_data.CurrentSiteDataTests.test_missing_graph_fields_are_refused_without_inference) ... ok
+test_missing_or_nonboolean_required_field_is_refused (test_current_site_data.CurrentSiteDataTests.test_missing_or_nonboolean_required_field_is_refused) ... ok
+test_missing_truncation_marker_is_refused (test_current_site_data.CurrentSiteDataTests.test_missing_truncation_marker_is_refused) ... ok
+test_missing_typed_node_metadata_refuses_current_export (test_current_site_data.CurrentSiteDataTests.test_missing_typed_node_metadata_refuses_current_export) ... ok
+test_multiline_equations_retain_internal_blank_lines_and_final_line (test_current_site_data.CurrentSiteDataTests.test_multiline_equations_retain_internal_blank_lines_and_final_line) ... ok
+test_network_reader_bounds_requests_and_keeps_token_out_of_raw_reads (test_current_site_data.CurrentSiteDataTests.test_network_reader_bounds_requests_and_keeps_token_out_of_raw_reads) ... ok
+test_network_reader_rejects_nonpublic_hosts_and_repository_paths (test_current_site_data.CurrentSiteDataTests.test_network_reader_rejects_nonpublic_hosts_and_repository_paths) ... ok
+test_network_reader_rejects_oversize_and_duplicate_json (test_current_site_data.CurrentSiteDataTests.test_network_reader_rejects_oversize_and_duplicate_json) ... ok
+test_omitted_tree_entry_is_refused_even_when_not_marked_truncated (test_current_site_data.CurrentSiteDataTests.test_omitted_tree_entry_is_refused_even_when_not_marked_truncated) ... ok
+test_required_cycle_is_refused_but_contextual_cycle_is_preserved (test_current_site_data.CurrentSiteDataTests.test_required_cycle_is_refused_but_contextual_cycle_is_preserved) ... ok
+test_required_equation_source_missing_from_a_valid_tree_is_refused (test_current_site_data.CurrentSiteDataTests.test_required_equation_source_missing_from_a_valid_tree_is_refused) ... ok
+test_required_source_missing_from_a_valid_tree_is_refused (test_current_site_data.CurrentSiteDataTests.test_required_source_missing_from_a_valid_tree_is_refused) ... ok
+test_successful_refresh_writes_valid_json_with_no_temporary_files (test_current_site_data.CurrentSiteDataTests.test_successful_refresh_writes_valid_json_with_no_temporary_files) ... ok
+test_tree_identity_mismatch_is_refused (test_current_site_data.CurrentSiteDataTests.test_tree_identity_mismatch_is_refused) ... ok
+test_truncated_tree_is_refused (test_current_site_data.CurrentSiteDataTests.test_truncated_tree_is_refused) ... ok
+test_unsafe_tree_paths_are_refused (test_current_site_data.CurrentSiteDataTests.test_unsafe_tree_paths_are_refused) ... ok
+test_wrong_blob_bytes_at_the_correct_size_are_refused (test_current_site_data.CurrentSiteDataTests.test_wrong_blob_bytes_at_the_correct_size_are_refused) ... ok
+test_wrong_source_size_is_refused (test_current_site_data.CurrentSiteDataTests.test_wrong_source_size_is_refused) ... ok
+test_bootstrap_uses_remote_legacy_absence_and_never_ignores_a_published_pointer (test_current_site_history.CurrentSiteHistoryTests.test_bootstrap_uses_remote_legacy_absence_and_never_ignores_a_published_pointer) ... ok
+test_capacity_warning_is_visible_at_75_percent_and_full_capacity_refuses_writes (test_current_site_history.CurrentSiteHistoryTests.test_capacity_warning_is_visible_at_75_percent_and_full_capacity_refuses_writes) ... ok
+test_closed_manifest_and_capacity_controls_refuse_before_download_or_write (test_current_site_history.CurrentSiteHistoryTests.test_closed_manifest_and_capacity_controls_refuse_before_download_or_write) ... ok
+test_commit_and_unrelated_inventory_movement_do_not_create_mathematical_versions (test_current_site_history.CurrentSiteHistoryTests.test_commit_and_unrelated_inventory_movement_do_not_create_mathematical_versions) ... ok
+test_equivalent_sources_reuse_the_exact_prior_archive_and_refresh_current_observation (test_current_site_history.CurrentSiteHistoryTests.test_equivalent_sources_reuse_the_exact_prior_archive_and_refresh_current_observation) ... ok
+test_expected_manifest_pin_refuses_cached_self_consistent_history_before_any_write (test_current_site_history.CurrentSiteHistoryTests.test_expected_manifest_pin_refuses_cached_self_consistent_history_before_any_write) ... ok
+test_failed_late_download_leaves_the_entire_runner_unchanged (test_current_site_history.CurrentSiteHistoryTests.test_failed_late_download_leaves_the_entire_runner_unchanged) ... ok
+test_history_reader_retries_transient_503_then_200 (test_current_site_history.CurrentSiteHistoryTests.test_history_reader_retries_transient_503_then_200) ... ok
+test_live_alias_digest_and_visible_material_must_match_fresh_current_payload (test_current_site_history.CurrentSiteHistoryTests.test_live_alias_digest_and_visible_material_must_match_fresh_current_payload) ... ok
+test_local_unknown_metadata_cannot_publish_an_unreadable_public_observation (test_current_site_history.CurrentSiteHistoryTests.test_local_unknown_metadata_cannot_publish_an_unreadable_public_observation) ... ok
+test_production_reader_allows_exact_live_payload_with_bounded_request_count (test_current_site_history.CurrentSiteHistoryTests.test_production_reader_allows_exact_live_payload_with_bounded_request_count) ... ok
+test_publication_and_restore_retain_removed_aliases_on_a_fresh_runner (test_current_site_history.CurrentSiteHistoryTests.test_publication_and_restore_retain_removed_aliases_on_a_fresh_runner) ... ok
+test_reader_only_requests_fixed_origin_without_credentials_redirects_or_unbounded_reads (test_current_site_history.CurrentSiteHistoryTests.test_reader_only_requests_fixed_origin_without_credentials_redirects_or_unbounded_reads) ... ok
+test_restored_ledger_forbids_bootstrap_and_stale_manifest_history_loss (test_current_site_history.CurrentSiteHistoryTests.test_restored_ledger_forbids_bootstrap_and_stale_manifest_history_loss) ... ok
+test_retained_material_changes_create_versions_and_projection_is_limited (test_current_site_history.CurrentSiteHistoryTests.test_retained_material_changes_create_versions_and_projection_is_limited) ... ok
+test_reviewed_local_candidate_history_is_merged_with_published_history (test_current_site_history.CurrentSiteHistoryTests.test_reviewed_local_candidate_history_is_merged_with_published_history) ... ok
+test_union_of_retained_aliases_cannot_be_omitted_from_a_fresh_restore (test_current_site_history.CurrentSiteHistoryTests.test_union_of_retained_aliases_cannot_be_omitted_from_a_fresh_restore) ... ok
+test_v1_archives_remain_byte_exact_through_v2_refresh_and_fresh_restore (test_current_site_history.CurrentSiteHistoryTests.test_v1_archives_remain_byte_exact_through_v2_refresh_and_fresh_restore) ... ok
+test_v1_publication_can_restore_into_a_reviewed_v2_candidate_checkout (test_current_site_history.CurrentSiteHistoryTests.test_v1_publication_can_restore_into_a_reviewed_v2_candidate_checkout) ... ok
+test_v2_archive_admission_survives_later_current_validator_and_renderer_changes (test_current_site_history.CurrentSiteHistoryTests.test_v2_archive_admission_survives_later_current_validator_and_renderer_changes) ... ok
+test_zip_path_duplicates_active_markup_missing_members_and_symlinks_are_refused (test_current_site_history.CurrentSiteHistoryTests.test_zip_path_duplicates_active_markup_missing_members_and_symlinks_are_refused) ... ok
+test_active_supersession_cannot_use_missing_boolean_or_free_no_start_eligibility (test_current_site_native_base.CurrentSiteNativeBaseContract.test_active_supersession_cannot_use_missing_boolean_or_free_no_start_eligibility) ... ok
+test_actual_git_parent_must_equal_original_receipt_previous_pointer (test_current_site_native_base.CurrentSiteNativeBaseContract.test_actual_git_parent_must_equal_original_receipt_previous_pointer) ... ok
+test_anchor_objects_must_match_authenticated_original_receipts (test_current_site_native_base.CurrentSiteNativeBaseContract.test_anchor_objects_must_match_authenticated_original_receipts) ... ok
+test_base_fields_are_recomputed_from_authenticated_effective_anchor (test_current_site_native_base.CurrentSiteNativeBaseContract.test_base_fields_are_recomputed_from_authenticated_effective_anchor) ... ok
+test_closed_base_plan_qualification_and_proof_schemas (test_current_site_native_base.CurrentSiteNativeBaseContract.test_closed_base_plan_qualification_and_proof_schemas) ... ok
+test_cyclic_pointer_tamper_is_rejected_without_claiming_valid_git_cycle (test_current_site_native_base.CurrentSiteNativeBaseContract.test_cyclic_pointer_tamper_is_rejected_without_claiming_valid_git_cycle) ... ok
+test_disconnected_valid_public_record_cannot_substitute_for_reachable_public_base (test_current_site_native_base.CurrentSiteNativeBaseContract.test_disconnected_valid_public_record_cannot_substitute_for_reachable_public_base) ... ok
+test_existing_raw_plus_one_lf_commit_form_is_accepted (test_current_site_native_base.CurrentSiteNativeBaseContract.test_existing_raw_plus_one_lf_commit_form_is_accepted) ... ok
+test_existing_reader_accepts_differently_worded_bounded_commit_message (test_current_site_native_base.CurrentSiteNativeBaseContract.test_existing_reader_accepts_differently_worded_bounded_commit_message) ... ok
+test_f2r_no_start_outer_64_repeated_native_hash_references_are_accepted (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2r_no_start_outer_64_repeated_native_hash_references_are_accepted) ... ok
+test_f2r_no_start_outer_singleton_native_response_hash_is_accepted (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2r_no_start_outer_singleton_native_response_hash_is_accepted) ... ok
+test_f2r_repeated_pending_jobs_page_observation_is_accepted_and_fully_charged (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2r_repeated_pending_jobs_page_observation_is_accepted_and_fully_charged) ... ok
+test_f2x_complete_current_no_start_accepts_legacy_and_native_public_targets (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_complete_current_no_start_accepts_legacy_and_native_public_targets) ... ok
+test_f2x_complete_no_start_nested_objects_are_closed_not_free_eligibility (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_complete_no_start_nested_objects_are_closed_not_free_eligibility) ... ok
+test_f2x_equal_B_C_source_response_hashes_do_not_replace_four_locator_joins (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_equal_B_C_source_response_hashes_do_not_replace_four_locator_joins) ... ok
+test_f2x_no_start_cannot_be_attached_to_an_unrelated_operation (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_no_start_cannot_be_attached_to_an_unrelated_operation) ... ok
+test_f2x_no_start_contents_hash_vector_requires_exact_four_joined_responses (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_no_start_contents_hash_vector_requires_exact_four_joined_responses) ... ok
+test_f2x_no_start_does_not_automatically_supersede_same_source_pending (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_no_start_does_not_automatically_supersede_same_source_pending) ... ok
+test_f2x_no_start_job_identity_attempt_and_failure_terminal_state_must_join (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_no_start_job_identity_attempt_and_failure_terminal_state_must_join) ... ok
+test_f2x_no_start_native_response_hashes_are_bounded_and_join_recorded_sources (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_no_start_native_response_hashes_are_bounded_and_join_recorded_sources) ... ok
+test_f2x_no_start_optional_timestamps_are_real_native_UTC_or_null (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_no_start_optional_timestamps_are_real_native_UTC_or_null) ... ok
+test_f2x_no_start_pending_source_and_protocol_commit_joins_are_exact (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_no_start_pending_source_and_protocol_commit_joins_are_exact) ... ok
+test_f2x_no_start_protocol_paths_body_hashes_and_git_blob_pins_must_join (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_no_start_protocol_paths_body_hashes_and_git_blob_pins_must_join) ... ok
+test_f2x_no_start_requires_B_and_C_contents_locators_even_when_body_hashes_repeat (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_no_start_requires_B_and_C_contents_locators_even_when_body_hashes_repeat) ... ok
+test_f2x_no_start_run_identity_attempt_and_failure_terminal_state_must_join (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_no_start_run_identity_attempt_and_failure_terminal_state_must_join) ... ok
+test_f2x_no_start_source_and_pending_routes_cannot_change_ref_run_attempt_or_page (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_no_start_source_and_pending_routes_cannot_change_ref_run_attempt_or_page) ... ok
+test_f2x_no_start_source_body_cap_applies_even_with_recomputed_source_pins (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_no_start_source_body_cap_applies_even_with_recomputed_source_pins) ... ok
+test_f2x_no_start_steps_require_fixed_names_order_and_exact_completed_results (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_no_start_steps_require_fixed_names_order_and_exact_completed_results) ... ok
+test_f2x_observed_recovery_bridge_cannot_retain_an_older_unserved_public_pointer (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_observed_recovery_bridge_cannot_retain_an_older_unserved_public_pointer) ... ok
+test_f2x_one_captured_base_unstarted_supersession_bridge_is_accepted (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_one_captured_base_unstarted_supersession_bridge_is_accepted) ... ok
+test_f2x_ordinary_observed_child_cannot_replace_unstarted_supersession_bridge (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_ordinary_observed_child_cannot_replace_unstarted_supersession_bridge) ... ok
+test_f2x_superseded_bridge_conserves_the_entire_captured_prepared_candidate (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_superseded_bridge_conserves_the_entire_captured_prepared_candidate) ... ok
+test_f2x_superseded_bridge_needs_its_original_reconciliation_record (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_superseded_bridge_needs_its_original_reconciliation_record) ... ok
+test_f2x_two_children_do_not_expand_the_single_superseded_bridge_rule (test_current_site_native_base.CurrentSiteNativeBaseContract.test_f2x_two_children_do_not_expand_the_single_superseded_bridge_rule) ... ok
+test_initial_absence_returns_exact_six_key_verified_base (test_current_site_native_base.CurrentSiteNativeBaseContract.test_initial_absence_returns_exact_six_key_verified_base) ... ok
+test_legacy_public_anchor_needs_no_unrelated_historical_parent_record (test_current_site_native_base.CurrentSiteNativeBaseContract.test_legacy_public_anchor_needs_no_unrelated_historical_parent_record) ... ok
+test_metadata_descriptor_rejects_url_capability_and_unbounded_response (test_current_site_native_base.CurrentSiteNativeBaseContract.test_metadata_descriptor_rejects_url_capability_and_unbounded_response) ... ok
+test_migration_and_initial_absence_require_exact_404_zero_null_rows (test_current_site_native_base.CurrentSiteNativeBaseContract.test_migration_and_initial_absence_require_exact_404_zero_null_rows) ... ok
+test_missing_captured_base_recovery_bridge_record_is_rejected (test_current_site_native_base.CurrentSiteNativeBaseContract.test_missing_captured_base_recovery_bridge_record_is_rejected) ... ok
+test_missing_intermediate_captured_superseded_base_is_rejected (test_current_site_native_base.CurrentSiteNativeBaseContract.test_missing_intermediate_captured_superseded_base_is_rejected) ... ok
+test_missing_prepared_record_cannot_be_replaced_by_pointer_and_digest (test_current_site_native_base.CurrentSiteNativeBaseContract.test_missing_prepared_record_cannot_be_replaced_by_pointer_and_digest) ... ok
+test_more_than_seventeen_original_records_is_rejected (test_current_site_native_base.CurrentSiteNativeBaseContract.test_more_than_seventeen_original_records_is_rejected) ... ok
+test_more_than_sixteen_distinct_material_edges_is_rejected (test_current_site_native_base.CurrentSiteNativeBaseContract.test_more_than_sixteen_distinct_material_edges_is_rejected) ... ok
+test_native_anchor_must_equal_fresh_fixed_ref_anchor (test_current_site_native_base.CurrentSiteNativeBaseContract.test_native_anchor_must_equal_fresh_fixed_ref_anchor) ... ok
+test_native_public_anchor_pins_exact_original_registry (test_current_site_native_base.CurrentSiteNativeBaseContract.test_native_public_anchor_pins_exact_original_registry) ... ok
+test_native_registry_is_required_pinned_and_not_replaced_by_normalization (test_current_site_native_base.CurrentSiteNativeBaseContract.test_native_registry_is_required_pinned_and_not_replaced_by_normalization) ... ok
+test_noncanonical_but_strict_original_receipt_bytes_are_preserved (test_current_site_native_base.CurrentSiteNativeBaseContract.test_noncanonical_but_strict_original_receipt_bytes_are_preserved) ... ok
+test_noncanonical_or_whitespace_base64_is_rejected (test_current_site_native_base.CurrentSiteNativeBaseContract.test_noncanonical_or_whitespace_base64_is_rejected) ... ok
+test_one_captured_base_exact_public_recovery_bridge_is_accepted (test_current_site_native_base.CurrentSiteNativeBaseContract.test_one_captured_base_exact_public_recovery_bridge_is_accepted) ... ok
+test_one_file_100644_latest_json_tree_is_derived_not_trusted (test_current_site_native_base.CurrentSiteNativeBaseContract.test_one_file_100644_latest_json_tree_is_derived_not_trusted) ... ok
+test_original_receipt_lf_tamper_breaks_git_identity (test_current_site_native_base.CurrentSiteNativeBaseContract.test_original_receipt_lf_tamper_breaks_git_identity) ... ok
+test_original_receipt_must_have_strict_closed_v1_or_v2_schema (test_current_site_native_base.CurrentSiteNativeBaseContract.test_original_receipt_must_have_strict_closed_v1_or_v2_schema) ... ok
+test_pending_plan_is_recomputed_including_served_and_unserved_inventory (test_current_site_native_base.CurrentSiteNativeBaseContract.test_pending_plan_is_recomputed_including_served_and_unserved_inventory) ... ok
+test_pinned_registry_still_requires_strict_native_registry_admission (test_current_site_native_base.CurrentSiteNativeBaseContract.test_pinned_registry_still_requires_strict_native_registry_admission) ... ok
+test_prepared_chosen_public_anchor_has_explicit_observe_prepared_plan (test_current_site_native_base.CurrentSiteNativeBaseContract.test_prepared_chosen_public_anchor_has_explicit_observe_prepared_plan) ... ok
+test_private_proof_and_qualification_hashes_pin_original_file_bytes (test_current_site_native_base.CurrentSiteNativeBaseContract.test_private_proof_and_qualification_hashes_pin_original_file_bytes) ... ok
+test_proof_records_and_commit_people_have_closed_schemas (test_current_site_native_base.CurrentSiteNativeBaseContract.test_proof_records_and_commit_people_have_closed_schemas) ... ok
+test_public_observation_requires_complete_sorted_unique_target_closure (test_current_site_native_base.CurrentSiteNativeBaseContract.test_public_observation_requires_complete_sorted_unique_target_closure) ... ok
+test_public_observation_target_and_known_descriptor_pins_must_join (test_current_site_native_base.CurrentSiteNativeBaseContract.test_public_observation_target_and_known_descriptor_pins_must_join) ... ok
+test_pure_validation_performs_no_network_subprocess_or_filesystem_reads (test_current_site_native_base.CurrentSiteNativeBaseContract.test_pure_validation_performs_no_network_subprocess_or_filesystem_reads) ... ok
+test_qualification_requires_unchanged_operational_and_main_fences (test_current_site_native_base.CurrentSiteNativeBaseContract.test_qualification_requires_unchanged_operational_and_main_fences) ... ok
+test_receipt_commit_bot_timestamp_and_bounded_message_grammar_is_enforced (test_current_site_native_base.CurrentSiteNativeBaseContract.test_receipt_commit_bot_timestamp_and_bounded_message_grammar_is_enforced) ... ok
+test_recorded_metadata_and_public_counters_respect_declared_caps (test_current_site_native_base.CurrentSiteNativeBaseContract.test_recorded_metadata_and_public_counters_respect_declared_caps) ... ok
+test_recovery_bridge_must_have_correct_kind_and_conserved_candidate (test_current_site_native_base.CurrentSiteNativeBaseContract.test_recovery_bridge_must_have_correct_kind_and_conserved_candidate) ... ok
+test_reordered_or_duplicate_proof_heads_are_rejected (test_current_site_native_base.CurrentSiteNativeBaseContract.test_reordered_or_duplicate_proof_heads_are_rejected) ... ok
+test_required_file_set_and_bytes_values_are_exact (test_current_site_native_base.CurrentSiteNativeBaseContract.test_required_file_set_and_bytes_values_are_exact) ... ok
+test_spliced_valid_unrelated_commit_is_rejected_as_unused (test_current_site_native_base.CurrentSiteNativeBaseContract.test_spliced_valid_unrelated_commit_is_rejected_as_unused) ... ok
+test_strict_json_rejects_duplicates_nonfinite_invalid_utf8_and_extra_document (test_current_site_native_base.CurrentSiteNativeBaseContract.test_strict_json_rejects_duplicates_nonfinite_invalid_utf8_and_extra_document) ... ok
+test_superseded_record_conserves_entire_prepared_candidate (test_current_site_native_base.CurrentSiteNativeBaseContract.test_superseded_record_conserves_entire_prepared_candidate) ... ok
+test_supersession_requires_prepared_parent_and_exact_public_pointer (test_current_site_native_base.CurrentSiteNativeBaseContract.test_supersession_requires_prepared_parent_and_exact_public_pointer) ... ok
+test_two_reconciliation_children_do_not_expand_the_single_bridge_rule (test_current_site_native_base.CurrentSiteNativeBaseContract.test_two_reconciliation_children_do_not_expand_the_single_bridge_rule) ... ok
+test_valid_multi_link_superseded_chain_resolves_captured_bases (test_current_site_native_base.CurrentSiteNativeBaseContract.test_valid_multi_link_superseded_chain_resolves_captured_bases) ... ok
+test_valid_superseded_prepared_public_chain_resolves_effective_legacy_base (test_current_site_native_base.CurrentSiteNativeBaseContract.test_valid_superseded_prepared_public_chain_resolves_effective_legacy_base) ... ok
+test512mib_exact_and_one_over_refused_before_reads (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test512mib_exact_and_one_over_refused_before_reads) ... ok
+test8192_exact_and8193_refused (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test8192_exact_and8193_refused) ... ok
+test_base_exact_closed_lineage_hash_sequence_and_types (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_base_exact_closed_lineage_hash_sequence_and_types) ... ok
+test_build_registry_exact_independent_golden_and_original_base (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_build_registry_exact_independent_golden_and_original_base) ... ok
+test_entry32mib_exact_and_one_over_and_nonpositive_descriptors (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_entry32mib_exact_and_one_over_and_nonpositive_descriptors) ... ok
+test_execution_context_is_closed_exact_and_main_only (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_execution_context_is_closed_exact_and_main_only) ... ok
+test_four_pure_apis_have_no_filesystem_network_or_subprocess_effects (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_four_pure_apis_have_no_filesystem_network_or_subprocess_effects) ... ok
+test_manifest_and_original_receipt_projection_identity_joins (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_manifest_and_original_receipt_projection_identity_joins) ... ok
+test_manifest_exact_four_descriptors_excludes_self_and_five_buffers (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_manifest_exact_four_descriptors_excludes_self_and_five_buffers) ... ok
+test_manifest_payload_build_and_binding_joins_refuse_before_output (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_manifest_payload_build_and_binding_joins_refuse_before_output) ... ok
+test_manifest_strict_json_and_exact_byte_map_types (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_manifest_strict_json_and_exact_byte_map_types) ... ok
+test_page_and_manifest_capacity_boundaries (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_page_and_manifest_capacity_boundaries) ... ok
+test_progress250_exact_and251_refused_without_reset_or_fallback (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_progress250_exact_and251_refused_without_reset_or_fallback) ... ok
+test_progress_bool_partial_forged_or_truncated_comparison_never_qualifies (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_progress_bool_partial_forged_or_truncated_comparison_never_qualifies) ... ok
+test_progress_current_and_previous_identity_types_are_not_coerced (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_progress_current_and_previous_identity_types_are_not_coerced) ... ok
+test_progress_different_build_has_independent_ancestry_obligation (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_progress_different_build_has_independent_ancestry_obligation) ... ok
+test_progress_different_producer_requires_complete_ancestry_but_not_equal_trees (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_progress_different_producer_requires_complete_ancestry_but_not_equal_trees) ... ok
+test_progress_identical_build_and_producer_pair_reuses_same_full_response (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_progress_identical_build_and_producer_pair_reuses_same_full_response) ... ok
+test_progress_none_and_same_producer_need_no_comparison (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_progress_none_and_same_producer_need_no_comparison) ... ok
+test_progress_older_original_run_is_refused_and_numeric_ties_ordered (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_progress_older_original_run_is_refused_and_numeric_ties_ordered) ... ok
+test_progress_same_original_run_attempt_must_not_decrease (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_progress_same_original_run_attempt_must_not_decrease) ... ok
+test_progress_same_prefix_preserves_entire_binding_and_selection (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_progress_same_prefix_preserves_entire_binding_and_selection) ... ok
+test_progress_v1_has_build_obligation_without_prior_native_producer (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_progress_v1_has_build_obligation_without_prior_native_producer) ... ok
+test_registry16mib_exact_and_one_over (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_registry16mib_exact_and_one_over) ... ok
+test_registry_binding_selection_grammar_and_native_utc (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_registry_binding_selection_grammar_and_native_utc) ... ok
+test_registry_exact_sorted_paths_and_unique_prefixes (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_registry_exact_sorted_paths_and_unique_prefixes) ... ok
+test_registry_nested_closed_fields_and_pointer_capacity_joins (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_registry_nested_closed_fields_and_pointer_capacity_joins) ... ok
+test_registry_round_trip_exact_closed_bytes (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_registry_round_trip_exact_closed_bytes) ... ok
+test_registry_strict_json_types_and_duplicate_nonfinite_documents (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_registry_strict_json_types_and_duplicate_nonfinite_documents) ... ok
+test_same_prefix_entire_old_binding_selection_and_descriptors_are_conserved (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_same_prefix_entire_old_binding_selection_and_descriptors_are_conserved) ... ok
+test_union_conserves_all_old_entries_and_reuse_adds_zero_versions (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_union_conserves_all_old_entries_and_reuse_adds_zero_versions) ... ok
+test_unregistered_prefix_is_not_adopted (test_current_site_native_registry.CurrentSiteNativeRegistryContract.test_unregistered_prefix_is_not_adopted) ... ok
+test_all_24_presentations_restore_exactly_with_task_table_sensitive_input (test_current_site_persistent_status.PersistentStatusTests.test_all_24_presentations_restore_exactly_with_task_table_sensitive_input) ... ok
+test_all_new_current_static_routes_have_readable_status (test_current_site_persistent_status.PersistentStatusTests.test_all_new_current_static_routes_have_readable_status) ... ok
+test_both_explicit_live_presentations_restore_and_keep_same_source (test_current_site_persistent_status.PersistentStatusTests.test_both_explicit_live_presentations_restore_and_keep_same_source) ... ok
+test_complete_descriptors_do_not_admit_changed_source_text_or_role (test_current_site_persistent_status.PersistentStatusTests.test_complete_descriptors_do_not_admit_changed_source_text_or_role) ... ok
+test_current_panel_retains_paragraph_inside_status_region (test_current_site_persistent_status.PersistentStatusTests.test_current_panel_retains_paragraph_inside_status_region) ... ok
+test_each_restoration_qualifies_changed_input_without_mutation (test_current_site_persistent_status.PersistentStatusTests.test_each_restoration_qualifies_changed_input_without_mutation) ... ok
+test_legacy50_restoration_qualifies_acquisitions_once (test_current_site_persistent_status.PersistentStatusTests.test_legacy50_restoration_qualifies_acquisitions_once) ... ok
+test_original_archived_section_and_frozen_renderer_sources_do_not_change (test_current_site_persistent_status.PersistentStatusTests.test_original_archived_section_and_frozen_renderer_sources_do_not_change) ... ok
+test_previous_full_live_descriptors_restore_byte_exactly (test_current_site_persistent_status.PersistentStatusTests.test_previous_full_live_descriptors_restore_byte_exactly) ... ok
+test_restore_still_requires_complete_ordered_descriptor_membership (test_current_site_persistent_status.PersistentStatusTests.test_restore_still_requires_complete_ordered_descriptor_membership) ... ok
+test_bootstrap_post_requires_ref_readback_of_the_created_commit (test_current_site_publication.PublicationTests.test_bootstrap_post_requires_ref_readback_of_the_created_commit) ... ok
+test_branch_race_is_rejected_without_forced_ref_update (test_current_site_publication.PublicationTests.test_branch_race_is_rejected_without_forced_ref_update) ... ok
+test_candidate_and_execution_identity_mismatches_are_rejected_before_api_access (test_current_site_publication.PublicationTests.test_candidate_and_execution_identity_mismatches_are_rejected_before_api_access) ... ok
+test_corrupt_anchor_blob_bytes_are_refused (test_current_site_publication.PublicationTests.test_corrupt_anchor_blob_bytes_are_refused) ... ok
+test_corrupt_anchor_blob_or_tree_is_refused (test_current_site_publication.PublicationTests.test_corrupt_anchor_blob_or_tree_is_refused) ... ok
+test_differing_candidate_cannot_replace_pending_receipt_without_exact_public_match (test_current_site_publication.PublicationTests.test_differing_candidate_cannot_replace_pending_receipt_without_exact_public_match) ... ok
+test_failed_observation_does_not_write_observed_receipt (test_current_site_publication.PublicationTests.test_failed_observation_does_not_write_observed_receipt) ... ok
+test_future_attempt_candidate_is_rejected_before_api_access (test_current_site_publication.PublicationTests.test_future_attempt_candidate_is_rejected_before_api_access) ... ok
+test_get_retries_transient_503_then_200_and_writes_do_not_retry (test_current_site_publication.PublicationTests.test_get_retries_transient_503_then_200_and_writes_do_not_retry) ... ok
+test_github_client_enforces_fixed_routes_and_write_body_guards (test_current_site_publication.PublicationTests.test_github_client_enforces_fixed_routes_and_write_body_guards) ... ok
+test_http_clients_bound_responses_and_keep_credentials_in_fixed_api_headers (test_current_site_publication.PublicationTests.test_http_clients_bound_responses_and_keep_credentials_in_fixed_api_headers) ... ok
+test_later_attempt_observes_exact_prepared_candidate_with_original_run_identity (test_current_site_publication.PublicationTests.test_later_attempt_observes_exact_prepared_candidate_with_original_run_identity) ... ok
+test_later_attempt_reuses_exact_observed_candidate_without_mutation (test_current_site_publication.PublicationTests.test_later_attempt_reuses_exact_observed_candidate_without_mutation) ... ok
+test_later_deploy_observes_visible_pending_receipt_before_preparing_successor (test_current_site_publication.PublicationTests.test_later_deploy_observes_visible_pending_receipt_before_preparing_successor) ... ok
+test_missing_receipt_branch_needs_explicit_bootstrap_and_actual_remote_absence (test_current_site_publication.PublicationTests.test_missing_receipt_branch_needs_explicit_bootstrap_and_actual_remote_absence) ... ok
+test_observe_rejects_altered_prepared_digest_or_inventory_before_api_access (test_current_site_publication.PublicationTests.test_observe_rejects_altered_prepared_digest_or_inventory_before_api_access) ... ok
+test_observed_requires_exact_public_manifest_metadata_and_payload (test_current_site_publication.PublicationTests.test_observed_requires_exact_public_manifest_metadata_and_payload) ... ok
+test_post_patch_old_head_forever_fails_bounded_without_repatch (test_current_site_publication.PublicationTests.test_post_patch_old_head_forever_fails_bounded_without_repatch) ... ok
+test_post_patch_old_head_once_then_target_is_verified_without_repatch (test_current_site_publication.PublicationTests.test_post_patch_old_head_once_then_target_is_verified_without_repatch) ... ok
+test_post_patch_target_requires_immutable_commit_tree_and_receipt_verification (test_current_site_publication.PublicationTests.test_post_patch_target_requires_immutable_commit_tree_and_receipt_verification) ... ok
+test_post_patch_third_head_is_a_hard_race_without_repatch (test_current_site_publication.PublicationTests.test_post_patch_third_head_is_a_hard_race_without_repatch) ... ok
+test_prepared_anchor_is_persistent_and_only_latest_json_is_written (test_current_site_publication.PublicationTests.test_prepared_anchor_is_persistent_and_only_latest_json_is_written) ... ok
+test_public_anchor_pins_real_history_closure_on_a_fresh_runner (test_current_site_publication.PublicationTests.test_public_anchor_pins_real_history_closure_on_a_fresh_runner) ... ok
+test_qualified_metadata_package_binds_real_artifact_and_browser_evidence (test_current_site_publication.PublicationTests.test_qualified_metadata_package_binds_real_artifact_and_browser_evidence) ... ok
+test_readback_cannot_record_success_after_its_wall_clock_deadline (test_current_site_publication.PublicationTests.test_readback_cannot_record_success_after_its_wall_clock_deadline) ... ok
+test_readback_retries_are_bounded_and_do_not_mutate_receipts (test_current_site_publication.PublicationTests.test_readback_retries_are_bounded_and_do_not_mutate_receipts) ... ok
+test_retained_resume_table_restores_exact_bytes_without_changing_current_default (test_current_site_publication.PublicationTests.test_retained_resume_table_restores_exact_bytes_without_changing_current_default) ... ok
+test_snapshot_regression_is_refused_against_persistent_anchor (test_current_site_publication.PublicationTests.test_snapshot_regression_is_refused_against_persistent_anchor) ... ok
+test_source_run_and_unknown_receipt_fields_are_refused_before_mutation (test_current_site_publication.PublicationTests.test_source_run_and_unknown_receipt_fields_are_refused_before_mutation) ... ok
+test_unavailable_branch_is_not_treated_as_initial_absence (test_current_site_publication.PublicationTests.test_unavailable_branch_is_not_treated_as_initial_absence) ... ok
+test_unknown_postdeploy_failure_keeps_prepared_anchor_and_refuses_old_public_pair (test_current_site_publication.PublicationTests.test_unknown_postdeploy_failure_keeps_prepared_anchor_and_refuses_old_public_pair) ... ok
+test_unknown_reference_update_can_be_recovered_idempotently (test_current_site_publication.PublicationTests.test_unknown_reference_update_can_be_recovered_idempotently) ... ok
+test_unknown_resume_presentation_is_not_admitted_by_a_self_consistent_receipt (test_current_site_publication.PublicationTests.test_unknown_resume_presentation_is_not_admitted_by_a_self_consistent_receipt) ... ok
+test_workflow_has_pr_specific_concurrency_and_separate_metadata_handoff (test_current_site_publication.PublicationTests.test_workflow_has_pr_specific_concurrency_and_separate_metadata_handoff) ... ok
+test_generators_emit_style_before_brand (test_current_site_stylesheet_order.StylesheetOrder.test_generators_emit_style_before_brand) ... ok
+test_live_node_pages_load_style_before_brand (test_current_site_stylesheet_order.StylesheetOrder.test_live_node_pages_load_style_before_brand) ... ok
+test_removed_node_live_route_loads_style_before_brand_and_archive_stays (test_current_site_stylesheet_order.StylesheetOrder.test_removed_node_live_route_loads_style_before_brand_and_archive_stays) ... ok
+test_restore_keeps_predecessor_removed_node_order_and_live_pages_stay_new (test_current_site_stylesheet_order.StylesheetOrder.test_restore_keeps_predecessor_removed_node_order_and_live_pages_stay_new) ... ok
+test_restore_live_compatibility_refuses_forged_or_incomplete_maps_without_writes (test_current_site_stylesheet_order.StylesheetOrder.test_restore_live_compatibility_refuses_forged_or_incomplete_maps_without_writes) ... ok
+test_restore_predecessor_live_publication_then_build_new_style_first (test_current_site_stylesheet_order.StylesheetOrder.test_restore_predecessor_live_publication_then_build_new_style_first) ... ok
+test_axial_expansion_and_height_gap (test_d5_shrinking_witness.ShrinkingWitnessIdentities.test_axial_expansion_and_height_gap) ... ok
+test_bargmann_fock_third_derivative_survives_gradient_conditioning (test_d5_shrinking_witness.ShrinkingWitnessIdentities.test_bargmann_fock_third_derivative_survives_gradient_conditioning) ... ok
+test_divided_difference_jacobian (test_d5_shrinking_witness.ShrinkingWitnessIdentities.test_divided_difference_jacobian) ... ok
+test_leading_axial_signs_and_fourth_derivative_window (test_d5_shrinking_witness.ShrinkingWitnessIdentities.test_leading_axial_signs_and_fourth_derivative_window) ... ok
+test_note_cites_the_reviewed_outer_boundary (test_d5_shrinking_witness.ShrinkingWitnessIdentities.test_note_cites_the_reviewed_outer_boundary) ... ok
+test_radial_integral_is_independent_of_small_eta (test_d5_shrinking_witness.ShrinkingWitnessIdentities.test_radial_integral_is_independent_of_small_eta) ... ok
+test_singular_value_controls_determinant (test_d5_shrinking_witness.ShrinkingWitnessIdentities.test_singular_value_controls_determinant) ... ok
+test_absent_carriers_are_fail_closed (test_dependency_source_binding.DependencySourceBinding.test_absent_carriers_are_fail_closed) ... ok
+test_directory_sources_report_inventory_drift_without_failing (test_dependency_source_binding.DependencySourceBinding.test_directory_sources_report_inventory_drift_without_failing) ... ok
+test_every_digest_node_binds_to_its_pinned_bytes (test_dependency_source_binding.DependencySourceBinding.test_every_digest_node_binds_to_its_pinned_bytes) ... ok
+test_fingerprint_census_is_pinned (test_dependency_source_binding.DependencySourceBinding.test_fingerprint_census_is_pinned) ... ok
+test_graph_bytes_match_provenance_and_fixture (test_dependency_source_binding.DependencySourceBinding.test_graph_bytes_match_provenance_and_fixture) ... ok
+test_node_and_edge_structure (test_dependency_source_binding.DependencySourceBinding.test_node_and_edge_structure) ... ok
+test_record_only_nodes_are_pinned (test_dependency_source_binding.DependencySourceBinding.test_record_only_nodes_are_pinned) ... ok
+test_combined_merge_marker (test_drive_id_scan.DiffParse.test_combined_merge_marker) ... ok
+test_mixed_prefix_merge_rows_advance_line (test_drive_id_scan.DiffParse.test_mixed_prefix_merge_rows_advance_line) ... ok
+test_ordinary_and_quoted_paths (test_drive_id_scan.DiffParse.test_ordinary_and_quoted_paths) ... ok
+test_plus_plus_content_line_is_not_a_header (test_drive_id_scan.DiffParse.test_plus_plus_content_line_is_not_a_header) ... ok
+test_body_read_error_is_redacted_exit_2 (test_drive_id_scan.GitRange.test_body_read_error_is_redacted_exit_2) ... ok
+test_cli_body_file_stdin_and_exit_codes (test_drive_id_scan.GitRange.test_cli_body_file_stdin_and_exit_codes) ... ok
+test_dash_or_underscore_prefixed_id_is_found_and_redacted (test_drive_id_scan.GitRange.test_dash_or_underscore_prefixed_id_is_found_and_redacted) ... ok
+test_dedup_keeps_each_commit_and_head (test_drive_id_scan.GitRange.test_dedup_keeps_each_commit_and_head) ... ok
+test_form_feed_inside_added_line_is_scanned (test_drive_id_scan.GitRange.test_form_feed_inside_added_line_is_scanned) ... ok
+test_message_space_in_path_and_empty_range (test_drive_id_scan.GitRange.test_message_space_in_path_and_empty_range) ... ok
+test_per_commit_diff_flags_an_id_removed_later (test_drive_id_scan.GitRange.test_per_commit_diff_flags_an_id_removed_later) ... ok
+test_plus_plus_line_in_range_is_scanned (test_drive_id_scan.GitRange.test_plus_plus_line_in_range_is_scanned) ... ok
+test_pure_rename_and_empty_file_paths_are_scanned (test_drive_id_scan.GitRange.test_pure_rename_and_empty_file_paths_are_scanned) ... ok
+test_subdirectory_repo_with_diff_relative_scans_whole_tree (test_drive_id_scan.GitRange.test_subdirectory_repo_with_diff_relative_scans_whole_tree) ... ok
+test_allowlist_does_not_move_line_numbers (test_drive_id_scan.TextScan.test_allowlist_does_not_move_line_numbers) ... ok
+test_boundaries_urls_and_id_fields (test_drive_id_scan.TextScan.test_boundaries_urls_and_id_fields) ... ok
+test_drive_shaped_lengths_and_hex_pins (test_drive_id_scan.TextScan.test_drive_shaped_lengths_and_hex_pins) ... ok
+test_sources_have_no_drive_token (test_drive_id_scan.TextScan.test_sources_have_no_drive_token) ... ok
+test_tiers (test_dropbox_reconcile.Classify.test_tiers) ... ok
+test_wrong_size_is_not_a_match (test_dropbox_reconcile.Classify.test_wrong_size_is_not_a_match) ... ok
+test_known_dropbox_value (test_dropbox_reconcile.ContentHash.test_known_dropbox_value) ... ok
+test_multi_block_file_matches_bytes (test_dropbox_reconcile.ContentHash.test_multi_block_file_matches_bytes) ... ok
+test_one_byte_change_is_detected (test_dropbox_reconcile.ContentHash.test_one_byte_change_is_detected) ... ok
+test_single_block_is_double_sha256 (test_dropbox_reconcile.ContentHash.test_single_block_is_double_sha256) ... ok
+test_corrupt_inputs_are_recorded_not_fatal (test_dropbox_reconcile.Extract.test_corrupt_inputs_are_recorded_not_fatal) ... ok
+test_docx_and_zip_members (test_dropbox_reconcile.Extract.test_docx_and_zip_members) ... ok
+test_personal_names (test_dropbox_reconcile.Extract.test_personal_names) ... ok
+test_pii_patterns_flag_credentials (test_dropbox_reconcile.Extract.test_pii_patterns_flag_credentials) ... ok
+test_url_and_json (test_dropbox_reconcile.Extract.test_url_and_json) ... ok
+test_links_and_hashes_from_transcript (test_dropbox_reconcile.Harvest.test_links_and_hashes_from_transcript) ... ok
+test_harvest_then_stage (test_dropbox_reconcile.HarvestFetch.test_harvest_then_stage) ... ok
+test_recover_original_needs_an_exact_hash (test_dropbox_reconcile.HarvestFetch.test_recover_original_needs_an_exact_hash) ... ok
+test_artifacts_object (test_dropbox_reconcile.IndexDrive.test_artifacts_object) ... ok
+test_explicit_empty_list_is_a_real_empty_index (test_dropbox_reconcile.IndexDrive.test_explicit_empty_list_is_a_real_empty_index) ... ok
+test_malformed_json_shape_is_not_an_empty_inventory (test_dropbox_reconcile.IndexDrive.test_malformed_json_shape_is_not_an_empty_inventory) ... ok
+test_rows_object (test_dropbox_reconcile.IndexDrive.test_rows_object) ... ok
+test_second_catalog_failure_does_not_publish_partial_rows (test_dropbox_reconcile.IndexDrive.test_second_catalog_failure_does_not_publish_partial_rows) ... ok
+test_sources_object_matches_public_catalog_pages (test_dropbox_reconcile.IndexDrive.test_sources_object_matches_public_catalog_pages) ... ok
+test_top_level_list (test_dropbox_reconcile.IndexDrive.test_top_level_list) ... ok
+test_later_repository_failure_does_not_publish_partial_index (test_dropbox_reconcile.IndexGit.test_later_repository_failure_does_not_publish_partial_index) ... ok
+test_repository_blob_is_indexed (test_dropbox_reconcile.IndexGit.test_repository_blob_is_indexed) ... ok
+test_unreadable_repository_is_not_an_empty_inventory (test_dropbox_reconcile.IndexGit.test_unreadable_repository_is_not_an_empty_inventory) ... ok
+test_allow_list_admits_only_named_unflagged_paths (test_dropbox_reconcile.Stage.test_allow_list_admits_only_named_unflagged_paths) ... ok
+test_no_allow_list_stages_nothing_for_github (test_dropbox_reconcile.Stage.test_no_allow_list_stages_nothing_for_github) ... ok
+test_pack_holds_and_round_trips (test_dropbox_reconcile.StageAndPack.test_pack_holds_and_round_trips) ... ok
+test_pack_splits_parts_at_the_cap (test_dropbox_reconcile.StageAndPack.test_pack_splits_parts_at_the_cap) ... ok
+test_report (test_dropbox_reconcile.StageAndPack.test_report) ... ok
+test_stage_flags_zip_members_and_personal_names (test_dropbox_reconcile.StageAndPack.test_stage_flags_zip_members_and_personal_names) ... ok
+test_cli_refuses_unknown_node (test_evidence_path.EvidencePathTests.test_cli_refuses_unknown_node) ... ok
+test_complete_path_for_synthetic_bound_node (test_evidence_path.EvidencePathTests.test_complete_path_for_synthetic_bound_node) ... ok
+test_generic_unbound_node_reports_missing_binding (test_evidence_path.EvidencePathTests.test_generic_unbound_node_reports_missing_binding) ... ok
+test_https_evidence_values_and_existing_limits_are_preserved (test_evidence_path.EvidencePathTests.test_https_evidence_values_and_existing_limits_are_preserved) ... ok
+test_inputs_are_not_mutated (test_evidence_path.EvidencePathTests.test_inputs_are_not_mutated) ... ok
+test_invalid_numeric_https_hosts_are_missing (test_evidence_path.EvidencePathTests.test_invalid_numeric_https_hosts_are_missing) ... ok
+test_malformed_https_evidence_authorities_are_missing (test_evidence_path.EvidencePathTests.test_malformed_https_evidence_authorities_are_missing) ... ok
+test_malformed_node_id_is_refused (test_evidence_path.EvidencePathTests.test_malformed_node_id_is_refused) ... ok
+test_missing_empty_or_traversal_path_is_not_a_pinned_source (test_evidence_path.EvidencePathTests.test_missing_empty_or_traversal_path_is_not_a_pinned_source) ... ok
+test_missing_receipt_and_review_are_named_not_padded (test_evidence_path.EvidencePathTests.test_missing_receipt_and_review_are_named_not_padded) ... ok
+test_non_sha_commit_in_identity_is_not_a_pinned_source (test_evidence_path.EvidencePathTests.test_non_sha_commit_in_identity_is_not_a_pinned_source) ... ok
+test_punctured_pin_projection_is_explicitly_missing (test_evidence_path.EvidencePathTests.test_punctured_pin_projection_is_explicitly_missing) ... ok
+test_raw_url_whitespace_controls_and_backslashes_are_missing (test_evidence_path.EvidencePathTests.test_raw_url_whitespace_controls_and_backslashes_are_missing) ... ok
+test_repository_punctured_pin_is_missing_via_cli (test_evidence_path.EvidencePathTests.test_repository_punctured_pin_is_missing_via_cli) ... ok
+test_source_path_is_serialized_as_url_path_data (test_evidence_path.EvidencePathTests.test_source_path_is_serialized_as_url_path_data) ... ok
+test_unknown_node_is_refused (test_evidence_path.EvidencePathTests.test_unknown_node_is_refused) ... ok
+test_valid_numeric_and_nonnumeric_https_hosts_are_preserved (test_evidence_path.EvidencePathTests.test_valid_numeric_and_nonnumeric_https_hosts_are_preserved) ... ok
+test_broken_relative_link_is_rejected (test_exact_sample_shrinking_bin.ShrinkingBinPublicationTests.test_broken_relative_link_is_rejected) ... ok
+test_changed_proof_identity_is_rejected (test_exact_sample_shrinking_bin.ShrinkingBinPublicationTests.test_changed_proof_identity_is_rejected) ... ok
+test_lost_exact_sample_hypothesis_is_rejected (test_exact_sample_shrinking_bin.ShrinkingBinPublicationTests.test_lost_exact_sample_hypothesis_is_rejected) ... ok
+test_lost_exclusion_is_rejected (test_exact_sample_shrinking_bin.ShrinkingBinPublicationTests.test_lost_exclusion_is_rejected) ... ok
+test_lost_incoming_route_is_rejected (test_exact_sample_shrinking_bin.ShrinkingBinPublicationTests.test_lost_incoming_route_is_rejected) ... ok
+test_published_sources_scope_and_local_routes (test_exact_sample_shrinking_bin.ShrinkingBinPublicationTests.test_published_sources_scope_and_local_routes) ... ok
+test_distinct_source_and_execution_binding (test_formal_execution_context.ContextTests.test_distinct_source_and_execution_binding) ... ok
+test_git_suffix (test_formal_execution_context.ContextTests.test_git_suffix) ... ok
+test_kernel_status_is_required (test_formal_execution_context.ContextTests.test_kernel_status_is_required) ... ok
+test_log_path_escape (test_formal_execution_context.ContextTests.test_log_path_escape) ... ok
+test_modified_log (test_formal_execution_context.ContextTests.test_modified_log) ... ok
+test_receipt_commit_mismatch (test_formal_execution_context.ContextTests.test_receipt_commit_mismatch) ... ok
+test_receipt_host_mismatch (test_formal_execution_context.ContextTests.test_receipt_host_mismatch) ... ok
+test_run_mismatch (test_formal_execution_context.ContextTests.test_run_mismatch) ... ok
+test_source_commit_mismatch (test_formal_execution_context.ContextTests.test_source_commit_mismatch) ... ok
+test_source_remote_mismatch (test_formal_execution_context.ContextTests.test_source_remote_mismatch) ... ok
+test_real_manifest_cli_source_only (test_formal_gate.RepositoryControls.test_real_manifest_cli_source_only) ... ok
+test_real_manifest_source_check (test_formal_gate.RepositoryControls.test_real_manifest_source_check) ... ok
+test_real_package_executes_with_receipt (test_formal_gate.RepositoryControls.test_real_package_executes_with_receipt) ... ok
+test_real_template_record_is_refused (test_formal_gate.RepositoryControls.test_real_template_record_is_refused) ... ok
+test_alignment_mutable_ref_refused (test_formal_gate.SyntheticControls.test_alignment_mutable_ref_refused) ... ok
+test_alignment_not_accepted_refused (test_formal_gate.SyntheticControls.test_alignment_not_accepted_refused) ... ok
+test_alignment_partial_coverage_refused (test_formal_gate.SyntheticControls.test_alignment_partial_coverage_refused) ... ok
+test_alignment_same_provider_refused (test_formal_gate.SyntheticControls.test_alignment_same_provider_refused) ... ok
+test_alignment_stale_manifest_refused (test_formal_gate.SyntheticControls.test_alignment_stale_manifest_refused) ... ok
+test_alignment_table_drift_fails_cli (test_formal_gate.SyntheticControls.test_alignment_table_drift_fails_cli) ... FORMAL_GATE_FAIL: alignment table differs from the manifest rendering; regenerate with --write-alignment
+ok
+test_alignment_valid (test_formal_gate.SyntheticControls.test_alignment_valid) ... ok
+test_anchor_not_verbatim (test_formal_gate.SyntheticControls.test_anchor_not_verbatim) ... ok
+test_audit_allowed_axioms_pass (test_formal_gate.SyntheticControls.test_audit_allowed_axioms_pass) ... ok
+test_audit_from_file_passes (test_formal_gate.SyntheticControls.test_audit_from_file_passes) ... ok
+test_audit_missing_target (test_formal_gate.SyntheticControls.test_audit_missing_target) ... ok
+test_audit_native_axiom (test_formal_gate.SyntheticControls.test_audit_native_axiom) ... ok
+test_audit_sorry_axiom (test_formal_gate.SyntheticControls.test_audit_sorry_axiom) ... ok
+test_audit_unexpected_target_fails (test_formal_gate.SyntheticControls.test_audit_unexpected_target_fails) ... ok
+test_audit_unrecognized_output_fails (test_formal_gate.SyntheticControls.test_audit_unrecognized_output_fails) ... ok
+test_cli_source_only_reports_not_a_build (test_formal_gate.SyntheticControls.test_cli_source_only_reports_not_a_build) ... ok
+test_control_files_must_be_bound (test_formal_gate.SyntheticControls.test_control_files_must_be_bound) ... ok
+test_custom_axiom_refused (test_formal_gate.SyntheticControls.test_custom_axiom_refused) ... ok
+test_dependency_lock_mismatch (test_formal_gate.SyntheticControls.test_dependency_lock_mismatch) ... ok
+test_does_not_claim_required (test_formal_gate.SyntheticControls.test_does_not_claim_required) ... ok
+test_duplicate_json_key (test_formal_gate.SyntheticControls.test_duplicate_json_key) ... ok
+test_hash_mismatch (test_formal_gate.SyntheticControls.test_hash_mismatch) ... ok
+test_manifest_cannot_claim_alignment (test_formal_gate.SyntheticControls.test_manifest_cannot_claim_alignment) ... ok
+test_manifest_cannot_claim_kernel_checked (test_formal_gate.SyntheticControls.test_manifest_cannot_claim_kernel_checked) ... ok
+test_missing_theorem_refused (test_formal_gate.SyntheticControls.test_missing_theorem_refused) ... ok
+test_native_decide_refused (test_formal_gate.SyntheticControls.test_native_decide_refused) ... ok
+test_nonpublic_source_repository_refused (test_formal_gate.SyntheticControls.test_nonpublic_source_repository_refused) ... ok
+test_postflight_source_change_still_refuses_receipt (test_formal_gate.SyntheticControls.test_postflight_source_change_still_refuses_receipt) ... ok
+test_preflight_process_failure_preserves_build (test_formal_gate.SyntheticControls.test_preflight_process_failure_preserves_build) ... ok
+test_preflight_timeout_preserves_build (test_formal_gate.SyntheticControls.test_preflight_timeout_preserves_build) ... ok
+test_root_must_import_exactly_registered_modules (test_formal_gate.SyntheticControls.test_root_must_import_exactly_registered_modules) ... ok
+test_scope_must_be_bound (test_formal_gate.SyntheticControls.test_scope_must_be_bound) ... ok
+test_sorry_in_code (test_formal_gate.SyntheticControls.test_sorry_in_code) ... ok
+test_sorry_only_in_comments_ignored (test_formal_gate.SyntheticControls.test_sorry_only_in_comments_ignored) ... ok
+test_source_bytes_changed (test_formal_gate.SyntheticControls.test_source_bytes_changed) ... ok
+test_status_authority_must_be_false (test_formal_gate.SyntheticControls.test_status_authority_must_be_false) ... ok
+test_target_order_must_match_source (test_formal_gate.SyntheticControls.test_target_order_must_match_source) ... ok
+test_toolchain_mismatch (test_formal_gate.SyntheticControls.test_toolchain_mismatch) ... ok
+test_unbound_package_file (test_formal_gate.SyntheticControls.test_unbound_package_file) ... ok
+test_unregistered_lean_module (test_formal_gate.SyntheticControls.test_unregistered_lean_module) ... ok
+test_unregistered_theorem_refused (test_formal_gate.SyntheticControls.test_unregistered_theorem_refused) ... ok
+test_valid_runtime_preserves_both_version_observations_and_logs (test_formal_gate.SyntheticControls.test_valid_runtime_preserves_both_version_observations_and_logs) ... ok
+test_valid_source_check_and_no_writes (test_formal_gate.SyntheticControls.test_valid_source_check_and_no_writes) ... ok
+test_wrong_postflight_runtime_refuses_receipt_after_source_recheck (test_formal_gate.SyntheticControls.test_wrong_postflight_runtime_refuses_receipt_after_source_recheck) ... ok
+test_wrong_runtime_preserves_build_and_refuses_before_work (test_formal_gate.SyntheticControls.test_wrong_runtime_preserves_build_and_refuses_before_work) ... ok
+test_actual_probe_accepts_fail_closed_shell (test_formal_workflow_shell.FormalWorkflowShellTests.test_actual_probe_accepts_fail_closed_shell) ... ok
+test_actual_probe_rejects_original_fail_open_shell (test_formal_workflow_shell.FormalWorkflowShellTests.test_actual_probe_rejects_original_fail_open_shell) ... ok
+test_explicit_bash_default_without_overrides (test_formal_workflow_shell.FormalWorkflowShellTests.test_explicit_bash_default_without_overrides) ... ok
+test_probe_when_parent_path_has_no_python_alias (test_formal_workflow_shell.FormalWorkflowShellTests.test_probe_when_parent_path_has_no_python_alias) ... ok
+test_summary_does_not_claim_success_unconditionally (test_formal_workflow_shell.FormalWorkflowShellTests.test_summary_does_not_claim_success_unconditionally) ... ok
+test_workflow_triggers_and_executes_regression (test_formal_workflow_shell.FormalWorkflowShellTests.test_workflow_triggers_and_executes_regression) ... ok
+test_gb7b_coverage_and_protected_untouched (test_graph_artifact_bindings_v2.GraphArtifactBindingsV2Test.test_gb7b_coverage_and_protected_untouched) ... ok
+test_gb7e_d5_components_are_pinned_files (test_graph_artifact_bindings_v2.GraphArtifactBindingsV2Test.test_gb7e_d5_components_are_pinned_files) ... ok
+test_gb8a_nodes_are_pinned_files (test_graph_artifact_bindings_v2.GraphArtifactBindingsV2Test.test_gb8a_nodes_are_pinned_files) ... ok
+test_no_kind_is_promoted_to_bound (test_graph_artifact_bindings_v2.GraphArtifactBindingsV2Test.test_no_kind_is_promoted_to_bound) ... ok
+test_nodes_come_from_node_source (test_graph_artifact_bindings_v2.GraphArtifactBindingsV2Test.test_nodes_come_from_node_source) ... ok
+test_records (test_graph_artifact_bindings_v2.GraphArtifactBindingsV2Test.test_records) ... ok
+test_root_shape (test_graph_artifact_bindings_v2.GraphArtifactBindingsV2Test.test_root_shape) ... ok
+test_v1_file_untouched (test_graph_artifact_bindings_v2.GraphArtifactBindingsV2Test.test_v1_file_untouched) ... ok
+test_525_composition (test_graph_binding_check.Composition525Test.test_525_composition) ... skipped '29b7d596 or Math- dbe6c0a1 unavailable'
+test_all_bound_passes (test_graph_binding_check.GraphBindingCheckTest.test_all_bound_passes) ... ok
+test_deterministic_output (test_graph_binding_check.GraphBindingCheckTest.test_deterministic_output) ... ok
+test_empty_bindings_fail_both_directions (test_graph_binding_check.GraphBindingCheckTest.test_empty_bindings_fail_both_directions) ... ok
+test_f1_empty_graph_nodes_exits_2_even_report_only (test_graph_binding_check.GraphBindingCheckTest.test_f1_empty_graph_nodes_exits_2_even_report_only) ... ok
+test_f1_empty_site_nodes_dir_exits_2 (test_graph_binding_check.GraphBindingCheckTest.test_f1_empty_site_nodes_dir_exits_2) ... ok
+test_f1_missing_site_nodes_dir_exits_2 (test_graph_binding_check.GraphBindingCheckTest.test_f1_missing_site_nodes_dir_exits_2) ... ok
+test_f1_scope_matching_nothing_fails (test_graph_binding_check.GraphBindingCheckTest.test_f1_scope_matching_nothing_fails) ... ok
+test_f2_f3_bad_scope_exits_2_without_traceback (test_graph_binding_check.GraphBindingCheckTest.test_f2_f3_bad_scope_exits_2_without_traceback) ... ok
+test_f2_scope_symlink_escape_reported (test_graph_binding_check.GraphBindingCheckTest.test_f2_scope_symlink_escape_reported) ... ok
+test_malformed_inputs_exit_2 (test_graph_binding_check.GraphBindingCheckTest.test_malformed_inputs_exit_2) ... ok
+test_missing_artifact_and_unknown_node_fail (test_graph_binding_check.GraphBindingCheckTest.test_missing_artifact_and_unknown_node_fail) ... ok
+test_report_only_exits_zero (test_graph_binding_check.GraphBindingCheckTest.test_report_only_exits_zero) ... ok
+test_site_nodes_dir (test_graph_binding_check.GraphBindingCheckTest.test_site_nodes_dir) ... ok
+test_stale_sha_fails (test_graph_binding_check.GraphBindingCheckTest.test_stale_sha_fails) ... ok
+test_symlink_escape_is_outside_root (test_graph_binding_check.GraphBindingCheckTest.test_symlink_escape_is_outside_root) ... ok
+test_terminal_recursive_scope_reports_nested_unbound_file (test_graph_binding_check.GraphBindingCheckTest.test_terminal_recursive_scope_reports_nested_unbound_file) ... ok
+test_absent_null_last_seen_commit_kept_honest (test_graph_binding_check.GraphBindingV2ReportTest.test_absent_null_last_seen_commit_kept_honest) ... ok
+test_bound_and_ref_format (test_graph_binding_check.GraphBindingV2ReportTest.test_bound_and_ref_format) ... ok
+test_directory_source_loose_is_unbound (test_graph_binding_check.GraphBindingV2ReportTest.test_directory_source_loose_is_unbound) ... ok
+test_directory_tree_record_files_still_unbound (test_graph_binding_check.GraphBindingV2ReportTest.test_directory_tree_record_files_still_unbound) ... ok
+test_empty_node_source_fails_closed (test_graph_binding_check.GraphBindingV2ReportTest.test_empty_node_source_fails_closed) ... ok
+test_external_source_never_bound (test_graph_binding_check.GraphBindingV2ReportTest.test_external_source_never_bound) ... ok
+test_external_unverified_may_name_repository (test_graph_binding_check.GraphBindingV2ReportTest.test_external_unverified_may_name_repository) ... ok
+test_foreign_node_source_requires_checkout_and_pin (test_graph_binding_check.GraphBindingV2ReportTest.test_foreign_node_source_requires_checkout_and_pin) ... ok
+test_foreign_repository_records_never_bound (test_graph_binding_check.GraphBindingV2ReportTest.test_foreign_repository_records_never_bound) ... ok
+test_hist_node_never_bound_even_with_records (test_graph_binding_check.GraphBindingV2ReportTest.test_hist_node_never_bound_even_with_records) ... ok
+test_hist_nodes_unbound_historical_without_record (test_graph_binding_check.GraphBindingV2ReportTest.test_hist_nodes_unbound_historical_without_record) ... ok
+test_malformed_exit_two (test_graph_binding_check.GraphBindingV2ReportTest.test_malformed_exit_two) ... ok
+test_missing_unknown_and_other_kinds (test_graph_binding_check.GraphBindingV2ReportTest.test_missing_unknown_and_other_kinds) ... ok
+test_ruling1_second_repo_verified_at_pinned_commit (test_graph_binding_check.GraphBindingV2ReportTest.test_ruling1_second_repo_verified_at_pinned_commit) ... ok
+test_ruling1_unsupplied_repo_bad_commit_bad_blob_unverifiable (test_graph_binding_check.GraphBindingV2ReportTest.test_ruling1_unsupplied_repo_bad_commit_bad_blob_unverifiable) ... ok
+test_ruling2_null_commit_only_on_absent (test_graph_binding_check.GraphBindingV2ReportTest.test_ruling2_null_commit_only_on_absent) ... ok
+test_stale_still_exit_zero (test_graph_binding_check.GraphBindingV2ReportTest.test_stale_still_exit_zero) ... ok
+test_terminal_recursive_scope_includes_direct_and_nested_files (test_graph_binding_check.GraphBindingV2ReportTest.test_terminal_recursive_scope_includes_direct_and_nested_files) ... ok
+test_tree_kind_without_git_is_unverifiable (test_graph_binding_check.GraphBindingV2ReportTest.test_tree_kind_without_git_is_unverifiable) ... ok
+test_v2_rejects_mixed_v1_args (test_graph_binding_check.GraphBindingV2ReportTest.test_v2_rejects_mixed_v1_args) ... ok
+test_empty_records_directory_is_a_failure (test_living_project_validation.MandatoryInputTests.test_empty_records_directory_is_a_failure) ... ok
+test_missing_records_directory_is_a_failure (test_living_project_validation.MandatoryInputTests.test_missing_records_directory_is_a_failure) ... ok
+test_missing_schema_is_a_failure (test_living_project_validation.MandatoryInputTests.test_missing_schema_is_a_failure) ... ok
+test_missing_validator_is_a_failure (test_living_project_validation.MandatoryInputTests.test_missing_validator_is_a_failure) ... ok
+test_planted_fault_is_rejected__dependency_cycle (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__dependency_cycle) ... ok
+test_planted_fault_is_rejected__fresh_but_rev_moved (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__fresh_but_rev_moved) ... ok
+test_planted_fault_is_rejected__malformed_source_url (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__malformed_source_url) ... ok
+test_planted_fault_is_rejected__missing_artifact_path (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__missing_artifact_path) ... ok
+test_planted_fault_is_rejected__missing_expected_record (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__missing_expected_record) ... ok
+test_planted_fault_is_rejected__missing_required_field (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__missing_required_field) ... ok
+test_planted_fault_is_rejected__no_sources (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__no_sources) ... ok
+test_planted_fault_is_rejected__observed_at_not_utc (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__observed_at_not_utc) ... ok
+test_planted_fault_is_rejected__owner_evidence_not_pickup (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__owner_evidence_not_pickup) ... ok
+test_planted_fault_is_rejected__owner_without_evidence (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__owner_without_evidence) ... ok
+test_planted_fault_is_rejected__projection_older_than_record (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__projection_older_than_record) ... ok
+test_planted_fault_is_rejected__projection_rev_mismatch (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__projection_rev_mismatch) ... ok
+test_planted_fault_is_rejected__projection_without_record (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__projection_without_record) ... ok
+test_planted_fault_is_rejected__scientific_effect_not_none (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__scientific_effect_not_none) ... ok
+test_planted_fault_is_rejected__self_dependency (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__self_dependency) ... ok
+test_planted_fault_is_rejected__source_without_rev (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__source_without_rev) ... ok
+test_planted_fault_is_rejected__two_records_one_node (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__two_records_one_node) ... ok
+test_planted_fault_is_rejected__unknown_dependency (test_living_project_validation.PlantedFaultTests.test_planted_fault_is_rejected__unknown_dependency) ... ok
+test_state_changed_value (test_living_project_validation.PublishedProjectionBoundaryTests.test_state_changed_value) ... ok
+test_state_directory (test_living_project_validation.PublishedProjectionBoundaryTests.test_state_directory) ... ok
+test_state_matching (test_living_project_validation.PublishedProjectionBoundaryTests.test_state_matching) ... ok
+test_state_missing (test_living_project_validation.PublishedProjectionBoundaryTests.test_state_missing) ... ok
+test_state_missing_node (test_living_project_validation.PublishedProjectionBoundaryTests.test_state_missing_node) ... ok
+test_adoption_on_merged_records (test_living_project_validation.RealRecordTests.test_adoption_on_merged_records)
+Real records/node_status files, checked by main's validator and schema. ... ok
+test_real_records_cited_artifacts_when_present (test_living_project_validation.RealRecordTests.test_real_records_cited_artifacts_when_present) ... skipped 'no real record cites repo artifact paths; missing-artifact checks are not exercised'
+test_real_records_dependencies_when_present (test_living_project_validation.RealRecordTests.test_real_records_dependencies_when_present) ... skipped 'no real record carries depends_on; dependency checks are not exercised. depends_on is not interface v0. Dependency validation is not proof verification.'
+test_real_records_evidence_id_pattern (test_living_project_validation.RealRecordTests.test_real_records_evidence_id_pattern) ... skipped 'no real record has evidence_url, released_url, or resolution_url; the evidence id pattern is not exercised on records/node_status'
+test_real_records_fresh_against_live_source_head (test_living_project_validation.RealRecordTests.test_real_records_fresh_against_live_source_head) ... skipped 'fresh records eng.d0-packet-allowlist-fix, eng.hard-gate, math.lifetime-remainder, math.side24-coefficient are not compared to a live source head; tools/validate_node_status.py performs no network fetch, so this check is skipped instead of passed'
+test_real_records_match_published_projection (test_living_project_validation.RealRecordTests.test_real_records_match_published_projection) ... ok
+test_real_records_owner_released_url_consistency (test_living_project_validation.RealRecordTests.test_real_records_owner_released_url_consistency) ... skipped 'every real record has owner null; owner/released_url consistency is not exercised (released_url must stay on the owner object and must not clear it)'
+test_real_records_required_fields (test_living_project_validation.RealRecordTests.test_real_records_required_fields) ... ok
+test_real_records_source_rev_equals_first_source (test_living_project_validation.RealRecordTests.test_real_records_source_rev_equals_first_source) ... ok
+test_clean_fixture_passes (test_living_project_validation.SyntheticValidatorTests.test_clean_fixture_passes) ... ok
+test_docstring_disclaims_proof_verification (test_living_project_validation.SyntheticValidatorTests.test_docstring_disclaims_proof_verification) ... ok
+test_every_fault_class_is_seeded (test_living_project_validation.SyntheticValidatorTests.test_every_fault_class_is_seeded) ... ok
+test_changed_quote_refused_before_projection (test_museum_data.MuseumDataTests.test_changed_quote_refused_before_projection) ... ok
+test_check_rejects_quote_identity_and_class_tampering (test_museum_data.MuseumDataTests.test_check_rejects_quote_identity_and_class_tampering) ... ok
+test_d1_row_without_its_review_record_refused (test_museum_data.MuseumDataTests.test_d1_row_without_its_review_record_refused) ... ok
+test_exact_fourteen_projections_and_distinct_d5_scopes (test_museum_data.MuseumDataTests.test_exact_fourteen_projections_and_distinct_d5_scopes) ... ok
+test_historical_snapshot_ignores_unrelated_working_tree_append (test_museum_data.MuseumDataTests.test_historical_snapshot_ignores_unrelated_working_tree_append) ... ok
+test_invalid_identity_fields_refused (test_museum_data.MuseumDataTests.test_invalid_identity_fields_refused) ... ok
+test_landed_packet_can_be_read_from_pinned_sparse_checkout (test_museum_data.MuseumDataTests.test_landed_packet_can_be_read_from_pinned_sparse_checkout) ... ok
+test_misdirected_review_pointer_refused (test_museum_data.MuseumDataTests.test_misdirected_review_pointer_refused) ... ok
+test_packet_selection_excludes_unknown_fork_packet (test_museum_data.MuseumDataTests.test_packet_selection_excludes_unknown_fork_packet) ... ok
+test_plain_fixture_directory_does_not_bypass_byte_verification (test_museum_data.MuseumDataTests.test_plain_fixture_directory_does_not_bypass_byte_verification) ... ok
+test_reconciled_d1_row_is_projected_from_status (test_museum_data.MuseumDataTests.test_reconciled_d1_row_is_projected_from_status) ... ok
+test_replay_commands_bind_source_and_checkout (test_museum_data.MuseumDataTests.test_replay_commands_bind_source_and_checkout) ... ok
+test_review_pointers_do_not_claim_comment_byte_custody (test_museum_data.MuseumDataTests.test_review_pointers_do_not_claim_comment_byte_custody) ... ok
+test_status_promotion_refused (test_museum_data.MuseumDataTests.test_status_promotion_refused) ... ok
+test_counts (test_navigation.NavigationTests.test_counts) ... ok
+test_custom_anchor (test_navigation.NavigationTests.test_custom_anchor) ... ok
+test_duplicate_headings (test_navigation.NavigationTests.test_duplicate_headings) ... ok
+test_duplicate_manifest_key (test_navigation.NavigationTests.test_duplicate_manifest_key) ... ok
+test_duplicate_page (test_navigation.NavigationTests.test_duplicate_page) ... ok
+test_fenced_examples_ignored (test_navigation.NavigationTests.test_fenced_examples_ignored) ... ok
+test_formatting_in_heading (test_navigation.NavigationTests.test_formatting_in_heading) ... ok
+test_invalid_boolean_size (test_navigation.NavigationTests.test_invalid_boolean_size) ... ok
+test_invalid_public_path (test_navigation.NavigationTests.test_invalid_public_path) ... ok
+test_missing_fragment (test_navigation.NavigationTests.test_missing_fragment) ... ok
+test_missing_page (test_navigation.NavigationTests.test_missing_page) ... ok
+test_no_implicit_network (test_navigation.NavigationTests.test_no_implicit_network) ... ok
+test_no_writes (test_navigation.NavigationTests.test_no_writes) ... ok
+test_percent_encoded_anchor (test_navigation.NavigationTests.test_percent_encoded_anchor) ... ok
+test_private_target_refused (test_navigation.NavigationTests.test_private_target_refused) ... ok
+test_public_changed_bytes (test_navigation.NavigationTests.test_public_changed_bytes) ... ok
+test_public_readback_exact (test_navigation.NavigationTests.test_public_readback_exact) ... ok
+test_public_transport_error (test_navigation.NavigationTests.test_public_transport_error) ... ok
+test_root_escape (test_navigation.NavigationTests.test_root_escape) ... ok
+test_symlink_rejected (test_navigation.NavigationTests.test_symlink_rejected) ... ok
+test_unlinked_target_refused (test_navigation.NavigationTests.test_unlinked_target_refused) ... ok
+test_unsupported_scheme (test_navigation.NavigationTests.test_unsupported_scheme) ... ok
+test_valid (test_navigation.NavigationTests.test_valid) ... ok
+test_malformed_summary_does_not_supply_a_positive_count (test_navigation_discovery.NavigationDiscoveryTests.test_malformed_summary_does_not_supply_a_positive_count) ... ok
+test_missing_normal_summary_is_rejected (test_navigation_discovery.NavigationDiscoveryTests.test_missing_normal_summary_is_rejected) ... ok
+test_nonzero_normal_exit_is_not_masked (test_navigation_discovery.NavigationDiscoveryTests.test_nonzero_normal_exit_is_not_masked) ... ok
+test_normal_zero_count_exit_zero_is_rejected (test_navigation_discovery.NavigationDiscoveryTests.test_normal_zero_count_exit_zero_is_rejected) ... ok
+test_positive_plural_summaries_reach_navigation (test_navigation_discovery.NavigationDiscoveryTests.test_positive_plural_summaries_reach_navigation) ... ok
+test_positive_singular_summaries_are_accepted (test_navigation_discovery.NavigationDiscoveryTests.test_positive_singular_summaries_are_accepted) ... ok
+test_positive_skipped_count_is_not_an_empty_suite (test_navigation_discovery.NavigationDiscoveryTests.test_positive_skipped_count_is_not_an_empty_suite) ... ok
+test_guide_outgoing_link_is_scanned (test_navigation_manifest.FormalGuideNavigationTests.test_guide_outgoing_link_is_scanned) ... ok
+test_manifest_lists_guide_once (test_navigation_manifest.FormalGuideNavigationTests.test_manifest_lists_guide_once) ... ok
+test_missing_guide_anchor_is_rejected (test_navigation_manifest.FormalGuideNavigationTests.test_missing_guide_anchor_is_rejected) ... ok
+test_missing_guide_target_is_rejected (test_navigation_manifest.FormalGuideNavigationTests.test_missing_guide_target_is_rejected) ... ok
+test_valid_guide_links (test_navigation_manifest.FormalGuideNavigationTests.test_valid_guide_links) ... ok
+test_all_repository_paths_are_positive_on_eligible_events (test_navigation_workflow.NavigationWorkflowTests.test_all_repository_paths_are_positive_on_eligible_events) ... ok
+test_empty_diff_has_no_path_based_rejection (test_navigation_workflow.NavigationWorkflowTests.test_empty_diff_has_no_path_based_rejection) ... ok
+test_entire_job_and_permissions_are_byte_preserved (test_navigation_workflow.NavigationWorkflowTests.test_entire_job_and_permissions_are_byte_preserved) ... ok
+test_event_negatives_remain_negative (test_navigation_workflow.NavigationWorkflowTests.test_event_negatives_remain_negative) ... ok
+test_filter_and_event_mutations_fail_closed (test_navigation_workflow.NavigationWorkflowTests.test_filter_and_event_mutations_fail_closed) ... ok
+test_manual_subscription_remains_separate (test_navigation_workflow.NavigationWorkflowTests.test_manual_subscription_remains_separate) ... ok
+test_normal_discovery_command_remains_exactly_once (test_navigation_workflow.NavigationWorkflowTests.test_normal_discovery_command_remains_exactly_once) ... ok
+test_unfiltered_event_contract (test_navigation_workflow.NavigationWorkflowTests.test_unfiltered_event_contract) ... ok
+test_changed_blob_or_directory_is_stale (test_node_status_refresh.GitObjectFreshnessTests.test_changed_blob_or_directory_is_stale) ... ok
+test_duplicate_or_unsupported_target_is_unknown (test_node_status_refresh.GitObjectFreshnessTests.test_duplicate_or_unsupported_target_is_unknown) ... ok
+test_object_type_change_is_stale_even_when_sha_text_matches (test_node_status_refresh.GitObjectFreshnessTests.test_object_type_change_is_stale_even_when_sha_text_matches) ... ok
+test_observation_must_bind_exact_url_pin_type_and_valid_hashes (test_node_status_refresh.GitObjectFreshnessTests.test_observation_must_bind_exact_url_pin_type_and_valid_hashes) ... ok
+test_raw_api_duplicate_object_keys_are_unknown (test_node_status_refresh.GitObjectFreshnessTests.test_raw_api_duplicate_object_keys_are_unknown) ... ok
+test_raw_api_valid_object_controls (test_node_status_refresh.GitObjectFreshnessTests.test_raw_api_valid_object_controls) ... ok
+test_raw_discussion_duplicate_timestamp_is_unknown (test_node_status_refresh.GitObjectFreshnessTests.test_raw_discussion_duplicate_timestamp_is_unknown) ... ok
+test_report_only_keeps_entire_original_record_bytes (test_node_status_refresh.GitObjectFreshnessTests.test_report_only_keeps_entire_original_record_bytes) ... ok
+test_snapshot_after_last_path_edit_is_fresh_for_same_blob (test_node_status_refresh.GitObjectFreshnessTests.test_snapshot_after_last_path_edit_is_fresh_for_same_blob) ... ok
+test_source_path_cannot_cross_a_file_or_use_dot_segments (test_node_status_refresh.GitObjectFreshnessTests.test_source_path_cannot_cross_a_file_or_use_dot_segments) ... ok
+test_unavailable_or_untrustworthy_object_is_unknown (test_node_status_refresh.GitObjectFreshnessTests.test_unavailable_or_untrustworthy_object_is_unknown) ... ok
+test_unchanged_directory_uses_tree_identity (test_node_status_refresh.GitObjectFreshnessTests.test_unchanged_directory_uses_tree_identity) ... ok
+test_url_kind_must_match_the_pinned_object (test_node_status_refresh.GitObjectFreshnessTests.test_url_kind_must_match_the_pinned_object) ... ok
+test_bad_source_remains_unknown (test_node_status_refresh.PaginationTests.test_bad_source_remains_unknown) ... ok
+test_complete_0000 (test_node_status_refresh.PaginationTests.test_complete_0000) ... ok
+test_complete_0001 (test_node_status_refresh.PaginationTests.test_complete_0001) ... ok
+test_complete_0099 (test_node_status_refresh.PaginationTests.test_complete_0099) ... ok
+test_complete_0100 (test_node_status_refresh.PaginationTests.test_complete_0100) ... ok
+test_complete_0101 (test_node_status_refresh.PaginationTests.test_complete_0101) ... ok
+test_complete_0999 (test_node_status_refresh.PaginationTests.test_complete_0999) ... ok
+test_complete_1000 (test_node_status_refresh.PaginationTests.test_complete_1000) ... ok
+test_complete_1001 (test_node_status_refresh.PaginationTests.test_complete_1001) ... ok
+test_complete_1500 (test_node_status_refresh.PaginationTests.test_complete_1500) ... ok
+test_complete_2499 (test_node_status_refresh.PaginationTests.test_complete_2499) ... ok
+test_complete_2500 (test_node_status_refresh.PaginationTests.test_complete_2500) ... ok
+test_complete_2599 (test_node_status_refresh.PaginationTests.test_complete_2599) ... ok
+test_explicit_release_1000 (test_node_status_refresh.PaginationTests.test_explicit_release_1000) ... ok
+test_explicit_release_1001 (test_node_status_refresh.PaginationTests.test_explicit_release_1001) ... ok
+test_explicit_release_2500 (test_node_status_refresh.PaginationTests.test_explicit_release_2500) ... ok
+test_failure_02_not_list (test_node_status_refresh.PaginationTests.test_failure_02_not_list) ... ok
+test_failure_02_not_object (test_node_status_refresh.PaginationTests.test_failure_02_not_object) ... ok
+test_failure_02_transport (test_node_status_refresh.PaginationTests.test_failure_02_transport) ... ok
+test_failure_26_not_list (test_node_status_refresh.PaginationTests.test_failure_26_not_list) ... ok
+test_failure_26_not_object (test_node_status_refresh.PaginationTests.test_failure_26_not_object) ... ok
+test_failure_26_transport (test_node_status_refresh.PaginationTests.test_failure_26_transport) ... ok
+test_full_2600_requires_unknown (test_node_status_refresh.PaginationTests.test_full_2600_requires_unknown) ... ok
+test_full_read_with_no_release_does_not_infer_one (test_node_status_refresh.PaginationTests.test_full_read_with_no_release_does_not_infer_one) ... ok
+test_incomplete_does_not_project_early_release (test_node_status_refresh.PaginationTests.test_incomplete_does_not_project_early_release) ... ok
+test_report_only_preserves_file (test_node_status_refresh.PaginationTests.test_report_only_preserves_file) ... ok
+test_stale_source_remains_stale (test_node_status_refresh.PaginationTests.test_stale_source_remains_stale) ... ok
+test_unsupported_evidence_never_fetches (test_node_status_refresh.PaginationTests.test_unsupported_evidence_never_fetches) ... ok
+test_wrong_release_reference_is_not_accepted (test_node_status_refresh.PaginationTests.test_wrong_release_reference_is_not_accepted) ... ok
+test_changed_rev_is_stale (test_node_status_refresh.RefreshTests.test_changed_rev_is_stale) ... ok
+test_dir_report_only_does_not_write (test_node_status_refresh.RefreshTests.test_dir_report_only_does_not_write) ... ok
+test_dir_write_mode (test_node_status_refresh.RefreshTests.test_dir_write_mode) ... ok
+test_discussion_updated_at_newer_is_stale_and_unfetched_is_unknown (test_node_status_refresh.RefreshTests.test_discussion_updated_at_newer_is_stale_and_unfetched_is_unknown) ... ok
+test_duplicate_json_key_is_unknown_and_not_rewritten (test_node_status_refresh.RefreshTests.test_duplicate_json_key_is_unknown_and_not_rewritten) ... ok
+test_empty_or_missing_source_revision_never_fresh (test_node_status_refresh.RefreshTests.test_empty_or_missing_source_revision_never_fresh) ... ok
+test_failure_never_fresh_even_if_other_source_ok (test_node_status_refresh.RefreshTests.test_failure_never_fresh_even_if_other_source_ok) ... ok
+test_github_fetch_preserves_discussion_timestamp_endpoints (test_node_status_refresh.RefreshTests.test_github_fetch_preserves_discussion_timestamp_endpoints) ... ok
+test_no_sources_or_bad_schema_is_unknown (test_node_status_refresh.RefreshTests.test_no_sources_or_bad_schema_is_unknown) ... ok
+test_owner_and_scientific_effect_untouched (test_node_status_refresh.RefreshTests.test_owner_and_scientific_effect_untouched) ... ok
+test_pinned_sha_accepted_and_other_rev_forms_unknown (test_node_status_refresh.RefreshTests.test_pinned_sha_accepted_and_other_rev_forms_unknown) ... ok
+test_pinned_url_trailing_newline_is_not_pinned (test_node_status_refresh.RefreshTests.test_pinned_url_trailing_newline_is_not_pinned) ... ok
+test_refresh_error_is_string_or_null (test_node_status_refresh.RefreshTests.test_refresh_error_is_string_or_null) ... ok
+test_release_comment_sets_released_url_only (test_node_status_refresh.RefreshTests.test_release_comment_sets_released_url_only) ... ok
+test_release_sets_released_url_only_for_matching_pickup_id (test_node_status_refresh.RefreshTests.test_release_sets_released_url_only_for_matching_pickup_id) ... ok
+test_report_only_includes_discovered_released_url (test_node_status_refresh.RefreshTests.test_report_only_includes_discovered_released_url) ... ok
+test_scientific_effect_forced_none_not_passed_through (test_node_status_refresh.RefreshTests.test_scientific_effect_forced_none_not_passed_through) ... ok
+test_source_rev_is_primary_and_moving_ref_is_not_stored (test_node_status_refresh.RefreshTests.test_source_rev_is_primary_and_moving_ref_is_not_stored) ... ok
+test_successful_refresh_clears_stale_refresh_error (test_node_status_refresh.RefreshTests.test_successful_refresh_clears_stale_refresh_error) ... ok
+test_unchanged_is_fresh (test_node_status_refresh.RefreshTests.test_unchanged_is_fresh) ... ok
+test_unreachable_is_unknown_with_error (test_node_status_refresh.RefreshTests.test_unreachable_is_unknown_with_error) ... ok
+test_unsupported_url_raises_source_error (test_node_status_refresh.RefreshTests.test_unsupported_url_raises_source_error) ... ok
+test_both_discoverable_dependencies_admit_synthetic_bodies (test_periodic_certificate_dependencies.PeriodicCertificateDependencies.test_both_discoverable_dependencies_admit_synthetic_bodies) ... ok
+test_core_certificate_methods_are_not_whole_module_skipped (test_periodic_certificate_dependencies.PeriodicCertificateDependencies.test_core_certificate_methods_are_not_whole_module_skipped) ... ok
+test_missing_either_or_both_dependencies_skips_numerical_methods (test_periodic_certificate_dependencies.PeriodicCertificateDependencies.test_missing_either_or_both_dependencies_skips_numerical_methods) ... ok
+test_present_but_broken_dependency_errors_remain_visible (test_periodic_certificate_dependencies.PeriodicCertificateDependencies.test_present_but_broken_dependency_errors_remain_visible) ... ok
+test_skips_explain_the_required_numerical_environment (test_periodic_certificate_dependencies.PeriodicCertificateDependencies.test_skips_explain_the_required_numerical_environment) ... ok
+test_another_run_attempt_cannot_reuse_custody (test_periodic_pilot_custody.PilotCustodyTests.test_another_run_attempt_cannot_reuse_custody) ... ok
+test_both_full_pipes_are_drained_with_bounded_raw_prefixes_and_full_hashes (test_periodic_pilot_custody.PilotCustodyTests.test_both_full_pipes_are_drained_with_bounded_raw_prefixes_and_full_hashes) ... ok
+test_changed_or_linked_raw_stream_is_excluded_from_upload (test_periodic_pilot_custody.PilotCustodyTests.test_changed_or_linked_raw_stream_is_excluded_from_upload) ... ok
+test_existing_custody_is_preserved (test_periodic_pilot_custody.PilotCustodyTests.test_existing_custody_is_preserved) ... ok
+test_existing_output_refuses_without_deletion_or_execution (test_periodic_pilot_custody.PilotCustodyTests.test_existing_output_refuses_without_deletion_or_execution) ... ok
+test_failed_pilot_preserves_nonzero_raw_stderr_and_skips_verify (test_periodic_pilot_custody.PilotCustodyTests.test_failed_pilot_preserves_nonzero_raw_stderr_and_skips_verify) ... ok
+test_interrupted_output_claim_retains_partial_bytes (test_periodic_pilot_custody.PilotCustodyTests.test_interrupted_output_claim_retains_partial_bytes) ... ok
+test_invalid_identity_creates_no_directory (test_periodic_pilot_custody.PilotCustodyTests.test_invalid_identity_creates_no_directory) ... ok
+test_output_symlink_and_hardlink_are_never_followed (test_periodic_pilot_custody.PilotCustodyTests.test_output_symlink_and_hardlink_are_never_followed) ... ok
+test_oversize_retains_only_prefix_without_full_digest_claim (test_periodic_pilot_custody.PilotCustodyTests.test_oversize_retains_only_prefix_without_full_digest_claim) ... ok
+test_post_execution_drift_causes_custody_hold (test_periodic_pilot_custody.PilotCustodyTests.test_post_execution_drift_causes_custody_hold) ... ok
+test_regular_raw_stream_tampering_is_excluded (test_periodic_pilot_custody.PilotCustodyTests.test_regular_raw_stream_tampering_is_excluded) ... ok
+test_second_execution_or_seal_cannot_rewrite_history (test_periodic_pilot_custody.PilotCustodyTests.test_second_execution_or_seal_cannot_rewrite_history) ... ok
+test_signal_exit_preserves_shell_failure_semantics (test_periodic_pilot_custody.PilotCustodyTests.test_signal_exit_preserves_shell_failure_semantics) ... ok
+test_source_drift_refuses_before_execution (test_periodic_pilot_custody.PilotCustodyTests.test_source_drift_refuses_before_execution) ... ok
+test_source_symlink_is_refused_with_initialization_error_and_no_read_retry (test_periodic_pilot_custody.PilotCustodyTests.test_source_symlink_is_refused_with_initialization_error_and_no_read_retry) ... ok
+test_spawn_failure_is_retained (test_periodic_pilot_custody.PilotCustodyTests.test_spawn_failure_is_retained) ... ok
+test_success_has_raw_bytes_outputs_native_identity_and_both_commands (test_periodic_pilot_custody.PilotCustodyTests.test_success_has_raw_bytes_outputs_native_identity_and_both_commands) ... ok
+test_successful_child_with_log_overflow_is_custody_failure (test_periodic_pilot_custody.PilotCustodyTests.test_successful_child_with_log_overflow_is_custody_failure) ... ok
+test_unexpected_nested_output_is_metadata_only (test_periodic_pilot_custody.PilotCustodyTests.test_unexpected_nested_output_is_metadata_only) ... ok
+test_upload_stage_has_only_explicit_guarded_members_and_manifest (test_periodic_pilot_custody.PilotCustodyTests.test_upload_stage_has_only_explicit_guarded_members_and_manifest) ... ok
+test_verify_failure_is_not_greenwashed (test_periodic_pilot_custody.PilotCustodyTests.test_verify_failure_is_not_greenwashed) ... ok
+test_workflow_failure_and_always_retention_contract (test_periodic_pilot_custody.PilotCustodyTests.test_workflow_failure_and_always_retention_contract) ... ok
+test_zero_child_exits_cannot_hide_missing_pilot_output (test_periodic_pilot_custody.PilotCustodyTests.test_zero_child_exits_cannot_hide_missing_pilot_output) ... ok
+test_s1a_clean_seal_with_non_success_status_is_not_pilot_success (test_periodic_pilot_custody.S1MutantGapTests.test_s1a_clean_seal_with_non_success_status_is_not_pilot_success) ... ok
+test_s1b_same_size_stream_tampering_is_held (test_periodic_pilot_custody.S1MutantGapTests.test_s1b_same_size_stream_tampering_is_held) ... ok
+test_s1b_same_size_tampering_after_inventory_refuses_stage (test_periodic_pilot_custody.S1MutantGapTests.test_s1b_same_size_tampering_after_inventory_refuses_stage) ... ok
+test_s1c_newline_or_cr_in_workflow_ref_is_refused (test_periodic_pilot_custody.S1MutantGapTests.test_s1c_newline_or_cr_in_workflow_ref_is_refused) ... ok
+test_output_scandir_oserror_exits_74 (test_periodic_pilot_custody_oserror.RawOSErrorExitTests.test_output_scandir_oserror_exits_74) ... ok
+test_upload_stage_mkdir_oserror_exits_74 (test_periodic_pilot_custody_oserror.RawOSErrorExitTests.test_upload_stage_mkdir_oserror_exits_74) ... ok
+test_a_claim_record_prevents_nothing_by_itself (test_pickup_fence.PickupFenceTest.test_a_claim_record_prevents_nothing_by_itself)
+B records a claim on the branch; A sees it and pushes anyway. Nothing stops the push. ... ok
+test_deletion_and_ordinary_recreation_is_not_prevented (test_pickup_fence.PickupFenceTest.test_deletion_and_ordinary_recreation_is_not_prevented)
+An ordinary divergent push rejects, but delete plus unforced recreation discards B. ... ok
+test_deliberate_rewrite_under_a_current_lease_is_not_prevented (test_pickup_fence.PickupFenceTest.test_deliberate_rewrite_under_a_current_lease_is_not_prevented)
+A fresh view that rewrites B's commit, with the explicit current lease, pushes: the lease ... ok
+test_force_with_lease_on_current_expected_head_is_allowed (test_pickup_fence.PickupFenceTest.test_force_with_lease_on_current_expected_head_is_allowed)
+A fresh view with a current lease pushes; this push is also a fast-forward. ... ok
+test_force_with_lease_on_stale_expected_head_is_prevented (test_pickup_fence.PickupFenceTest.test_force_with_lease_on_stale_expected_head_is_prevented) ... ok
+test_implicit_lease_after_unintegrated_fetch_is_not_prevented (test_pickup_fence.PickupFenceTest.test_implicit_lease_after_unintegrated_fetch_is_not_prevented)
+``--force-with-lease`` with no expected value trusts the remote-tracking ref, which a fetch ... ok
+test_implicit_lease_with_force_if_includes_is_prevented (test_pickup_fence.PickupFenceTest.test_implicit_lease_with_force_if_includes_is_prevented)
+``--force-if-includes`` closes the gap of the previous case. The option exists since git 2.30; ... ok
+test_plain_force_is_not_prevented (test_pickup_fence.PickupFenceTest.test_plain_force_is_not_prevented)
+A bare ``--force`` overwrites B's commit: this write is only discouraged by the workflow. ... ok
+test_plain_push_from_stale_view_is_prevented (test_pickup_fence.PickupFenceTest.test_plain_push_from_stale_view_is_prevented) ... ok
+test_api_failure_cannot_be_passed (test_public_intake.IntakeTests.test_api_failure_cannot_be_passed) ... ok
+test_blob_sha_tampering_refused (test_public_intake.IntakeTests.test_blob_sha_tampering_refused) ... ok
+test_bool_is_not_size_or_schema (test_public_intake.IntakeTests.test_bool_is_not_size_or_schema) ... ok
+test_branch_enumeration_stops_at_page_bound (test_public_intake.IntakeTests.test_branch_enumeration_stops_at_page_bound) ... ok
+test_catalog_source_paths_are_exact_tree_keys (test_public_intake.IntakeTests.test_catalog_source_paths_are_exact_tree_keys)
+#86 comment 5848311773 (OpenAI/Codex, claim OA-SUPPORT-INTAKE-20260926-1729): ... ok
+test_cli_pass_and_failure_are_distinct_without_network (test_public_intake.IntakeTests.test_cli_pass_and_failure_are_distinct_without_network) ... ok
+test_cli_untrusted_event_refused_before_network (test_public_intake.IntakeTests.test_cli_untrusted_event_refused_before_network) ... ok
+test_closed_unmerged_still_exits_1 (test_public_intake.IntakeTests.test_closed_unmerged_still_exits_1) ... ok
+test_common_credential_formats_refused_without_echo (test_public_intake.IntakeTests.test_common_credential_formats_refused_without_echo) ... ok
+test_compare_ahead_diverged_or_nonzero_ahead_by_refused (test_public_intake.IntakeTests.test_compare_ahead_diverged_or_nonzero_ahead_by_refused) ... ok
+test_compare_non_404_http_error_still_rejects (test_public_intake.IntakeTests.test_compare_non_404_http_error_still_rejects) ... ok
+test_complete_pagination_before_maintainer_bypass (test_public_intake.IntakeTests.test_complete_pagination_before_maintainer_bypass) ... ok
+test_credential_lookalikes_in_prose_accepted (test_public_intake.IntakeTests.test_credential_lookalikes_in_prose_accepted)
+False-positive guards: identifiers that share a prefix, a one-dot pair, ... ok
+test_deleted_or_modified_intake_refused (test_public_intake.IntakeTests.test_deleted_or_modified_intake_refused) ... ok
+test_device_name_with_end_of_stem_space_refused_at_cli_boundary (test_public_intake.IntakeTests.test_device_name_with_end_of_stem_space_refused_at_cli_boundary) ... ok
+test_digest_must_be_sha256_and_commit_must_be_40_hex (test_public_intake.IntakeTests.test_digest_must_be_sha256_and_commit_must_be_40_hex) ... ok
+test_event_queued_before_merge_is_not_a_rejection (test_public_intake.IntakeTests.test_event_queued_before_merge_is_not_a_rejection) ... ok
+test_existing_package_is_immutable (test_public_intake.IntakeTests.test_existing_package_is_immutable) ... ok
+test_fabricated_source_in_fork_head_ancestor_refused (test_public_intake.IntakeTests.test_fabricated_source_in_fork_head_ancestor_refused) ... ok
+test_false_scientific_status_refused (test_public_intake.IntakeTests.test_false_scientific_status_refused) ... ok
+test_finite_numbers_accepted_and_literal_refusals_kept (test_public_intake.IntakeTests.test_finite_numbers_accepted_and_literal_refusals_kept) ... ok
+test_float_valued_size_and_schema_still_refused (test_public_intake.IntakeTests.test_float_valued_size_and_schema_still_refused) ... ok
+test_fork_cannot_modify_guard_without_label (test_public_intake.IntakeTests.test_fork_cannot_modify_guard_without_label) ... ok
+test_google_key_boundaries_follow_its_alphabet (test_public_intake.IntakeTests.test_google_key_boundaries_follow_its_alphabet)
+PR #240 review 5966056876 F2: the pattern admitted '-' in its body but closed ... ok
+test_invalid_png_refused_without_decoding_image (test_public_intake.IntakeTests.test_invalid_png_refused_without_decoding_image) ... ok
+test_known_credential_in_package_path_is_refused_without_logging (test_public_intake.IntakeTests.test_known_credential_in_package_path_is_refused_without_logging) ... ok
+test_known_secret_refused_without_printing_value (test_public_intake.IntakeTests.test_known_secret_refused_without_printing_value) ... ok
+test_label_alone_restricts_engineering_edits (test_public_intake.IntakeTests.test_label_alone_restricts_engineering_edits) ... ok
+test_label_removal_does_not_bypass_same_repo_incoming (test_public_intake.IntakeTests.test_label_removal_does_not_bypass_same_repo_incoming) ... ok
+test_landed_packets_keep_passing_the_component_grammar (test_public_intake.IntakeTests.test_landed_packets_keep_passing_the_component_grammar)
+Census over the landed packets in this checkout: every artifact row of every ... ok
+test_landed_packets_keep_passing_the_credential_scan (test_public_intake.IntakeTests.test_landed_packets_keep_passing_the_credential_scan)
+Census over the landed packets in this checkout: every artifact file and ... ok
+test_malformed_compare_response_is_never_reachability (test_public_intake.IntakeTests.test_malformed_compare_response_is_never_reachability) ... ok
+test_merged_before_check_exits_78_and_is_not_success (test_public_intake.IntakeTests.test_merged_before_check_exits_78_and_is_not_success) ... ok
+test_merged_pr_with_different_head_or_unmerged_close_still_refused (test_public_intake.IntakeTests.test_merged_pr_with_different_head_or_unmerged_close_still_refused) ... ok
+test_missing_head_and_stale_head_fail_closed (test_public_intake.IntakeTests.test_missing_head_and_stale_head_fail_closed) ... ok
+test_missing_or_false_digest_refused (test_public_intake.IntakeTests.test_missing_or_false_digest_refused) ... ok
+test_non_open_pr_and_wrong_base_are_refused (test_public_intake.IntakeTests.test_non_open_pr_and_wrong_base_are_refused) ... ok
+test_nonfinite_and_invalid_utf8_json_refused (test_public_intake.IntakeTests.test_nonfinite_and_invalid_utf8_json_refused) ... ok
+test_nonfinite_number_tokens_refused_in_any_nesting_and_sign (test_public_intake.IntakeTests.test_nonfinite_number_tokens_refused_in_any_nesting_and_sign) ... ok
+test_not_evaluated_check_is_neutral_and_never_success (test_public_intake.IntakeTests.test_not_evaluated_check_is_neutral_and_never_success) ... ok
+test_ordinary_same_repo_engineering_is_allowed (test_public_intake.IntakeTests.test_ordinary_same_repo_engineering_is_allowed) ... ok
+test_orphan_branch_404_alone_is_not_reachability (test_public_intake.IntakeTests.test_orphan_branch_404_alone_is_not_reachability) ... ok
+test_orphan_branch_404_does_not_vouch_and_scan_continues (test_public_intake.IntakeTests.test_orphan_branch_404_does_not_vouch_and_scan_continues) ... ok
+test_overflowing_json_number_refused_at_cli_boundary (test_public_intake.IntakeTests.test_overflowing_json_number_refused_at_cli_boundary)
+Ported from the OpenAI/Codex probe in #86 comment 5848311773 (claim ... ok
+test_package_and_artifact_grammar_still_refuses_source_characters (test_public_intake.IntakeTests.test_package_and_artifact_grammar_still_refuses_source_characters) ... ok
+test_package_path_length_bounded_like_source_paths (test_public_intake.IntakeTests.test_package_path_length_bounded_like_source_paths) ... ok
+test_path_escape_and_active_content_refused (test_public_intake.IntakeTests.test_path_escape_and_active_content_refused) ... ok
+test_png_archive_polyglots_refused (test_public_intake.IntakeTests.test_png_archive_polyglots_refused) ... ok
+test_png_chunk_structure_refused (test_public_intake.IntakeTests.test_png_chunk_structure_refused) ... ok
+test_png_corrupt_chunk_crc_refused (test_public_intake.IntakeTests.test_png_corrupt_chunk_crc_refused) ... ok
+test_png_dimension_bomb_refused_without_decoding (test_public_intake.IntakeTests.test_png_dimension_bomb_refused_without_decoding) ... ok
+test_portable_package_components_accepted (test_public_intake.IntakeTests.test_portable_package_components_accepted) ... ok
+test_pr_race_fails_at_final_readback (test_public_intake.IntakeTests.test_pr_race_fails_at_final_readback) ... ok
+test_private_and_foreign_sources_refused (test_public_intake.IntakeTests.test_private_and_foreign_sources_refused) ... ok
+test_protected_status_and_claim_paths_refused (test_public_intake.IntakeTests.test_protected_status_and_claim_paths_refused) ... ok
+test_public_catalog_census_splits_source_and_package_grammar (test_public_intake.IntakeTests.test_public_catalog_census_splits_source_and_package_grammar)
+Path-only census of docs/public-math, no network, from #86 comment 5848311773. ... ok
+test_publish_flag_failure_is_not_a_successful_intake (test_public_intake.IntakeTests.test_publish_flag_failure_is_not_a_successful_intake) ... ok
+test_reachable_commit_never_vouches_for_another_commit (test_public_intake.IntakeTests.test_reachable_commit_never_vouches_for_another_commit) ... ok
+test_reachable_default_branch_costs_one_compare_call (test_public_intake.IntakeTests.test_reachable_default_branch_costs_one_compare_call) ... ok
+test_rename_from_status_cannot_hide_as_incoming (test_public_intake.IntakeTests.test_rename_from_status_cannot_hide_as_incoming) ... ok
+test_renamed_out_of_incoming_still_routes_to_intake (test_public_intake.IntakeTests.test_renamed_out_of_incoming_still_routes_to_intake) ... ok
+test_repeated_source_commit_is_scanned_once (test_public_intake.IntakeTests.test_repeated_source_commit_is_scanned_once) ... ok
+test_repeated_unreachable_source_commit_still_rejects (test_public_intake.IntakeTests.test_repeated_unreachable_source_commit_still_rejects) ... ok
+test_required_intake_job_cannot_skip_merged_event_payload (test_public_intake.IntakeTests.test_required_intake_job_cannot_skip_merged_event_payload) ... ok
+test_second_package_refused (test_public_intake.IntakeTests.test_second_package_refused) ... ok
+test_self_citation_of_pr_head_refused (test_public_intake.IntakeTests.test_self_citation_of_pr_head_refused) ... ok
+test_size_limits_apply_before_blob_fetch (test_public_intake.IntakeTests.test_size_limits_apply_before_blob_fetch) ... ok
+test_source_commit_must_resolve_to_exact_commit (test_public_intake.IntakeTests.test_source_commit_must_resolve_to_exact_commit) ... ok
+test_source_pin_and_public_bytes_verified (test_public_intake.IntakeTests.test_source_pin_and_public_bytes_verified) ... ok
+test_source_reachable_only_from_research_branch_accepted (test_public_intake.IntakeTests.test_source_reachable_only_from_research_branch_accepted) ... ok
+test_source_rows_keep_the_tree_key_grammar (test_public_intake.IntakeTests.test_source_rows_keep_the_tree_key_grammar) ... ok
+test_source_symlink_refused_despite_file_like_contents_response (test_public_intake.IntakeTests.test_source_symlink_refused_despite_file_like_contents_response) ... ok
+test_source_tree_and_blob_sha_must_match (test_public_intake.IntakeTests.test_source_tree_and_blob_sha_must_match) ... ok
+test_source_tree_checks_follow_source_path_acceptance (test_public_intake.IntakeTests.test_source_tree_checks_follow_source_path_acceptance) ... ok
+test_symlink_and_executable_and_submodule_refused (test_public_intake.IntakeTests.test_symlink_and_executable_and_submodule_refused) ... ok
+test_transport_does_not_follow_redirects (test_public_intake.IntakeTests.test_transport_does_not_follow_redirects) ... ok
+test_truncated_tree_and_file_listing_refused (test_public_intake.IntakeTests.test_truncated_tree_and_file_listing_refused) ... ok
+test_unlisted_artifact_and_duplicate_manifest_key_refused (test_public_intake.IntakeTests.test_unlisted_artifact_and_duplicate_manifest_key_refused) ... ok
+test_unportable_component_refused_at_cli_boundary_without_echo (test_public_intake.IntakeTests.test_unportable_component_refused_at_cli_boundary_without_echo) ... ok
+test_unportable_package_components_refused (test_public_intake.IntakeTests.test_unportable_package_components_refused)
+A 300-byte component (git: 'File name too long' on ext4/APFS/NTFS), components ... ok
+test_unsafe_default_branch_is_skipped_and_branch_list_consulted (test_public_intake.IntakeTests.test_unsafe_default_branch_is_skipped_and_branch_list_consulted) ... ok
+test_unsafe_source_paths_refused_before_source_fetch (test_public_intake.IntakeTests.test_unsafe_source_paths_refused_before_source_fetch) ... ok
+test_valid_fork_without_label_is_restricted_and_verified (test_public_intake.IntakeTests.test_valid_fork_without_label_is_restricted_and_verified) ... ok
+test_valid_png_variants_accepted (test_public_intake.IntakeTests.test_valid_png_variants_accepted) ... ok
+test_workflow_maps_exit_78_to_neutral_and_never_success (test_public_intake.IntakeTests.test_workflow_maps_exit_78_to_neutral_and_never_success) ... ok
+test_exact_artifact_rows_are_accepted (test_public_intake_artifact_identity_control.ArtifactIdentityControl.test_exact_artifact_rows_are_accepted) ... ok
+test_overstated_byte_count_with_the_right_digest_is_refused (test_public_intake_artifact_identity_control.ArtifactIdentityControl.test_overstated_byte_count_with_the_right_digest_is_refused) ... ok
+test_same_length_wrong_digest_is_refused (test_public_intake_artifact_identity_control.ArtifactIdentityControl.test_same_length_wrong_digest_is_refused) ... ok
+test_understated_byte_count_with_the_right_digest_is_refused_by_the_cli (test_public_intake_artifact_identity_control.ArtifactIdentityControl.test_understated_byte_count_with_the_right_digest_is_refused_by_the_cli) ... ok
+test_browser_dependencies_are_separate_and_version_pinned (test_public_shop_browser_contract.BrowserCheckContract.test_browser_dependencies_are_separate_and_version_pinned) ... ok
+test_browser_job_is_read_only_and_retains_failure_artifacts (test_public_shop_browser_contract.BrowserCheckContract.test_browser_job_is_read_only_and_retains_failure_artifacts) ... ok
+test_runner_is_loopback_only_with_a_four_case_matrix (test_public_shop_browser_contract.BrowserCheckContract.test_runner_is_loopback_only_with_a_four_case_matrix) ... ok
+test_bibtex_browser_checks_compare_real_clipboard_and_keep_failure_paths (test_public_shop_browser_contract.ReaderSourceBrowserContract.test_bibtex_browser_checks_compare_real_clipboard_and_keep_failure_paths) ... ok
+test_bibtex_disabled_checks_keep_the_hidden_button_addressable (test_public_shop_browser_contract.ReaderSourceBrowserContract.test_bibtex_disabled_checks_keep_the_hidden_button_addressable) ... ok
+test_clipboard_denial_fixture_reinitializes_after_same_document_history (test_public_shop_browser_contract.ReaderSourceBrowserContract.test_clipboard_denial_fixture_reinitializes_after_same_document_history) ... ok
+test_existing_runner_covers_source_quote_and_keyboard_disclosure (test_public_shop_browser_contract.ReaderSourceBrowserContract.test_existing_runner_covers_source_quote_and_keyboard_disclosure) ... ok
+test_new_reader_controls_are_reached_by_the_existing_browser_flows (test_public_shop_browser_contract.ReaderSourceBrowserContract.test_new_reader_controls_are_reached_by_the_existing_browser_flows) ... ok
+test_other_teaching_exports_are_reached_in_the_four_source_cases (test_public_shop_browser_contract.ReaderSourceBrowserContract.test_other_teaching_exports_are_reached_in_the_four_source_cases) ... ok
+test_pin_source_enumeration_preserves_the_downloaded_artifact_path (test_public_shop_browser_contract.ReaderSourceBrowserContract.test_pin_source_enumeration_preserves_the_downloaded_artifact_path) ... ok
+test_reader_tools_have_desktop_and_mobile_browser_evidence (test_public_shop_browser_contract.ReaderSourceBrowserContract.test_reader_tools_have_desktop_and_mobile_browser_evidence) ... ok
+test_rendered_layout_cases_read_what_the_browser_drew (test_public_shop_browser_contract.ReaderSourceBrowserContract.test_rendered_layout_cases_read_what_the_browser_drew) ... ok
+test_declared_length_mismatch_is_refused_even_with_the_right_digest (test_public_shop_check_identity_control.PublicShopIdentityControl.test_declared_length_mismatch_is_refused_even_with_the_right_digest) ... ok
+test_exact_pinned_bytes_are_accepted_and_handed_downstream (test_public_shop_check_identity_control.PublicShopIdentityControl.test_exact_pinned_bytes_are_accepted_and_handed_downstream) ... ok
+test_same_length_substituted_bytes_are_refused (test_public_shop_check_identity_control.PublicShopIdentityControl.test_same_length_substituted_bytes_are_refused) ... ok
+test_short_commit_is_refused_before_fetch (test_public_shop_check_identity_control.PublicShopIdentityControl.test_short_commit_is_refused_before_fetch) ... ok
+test_url_not_derived_from_the_pin_is_refused_before_fetch (test_public_shop_check_identity_control.PublicShopIdentityControl.test_url_not_derived_from_the_pin_is_refused_before_fetch) ... ok
+test_changed_inventory_manifest_refused (test_public_shop_data.PublicShopDataTests.test_changed_inventory_manifest_refused) ... ok
+test_changed_source_bytes_refused_before_parsing (test_public_shop_data.PublicShopDataTests.test_changed_source_bytes_refused_before_parsing) ... ok
+test_changed_table_schema_refused (test_public_shop_data.PublicShopDataTests.test_changed_table_schema_refused) ... ok
+test_coefficient_endpoints_stay_exact_strings (test_public_shop_data.PublicShopDataTests.test_coefficient_endpoints_stay_exact_strings) ... ok
+test_coefficient_float_or_added_dimension_refused (test_public_shop_data.PublicShopDataTests.test_coefficient_float_or_added_dimension_refused) ... ok
+test_config_export_roundtrips_museum_bytes_and_refuses_changed_manifest (test_public_shop_data.PublicShopDataTests.test_config_export_roundtrips_museum_bytes_and_refuses_changed_manifest) ... ok
+test_extra_table_cell_refused (test_public_shop_data.PublicShopDataTests.test_extra_table_cell_refused) ... ok
+test_inventory_uses_original_shards_and_detects_tampering (test_public_shop_data.PublicShopDataTests.test_inventory_uses_original_shards_and_detects_tampering) ... ok
+test_missing_status_section_refused (test_public_shop_data.PublicShopDataTests.test_missing_status_section_refused) ... ok
+test_pinned_status_counts_and_verbatim_scope (test_public_shop_data.PublicShopDataTests.test_pinned_status_counts_and_verbatim_scope) ... ok
+test_raw_urls_are_commit_pinned (test_public_shop_data.PublicShopDataTests.test_raw_urls_are_commit_pinned) ... ok
+test_unknown_heading_refused_even_with_matching_identity (test_public_shop_data.PublicShopDataTests.test_unknown_heading_refused_even_with_matching_identity) ... ok
+test_ascii_json_expansion_cannot_exceed_payload_limit (test_public_vector_index.PublicVectorIndexTests.test_ascii_json_expansion_cannot_exceed_payload_limit) ... ok
+test_checker_refuses_modified_metadata_text_vectors_or_noncanonical_json (test_public_vector_index.PublicVectorIndexTests.test_checker_refuses_modified_metadata_text_vectors_or_noncanonical_json) ... ok
+test_chunk_ranges_cover_source_once_and_identity_survives_unrelated_commit (test_public_vector_index.PublicVectorIndexTests.test_chunk_ranges_cover_source_once_and_identity_survives_unrelated_commit) ... ok
+test_cli_build_check_log_reconstruct_search_and_stale_failure (test_public_vector_index.PublicVectorIndexTests.test_cli_build_check_log_reconstruct_search_and_stale_failure) ... ok
+test_cli_log_cannot_export_forged_local_payload (test_public_vector_index.PublicVectorIndexTests.test_cli_log_cannot_export_forged_local_payload) ... ok
+test_cli_search_refuses_stale_or_canonically_serialized_tampering (test_public_vector_index.PublicVectorIndexTests.test_cli_search_refuses_stale_or_canonically_serialized_tampering) ... ok
+test_combined_source_limit_fails_instead_of_partial_index (test_public_vector_index.PublicVectorIndexTests.test_combined_source_limit_fails_instead_of_partial_index) ... ok
+test_corrupt_git_object_cannot_become_trusted_source (test_public_vector_index.PublicVectorIndexTests.test_corrupt_git_object_cannot_become_trusted_source) ... ok
+test_full_rebuild_drops_deleted_documents_without_carryover (test_public_vector_index.PublicVectorIndexTests.test_full_rebuild_drops_deleted_documents_without_carryover) ... ok
+test_git_replace_cannot_substitute_source_bytes (test_public_vector_index.PublicVectorIndexTests.test_git_replace_cannot_substitute_source_bytes) ... ok
+test_git_timeout_covers_a_child_that_produces_no_stdout_or_eof (test_public_vector_index.PublicVectorIndexTests.test_git_timeout_covers_a_child_that_produces_no_stdout_or_eof) ... ok
+test_log_missing_duplicate_reordered_or_corrupt_chunks_fail_closed (test_public_vector_index.PublicVectorIndexTests.test_log_missing_duplicate_reordered_or_corrupt_chunks_fail_closed) ... ok
+test_log_oversize_declared_or_actual_payload_is_refused (test_public_vector_index.PublicVectorIndexTests.test_log_oversize_declared_or_actual_payload_is_refused) ... ok
+test_log_roundtrip_accepts_timestamped_github_lines_and_checks_raw_digest (test_public_vector_index.PublicVectorIndexTests.test_log_roundtrip_accepts_timestamped_github_lines_and_checks_raw_digest) ... ok
+test_no_remaining_allowlisted_records_produces_empty_index (test_public_vector_index.PublicVectorIndexTests.test_no_remaining_allowlisted_records_produces_empty_index) ... ok
+test_nonregular_parent_of_allowlisted_path_is_refused (test_public_vector_index.PublicVectorIndexTests.test_nonregular_parent_of_allowlisted_path_is_refused) ... ok
+test_other_repository_origin_is_refused (test_public_vector_index.PublicVectorIndexTests.test_other_repository_origin_is_refused) ... ok
+test_output_refuses_symlink_parent_directory (test_public_vector_index.PublicVectorIndexTests.test_output_refuses_symlink_parent_directory) ... ok
+test_output_write_is_external_atomic_and_refuses_symlinks_or_checkout (test_public_vector_index.PublicVectorIndexTests.test_output_write_is_external_atomic_and_refuses_symlinks_or_checkout) ... ok
+test_pinned_git_bytes_exclude_dirty_untracked_and_nonallowlisted_records (test_public_vector_index.PublicVectorIndexTests.test_pinned_git_bytes_exclude_dirty_untracked_and_nonallowlisted_records) ... ok
+test_public_node_record_is_retrievable_with_original_owner_stops_and_links (test_public_vector_index.PublicVectorIndexTests.test_public_node_record_is_retrievable_with_original_owner_stops_and_links) ... ok
+test_repeated_build_is_byte_exact_ascii_json_without_run_metadata (test_public_vector_index.PublicVectorIndexTests.test_repeated_build_is_byte_exact_ascii_json_without_run_metadata) ... ok
+test_search_ties_are_sorted_by_path_and_character_range (test_public_vector_index.PublicVectorIndexTests.test_search_ties_are_sorted_by_path_and_character_range) ... ok
+test_source_byte_and_utf8_limits_fail_closed (test_public_vector_index.PublicVectorIndexTests.test_source_byte_and_utf8_limits_fail_closed) ... ok
+test_source_commit_requires_full_lowercase_sha1_and_expected_commit (test_public_vector_index.PublicVectorIndexTests.test_source_commit_requires_full_lowercase_sha1_and_expected_commit) ... ok
+test_sparse_vectors_count_lexical_tokens_and_search_returns_pinned_source (test_public_vector_index.PublicVectorIndexTests.test_sparse_vectors_count_lexical_tokens_and_search_returns_pinned_source) ... ok
+test_symlink_executable_and_submodule_allowlist_entries_are_refused (test_public_vector_index.PublicVectorIndexTests.test_symlink_executable_and_submodule_allowlist_entries_are_refused) ... ok
+test_temporary_filename_collision_preserves_preexisting_file (test_public_vector_index.PublicVectorIndexTests.test_temporary_filename_collision_preserves_preexisting_file) ... ok
+test_changed_byte_is_not_hidden (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_changed_byte_is_not_hidden) ... skipped 'installed pytest required'
+test_clean_root_run_prevents_package_bytecode (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_clean_root_run_prevents_package_bytecode) ... skipped 'installed pytest required'
+test_dirty_bytecode_is_preserved_and_rejected (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_dirty_bytecode_is_preserved_and_rejected) ... skipped 'installed pytest required'
+test_discovery_keeps_neighbours_and_same_basename (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_discovery_keeps_neighbours_and_same_basename) ... skipped 'installed pytest required'
+test_empty_cache_directory_is_accepted (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_empty_cache_directory_is_accepted) ... skipped 'installed pytest required'
+test_exclusion_is_exact (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_exclusion_is_exact) ... skipped 'installed pytest required'
+test_explicit_B_baseline_works (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_explicit_B_baseline_works) ... skipped 'installed pytest required'
+test_extra_file_is_not_hidden (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_extra_file_is_not_hidden) ... skipped 'installed pytest required'
+test_missing_file_is_not_hidden (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_missing_file_is_not_hidden) ... skipped 'installed pytest required'
+test_neighbour_failures_are_not_suppressed (test_pytest_bytecode_policy.PytestBytecodePolicyTests.test_neighbour_failures_are_not_suppressed) ... skipped 'installed pytest required'
+test_browser_flows_cover_the_new_cut (test_reader_links.FiniteH0LifetimeReading.test_browser_flows_cover_the_new_cut) ... ok
+test_card_status_rows_use_the_glossary_type_not_monospace (test_reader_links.FiniteH0LifetimeReading.test_card_status_rows_use_the_glossary_type_not_monospace) ... ok
+test_cut_sits_below_the_10_october_cut_and_links_to_the_7_october_cut_and_upstream (test_reader_links.FiniteH0LifetimeReading.test_cut_sits_below_the_10_october_cut_and_links_to_the_7_october_cut_and_upstream) ... ok
+test_earlier_notes_are_restated_with_their_qualifiers_and_without_links (test_reader_links.FiniteH0LifetimeReading.test_earlier_notes_are_restated_with_their_qualifiers_and_without_links) ... ok
+test_forbidden_words_and_later_source_details_are_absent (test_reader_links.FiniteH0LifetimeReading.test_forbidden_words_and_later_source_details_are_absent) ... ok
+test_one_card_one_face_pin_three_status_rows_and_neutral_classes (test_reader_links.FiniteH0LifetimeReading.test_one_card_one_face_pin_three_status_rows_and_neutral_classes) ... ok
+test_pinned_items_carry_only_their_digest_and_the_digests_match_the_pinned_bytes (test_reader_links.FiniteH0LifetimeReading.test_pinned_items_carry_only_their_digest_and_the_digests_match_the_pinned_bytes) ... ok
+test_quoted_phrases_are_verbatim_in_their_pinned_sources (test_reader_links.FiniteH0LifetimeReading.test_quoted_phrases_are_verbatim_in_their_pinned_sources) ... ok
+test_status_words_quote_pass_and_the_source_label_without_rewording_other_rows (test_reader_links.FiniteH0LifetimeReading.test_status_words_quote_pass_and_the_source_label_without_rewording_other_rows) ... ok
+test_two_estimands_keep_their_exponents_and_no_coefficient_value (test_reader_links.FiniteH0LifetimeReading.test_two_estimands_keep_their_exponents_and_no_coefficient_value) ... ok
+test_coverage_and_exclusions_match_all_pinned_source_rows (test_reader_links.FormalCoverage.test_coverage_and_exclusions_match_all_pinned_source_rows) ... ok
+test_since_section_dates_specifications_read_and_keeps_its_boundary (test_reader_links.FormalCoverage.test_since_section_dates_specifications_read_and_keeps_its_boundary) ... ok
+test_static_disclosure_retains_historical_source_and_alignment_boundary (test_reader_links.FormalCoverage.test_static_disclosure_retains_historical_source_and_alignment_boundary) ... ok
+test_actual_bar_additions_retain_conditional_population_and_open_consumer (test_reader_links.LatestPublicWork.test_actual_bar_additions_retain_conditional_population_and_open_consumer) ... ok
+test_historical_library_and_deliberately_mutable_navigation_are_labeled (test_reader_links.LatestPublicWork.test_historical_library_and_deliberately_mutable_navigation_are_labeled) ... ok
+test_issue_refresh_preserves_actual_field_and_model_distinctions (test_reader_links.LatestPublicWork.test_issue_refresh_preserves_actual_field_and_model_distinctions) ... ok
+test_landed_chain_has_pinned_proofs_and_separate_review_routes (test_reader_links.LatestPublicWork.test_landed_chain_has_pinned_proofs_and_separate_review_routes) ... ok
+test_landed_formal_packet_and_issue_proofs_remain_distinct (test_reader_links.LatestPublicWork.test_landed_formal_packet_and_issue_proofs_remain_distinct) ... ok
+test_latest_reading_sources_allow_only_observed_public_hosts (test_reader_links.LatestPublicWork.test_latest_reading_sources_allow_only_observed_public_hosts) ... ok
+test_latest_work_browser_route_has_keyboard_and_no_fetch_checks (test_reader_links.LatestPublicWork.test_latest_work_browser_route_has_keyboard_and_no_fetch_checks) ... ok
+test_latest_work_is_reachable_without_javascript (test_reader_links.LatestPublicWork.test_latest_work_is_reachable_without_javascript) ... ok
+test_changed_path_and_misattributed_hash_do_not_pass_exact_pin_check (test_reader_links.LatestReviewRegressionControls.test_changed_path_and_misattributed_hash_do_not_pass_exact_pin_check) ... ok
+test_fragment_landmarks_have_authored_visible_focus (test_reader_links.LatestReviewRegressionControls.test_fragment_landmarks_have_authored_visible_focus) ... ok
+test_addendum_cannot_replace_a_pinned_proof_with_a_branch_or_different_object (test_reader_links.LatestSourceControls.test_addendum_cannot_replace_a_pinned_proof_with_a_branch_or_different_object) ... ok
+test_endpoint_addendum_rejects_wrong_sources_or_swapped_review_hashes (test_reader_links.LatestSourceControls.test_endpoint_addendum_rejects_wrong_sources_or_swapped_review_hashes) ... ok
+test_mutable_private_or_stale_pinned_source_substitutions_fail_closed (test_reader_links.LatestSourceControls.test_mutable_private_or_stale_pinned_source_substitutions_fail_closed) ... ok
+test_pinned_citations_are_exact_and_hashes_retain_the_checked_identity (test_reader_links.LatestSourceControls.test_pinned_citations_are_exact_and_hashes_retain_the_checked_identity) ... ok
+test_sampling_sources_reject_mutable_paths_duplicates_and_unbound_hashes (test_reader_links.LatestSourceControls.test_sampling_sources_reject_mutable_paths_duplicates_and_unbound_hashes) ... ok
+test_aside_names_routes_without_status_words (test_reader_links.NewerWorkRoutes.test_aside_names_routes_without_status_words) ... ok
+test_entry_wording_names_cuts_and_the_index_as_selections (test_reader_links.NewerWorkRoutes.test_entry_wording_names_cuts_and_the_index_as_selections) ... ok
+test_every_route_is_a_branch_listing_or_discussion_never_a_commit (test_reader_links.NewerWorkRoutes.test_every_route_is_a_branch_listing_or_discussion_never_a_commit) ... ok
+test_historical_board_is_never_called_active_on_any_page (test_reader_links.NewerWorkRoutes.test_historical_board_is_never_called_active_on_any_page) ... ok
+test_routes_reach_both_repositories_and_the_board_in_use (test_reader_links.NewerWorkRoutes.test_routes_reach_both_repositories_and_the_board_in_use) ... ok
+test_workspace_contribute_routes_match_the_aside (test_reader_links.NewerWorkRoutes.test_workspace_contribute_routes_match_the_aside) ... ok
+test_cap_card_keeps_the_elder_death_hypotheses (test_reader_links.October7Reading.test_cap_card_keeps_the_elder_death_hypotheses) ... ok
+test_landed_and_candidate_work_stay_distinct (test_reader_links.October7Reading.test_landed_and_candidate_work_stay_distinct) ... ok
+test_new_cut_is_dated_first_and_links_back_and_forward (test_reader_links.October7Reading.test_new_cut_is_dated_first_and_links_back_and_forward) ... ok
+test_open_proposals_are_never_called_landed (test_reader_links.October7Reading.test_open_proposals_are_never_called_landed) ... ok
+test_bare_and_prefixed_proposals_above_cut_still_fail (test_reader_links.ProposalNumberGuardRegression.test_bare_and_prefixed_proposals_above_cut_still_fail) ... ok
+test_capacity_prose_and_links_after_numeric_fields_still_fail (test_reader_links.ProposalNumberGuardRegression.test_capacity_prose_and_links_after_numeric_fields_still_fail) ... ok
+test_compact_proposal_references_in_static_generated_and_cut_text_still_fail (test_reader_links.ProposalNumberGuardRegression.test_compact_proposal_references_in_static_generated_and_cut_text_still_fail) ... ok
+test_digest_attribute_does_not_name_proposals (test_reader_links.ProposalNumberGuardRegression.test_digest_attribute_does_not_name_proposals) ... ok
+test_extra_proposal_in_cut_text_still_fails (test_reader_links.ProposalNumberGuardRegression.test_extra_proposal_in_cut_text_still_fails) ... ok
+test_forbidden_claims_and_independence_content_still_fail (test_reader_links.ProposalNumberGuardRegression.test_forbidden_claims_and_independence_content_still_fail) ... ok
+test_generated_metadata_numbers_do_not_name_proposals (test_reader_links.ProposalNumberGuardRegression.test_generated_metadata_numbers_do_not_name_proposals) ... ok
+test_generated_prose_and_proposal_links_still_fail (test_reader_links.ProposalNumberGuardRegression.test_generated_prose_and_proposal_links_still_fail) ... ok
+test_hex_pins_in_reader_text_do_not_add_proposal_mentions (test_reader_links.ProposalNumberGuardRegression.test_hex_pins_in_reader_text_do_not_add_proposal_mentions) ... ok
+test_malformed_generated_block_boundaries_still_fail (test_reader_links.ProposalNumberGuardRegression.test_malformed_generated_block_boundaries_still_fail) ... ok
+test_metadata_looking_generated_prose_still_fails (test_reader_links.ProposalNumberGuardRegression.test_metadata_looking_generated_prose_still_fails) ... ok
+test_source_commit_links_and_display_do_not_name_proposals (test_reader_links.ProposalNumberGuardRegression.test_source_commit_links_and_display_do_not_name_proposals) ... ok
+test_zero_or_extra_marker_pairs_on_complete_page_still_fail (test_reader_links.ProposalNumberGuardRegression.test_zero_or_extra_marker_pairs_on_complete_page_still_fail) ... ok
+test_all_local_html_links_assets_and_fragments_resolve (test_reader_links.PublicRoutes.test_all_local_html_links_assets_and_fragments_resolve) ... ok
+test_consistent_navigation_and_accessible_entry (test_reader_links.PublicRoutes.test_consistent_navigation_and_accessible_entry) ... ok
+test_curvature_exports_start_disabled_and_keep_the_pinned_teaching_scope (test_reader_links.PublicRoutes.test_curvature_exports_start_disabled_and_keep_the_pinned_teaching_scope) ... ok
+test_custom_not_found_guard_rejects_weakened_copies (test_reader_links.PublicRoutes.test_custom_not_found_guard_rejects_weakened_copies) ... ok
+test_custom_not_found_page_is_static_and_routes_into_the_site (test_reader_links.PublicRoutes.test_custom_not_found_page_is_static_and_routes_into_the_site) ... ok
+test_remaining_teaching_exports_keep_readable_static_limits_and_disabled_actions (test_reader_links.PublicRoutes.test_remaining_teaching_exports_keep_readable_static_limits_and_disabled_actions) ... ok
+test_research_page_routes_to_bounded_reader_tools (test_reader_links.PublicRoutes.test_research_page_routes_to_bounded_reader_tools) ... ok
+test_status_currency_pointer_matches_pinned_snapshot (test_reader_links.PublicRoutes.test_status_currency_pointer_matches_pinned_snapshot) ... ok
+test_status_rendered_from_line_matches_payload_bytes (test_reader_links.PublicRoutes.test_status_rendered_from_line_matches_payload_bytes) ... ok
+test_technical_guide_keeps_exact_pins_and_rejects_substitution (test_reader_links.ReproductionGuide.test_technical_guide_keeps_exact_pins_and_rejects_substitution) ... ok
+test_arbitrary_remote_inline_and_duplicate_scripts_remain_refused (test_reader_links.ResearchScriptBoundary.test_arbitrary_remote_inline_and_duplicate_scripts_remain_refused) ... ok
+test_navigation_module_is_explicitly_admitted (test_reader_links.ResearchScriptBoundary.test_navigation_module_is_explicitly_admitted) ... ok
+test_existing_browser_cases_cover_new_route_and_javascript_off_access (test_reader_links.ShrinkingBinReading.test_existing_browser_cases_cover_new_route_and_javascript_off_access) ... ok
+test_historical_scope_assertion_resolves_one_actual_boundary (test_reader_links.ShrinkingBinReading.test_historical_scope_assertion_resolves_one_actual_boundary) ... ok
+test_limits_and_full_sources_remain_available_without_status_promotion (test_reader_links.ShrinkingBinReading.test_limits_and_full_sources_remain_available_without_status_promotion) ... ok
+test_lineage_notes_sit_beside_their_reviews_without_new_sources (test_reader_links.ShrinkingBinReading.test_lineage_notes_sit_beside_their_reviews_without_new_sources) ... ok
+test_preceding_reading_cuts_remain_byte_identical (test_reader_links.ShrinkingBinReading.test_preceding_reading_cuts_remain_byte_identical) ... ok
+test_static_entry_and_disclosure_keep_exact_sample_and_spectral_scopes_separate (test_reader_links.ShrinkingBinReading.test_static_entry_and_disclosure_keep_exact_sample_and_spectral_scopes_separate) ... ok
+test_browser_flows_cover_the_new_cut (test_reader_links.UniversalitySourcesReading.test_browser_flows_cover_the_new_cut) ... ok
+test_cut_bytes_are_the_bytes_checked_for_this_cut (test_reader_links.UniversalitySourcesReading.test_cut_bytes_are_the_bytes_checked_for_this_cut) ... ok
+test_cut_is_newest_entry_and_links_to_the_9_october_cut_and_upstream (test_reader_links.UniversalitySourcesReading.test_cut_is_newest_entry_and_links_to_the_9_october_cut_and_upstream) ... ok
+test_forbidden_words_proposals_and_independence_qualifiers (test_reader_links.UniversalitySourcesReading.test_forbidden_words_proposals_and_independence_qualifiers) ... ok
+test_pinned_items_carry_only_their_digest_and_the_digests_match_the_pinned_bytes (test_reader_links.UniversalitySourcesReading.test_pinned_items_carry_only_their_digest_and_the_digests_match_the_pinned_bytes) ... ok
+test_process_marks_and_open_gaps_follow_the_records (test_reader_links.UniversalitySourcesReading.test_process_marks_and_open_gaps_follow_the_records) ... ok
+test_quoted_phrases_are_verbatim_in_their_pinned_sources (test_reader_links.UniversalitySourcesReading.test_quoted_phrases_are_verbatim_in_their_pinned_sources) ... ok
+test_scope_sentences_that_are_not_quotations (test_reader_links.UniversalitySourcesReading.test_scope_sentences_that_are_not_quotations) ... ok
+test_status_words_quote_the_records_after_not_ready (test_reader_links.UniversalitySourcesReading.test_status_words_quote_the_records_after_not_ready) ... ok
+test_three_cards_one_face_pin_each_three_status_rows_and_neutral_classes (test_reader_links.UniversalitySourcesReading.test_three_cards_one_face_pin_each_three_status_rows_and_neutral_classes) ... ok
+test_duplicate_identity_is_refused_on_every_route_with_raw_rows_kept (test_release_snapshot.IdentityPolicyTests.test_duplicate_identity_is_refused_on_every_route_with_raw_rows_kept) ... ok
+test_duplicate_valid_pr_numbers_refuse_the_open_pr_collection (test_release_snapshot.IdentityPolicyTests.test_duplicate_valid_pr_numbers_refuse_the_open_pr_collection) ... ok
+test_every_paginated_read_names_its_identity_policy (test_release_snapshot.IdentityPolicyTests.test_every_paginated_read_names_its_identity_policy) ... ok
+test_identity_values (test_release_snapshot.IdentityPolicyTests.test_identity_values) ... ok
+test_invalid_then_valid_pr_keeps_partial_progress (test_release_snapshot.IdentityPolicyTests.test_invalid_then_valid_pr_keeps_partial_progress) ... ok
+test_missing_identity_policy_fails_closed (test_release_snapshot.IdentityPolicyTests.test_missing_identity_policy_fails_closed) ... ok
+test_repeated_id_across_pages_with_matching_total_is_refused (test_release_snapshot.IdentityPolicyTests.test_repeated_id_across_pages_with_matching_total_is_refused) ... ok
+test_same_blob_at_different_filenames_is_accepted (test_release_snapshot.IdentityPolicyTests.test_same_blob_at_different_filenames_is_accepted) ... ok
+test_blob_hash (test_release_snapshot.SnapshotTests.test_blob_hash) ... ok
+test_control_character_paths_rejected (test_release_snapshot.SnapshotTests.test_control_character_paths_rejected) ... ok
+test_empty_output_only (test_release_snapshot.SnapshotTests.test_empty_output_only) ... ok
+test_error_not_empty (test_release_snapshot.SnapshotTests.test_error_not_empty) ... ok
+test_exact_archive_with_export_ignore_and_symlink (test_release_snapshot.SnapshotTests.test_exact_archive_with_export_ignore_and_symlink) ... ok
+test_gitlink_is_recorded_not_followed (test_release_snapshot.SnapshotTests.test_gitlink_is_recorded_not_followed) ... ok
+test_implementation_exists (test_release_snapshot.SnapshotTests.test_implementation_exists) ... ok
+test_keyed_bad_total_count (test_release_snapshot.SnapshotTests.test_keyed_bad_total_count) ... ok
+test_keyed_short_page_cannot_hide_total (test_release_snapshot.SnapshotTests.test_keyed_short_page_cannot_hide_total) ... ok
+test_keyed_total_count_success (test_release_snapshot.SnapshotTests.test_keyed_total_count_success) ... ok
+test_keyed_total_drift_fails_closed (test_release_snapshot.SnapshotTests.test_keyed_total_drift_fails_closed) ... ok
+test_malformed_api_targets_preserve_partial_receipt_and_later_repository (test_release_snapshot.SnapshotTests.test_malformed_api_targets_preserve_partial_receipt_and_later_repository) ... ok
+test_missing_key_not_empty (test_release_snapshot.SnapshotTests.test_missing_key_not_empty) ... ok
+test_no_published_zip_after_late_identity_failure (test_release_snapshot.SnapshotTests.test_no_published_zip_after_late_identity_failure) ... ok
+test_owner (test_release_snapshot.SnapshotTests.test_owner) ... ok
+test_pagination (test_release_snapshot.SnapshotTests.test_pagination) ... ok
+test_pagination_key (test_release_snapshot.SnapshotTests.test_pagination_key) ... ok
+test_paths (test_release_snapshot.SnapshotTests.test_paths) ... ok
+test_redirects_are_refused (test_release_snapshot.SnapshotTests.test_redirects_are_refused) ... ok
+test_sha (test_release_snapshot.SnapshotTests.test_sha) ... ok
+test_wrong_page_type (test_release_snapshot.SnapshotTests.test_wrong_page_type) ... ok
+test_checkout_other_than_tested_commit_is_refused (test_required_formal_binding_control.RequiredFormalBindingControl.test_checkout_other_than_tested_commit_is_refused) ... ok
+test_cli_accepts_valid_aggregate (test_required_formal_binding_control.RequiredFormalBindingControl.test_cli_accepts_valid_aggregate) ... ok
+test_cli_refusal_is_the_handled_refusal_not_a_crash (test_required_formal_binding_control.RequiredFormalBindingControl.test_cli_refusal_is_the_handled_refusal_not_a_crash) ... ok
+test_receipt_from_another_repository_is_refused (test_required_formal_binding_control.RequiredFormalBindingControl.test_receipt_from_another_repository_is_refused) ... ok
+test_receipt_from_another_run_is_refused (test_required_formal_binding_control.RequiredFormalBindingControl.test_receipt_from_another_run_is_refused) ... ok
+test_symlinked_receipt_or_manifest_is_refused (test_required_formal_binding_control.RequiredFormalBindingControl.test_symlinked_receipt_or_manifest_is_refused) ... ok
+test_valid_receipt_binds_to_commit_run_and_bytes (test_required_formal_binding_control.RequiredFormalBindingControl.test_valid_receipt_binds_to_commit_run_and_bytes) ... ok
+test_actual_cli_failure (test_required_formal_check.RequiredCheckTests.test_actual_cli_failure) ... ok
+test_bad_digest (test_required_formal_check.RequiredCheckTests.test_bad_digest) ... ok
+test_binding_preserves_receipt (test_required_formal_check.RequiredCheckTests.test_binding_preserves_receipt) ... ok
+test_changed_test_merge_commit (test_required_formal_check.RequiredCheckTests.test_changed_test_merge_commit) ... ok
+test_duplicate_json_keys_refused (test_required_formal_check.RequiredCheckTests.test_duplicate_json_keys_refused) ... ok
+test_each_output_required (test_required_formal_check.RequiredCheckTests.test_each_output_required) ... ok
+test_empty_logs_refused (test_required_formal_check.RequiredCheckTests.test_empty_logs_refused) ... ok
+test_every_unsuccessful_result_refused (test_required_formal_check.RequiredCheckTests.test_every_unsuccessful_result_refused) ... ok
+test_existing_checks_commit_drift (test_required_formal_check.RequiredCheckTests.test_existing_checks_commit_drift) ... ok
+test_extra_dependency (test_required_formal_check.RequiredCheckTests.test_extra_dependency) ... ok
+test_formal_commit_drift (test_required_formal_check.RequiredCheckTests.test_formal_commit_drift) ... ok
+test_implementation_exists (test_required_formal_check.RequiredCheckTests.test_implementation_exists) ... ok
+test_log_tamper (test_required_formal_check.RequiredCheckTests.test_log_tamper) ... ok
+test_manifest_drift (test_required_formal_check.RequiredCheckTests.test_manifest_drift) ... ok
+test_missing_dependency (test_required_formal_check.RequiredCheckTests.test_missing_dependency) ... ok
+test_no_numeric_identity_coercion (test_required_formal_check.RequiredCheckTests.test_no_numeric_identity_coercion) ... ok
+test_receipt_drift (test_required_formal_check.RequiredCheckTests.test_receipt_drift) ... ok
+test_repository_substitution (test_required_formal_check.RequiredCheckTests.test_repository_substitution) ... ok
+test_stale_attempt (test_required_formal_check.RequiredCheckTests.test_stale_attempt) ... ok
+test_stale_run (test_required_formal_check.RequiredCheckTests.test_stale_run) ... ok
+test_success (test_required_formal_check.RequiredCheckTests.test_success) ... ok
+test_symlink_log_refused (test_required_formal_check.RequiredCheckTests.test_symlink_log_refused) ... ok
+test_traversal_log_refused (test_required_formal_check.RequiredCheckTests.test_traversal_log_refused) ... ok
+test_unproved_receipt_refused (test_required_formal_check.RequiredCheckTests.test_unproved_receipt_refused) ... ok
+test_outputs_are_bound_to_executed_receipt (test_required_formal_check.WiringTests.test_outputs_are_bound_to_executed_receipt) ... ok
+test_parent_no_path_filters_or_skip_override (test_required_formal_check.WiringTests.test_parent_no_path_filters_or_skip_override) ... ok
+test_parent_required_name_is_aggregate (test_required_formal_check.WiringTests.test_parent_required_name_is_aggregate) ... ok
+test_required_calls_validator (test_required_formal_check.WiringTests.test_required_calls_validator) ... ok
+test_same_revision_reusable_workflow (test_required_formal_check.WiringTests.test_same_revision_reusable_workflow) ... ok
+test_synthetic_control_uses_no_proof_edits (test_required_formal_check.WiringTests.test_synthetic_control_uses_no_proof_edits) ... ok
+test_bad_deflate_stream_is_a_clean_verification_failure (test_research_delivery.DeliveryTests.test_bad_deflate_stream_is_a_clean_verification_failure) ... ok
+test_canonical_utf8_member_round_trip (test_research_delivery.DeliveryTests.test_canonical_utf8_member_round_trip) ... ok
+test_central_directory_is_bounded_before_zip_object_allocation (test_research_delivery.DeliveryTests.test_central_directory_is_bounded_before_zip_object_allocation) ... ok
+test_changed_input_fails_before_output_is_created (test_research_delivery.DeliveryTests.test_changed_input_fails_before_output_is_created) ... ok
+test_cli_returns_compact_results_and_nonzero_on_bad_archive (test_research_delivery.DeliveryTests.test_cli_returns_compact_results_and_nonzero_on_bad_archive) ... ok
+test_component_neighbors_and_shared_directories_still_round_trip (test_research_delivery.DeliveryTests.test_component_neighbors_and_shared_directories_still_round_trip) ... ok
+test_count_total_size_and_boolean_size_limits_are_enforced (test_research_delivery.DeliveryTests.test_count_total_size_and_boolean_size_limits_are_enforced) ... ok
+test_crc_corruption_and_oversized_archive_are_rejected (test_research_delivery.DeliveryTests.test_crc_corruption_and_oversized_archive_are_rejected) ... ok
+test_deflate_hidden_suffix_cannot_verify_a_truncated_handoff (test_research_delivery.DeliveryTests.test_deflate_hidden_suffix_cannot_verify_a_truncated_handoff) ... ok
+test_generated_manifest_is_not_a_payload_directory (test_research_delivery.DeliveryTests.test_generated_manifest_is_not_a_payload_directory) ... ok
+test_input_symlink_and_symlink_directory_are_rejected (test_research_delivery.DeliveryTests.test_input_symlink_and_symlink_directory_are_rejected) ... ok
+test_malformed_canonical_zip_boundaries_and_headers_are_rejected (test_research_delivery.DeliveryTests.test_malformed_canonical_zip_boundaries_and_headers_are_rejected) ... ok
+test_missing_extra_duplicate_and_unsafe_zip_members_are_rejected (test_research_delivery.DeliveryTests.test_missing_extra_duplicate_and_unsafe_zip_members_are_rejected) ... ok
+test_missing_or_unlisted_handoff_is_rejected (test_research_delivery.DeliveryTests.test_missing_or_unlisted_handoff_is_rejected) ... ok
+test_modified_bytes_and_manifest_self_hash_are_rejected (test_research_delivery.DeliveryTests.test_modified_bytes_and_manifest_self_hash_are_rejected) ... ok
+test_oversized_inputs_and_metadata_are_rejected (test_research_delivery.DeliveryTests.test_oversized_inputs_and_metadata_are_rejected) ... ok
+test_prefix_conflict_cli_is_a_clean_nonzero_result (test_research_delivery.DeliveryTests.test_prefix_conflict_cli_is_a_clean_nonzero_result) ... ok
+test_prefix_invariant_checks_all_rows_in_both_identity_schemas (test_research_delivery.DeliveryTests.test_prefix_invariant_checks_all_rows_in_both_identity_schemas) ... ok
+test_refuses_to_overwrite_an_existing_output (test_research_delivery.DeliveryTests.test_refuses_to_overwrite_an_existing_output) ... ok
+test_rehashed_archive_still_checks_handoff_envelope (test_research_delivery.DeliveryTests.test_rehashed_archive_still_checks_handoff_envelope) ... ok
+test_required_handoff_fields_and_digest_are_checked (test_research_delivery.DeliveryTests.test_required_handoff_fields_and_digest_are_checked) ... ok
+test_round_trip_is_deterministic_and_never_autocrawls (test_research_delivery.DeliveryTests.test_round_trip_is_deterministic_and_never_autocrawls) ... ok
+test_stored_member_local_sizes_cannot_disagree_with_directory (test_research_delivery.DeliveryTests.test_stored_member_local_sizes_cannot_disagree_with_directory) ... ok
+test_strict_control_json_rejects_duplicate_and_nonfinite_values (test_research_delivery.DeliveryTests.test_strict_control_json_rejects_duplicate_and_nonfinite_values) ... ok
+test_structured_verified_boundary_remains_valid_r17 (test_research_delivery.DeliveryTests.test_structured_verified_boundary_remains_valid_r17) ... ok
+test_unsafe_or_duplicate_input_paths_are_rejected (test_research_delivery.DeliveryTests.test_unsafe_or_duplicate_input_paths_are_rejected) ... ok
+test_valid_hashes_do_not_excuse_conflicting_archive_paths (test_research_delivery.DeliveryTests.test_valid_hashes_do_not_excuse_conflicting_archive_paths) ... ok
+test_zip_symlink_and_duplicate_manifest_json_are_rejected (test_research_delivery.DeliveryTests.test_zip_symlink_and_duplicate_manifest_json_are_rejected) ... ok
+test_deep_and_confusable_spans_are_real (test_semantic_memory_benchmark.SemanticMemoryFixtureContract.test_deep_and_confusable_spans_are_real) ... ok
+test_frozen_case_inventory_and_hashes (test_semantic_memory_benchmark.SemanticMemoryFixtureContract.test_frozen_case_inventory_and_hashes) ... ok
+test_gold_never_enters_index_or_prompt (test_semantic_memory_benchmark.SemanticMemoryFixtureContract.test_gold_never_enters_index_or_prompt) ... ok
+test_alias_root_inventory_compares_against_canonical_paths (test_site_asset_release.AssetRelease.test_alias_root_inventory_compares_against_canonical_paths)
+A symlink temp alias must not be treated as the inventory root. ... ok
+test_ambiguous_binding_cli_refuses_before_all_file_and_index_writes (test_site_asset_release.AssetRelease.test_ambiguous_binding_cli_refuses_before_all_file_and_index_writes) ... ok
+test_bare_await_yield_headers_refuse_both_valid_interpretations (test_site_asset_release.AssetRelease.test_bare_await_yield_headers_refuse_both_valid_interpretations) ... ok
+test_binding_position_cli_preserves_tracked_and_missing_regex_targets (test_site_asset_release.AssetRelease.test_binding_position_cli_preserves_tracked_and_missing_regex_targets) ... ok
+test_catalog_existing_missing_file_and_directory_symlink_refusals (test_site_asset_release.AssetRelease.test_catalog_existing_missing_file_and_directory_symlink_refusals) ... ok
+test_changed_transitive_asset_and_config_change_the_identity (test_site_asset_release.AssetRelease.test_changed_transitive_asset_and_config_change_the_identity) ... ok
+test_crlf_survives_and_check_does_not_write (test_site_asset_release.AssetRelease.test_crlf_survives_and_check_does_not_write) ... ok
+test_current_entry_assets_select_a_release (test_site_asset_release.AssetRelease.test_current_entry_assets_select_a_release) ... ok
+test_data_and_page_edits_leave_every_asset_url_unchanged (test_site_asset_release.AssetRelease.test_data_and_page_edits_leave_every_asset_url_unchanged) ... ok
+test_declaration_position_preserves_contextual_binding_regex (test_site_asset_release.AssetRelease.test_declaration_position_preserves_contextual_binding_regex) ... ok
+test_declaration_prefix_does_not_hide_genuine_division_imports (test_site_asset_release.AssetRelease.test_declaration_prefix_does_not_hide_genuine_division_imports) ... ok
+test_declared_binding_regex_and_real_import_cli_remain_distinct (test_site_asset_release.AssetRelease.test_declared_binding_regex_and_real_import_cli_remain_distinct) ... ok
+test_each_reference_carries_its_target_asset_key (test_site_asset_release.AssetRelease.test_each_reference_carries_its_target_asset_key) ... ok
+test_edit_rekeys_only_changed_assets_and_their_importers (test_site_asset_release.AssetRelease.test_edit_rekeys_only_changed_assets_and_their_importers) ... ok
+test_generation_is_idempotent_and_check_does_not_repair (test_site_asset_release.AssetRelease.test_generation_is_idempotent_and_check_does_not_repair) ... ok
+test_git_root_site_preserves_outside_catalog_boundary (test_site_asset_release.AssetRelease.test_git_root_site_preserves_outside_catalog_boundary) ... ok
+test_identifier_of_division_still_discovers_real_imports (test_site_asset_release.AssetRelease.test_identifier_of_division_still_discovers_real_imports) ... ok
+test_inactive_examples_do_not_resolve_missing_assets (test_site_asset_release.AssetRelease.test_inactive_examples_do_not_resolve_missing_assets) ... ok
+test_inventory_has_explicit_posix_order_and_two_root_order (test_site_asset_release.AssetRelease.test_inventory_has_explicit_posix_order_and_two_root_order) ... ok
+test_inventory_refuses_missing_indexed_catalog_root (test_site_asset_release.AssetRelease.test_inventory_refuses_missing_indexed_catalog_root) ... ok
+test_iteration_header_regex_has_no_module_spans (test_site_asset_release.AssetRelease.test_iteration_header_regex_has_no_module_spans) ... ok
+test_iteration_regex_and_real_imports_have_distinct_cli_behavior (test_site_asset_release.AssetRelease.test_iteration_regex_and_real_imports_have_distinct_cli_behavior) ... ok
+test_iteration_regex_cli_preserves_tracked_and_missing_pattern_targets (test_site_asset_release.AssetRelease.test_iteration_regex_cli_preserves_tracked_and_missing_pattern_targets) ... ok
+test_iteration_regex_refusals_preserve_all_files_and_index (test_site_asset_release.AssetRelease.test_iteration_regex_refusals_preserve_all_files_and_index) ... ok
+test_lexical_goal_refusal_preserves_pending_files_and_raw_index (test_site_asset_release.AssetRelease.test_lexical_goal_refusal_preserves_pending_files_and_raw_index) ... ok
+test_missing_indexed_catalog_root_refuses_cli_before_writes (test_site_asset_release.AssetRelease.test_missing_indexed_catalog_root_refuses_cli_before_writes) ... ok
+test_missing_iteration_division_import_refuses_before_writes (test_site_asset_release.AssetRelease.test_missing_iteration_division_import_refuses_before_writes) ... ok
+test_optional_catalog_siblings_preserve_inventory_and_release (test_site_asset_release.AssetRelease.test_optional_catalog_siblings_preserve_inventory_and_release) ... ok
+test_private_calls_and_division_have_distinct_cli_dependencies (test_site_asset_release.AssetRelease.test_private_calls_and_division_have_distinct_cli_dependencies) ... ok
+test_private_import_calls_are_not_module_syntax (test_site_asset_release.AssetRelease.test_private_import_calls_are_not_module_syntax) ... ok
+test_private_keyword_divisions_discover_genuine_imports (test_site_asset_release.AssetRelease.test_private_keyword_divisions_discover_genuine_imports) ... ok
+test_private_keyword_targets_preserve_iteration_regex (test_site_asset_release.AssetRelease.test_private_keyword_targets_preserve_iteration_regex) ... ok
+test_private_regex_cli_preserves_pattern_bytes_and_raw_index (test_site_asset_release.AssetRelease.test_private_regex_cli_preserves_pattern_bytes_and_raw_index) ... ok
+test_query_order_fragment_and_html_entity_survive (test_site_asset_release.AssetRelease.test_query_order_fragment_and_html_entity_survive) ... ok
+test_quoted_css_import_is_versioned_and_missing_import_is_refused (test_site_asset_release.AssetRelease.test_quoted_css_import_is_versioned_and_missing_import_is_refused) ... ok
+test_reexports_and_dynamic_options_but_not_computed_imports (test_site_asset_release.AssetRelease.test_reexports_and_dynamic_options_but_not_computed_imports) ... ok
+test_reference_cycle_shares_one_key_and_rekeys_together (test_site_asset_release.AssetRelease.test_reference_cycle_shares_one_key_and_rekeys_together) ... ok
+test_staged_catalog_removal_is_valid_and_changes_release (test_site_asset_release.AssetRelease.test_staged_catalog_removal_is_valid_and_changes_release) ... ok
+test_symlink_and_deleted_tracked_file_are_refused (test_site_asset_release.AssetRelease.test_symlink_and_deleted_tracked_file_are_refused) ... ok
+test_unambiguous_await_yield_and_opaque_words_keep_module_spans (test_site_asset_release.AssetRelease.test_unambiguous_await_yield_and_opaque_words_keep_module_spans) ... ok
+test_unicode_and_property_keywords_do_not_become_imports_or_regex (test_site_asset_release.AssetRelease.test_unicode_and_property_keywords_do_not_become_imports_or_regex) ... ok
+test_unqualified_await_yield_slash_refuses_without_mode_inference (test_site_asset_release.AssetRelease.test_unqualified_await_yield_slash_refuses_without_mode_inference) ... ok
+test_unsupported_contexts_fail_before_any_writes (test_site_asset_release.AssetRelease.test_unsupported_contexts_fail_before_any_writes) ... ok
+test_unsupported_private_syntax_refuses_before_any_writes (test_site_asset_release.AssetRelease.test_unsupported_private_syntax_refuses_before_any_writes) ... ok
+test_untracked_dependency_and_non_git_site_are_refused (test_site_asset_release.AssetRelease.test_untracked_dependency_and_non_git_site_are_refused) ... ok
+test_untracked_noise_ignored_and_tracked_input_changes_identity (test_site_asset_release.AssetRelease.test_untracked_noise_ignored_and_tracked_input_changes_identity) ... ok
+test_pages_loading_current_module_allow_same_origin_connect (test_site_csp.CurrentModuleCspTests.test_pages_loading_current_module_allow_same_origin_connect) ... ok
+test_aggregate_overflow_is_distinct_from_individual_file_limits (test_site_graph_capture.SiteGraphCaptureContract.test_aggregate_overflow_is_distinct_from_individual_file_limits) ... ok
+test_binary_success_retains_exact_original_streams_and_closed_inventory (test_site_graph_capture.SiteGraphCaptureContract.test_binary_success_retains_exact_original_streams_and_closed_inventory) ... ok
+test_exact_stream_and_aggregate_limits_remain_successful (test_site_graph_capture.SiteGraphCaptureContract.test_exact_stream_and_aggregate_limits_remain_successful) ... ok
+test_existing_destination_is_never_overwritten (test_site_graph_capture.SiteGraphCaptureContract.test_existing_destination_is_never_overwritten) ... ok
+test_exited_parent_with_held_descendant_pipe_is_incomplete (test_site_graph_capture.SiteGraphCaptureContract.test_exited_parent_with_held_descendant_pipe_is_incomplete) ... ok
+test_invalid_or_expanded_limits_are_refused_before_child (test_site_graph_capture.SiteGraphCaptureContract.test_invalid_or_expanded_limits_are_refused_before_child) ... ok
+test_nonzero_child_status_is_propagated_and_recorded (test_site_graph_capture.SiteGraphCaptureContract.test_nonzero_child_status_is_propagated_and_recorded) ... ok
+test_overflow_finishes_group_cleanup_after_term_closes_pipes (test_site_graph_capture.SiteGraphCaptureContract.test_overflow_finishes_group_cleanup_after_term_closes_pipes) ... ok
+test_per_stream_overflow_preserves_prefix_and_refuses_success (test_site_graph_capture.SiteGraphCaptureContract.test_per_stream_overflow_preserves_prefix_and_refuses_success) ... ok
+test_post_loop_wait_timeout_finishes_process_group_cleanup (test_site_graph_capture.SiteGraphCaptureContract.test_post_loop_wait_timeout_finishes_process_group_cleanup) ... ok
+test_runner_command_text_is_retained_without_raw_replay (test_site_graph_capture.SiteGraphCaptureContract.test_runner_command_text_is_retained_without_raw_replay) ... ok
+test_timeout_finishes_group_cleanup_after_term_closes_pipes (test_site_graph_capture.SiteGraphCaptureContract.test_timeout_finishes_group_cleanup_after_term_closes_pipes) ... ok
+test_timeout_records_actual_child_and_controller_outcomes (test_site_graph_capture.SiteGraphCaptureContract.test_timeout_records_actual_child_and_controller_outcomes) ... ok
+test_all_records_dimensions_and_ordered_edges_are_preserved (test_site_graph_projection.SameArtifactSiteContract.test_all_records_dimensions_and_ordered_edges_are_preserved) ... ok
+test_another_producer_and_declared_artifact_label_do_not_rewrite_math_source (test_site_graph_projection.SameArtifactSiteContract.test_another_producer_and_declared_artifact_label_do_not_rewrite_math_source) ... ok
+test_declared_native_pins_do_not_authenticate_custody_or_promote_science (test_site_graph_projection.SameArtifactSiteContract.test_declared_native_pins_do_not_authenticate_custody_or_promote_science) ... ok
+test_each_comparable_native_identity_mismatch_is_refused (test_site_graph_projection.SameArtifactSiteContract.test_each_comparable_native_identity_mismatch_is_refused) ... ok
+test_failed_or_incomplete_producer_results_cannot_be_projected (test_site_graph_projection.SameArtifactSiteContract.test_failed_or_incomplete_producer_results_cannot_be_projected) ... ok
+test_fixed_independent_source_and_closed_archive_inventory_are_required (test_site_graph_projection.SameArtifactSiteContract.test_fixed_independent_source_and_closed_archive_inventory_are_required) ... ok
+test_missing_extra_or_coerced_native_fields_are_refused (test_site_graph_projection.SameArtifactSiteContract.test_missing_extra_or_coerced_native_fields_are_refused) ... ok
+test_non_scientific_graph_flags_are_enforced (test_site_graph_projection.SameArtifactSiteContract.test_non_scientific_graph_flags_are_enforced) ... ok
+test_original_graph_and_producer_receipt_remain_exact_byte_strings (test_site_graph_projection.SameArtifactSiteContract.test_original_graph_and_producer_receipt_remain_exact_byte_strings) ... ok
+test_output_is_deterministic_ascii_and_contains_one_complete_document (test_site_graph_projection.SameArtifactSiteContract.test_output_is_deterministic_ascii_and_contains_one_complete_document) ... ok
+test_projection_links_the_same_archive_and_complete_member_inventory (test_site_graph_projection.SameArtifactSiteContract.test_projection_links_the_same_archive_and_complete_member_inventory) ... ok
+test_public_projection_omits_diagnostics_and_does_not_fabricate_git_identity (test_site_graph_projection.SameArtifactSiteContract.test_public_projection_omits_diagnostics_and_does_not_fabricate_git_identity) ... ok
+test_raw_receipt_pin_cannot_be_substituted_with_canonical_json_hash (test_site_graph_projection.SameArtifactSiteContract.test_raw_receipt_pin_cannot_be_substituted_with_canonical_json_hash) ... ok
+test_real_admitted_projection_reaches_actual_capacity_or_closest_below (test_site_graph_projection.SameArtifactSiteContract.test_real_admitted_projection_reaches_actual_capacity_or_closest_below) ... ok
+test_real_reader_admits_next_representable_projection_above_actual_capacity (test_site_graph_projection.SameArtifactSiteContract.test_real_reader_admits_next_representable_projection_above_actual_capacity) ... ok
+test_receipt_semantics_cannot_be_authorized_by_rehashing_it (test_site_graph_projection.SameArtifactSiteContract.test_receipt_semantics_cannot_be_authorized_by_rehashing_it) ... ok
+test_result_and_native_binding_remain_immutable_after_return (test_site_graph_projection.SameArtifactSiteContract.test_result_and_native_binding_remain_immutable_after_return) ... ok
+test_self_consistent_changed_graph_is_refused (test_site_graph_projection.SameArtifactSiteContract.test_self_consistent_changed_graph_is_refused) ... ok
+test_eight_case_observations (test_st_contract_pilot.STContractPilotTests.test_eight_case_observations) ... ok
+test_frozen_dependency_and_fixture_identities (test_st_contract_pilot.STContractPilotTests.test_frozen_dependency_and_fixture_identities) ... ok
+test_overlay_controls (test_st_contract_pilot.STContractPilotTests.test_overlay_controls) ... ok
+test_scaling_controls (test_st_contract_pilot.STContractPilotTests.test_scaling_controls) ... ok
+test_delivery_shell_propagates_both_mode_failures (test_workspace_landing.DeliveryWorkflowTests.test_delivery_shell_propagates_both_mode_failures) ... ok
+test_delivery_suite_is_required_before_identity_binding (test_workspace_landing.DeliveryWorkflowTests.test_delivery_suite_is_required_before_identity_binding) ... ok
+test_batch248_workspace_landing_workflow_path_split (test_workspace_landing.LandingChecks.test_batch248_workspace_landing_workflow_path_split)
+Landing checks must not share .github/workflows/ci.yml with hardening CI. ... ok
+test_bool_not_byte_count (test_workspace_landing.LandingChecks.test_bool_not_byte_count) ... ok
+test_broken_local_link (test_workspace_landing.LandingChecks.test_broken_local_link) ... ok
+test_cli_corruption_is_failure (test_workspace_landing.LandingChecks.test_cli_corruption_is_failure) ... ok
+test_duplicate_json_key (test_workspace_landing.LandingChecks.test_duplicate_json_key) ... ok
+test_duplicate_page (test_workspace_landing.LandingChecks.test_duplicate_page) ... ok
+test_invalid_schema_cli (test_workspace_landing.LandingChecks.test_invalid_schema_cli) ... ok
+test_missing_page (test_workspace_landing.LandingChecks.test_missing_page) ... ok
+test_modified_archive (test_workspace_landing.LandingChecks.test_modified_archive) ... ok
+test_parent_escape (test_workspace_landing.LandingChecks.test_parent_escape) ... ok
+test_remote_and_fenced_examples_not_fetched (test_workspace_landing.LandingChecks.test_remote_and_fenced_examples_not_fetched) ... ok
+test_symlink_escape (test_workspace_landing.LandingChecks.test_symlink_escape) ... ok
+test_valid_and_no_writes (test_workspace_landing.LandingChecks.test_valid_and_no_writes) ... ok
+
+----------------------------------------------------------------------
+Ran 1673 tests in 342.361s
+
+OK (skipped=21)
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python.stdout b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python.stdout
new file mode 100644
index 000000000..679630ee3
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python.stdout
@@ -0,0 +1,6 @@
+DIRECTORY_SOURCE_REPORT {"added": [], "changed": ["frontiers/downstream_gate_20260925/SOURCE_FILES.json", "frontiers/downstream_gate_20260925/run_validation.py"], "meaning": "inventory rows under a directory-bound source compared with the pinned file list; byte identity only", "node": "eng.hard-gate", "observation_commit": "dbe6c0a1b1a22c7404b0fd173ee0043b98a08cde", "pinned_commit": "7858329974e28be79f29b22644370084ff43da4f", "removed": [], "source": "frontiers/downstream_gate_20260925/"}
+DIRECTORY_SOURCE_REPORT {"added": [], "changed": [], "meaning": "inventory rows under a directory-bound source compared with the pinned file list; byte identity only", "node": "math.d1-component.reconciliation-record", "observation_commit": "dbe6c0a1b1a22c7404b0fd173ee0043b98a08cde", "pinned_commit": "7858329974e28be79f29b22644370084ff43da4f", "removed": [], "source": "reviews/d1_chain_reconciliation_20260928/"}
+Public shop exports verified; scientific effect NONE.
+{"historical_files": 1, "local_links": 2, "pages": 2, "problems": ["old.txt: historical byte identity mismatch"], "scope": "LANDING_LINKS_AND_HISTORICAL_IDENTITY_ONLY"}
+Scope: landing links and historical bytes only; research CI and mathematical correctness not checked.
+landing_check: INVALID_INPUT: unknown landing manifest scope
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-image-pull.stderr b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-image-pull.stderr
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-image-pull.stdout b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-image-pull.stdout
new file mode 100644
index 000000000..c11a9fada
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-image-pull.stdout
@@ -0,0 +1,21 @@
+docker.io/library/python@sha256:83f339c1be6340ae1096010fdccf6552ac932d8f410d45d206014916bdf37e48: Pulling from library/python
+84a2afebaf4d: Pulling fs layer
+0ca4ca8e967f: Pulling fs layer
+4afda7e4a767: Pulling fs layer
+bb97a7af1971: Pulling fs layer
+bb97a7af1971: Waiting
+0ca4ca8e967f: Verifying Checksum
+0ca4ca8e967f: Download complete
+4afda7e4a767: Verifying Checksum
+4afda7e4a767: Download complete
+bb97a7af1971: Verifying Checksum
+bb97a7af1971: Download complete
+84a2afebaf4d: Verifying Checksum
+84a2afebaf4d: Download complete
+84a2afebaf4d: Pull complete
+0ca4ca8e967f: Pull complete
+4afda7e4a767: Pull complete
+bb97a7af1971: Pull complete
+Digest: sha256:83f339c1be6340ae1096010fdccf6552ac932d8f410d45d206014916bdf37e48
+Status: Downloaded newer image for python@sha256:83f339c1be6340ae1096010fdccf6552ac932d8f410d45d206014916bdf37e48
+docker.io/library/python:3.11.14-slim-bookworm@sha256:83f339c1be6340ae1096010fdccf6552ac932d8f410d45d206014916bdf37e48
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable-result.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable-result.json
new file mode 100644
index 000000000..b522b1ba1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable-result.json
@@ -0,0 +1,49 @@
+{
+ "argv": [
+ "docker",
+ "--host=unix:///var/run/docker.sock",
+ "run",
+ "--rm",
+ "--name",
+ "cbz-website-sandbox-readable-20261029",
+ "--network",
+ "none",
+ "--read-only",
+ "--user",
+ "65532:65532",
+ "--cpus",
+ "2",
+ "--memory",
+ "1g",
+ "--pids-limit",
+ "128",
+ "--cap-drop",
+ "ALL",
+ "--security-opt",
+ "no-new-privileges",
+ "--env",
+ "ARCHITECTURE_SANDBOX=1",
+ "--tmpfs",
+ "/tmp:rw,noexec,nosuid,size=64m",
+ "--tmpfs",
+ "/output:rw,noexec,nosuid,size=64m,uid=65532,gid=65532",
+ "--mount",
+ "type=bind,source=/workspace/cbz0/sandbox-source-6fc0218,target=/source,readonly",
+ "--workdir",
+ "/source",
+ "python:3.11.14-slim-bookworm@sha256:83f339c1be6340ae1096010fdccf6552ac932d8f410d45d206014916bdf37e48",
+ "python",
+ "-B",
+ "-m",
+ "unittest",
+ "discover",
+ "-s",
+ "tests",
+ "-p",
+ "test_architecture_sandbox.py",
+ "-v"
+ ],
+ "started": "2026-10-29T18:22:03.416923+00:00",
+ "finished": "2026-10-29T18:22:05.993861+00:00",
+ "exit": 1
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable-source.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable-source.json
new file mode 100644
index 000000000..07df0a8a9
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable-source.json
@@ -0,0 +1,8 @@
+{
+ "source_commit": "6fc021839072d8c34f41e18e77b0f618c53baa15",
+ "root_cause": "owner-only0700 source directories prevent65532 checker reading tests; no tests ran in firstsetup",
+ "fix": "readable isolated exact git-archive snapshot; original directories/permissions and all test assertions unchanged",
+ "archive_sha256": "f386b1d6688ac212caa039082f7ed3f7125270c9c3028820c63f44097d612b56",
+ "test_sha256": "6f9281005cf62b2d061f3a0381fa6c1b79999dbb5813758ae1f4fd0f870fbe78",
+ "directory": "/workspace/cbz0/sandbox-source-6fc0218"
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable.stderr b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable.stderr
new file mode 100644
index 000000000..71224d673
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable.stderr
@@ -0,0 +1,17 @@
+Traceback (most recent call last):
+ File "", line 198, in _run_module_as_main
+ File "", line 88, in _run_code
+ File "/usr/local/lib/python3.11/unittest/__main__.py", line 18, in
+ main(module=None)
+ File "/usr/local/lib/python3.11/unittest/main.py", line 101, in __init__
+ self.parseArgs(argv)
+ File "/usr/local/lib/python3.11/unittest/main.py", line 127, in parseArgs
+ self._do_discovery(argv[2:])
+ File "/usr/local/lib/python3.11/unittest/main.py", line 247, in _do_discovery
+ self.createTests(from_discovery=True, Loader=Loader)
+ File "/usr/local/lib/python3.11/unittest/main.py", line 157, in createTests
+ self.test = loader.discover(self.start, self.pattern, self.top)
+ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+ File "/usr/local/lib/python3.11/unittest/loader.py", line 332, in discover
+ raise ImportError('Start directory is not importable: %r' % start_dir)
+ImportError: Start directory is not importable: 'tests'
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable.stdout b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable.stdout
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-result.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-result.json
new file mode 100644
index 000000000..095250616
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-result.json
@@ -0,0 +1,49 @@
+{
+ "argv": [
+ "docker",
+ "--host=unix:///var/run/docker.sock",
+ "run",
+ "--rm",
+ "--name",
+ "cbz-website-sandbox-20261029-1816",
+ "--network",
+ "none",
+ "--read-only",
+ "--user",
+ "65532:65532",
+ "--cpus",
+ "2",
+ "--memory",
+ "1g",
+ "--pids-limit",
+ "128",
+ "--cap-drop",
+ "ALL",
+ "--security-opt",
+ "no-new-privileges",
+ "--env",
+ "ARCHITECTURE_SANDBOX=1",
+ "--tmpfs",
+ "/tmp:rw,noexec,nosuid,size=64m",
+ "--tmpfs",
+ "/output:rw,noexec,nosuid,size=64m,uid=65532,gid=65532",
+ "--mount",
+ "type=bind,source=/workspace/universal-law/website-repair-20261028,target=/source,readonly",
+ "--workdir",
+ "/source",
+ "python:3.11.14-slim-bookworm@sha256:83f339c1be6340ae1096010fdccf6552ac932d8f410d45d206014916bdf37e48",
+ "python",
+ "-B",
+ "-m",
+ "unittest",
+ "discover",
+ "-s",
+ "tests",
+ "-p",
+ "test_architecture_sandbox.py",
+ "-v"
+ ],
+ "started": "2026-10-29T18:17:50.117039+00:00",
+ "finished": "2026-10-29T18:17:51.285908+00:00",
+ "exit": 1
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-source-diagnostic.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-source-diagnostic.json
new file mode 100644
index 000000000..78df57121
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-source-diagnostic.json
@@ -0,0 +1,42 @@
+{
+ "argv": [
+ "docker",
+ "--host=unix:///var/run/docker.sock",
+ "run",
+ "--rm",
+ "--name",
+ "cbz-sandbox-source-diagnostic-1827",
+ "--network",
+ "none",
+ "--read-only",
+ "--user",
+ "65532:65532",
+ "--cpus",
+ "2",
+ "--memory",
+ "1g",
+ "--pids-limit",
+ "128",
+ "--cap-drop",
+ "ALL",
+ "--security-opt",
+ "no-new-privileges",
+ "--env",
+ "ARCHITECTURE_SANDBOX=1",
+ "--tmpfs",
+ "/tmp:rw,noexec,nosuid,size=64m",
+ "--tmpfs",
+ "/output:rw,noexec,nosuid,size=64m,uid=65532,gid=65532",
+ "--mount",
+ "type=bind,source=/workspace/cbz0/sandbox-source-6fc0218,target=/source,readonly",
+ "--workdir",
+ "/source",
+ "python:3.11.14-slim-bookworm@sha256:83f339c1be6340ae1096010fdccf6552ac932d8f410d45d206014916bdf37e48",
+ "python",
+ "-c",
+ "import os,json,pathlib,stat; p=pathlib.Path('/source'); print(json.dumps({'cwd':os.getcwd(),'uid':os.getuid(),'source_exists':p.exists(),'source_mode':oct(p.stat().st_mode & 0o777),'entries':os.listdir(p),'tests_exists':(p/'tests').exists(),'test_exists':(p/'tests/test_architecture_sandbox.py').exists()}))"
+ ],
+ "stdout": "",
+ "stderr": "Traceback (most recent call last):\n File \"\", line 1, in \nPermissionError: [Errno 13] Permission denied: '/source'\n",
+ "exit": 1
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged-result.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged-result.json
new file mode 100644
index 000000000..0906479a0
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged-result.json
@@ -0,0 +1,51 @@
+{
+ "argv": [
+ "docker",
+ "--host=unix:///var/run/docker.sock",
+ "run",
+ "--rm",
+ "--name",
+ "cbz-website-sandbox-staged-1831",
+ "--network",
+ "none",
+ "--read-only",
+ "--user",
+ "65532:65532",
+ "--cpus",
+ "2",
+ "--memory",
+ "1g",
+ "--pids-limit",
+ "128",
+ "--cap-drop",
+ "ALL",
+ "--security-opt",
+ "no-new-privileges",
+ "--env",
+ "ARCHITECTURE_SANDBOX=1",
+ "--tmpfs",
+ "/tmp:rw,noexec,nosuid,size=64m",
+ "--tmpfs",
+ "/output:rw,noexec,nosuid,size=64m,uid=65532,gid=65532",
+ "--mount",
+ "type=bind,source=/workspace/cbz0/sandbox-source-6fc0218,target=/source,readonly",
+ "--workdir",
+ "/source",
+ "python:3.11.14-slim-bookworm@sha256:83f339c1be6340ae1096010fdccf6552ac932d8f410d45d206014916bdf37e48",
+ "python",
+ "-B",
+ "-m",
+ "unittest",
+ "discover",
+ "-s",
+ "tests",
+ "-p",
+ "test_architecture_sandbox.py",
+ "-v"
+ ],
+ "started": "2026-10-29T18:31:56.902711+00:00",
+ "finished": "2026-10-29T18:32:01.547497+00:00",
+ "exit": 0,
+ "exact_staged_root_mode": "0755",
+ "source_fix": "Explicitlychmod snapshotroot itself aswellaschildren; mkdir0755 alone was masked by0077umask. Originalworktreepermissions/testassertionsunchanged."
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged.stderr b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged.stderr
new file mode 100644
index 000000000..f45f76006
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged.stderr
@@ -0,0 +1,10 @@
+test_kernel_enforces_cpu_memory_and_process_limits (test_architecture_sandbox.ArchitectureSandbox.test_kernel_enforces_cpu_memory_and_process_limits) ... ok
+test_network_namespace_has_no_external_interface_or_route (test_architecture_sandbox.ArchitectureSandbox.test_network_namespace_has_no_external_interface_or_route) ... ok
+test_nonroot_and_no_new_privileges (test_architecture_sandbox.ArchitectureSandbox.test_nonroot_and_no_new_privileges) ... ok
+test_output_quota_stops_disk_exhaustion_and_cleanup_recovers_space (test_architecture_sandbox.ArchitectureSandbox.test_output_quota_stops_disk_exhaustion_and_cleanup_recovers_space) ... ok
+test_source_mount_is_read_only_and_environment_has_no_publishing_secret (test_architecture_sandbox.ArchitectureSandbox.test_source_mount_is_read_only_and_environment_has_no_publishing_secret) ... ok
+
+----------------------------------------------------------------------
+Ran 5 tests in 0.060s
+
+OK
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged.stdout b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged.stdout
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox.stderr b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox.stderr
new file mode 100644
index 000000000..71224d673
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox.stderr
@@ -0,0 +1,17 @@
+Traceback (most recent call last):
+ File "", line 198, in _run_module_as_main
+ File "", line 88, in _run_code
+ File "/usr/local/lib/python3.11/unittest/__main__.py", line 18, in
+ main(module=None)
+ File "/usr/local/lib/python3.11/unittest/main.py", line 101, in __init__
+ self.parseArgs(argv)
+ File "/usr/local/lib/python3.11/unittest/main.py", line 127, in parseArgs
+ self._do_discovery(argv[2:])
+ File "/usr/local/lib/python3.11/unittest/main.py", line 247, in _do_discovery
+ self.createTests(from_discovery=True, Loader=Loader)
+ File "/usr/local/lib/python3.11/unittest/main.py", line 157, in createTests
+ self.test = loader.discover(self.start, self.pattern, self.top)
+ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+ File "/usr/local/lib/python3.11/unittest/loader.py", line 332, in discover
+ raise ImportError('Start directory is not importable: %r' % start_dir)
+ImportError: Start directory is not importable: 'tests'
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox.stdout b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox.stdout
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/shop-input-receipt.json b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/shop-input-receipt.json
new file mode 100644
index 000000000..a2cce4124
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/shop-input-receipt.json
@@ -0,0 +1,26 @@
+[
+ {
+ "field": "coefficient",
+ "path": "/workspace/research/website-repair-20261028/joint-qa/fixtures/math/coefficients/side24_v1/ENCLOSURE.json",
+ "bytes": 1090,
+ "sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811"
+ },
+ {
+ "field": "proof",
+ "path": "/workspace/research/website-repair-20261028/joint-qa/fixtures/math/coefficients/side24_v1/PROOF.md",
+ "bytes": 10272,
+ "sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769"
+ },
+ {
+ "field": "imports",
+ "path": "/workspace/research/website-repair-20261028/joint-qa/fixtures/math/imports/hardening_ebedb780/MANIFEST.json",
+ "bytes": 18262,
+ "sha256": "fa7f33839924d340cc1123fe05276f681e6aa12193c68b2d1aa6ab489150d8e3"
+ },
+ {
+ "field": "query",
+ "path": "/workspace/research/website-repair-20261028/joint-qa/fixtures/query/portable/CANDIDATE_DOWNSTREAM_GATE_STUBS.json",
+ "bytes": 4623,
+ "sha256": "4046357b30c56e911a8aea14515611201d4dbe3f7b9f16b99b61d4e10fccf828"
+ }
+]
\ No newline at end of file
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/MAIN_PROOF_INDEX.json b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/MAIN_PROOF_INDEX.json
new file mode 100644
index 000000000..c2cf779d4
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/MAIN_PROOF_INDEX.json
@@ -0,0 +1,577 @@
+{
+ "proofs": [
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.lattice_shell_constant",
+ "module": "UniversalLaw.Side24.Ledger",
+ "prop_premise_binders": [],
+ "statement": "27 * 27 = 729 \u2227 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"
+ }
+ },
+ {
+ "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 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 1 * UniversalLaw.Side24.fact 1 * UniversalLaw.Side24.fact 4) = 15 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 2 * UniversalLaw.Side24.fact 2 * UniversalLaw.Side24.fact 2) = 45 \u2227\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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.geometric_ratio_constants",
+ "module": "UniversalLaw.Side24.Ledger",
+ "prop_premise_binders": [],
+ "statement": "2 ^ 9 = 512 \u2227 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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.exponent_bounds",
+ "module": "UniversalLaw.Side24.Ledger",
+ "prop_premise_binders": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "d \u2208 [2, 3]"
+ }
+ ],
+ "statement": "\u2200 (d : Nat),\n d \u2208 [2, 3] \u2192\n UniversalLaw.Side24.sixA d + 2 * UniversalLaw.Side24.sixB d < 84 \u2227\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"
+ ]
+ }
+ },
+ {
+ "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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.covariance_relative_bound",
+ "module": "UniversalLaw.Side24.Ledger",
+ "prop_premise_binders": [],
+ "statement": "2 * 10 * 3 = 60 \u2227 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"
+ }
+ },
+ {
+ "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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.odd_block_shifted_minors",
+ "module": "UniversalLaw.Side24.Ledger",
+ "prop_premise_binders": [],
+ "statement": "3 * 1 - 1 = 2 \u2227 3 * 15 - 1 = 44 \u2227 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"
+ }
+ },
+ {
+ "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"
+ }
+ },
+ {
+ "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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.odd_block_eigenvalues",
+ "module": "UniversalLaw.Side24.Ledger",
+ "prop_premise_binders": [],
+ "statement": "1 + 15 = 2 * 8 \u2227 1 * 15 - -3 * -3 = 6 \u2227 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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.pairing_sum_le_six",
+ "module": "UniversalLaw.Side24.Ledger",
+ "prop_premise_binders": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "q \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ }
+ ],
+ "statement": "\u2200 (q : Nat), q \u2208 [0, 1, 2, 3, 4, 5, 6] \u2192 UniversalLaw.Side24.pairingSum q \u2264 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"
+ ]
+ }
+ },
+ {
+ "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"
+ }
+ },
+ {
+ "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"
+ }
+ },
+ {
+ "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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.exponent_values",
+ "module": "UniversalLaw.Side24.Ledger",
+ "prop_premise_binders": [],
+ "statement": "UniversalLaw.Side24.sixA 2 = 13 \u2227\n UniversalLaw.Side24.sixB 2 = 15 \u2227 UniversalLaw.Side24.sixA 3 = 25 \u2227 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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.ratio_constant_ordering",
+ "module": "UniversalLaw.Side24.Ledger",
+ "prop_premise_binders": [],
+ "statement": "13 \u2264 32 \u2227 28 \u2264 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"
+ }
+ },
+ {
+ "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"
+ }
+ },
+ {
+ "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"
+ }
+ },
+ {
+ "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"
+ }
+ },
+ {
+ "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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.hessian_block_eigenvalues",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "prop_premise_binders": [],
+ "statement": "2 + 2 = 4 \u2227 3 + 2 = 5 \u2227 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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.pin_determinant_and_joint_dimension",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "prop_premise_binders": [],
+ "statement": "3 * 1 * 1 = 3 \u2227 2 + 1 + 2 * 3 / 2 = 6 \u2227 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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.transverse_covariance_entries_thirds",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "prop_premise_binders": [],
+ "statement": "2 + 3 + 3 = 8 \u2227 0 + 3 + 0 = 3 \u2227 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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.trace_and_traceless_variances",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "prop_premise_binders": [],
+ "statement": "8 + 8 + 2 * 2 = 20 \u2227 20 * 3 = 5 * 12 \u2227 8 + 8 - 2 * 2 = 12 \u2227 12 = 1 * 12 \u2227 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"
+ }
+ },
+ {
+ "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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.cone_moment_m2_algebra",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "prop_premise_binders": [],
+ "statement": "4 * 5 = 20 \u2227 25 - 20 + 24 = 29 \u2227 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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.d2_endpoints_adjacent",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "prop_premise_binders": [],
+ "statement": "UniversalLaw.Side24.d2Lower < UniversalLaw.Side24.d2Upper \u2227\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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.d3_endpoints_adjacent",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "prop_premise_binders": [],
+ "statement": "UniversalLaw.Side24.d3Lower < UniversalLaw.Side24.d3Upper \u2227\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"
+ }
+ },
+ {
+ "axioms": [],
+ "declaration": "UniversalLaw.Side24.endpoints_in_unit_tenth",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "prop_premise_binders": [],
+ "statement": "0 < UniversalLaw.Side24.d3Lower \u2227 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"
+ }
+ },
+ {
+ "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"
+ }
+ }
+ ],
+ "source_commit": "4ef1867175dbe1072a54a02e95f80c4e2c70a4ff",
+ "meaning": "Only the literal31 arithmetic theorem statements. Generated/computational definitions are not proof entries. No source parent theorem, probability law, coefficient enclosure or independent alignment is inferred.",
+ "latest_portable_checked_commit": "f20cc54d4d136e854608853372249882eb4c949f",
+ "latest_portable_receipt": "portable-main-receipt.json",
+ "portable_source_path": "tools/CBZNonvacuity.lean",
+ "portable_command": "python -B -S tools/cbz_lean_check.py",
+ "audit_input_sha256": {
+ "tools/CBZNonvacuity.lean": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f",
+ "tools/cbz_lean_check.py": "7b716e0507c0963510af5d276d1b900378df1cb630c5888551db3f939b333e75",
+ "tools/formal_gate_check.py": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5"
+ },
+ "audit_module_constants": [
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.dimensions_inhabited",
+ "prop_premises": [],
+ "statement": "\u2203 d, d \u2208 [2, 3]"
+ },
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.pairing_all_seven",
+ "prop_premises": [],
+ "statement": "0 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 1 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 2 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 3 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 4 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 5 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 6 \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ },
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.dimensions_both",
+ "prop_premises": [],
+ "statement": "2 \u2208 [2, 3] \u2227 3 \u2208 [2, 3]"
+ },
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.pairing_domain_inhabited",
+ "prop_premises": [],
+ "statement": "\u2203 q, q \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ }
+ ]
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/QUARANTINE_BOUNDARIES.json b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/QUARANTINE_BOUNDARIES.json
new file mode 100644
index 000000000..2e76f9500
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/QUARANTINE_BOUNDARIES.json
@@ -0,0 +1,19102 @@
+{
+ "scope": "Runtime/semantic closure residue for all162 current Math Lean files, grouped by source boundary. This preserves existing historical formal evidence and does not assert any original theorem is false.",
+ "Math_current_commit": "8151f592918a845bf19eb8eafaf8444540a32734",
+ "entries": [
+ {
+ "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 (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (f : \u03a9 \u2192 \u211d)\n (S T : Set \u03a9) (hS : MeasurableSet S) (hT : MeasurableSet T)\n (hST : Disjoint S T) (hf : Integrable f \u03bc) (hf0 : \u2200 w, 0 \u2264 f w)\n (a b : \u211d) (ha : \u2200 w \u2208 S, a \u2264 f w) (hb : \u2200 w \u2208 T, b \u2264 f w) :\n \u03bc.real S * a + \u03bc.real T * b \u2264 \u222b w, f w \u2202"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "two_radius_integral_lower",
+ "line": 46,
+ "source_header": "e\n\ntheorem two_radius_integral_lower (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (X f : \u03a9 \u2192 \u211d)\n (s t p q a b : \u211d)\n (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t}) (hst : s \u2260 t)\n (hp : p \u2264 \u03bc.real {w | X w ^ 2 = s}) (hq : q \u2264 \u03bc.real {w | X w ^ 2 = t})\n (ha0 : 0 \u2264 a) (hb0 : 0 \u2264 b) (hf : Integrable f \u03bc) (hf0 : \u2200 w, 0 \u2264 f w)\n (ha : \u2200 w, X w ^ 2 = s \u2192 f w = a) (hb : \u2200 w, X w ^ 2 = t \u2192 f w = b) :\n p * a + q * b \u2264 \u222b w, f w \u2202"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "second_moment_floor",
+ "line": 63,
+ "source_header": ")\n\ntheorem second_moment_floor (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (X : \u03a9 \u2192 \u211d)\n (s t p q : \u211d) (hs : 0 < s) (ht : 0 < t) (hst : s \u2260 t)\n (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t})\n (hp : p \u2264 \u03bc.real {w | X w ^ 2 = s}) (hq : q \u2264 \u03bc.real {w | X w ^ 2 = t})\n (h2 : Integrable (fun w => X w ^ 2) \u03bc) :\n p*s + q*t \u2264 moment \u03bc X"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "fourth_gap_floor",
+ "line": 74,
+ "source_header": ")\n\ntheorem fourth_gap_floor (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (X : \u03a9 \u2192 \u211d)\n (s t p q : \u211d) (hp0 : 0 < p) (hq0 : 0 < q) (hst : s \u2260 t)\n (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t})\n (hp : p \u2264 \u03bc.real {w | X w ^ 2 = s}) (hq : q \u2264 \u03bc.real {w | X w ^ 2 = t})\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc) :\n p*q/(p+q)*(s-t)^2 \u2264 moment \u03bc X 4 - (moment \u03bc X 2)^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "residual_moment_floor",
+ "line": 90,
+ "source_header": "h\n\ntheorem residual_moment_floor (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (X : \u03a9 \u2192 \u211d)\n (s t p q : \u211d) (hs : 0 < s) (ht : 0 < t) (hp0 : 0 < p) (hq0 : 0 < q)\n (hst : s \u2260 t) (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t})\n (hp : p \u2264 \u03bc.real {w | X w ^ 2 = s}) (hq : q \u2264 \u03bc.real {w | X w ^ 2 = t})\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc)\n (h6 : Integrable (fun w => X w ^ 6) \u03bc) :\n (p*s)*(q*t)/(p*s+q*t)*(s-t)^2 \u2264\n d2Delta (moment \u03bc X 2) (moment \u03bc X 4) (moment \u03bc X 6"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "schur_floor_of_radius_masses",
+ "line": 130,
+ "source_header": ")\n\ntheorem schur_floor_of_radius_masses (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (X : \u03a9 \u2192 \u211d)\n (s t p q u : \u211d) (hs : 0 < s) (ht : 0 < t) (hp0 : 0 < p) (hq0 : 0 < q)\n (hst : s \u2260 t) (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t})\n (hp : p \u2264 \u03bc.real {w | X w ^ 2 = s}) (hq : q \u2264 \u03bc.real {w | X w ^ 2 = t})\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc) (hu0 : 0 \u2264 u) (hu1 : u \u2264 1/4) :\n min (p*q/(p+q)*(s-t)^2) (2*(p*s+q*t)^2) \u2264\n d2Schur (moment \u03bc X 2) (moment \u03bc 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."
+ ]
+ },
+ {
+ "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 (\u03bc : Measure \u03a9) (X : \u03a9 \u2192 \u211d) (n : \u2115) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "cubicResidual",
+ "line": 23,
+ "source_header": "\u03bc\n\ndef cubicResidual (c x : \u211d) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "residual_sq_expand",
+ "line": 25,
+ "source_header": "x\n\ntheorem residual_sq_expand (c x : \u211d) :\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 (\u03bc : Measure \u03a9) (X : \u03a9 \u2192 \u211d) (c : \u211d)\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc)\n (h6 : Integrable (fun w => X w ^ 6) \u03bc) :\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 (\u03bc : Measure \u03a9) (X : \u03a9 \u2192 \u211d)\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc)\n (h6 : Integrable (fun w => X w ^ 6) \u03bc)\n (hm2 : moment \u03bc X 2 \u2260 0) :\n (\u222b w, cubicResidual (moment \u03bc X 4 / moment \u03bc X 2) (X w) ^ 2 \u2202\u03bc) =\n d2Delta (moment \u03bc X 2) (moment \u03bc X 4) (moment \u03bc X"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "delta_nonneg",
+ "line": 63,
+ "source_header": "ing\n\ntheorem delta_nonneg (\u03bc : Measure \u03a9) (X : \u03a9 \u2192 \u211d)\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc)\n (h6 : Integrable (fun w => X w ^ 6) \u03bc)\n (hm2 : moment \u03bc X 2 \u2260 0) :\n 0 \u2264 d2Delta (moment \u03bc X 2) (moment \u03bc X 4) (moment \u03bc X"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "delta_eq_zero_iff_residual",
+ "line": 72,
+ "source_header": "_)\n\ntheorem delta_eq_zero_iff_residual (\u03bc : Measure \u03a9) (X : \u03a9 \u2192 \u211d)\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc)\n (h6 : Integrable (fun w => X w ^ 6) \u03bc)\n (hm2 : moment \u03bc X 2 \u2260 0) :\n d2Delta (moment \u03bc X 2) (moment \u03bc X 4) (moment \u03bc X 6) = 0 \u2194\n \u2200\u1d50 w \u2202\u03bc, cubicResidual (moment \u03bc X 4 / moment \u03bc 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 : \u211d) :\n cubicResidual c x = 0 \u2194 x = 0 \u2228 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 (\u03bc : Measure \u03a9) (X : \u03a9 \u2192 \u211d)\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc)\n (h6 : Integrable (fun w => X w ^ 6) \u03bc)\n (hm2 : moment \u03bc X 2 \u2260 0) :\n d2Delta (moment \u03bc X 2) (moment \u03bc X 4) (moment \u03bc X 6) = 0 \u2194\n \u2200\u1d50 w \u2202\u03bc, X w = 0 \u2228 X w ^ 2 = moment \u03bc X 4 / moment"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "delta_pos_iff_not_support",
+ "line": 112,
+ "source_header": "_iff]\n\ntheorem delta_pos_iff_not_support (\u03bc : Measure \u03a9) (X : \u03a9 \u2192 \u211d)\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc)\n (h6 : Integrable (fun w => X w ^ 6) \u03bc)\n (hm2 : moment \u03bc X 2 \u2260 0) :\n 0 < d2Delta (moment \u03bc X 2) (moment \u03bc X 4) (moment \u03bc X 6) \u2194\n \u00ac (\u2200\u1d50 w \u2202\u03bc, X w = 0 \u2228 X w ^ 2 = moment \u03bc X 4 / moment \u03bc"
+ },
+ {
+ "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 (\u03bc : Measure \u03a9) (X : \u03a9 \u2192 \u211d) (p : \u211d \u2192 Prop)\n (h : \u2200\u1d50 w \u2202\u03bc, p (X w)) (a : \u211d) (ha : \u03bc {w | X w = a} \u2260 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "moment_two_pos_of_atom",
+ "line": 140,
+ "source_header": "sing hp\n\ntheorem moment_two_pos_of_atom (\u03bc : Measure \u03a9) (X : \u03a9 \u2192 \u211d)\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (a : \u211d) (ha0 : a \u2260 0) (ha : \u03bc {w | X w = a} \u2260 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 (\u03bc : Measure \u03a9) (X : \u03a9 \u2192 \u211d)\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc)\n (h6 : Integrable (fun w => X w ^ 6) \u03bc)\n (a b : \u211d) (ha0 : a \u2260 0) (hb0 : b \u2260 0) (hab : a ^ 2 \u2260 b ^ 2)\n (ha : \u03bc {w | X w = a} \u2260 0) (hb : \u03bc {w | X w = b} \u2260 0) :\n 0 < d2Delta (moment \u03bc X 2) (moment \u03bc X 4) (moment"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "square_gap_integrable",
+ "line": 168,
+ "source_header": ").symm)\n\ntheorem square_gap_integrable (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (X : \u03a9 \u2192 \u211d)\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc) :\n Integrable (fun w => (X w ^ 2 - moment \u03bc 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 (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (X : \u03a9 \u2192 \u211d)\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc) :\n (\u222b w, (X w ^ 2 - moment \u03bc X 2) ^ 2 \u2202\u03bc) = moment \u03bc X 4 - (moment \u03bc"
+ },
+ {
+ "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 (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc]\n (X : \u03a9 \u2192 \u211d) (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc)\n (a b : \u211d) (hab : a ^ 2 \u2260 b ^ 2)\n (ha : \u03bc {w | X w = a} \u2260 0) (hb : \u03bc {w | X w = b} \u2260 0) :\n (moment \u03bc 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 (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (X : \u03a9 \u2192 \u211d)\n (h2 : Integrable (fun w => X w ^ 2) \u03bc)\n (h4 : Integrable (fun w => X w ^ 4) \u03bc)\n (h6 : Integrable (fun w => X w ^ 6) \u03bc)\n (a b q : \u211d) (ha0 : a \u2260 0) (hb0 : b \u2260 0) (hab : a ^ 2 \u2260 b ^ 2)\n (ha : \u03bc {w | X w = a} \u2260 0) (hb : \u03bc {w | X w = b} \u2260 0)\n (hq0 : 0 \u2264 q) (hq1 : q \u2264 1 / 4) :\n 0 < d2Tau (moment \u03bc X 2) (moment \u03bc 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 : \u211d) - (1 / 2) ^ 2 = 1 / 4 \u2227 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."
+ ]
+ },
+ {
+ "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 : \u211d) (huv : u + v \u2260 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 : \u211d) (hu : 0 < u) (hv : 0 < v) :\n u*v/(u+v)*(a-b)^2 \u2264 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 : \u211d) (hm2 : 0 < m2) (hm4 : m2^2 < m4)\n (hq0 : 0 \u2264 q) (hq1 : q \u2264 1/4) :\n min (m4-m2^2) (2*m2^2) \u2264 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 : \u211d) (hs0 : 0 < s0) (hg0 : 0 < g0)\n (hm2 : s0 \u2264 m2) (hgap : g0 \u2264 m4-m2^2) (hq0 : 0 \u2264 q) (hq1 : q \u2264 1/4) :\n min g0 (2*s0^2) \u2264 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."
+ ]
+ },
+ {
+ "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 : \u2115"
+ },
+ {
+ "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 : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124) : torus_"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_field_latticeVec_formula",
+ "line": 26,
+ "source_header": "\u211d))\n\ntheorem torus_field_latticeVec_formula (d : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124) :\n torus_latticeVec d L n = \u2211 i, EuclideanSpace.single i (L * (n i :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torus_periodBasis",
+ "line": 29,
+ "source_header": "rfl\n\ndef torus_periodBasis (d : \u2115) (L : \u211d) (hL : 0 < L) :\n Module.Basis (Fin d) \u211d (torus_E"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torus_periodLattice",
+ "line": 34,
+ "source_header": "e')\n\ndef torus_periodLattice (d : \u2115) (L : \u211d) (hL : 0 < L) : Submodule \u2124 (torus_E"
+ },
+ {
+ "kind": "abbrev",
+ "unqualified_name": "torus_quotient",
+ "line": 37,
+ "source_header": "L))\n\nabbrev torus_quotient (d : \u2115) (L : \u211d) (hL : 0 <"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torus_proj",
+ "line": 40,
+ "source_header": "oup\n\ndef torus_proj (d : \u2115) (L : \u211d) (hL : 0 < L) : torus_E d \u2192 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 : \u2115) (L : \u211d) (hL : 0 < L)\n (n : Fin d \u2192 \u2124) :\n \u2211 i, n i \u2022 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 : \u2115) (L : \u211d) (hL : 0 < L) (x : torus_E d) :\n x \u2208 torus_periodLattice d L hL \u2194 \u2203 n : Fin d \u2192 \u2124, torus_latticeVec d L"
+ },
+ {
+ "kind": "instance",
+ "unqualified_name": "torus_lattice_discrete",
+ "line": 68,
+ "source_header": "eVec]\n\ninstance torus_lattice_discrete (d : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (hL : 0 < L) :\n IsZLattice \u211d (torus_periodLattice d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_proj_surjective",
+ "line": 83,
+ "source_header": "tance\n\ntheorem torus_proj_surjective (d : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (hL : 0 < L) (x y : torus_E d) :\n torus_proj d L hL x = torus_proj d L hL y \u2194\n \u2203 n : Fin d \u2192 \u2124, y = x + torus_latticeVec"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_control_lattice_translate",
+ "line": 102,
+ "source_header": "abel\u27e9\n\n/-- Duplicate representatives have exactly the same quotient image. -/\ntheorem torus_control_lattice_translate (d : \u2115) (L : \u211d) (hL : 0 < L)\n (x : torus_E d) (n : Fin d \u2192 \u2124) :\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": "\u27e9).symm\n\ntheorem torus_proj_isCoveringMap (d : \u2115) (L : \u211d) (hL : 0 < L) :\n IsCoveringMap (torus_proj"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_compact",
+ "line": 114,
+ "source_header": "ringMap\n\ntheorem torus_compact (d : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (g : torus_E d \u2192"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_field_periodic_formula",
+ "line": 129,
+ "source_header": "n) = g x\n\ntheorem torus_field_periodic_formula (d : \u2115) (L : \u211d) (g : torus_E d \u2192 \u211d) :\n torus_isPeriodic d L g \u2194\n \u2200 (x : EuclideanSpace \u211d (Fin d)) (n : Fin d \u2192 \u2124),\n g (x + \u2211 i, EuclideanSpace.single i (L * (n i : \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_periodic_respects",
+ "line": 134,
+ "source_header": "= Iff.rfl\n\ntheorem torus_periodic_respects (d : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (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 : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (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 : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (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 : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (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 : \u2115) (L : \u211d) (hL : 0 < L)\n {M : torus_E d} {y : torus_quotient d L hL}\n (\u03b3 : Path (torus_proj d L hL M) y) :\n \u2203 z : torus_E d, \u2203 \u0393 : Path M z,\n torus_proj d L hL z = y \u2227\n \u2200 t : unitInterval, torus_proj d L hL"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_control_constant_path_endpoint",
+ "line": 169,
+ "source_header": "\u03b3.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 : \u2115) (L : \u211d) (hL : 0 < L)\n {M z : torus_E d} (\u0393 : Path M z)\n (h\u0393 : \u2200 t : unitInterval, torus_proj d L hL (\u0393 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 : \u2115) (L : \u211d) (hL : 0 < L)\n (M : torus_E d) (n : Fin d \u2192 \u2124) (hn : torus_latticeVec d L n \u2260 0) :\n torus_proj d L hL (M + torus_latticeVec d L n) = torus_proj d L hL M \u2227\n \u00ac \u2203 \u0393 : Path M (M + torus_latticeVec d L n),\n \u2200 t : unitInterval, torus_proj d L hL (\u0393 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 : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (hg : torus_isPeriodic d L g) (M : torus_E d) (P : \u211d \u2192 Prop) :\n (\u2203 y : torus_E d, g M < g y \u2227 \u2203 \u03b3 : Path M y, \u2200 t : unitInterval, P (g (\u03b3 t))) \u2194\n (\u2203 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 \u2227\n \u2203 \u03b3 : Path (torus_proj d L hL M) y,\n \u2200 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 : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : \u211d) :\n (\u2203 y : torus_E d, g M < g y \u2227 \u2203 \u03b3 : Path M y, \u2200 t : unitInterval, h < g (\u03b3 t)) \u2194\n (\u2203 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 \u2227\n \u2203 \u03b3 : Path (torus_proj d L hL M) y,\n \u2200 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 : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : \u211d) :\n (\u2203 y : torus_E d, g M < g y \u2227 \u2203 \u03b3 : Path M y, \u2200 t : unitInterval, h \u2264 g (\u03b3 t)) \u2194\n (\u2203 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 \u2227\n \u2203 \u03b3 : Path (torus_proj d L hL M) y,\n \u2200 t : unitInterval, h \u2264 torus_descend d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_global_max_iff",
+ "line": 234,
+ "source_header": "(fun a => h \u2264 a)\n\ntheorem torus_global_max_iff (d : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (hg : torus_isPeriodic d L g) (M : torus_E d) :\n (\u2200 y : torus_E d, g y \u2264 g M) \u2194\n \u2200 y : torus_quotient d L hL,\n torus_descend d L hL g hg y \u2264 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 `\u2124` as a `\u2124`-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": "\u2124 \u2124\n\n/-- Proves: nothing; it names the zero coefficient object, the one-point `\u2124`-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 `\u2124`-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 : \u2124`, where they give `1` and `0`.\nDoes not establish: nonvanishing of any homology class by itself. -/\ntheorem ordinaryH0Control_intCoeff_id_ne_zero :\n (\ud835\udfd9 ordinaryH0Control_intCoeff : ordinaryH0Control_intCoeff \u27f6 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 (\ud835\udfd9 ordinaryH0Control_mod2Coeff : ordinaryH0Control_mod2Coeff \u27f6 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 (\ud835\udfd9 ordinaryH0Control_mod2Coeff : ordinaryH0Control_mod2Coeff \u27f6 ordinaryH0Control_mod2Coeff) +\n \ud835\udfd9 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 \u2124`.\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 (\ud835\udfd9 ordinaryH0Control_zeroCoeff : ordinaryH0Control_zeroCoeff \u27f6 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} \u2124) :\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 `\u2124` (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} \u2124) 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} \u2124) 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 `\u2124`.\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 () \u226b\n TopCat.singularHomology\u2080\u03b5 (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 `\u2124`.\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 \u00ac IsZero (((singularHomologyFunctor (ModuleCat.{0} \u2124) 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 \u21a6 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 \u211d) ordinaryH0Control_intCoeff (0 : \u211d) -\n ordinaryH0_pointClass (TopCat.of \u211d) 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 \u211d) ordinaryH0Control_zeroCoeff (0 : \u211d) -\n ordinaryH0_pointClass (TopCat.of \u211d)"
+ },
+ {
+ "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 `\u2124`.\nDoes not establish: distinctness of the two classes, which are equal. -/\ntheorem ordinaryH0Control_line_classes_ne_zero :\n ordinaryH0_pointClass (TopCat.of \u211d) ordinaryH0Control_intCoeff (0 : \u211d) \u2260 0 \u2227\n ordinaryH0_pointClass (TopCat.of"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ordinaryH0Control_discrete_component_ne",
+ "line": 226,
+ "source_header": "ordinaryH0Control_intCoeff_id_ne_zero _\u27e9\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 \u2260 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 \u2260 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 \u2260\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 \u2260\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) \u226b\n ((singularHomologyFunctor (ModuleCat.{0} \u2124) 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 \u226b\n ((singularHomologyFunctor (ModuleCat.{0} \u2124) 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) \u226b\n ((singularHomologyFunctor (ModuleCat.{0} \u2124) 0).obj ordinaryH0Control_intCoeff).map\n ordinaryH0Control_collapse = 0 \u2227\n \u2200 b : Bool, ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff b \u226b\n ((singularHomologyFunctor (ModuleCat.{0} \u2124) 0).obj ordinaryH0Contr"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "ordinaryH0Control_fst",
+ "line": 301,
+ "source_header": "ifference_zero, ordinaryH0Control_collapse_image_ne_zero\u27e9\n\n/-- Proves: nothing; it names the continuous first projection of the discrete square `Bool \u00d7 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 \u27e8Prod.fst, continuous_fst\u27e9\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 \u00d7 Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool \u00d7 Bool) -\n ordinaryH0_pointClass (TopCat.of (Bool \u00d7 Bool)) ordinaryH0Control_intCoeff ((true, true) : Bool \u00d7 Bool) \u2260 0 \u2227\n ordinaryH0_pointClass (TopCat.of (Bool \u00d7 Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool \u00d7 Bool) -\n ordinaryH0_pointClass (TopCat.of (Bool \u00d7 Bool))"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ordinaryH0Control_fst_difference_zero",
+ "line": 320,
+ "source_header": "ntrol_discrete_component_ne (X := Bool \u00d7 Bool) (by decide)))\u27e9\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 \u00d7 Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool \u00d7 Bool) -\n ordinaryH0_pointClass (TopCat.of (Bool \u00d7 Bool)) ordinaryH0Control_intCoeff ((true, true) : Bool \u00d7 Bool)) \u226b\n ((singularHomologyFunctor (ModuleCat.{0} \u2124) 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 \u00d7 Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool \u00d7 Bool) -\n ordinaryH0_pointClass (TopCat.of (Bool \u00d7 Bool)) ordinaryH0Control_intCoeff ((false, true) : Bool \u00d7 Bool)) \u226b\n ((singularHomologyFunctor (ModuleCat.{0} \u2124) 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 \u00ac \u2200 (X : TopCat.{0}) (R : ModuleCat.{0} \u2124) (x y : X),\n ZerothHomotopy.mk x \u2260 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 \u00ac \u2200 (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 \u21a6 x ^ 2` at parameter `-1`.\nMethod: membership is `-(-1) \u2264 (-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 : \u211d => x ^ 2) (-1) :=\n \u27e8-1, by norm_num [superlevel_set]\u27e9\n\n/-- Proves: nothing; it names the point `1` of the closed superlevel of `x \u21a6 x ^ 2` at parameter `-1`.\nMethod: membership is `-(-1) \u2264 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 : \u211d => x ^ 2) (-1) :=\n \u27e81, by norm_num [superlevel_set]\u27e9\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 : \u211d) \u2264 -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 \u2264 x ^ 2}` but not in `{x | 1 \u2264 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 : \u211d) < -1 / 4 \u2227 (1 / 2 : \u211d) \u2208 superlevel_set (fun x : \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ordinaryH0Control_parabola_not_joined_quarter",
+ "line": 399,
+ "source_header": "=> x ^ 2) (-1) := by\n refine \u27e8by norm_num, ?_, ?_\u27e9 <;> norm_num [superlevel_set]\n\n/-- Proves: `-1` and `1` are not joined inside the closed superlevel `{x | 1/4 \u2264 x ^ 2}` of `x \u21a6 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 \u00ac JoinedIn (superlevel_set (fun x : \u211d => x ^ 2) (-1"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ordinaryH0Control_parabola_joined",
+ "line": 413,
+ "source_header": "laRight]\u27e9\n have hmem := h\u03b3 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 \u21a6 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 : \u211d => x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ordinaryH0Control_parabola_difference_zero",
+ "line": 425,
+ "source_header": "(by\n intro z _\n show -(0 : \u211d) \u2264 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 : \u211d => x ^ 2) (-1)))\n ordinaryH0Control_intCoeff ordinaryH0Control_parabolaLeft -\n ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : \u211d => x ^ 2) (-1)))\n ordinaryH0Control_intCoeff ordinaryH0Control_parabolaRight) \u226b\n (superlevel_h0Filtration (fun x : \u211d => 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 : \u211d => x ^ 2) (-1)))\n ordinaryH0Control_intCoeff ordinaryH0Control_parabolaLeft -\n ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : \u211d => x ^ 2) (-1)))\n ordinaryH0Control_intCoeff ordinaryH0Control_parabolaRight) \u226b\n (superlevel_h0Filtration (fun x : \u211d => 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} \u2964 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 \u27f6 Y) (q : ZerothHomotopy X) :\n Sigma.\u03b9 (fun _ : ZerothHomotopy X => R) q \u226b\n (ordinaryH0_componentCoproductFunctor R).map f =\n Sigma.\u03b9 (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 \u2192 \u211d) (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 \u2192 \u211d) (R : C) {s t : \u211d} (hst : s \u2264 t)\n (q : ZerothHomotopy (superlevel_set g s)) :\n Sigma.\u03b9 (fun _ : ZerothHomotopy (superlevel_set g s) => R) q \u226b\n (ordinaryH0_componentFiltration g R).map (homOfLE hst) =\n Sigma.\u03b9 (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 _\u298b0\u298c) :\n R \u27f6 S"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ordinaryH0_simplicialPointClass_iso",
+ "line": 107,
+ "source_header": ").homology\u03c0 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 _\u298b0\u298c) :\n ordinaryH0_simplicialPointClass S R x \u226b (S.homology\u2080Iso R).hom =\n Sigma.\u03b9 (fun _ : S.\u03c0\u2080 => R)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ordinaryH0_simplicialPointClass_map",
+ "line": 117,
+ "source_header": "y\u2080Iso_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 \u27f6 T) (x : S _\u298b0\u298c) :\n ordinaryH0_simplicialPointClass S R x \u226b 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 \u27f6 Y) (x : X) :\n (TopCat.toSSet.map f).app _ (TopCat.toSSetObj\u2080Equiv.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 \u27f6 ((singularHomologyFunc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ordinaryH0_pointClass_map",
+ "line": 144,
+ "source_header": "SSetObj\u2080Equiv.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 \u27f6 Y) (x : X) :\n ordinaryH0_pointClass X R x \u226b ((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 \u226b (TopCat.singularHomology\u2080Iso X R).hom =\n Sigma.\u03b9 (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.\u03b9 (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk x) \u226b\n (TopCat.singularHomology\u2080Iso 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 \u27f6 A}\n (h : \u2200 x : X, ordinaryH0_pointClass X R x \u226b 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 \u27f6 Y) :\n ((singularHomologyFunctor C 0).obj R).map f \u226b\n (TopCat.singularHomology\u2080Iso Y R).hom =\n (TopCat.singularHomology\u2080Iso X R).hom \u226b\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 \u2245 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 \u226b"
+ },
+ {
+ "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 : (\ud835\udfd9 R : R \u27f6 R) \u2260 0) (x :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ordinaryH0_pointClass_eq_of_component_eq",
+ "line": 236,
+ "source_header": ", zero_comp] at h\u03b5\n exact hR h\u03b5.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 : (\ud835\udfd9 R : R \u27f6 R) \u2260 0) (x y : X)\n (hxy : ZerothHomotopy.mk x \u2260 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 \u226b 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 : (\ud835\udfd9 R : R \u27f6 R) \u2260 0) (x y : X) :\n ordinaryH0_pointClass X R x = ordinaryH0_pointClass X R y \u2194"
+ },
+ {
+ "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 \u27f6 Y) (x y : X) :\n (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) \u226b\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 : (\ud835\udfd9 R : R \u27f6 R) \u2260 0)\n {X Y : TopCat.{w}} (f : X \u27f6 Y) (x y : X) :\n (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) \u226b\n ((singularHomologyFunctor C 0).obj R).map f = 0 \u2194"
+ },
+ {
+ "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 \u2192 \u211d) (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 \u2192 \u211d) (R : C) {s t : \u211d} (hst : s \u2264 t) :\n (superlevel_h0Filtration g R).map (homOfLE hst) \u226b\n (ordinaryH0_filtrationIso g R).hom.app t =\n (ordinaryH0_filtrationIso g R).hom.app s \u226b\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 \u2192 \u211d) (R : C)\n (hR : (\ud835\udfd9 R : R \u27f6 R) \u2260 0) {s t : \u211d} (hst : s \u2264 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) \u226b\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 \u2192 \u211d) (t : \u211d) : 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 `\u2264` to `<` invalidates this statement. -/\ntheorem superlevel_control_closed_endpoint (b : \u211d) :\n () \u2208 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 : \u211d) :\n \u00ac (-(-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 () \u2208 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 \u00ac superlevel_set (fun _ : Unit => (0 : \u211d)) 1 \u2286\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 \u2192 \u211d) (M : X)\n (hM : \u2200 y, g y \u2264 g M) : \u00ac \u2203"
+ },
+ {
+ "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 \u2192 \u211d) {s t : \u211d} (hst : s \u2264 t) :\n superlevel_set g s \u2286 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 \u2192 \u211d) (hg : Continuous g) (t : \u211d) : 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 \u2192 \u211d) {s t : \u211d} (hst : s \u2264 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 \u2192 \u211d) (t : \u211d) :\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 \u2192 \u211d) {r s t : \u211d} (hrs : r \u2264 s) (hst : s \u2264 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 \u2192 \u211d) (x : X) :\n x \u2208 su"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "superlevel_neg_height",
+ "line": 90,
+ "source_header": "simp [superlevel_set]\n\ntheorem superlevel_neg_height {X : Type*} (g : X \u2192 \u211d) (h : \u211d) :\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 (\u2200 h : \u211d, h < 0 \u2192 \u2203 k : \u211d, h < k \u2227 k < 0) \u2227\n \u00ac"
+ },
+ {
+ "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 \u2218"
+ },
+ {
+ "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 \u2192 \u211d) {s t : \u211d} (hst : s \u2264 t) :\n ZerothHomotopy (superlevel_set g s) \u2192 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 \u2192 \u211d) (t : \u211d) : 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 \u2192 \u211d) {r s t : \u211d} (hrs : r \u2264 s) (hst : s \u2264 t) :\n superlevel_componentInclusion g (hrs.trans hst) =\n superlevel_componentInclusion g hst \u2218 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 \u2192 \u211d) (t : \u211d) (x y : superlevel_set g t) :\n ZerothHomotopy.mk x = ZerothHomotopy.mk y \u2194\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 \u2192 \u211d) :"
+ },
+ {
+ "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 \u2192 \u211d) (R : C) (t : \u211d) :\n (superlevel_h0Filtration g R).map (\ud835\udfd9 t) =\n \ud835\udfd9 ((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 \u2192 \u211d) (R : C) {r s t : \u211d} (f : r \u27f6 s) (k : s \u27f6 t) :\n (superlevel_h0Filtration g R).map (f \u226b k) =\n (superlevel_h0Filtration g R).map f \u226b (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 : \u2115} {g : E d \u2192 \u211d} (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 : \u2115) (L : \u211d) : 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 : \u2115) (L : \u211d) :\n Nonempty (SuperlevelBarInterfa"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "superlevelBarField_deathHeight_eq",
+ "line": 79,
+ "source_header": "ce d L\u27e9\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 : \u2115} {L : \u211d} (g : E d \u2192 \u211d) (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 : \u2115} {L : \u211d} (g : E d \u2192 \u211d) (M : E d) :\n (superlevelBarField_interface d L).IsEssential g M \u2194 \u2200 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 : \u2115} {L : \u211d} (g : E d \u2192 \u211d) (M S : E d) :\n (superlevelBarField_interface d L).ElderPartner g M S \u2194\n (IsNondegMax d g M \u2227 IsIndexSaddle d g S \u2227 \u00ac superlevelBar_isEssential g M \u2227\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 : \u2115} {L : \u211d} (I : SuperlevelBarInterface d L)\n (g : E d \u2192 \u211d) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d) :\n I.IsEssential g M \u2194 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 : \u2115} {L : \u211d} (I : SuperlevelBarInterface d L)\n (g : E d \u2192 \u211d) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d)\n (hM : \u00ac 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 : \u2115} {L : \u211d} (I : SuperlevelBarInterface d L)\n (g : E d \u2192 \u211d) (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 \u2194 (superlevelBarField_interface d L)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "superlevelBarField_shift",
+ "line": 139,
+ "source_header": "hne').trans hdeath\u27e9\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 : \u2115) (L c : \u211d) : 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 : \u2115) (L c b : \u211d) (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 : \u2115) (b : \u211d) : 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 : \u2115) (L b : \u211d) :\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 : \u2115) (L : \u211d) (M : E d) :\n IsSmooth d (fun _ : E d => (0 : \u211d)) \u2227 IsLPeriodic d L (fun _ : E d => (0 : \u211d)) \u2227\n (superlevelBarField_interface d L).IsEssential (fun _ => (0 : \u211d)) M \u2227\n (superlevelBarField_shift d L 1).IsEssential (fun _ => (0 : \u211d)) M \u2227\n (superlevelBarField_interface d L).deathHeight (fun _ => (0 : \u211d)) M = 0 \u2227\n (superlevelBarField_shift d L 1).deathHeight (fun _ => (0 : \u211d)) M = 1 \u2227\n (superlevelBarField_interface d L).deathHeight (fun _ => (0 : \u211d)) M \u2260\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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (M : superlevelBar_E d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "superlevelBar_clearanceSet",
+ "line": 49,
+ "source_header": "\u2264 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (M : superlevelBar_E d)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "superlevelBar_deathHeight",
+ "line": 56,
+ "source_header": "(\u03b3 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (M : superlevelBar_E d) :\n superlevelBar_isEssential g M \u2194 \u2200 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (M : superlevelBar_E d) {h : \u211d} (hh : h \u2208 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\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\u27e9\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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (M : superlevelBar_E d)\n (he : superlevelBar_clearanceSet g M = \u2205) : 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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) {M y : superlevelBar_E d} (\u03b3 : Path M y) :\n \u2203 t\u2080 : unitInterval, \u2200 t : unitInt"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "superlevelBar_clearance_nonempty",
+ "line": 142,
+ "source_header": "=> hmin (Set.mem_univ t)\u27e9\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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : \u00ac 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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (hg : Continuous g) (M : superlevelBar_E d) :\n (superlevelBar_clearanceSet g M).Nonempty \u2194 \u00ac"
+ },
+ {
+ "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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (M : superlevelBar_E d) {h c : \u211d} (hhc : h < c)\n (hc : c \u2208 superlevelBar_clearanceSet g M) : h \u2208"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "superlevelBar_clearance_improve",
+ "line": 183,
+ "source_header": ", \u03b3, fun t => hhc.trans (h\u03b3 t)\u27e9\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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) (M : superlevelBar_E d) {h : \u211d}\n (hh : h \u2208 superlevelBar_clearanceSet g M) :\n \u2203 c : \u211d, h < c \u2227 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : \u00ac superlevelBar_isEssential g M) (h : \u211d) :\n h < superlevelBar_deathHeight g M \u2194"
+ },
+ {
+ "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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : \u00ac 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : \u00ac 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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (hg : Continuous g) (M : superlevelBar_E d)\n (hM : \u00ac 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : \u00ac superlevelBar_isEssential g M) (a : \u211d)\n (ha : \u2200 h : \u211d, h < a \u2194 h \u2208 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 : \u2115) (b : \u211d) (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 : \u2115) (M : superlevelBar_E d) :\n superlevelBar_deathHeight (fun _ : superlevelBar_E d => (-1 : \u211d)) M = 0 \u2227\n \u00ac 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."
+ ]
+ },
+ {
+ "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\u00b2` factor\n after the Cauchy\u2013Schwarz 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 : \u211d) (hr : r \u2260 0) (hcZ : cZ \u2260 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\u2013Schwarz numerator estimate and an exact\n normalizer lower bound. It does not formalize the measure-theoretic\n Cauchy\u2013Schwarz step itself. -/\ntheorem p02_lm008_cross_multiplied\n (n z r cW cZ q : \u211d)\n (hr : 0 < r) (hcW : 0 \u2264 cW) (hcZ : 0 < cZ) (hq : 0 \u2264 q)\n (hz : cZ * r ^ 2 \u2264 z)\n (hn : n \u2264 Real.sqrt cW * r ^ 2 * Real.sqrt q) :\n n * (cZ * r ^ 2) \u2264\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\u00b2` cancellation yield the Palm\n square-root transfer coefficient. -/\ntheorem p02_lm008_quotient_bound\n (n z r cW cZ q : \u211d)\n (hr : 0 < r) (hcW : 0 \u2264 cW) (hcZ : 0 < cZ) (hq : 0 \u2264 q)\n (hzpos : 0 < z) (hz : cZ * r ^ 2 \u2264 z)\n (hn : n \u2264 Real.sqrt cW * r ^ 2 * Real.sqrt q) :\n n / z \u2264 (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 \u2264 \u03b5` implies the fifth-power threshold used before Markov's\n inequality. -/\ntheorem p02_lm009_bad_event_threshold\n (r R \u03b5 : \u211d) (hr : 0 < r) (hbad : \u03b5 < r * R ^ 5) :\n \u03b5 / 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 : \u211d) :\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 \u2264 r \u2264 1`. -/\ntheorem p02_lm009_r4_le_r3\n (r : \u211d) (hr0 : 0 \u2264 r) (hr1 : r \u2264 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 \u2264 1`. -/\ntheorem p02_lm009_palm_r4_to_r3\n (p C r : \u211d) (hC : 0 \u2264 C) (hr0 : 0 \u2264 r) (hr1 : r \u2264 1)\n (hp : p \u2264 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 (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) : 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 (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) (A : Set \u03a9)\n (hW : Integrable W \u03bc) (hW0 : 0 \u2264\u1d50[\u03bc] W) (hA : MeasurableSet A) :\n weightedLaw \u03bc W A = (ENNReal.ofReal (\u222b x, W x \u2202\u03bc))\u207b\u00b9 *\n ENNReal.ofReal (\u222b 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 (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d)\n (hW : Integrable W \u03bc) (hW0 : 0 \u2264\u1d50[\u03bc] W)\n (hz : 0 < \u222b x, W x \u2202\u03bc) : 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 (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) (A : Set \u03a9)\n (hW : Integrable W \u03bc) (hW0 : 0 \u2264\u1d50[\u03bc] W) (hA : MeasurableSet A)\n (hz : 0 < \u222b x, W x \u2202\u03bc) :\n (weightedLaw \u03bc W A).toReal = (\u222b x in A, W x \u2202\u03bc) / (\u222b 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 (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) : 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 (\u03bc : Measure \u03a9) (W V : \u03a9 \u2192 \u211d) (h : W =\u1d50[\u03bc] V) :\n weightedLaw \u03bc 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 (\u03bc : Measure \u03a9) :\n weightedLaw \u03bc (fun _ : \u03a9"
+ },
+ {
+ "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 (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] :\n weightedLaw \u03bc (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 (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (W : \u03a9 \u2192 \u211d) (A : Set \u03a9)\n (hW : MemLp W 2 \u03bc) (hW0 : 0 \u2264\u1d50[\u03bc] W) (hA : MeasurableSet A)\n (r cW cZ : \u211d) (hr : 0 < r) (hcW : 0 \u2264 cW) (hcZ : 0 < cZ)\n (hsecond : (\u222b x, W x ^ 2 \u2202\u03bc) \u2264 cW * r ^ 4)\n (hlower : cZ * r ^ 2 \u2264 \u222b x, W x \u2202\u03bc) :\n IsProbabilityMeasure (weightedLaw \u03bc W) \u2227\n (weightedLaw \u03bc W A).toReal \u2264 (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 (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (W : \u03a9 \u2192 \u211d) (A : Set \u03a9)\n (hW : MemLp W 2 \u03bc) (hW0 : 0 \u2264\u1d50[\u03bc] W) (hA : MeasurableSet A)\n (r cW cZ K : \u211d) (hr : 0 < r) (hr1 : r \u2264 1)\n (hcW : 0 \u2264 cW) (hcZ : 0 < cZ) (hK : 0 \u2264 K)\n (hsecond : (\u222b x, W x ^ 2 \u2202\u03bc) \u2264 cW * r ^ 4)\n (hlower : cZ * r ^ 2 \u2264 \u222b x, W x \u2202\u03bc)\n (htail : (\u03bc A).toReal \u2264 K * r ^ 8) :\n IsProbabilityMeasure (weightedLaw \u03bc W) \u2227\n (weightedLaw \u03bc W A).toReal \u2264 ((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 : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "d2Gamma",
+ "line": 17,
+ "source_header": "q\n\nnoncomputable def d2Gamma (m2 m4 q : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "d2DetV",
+ "line": 20,
+ "source_header": "q\n\nnoncomputable def d2DetV (m2 m4 q : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "d2Numerator",
+ "line": 23,
+ "source_header": "q\n\nnoncomputable def d2Numerator (m2 m4 : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "d2Schur",
+ "line": 26,
+ "source_header": ")\n\nnoncomputable def d2Schur (m2 m4 q : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "d2Delta",
+ "line": 32,
+ "source_header": "q\n\nnoncomputable def d2Delta (m2 m4 m6 : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "d2Tau",
+ "line": 34,
+ "source_header": "2\n\nnoncomputable def d2Tau (m2 m4 m6 q : \u211d) :"
+ },
+ {
+ "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 : \u211d) :\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 : \u211d) : 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 : \u211d) :\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 : \u211d) :\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 : \u211d) (hD : d2DetV m2 m4 q \u2260 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 : \u211d) (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 : \u211d) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hq0 : 0 \u2264 q) (hq1 : q \u2264 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 : \u211d) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hq0 : 0 \u2264 q) (hq1 : q \u2264 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 : \u211d) (hq0 : 0 \u2264 q) (hq1 : q \u2264 1 / 4) :\n d2DetV m2 m4 q \u2264\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 : \u211d) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hq0 : 0 \u2264 q) (hq1 : q \u2264 1 / 4) :\n d2Numerator m2 m4 /\n max (m2 ^ 2 * m4) ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4) \u2264\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 : \u211d) (hm2 : m2 \u2260 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 : \u211d) : 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 : \u211d) :\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 : \u211d) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hDelta : 0 < d2Delta m2 m4 m6) (hq0 : 0 \u2264 q) (hq1 : q \u2264 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 : \u211d) :\n d2DetV 1 3 q = 3 \u2227 d2Schur 1 3 q = 8 / 3 \u2227 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 \u2227 d2Schur 1 1 (1 / 4) = 2 \u2227\n d2Numerator 1 1 / d2DetV 1 1 (1 / 4) = 0 \u2227 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 : \u03a9 \u2192 \u211d) (r \u03b5 : \u211d) : 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 (\u03bc : Measure \u03a9) [IsFiniteMeasure \u03bc] (Y : \u03a9 \u2192 \u211d) (A : Set \u03a9)\n (hY : Integrable Y \u03bc) (hY0 : 0 \u2264\u1d50[\u03bc] Y)\n (a : \u211d) (ha : 0 < a) (hsub : A \u2286 {x | a \u2264 Y x}) :\n (\u03bc A).toReal \u2264 (\u222b x, Y x \u2202\u03bc"
+ },
+ {
+ "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 : \u03a9 \u2192 \u211d) (hR : Measurable R) (r \u03b5 : \u211d) :\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 : \u03a9 \u2192 \u211d) (r \u03b5 : \u211d) (hr : 0 < r) (h\u03b5 : 0 < \u03b5) :\n badJetEvent R r \u03b5 \u2286 {x | (\u03b5 / r) ^ 8 \u2264"
+ },
+ {
+ "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 (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (R : \u03a9 \u2192 \u211d)\n (r \u03b5 M : \u211d) (hr : 0 < r) (h\u03b5 : 0 < \u03b5)\n (hRi : Integrable (fun x => R x ^ 40) \u03bc)\n (hMbound : (\u222b x, R x ^ 40 \u2202\u03bc) \u2264 M) :\n (\u03bc (badJetEvent R r \u03b5)).toReal \u2264 (M / \u03b5 ^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "p02_lm009_moment40_weighted_r4",
+ "line": 79,
+ "source_header": "e_of_gt h\u03b5]\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 (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (W R : \u03a9 \u2192 \u211d)\n (hW : MemLp W 2 \u03bc) (hW0 : 0 \u2264\u1d50[\u03bc] W) (hR : Measurable R)\n (r \u03b5 M cW cZ : \u211d) (hr : 0 < r) (h\u03b5 : 0 < \u03b5)\n (hM : 0 \u2264 M) (hcW : 0 \u2264 cW) (hcZ : 0 < cZ)\n (hRi : Integrable (fun x => R x ^ 40) \u03bc)\n (hMbound : (\u222b x, R x ^ 40 \u2202\u03bc) \u2264 M)\n (hsecond : (\u222b x, W x ^ 2 \u2202\u03bc) \u2264 cW * r ^ 4)\n (hlower : cZ * r ^ 2 \u2264 \u222b x, W x \u2202\u03bc) :\n IsProbabilityMeasure (weightedLaw \u03bc W) \u2227\n (weightedLaw \u03bc W (badJetEvent R r \u03b5)).toReal \u2264\n ((Real.sqrt cW / cZ) * Real.sqrt (M / \u03b5"
+ },
+ {
+ "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 \u2264 1. -/\ntheorem p02_lm009_moment40_weighted_r3\n (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (W R : \u03a9 \u2192 \u211d)\n (hW : MemLp W 2 \u03bc) (hW0 : 0 \u2264\u1d50[\u03bc] W) (hR : Measurable R)\n (r \u03b5 M cW cZ : \u211d) (hr : 0 < r) (hr1 : r \u2264 1) (h\u03b5 : 0 < \u03b5)\n (hM : 0 \u2264 M) (hcW : 0 \u2264 cW) (hcZ : 0 < cZ)\n (hRi : Integrable (fun x => R x ^ 40) \u03bc)\n (hMbound : (\u222b x, R x ^ 40 \u2202\u03bc) \u2264 M)\n (hsecond : (\u222b x, W x ^ 2 \u2202\u03bc) \u2264 cW * r ^ 4)\n (hlower : cZ * r ^ 2 \u2264 \u222b x, W x \u2202\u03bc) :\n IsProbabilityMeasure (weightedLaw \u03bc W) \u2227\n (weightedLaw \u03bc W (badJetEvent R r \u03b5)).toReal \u2264\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\u27e9\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 (\u03bc : \u211d \u2192 Measure \u03a9) [\u2200 r, IsProbabilityMeasure (\u03bc r)]\n (W R : \u211d \u2192 \u03a9 \u2192 \u211d) (r0 \u03b5 M cW cZ : \u211d)\n (hr0 : 0 < r0 \u2227 r0 \u2264 1) (h\u03b5 : 0 < \u03b5)\n (hM : 0 \u2264 M) (hcW : 0 \u2264 cW) (hcZ : 0 < cZ)\n (hdata : \u2200 r, 0 < r \u2192 r \u2264 r0 \u2192\n MemLp (W r) 2 (\u03bc r) \u2227 (0 \u2264\u1d50[\u03bc r] W r) \u2227 Measurable (R r) \u2227\n Integrable (fun x => R r x ^ 40) (\u03bc r) \u2227\n (\u222b x, R r x ^ 40 \u2202(\u03bc r)) \u2264 M \u2227\n (\u222b x, W r x ^ 2 \u2202(\u03bc r)) \u2264 cW * r ^ 4 \u2227\n cZ * r ^ 2 \u2264 \u222b x, W r x \u2202(\u03bc r)) :\n \u2203 C : \u211d, 0 \u2264 C \u2227 \u2200 r, 0 < r \u2192 r \u2264 r0 \u2192\n IsProbabilityMeasure (weightedLaw (\u03bc r) (W r)) \u2227\n (weightedLaw (\u03bc r) (W r) (badJetEvent (R r) r \u03b5)).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 (\u03bc : Measure \u03a9) (W V : \u03a9 \u2192 \u211d) (hW : Integrable W \u03bc) (hV : Integrable V \u03bc) :\n |(\u222b x, W x \u2202\u03bc) - (\u222b x, V x \u2202\u03bc)| \u2264 \u222b 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 (\u03bc : Measure \u03a9) (W V : \u03a9 \u2192 \u211d) (A : Set \u03a9)\n (hW : Integrable W \u03bc) (hV : Integrable V \u03bc) :\n |(\u222b x in A, W x \u2202\u03bc) - (\u222b x in A, V x \u2202\u03bc)| \u2264 \u222b 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 (\u03bc : Measure \u03a9) (W V : \u03a9 \u2192 \u211d) (hW : Integrable W \u03bc) (hV : Integrable V \u03bc)\n (c \u03b4 : \u211d) (hreference : c \u2264 \u222b x, V x \u2202\u03bc)\n (herror : (\u222b x, |W x - V x| \u2202\u03bc) \u2264 \u03b4) :\n c - \u03b4 \u2264 \u222b 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 (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) (A : Set \u03a9)\n (hW : Integrable W \u03bc) (hW0 : 0 \u2264\u1d50[\u03bc] W) :\n 0 \u2264 (\u222b x in A, W x \u2202\u03bc) \u2227 (\u222b x in A, W x \u2202\u03bc) \u2264 \u222b"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weightPerturbation_quotient_bound",
+ "line": 54,
+ "source_header": "l hW hW0\u27e9\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 \u03b4 : \u211d) (hz : 0 < z) (ht : 0 < t)\n (ha : 0 \u2264 a) (haz : a \u2264 z) (hab : |a - b| \u2264 \u03b4) (hzt : |z - t| \u2264 \u03b4) :\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 (\u03bc : Measure \u03a9) (W V : \u03a9 \u2192 \u211d) (hW : Integrable W \u03bc) (hV : Integrable V \u03bc)\n (hW0 : 0 \u2264\u1d50[\u03bc] W) (hV0 : 0 \u2264\u1d50[\u03bc] V)\n (c \u03b4 : \u211d) (hc : 0 < c) (hreference : c \u2264 \u222b x, V x \u2202\u03bc)\n (herror : (\u222b x, |W x - V x| \u2202\u03bc) \u2264 \u03b4) (hsmall : \u03b4 \u2264 c / 2) :\n c / 2 \u2264 (\u222b x, W x \u2202\u03bc) \u2227\n IsProbabilityMeasure (weightedLaw \u03bc W) \u2227\n IsProbabilityMeasure (weightedLaw \u03bc V) \u2227\n \u2200 A : Set \u03a9, MeasurableSet A \u2192\n |(weightedLaw \u03bc W A).toReal - (weightedLaw \u03bc V A).toReal"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weightedLaw_event_perturbation_r2",
+ "line": 114,
+ "source_header": "c hreference)\n\n/-- The natural r\u00b2 normalizer and L1-error scales cancel. No r \u2264 1 restriction\nis needed. Uniform application requires uniform c and the displayed budgets. -/\ntheorem weightedLaw_event_perturbation_r2\n (\u03bc : Measure \u03a9) (W V : \u03a9 \u2192 \u211d) (hW : Integrable W \u03bc) (hV : Integrable V \u03bc)\n (hW0 : 0 \u2264\u1d50[\u03bc] W) (hV0 : 0 \u2264\u1d50[\u03bc] V)\n (r c \u03b7 : \u211d) (hr : 0 < r) (hc : 0 < c)\n (hreference : c * r ^ 2 \u2264 \u222b x, V x \u2202\u03bc)\n (herror : (\u222b x, |W x - V x| \u2202\u03bc) \u2264 \u03b7 * r ^ 2) (hsmall : \u03b7 \u2264 c / 2) :\n (c * r ^ 2) / 2 \u2264 (\u222b x, W x \u2202\u03bc) \u2227\n IsProbabilityMeasure (weightedLaw \u03bc W) \u2227\n IsProbabilityMeasure (weightedLaw \u03bc V) \u2227\n \u2200 A : Set \u03a9, MeasurableSet A \u2192\n |(weightedLaw \u03bc W A).toReal - (weightedLaw \u03bc 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 (\u03bc : Measure \u03a9) (f g : \u03a9 \u2192 \u211d)\n (hf : MemLp f 2 \u03bc) (hg : MemLp g 2 \u03bc)\n (hf0 : 0 \u2264\u1d50[\u03bc] f) (hg0 : 0 \u2264\u1d50[\u03bc] g) :\n (\u222b x, f x * g x \u2202\u03bc) \u2264\n Real.sqrt (\u222b x, f x ^ 2 \u2202\u03bc) * Real.sqrt (\u222b 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 \u03bc; no independence assumption is used. -/\ntheorem p02_lm008_event_cs\n (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (W : \u03a9 \u2192 \u211d) (A : Set \u03a9)\n (hW : MemLp W 2 \u03bc) (hW0 : 0 \u2264\u1d50[\u03bc] W) (hA : MeasurableSet A) :\n (\u222b x in A, W x \u2202\u03bc) \u2264\n Real.sqrt (\u222b x, W x ^ 2 \u2202\u03bc) * Real.sqrt ((\u03bc 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 (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (W : \u03a9 \u2192 \u211d) (A : Set \u03a9)\n (hW : MemLp W 2 \u03bc) (hW0 : 0 \u2264\u1d50[\u03bc] W) (hA : MeasurableSet A)\n (r cW : \u211d) (hcW : 0 \u2264 cW)\n (hsecond : (\u222b x, W x ^ 2 \u2202\u03bc) \u2264 cW * r ^ 4) :\n (\u222b x in A, W x \u2202\u03bc) \u2264 Real.sqrt cW * r ^ 2 * Real.sqrt ((\u03bc 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 (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (W : \u03a9 \u2192 \u211d) (A : Set \u03a9)\n (hW : MemLp W 2 \u03bc) (hW0 : 0 \u2264\u1d50[\u03bc] W) (hA : MeasurableSet A)\n (r cW cZ : \u211d) (hr : 0 < r) (hcW : 0 \u2264 cW) (hcZ : 0 < cZ)\n (hsecond : (\u222b x, W x ^ 2 \u2202\u03bc) \u2264 cW * r ^ 4)\n (hlower : cZ * r ^ 2 \u2264 \u222b x, W x \u2202\u03bc) :\n (\u222b x in A, W x \u2202\u03bc) / (\u222b x, W x \u2202\u03bc) \u2264\n (Real.sqrt cW / cZ) * Real.sqrt ((\u03bc 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 \u2264 1. Uniformity in r and the input tail remain unproved here. -/\ntheorem p02_lm009_measure_transfer_r8_to_r3\n (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (W : \u03a9 \u2192 \u211d) (A : Set \u03a9)\n (hW : MemLp W 2 \u03bc) (hW0 : 0 \u2264\u1d50[\u03bc] W) (hA : MeasurableSet A)\n (r cW cZ K : \u211d) (hr : 0 < r) (hr1 : r \u2264 1)\n (hcW : 0 \u2264 cW) (hcZ : 0 < cZ) (hK : 0 \u2264 K)\n (hsecond : (\u222b x, W x ^ 2 \u2202\u03bc) \u2264 cW * r ^ 4)\n (hlower : cZ * r ^ 2 \u2264 \u222b x, W x \u2202\u03bc)\n (htail : (\u03bc A).toReal \u2264 K * r ^ 8) :\n (\u222b x in A, W x \u2202\u03bc) / (\u222b x, W x \u2202\u03bc) \u2264\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 : \u211d) = Real.sqrt 4 * Real.sqrt (1 / 4 : \u211d) \u2227\n \u00ac (1 : \u211d) \u2264 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 : \u211d) \u2264 2 * 1 ^ 2 \u2227\n (1 : \u211d) / 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 (\u03bc : Measure \u03a9) [IsFiniteMeasure \u03bc] (R : \u03a9 \u2192 \u211d)\n (r \u03b5 M : \u211d) (hr : 0 < r) (h\u03b5 : 0 < \u03b5)\n (hRi : Integrable (fun x => R x ^ 40) \u03bc)\n (hMbound : (\u222b x, R x ^ 40 \u2202\u03bc) \u2264 M) :\n (\u03bc (badJetEvent R r \u03b5)).toReal \u2264 (M / \u03b5 ^ 8) * r"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "p02_lm009_moment40_tail_of_finite",
+ "line": 41,
+ "source_header": "h\u03b5]\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 (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (R : \u03a9 \u2192 \u211d)\n (r \u03b5 M : \u211d) (hr : 0 < r) (h\u03b5 : 0 < \u03b5)\n (hRi : Integrable (fun x => R x ^ 40) \u03bc)\n (hMbound : (\u222b x, R x ^ 40 \u2202\u03bc) \u2264 M) :\n (\u03bc (badJetEvent R r \u03b5)).toReal \u2264 (M / \u03b5 ^ 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 \u2264 r0. No probability assumption is made outside that interval. -/\ntheorem p02_lm009_moment40_family_r3_interval\n (\u03bc : \u211d \u2192 Measure \u03a9)\n (W R : \u211d \u2192 \u03a9 \u2192 \u211d) (r0 \u03b5 M cW cZ : \u211d)\n (hr0 : 0 < r0 \u2227 r0 \u2264 1) (h\u03b5 : 0 < \u03b5)\n (hM : 0 \u2264 M) (hcW : 0 \u2264 cW) (hcZ : 0 < cZ)\n (hdata : \u2200 r, 0 < r \u2192 r \u2264 r0 \u2192\n IsProbabilityMeasure (\u03bc r) \u2227\n MemLp (W r) 2 (\u03bc r) \u2227 (0 \u2264\u1d50[\u03bc r] W r) \u2227 Measurable (R r) \u2227\n Integrable (fun x => R r x ^ 40) (\u03bc r) \u2227\n (\u222b x, R r x ^ 40 \u2202(\u03bc r)) \u2264 M \u2227\n (\u222b x, W r x ^ 2 \u2202(\u03bc r)) \u2264 cW * r ^ 4 \u2227\n cZ * r ^ 2 \u2264 \u222b x, W r x \u2202(\u03bc r)) :\n \u2203 C : \u211d, 0 \u2264 C \u2227 \u2200 r, 0 < r \u2192 r \u2264 r0 \u2192\n IsProbabilityMeasure (weightedLaw (\u03bc r) (W r)) \u2227\n (weightedLaw (\u03bc r) (W r) (badJetEvent (R r) r \u03b5)).toReal \u2264 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 (\u03bc : \u211d \u2192 Measure \u03a9) [\u2200 r, IsProbabilityMeasure (\u03bc r)]\n (W R : \u211d \u2192 \u03a9 \u2192 \u211d) (r0 \u03b5 M cW cZ : \u211d)\n (hr0 : 0 < r0 \u2227 r0 \u2264 1) (h\u03b5 : 0 < \u03b5)\n (hM : 0 \u2264 M) (hcW : 0 \u2264 cW) (hcZ : 0 < cZ)\n (hdata : \u2200 r, 0 < r \u2192 r \u2264 r0 \u2192\n MemLp (W r) 2 (\u03bc r) \u2227 (0 \u2264\u1d50[\u03bc r] W r) \u2227 Measurable (R r) \u2227\n Integrable (fun x => R r x ^ 40) (\u03bc r) \u2227\n (\u222b x, R r x ^ 40 \u2202(\u03bc r)) \u2264 M \u2227\n (\u222b x, W r x ^ 2 \u2202(\u03bc r)) \u2264 cW * r ^ 4 \u2227\n cZ * r ^ 2 \u2264 \u222b x, W r x \u2202(\u03bc r)) :\n \u2203 C : \u211d, 0 \u2264 C \u2227 \u2200 r, 0 < r \u2192 r \u2264 r0 \u2192\n IsProbabilityMeasure (weightedLaw (\u03bc r) (W r)) \u2227\n (weightedLaw (\u03bc r) (W r) (badJetEvent (R r) r \u03b5)).toReal \u2264"
+ }
+ ]
+ },
+ {
+ "path": "formal/ResearchFormalCoreR1/AlgebraV2.lean",
+ "sha256": "4480708263c40a2f7f03f12ef7e15f0eb4f8193c2dccbb253921a7ec251863c3",
+ "declarations_lexical": [
+ {
+ "kind": "def",
+ "unqualified_name": "foldPotential",
+ "line": 6,
+ "source_header": "/-- Canonical A\u2082 normal-form potential, parameterized by `s` with \u03bb = s\u00b2. -/\nnoncomputable def foldPotential (s x : \u211d) :"
+ },
+ {
+ "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 : \u211d) :\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 : \u211d) :\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 (\u03b1 K c \u03b7 : \u211d) :\n (K + 8 * \u03b1 * c * \u03b7) ^ 2 + 64 * \u03b1 * (1 - \u03b1) * c ^ 2 * \u03b7 ^ 2 =\n (1 - \u03b1) * K ^ 2 + \u03b1 * (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 (\u03b1 a \u03b7 : \u211d) :\n (a + (1 - 2 * \u03b1) * \u03b7) ^ 2 + 4 * \u03b1 * (1 - \u03b1) * \u03b7 ^ 2 =\n (1 - \u03b1) * (a + \u03b7) ^ 2 + \u03b1 * (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 : \u211d) :\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 : \u211d) (hr : r \u2260 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."
+ ]
+ },
+ {
+ "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 : \u211d) : 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 : \u211d) : 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 : \u211d} (ht : \u00ac 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 : \u211d) {s t : \u211d} (hst : s \u2264 t) :\n elderFiber k m d s \u2192\u2097[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 : \u211d) : \u211d \u2964 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 : \u211d} (ht : elderActive m d t) :\n k \u2192\u2097[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 : \u211d} (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 : \u211d) : \u00ac elderAc"
+ },
+ {
+ "kind": "structure",
+ "unqualified_name": "ElderTrap",
+ "line": 100,
+ "source_header": "X) (m d : \u211d)\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 \u2208 D\n older_outside : P \u2209 D\n height_ceiling : \u2200 x \u2208 D, g x \u2264 m\n active_clopen : \u2200 t, elderActive m d t \u2192\n IsClopen {x : superlevel_set g t | x.val \u2208 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 : \u211d}\n (ht : elderActive m d t) : M \u2208 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 : \u211d}\n (ht : elderActive m d t) : P \u2208 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\u27e9\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 : \u211d}\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 : \u211d}\n (ht : elderActive m d t) :\n ModuleCat.of k k \u27f6 (superlevel_h0Filtration g (Mod"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elderDifference_map",
+ "line": 159,
+ "source_header": "\u27e8P, T.older_mem ht\u27e9\n\ntheorem elderDifference_map (T : ElderTrap g M P m d D) {s t : \u211d}\n (hs : elderActive m d s) (ht : elderActive m d t) (hst : s \u2264 t) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elderDifference_map_dead",
+ "line": 168,
+ "source_header": "\u27e9 \u27e8P, T.older_mem hs\u27e9\n\ntheorem elderDifference_map_dead (T : ElderTrap g M P m d D) {s t : \u211d}\n (hs : elderActive m d s) (ht : -d \u2264 t) (hst : s \u2264 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 : \u211d}\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 \ud835\udfd9 _ else 0)\n\ntheorem elderProjection_point (T : ElderTrap g M P m d D) {t : \u211d}\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 \u226b"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elderDifference_projection",
+ "line": 198,
+ "source_header": "igma.\u03b9_comp_desc]\n rfl\n\ntheorem elderDifference_projection (T : ElderTrap g M P m d D) {t : \u211d}\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 : \u211d) :\n (elderInterval k m d).obj t \u27f6\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 : \u211d) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).obj t \u27f6\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 : \u211d}\n (hst : s \u2264 t) :\n (elderInterval k m d).map (homOfLE hst) \u226b elderSectionApp T t =\n elderSectionApp T s \u226b\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 \u27f6 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 : \u211d}\n (hs : elderActive m d s) (ht : elderActive m d t) (hst : s \u2264 t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) \u226b"
+ },
+ {
+ "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 : \u211d}\n (hs : s < -m) (ht : elderActive m d t) (hst : s \u2264 t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) \u226b"
+ },
+ {
+ "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 : \u211d}\n (hst : s \u2264 t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) \u226b\n elderRetractionApp T t =\n elderRetractionApp T s \u226b (elderInterv"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "elderRetraction",
+ "line": 328,
+ "source_header": "simp [htd]\n \u00b7 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) \u27f6 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 \u21a6 (qv,v-jqv) and (c,w) \u21a6 jc+w. -/\ndef elderDirectSummand (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k k) \u2245\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 : \u211d) (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 \u2208 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 \u2209 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 \u2192 \u211d) (D : Set X) (d t : \u211d)\n (htrace : IsClopen (elderTrap_strictTrace g D d)) (ht : t < -d) :\n IsClopen {x : superlevel_set g t | x.val \u2208"
+ },
+ {
+ "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 \u2192 \u211d) (D : Set X) (m d : \u211d) (M P : X)\n (hD : IsClosed D) (hboundary : \u2200 x \u2208 frontier D, g x \u2264 d)\n (hdm : d < m) (hMheight : g M = m) (hM : M \u2208 D)\n (hheight : \u2200 x \u2208 D, g x \u2264 m) (hP : m < g P)\n (\u03b3 : Path M P) (h\u03b3 : \u2200 t : unitInterval, d \u2264 g (\u03b3 t)) :\n ElderTrap g M P m d D where\n death_lt_"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "elderBoundaryDirectSummand",
+ "line": 52,
+ "source_header": "h\u03b3 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 \u2192 \u211d) (D : Set X) (m d : \u211d) (M P : X)\n (hD : IsClosed D) (hboundary : \u2200 x \u2208 frontier D, g x \u2264 d)\n (hdm : d < m) (hMheight : g M = m) (hM : M \u2208 D)\n (hheight : \u2200 x \u2208 D, g x \u2264 m) (hP : m < g P)\n (\u03b3 : Path M P) (h\u03b3 : \u2200 t : unitInterval, d \u2264 g (\u03b3 t)) :\n superlevel_h0Filtration g (ModuleCat.of k k) \u2245\n elderInterval k m d \u229e kernel (elderRetrac"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elderBoundary_death_eq",
+ "line": 67,
+ "source_header": "P \u03b3 h\u03b3)\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 : \u2115}\n (g : superlevelBar_E n \u2192 \u211d) (hg : Continuous g)\n (D : Set (superlevelBar_E n)) (m d : \u211d) (M P : superlevelBar_E n)\n (hD : IsClosed D) (hboundary : \u2200 x \u2208 frontier D, g x \u2264 d)\n (hMheight : g M = m) (hM : M \u2208 D)\n (hheight : \u2200 x \u2208 D, g x \u2264 m) (hP : m < g P)\n (\u03b3 : Path M P) (h\u03b3 : \u2200 t : unitInterval, d \u2264 g (\u03b3 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 \u2192 \u211d) (D : Set X) (d : \u211d) :\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 \u2192 \u211d) (D : Set X) (d : \u211d) (hD : IsClosed D)\n (hboundary : \u2200 x \u2208 frontier D, g x \u2264 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 \u2192 \u211d) (D : Set X) (d : \u211d)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n {M y : X} (hM : M \u2208 D) (\u03b3 : Path M y)\n (h\u03b3 : \u2200 t : unitInterval, d < g (\u03b3 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 \u2192 \u211d) (D : Set X) (d : \u211d)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : X) (hM : M \u2208 D) (hheight : \u2200 x \u2208 D, g x \u2264 g M)\n {y : X} (hy : g M < g y) (\u03b3 : Path M y) :\n \u2203 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 : \u2115}\n (g : superlevelBar_E n \u2192 \u211d) (D : Set (superlevelBar_E n)) (d : \u211d)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : superlevelBar_E n) (hM : M \u2208 D)\n (hheight : \u2200 x \u2208 D, g x \u2264 g M)\n (P : superlevelBar_E n) (hP : g M < g P) (\u03b3 : Path M P)\n (h\u03b3 : \u2200 t : unitInterval, d \u2264 g (\u03b3 t)) :\n superlevelBar_clearanceSet g M"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elderTrap_death_eq",
+ "line": 98,
+ "source_header": "hh (h\u03b3 t)\u27e9\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 : \u2115}\n (g : superlevelBar_E n \u2192 \u211d) (hg : Continuous g)\n (D : Set (superlevelBar_E n)) (d : \u211d)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : superlevelBar_E n) (hM : M \u2208 D)\n (hheight : \u2200 x \u2208 D, g x \u2264 g M)\n (P : superlevelBar_E n) (hP : g M < g P) (\u03b3 : Path M P)\n (h\u03b3 : \u2200 t : unitInterval, d \u2264 g (\u03b3 t)) :\n superlevelBar_deathH"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elderTrap_closed_path_attains",
+ "line": 116,
+ "source_header": "P \u03b3 h\u03b3]\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 \u2192 \u211d) (D : Set X) (d : \u211d)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : X) (hM : M \u2208 D) (hheight : \u2200 x \u2208 D, g x \u2264 g M)\n {P : X} (hP : g M < g P) (\u03b3 : Path M P)\n (h\u03b3 : \u2200 t : unitInterval, d \u2264 g (\u03b3 t)) :\n \u2203 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."
+ ]
+ },
+ {
+ "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} (\u03b3 : Path x y) (hx : x \u2208 C) (hy : y \u2209 C) :\n \u2203 t : I, \u03b3 t \u2208 front"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "preconnected_subset_of_frontier_disjoint",
+ "line": 69,
+ "source_header": "C ht\u27e9\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 \u2208 K) (hMC : M \u2208 C) (hfr : \u2200 x \u2208 K, x \u2209 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)\u2013(C3) for a local maximum `M` of height `b`, a separating level `s`,\nand an older point `z`. -/\nstructure CapHyp (f : X \u2192 \u211d) (C : Set X) (M z : X) (b s : \u211d) : Prop where\n /-- (C1) `M` lies in the cap. -/\n mem : M \u2208 C\n /-- (C1) The ceiling: `f \u2264 b` on the cap (L16). -/\n ceiling : \u2200 x \u2208 C, f x \u2264 b\n /-- (C2) The frontier bound: `f \u2264 s` on the frontier of the cap (L17\u2013L19). -/\n frontier_le : \u2200 x \u2208 frontier C, f x \u2264 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 \u2265 s` (L20). -/\n ridge : \u2203 \u03b3 : Path"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "s_le_f_M",
+ "line": 104,
+ "source_header": "} {M z : X} {b s : \u211d}\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\u03b3 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) (\u03b3 : Path M w)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "connectionLevels",
+ "line": 121,
+ "source_header": "ontier_le _ ht\u27e9\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 : \u211d}\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 \u03b3\n exact (h\u03b3 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 : \u2200 x \u2208 frontier C, x \u2209 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} (\u03b3 : Path M z) (h\u03b3 : \u2200 t, \u03b3 t"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elder_merge_iff_closed",
+ "line": 173,
+ "source_header": "X \u2192 \u211d} {C : Set X} {M z : X} {b s : \u211d}\n\n/-- **Elder merge, closed superlevel filtration `{f \u2265 h}`** (the filtration of L22). The connected\ncomponent of `M` in `{f \u2265 h}` contains a point strictly above `b` if and only if `h \u2264 s`. -/\ntheorem elder_merge_iff_closed (H : CapHyp f C M z b s) (h : \u211d) :\n (\u2203 w \u2208 connectedComp"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elder_merge_iff_open",
+ "line": 191,
+ "source_header": "(fun t => le_trans hhs (h\u03b3\u2080 t)), H.older\u27e9\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 : \u211d) :\n (\u2203 w \u2208 connectedCo"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "joinedLevels",
+ "line": 209,
+ "source_header": "t => lt_of_lt_of_le hhs (h\u03b3\u2080 t)), H.older\u27e9\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 \u2264 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\u27e9\n\n/-! ### The merging saddle -/\n\n/-- Every path from `M` to a point strictly above `b` that stays in `{f \u2265 s}` passes through `S`,\nwhen `S` is the only frontier point at height `s` (C2\u207a, L19). The statement says something only when\n`M \u2260 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 : \u2200 x \u2208 frontier C, x \u2260 S \u2192 f x < s) {w : X} (hw : b < f w) (\u03b3 : P"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "saddle_cut",
+ "line": 235,
+ "source_header": "have h1 := hS _ ht hne\n have h2 := h\u03b3 t\n linarith\n\n/-- **`S` is a cut point at the death level.** Assume (C2\u207a) and `M \u2260 S`. Then `M` lies in its own\ncomponent of `{f \u2265 s} \\ {S}`, so the statement is not vacuous, and that component contains no\npoint strictly above `b`. By contrast, `{f \u2265 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 : \u2200 x \u2208 frontier C, x \u2260 S \u2192 f x < s) (hMS : M \u2260 S) :\n M \u2208 connectedComponentIn ({x | s \u2264 f x} \\ {S}) M \u2227\n \u2200 w \u2208"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "congr",
+ "line": 251,
+ "source_header": "h3 := hS x hx h2\n have h4 : s \u2264 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 \u2192 \u211d} (H : CapHyp f C M z b s) (\u03b3\u2080 : Path M z) (h\u03b3\u2080 : \u2200 t, s \u2264 f (\u03b3\u2080 t))\n (hgC : \u2200 x \u2208 closure C, g x = f x) (hg\u03b3 : \u2200 t,"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "isClosed_connectedComponentIn",
+ "line": 272,
+ "source_header": "ridge := \u27e8\u03b3\u2080, fun t => (hg\u03b3 t).symm \u25b8 h\u03b3\u2080 t\u27e9\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 \u2192 \u211d} {C : Set X} {M z : X} {b s : \u211d}\n\n/-- **An older peak below the death level.** For every level `h \u2264 s`, the component of `M` in\n`{f \u2265 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 : \u211d} (hh : h \u2264 s) :\n \u2203 p \u2208 connectedComponentIn {x | h \u2264 f x} M, b < f p \u2227 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 \u2265 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 : \u211d} (hh : s"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "olderPeakLevels",
+ "line": 329,
+ "source_header": "rd ((H.elder_merge_iff_closed h).mp \u27e8w, hw, hlt\u27e9) (not_le.mpr hh)\n\n/-- The levels at which the component of `M` in `{f \u2265 h}` contains a strictly higher local"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elder_death_level_peak",
+ "line": 334,
+ "source_header": "\u2208 connectedComponentIn {x | h \u2264 f x} M, f M < f p \u2227 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 \u27e8p, hpK, hMb \u25b8 hMp\u27e9\n\nend CapHyp\n\n/-! ### Charts: the cap on the torus and its faces\n\nThe analysis of CAP \u00a7\u00a72\u20135 runs in Euclidean coordinates on the periodic lift `f \u2218 e` of a field\n`f` on the torus, where `e : \u211d^d \u2192 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 \u2192 X}\n (hec : Continuous e) (heo : IsOpenMap e)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "map",
+ "line": 372,
+ "source_header": "interior_subset) (heo _ isOpen_interior) \u27e8y, hyi, rfl\u27e9\n\nnamespace CapHyp\n\n/-- **Transport along a chart.** The cap hypotheses for the lift `f \u2218 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 \u2192 X} (hec : Continuous e)\n (heo : IsOpenMap e) {f : X \u2192 \u211d} {C : Set Y} (hC : IsCompact C) {M z : Y} {b s : \u211d}\n (H"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "map_saddle",
+ "line": 390,
+ "source_header": "ge := by\n obtain \u27e8\u03b3, h\u03b3\u27e9 := H.ridge\n exact \u27e8\u03b3.map hec, fun t => h\u03b3 t\u27e9\n\n/-- Transport of (C2\u207a): 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 \u2192 X} (hec : Continuous e)\n (heo : IsOpenMap e) {f : X \u2192 \u211d} {C : Set Y} (hC : IsCompact C) {S : Y} {s : \u211d}\n (hS : \u2200 y \u2208 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 \u25b8 rfl))\n\nend CapHyp\n\n/-- **The faces of the cylinder cap** `[a, c] \u00d7 B\u0304(0, R)`: the two end faces `{a, c} \u00d7 B\u0304(0, R)`\nand the curved side `[a, c] \u00d7 S(0, R)`. These are the faces estimated in L17\u2013L19. -/\ntheorem frontier_cylinder {E : Type*} [NormedAddCommGroup E] [NormedSpace \u211d E] {a c R : \u211d}\n (hac : a \u2264 c) (hR : R \u2260 0) :\n frontier (Icc a c \u00d7\u02e2 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 \u211d E] [Pr"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torusCover",
+ "line": 417,
+ "source_header": "\u02e2 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 \u2192 \u211d) \u2192 (Fin d \u2192 AddCircle L) :=\n Pi.map fun _ => ((\u2191) : \u211d \u2192 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 `\u03c6` be any coordinate frame (a homeomorphism onto `\u211d^d`), and\nsuppose the periodic lift `f \u2218 torusCover L d \u2218 \u03c6` satisfies the cap hypotheses on a compact cap\n`C`. Then `f` satisfies them on the image of `C` in the torus `(\u211d / L\u2124)^d`, with the same `b` and\n`s`. No embedding radius is used. -/\ntheorem CapHyp.toTorus {Y : Type*} [TopologicalSpace Y] {L : \u211d} {d : \u2115}\n (\u03c6 : Y \u2243\u209c (Fin d \u2192 \u211d)) {f : (Fin d \u2192 AddCircle L) \u2192 \u211d} {C : Set Y} (hC : IsCompact C)\n {M z : Y} {b s : \u211d} (H : CapHyp (f \u2218 (torusCover L d \u2218 \u03c6)) C M z b s) :\n C"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "convex_zeros_between",
+ "line": 461,
+ "source_header": "x = x\u00b3/24 - r\u00b2x/32`;\n- L19: the face assembly;\n- L20: the ridge path. -/\n\nsection Ridge\n\n/-- A convex function that vanishes at `a \u2264 c` is `\u2264 0` between them. -/\ntheorem convex_zeros_between {\u03c6 : \u211d \u2192 \u211d} {D : Set \u211d} (h\u03c6 : ConvexOn \u211d D \u03c6) {a c : \u211d}\n (haD : a \u2208 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 `\u2265 0` to the right of `c`. -/\ntheorem convex_zeros_right {\u03c6 : \u211d \u2192 \u211d} {D : Set \u211d} (h\u03c6 : ConvexOn \u211d D \u03c6) {a c : \u211d}\n (haD : a \u2208 D) ("
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "convex_zeros_left",
+ "line": 479,
+ "source_header": "zero_div, sub_zero] at h\n rw [le_div_iff\u2080 (sub_pos.mpr hlt), zero_mul] at h\n exact h\n\n/-- A convex function that vanishes at `a < c` is `\u2265 0` to the left of `a`. -/\ntheorem convex_zeros_left {\u03c6 : \u211d \u2192 \u211d} {D : Set \u211d} (h\u03c6 : ConvexOn \u211d D \u03c6) {a c : \u211d}\n (hcD : c \u2208 D)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridge_profile",
+ "line": 490,
+ "source_header": ", zero_div, zero_sub] at h\n rw [div_le_iff\u2080 (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 `\u2213r/2` and `F - (x + r/2)(x - r/2)/8` convex. Then:\n- `g \u2264 g(-r/2)` on `[-2r, r/2]`;\n- `g \u2265 g(r/2)` on `[-r/2, 2r]`;\n- `g(-2r) \u2264 g(-r/2) - 9r\u00b3/32`;\n- `g(2r) \u2265 g(r/2) + 9r\u00b3/32`. -/\ntheorem ridge_profile {g F : \u211d \u2192 \u211d} {r : \u211d} (hr : 0 < r)\n (hg : \u2200 x \u2208 Icc (-2 * r) (2 * r), HasDerivAt g (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn \u211d (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8)) :\n (\u2200 x \u2208 Icc (-2 * r) (r / 2), g x \u2264 g (-r / 2)) \u2227\n (\u2200 x \u2208 Icc (-r / 2) (2 * r), g (r / 2) \u2264"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridge_capHyp",
+ "line": 598,
+ "source_header": "y [hQdef] at h\n nlinarith [h]\n\nvariable {E : Type*} [NormedAddCommGroup E] [NormedSpace \u211d E]\n\n/-- **The cap hypotheses from the ridge (L16, L17, L19, L20).** Under the analytic inputs listed\nabove, `f` satisfies (C1)\u2013(C3) on `C = [-2r, r/2] \u00d7 B\u0304(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 : \u211d \u00d7 E \u2192 \u211d} {h : \u211d \u2192 E} {F : \u211d \u2192 \u211d} {r : \u211d} (hr : 0 < r)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : \u2200 x \u2208 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 \u211d (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hT : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), f p \u2264 f (p.1, h p.1))\n (hside : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.sphere (0 : E) (2 * r),\n f p \u2264 f (r / 2, h (r / 2)))\n (hM : \u2016h (-r / 2)\u2016 \u2264 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) \u00d7\u02e2 Metric.closedBall (0 : E) (2 *"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridge_saddle_strict",
+ "line": 656,
+ "source_header": "exact h0\n \u00b7 exact hside p hp\n \u00b7 linarith\n \u00b7 intro t\n exact hfloor (xt t) (hxmem t)\n\n/-- **(C2\u207a) 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 : \u211d \u00d7 E \u2192 \u211d} {h : \u211d \u2192 E} {F : \u211d \u2192 \u211d} {r : \u211d} (hr : 0 < r)\n (hg : \u2200 x \u2208 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 \u211d (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hT : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), f p \u2264 f (p.1, h p.1))\n (hTs : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), p.2 \u2260 h p.1 \u2192\n f p < f (p.1, h p.1))\n (hside : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 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 \u2200 x \u2208 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 \u211d E]\n\n/-- **Strong concavity about a point with a derivative (the engine of L7, L8, L18).** If `\u03c6` is\n`\u03b4`-strongly concave on `K`, `p \u2208 K`, and `\u03c6` has derivative `L` at `p`, then\n`\u03c6 y \u2264 \u03c6 p + L (y - p) - (\u03b4/2)\u2016y - p\u2016\u00b2` for every `y \u2208 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} {\u03c6 : E \u2192 \u211d} {\u03b4 : \u211d} {p : E}\n {L : E \u2192L[\u211d] \u211d} (h\u03c6 : StrongConcaveOn K \u03b4 \u03c6) (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 `\u03b4`-strongly concave slice,\n`\u03c6 y \u2264 \u03c6 p - (\u03b4/2)\u2016y - p\u2016\u00b2` on `K`. With `\u03b4 > 0` the maximizer is unique. -/\ntheorem slice_le {K : Set E} {\u03c6 : E \u2192 \u211d} {\u03b4 : \u211d} {p : E}\n (h\u03c6 : StrongConcaveOn K \u03b4 \u03c6) (hp :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "slice_ridge_bound",
+ "line": 751,
+ "source_header": "y \u2208 K) : \u03c6 y \u2264 \u03c6 p - \u03b4 / 2 * \u2016y - p\u2016 ^ 2 := by\n simpa using strongConcave_le_of_hasFDerivAt h\u03c6 hp hd hy\n\n/-- **L8 (the ridge bound).** If `0, p \u2208 K`, `p` is critical and `w` is the derivative at `0`,\nthen `\u03b4 \u2016p\u2016 \u2264 \u2016w\u2016`, i.e. `\u2016h(x)\u2016 \u2264 \u2016w(x)\u2016/\u03b4`. -/\ntheorem slice_ridge_bound {K : Set E} {\u03c6 : E \u2192 \u211d} {\u03b4 : \u211d} {p : E} {w : E \u2192L[\u211d] \u211d}\n (h\u03c6 : StrongConcaveOn K \u03b4 \u03c6) (h0 : (0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "slice_curved",
+ "line": 766,
+ "source_header": "eg p).eq_or_lt with h | h\n \u00b7 rw [\u2190 h, mul_zero]; exact norm_nonneg w\n \u00b7 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 `\u03c6 p \u2264 b`, `\u2016w\u2016 \u2264 \u03c9 \u2264 R\u03b4` and `2\u03b4(b - s) < (R\u03b4 - \u03c9)\u00b2`. -/\ntheorem slice_curved {\u03c6 : E \u2192 \u211d} {\u03b4 \u03c9 R b s : \u211d} {p : E} {w : E \u2192L[\u211d] \u211d}\n (h\u03c6 : StrongConcaveOn (Metric.closedBall (0 : E) R) \u03b4 \u03c6) (h\u03b4 : 0 < \u03b4)\n (hp : p \u2208 Metric.closedBall (0 : E) R) (hd : HasFDerivAt \u03c6 (0 : E \u2192L[\u211d] \u211d) p)\n (hw : HasFDerivAt \u03c6 w 0) (h\u03c9 : \u2016w\u2016 \u2264 \u03c9) (h\u03c9R : \u03c9 \u2264 R * \u03b4) (hb : \u03c6 p"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "slice_hasFDerivAt",
+ "line": 786,
+ "source_header": "\u2016 ^ 2) := by nlinarith\n have h6 : 2 * (b - s) < \u03b4 * \u2016y - p\u2016 ^ 2 := lt_of_mul_lt_mul_left h5 h\u03b4.le\n linarith\n\n/-- The derivative of a slice `y \u21a6 f (x, y)` is the joint derivative restricted to the\ntransverse directions. -/\ntheorem slice_hasFDerivAt {f : \u211d \u00d7 E \u2192 \u211d} {x : \u211d} {y : E} {D : \u211d \u00d7 E \u2192L[\u211d] \u211d}\n ("
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridge_hasDerivAt",
+ "line": 793,
+ "source_header": "(fun y' => f (x, y')) (D.comp (ContinuousLinearMap.inr \u211d \u211d 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`\u2202_y f = 0`), then `g = f (\u00b7, h \u00b7)` has derivative `F x = D (1, 0) = \u2202_x f (x, h x)`: the\n`\u2202_y f \u00b7 h'` term drops out. -/\ntheorem ridge_hasDerivAt {f : \u211d \u00d7 E \u2192 \u211d} {h : \u211d \u2192 E} {x : \u211d} {D : \u211d \u00d7 E \u2192L[\u211d] \u211d} {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 [\u2190 hD]\n exact hc\n\n/-- **(C1)\u2013(C3) and (C2\u207a) 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 \u2208 B\u0304(0, 2r)` (`hball`, `hcrit`; L7's existence part), L5 (`hw`, `h\u03c9`) and the curvature\ncondition `2\u03b4(b - s) < (2r\u03b4 - \u03c9)\u00b2`, which SP's constants satisfy (`sp_curved_side_constants`). -/\ntheorem ridge_capHyp_of_slices {f : \u211d \u00d7 E \u2192 \u211d} {h : \u211d \u2192 E} {F : \u211d \u2192 \u211d} {w : \u211d \u2192 E \u2192L[\u211d] \u211d}\n {r \u03b4 \u03c9 : \u211d} (hr : 0 < r) (h\u03b4 : 0 < \u03b4)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : \u2200 x \u2208 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 \u211d (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hconc : \u2200 x \u2208 Icc (-2 * r) (r / 2),\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) \u03b4 (fun y => f (x, y)))\n (hball : \u2200 x \u2208 Icc (-2 * r) (r / 2), h x \u2208 Metric.closedBall (0 : E) (2 * r))\n (hcrit : \u2200 x \u2208 Icc (-2 * r) (r / 2),\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x))\n (hw : \u2200 x \u2208 Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))\n (h\u03c9 : \u2200 x \u2208 Icc (-2 * r) (r / 2), \u2016w x\u2016 \u2264 \u03c9) (h\u03c9r : \u03c9 \u2264 2 * r * \u03b4)\n (hcurv : 2 * \u03b4 * (f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2))) < (2 * r * \u03b4 - \u03c9) ^ 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) \u00d7\u02e2 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))) \u2227\n \u2200 x \u2208 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\u27e9\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) \u2218 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 : \u211d \u00d7 E \u2192 \u211d} {h h' : \u211d \u2192 E} {D : \u211d \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {r : \u211d}\n (hr : 0 < r) (hD : \u2200 x \u2208 Icc (-2 * r) (2 * r), HasFDerivAt f (D x) (x, h x))\n (hh' : \u2200 x \u2208 Icc (-2 * r) (2 * r), HasDerivAt h (h' x) x)\n (hridge : \u2200 x \u2208 Icc (-2 * r) (2 * r), (D x).comp (ContinuousLinearMap.inr \u211d \u211d E) = 0) :\n ContinuousOn h (Icc (-r / 2) (2 * r)) \u2227\n (\u2200 x \u2208 Icc (-2 * r) (2 * r), HasDerivAt (fun x =>"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sp_curved_side_constants",
+ "line": 877,
+ "source_header": ": x \u2208 Icc (-2 * r) (2 * r) := \u27e8hx.1, by linarith [hx.2]\u27e9\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 \u2265 2`,\n`\u03b4 > r m (8m - 5)` (L4, `k = 8m - 5`), `0 \u2264 \u03c9 \u2264 2 m r\u00b2` (L5) and SP's gap `b - s = r\u00b3/6`:\n`\u03c9 \u2264 2r\u03b4` and `2\u03b4 \u00b7 r\u00b3/6 < (2r\u03b4 - \u03c9)\u00b2`. -/\ntheorem sp_curved_side_constants {r m \u03b4 \u03c9 : \u211d} (hr : 0 < r) (hm : 2 \u2264 m)\n (h\u03b4 : r * m *"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "convexOn_add_node",
+ "line": 895,
+ "source_header": "_left\u2080 hpos (by have h\u03b40 : 0 < \u03b4 := by linarith\n positivity) two_ne_zero\n nlinarith [hsq]\n\n/-- Adding the affine function `(m/2)((t - a)(t - c) - t\u00b2)` preserves convexity. -/\ntheorem convexOn_add_node {u : \u211d \u2192 \u211d} {D : Set \u211d} {a c m : \u211d"
+ },
+ {
+ "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\u00b2` is convex and `u - (m/2) t\u00b2` is\nconcave on `D` (the weak form of `|u''| \u2264 m`) and `u` vanishes at `a < c` in `D`, then\n`|u x| \u2264 (m/2) |(x - a)(x - c)|` for every `x \u2208 D`, inside or outside `[a, c]`. -/\ntheorem two_node_bound {u : \u211d \u2192 \u211d} {D : Set \u211d} {a c m : \u211d}\n (hcv : ConvexOn \u211d D (fun t => u t + m / 2 * t ^ 2))\n (hcc : ConcaveOn \u211d D (fun t => u t - m / 2 * t ^ 2))\n (haD : a \u2208"
+ },
+ {
+ "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 \u21a6 w t v` has second derivative bounded by\n`m \u2016v\u2016` in the weak form below, then `\u2016w x\u2016 \u2264 (m/2) |(x - a)(x - c)|` on `D`. -/\ntheorem slice_gradient_bound {w : \u211d \u2192 E \u2192L[\u211d] \u211d} {D : Set \u211d} {a c m : \u211d} (hm : 0 \u2264 m)\n (hcv : \u2200 v : E, ConvexOn \u211d D (fun t => w t v + m * \u2016v\u2016 / 2 * t ^ 2))\n (hcc : \u2200 v : E, ConcaveOn \u211d D (fun t => w t v - m * \u2016v\u2016 / 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| \u2264 m * \u2016v\u2016 / 2 * |(x - a) * (x - c)| := h\n _ = m / 2 * |(x - a) * (x - c)| * \u2016v\u2016 := by ring\n\n/-- **The cap from SP's normalized hypotheses (L2, L4, L5, L7, L11, L12).** With `m \u2265 2` (L2),\nslices `\u03b4`-strongly concave for some `\u03b4 > 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(\u2213r/2) = 0` (L7) and the gap `b - s \u2264 r\u00b3/6`, the conclusions of `ridge_capHyp_of_slices` hold.\n`h\u03c9`, `h\u03c9r` and `hcurv` are derived: `\u2016w\u2016 \u2264 2 m r\u00b2` (`slice_gradient_bound`) and\n`sp_curved_side_constants`. -/\ntheorem ridge_capHyp_sp {f : \u211d \u00d7 E \u2192 \u211d} {h : \u211d \u2192 E} {F : \u211d \u2192 \u211d} {w : \u211d \u2192 E \u2192L[\u211d] \u211d}\n {r m \u03b4 : \u211d} (hr : 0 < r) (hm : 2 \u2264 m) (h\u03b4 : r * m * (8 * m - 5) < \u03b4)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : \u2200 x \u2208 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 \u211d (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hconc : \u2200 x \u2208 Icc (-2 * r) (r / 2),\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) \u03b4 (fun y => f (x, y)))\n (hball : \u2200 x \u2208 Icc (-2 * r) (r / 2), h x \u2208 Metric.closedBall (0 : E) (2 * r))\n (hcrit : \u2200 x \u2208 Icc (-2 * r) (r / 2),\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x))\n (hha : h (-r / 2) = 0) (hhc : h (r / 2) = 0)\n (hw : \u2200 x \u2208 Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))\n (hwcv : \u2200 v : E, ConvexOn \u211d (Icc (-2 * r) (r / 2)) (fun t => w t v + m * \u2016v\u2016 / 2 * t ^ 2))\n (hwcc : \u2200 v : E, ConcaveOn \u211d (Icc (-2 * r) (r / 2)) (fun t => w t v - m * \u2016v\u2016 / 2 * t ^ 2))\n (hgap : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) \u2264 r ^ 3 / 6) :\n CapHyp f (Icc (-2 * r) (r / 2) \u00d7\u02e2 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))) \u2227\n \u2200 x \u2208 fr"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "hermite_gap_le",
+ "line": 1015,
+ "source_header": "_ < _ := hcurv\n \u00b7 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''| \u2264 m` in the weak form, then `g(a) - g(c) \u2264 m (c - a)\u00b3/12`.\nSP's identity `g(c) - g(a) = -(1/2)\u222b \u03c6 g'''` with `\u222b \u03c6 = (c - a)\u00b3/6` gives the same bound; here it\ncomes from `two_node_bound` and monotonicity of `g + (m/2)\u03a6`, `\u03a6' = (t - a)(c - t)`. -/\ntheorem hermite_gap_le {g G : \u211d \u2192 \u211d} {a c m : \u211d} (hac : a < c)\n (hg : \u2200 x \u2208 Icc a c, HasDerivAt g (G x) x)\n (hcv : ConvexOn \u211d (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 \u2265 2`).** Under SP's normalization `g(-r/2) - g(r/2) = r\u00b3/6` on the pin interval, the\nweak bound `|g'''| \u2264 m` forces `m \u2265 2`. -/\ntheorem hermite_m_ge_two {g G : \u211d \u2192 \u211d} {r m : \u211d} (hr : 0 < r)\n (hg : \u2200 x \u2208 Icc (-r / 2) (r / 2), HasDerivAt g (G x) x)\n (hcv : ConvexOn \u211d (Icc (-r / 2) (r / 2)) (fun t => G t + m / 2 * t ^ 2))\n (hcc : ConcaveOn \u211d (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 \u2265 2` derived instead of assumed: `g0 = f(\u00b7, 0)` has derivative `G0`\nvanishing at the pins with `|G0''| \u2264 m` (weak form), and the gap is exactly `r\u00b3/6`. -/\ntheorem ridge_capHyp_normalized {f : \u211d \u00d7 E \u2192 \u211d} {h : \u211d \u2192 E} {F G0 : \u211d \u2192 \u211d}\n {w : \u211d \u2192 E \u2192L[\u211d] \u211d} {r m \u03b4 : \u211d} (hr : 0 < r)\n (hg0 : \u2200 x \u2208 Icc (-r / 2) (r / 2), HasDerivAt (fun x => f (x, 0)) (G0 x) x)\n (hG0cv : ConvexOn \u211d (Icc (-r / 2) (r / 2)) (fun t => G0 t + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn \u211d (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\u03b4 : r * m * (8 * m - 5) < \u03b4)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : \u2200 x \u2208 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 \u211d (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hconc : \u2200 x \u2208 Icc (-2 * r) (r / 2),\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) \u03b4 (fun y => f (x, y)))\n (hball : \u2200 x \u2208 Icc (-2 * r) (r / 2), h x \u2208 Metric.closedBall (0 : E) (2 * r))\n (hcrit : \u2200 x \u2208 Icc (-2 * r) (r / 2),\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x))\n (hha : h (-r / 2) = 0) (hhc : h (r / 2) = 0)\n (hw : \u2200 x \u2208 Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))\n (hwcv : \u2200 v : E, ConvexOn \u211d (Icc (-2 * r) (r / 2)) (fun t => w t v + m * \u2016v\u2016 / 2 * t ^ 2))\n (hwcc : \u2200 v : E, ConcaveOn \u211d (Icc (-2 * r) (r / 2)) (fun t => w t v - m * \u2016v\u2016 / 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) \u00d7\u02e2 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))) \u2227\n \u2200"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "strongConcaveOn_of_hessian",
+ "line": 1103,
+ "source_header": "impa [hha, hhc] using hnorm)\n exact ridge_capHyp_sp hr hm h\u03b4 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 `\u03c6` has derivative `D\u03c6` and `D\u03c6` has\nderivative `H` at every point of the convex set `K`, and `H y v v \u2264 -\u03b4 \u2016v\u2016\u00b2` there, then `\u03c6` is\n`\u03b4`-strongly concave on `K`. Along each segment, `\u03c6(x + t v) + (\u03b4/2)\u2016v\u2016\u00b2 t\u00b2` has a nonpositive\nsecond derivative, so it is concave on `[0, 1]`. -/\ntheorem strongConcaveOn_of_hessian {K : Set E} {\u03c6 : E \u2192 \u211d} {D\u03c6 : E \u2192 E \u2192L[\u211d] \u211d}\n {H : E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {\u03b4 : \u211d} (hK : Convex \u211d K)\n (hD : \u2200 y \u2208 K, HasFD"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "transverse_hessian_le",
+ "line": 1158,
+ "source_header": "el\n rw [hxv] at key\n show a * \u03c6 x + b * \u03c6 y + a * b * (\u03b4 / 2 * \u2016v\u2016 ^ 2) \u2264 \u03c6 (x + b \u2022 v)\n rw [hab'] at key \u22a2\n linear_combination key\n\n/-- **L3\u2013L4 (the transverse Hessian bound).** If the transverse Hessian `H` satisfies\n`H(M) \u2264 -\u03bb` (SP's `\u03bb = \u03bb_min(-D_y\u00b2 f(M))`) and its increments from `M = (-r/2, 0)` are bounded by\n`m (|\u0394x| + \u2016\u0394y\u2016)` (L3, with `m` bounding the third-derivative blocks), then `H(p) \u2264 -(\u03bb - 5rm)`\non the cap. The increment is at most `3r/2 + 2r \u2264 5r` there; SP bounds it on all of `D` by\n`9r/2 < 5r`. -/\ntheorem transverse_hessian_le {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {r m lam : \u211d} (hr : 0 < r)\n (hm : 0 \u2264 m)\n (hlip : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2016H p - H (-r / 2, 0)\u2016 \u2264 m * (|p.1 - -r / 2| + \u2016p.2\u2016))\n (hlam : \u2200 v : E, H (-r / 2, 0) v v \u2264 -la"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "hessian_increment",
+ "line": 1191,
+ "source_header": "v\u2016 := h1\n _ \u2264 5 * r * m * \u2016v\u2016 * \u2016v\u2016 := by gcongr\n _ = 5 * r * m * \u2016v\u2016 ^ 2 := by ring\n rw [hsplit]\n have := hlam v\n nlinarith\n\n/-- **L3 (increments of the transverse Hessian).** If `x \u21a6 H (x, 0)` has derivative `Hx x` with\n`\u2016Hx x\u2016 \u2264 m` on `[-2r, r/2]` (the block `\u2202_x D_y\u00b2 f`), and along each ray `s \u21a6 H (x, s \u2022 y)`,\n`s \u2208 [0, 1]`, the derivative `Hr p s` has `\u2016Hr p s\u2016 \u2264 m \u2016y\u2016` (the block `D_y\u00b3 f` applied to `y`),\nthen moving first in `x` along `y = 0` and then along the ray gives `\u2016H p - H M\u2016 \u2264 m (|\u0394x| + \u2016\u0394y\u2016)`\nfrom `M = (-r/2, 0)`, by the mean value inequality. -/\ntheorem hessian_increment {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {Hx : \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {Hr : \u211d \u00d7 E \u2192 \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {r m : \u211d} (hr : 0 < r)\n (hHx : \u2200 x \u2208 Icc (-2 * r) (r / 2), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : \u2200 x \u2208 Icc (-2 * r) (r / 2), \u2016Hx x\u2016 \u2264 m)\n (hHr : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 s \u2208 Icc (0 : \u211d) 1,\n HasDerivAt (fun s : \u211d => H (p.1, s \u2022 p.2)) (Hr p s) s)\n (hHrb : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 s \u2208 Icc (0 : \u211d) 1,\n \u2016Hr p s\u2016 \u2264 m"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "slices_strongConcave",
+ "line": 1224,
+ "source_header": "(H (-r / 2, 0))\n _ \u2264 m * \u2016y\u2016 + m * |x - -r / 2| := add_le_add h1 h2\n _ = m * (|(x, y).1 - -r / 2| + \u2016(x, y).2\u2016) := by simp only; ring\n\n/-- **L4 (strong concavity of the slices).** Under `transverse_hessian_le`'s hypotheses, with the\nslice derivatives `D\u03c6` and Hessians `H` given on the cap, every slice `y \u21a6 f (x, y)`,\n`x \u2208 [-2r, r/2]`, is `(\u03bb - 5rm)`-strongly concave on `B\u0304(0, 2r)`. -/\ntheorem slices_strongConcave {f : \u211d \u00d7 E \u2192 \u211d} {D\u03c6 : \u211d \u00d7 E \u2192 E \u2192L[\u211d] \u211d}\n {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {r m lam : \u211d} (hr : 0 < r) (hm : 0 \u2264 m)\n (hD : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => f (p.1, y)) (D\u03c6 p) p.2)\n (hH : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => D\u03c6 (p.1, y)) (H p) p.2)\n (hlip : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2016H p - H (-r / 2, 0)\u2016 \u2264 m * (|p.1 - -r / 2| + \u2016p.2\u2016))\n (hlam : \u2200 v : E, H (-r / 2, 0) v v \u2264 -lam"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridge_capHyp_H1",
+ "line": 1244,
+ "source_header": ", y))\n (convex_closedBall _ _) (fun y hy => hD (x, y) \u27e8hx, hy\u27e9) (fun y hy => hH (x, y) \u27e8hx, hy\u27e9)\n (fun y hy v => hbd (x, y) \u27e8hx, hy\u27e9 v)\n\n/-- **The cap from SP's hypothesis (H1) (L1\u2013L5, L7, L8, L11, L18).** As `ridge_capHyp_normalized`,\nwith the slice strong concavity and `\u03b4 > 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) \u2264 -\u03bb`, and (H1) `8 r m\u00b2 < \u03bb`. Then `\u03b4 = \u03bb - 5rm > rm(8m - 5)`. -/\ntheorem ridge_capHyp_H1 {f : \u211d \u00d7 E \u2192 \u211d} {h : \u211d \u2192 E} {F G0 : \u211d \u2192 \u211d}\n {w : \u211d \u2192 E \u2192L[\u211d] \u211d} {D\u03c6 : \u211d \u00d7 E \u2192 E \u2192L[\u211d] \u211d} {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {Hx : \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {Hr : \u211d \u00d7 E \u2192 \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {r m lam : \u211d} (hr : 0 < r)\n (hg0 : \u2200 x \u2208 Icc (-r / 2) (r / 2), HasDerivAt (fun x => f (x, 0)) (G0 x) x)\n (hG0cv : ConvexOn \u211d (Icc (-r / 2) (r / 2)) (fun t => G0 t + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn \u211d (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 : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => f (p.1, y)) (D\u03c6 p) p.2)\n (hH : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => D\u03c6 (p.1, y)) (H p) p.2)\n (hHx : \u2200 x \u2208 Icc (-2 * r) (r / 2), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : \u2200 x \u2208 Icc (-2 * r) (r / 2), \u2016Hx x\u2016 \u2264 m)\n (hHr : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 s \u2208 Icc (0 : \u211d) 1,\n HasDerivAt (fun s : \u211d => H (p.1, s \u2022 p.2)) (Hr p s) s)\n (hHrb : \u2200 p \u2208 Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 s \u2208 Icc (0 : \u211d) 1,\n \u2016Hr p s\u2016 \u2264 m * \u2016p.2\u2016)\n (hlam : \u2200 v : E, H (-r / 2, 0) v v \u2264 -lam * \u2016v\u2016 ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : \u2200 x \u2208 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 \u211d (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hball : \u2200 x \u2208 Icc (-2 * r) (r / 2), h x \u2208 Metric.closedBall (0 : E) (2 * r))\n (hcrit : \u2200 x \u2208 Icc (-2 * r) (r / 2),\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x))\n (hha : h (-r / 2) = 0) (hhc : h (r / 2) = 0)\n (hw : \u2200 x \u2208 Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))\n (hwcv : \u2200 v : E, ConvexOn \u211d (Icc (-2 * r) (r / 2)) (fun t => w t v + m * \u2016v\u2016 / 2 * t ^ 2))\n (hwcc : \u2200 v : E, ConcaveOn \u211d (Icc (-2 * r) (r / 2)) (fun t => w t v - m * \u2016v\u2016 / 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) \u00d7\u02e2 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\u03b4 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 `\u03b4`-strongly concave slice, `\u03b4 > 0`,\nhas at most one critical point in `K`. -/\ntheorem slice_critical_unique {K : Set E} {\u03c6 : E \u2192 \u211d} {\u03b4 : \u211d} (h\u03c6 : StrongConcaveOn K \u03b4 \u03c6)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "slice_critical_exists",
+ "line": 1305,
+ "source_header": "ct le_of_mul_le_mul_left this h\u03b4\n have h5 : \u2016q - p\u2016 = 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 `\u03b4`-strongly concave and\ndifferentiable on `B\u0304(0, R)` and its derivative at `0` has norm `< \u03b4R` (SP: `\u2016w\u2016 < \u03b4 \u00b7 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 `\u2264 w(p) - \u03b4R\u00b2 < 0` (SP's L7 computation, here from the strong\nconcavity engine), which contradicts maximality. -/\ntheorem slice_critical_exists [ProperSpace E] {\u03c6 : E \u2192 \u211d} {D\u03c6 : E \u2192 E \u2192L[\u211d] \u211d} {\u03b4 R : \u211d}\n (hR : 0 < R) (h\u03c6 : StrongConcaveOn (Metric.closedBall (0 : E) R) \u03b4 \u03c6)\n (hD :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "isInvertible_of_negDef",
+ "line": 1343,
+ "source_header": "sLocalMax (Metric.closedBall_mem_nhds_of_mem hpb)\n refine \u27e8p, hpb, ?_\u27e9\n have hz := hloc.hasFDerivAt_eq_zero (hD p hp)\n rw [\u2190 hz]\n exact hD p hp\n\n/-- In finite dimension, a bilinear form `A : E \u2192L E \u2192L \u211d` with `A v v \u2264 -\u03b4\u2016v\u2016\u00b2`, `\u03b4 > 0`, is\ninvertible as a map `E \u2192 E*` (SP L7: \"`D_y\u00b2 f` invertible\"). -/\ntheorem"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridge_hasStrictFDerivAt",
+ "line": 1364,
+ "source_header": ": E \u2192\u2097[\u211d] E \u2192L[\u211d] \u211d))).mp hinj\n refine \u27e8(LinearEquiv.ofBijective (A : E \u2192\u2097[\u211d] E \u2192L[\u211d] \u211d) \u27e8hinj, hsurj\u27e9).toContinuousLinearEquiv, ?_\u27e9\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' = -(\u2202_y G)\u207b\u00b9 \u2202_x G` (SP L9's formula). -/\ntheorem ridge_hasStrictFDerivAt [CompleteSpace E] {f : \u211d \u00d7 E \u2192 \u211d} {G : \u211d \u00d7 E \u2192 E \u2192L[\u211d] \u211d}\n {DG : \u211d \u00d7 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {h : \u211d \u2192 E} {K : Set E} {x0 : \u211d}\n (hGs : HasStrictFDerivAt G DG (x0, h x0))\n (hinv : (DG \u2218L ContinuousLinearMap.inr \u211d \u211d E).IsInvertible)\n (hG : \u2200\u1da0 v in \ud835\udcdd (x0, h x0), HasFDerivAt (fun y => f (v.1, y)) (G v) v.2)\n (hcrit0 : HasFDerivAt (fun y => f (x0, y)) (0 : E \u2192L[\u211d] \u211d) (h x0)) (hK : K \u2208 \ud835\udcdd (h x0))\n (huniq : \u2200\u1da0 x in \ud835\udcdd x0, \u2200 y \u2208 K, HasFDerivAt (fun y => f (x, y)) (0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridge_differentiable",
+ "line": 1394,
+ "source_header": ":= by\n filter_upwards [hev, hG\u03c8, hK\u03c8, huniq] with x h1 h2 h3 h4\n rw [h1, hGu] at h2\n exact h4 (\u03c8 x) h3 h2\n exact h\u03c8.congr_of_eventuallyEq heq\n\n\n/-- **L7 (regularity of the ridge on `[-2r, 2r]`).** With the slices `\u03b4`-strongly concave and `h x` a\ncritical point in `B\u0304(0, 2r)` for `x` in an open set `U \u2287 [-2r, 2r]` (SP: `f \u2208 C\u2074` 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 \u2208 [-2r, 2r]`. Composed with `ridge_inputs_of_joint`, as `ridge_capHyp_source` does, this supplies\nits `hh'`. -/\ntheorem ridge_differentiable [FiniteDimensional \u211d E] {f : \u211d \u00d7 E \u2192 \u211d} {G : \u211d \u00d7 E \u2192 E \u2192L[\u211d] \u211d}\n {DG : \u211d \u2192 \u211d \u00d7 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {h : \u211d \u2192 E} {U : Set \u211d} {r \u03b4 : \u211d} (h\u03b4 : 0 < \u03b4)\n (hU : IsOpen U) (hIU : Icc (-2 * r) (2 * r) \u2286 U)\n (hconc : \u2200 x \u2208 U,\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) \u03b4 (fun y => f (x, y)))\n (hball : \u2200 x \u2208 U, h x \u2208 Metric.closedBall (0 : E) (2 * r))\n (hcrit : \u2200 x \u2208 U, HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x))\n (hint : \u2200 x \u2208 Icc (-2 * r) (2 * r), h x \u2208 Metric.ball (0 : E) (2 * r))\n (hG : \u2200 x \u2208 Icc (-2 * r) (2 * r),\n \u2200\u1da0 v in \ud835\udcdd (x, h x), HasFDerivAt (fun y => f (v.1, y)) (G v) v.2)\n (hGs : \u2200 x \u2208 Icc (-2 * r) (2 * r), HasStrictFDerivAt G (DG x) (x, h x))\n (hneg : \u2200 x \u2208 Icc (-2 * r) (2 * r), \u2200 v : E,\n (DG x \u2218L ContinuousLinearMap.inr \u211d \u211d E) v v \u2264 -\u03b4 * \u2016v\u2016 ^ 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\u03b4 (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`\u03b4`-strongly concave and differentiable on `B\u0304(0, 2r)` with `\u2016\u2202_y f(x, 0)\u2016 < \u03b4 \u00b7 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 : \u211d \u00d7 E \u2192 \u211d} {D\u03c6 : \u211d \u2192 E \u2192 E \u2192L[\u211d] \u211d} {U : Set \u211d}\n {r \u03b4 : \u211d} (hr : 0 < r)\n (hconc : \u2200 x \u2208 U,\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) \u03b4 (fun y => f (x, y)))\n (hD : \u2200 x \u2208 U, \u2200 y \u2208 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => f (x, y)) (D\u03c6 x y) y)\n (hw : \u2200"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "hessian_increment_D",
+ "line": 1450,
+ "source_header": "hx) (hD x hx) (hw x hx)\n exact \u27e8p, fun _ => \u27e8hp, hdp\u27e9\u27e9\n \u00b7 exact \u27e80, fun h => absurd h hx\u27e9\n choose h hh using hex\n exact \u27e8h, fun x hx => hh x hx\u27e9\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 \u2208 C\u2074` near `D`. The lemmas below take the source data on a collar `x \u2208 [-2r - \u03b5, 2r + \u03b5]`,\n`0 < \u03b5 \u2264 r/2`, where `|x + r/2| \u2264 3r` keeps the increment at most `5r`. So every slice over the open\nset `(-2r - \u03b5, 2r + \u03b5) \u2287 [-2r, 2r]` is `(\u03bb - 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 - \u03b5, 2r + \u03b5]`. -/\ntheorem hessian_increment_D {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {Hx : \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {Hr : \u211d \u00d7 E \u2192 \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {r m \u03b5 : \u211d} (hr : 0 < r) (h\u03b5 : 0 < \u03b5)\n (hHx : \u2200 x \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : \u2200 x \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5), \u2016Hx x\u2016 \u2264 m)\n (hHr : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 s \u2208 Icc (0 : \u211d) 1, HasDerivAt (fun s : \u211d => H (p.1, s \u2022 p.2)) (Hr p s) s)\n (hHrb : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 s \u2208 Icc (0 : \u211d) 1,"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "transverse_hessian_le_D",
+ "line": 1487,
+ "source_header": "(x, y)) (H (x, 0)) (H (-r / 2, 0))\n _ \u2264 m * \u2016y\u2016 + m * |x - -r / 2| := add_le_add h1 h2\n _ = m * (|(x, y).1 - -r / 2| + \u2016(x, y).2\u2016) := by simp only; ring\n\n/-- **L4's Hessian bound on the full domain.** As `transverse_hessian_le`, for\n`x \u2208 [-2r - \u03b5, 2r + \u03b5]` with `0 < \u03b5 \u2264 r/2`: there `|x + r/2| \u2264 3r`, so the increment is still at\nmost `5r`. -/\ntheorem transverse_hessian_le_D {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {r m lam \u03b5 : \u211d}\n (hm : 0 \u2264 m) (h\u03b5 : 0 < \u03b5) (h\u03b5r : \u03b5 \u2264 r / 2)\n (hlip : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2016H p - H (-r / 2, 0)\u2016 \u2264 m * (|p.1 - -r / 2| + \u2016p.2\u2016))\n (hlam : \u2200 v : E, H (-r /"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "slices_strongConcave_D",
+ "line": 1518,
+ "source_header": "H (-r / 2, 0)\u2016 * \u2016v\u2016 * \u2016v\u2016 := h1\n _ \u2264 5 * r * m * \u2016v\u2016 * \u2016v\u2016 := by gcongr\n _ = 5 * r * m * \u2016v\u2016 ^ 2 := by ring\n rw [hsplit]\n have := hlam v\n nlinarith\n\n/-- **L4 on the full domain.** Every slice `y \u21a6 f (x, y)`, `x \u2208 [-2r - \u03b5, 2r + \u03b5]`, is\n`(\u03bb - 5rm)`-strongly concave on `B\u0304(0, 2r)`. -/\ntheorem slices_strongConcave_D {f : \u211d \u00d7 E \u2192 \u211d} {D\u03c6 : \u211d \u00d7 E \u2192 E \u2192L[\u211d] \u211d}\n {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {r m lam \u03b5 : \u211d} (hm : 0 \u2264 m) (h\u03b5 : 0 < \u03b5)\n (h\u03b5r : \u03b5 \u2264 r / 2)\n (hD : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => f (p.1, y)) (D\u03c6 p) p.2)\n (hH : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => D\u03c6 (p.1, y)) (H p) p.2)\n (hlip : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2016H p - H (-r / 2, 0)\u2016 \u2264 m * (|p.1 - -r / 2| + \u2016p.2\u2016))\n (hlam : \u2200 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) \u27e8hx, hy\u27e9) (fun y hy => hH (x, y) \u27e8hx, hy\u27e9)\n (fun y hy v => hbd (x, y) \u27e8hx, hy\u27e9 v)\n\n/-- **The cap from SP's source data (L1\u2013L5, L7, L8, L11, L18 composed).** Fix a collar\n`0 < \u03b5 \u2264 r/2` and assume, for `x \u2208 [-2r - \u03b5, 2r + \u03b5]` and `y \u2208 B\u0304(0, 2r)`: a joint derivative `Df` of `f`, strictly differentiable in\nits transverse part `\u2202_y f = Df \u2218 inr` with derivative `DG`; the transverse Hessian `H` with the\nthird-derivative bounds `m` of L3; (H1) `8rm\u00b2 < \u03bb` with `H(M) \u2264 -\u03bb`; the critical pins\n`Df(\u2213r/2, 0) = 0`; the weak bounds `|\u2202_x\u00b3 f(\u00b7, 0)| \u2264 m` on `[-r/2, r/2]` (L1) and\n`|\u2202_x\u00b2 \u2202_y f(\u00b7, 0)| \u2264 m` on the collar (L5); and the gap `f(M) - f(S) = r\u00b3/6`. Then:\n- a ridge `h` exists: on `(-2r - \u03b5, 2r + \u03b5)`, `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 = \u2202_x f(x, h x)`, `h(\u2213r/2) = 0`, and (C1)\u2013(C3) and (C2\u207a) 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]` (`\u2016w\u2016 \u2264 3mr\u00b2 < 2r\u03b4`); the implicit function theorem\n(`ridge_differentiable`) makes `h` differentiable there, with negative definite `DG \u2218 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\u2013L11's quantitative bounds that SP uses to prove it. -/\ntheorem ridge_capHyp_source [FiniteDimensional \u211d E] {f : \u211d \u00d7 E \u2192 \u211d}\n {Df : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {DG : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {Hx : \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {Hr : \u211d \u00d7 E \u2192 \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {r m lam \u03b5 : \u211d} (hr : 0 < r) (h\u03b5 : 0 < \u03b5)\n (h\u03b5r : \u03b5 \u2264 r / 2)\n (hDf : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt f (Df p) p)\n (hGs : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr \u211d \u211d E)) (DG p) p)\n (hH : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr \u211d \u211d E)) (H p) p.2)\n (hHx : \u2200 x \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : \u2200 x \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5), \u2016Hx x\u2016 \u2264 m)\n (hHr : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 s \u2208 Icc (0 : \u211d) 1, HasDerivAt (fun s : \u211d => H (p.1, s \u2022 p.2)) (Hr p s) s)\n (hHrb : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 s \u2208 Icc (0 : \u211d) 1, \u2016Hr p s\u2016 \u2264 m * \u2016p.2\u2016)\n (hlam : \u2200 v : E, H (-r / 2, 0) v v \u2264 -lam * \u2016v\u2016 ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hG0cv : ConvexOn \u211d (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn \u211d (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))\n (hwcv : \u2200 v : E, ConvexOn \u211d (Icc (-2 * r - \u03b5) (2 * r + \u03b5))\n (fun t => Df (t, 0) (0, v) + m * \u2016v\u2016 / 2 * t ^ 2))\n (hwcc : \u2200 v : E, ConcaveOn \u211d (Icc (-2 * r - \u03b5) (2 * r + \u03b5))\n (fun t => Df (t, 0) (0, v) - m * \u2016v\u2016 / 2 * t ^ 2))\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n (\u2203 h : \u211d \u2192 E, \u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5), h x \u2208 Metric.ball (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2227\n \u2200 h : \u211d \u2192 E, (\u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5),\n h x \u2208 Metric.closedBall (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2192\n ConvexOn \u211d (Icc (-2 * r) (2 * r))\n (fun x => Df (x, h x) (1, 0) - (x + r / 2) * (x - r / 2) / 8) \u2192\n h (-r / 2) = 0 \u2227 h (r / 2) = 0 \u2227\n CapHyp f (Icc (-2 * r) (r / 2) \u00d7\u02e2 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 \u27e8hha, hhc, key\u27e9\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\u00b2f[(1, h'), (1, 0)]` is the maximum of `\u03b6 \u21a6 D\u00b2f[(1, \u03b6), (1, \u03b6)]`,\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 `\u2265 0` to the right of `c` and\n`\u2264 0` to the left of `a`. -/\ntheorem convex_deriv_sign {\u03c6 : \u211d \u2192 \u211d} {D : Set \u211d} {a c x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "two_node_deriv_bound",
+ "line": 1772,
+ "source_header": "c - \u03c6 a) / (c - a) :=\n h\u03c6.slope_mono_adjacent hx hcD h hac\n have h2 := h\u03c6.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\u00b2` is convex and `u - (m/2)t\u00b2` concave on `D` (weakly\n`|u''| \u2264 m`), `u(\u2213r/2) = 0` and `u` has derivative `d` at `x \u2208 D`, then `|d| \u2264 m \u00b7 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 : \u211d \u2192 \u211d} {D : Set \u211d} {r m x d : \u211d} (hr : 0 < r) (hm : 0 \u2264 m)\n (hcv : ConvexOn \u211d D (fun t => u t + m / 2 * t ^ 2))\n (hcc : ConcaveOn \u211d D (fun t => u t"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "slice_gradient_deriv_bound",
+ "line": 1831,
+ "source_header": "calc |d| \u2264 m / 2 * r := abs_le.mpr \u27e8by linarith, hd1\u27e9\n _ = m * (r / 2) := by ring\n _ \u2264 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: `\u2016w' x\u2016 \u2264 m \u00b7 max(|x|, r/2)`; on `[-2r, 2r]` this is SP's `\u2016w'\u2016 \u2264 2mr`. -/\ntheorem slice_gradient_deriv_bound {w : \u211d \u2192 E \u2192L[\u211d] \u211d} {w' : E \u2192L[\u211d] \u211d} {D : Set \u211d} {r m x : \u211d}\n (hr : 0 < r) (hm : 0 \u2264 m)\n (hcv : \u2200 v : E, ConvexOn \u211d D (fun t => w t v + m * \u2016v\u2016 / 2 * t ^ 2))\n (hcc : \u2200 v : E, ConcaveOn \u211d 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| \u2264 m * \u2016v\u2016 * max |x| (r / 2) := h\n _ = m * max |x| (r / 2) * \u2016v\u2016 := by ring\n\n/-- **L9 and the Schur maximum.** Let `Q` be a bilinear form on `\u211d \u00d7 E` with `\u03b4`-negative definite\ntransverse part, and let `\u03b7` satisfy the differentiated ridge equation `Q (1, \u03b7) (0, \u00b7) = 0`. Then\n`\u03b4 \u2016\u03b7\u2016 \u2264 \u2016Q (1, 0) (0, \u00b7)\u2016` (L9: `\u2016h'\u2016 \u2264 \u2016\u2202_x \u2207_y f\u2016 / \u03b4`), `Q (1, \u03b7) (1, \u03b7) = Q (1, \u03b7) (1, 0)`, and,\nif `Q` is symmetric, `Q (1, \u03b6) (1, \u03b6) \u2264 Q (1, \u03b7) (1, \u03b7)` for every `\u03b6`: the Schur complement\n`F' = f_xx + f_xy[h']` is the maximum of `\u03b6 \u21a6 D\u00b2f[(1, \u03b6), (1, \u03b6)]`. -/\ntheorem schur_max {Q : \u211d \u00d7 E \u2192L[\u211d] \u211d \u00d7 E \u2192L[\u211d] \u211d} {\u03b4 : \u211d} {\u03b7 : E} (h\u03b4 : 0 < \u03b4)\n (hneg : \u2200 v : E, Q (0, v) (0, v) \u2264 -\u03b4 * \u2016v\u2016 ^ 2)\n (hridge : (Q (1, \u03b7)).comp (ContinuousLinearMap.inr \u211d \u211d E) = 0) :\n \u03b4 *"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "trilinear_lower",
+ "line": 1889,
+ "source_header": "2 : Q (0, \u03b6 - \u03b7) (1, \u03b7) = 0 := by rw [hsym]; exact h1\n have h3 := hneg (\u03b6 - \u03b7)\n rw [hz, map_add, map_add, add_apply, add_apply, h1, h2]\n nlinarith [sq_nonneg \u2016\u03b6 - \u03b7\u2016]\n\n/-- **The correction terms of L12.** Let `T a b v` be the third derivative of `f` (the derivative of\n`D\u00b2f[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) \u2265 f_xxx - m((1 + \u2016b\u2016)\u00b2(1 + \u2016a\u2016) - 1)`. With `\u2016a\u2016, \u2016b\u2016 \u2264 u`\nthis is SP's adverse bound `m u (3 + 3u + u\u00b2)`. -/\ntheorem trilinear_lower {T : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {m : \u211d}\n (hT : \u2200 (s\u2081 s\u2082 s\u2083 : \u211d) (y\u2081 y\u2082 y\u2083 : E),\n |T (s\u2081, y\u2081) (s\u2082, y\u2082) (s\u2083, y\u2083) - s\u2081 * s\u2082 * s\u2083 * T (1, 0) (1, 0) (1, 0)| \u2264\n m * ((|s\u2081|"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "l12_constants",
+ "line": 1903,
+ "source_header": ") - m * ((1 + \u2016b\u2016) * (1 + \u2016b\u2016) * (1 + \u2016a\u2016) - 1) \u2264 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 \u2265 2`, `\u03b4 > rm(8m - 5)` and `u = 2s + 2s\u00b2`, `s = mr/\u03b4`\n(L9's bound on `\u2016h'\u2016`): `7/4 - m((1 + u)\u00b3 - 1) \u2265 1/4`. SP's exact value at `k = 11` is\n`7/4 - 2554128/1771561 = 0.308\u2026 > 1/"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "transverse_hessian_eq",
+ "line": 1936,
+ "source_header": "have h4 : (m * u) * (3 + 3 * u + u ^ 2) \u2264 (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 \u22a2\n linarith\n\n/-- **The transverse Hessian is the transverse block of `D\u00b2f`.** If `y \u21a6 \u2202_y f (x, y)` has\nderivative `H` at `y\u2080` and `Df` has derivative `D2f` at `(x, y\u2080)`, then\n`H v w = D\u00b2f (x, y\u2080) [(0, v), (0, w)]`. -/\ntheorem transverse_hessian_eq {Df : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {D2f : \u211d \u00d7 E \u2192L[\u211d] \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {H : E \u2192L[\u211d] E \u2192L[\u211d] \u211d}"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridge_second_identity",
+ "line": 1950,
+ "source_header": "p y\u2080 (hasFDerivAt_prodMk_right x y\u2080)).clm_apply\n (hasFDerivAt_const ((0 : \u211d), w) y\u2080)\n have h3 := h1.unique h2\n have := congrArg (fun L : E \u2192L[\u211d] \u211d => L v) h3\n simpa using this\n\n/-- **The differentiated ridge equation.** If `\u2202_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\u00b2f (x, h x) [(1, h'), (0, \u00b7)] = 0`, i.e. `\u2202_x \u2207_y f + D_y\u00b2 f \u00b7 h' = 0` (L11's first identity). -/\ntheorem ridge_second_identity {Df : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {D2f : \u211d \u00d7 E \u2192L[\u211d] \u211d \u00d7 E \u2192L[\u211d] \u211d} {h : \u211d \u2192 E} {h' : E} {x : \u211d}\n (hridge : \u2200\u1da0 t in \ud835\udcdd x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridge_hconv",
+ "line": 1968,
+ "source_header": "have h3 : HasDerivAt (fun t => (Df (t, h t)).comp (ContinuousLinearMap.inr \u211d \u211d E)) 0 x :=\n (hasDerivAt_const x (0 : E \u2192L[\u211d] \u211d)).congr_of_eventuallyEq hridge\n exact h2.unique h3\n\n/-- **L12 (CAP (11)\u2013(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 `\u03b4`-negative definite,\n`\u2016h'\u2016 \u2264 u`, and for every `\u2016b\u2016 \u2264 u` let `s \u21a6 D\u00b2f(s, h s)[(1, b), (1, b)]` have derivative `\u2265 1/4`\n(SP: `f_xxx \u2265 7/4` minus the adverse part `m u (3 + 3u + u\u00b2)`; see `trilinear_lower`). Then\n`F - (x + r/2)(x - r/2)/8`, `F x = \u2202_x f (x, h x)`, is convex on `[-2r, 2r]`. No second derivative of\n`h` is used: `F' = D\u00b2f[(1, h'), (1, 0)]` is the maximum of `\u03b6 \u21a6 D\u00b2f[(1, \u03b6), (1, \u03b6)]` (`schur_max`),\nso `F'(x\u2082) - F'(x\u2081) \u2265 D\u00b2f(x\u2082)[(1, \u03b7), (1, \u03b7)] - D\u00b2f(x\u2081)[(1, \u03b7), (1, \u03b7)] \u2265 (x\u2082 - x\u2081)/4` with\n`\u03b7 = h'(x\u2081)`. -/\ntheorem ridge_hconv {Df : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {D2f : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {\u03a6 : \u211d \u2192 E \u2192 \u211d} {h h' : \u211d \u2192 E} {U : Set \u211d} {r \u03b4 u : \u211d} (h\u03b4 : 0 < \u03b4) (hU : IsOpen U)\n (hIU : Icc (-2 * r) (2 * r) \u2286 U)\n (hridge : \u2200 x \u2208 U, (Df (x, h x)).comp (ContinuousLinearMap.inr \u211d \u211d E) = 0)\n (hh : \u2200 x \u2208 Icc (-2 * r) (2 * r), HasDerivAt h (h' x) x)\n (hD2 : \u2200 x \u2208 Icc (-2 * r) (2 * r), HasFDerivAt Df (D2f (x, h x)) (x, h x))\n (hsym : \u2200 x \u2208 Icc (-2 * r) (2 * r), \u2200 v w, D2f (x, h x) v w = D2f (x, h x) w v)\n (hneg : \u2200 x \u2208 Icc (-2 * r) (2 * r), \u2200 v : E, D2f (x, h x) (0, v) (0, v) \u2264 -\u03b4 * \u2016v\u2016 ^ 2)\n (hu : \u2200 x \u2208 Icc (-2 * r) (2 * r), \u2016h' x\u2016 \u2264 u)\n (h\u03a6 : \u2200 x \u2208 Icc (-2 * r) (2 * r), \u2200 b : E,\n HasDerivAt (fun s => D2f (s, h s) (1, b) (1, b)) (\u03a6 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 `\u2202_x \u2207_y f`.** If along the segment `s \u21a6 (x, s \u2022 y)` the third derivatives\nsatisfy `|T (1, 0) (0, v) (0, y)| \u2264 m \u2016v\u2016 \u2016y\u2016` (the block `f_xyy`), then\n`\u2016\u2202_x \u2207_y f (x, y) - \u2202_x \u2207_y f (x, 0)\u2016 \u2264 m \u2016y\u2016`. -/\ntheorem dx_grad_increment {D2f : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {T3 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {x m : \u211d} {y : E} (hm : 0 \u2264 m)\n (hD3 : \u2200 s \u2208 Icc (0 : \u211d) 1, \u2200 a b : \u211d \u00d7 E,\n HasFDerivAt (fun q => D2f q a b) (T3 (x, s \u2022 y) a b) (x, s \u2022 y))\n (hT : \u2200 s \u2208 Icc (0 : \u211d) 1, \u2200 v : E, |T3 (x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "l9_arith",
+ "line": 2070,
+ "source_header": "ontinuousLinearMap.comp_apply,\n ContinuousLinearMap.inr_apply]\n calc \u2016(D2f (x, y)) (1, 0) (0, v) - (D2f (x, 0)) (1, 0) (0, v)\u2016 \u2264 m * \u2016v\u2016 * \u2016y\u2016 := this\n _ = m * \u2016y\u2016 * \u2016v\u2016 := by ring\n\n/-- **L9's arithmetic.** From `\u03b4 \u2016h'\u2016 \u2264 \u2016\u2202_x\u2207_y f(x, h)\u2016 \u2264 2mr + m\u2016h\u2016` and `\u03b4 \u2016h\u2016 \u2264 2mr\u00b2`:\n`\u2016h'\u2016 \u2264 2s + 2s\u00b2` with `s = mr/\u03b4` (SP: `u = 2/k + 2/k\u00b2`). -"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "l12_lower",
+ "line": 2082,
+ "source_header": "nlinarith\n have hrhs : 2 * (m * r / \u03b4) + 2 * (m * r / \u03b4) ^ 2 =\n (2 * m * r * \u03b4 + 2 * m * m * r ^ 2) / (\u03b4 * \u03b4) := by\n field_simp\n rw [hrhs, le_div_iff\u2080 (by positivity)]\n linarith\n\n/-- **L12's bound at one point.** With the combined block bound, `f_xxx \u2265 7/4`, `\u2016a\u2016, \u2016b\u2016 \u2264 u`\nand `7/4 - m((1 + u)\u00b3 - 1) \u2265 1/4` (`l12_constants`): `T (1, b) (1, b) (1, a) \u2265 1/4`. -/\ntheorem l12_lower {T : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {m u : \u211d} {a b : E} (hm : 0 \u2264 m)\n (hT : \u2200 (s\u2081 s\u2082 s\u2083 : \u211d) (y\u2081 y\u2082 y\u2083 : E),\n |T (s\u2081, y\u2081) (s\u2082, y\u2082) (s\u2083, y\u2083) - s\u2081 * s\u2082 * s\u2083 * T (1, 0) (1, 0) (1, 0)| \u2264\n m * ((|s\u2081| + \u2016y\u2081\u2016) * (|s\u2082| + \u2016y\u2082\u2016) * ("
+ },
+ {
+ "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 \u2265 2`, `\u03b4 = \u03bb - 5rm > rm(8m - 5)`, `h x` lies in the open ball and\n`\u03b4 \u2016h x\u2016 \u2264 2mr\u00b2` on `[-2r, 2r]` (L5 and L8), `h` is differentiable there (L7), and the transverse\nHessian along the ridge is `\u03b4`-negative definite (L4). -/\ntheorem ridge_source_facts [FiniteDimensional \u211d E] {f : \u211d \u00d7 E \u2192 \u211d}\n {Df : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {DG : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {Hx : \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {Hr : \u211d \u00d7 E \u2192 \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {r m lam \u03b5 : \u211d} (hr : 0 < r) (h\u03b5 : 0 < \u03b5)\n (h\u03b5r : \u03b5 \u2264 r / 2)\n (hDf : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hGs : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr \u211d \u211d E)) (DG p) p)\n (hH : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr \u211d \u211d E)) (H p) p.2)\n (hHx : \u2200 x \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : \u2200 x \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5), \u2016Hx x\u2016 \u2264 m)\n (hHr : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 s \u2208 Icc (0 : \u211d) 1, HasDerivAt (fun s : \u211d => H (p.1, s \u2022 p.2)) (Hr p s) s)\n (hHrb : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 s \u2208 Icc (0 : \u211d) 1, \u2016Hr p s\u2016 \u2264 m * \u2016p.2\u2016)\n (hlam : \u2200 v : E, H (-r / 2, 0) v v \u2264 -lam * \u2016v\u2016 ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hG0cv : ConvexOn \u211d (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn \u211d (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))\n (hwcv : \u2200 v : E, ConvexOn \u211d (Icc (-2 * r - \u03b5) (2 * r + \u03b5))\n (fun t => Df (t, 0) (0, v) + m * \u2016v\u2016 / 2 * t ^ 2))\n (hwcc : \u2200 v : E, ConcaveOn \u211d (Icc (-2 * r - \u03b5) (2 * r + \u03b5))\n (fun t => Df (t, 0) (0, v) - m * \u2016v\u2016 / 2 * t ^ 2))\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) {h : \u211d \u2192 E}\n (hhU : \u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5), h x \u2208 Metric.closedBall (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) :\n 2 \u2264 m \u2227 r * m * (8 * m - 5) < lam - 5 * r * m \u2227\n (\u2200 x \u2208 Icc (-2 * r) (2 * r), h x \u2208 Metric.ball (0 : E) (2 * r)) \u2227\n (\u2200 x \u2208 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 \u27e8_, fun x hx => (hstrict x hx).hasFDerivAt.hasDerivAt\u27e9,\n fun x hx v => hneg _ (hridgeX x hx) v\u27e9\n\n\n/-- **The cap from SP's `C\u00b3` source data (L1\u2013L20 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 \u21a6 D\u00b2f p [a, b]`, every\nthird-derivative block other than `f_xxx` of norm at most `m` (combined form), and `f_xxx \u2265 7/4` on\n`D = [-2r, 2r] \u00d7 B\u0304(0, 2r)` (SP's L4, from L2 and (H2), on SP's domain). Then the ridge exists, and every ridge has `h(\u2213r/2) = 0` and yields\n(C1)\u2013(C3) and (C2\u207a) on the cap. Inside: L5 gives `\u2016w\u2016 \u2264 2mr\u00b2` on `[-2r, 2r]`, L8 `\u2016h\u2016 \u2264 2mr\u00b2/\u03b4`, L6\n`\u2016w'\u2016 \u2264 2mr`, L3 in `y` `\u2016\u2202_x\u2207_y f(x, h)\u2016 \u2264 \u2016w'\u2016 + m\u2016h\u2016`, L9 `\u2016h'\u2016 \u2264 2s + 2s\u00b2` with `s = mr/\u03b4`,\n`trilinear_lower` and `l12_constants` give `F'' \u2265 1/4` in the form of `ridge_hconv`. -/\ntheorem ridge_capHyp_C3 [FiniteDimensional \u211d E] {f : \u211d \u00d7 E \u2192 \u211d}\n {Df : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {D2f : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {T3 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {DG : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {Hx : \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {Hr : \u211d \u00d7 E \u2192 \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {r m lam \u03b5 : \u211d} (hr : 0 < r) (h\u03b5 : 0 < \u03b5)\n (h\u03b5r : \u03b5 \u2264 r / 2)\n (hDf : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hD2 : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)\n (hD3 : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 a b : \u211d \u00d7 E, HasFDerivAt (fun q => D2f q a b) (T3 p a b) p)\n (hT : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 (s\u2081 s\u2082 s\u2083 : \u211d) (y\u2081 y\u2082 y\u2083 : E),\n |T3 p (s\u2081, y\u2081) (s\u2082, y\u2082) (s\u2083, y\u2083) - s\u2081 * s\u2082 * s\u2083 * T3 p (1, 0) (1, 0) (1, 0)| \u2264\n m * ((|s\u2081| + \u2016y\u2081\u2016) * (|s\u2082| + \u2016y\u2082\u2016) * (|s\u2083| + \u2016y\u2083\u2016) - |s\u2081| * |s\u2082| * |s\u2083|))\n (hxxx : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n 7 / 4 \u2264 T3 p (1, 0) (1, 0) (1, 0))\n (hGs : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr \u211d \u211d E)) (DG p) p)\n (hH : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr \u211d \u211d E)) (H p) p.2)\n (hHx : \u2200 x \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : \u2200 x \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5), \u2016Hx x\u2016 \u2264 m)\n (hHr : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 s \u2208 Icc (0 : \u211d) 1, HasDerivAt (fun s : \u211d => H (p.1, s \u2022 p.2)) (Hr p s) s)\n (hHrb : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 s \u2208 Icc (0 : \u211d) 1, \u2016Hr p s\u2016 \u2264 m * \u2016p.2\u2016)\n (hlam : \u2200 v : E, H (-r / 2, 0) v v \u2264 -lam * \u2016v\u2016 ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hG0cv : ConvexOn \u211d (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn \u211d (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))\n (hwcv : \u2200 v : E, ConvexOn \u211d (Icc (-2 * r - \u03b5) (2 * r + \u03b5))\n (fun t => Df (t, 0) (0, v) + m * \u2016v\u2016 / 2 * t ^ 2))\n (hwcc : \u2200 v : E, ConcaveOn \u211d (Icc (-2 * r - \u03b5) (2 * r + \u03b5))\n (fun t => Df (t, 0) (0, v) - m * \u2016v\u2016 / 2 * t ^ 2))\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n (\u2203 h : \u211d \u2192 E, \u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5), h x \u2208 Metric.ball (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2227\n \u2200 h : \u211d \u2192 E, (\u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5),\n h x \u2208 Metric.closedBall (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2192\n h (-r / 2) = 0 \u2227 h (r / 2) = 0 \u2227\n CapHyp f (Icc (-2 * r) (r / 2) \u00d7\u02e2 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\u03b40 isOpen_Ioo hIU\n hridgeU hhd hD2r hsym hnegD hu h\u03a6\n (fun x hx b hb => l12_lower hm0 (hT _ (hridgeX x hx)) (hxxx _ \u27e8hx, hball x (hIU hx)\u27e9) 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 \u2265 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 \u2265 2`, by a one-sided Hermite bound)\nand (H2) `rn \u2264 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'' \u2264 m` weakly):\n`g(a) - g(c) \u2264 m (c - a)\u00b3/12`. -/\ntheorem hermite_gap_le_concave {g G : \u211d \u2192 \u211d} {a c m : \u211d} ("
+ },
+ {
+ "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\u00b3/6` with critical pins,\nif `g''' = \u03c6` is continuous on the pin interval, then `\u03c6(x\u2080) \u2265 2` for some `x\u2080` there (SP: the\n`\u03c6`-weighted average of `f_xxx` is `2`). -/\ntheorem third_deriv_exists_two {g G G' \u03c6 : \u211d \u2192 \u211d} {r : \u211d} (hr : 0 < r)\n (hg : \u2200 x \u2208 Icc (-r / 2) (r / 2), HasDerivAt g (G x) x)\n (hG : \u2200 x \u2208 Icc (-r / 2) (r / 2), HasDerivAt G (G' x) x)\n (hG' : \u2200 x \u2208 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\u2081 hx\u2081\n have hr3 : 0 < r ^ 3 := by positivity\n nlinarith\n\n/-- **L4 (`f_xxx \u2265 7/4`).** Let `\u03c8 = f_xxx` have derivative `D\u03c8` on SP's domain\n`D = [-2r, 2r] \u00d7 B\u0304(0, 2r)`, with the two fourth-order blocks bounded by `n = M_4` there:\n`|\u2202_x \u03c8| = |D\u03c8 (1, 0)| \u2264 n` and `\u2016D_y \u03c8\u2016 = \u2016D\u03c8 \u2218 inr\u2016 \u2264 n`. If `\u03c8(x\u2080, 0) \u2265 2` at a point of the pin\ninterval and (H2) `rn \u2264 1/20`, then `\u03c8 \u2265 7/4` on `D` (the proof bounds `\u03c8 \u2265 2 - 9rn/2`; the\nstatement exports `7/4`). As in SP's L3, move first in `x`\nalong `y = 0` (`|\u0394x| \u2264 5r/2`), then along the ray to `y` (`\u2016\u0394y\u2016 \u2264 2r`); SP rounds `9r/2` up to `5r`. -/\ntheorem fxxx_lower {\u03c8 : \u211d \u00d7 E \u2192 \u211d} {D\u03c8 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {r n x\u2080 : \u211d} (hr : 0 < r)\n (h\u03c8 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), HasFDerivAt \u03c8 (D\u03c8 p) p)\n (hnx : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), |D\u03c8 p (1, 0)| \u2264 n)\n (hny : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2016(D\u03c8 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\u2080| \u2264 n * (5 * r / 2) := mul_le_mul_of_nonneg_left hdx hn0\n have h6 : n * \u2016y\u2016 \u2264 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\u2013L20 composed).** As\n`ridge_capHyp_C3`, with `f_xxx \u2265 7/4` derived instead of assumed: from a derivative `\u03a64` of `f_xxx`\non `D = [-2r, 2r] \u00d7 B\u0304(0, 2r)` whose two blocks `\u2202_x f_xxx` and `D_y f_xxx` are bounded by\n`n = M_4` there, as in SP, and (H2) `rn \u2264 1/20`. L2's second statement gives `f_xxx(x\u2080, 0) \u2265 2` on\nthe pin interval (`third_deriv_exists_two`), and `fxxx_lower` gives `f_xxx \u2265 7/4` on `D`. -/\ntheorem ridge_capHyp_C4 [FiniteDimensional \u211d E] {f : \u211d \u00d7 E \u2192 \u211d}\n {Df : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {D2f : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {T3 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {\u03a64 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {n : \u211d}\n {DG : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {Hx : \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {Hr : \u211d \u00d7 E \u2192 \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {r m lam \u03b5 : \u211d} (hr : 0 < r) (h\u03b5 : 0 < \u03b5)\n (h\u03b5r : \u03b5 \u2264 r / 2)\n (hDf : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hD2 : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)\n (hD3 : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 a b : \u211d \u00d7 E, HasFDerivAt (fun q => D2f q a b) (T3 p a b) p)\n (hT : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 (s\u2081 s\u2082 s\u2083 : \u211d) (y\u2081 y\u2082 y\u2083 : E),\n |T3 p (s\u2081, y\u2081) (s\u2082, y\u2082) (s\u2083, y\u2083) - s\u2081 * s\u2082 * s\u2083 * T3 p (1, 0) (1, 0) (1, 0)| \u2264\n m * ((|s\u2081| + \u2016y\u2081\u2016) * (|s\u2082| + \u2016y\u2082\u2016) * (|s\u2083| + \u2016y\u2083\u2016) - |s\u2081| * |s\u2082| * |s\u2083|))\n (hD4 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun q => T3 q (1, 0) (1, 0) (1, 0)) (\u03a64 p) p)\n (hn4x : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), |\u03a64 p (1, 0)| \u2264 n)\n (hn4y : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2016(\u03a64 p).comp (ContinuousLinearMap.inr \u211d \u211d E)\u2016 \u2264 n)\n (hH2 : r * n \u2264 1 / 20)\n (hGs : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr \u211d \u211d E)) (DG p) p)\n (hH : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr \u211d \u211d E)) (H p) p.2)\n (hHx : \u2200 x \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : \u2200 x \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5), \u2016Hx x\u2016 \u2264 m)\n (hHr : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 s \u2208 Icc (0 : \u211d) 1, HasDerivAt (fun s : \u211d => H (p.1, s \u2022 p.2)) (Hr p s) s)\n (hHrb : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 s \u2208 Icc (0 : \u211d) 1, \u2016Hr p s\u2016 \u2264 m * \u2016p.2\u2016)\n (hlam : \u2200 v : E, H (-r / 2, 0) v v \u2264 -lam * \u2016v\u2016 ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hG0cv : ConvexOn \u211d (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn \u211d (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))\n (hwcv : \u2200 v : E, ConvexOn \u211d (Icc (-2 * r - \u03b5) (2 * r + \u03b5))\n (fun t => Df (t, 0) (0, v) + m * \u2016v\u2016 / 2 * t ^ 2))\n (hwcc : \u2200 v : E, ConcaveOn \u211d (Icc (-2 * r - \u03b5) (2 * r + \u03b5))\n (fun t => Df (t, 0) (0, v) - m * \u2016v\u2016 / 2 * t ^ 2))\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n (\u2203 h : \u211d \u2192 E, \u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5), h x \u2208 Metric.ball (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2227\n \u2200 h : \u211d \u2192 E, (\u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5),\n h x \u2208 Metric.closedBall (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2192\n h (-r / 2) = 0 \u2227 h (r / 2) = 0 \u2227\n CapHyp f (Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r)) (-r"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "hessian_x_bound",
+ "line": 2649,
+ "source_header": "xxx_lower (\u03c8 := fun q => T3 q (1, 0) (1, 0) (1, 0)) hr hD4 hn4x hn4y hx\u2080 h2 hH2\n exact ridge_capHyp_C3 hr h\u03b5 h\u03b5r 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\u2013L6;\n- `hG0cv` and `hG0cc`, the envelope inputs of L1\u2013L2.\n\nAll six follow from `hT` and from `|f_xxx| \u2264 m` on the pin segment, and `ridge_capHyp_C5` derives\nthem. Up to v2.0 the bounds `m` were also assumed on a collar `[\u22122r \u2212 \u03b5, 2r + \u03b5]` 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 \u21a6 \u2202_y f (t, y)` have derivative `H (t, 0)` at `0`\nand `Df` have derivative `D2f (t, 0)` at `(t, 0)` for every `t \u2208 J`, where `J` is uniquely\ndifferentiable at `x \u2208 J`. If `t \u21a6 H (t, 0)` has derivative `Hx'` at `x`, then\n`Hx' v w = T3 (x, 0) [(0, v), (0, w), (1, 0)]`, so `\u2016Hx'\u2016 \u2264 m` when that block is at most\n`m \u2016v\u2016 \u2016w\u2016`. This derives v1.6's hypothesis `hHxb`. -/\ntheorem hessian_x_bound {Df : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {D2f : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {T3 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {Hx' : E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {J : Set \u211d} {m x : \u211d}\n (hJ : UniqueDiffWithinAt \u211d J x) (hxJ : x \u2208 J) (hm : 0 \u2264 m)\n (hH : \u2200 t \u2208 J, HasFDerivAt (fun y => (Df (t, y)).comp (ContinuousLinearMap.inr \u211d \u211d E))\n (H (t, 0)) 0)\n (hD2 : \u2200 t \u2208 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 `\u03c4 \u21a6 (x, \u03c4 y)`, `\u03c4 \u2208 [0, 1]`, if\n`\u03c4 \u21a6 H (x, \u03c4 y)` has derivative `Hr'` at `s`, then `Hr' v w = T3 (x, s y) [(0, v), (0, w), (0, y)]`,\nso `\u2016Hr'\u2016 \u2264 m \u2016y\u2016` when that block is at most `m \u2016v\u2016 \u2016w\u2016 \u2016y\u2016`. The identification uses derivatives\nwithin `[0, 1]`, so the endpoint `\u03c4 = 1` may lie on the sphere `\u2016y\u2016 = 2r`. This derives v1.6's\nhypothesis `hHrb`. -/\ntheorem hessian_r_bound {Df : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {D2f : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {T3 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {Hr' : E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {x m s : \u211d} {y : E}\n (hm : 0 \u2264 m) (hs : s \u2208 Icc (0 : \u211d) 1)\n (hH : \u2200 \u03c4 \u2208 Icc (0 : \u211d) 1, HasFDerivAt (fun z => (Df (x, z)).comp (ContinuousLinearMap.inr \u211d \u211d E))\n (H (x, \u03c4 \u2022 y)) (\u03c4 \u2022 y))\n (hD2 : \u2200 \u03c4 \u2208 Icc (0 : \u211d) 1, HasFDerivAt Df (D2f (x, \u03c4 \u2022 y)) (x, \u03c4 \u2022 y))\n (hD3 : \u2200 a b : \u211d \u00d7 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 \u2022 y) (0, v) (0, w) (0, y)| \u2264 m * (\u2016v\u2016 * \u2016w\u2016 * \u2016y\u2016) := hT v w\n _ = m * \u2016y\u2016 * \u2016v\u2016 * \u2016w\u2016 := by ring\n\n/-- **The envelope inputs of L1 and L5\u2013L6 from a second-derivative bound.** If the second derivative\n`T3 (t, 0) [(1, 0), u, (1, 0)]` of `t \u21a6 Df (t, 0) u` has absolute value at most `B` on `[a, c]`, then\n`Df (\u00b7, 0) u + (B/2) t\u00b2` is convex and `Df (\u00b7, 0) u \u2212 (B/2) t\u00b2` is concave there. With `u = (0, v)`\nand `B = m\u2016v\u2016` (from the block bound) this gives `hwcv` and `hwcc`. With `u = (1, 0)` and `B = m`\n(SP: `|f_xxx| \u2264 M\u2083`) it gives `hG0cv` and `hG0cc`. -/\ntheorem axis_convexConcave {Df : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {D2f : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {T3 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {a c B : \u211d} {u : \u211d \u00d7 E}\n (hD2 : \u2200 t \u2208 Icc a c, HasFDerivAt Df (D2f (t, 0)) (t, 0))\n (hD3 : \u2200 t \u2208 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 \u00b7 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 \u2264 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\u2083| \u2264 |s\u2083| + \u2016y\u2083\u2016 := 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 = [\u22122r, 2r] \u00d7 B\u0304(0, 2r)`. Assume also that on the collar\n`[\u22122r \u2212 \u03b5\u2080, 2r + \u03b5\u2080] \u00d7 B\u0304(0, 2r)` the `x`-derivative `T4` of `T3` exists and satisfies the same block\nbound with some `K \u2265 0` (SP: `f \u2208 C\u2074` near `D`, so `\u2016D\u2074 f\u2016` is bounded on a compact collar). Then the\nblock bound holds with `m + K\u03b5` on the collar of width `\u03b5 \u2264 \u03b5\u2080`. Each collar point `(x, y)` is\nwithin `\u03b5` of a point `(x\u2080, y) \u2208 D`, and the mean value inequality along `x` gives the rest. -/\ntheorem block_bound_collar {T3 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {T4 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d} {r m K \u03b5\u2080 \u03b5 : \u211d} (hr : 0 < r) (hK : 0 \u2264 K)\n (h\u03b5 : 0 \u2264 \u03b5) (h\u03b5\u03b5 : \u03b5 \u2264 \u03b5\u2080)\n (hT : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 (s\u2081 s\u2082 s\u2083 : \u211d) (y\u2081 y\u2082 y\u2083 : E),\n |T3 p (s\u2081, y\u2081) (s\u2082, y\u2082) (s\u2083, y\u2083) - s\u2081 * s\u2082 * s\u2083 * T3 p (1, 0) (1, 0) (1, 0)| \u2264\n m * ((|s\u2081| + \u2016y\u2081\u2016) * (|s\u2082| + \u2016y\u2082\u2016) * (|s\u2083| + \u2016y\u2083\u2016) - |s\u2081| * |s\u2082| * |s\u2083|))\n (hD4x : \u2200 p \u2208 Icc (-2 * r - \u03b5\u2080) (2 * r + \u03b5\u2080) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 a b c : \u211d \u00d7 E, HasDerivAt (fun t => T3 (t, p.2) a b c) (T4 p a b c) p.1)\n (hT4 : \u2200 p \u2208 Icc (-2 * r - \u03b5\u2080) (2 * r + \u03b5\u2080) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 (s\u2081 s\u2082 s\u2083 : \u211d) (y\u2081 y\u2082 y\u2083 : E),\n |T4 p (s\u2081, y\u2081) (s\u2082, y\u2082) (s\u2083, y\u2083) - s\u2081 * s\u2082 * s\u2083 * T4 p (1, 0) (1, 0) (1, 0)| \u2264\n K * ((|s\u2081| + \u2016y\u2081\u2016) * (|s\u2082| + \u2016y\u2082\u2016) * (|s\u2083| + \u2016y\u2083\u2016) - |s\u2081| * |s\u2082| * |s\u2083|)) :\n \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridge_capHyp_C5",
+ "line": 2862,
+ "source_header": "y\u2083\n have hKX : 0 \u2264 K * X := mul_nonneg hK hX\n have h3 : K * X * |x - x\u2080| \u2264 K * X * \u03b5 := mul_le_mul_of_nonneg_left hxx\u2080 hKX\n have h4 := abs_sub_abs_le_abs_sub (g x) (g x\u2080)\n show |g x| \u2264 (m + K * \u03b5) * 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| \u2264 m` on the pin segment (`hTe`, SP: `|f_xxx| \u2264 M\u2083`). The conclusion is unchanged. -/\ntheorem ridge_capHyp_C5 [FiniteDimensional \u211d E] {f : \u211d \u00d7 E \u2192 \u211d}\n {Df : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {D2f : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {T3 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {\u03a64 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {n : \u211d}\n {DG : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {Hx : \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {Hr : \u211d \u00d7 E \u2192 \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {r m lam \u03b5 : \u211d} (hr : 0 < r) (h\u03b5 : 0 < \u03b5)\n (h\u03b5r : \u03b5 \u2264 r / 2)\n (hDf : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hD2 : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)\n (hD3 : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 a b : \u211d \u00d7 E, HasFDerivAt (fun q => D2f q a b) (T3 p a b) p)\n (hT : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 (s\u2081 s\u2082 s\u2083 : \u211d) (y\u2081 y\u2082 y\u2083 : E),\n |T3 p (s\u2081, y\u2081) (s\u2082, y\u2082) (s\u2083, y\u2083) - s\u2081 * s\u2082 * s\u2083 * T3 p (1, 0) (1, 0) (1, 0)| \u2264\n m * ((|s\u2081| + \u2016y\u2081\u2016) * (|s\u2082| + \u2016y\u2082\u2016) * (|s\u2083| + \u2016y\u2083\u2016) - |s\u2081| * |s\u2082| * |s\u2083|))\n (hTe : \u2200 x \u2208 Icc (-r / 2) (r / 2), |T3 (x, 0) (1, 0) (1, 0) (1, 0)| \u2264 m)\n (hD4 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun q => T3 q (1, 0) (1, 0) (1, 0)) (\u03a64 p) p)\n (hn4x : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), |\u03a64 p (1, 0)| \u2264 n)\n (hn4y : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2016(\u03a64 p).comp (ContinuousLinearMap.inr \u211d \u211d E)\u2016 \u2264 n)\n (hH2 : r * n \u2264 1 / 20)\n (hGs : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr \u211d \u211d E)) (DG p) p)\n (hH : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr \u211d \u211d E)) (H p) p.2)\n (hHx : \u2200 x \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHr : \u2200 p \u2208 Icc (-2 * r - \u03b5) (2 * r + \u03b5) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 s \u2208 Icc (0 : \u211d) 1, HasDerivAt (fun s : \u211d => H (p.1, s \u2022 p.2)) (Hr p s) s)\n (hlam : \u2200 v : E, H (-r / 2, 0) v v \u2264 -lam * \u2016v\u2016 ^ 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 (\u2203 h : \u211d \u2192 E, \u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5), h x \u2208 Metric.ball (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2227\n \u2200 h : \u211d \u2192 E, (\u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5),\n h x \u2208 Metric.closedBall (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2192\n h (-r / 2) = 0 \u2227 h (r / 2) = 0 \u2227\n CapHyp f (Icc (-2 * r) (r / 2) \u00d7\u02e2 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\u03b5 h\u03b5r 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| \u2264 m` on the pin segment;\n- SP's `M\u2084` blocks `n`;\n- (H1) and (H2).\n\nOn a collar of some width `\u03b5\u2080 > 0`, only qualitative data are assumed: the derivatives, the strict\nderivative of `\u2202_y f`, and some bound `K \u2265 0` on the `x`-derivative of `T3` in block form (SP:\n`f \u2208 C\u2074` near `D`). Because (H1) is strict, some `\u03b5 \u2208 (0, \u03b5\u2080]` keeps `8r(m + K\u03b5)\u00b2 < \u03bb`.\n`ridge_capHyp_C5` then applies with `m + K\u03b5` (`block_bound_collar`). -/\ntheorem ridge_capHyp_D [FiniteDimensional \u211d E] {f : \u211d \u00d7 E \u2192 \u211d}\n {Df : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {D2f : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d \u00d7 E \u2192L[\u211d] \u211d}\n {T3 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {T4 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192 \u211d}\n {\u03a64 : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] \u211d} {n : \u211d}\n {DG : \u211d \u00d7 E \u2192 \u211d \u00d7 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {H : \u211d \u00d7 E \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {Hx : \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d}\n {Hr : \u211d \u00d7 E \u2192 \u211d \u2192 E \u2192L[\u211d] E \u2192L[\u211d] \u211d} {r m K lam \u03b5\u2080 : \u211d} (hr : 0 < r) (h\u03b5\u2080 : 0 < \u03b5\u2080)\n (hK : 0 \u2264 K)\n (hDf : \u2200 p \u2208 Icc (-2 * r - \u03b5\u2080) (2 * r + \u03b5\u2080) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hD2 : \u2200 p \u2208 Icc (-2 * r - \u03b5\u2080) (2 * r + \u03b5\u2080) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)\n (hD3 : \u2200 p \u2208 Icc (-2 * r - \u03b5\u2080) (2 * r + \u03b5\u2080) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 a b : \u211d \u00d7 E,\n HasFDerivAt (fun q => D2f q a b) (T3 p a b) p)\n (hD4x : \u2200 p \u2208 Icc (-2 * r - \u03b5\u2080) (2 * r + \u03b5\u2080) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 a b c : \u211d \u00d7 E, HasDerivAt (fun t => T3 (t, p.2) a b c) (T4 p a b c) p.1)\n (hT4 : \u2200 p \u2208 Icc (-2 * r - \u03b5\u2080) (2 * r + \u03b5\u2080) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 (s\u2081 s\u2082 s\u2083 : \u211d) (y\u2081 y\u2082 y\u2083 : E),\n |T4 p (s\u2081, y\u2081) (s\u2082, y\u2082) (s\u2083, y\u2083) - s\u2081 * s\u2082 * s\u2083 * T4 p (1, 0) (1, 0) (1, 0)| \u2264\n K * ((|s\u2081| + \u2016y\u2081\u2016) * (|s\u2082| + \u2016y\u2082\u2016) * (|s\u2083| + \u2016y\u2083\u2016) - |s\u2081| * |s\u2082| * |s\u2083|))\n (hT : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 (s\u2081 s\u2082 s\u2083 : \u211d) (y\u2081 y\u2082 y\u2083 : E),\n |T3 p (s\u2081, y\u2081) (s\u2082, y\u2082) (s\u2083, y\u2083) - s\u2081 * s\u2082 * s\u2083 * T3 p (1, 0) (1, 0) (1, 0)| \u2264\n m * ((|s\u2081| + \u2016y\u2081\u2016) * (|s\u2082| + \u2016y\u2082\u2016) * (|s\u2083| + \u2016y\u2083\u2016) - |s\u2081| * |s\u2082| * |s\u2083|))\n (hTe : \u2200 x \u2208 Icc (-r / 2) (r / 2), |T3 (x, 0) (1, 0) (1, 0) (1, 0)| \u2264 m)\n (hD4 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun q => T3 q (1, 0) (1, 0) (1, 0)) (\u03a64 p) p)\n (hn4x : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), |\u03a64 p (1, 0)| \u2264 n)\n (hn4y : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2016(\u03a64 p).comp (ContinuousLinearMap.inr \u211d \u211d E)\u2016 \u2264 n)\n (hH2 : r * n \u2264 1 / 20)\n (hGs : \u2200 p \u2208 Icc (-2 * r - \u03b5\u2080) (2 * r + \u03b5\u2080) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr \u211d \u211d E)) (DG p) p)\n (hH : \u2200 p \u2208 Icc (-2 * r - \u03b5\u2080) (2 * r + \u03b5\u2080) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr \u211d \u211d E)) (H p) p.2)\n (hHx : \u2200 x \u2208 Icc (-2 * r - \u03b5\u2080) (2 * r + \u03b5\u2080), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHr : \u2200 p \u2208 Icc (-2 * r - \u03b5\u2080) (2 * r + \u03b5\u2080) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 s \u2208 Icc (0 : \u211d) 1, HasDerivAt (fun s : \u211d => H (p.1, s \u2022 p.2)) (Hr p s) s)\n (hlam : \u2200 v : E, H (-r / 2, 0) v v \u2264 -lam * \u2016v\u2016 ^ 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 \u2203 \u03b5, 0 < \u03b5 \u2227 \u03b5 \u2264 \u03b5\u2080 \u2227\n (\u2203 h : \u211d \u2192 E, \u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5), h x \u2208 Metric.ball (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2227\n \u2200 h : \u211d \u2192 E, (\u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5),\n h x \u2208 Metric.closedBall (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2192\n h (-r / 2) = 0 \u2227 h (r / 2) = 0 \u2227\n CapHyp f (Icc (-2 * r) (r / 2) \u00d7\u02e2 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\u27e9\n\n\n/-! ### SP's `f \u2208 C\u2074` 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 \u2208 C\u2074` on an open `U \u2287 D` and SP's quantitative bounds on `D`, written with the iterated\nderivatives `iteratedFDeriv \u211d 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\u2074f` on the\ncompact collar. -/\n\n/-- **The block bound from the norm.** A trilinear form `B` on `\u211d \u00d7 E` with `\u2016B\u2016 \u2264 K` satisfies\nthe block bound with constant `K`. For `a = (s\u2081, y\u2081)`, `b = (s\u2082, y\u2082)`, `c = (s\u2083, y\u2083)` and\n`e = (1, 0)`:\n`|B(a, b, c) - s\u2081s\u2082s\u2083 B(e, e, e)| \u2264 K((|s\u2081| + \u2016y\u2081\u2016)(|s\u2082| + \u2016y\u2082\u2016)(|s\u2083| + \u2016y\u2083\u2016) - |s\u2081||s\u2082||s\u2083|)`.\nReplacing one slot at a time by `s\u1d62 e` leaves three terms, and each has a transverse argument\n`(0, y\u1d62)`. -/\ntheorem block_of_norm {B : ContinuousMultilinearMap \u211d (fun _ : Fin 3 => \u211d \u00d7 E) \u211d}"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "collar_subset_open",
+ "line": 3124,
+ "source_header": "0, hne, hne]\n calc _ \u2264 _ := abs_add_three _ _ _\n _ \u2264 K * \u2016y\u2081\u2016 * (|s\u2082| + \u2016y\u2082\u2016) * (|s\u2083| + \u2016y\u2083\u2016) + K * |s\u2081| * \u2016y\u2082\u2016 * (|s\u2083| + \u2016y\u2083\u2016) +\n K * |s\u2081| * |s\u2082| * \u2016y\u2083\u2016 := by gcongr\n _ = _ := by ring\n\nomit [NormedSpace \u211d E] in\n/-- **A collar inside a neighbourhood of `D`.** If an open `U` contains\n`D = [-2r, 2r] \u00d7 B\u0304(0, 2r)` and `E` is proper, then some closed collar\n`[-2r - \u03b5\u2080, 2r + \u03b5\u2080] \u00d7 B\u0304(0, 2r)` with `\u03b5\u2080 > 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 \u00b7 exact \u27e8x, \u27e8by linarith, by linarith\u27e9, by simp [h\u03b4.le]\u27e9\n refine Metric.mem_cthickening_of_dist_le (x, y) (x\u2080, y) \u03b4 _ \u27e8hx\u2080, hy\u27e9 ?_\n rw [Prod.dist_eq, dist_self, Real.dist_eq]\n exact max_le hxx\u2080 h\u03b4.le\n\n/-- **The cap from `f \u2208 C\u2074` near `D` and SP's bounds on `D` (I3's qualitative part).** Assume\nthat `f` is `C\u2074` on an open `U \u2287 D` (SP: `f \u2208 C\u2074` near `D`). Assume also SP's quantitative\nhypotheses on `D`, written with `D^k f(p)[v\u2081, \u2026, v_k] = iteratedFDeriv \u211d k f p ![v\u2081, \u2026, v_k]` and\n`e = (1, 0)`:\n- the block bound `m` on `D\u00b3f`, and `|f_xxx| \u2264 m` on the pin segment;\n- SP's `M\u2084` blocks `n`: `|D\u2074f[e, e, e, e]| \u2264 n` and `|D\u2074f[(0, v), e, e, e]| \u2264 n\u2016v\u2016`;\n- (H1): `D\u00b2f(M)[(0, v), (0, v)] \u2264 -\u03bb\u2016v\u2016\u00b2` with `8rm\u00b2 < \u03bb`; and (H2);\n- `M = (-r/2, 0)` and `S = (r/2, 0)` are critical, and `f(M) - f(S) = r\u00b3/6`.\n\nThen `ridge_capHyp_D` applies. Its collar width comes from `collar_subset_open`, and its derivative\ndata are the Fr\u00e9chet derivatives of `f` (`T3`, `T4` and `\u03a64` are slices of `D\u00b3f` and `D\u2074f`). Its\n`K` bounds `\u2016D\u2074f\u2016` on the compact collar. No derivative datum and no bound off `D` is assumed. -/\ntheorem ridge_capHyp_E [FiniteDimensional \u211d E] {f : \u211d \u00d7 E \u2192 \u211d} {U : Set (\u211d \u00d7 E)}\n {r m n lam : \u211d} (hr : 0 < r) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r) \u2286 U)\n (hf : ContDiffOn \u211d 4 f U)\n (hT : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 (s\u2081 s\u2082 s\u2083 : \u211d) (y\u2081 y\u2082 y\u2083 : E),\n |iteratedFDeriv \u211d 3 f p ![(s\u2081, y\u2081), (s\u2082, y\u2082), (s\u2083, y\u2083)] -\n s\u2081 * s\u2082 * s\u2083 * iteratedFDeriv \u211d 3 f p ![(1, 0), (1, 0), (1, 0)]| \u2264\n m * ((|s\u2081| + \u2016y\u2081\u2016) * (|s\u2082| + \u2016y\u2082\u2016) * (|s\u2083| + \u2016y\u2083\u2016) - |s\u2081| * |s\u2082| * |s\u2083|))\n (hTe : \u2200 x \u2208 Icc (-r / 2) (r / 2), |iteratedFDeriv \u211d 3 f (x, 0) ![(1, 0), (1, 0), (1, 0)]| \u2264 m)\n (hn4x : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv \u211d 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| \u2264 n)\n (hn4y : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 v : E,\n |iteratedFDeriv \u211d 4 f p ![(0, v), (1, 0), (1, 0), (1, 0)]| \u2264 n * \u2016v\u2016)\n (hH2 : r * n \u2264 1 / 20)\n (hlam : \u2200 v : E, iteratedFDeriv \u211d 2 f (-r / 2, 0) ![(0, v), (0, v)] \u2264 -lam * \u2016v\u2016 ^ 2)\n (hH1 : 8 * r * m ^ 2 < lam)\n (hM : fderiv \u211d f (-r / 2, 0) = 0) (hS : fderiv \u211d f (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n \u2203 \u03b5, 0 < \u03b5 \u2227\n (\u2203 h : \u211d \u2192 E, \u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5), h x \u2208 Metric.ball (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2227\n \u2200 h : \u211d \u2192 E, (\u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5),\n h x \u2208 Metric.closedBall (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2192\n h (-r / 2) = 0 \u2227 h (r / 2) = 0 \u2227\n CapHyp f (Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBa"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "toyF",
+ "line": 3315,
+ "source_header": "f := fun s : \u211d => ((p.1, s \u2022 p.2) : \u211d \u00d7 E)) s (dD3 _ hmem) hp'))\n (fun v => by\n have h := hlam v\n rw [\u2190 hD2] at h\n exact h)\n hH1 hM hS hnorm\n obtain \u27e8\u03b5, h\u03b5, -, hrest\u27e9 := key\n exact \u27e8\u03b5, h\u03b5, hrest\u27e9\n\nend Slice\n\n/-! ### A concrete instance and the necessity of each hypothesis\n\nOn `\u211d`, `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 \u21a6 3t` from `0` to `3"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "toy_frontier",
+ "line": 3342,
+ "source_header": ") \u2264 t := t.2.1\n show -1 \u2264 max (-|3 * (t : \u211d)|) (3 * (t : \u211d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "toy_capHyp",
+ "line": 3344,
+ "source_header": "t : \u211d)) 1 with h | h\n \u00b7 refine le_max_of_le_left ?_\n rw [abs_of_nonneg (by linarith)]\n linarith\n \u00b7 exact le_max_of_le_right (by linarith)\n\ntheorem toy_front"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "toy_saddle_strict",
+ "line": 3363,
+ "source_header": "(-|(-2 : \u211d)|) ((-2 : \u211d) - 2) \u2264 -1\n norm_num [abs_of_neg]\n \u00b7 show max (-|(1 : \u211d)|) ((1 : \u211d) - 2) \u2264 -1\n norm_num\n older := by\n show (0 : \u211d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "toy_saddle_cut",
+ "line": 3372,
+ "source_header": "_saddle_strict : \u2200 x \u2208 frontier (Icc (-2 : \u211d) 1), x \u2260 1 \u2192 toyF x < -1 := by\n intro x hx hne\n rw [toy_frontier] at hx\n rcases hx with rfl | h\n \u00b7 show max (-|(-2 : \u211d)|) ((-2 : \u211d) - 2) < -1\n norm_num [abs_of_neg]\n \u00b7 exact absurd h hne\n\n/-- In the toy, removing `S = 1` from `{f \u2265 -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 : \u211d) \u2208 connectedComponentIn ({x | (-1 : \u211d) \u2264 toyF x} \\ {1}) 0 \u2227\n \u2200 w \u2208"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "toy_f_M",
+ "line": 3383,
+ "source_header": ") \u2264 toyF x} \\ {1}) 0, toyF w \u2264"
+ },
+ {
+ "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 : \u211d)|) ((0 : \u211d) - 2) = 0\n norm_num\n\ntheorem toy_f_S : toyF 1 = -1 := by\n show max (-|(1 : \u211d)|) ((1 : \u211d) - 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 \u00b7 rintro \u27e8-, hub\u27e9\n have hmem : (-1 : \u211d) \u2208 connectionLevels toyF 0 0 :=\n \u27e83, toyRidge, toy_capHyp.older, toy_ridge_ge\u27e9\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\u27e9\n rw [toy_f_M] at h1\n norm_num at h1\n \u00b7 rintro \u27e8-, hub\u27e9\n have hmem : (0 : \u211d) \u2208 connectionLevels toyF 0 (-1 / 2) :=\n \u27e80, Path.refl 0, by rw [toy_f_M]; norm_num, fun t => by simp [toy_f_M]\u27e9\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 `\u2265 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, ?_, ?_\u27e9\n \u00b7 rintro \u27e8\u03b3, h\u03b3\u27e9\n have h0 := h\u03b3 0\n rw [Path.source, toy_f_M] at h0\n norm_num at h0\n \u00b7 rintro \u27e8hmem, -\u27e9\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\u00b3/3 - x/4 - y\u00b2`, ridge `h = 0`, ridge derivative `F x = x\u00b2 - 1/4`. -/\nnoncomputable def ridgeToyF (p : \u211d \u00d7 \u211d) : \u211d := 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 [\u2190 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 : \u211d) \u2264 x + 2) (by linarith : (0 : \u211d) \u2264 2 - x)]\n \u00b7 simp\n \u00b7 simp only [ridgeToyF]\n norm_num\n\n/--"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridgeToy_joint",
+ "line": 3523,
+ "source_header": "^ 2 = 4 := by rw [\u2190 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 : \u211d) \u2264 x + 2) (by linarith : (0 : \u211d) \u2264 2 - x)]\n \u00b7 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\u00b2 - 1/4) \u00b7 dx`. Its\ntransverse part vanishes (the ridge equation), and `D x (1, 0) = x\u00b2 - 1/4 = F x`. -/\ntheorem ridgeToy_joint (x : \u211d) :\n HasFDer"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridgeToy_slices",
+ "line": 3546,
+ "source_header": "hasDerivAt_pow 2 (0 : \u211d)\n have h1 := hu.comp_hasFDerivAt ((x, (0 : \u211d)) : \u211d \u00d7 \u211d) (hasFDerivAt_fst (\ud835\udd5c := \u211d))\n have h2 := hv.comp_hasFDerivAt ((x, (0 : \u211d)) : \u211d \u00d7 \u211d) (hasFDerivAt_snd (\ud835\udd5c := \u211d))\n convert h1.sub h2 using 1\n \u00b7 funext p; simp [ridgeToyF]\n \u00b7 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 `\u03b4 = 2` (each slice is\n`-y\u00b2` plus a constant), `w = 0`, `\u03c9 = 0`, and the curvature condition\n`2\u03b4(b - s) = 2/3 < 16 = (2r\u03b4 - \u03c9)\u00b2`. The combined theorems re-derive (C1)\u2013(C3) and (C2\u207a). -/\ntheorem ridgeToy_slices :\n CapHyp ridgeToyF (Icc (-2 * 1) (1 / 2"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "spToyF",
+ "line": 3589,
+ "source_header": "4) (convex_closedBall (0 : \u211d) (2 * 1))).congr ?_\n intro y _\n simp only [ridgeToyF, Real.norm_eq_abs, sq_abs]\n ring\n \u00b7 intro x _\n simp\n \u00b7 intro x _\n simp\n \u00b7 norm_num\n \u00b7 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\u00b3/3 - x/4 - 12 y\u00b2`, so `m = 2`\n(`f_xxx = 2`), `\u03b4 = 24 > r m (8m - 5) = 22` at `r = 1`, and gap exactly `r\u00b3/6`. -/\nnoncomputable def spToyF (p : \u211d \u00d7 \u211d) : \u211d := 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\u00b2 - 1/4`, `m = 2` and `\u03b4 = 24`. -/\ntheorem spToy_capHyp :\n CapHyp spToyF (Icc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "spToy_normalized",
+ "line": 3654,
+ "source_header": "veOn \u211d univ (fun t : \u211d => -(\u2016v\u2016 \u2022 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 \u00b7 simp only [spToyF]\n norm_num\n\n\n/-- **`ridge_capHyp_normalized` is not vacuous.** `spToyF` meets every hypothesis, with\n`G0 = x\u00b2 - 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 \u211d univ (fun t : \u211d => -(\u2016v\u2016 \u2022 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 \u00b7 simp only [spToyF]\n norm_num\n\n\n/-- A field meeting (H1): `f (x, y) = x\u00b3/3 - x/4 - 20 y\u00b2`, so `\u03bb = 40 > 8 r m\u00b2 = 32` at `r = 1`,\n`m = 2`, and gap exactly `r\u00b3/6`. -/\nnoncomputable def h1ToyF (p : \u211d \u00d7 \u211d) : \u211d := 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\u00b2 - 1/4`, `m = 2` and `\u03bb = 40`. -/\ntheorem h1Toy_capHyp :\n CapHyp h1Toy"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "h1Toy_ridge_differentiable",
+ "line": 3812,
+ "source_header": "ConcaveOn \u211d univ (fun t : \u211d => -(\u2016v\u2016 \u2022 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 \u00b7 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 \u00b7 snd`, `\u03b4 = 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 : \u211d) 3) \u2227 Icc (-2 * (1 : \u211d)) (2 * 1) \u2286 Ioo (-3) 3 \u2227\n (\u2200 x \u2208 Ioo (-3 : \u211d) 3,\n StrongConcaveOn (Metric.closedBall (0 : \u211d) (2 * 1)) 40 (fun y => h1ToyF (x, y))) \u2227\n (\u2200 x \u2208 Ioo (-3 : \u211d) 3, (0 : \u211d) \u2208 Metric.closedBall (0 : \u211d) (2 * 1)) \u2227\n (\u2200 x \u2208 Ioo (-3 : \u211d) 3, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : \u211d \u2192L[\u211d] \u211d) 0) \u2227\n (\u2200 x \u2208 Icc (-2 * (1 : \u211d)) (2 * 1), (0 : \u211d) \u2208 Metric.ball (0 : \u211d) (2 * 1)) \u2227\n (\u2200 x \u2208 Icc (-2 * (1 : \u211d)) (2 * 1), \u2200\u1da0 v in nhds (x, (0 : \u211d)),\n HasFDerivAt (fun y => h1ToyF (v.1, y)) (ContinuousLinearMap.mul \u211d \u211d (-40 * v.2)) v.2) \u2227\n (\u2200 x \u2208 Icc (-2 * (1 : \u211d)) (2 * 1),\n HasStrictFDerivAt (fun p : \u211d \u00d7 \u211d => ContinuousLinearMap.mul \u211d \u211d (-40 * p.2))\n (((-40 : \u211d) \u2022 ContinuousLinearMap.mul \u211d \u211d) \u2218L ContinuousLinearMap.snd \u211d \u211d \u211d) (x, 0)) \u2227\n (\u2200 v : \u211d, ((((-40 : \u211d) \u2022 ContinuousLinearMap.mul \u211d \u211d) \u2218L ContinuousLinearMap.snd \u211d \u211d \u211d) \u2218L\n ContinuousLinearMap.inr \u211d \u211d \u211d) v v \u2264 -40 * \u2016v\u2016 ^ 2) \u2227\n \u2200 x \u2208 Icc (-2 * (1 : \u211d)) (2 * 1), HasStrictFDerivAt (fun _ : \u211d => (0 : \u211d))"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "h1Toy_source",
+ "line": 3887,
+ "source_header": "-40 * p.2))\n (DG := fun _ => ((-40 : \u211d) \u2022 ContinuousLinearMap.mul \u211d \u211d) \u2218L ContinuousLinearMap.snd \u211d \u211d \u211d)\n (h := fun _ => (0 : \u211d)) (U := Ioo (-3) 3) (r := 1) (\u03b4 := 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] \u00d7 B\u0304(0, 2)` (`\u03b5 = 1/2`): joint derivative `(x\u00b2 - 1/4, -40y)`, transverse gradient `-40y`\nwith derivative `-40 \u00b7 snd`, constant transverse Hessian `-40`, `m = 2`, `\u03bb = 40 > 32`, pins\n`(\u22131/2, 0)` and gap `1/6`. The theorem then gives the ridge, and for `h = 0`, which meets L12\n(`F = x\u00b2 - 1/4`), the cap with `M = (-1/2, 0)`. -/\ntheorem h1Toy_source :\n (\u2203 h : \u211d \u2192 \u211d, \u2200 x \u2208 Ioo (-2 * 1 - 1 / 2 : \u211d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "h1Toy_C3",
+ "line": 3987,
+ "source_header": "nly [smul_eq_mul]\n simp\n \u00b7 intro v\n have hc : ConcaveOn \u211d univ (fun t : \u211d => -(\u2016v\u2016 \u2022 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 `\u03b5 = 1/2`: besides the data of `h1Toy_source`, second derivative\n`D\u00b2f = diag(2x, -40)`, third derivatives `T a b = 2 a\u2081 b\u2081 \u00b7 fst` (only `f_xxx = 2 \u2265 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 (\u2203 h : \u211d \u2192 \u211d, \u2200 x \u2208 Ioo (-2 * 1 - 1 / 2 :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "h1Toy_C4",
+ "line": 4132,
+ "source_header": "only [smul_eq_mul]\n simp\n \u00b7 intro v\n have hc : ConcaveOn \u211d univ (fun t : \u211d => -(\u2016v\u2016 \u2022 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 `\u03b5 = 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 \u2265 7/4` supplied. -/\ntheorem h1Toy_C4 :\n (\u2203 h : \u211d \u2192 \u211d, \u2200 x \u2208 Ioo (-2 * 1 - 1 / 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "h1Toy_D",
+ "line": 4278,
+ "source_header": "mp only [smul_eq_mul]\n simp\n \u00b7 intro v\n have hc : ConcaveOn \u211d univ (fun t : \u211d => -(\u2016v\u2016 \u2022 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`\u03b5\u2080 = 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 `(\u22122 \u2212 \u03b5, 2 + \u03b5)` for some\n`\u03b5 > 0` and the cap with `M = (\u22121/2, 0)`, from hypotheses on `D` and qualitative collar data only. -/\ntheorem h1Toy_D :\n (\u2203 \u03b5 > 0, \u2203 h : \u211d \u2192 \u211d, \u2200 x \u2208 Ioo (-2 *"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "h1Toy_E",
+ "line": 4400,
+ "source_header": "e hcrit0 : \u2200 x : \u211d, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : \u211d \u2192L[\u211d] \u211d) 0 := by\n intro x\n have := slice_hasFDerivAt (hDf (x, 0))\n convert this using 1\n ext\n simp\n obtain \u27e8-, -, hC, -\u27e9 := hcap (fun _ => 0) (fun x _ => \u27e8by simp, hcrit0 x\u27e9)\n exact \u27e8\u27e8\u03b5, h\u03b5, hex\u27e9, hC\u27e9\n\n\n/-- **`ridge_capHyp_E` is not vacuous.** `h1ToyF` is a polynomial, so it is `C\u2074` on `U = \u211d\u00b2`.\nIts third derivative is `D\u00b3f[a, b, c] = 2 a.1 b.1 c.1` and its fourth derivative vanishes, so\n`m = 2` and `n = 0`; `D\u00b2f[(0, v), (0, v)] = -40 v\u00b2` gives `\u03bb = 40`. From these hypotheses on `D`\nalone, the theorem gives the ridge on `(-2 - \u03b5, 2 + \u03b5)` for some `\u03b5 > 0` and the cap with\n`M = (-1/2, 0)`. -/\ntheorem h1Toy_E :\n (\u2203 \u03b5 > 0, \u2203 h : \u211d \u2192 \u211d, \u2200 x \u2208 Ioo (-2"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "quarticToyF",
+ "line": 4503,
+ "source_header": "ave hcrit0 : \u2200 x : \u211d, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : \u211d \u2192L[\u211d] \u211d) 0 := by\n intro x\n have := slice_hasFDerivAt (hDf (x, 0))\n convert this using 1\n ext\n simp\n obtain \u27e8-, -, hC, -\u27e9 := hcap (fun _ => 0) (fun x _ => \u27e8by simp, hcrit0 x\u27e9)\n exact \u27e8\u27e8\u03b5,"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "quarticToy_E",
+ "line": 4510,
+ "source_header": "`q(x) = (x\u00b2 - 1/4)\u00b2/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\u2074f = 1/20 \u2260 0`. -/\nnoncomputable def quarticToyF (p : \u211d \u00d7 \u211d) : \u211d :=\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\u2074f = 1/20` is nonzero, and (H2) holds with\nequality, `rn = 1/20` (`r = 1`, `n = 1/20`); `|f_xxx| \u2264 81/40 = m` on the pin segment, and (H1) holds\nas `8m\u00b2 = 32.805 < 40 = \u03bb`. So `fxxx_lower`'s estimate is used with `n > 0` and the collar bound\n`K` is positive, unlike `h1Toy_E` (where `D\u2074f = 0`). The theorem gives the ridge on\n`(-2 - \u03b5, 2 + \u03b5)` for some `\u03b5 > 0` and the cap with `M = (-1/2, 0)`. -/\ntheorem quarticToy_E :\n (\u2203 \u03b5 > 0, \u2203 h : \u211d \u2192 \u211d, \u2200 x \u2208 Ioo (-2 * 1 - \u03b5 : \u211d) (2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "of_const_mul",
+ "line": 4648,
+ "source_header": "`f(M) \u2212 f(S) = k r\u00b3`.\n`ridge_capHyp_E` is the case `k = 1/6`. A positive factor `f \u21a6 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 \u27e8\u03b3, h\u03b3\u27e9 := H.ridge\n exact \u27e8\u03b3, fun t => le_of_mul_le_mul_left (h\u03b3 t) hc\u27e9\n\nend CapHyp\n\nsection GapK\n\nvariable {E : Type"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "iteratedFDeriv_const_mul_of_isOpen",
+ "line": 4678,
+ "source_header": "t \u03c6 (0 : E \u2192L[\u211d] \u211d) y := by\n constructor\n \u00b7 intro h\n have h' := h.const_mul c\u207b\u00b9\n rw [smul_zero] at h'\n exact h'.congr_of_eventuallyEq\n (Filter.Eventually.of_forall fun y => (inv_mul_cancel_left\u2080 hc (\u03c6 y)).symm)\n \u00b7 intro h\n have h' := h.const_mul c\n rwa [smul_zero] at h'\n\n/-- On an open set where `f \u2208 C\u2074`, the derivatives of order `\u2264"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridge_capHyp_K",
+ "line": 4687,
+ "source_header": "f U) (c : \u211d) {i : \u2115} (hi : i \u2264 4) {p : \u211d \u00d7 E} (hp : p \u2208 U) :\n iteratedFDeriv \u211d i (fun q => c * f q) p = c \u2022 iteratedFDeriv \u211d i f p := by\n have hfa : ContDiffAt \u211d 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 \u00a77's event `G_r`). With the pin gap\n`f(M) \u2212 f(S) = k r\u00b3`, the hypotheses `(4/(3k)) r m\u00b2 < \u03bb` and `r n \u2264 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 \u211d E] {f : \u211d \u00d7 E \u2192 \u211d} {U : Set (\u211d \u00d7 E)}\n {r k m n lam : \u211d} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r) \u2286 U)\n (hf : ContDiffOn \u211d 4 f U)\n (hT : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2200 (s\u2081 s\u2082 s\u2083 : \u211d) (y\u2081 y\u2082 y\u2083 : E),\n |iteratedFDeriv \u211d 3 f p ![(s\u2081, y\u2081), (s\u2082, y\u2082), (s\u2083, y\u2083)] -\n s\u2081 * s\u2082 * s\u2083 * iteratedFDeriv \u211d 3 f p ![(1, 0), (1, 0), (1, 0)]| \u2264\n m * ((|s\u2081| + \u2016y\u2081\u2016) * (|s\u2082| + \u2016y\u2082\u2016) * (|s\u2083| + \u2016y\u2083\u2016) - |s\u2081| * |s\u2082| * |s\u2083|))\n (hTe : \u2200 x \u2208 Icc (-r / 2) (r / 2), |iteratedFDeriv \u211d 3 f (x, 0) ![(1, 0), (1, 0), (1, 0)]| \u2264 m)\n (hn4x : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv \u211d 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| \u2264 n)\n (hn4y : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 v : E,\n |iteratedFDeriv \u211d 4 f p ![(0, v), (1, 0), (1, 0), (1, 0)]| \u2264 n * \u2016v\u2016)\n (hH2 : r * n \u2264 3 * k / 10)\n (hlam : \u2200 v : E, iteratedFDeriv \u211d 2 f (-r / 2, 0) ![(0, v), (0, v)] \u2264 -lam * \u2016v\u2016 ^ 2)\n (hH1 : 4 / (3 * k) * r * m ^ 2 < lam)\n (hM : fderiv \u211d f (-r / 2, 0) = 0) (hS : fderiv \u211d f (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = k * r ^ 3) :\n \u2203 \u03b5, 0 < \u03b5 \u2227\n (\u2203 h : \u211d \u2192 E, \u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5), h x \u2208 Metric.ball (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2227\n \u2200 h : \u211d \u2192 E, (\u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5),\n h x \u2208 Metric.closedBall (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2192\n h (-r / 2) = 0 \u2227 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\u27e9\u27e9\n \u00b7 intro h hh\n obtain \u27e8h1, h2, hC, hfr\u27e9 := hcap h fun x hx =>\n \u27e8(hh x hx).1, (hasFDerivAt_zero_const_mul_iff hc.ne').2 (hh x hx).2\u27e9\n exact \u27e8h1, h2, hC.of_const_mul hc, fun x hx hne => lt_of_mul_lt_mul_left (hfr x hx hne) hc.le\u27e9\n\n/-- **P \u00a77's `G_r` with operator norms.** If `\u2016D\u00b3f\u2016 \u2264 M3` and `\u2016D\u2074f\u2016 \u2264 M4` on\n`D = [\u22122r, 2r] \u00d7 B\u0304(0, 2r)`, then `(4/(3k)) r M3\u00b2 < \u03bb` and `r M4 \u2264 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 \u211d E] {f : \u211d \u00d7 E \u2192 \u211d} {U : Set (\u211d \u00d7 E)}\n {r k M3 M4 lam : \u211d} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r) \u2286 U)\n (hf : ContDiffOn \u211d 4 f U)\n (h3 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2016iteratedFDeriv \u211d 3 f p\u2016 \u2264 M3)\n (h4 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n \u2016iteratedFDeriv \u211d 4 f p\u2016 \u2264 M4)\n (hH2 : r * M4 \u2264 3 * k / 10)\n (hlam : \u2200 v : E, iteratedFDeriv \u211d 2 f (-r / 2, 0) ![(0, v), (0, v)] \u2264 -lam * \u2016v\u2016 ^ 2)\n (hH1 : 4 / (3 * k) * r * M3 ^ 2 < lam)\n (hM : fderiv \u211d f (-r / 2, 0) = 0) (hS : fderiv \u211d f (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = k * r ^ 3) :\n \u2203 \u03b5, 0 < \u03b5 \u2227\n (\u2203 h : \u211d \u2192 E, \u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5), h x \u2208 Metric.ball (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2227\n \u2200 h : \u211d \u2192 E, (\u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5),\n h x \u2208 Metric.closedBall (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2192\n h (-r / 2) = 0 \u2227 h (r"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "iteratedFDeriv_three_swap\u2081\u2082",
+ "line": 4866,
+ "source_header": "ng the symmetry of\n`D\u00b3f`, which holds for `f \u2208 C\u00b3` (`iteratedFDeriv_three_swap\u2081\u2082`, `iteratedFDeriv_three_swap\u2082\u2083`).\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 \u211d F]\n\n/-- The third derivative of a `C"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "iteratedFDeriv_three_swap\u2082\u2083",
+ "line": 4881,
+ "source_header": "eratedFDeriv \u211d 3 f p ![x, y, c] =\n iteratedFDeriv \u211d 2 (fderiv \u211d 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\u00b3` 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 [\u2190 key, \u2190 key, hev.fderiv_eq]\n\nvariable {E : Type*} [NormedAddCommGroup E] [NormedSpace \u211d E]\n\n/-- **CAP's partial blocks give the block inequality.** For a symmetric trilinear form `B` on\n`\u211d \u00d7 E`, bounds by `m` on the three partial blocks with `c = 1, 2, 3` transverse slots, namely\n`|B[(0, y), e, e]| \u2264 m\u2016y\u2016`, `|B[(0, y\u2081), (0, y\u2082), e]| \u2264 m\u2016y\u2081\u2016\u2016y\u2082\u2016` and\n`|B[(0, y\u2081), (0, y\u2082), (0, y\u2083)]| \u2264 m\u2016y\u2081\u2016\u2016y\u2082\u2016\u2016y\u2083\u2016` with `e = (1, 0)`, give the block inequality `hT` of\n`ridge_capHyp_E` and `ridge_capHyp_K`. The proof expands `B[(s\u2081, y\u2081), (s\u2082, y\u2082), (s\u2083, y\u2083)]`\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(\u03a0(|s\u1d62| + \u2016y\u1d62\u2016) \u2212 \u03a0|s\u1d62|)`. No sign of `m` is\nassumed. -/\ntheorem block_of_partial {B : ContinuousMultilinearMap \u211d (fun _ : Fin 3 => \u211d \u00d7 E) \u211d} {m : \u211d}\n (hs\u2081\u2082 : \u2200 a b c : \u211d \u00d7 E, B ![a, b, c] = B ![b, a, c])\n (hs\u2082\u2083 : \u2200 a b c : \u211d \u00d7 E, B ![a, b, c] = B ![a, c, b])\n (k\u2081 : \u2200 y : E, |B ![((0 : \u211d), y), (1, 0), (1, 0)]| \u2264 m * \u2016y\u2016)\n (k\u2082 : \u2200 y\u2081 y\u2082 : E, |B ![((0 : \u211d), y\u2081), (0, y\u2082), (1, 0)]| \u2264 m"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ridge_capHyp_blocks",
+ "line": 5004,
+ "source_header": "_)\n \u00b7 rw [abs_mul]; exact mul_le_mul_of_nonneg_left b\u2083 (abs_nonneg _)\n \u00b7 exact b\u2084\n \u00b7 rw [abs_mul, abs_mul]; exact mul_le_mul_of_nonneg_left b\u2085 (by positivity)\n \u00b7 rw [abs_mul]; exact mul_le_mul_of_nonneg_left b\u2086 (abs_nonneg _)\n \u00b7 rw [abs_mul, abs_mul]; exact mul_le_mul_of_nonneg_left b\u2087 (by positivity)\n\n/-- **The cap under CAP (1) as written.** `f \u2208 C\u2074` on an open `U \u2287 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 `\u03bb` at `M`; and (1),\n`(4/(3k)) r M3\u00b2 < \u03bb` and `r M4 \u2264 3k/10`, for the pin gap `k r\u00b3`. The conclusion is that of\n`ridge_capHyp_K`. -/\ntheorem ridge_capHyp_blocks [FiniteDimensional \u211d E] {f : \u211d \u00d7 E \u2192 \u211d} {U : Set (\u211d \u00d7 E)}\n {r k M3 M4 lam : \u211d} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r) \u2286 U)\n (hf : ContDiffOn \u211d 4 f U)\n (h30 : \u2200 x \u2208 Icc (-r / 2) (r / 2), |iteratedFDeriv \u211d 3 f (x, 0) ![(1, 0), (1, 0), (1, 0)]| \u2264 M3)\n (h31 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 y : E,\n |iteratedFDeriv \u211d 3 f p ![(0, y), (1, 0), (1, 0)]| \u2264 M3 * \u2016y\u2016)\n (h32 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 y\u2081 y\u2082 : E,\n |iteratedFDeriv \u211d 3 f p ![(0, y\u2081), (0, y\u2082), (1, 0)]| \u2264 M3 * \u2016y\u2081\u2016 * \u2016y\u2082\u2016)\n (h33 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 y\u2081 y\u2082 y\u2083 : E,\n |iteratedFDeriv \u211d 3 f p ![(0, y\u2081), (0, y\u2082), (0, y\u2083)]| \u2264 M3 * \u2016y\u2081\u2016 * \u2016y\u2082\u2016 * \u2016y\u2083\u2016)\n (h40 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv \u211d 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| \u2264 M4)\n (h41 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 v : E,\n |iteratedFDeriv \u211d 4 f p ![(0, v), (1, 0), (1, 0), (1, 0)]| \u2264 M4 * \u2016v\u2016)\n (hlam : \u2200 v : E, iteratedFDeriv \u211d 2 f (-r / 2, 0) ![(0, v), (0, v)] \u2264 -lam * \u2016v\u2016 ^ 2)\n (hH1 : 4 / (3 * k) * r * M3 ^ 2 < lam) (hH2 : r * M4 \u2264 3 * k / 10)\n (hM : fderiv \u211d f (-r / 2, 0) = 0) (hS : fderiv \u211d f (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = k * r ^ 3) :\n \u2203 \u03b5, 0 < \u03b5 \u2227\n (\u2203 h : \u211d \u2192 E, \u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5), h x \u2208 Metric.ball (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2227\n \u2200 h : \u211d \u2192 E, (\u2200 x \u2208 Ioo (-2 * r - \u03b5) (2 * r + \u03b5),\n h x \u2208 Metric.closedBall (0 : E) (2 * r) \u2227\n HasFDerivAt (fun y => f (x, y)) (0 : E \u2192L[\u211d] \u211d) (h x)) \u2192\n h (-r / 2) ="
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "mixedToyF",
+ "line": 5048,
+ "source_header": "\u2083 => ?_) h30 h40 h41 hH2 hlam\n hH1 hM hS hnorm\n have hp3 : ContDiffAt \u211d 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\u2081 s\u2082 s\u2083 y\u2081 y\u2082 y\u2083\n\nend PartialBlock\n\n/-- A toy with a nonzero mixed block. `x\u00b3/3 \u2212 x/4 \u2212 20y\u00b2` plus `xy\u00b2`: the pins and the gap `1/6` are\nunchanged, and `\u2202_x D_y\u00b2 f = 2`. -/\nnoncomputable def mixedToyF (p : \u211d \u00d7 \u211d) : \u211d :=\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\u00b3f` are `2` (`c = 0`), `0` (`c = 1`), `2` (`c = 2`, the mixed block `\u2202_x D_y\u00b2 f`) and `0`\n(`c = 3`), so `M3 = 2`; `D\u2074f = 0`, so `M4 = 0`; and `\u03bb = 41`. CAP (1) holds with `k = 1/6`, `r = 1`:\n`8 M3\u00b2 = 32 < 41` and `r M4 = 0 \u2264 1/20`. Unlike `h1Toy_E` and `quarticToy_E`, the block inequality\n`hT` is not trivial here, since the mixed terms of `D\u00b3f` do not vanish. -/\ntheorem mixedToy_blocks :\n (\u2203 \u03b5 > 0, \u2203 h : \u211d \u2192"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "addCircle_locallyConnectedSpace",
+ "line": 5184,
+ "source_header": "h\u03b5, hex, hcap\u27e9 := hsrc\n have hcrit0 : \u2200 x : \u211d, HasFDerivAt (fun y => mixedToyF (x, y)) (0 : \u211d \u2192L[\u211d] \u211d) 0 := by\n intro x\n have := slice_hasFDerivAt (hDf (x, 0))\n convert this using 1\n ext\n simp\n obtain \u27e8-, -, hC, -\u27e9 := hcap (fun _ => 0) (fun x _ => \u27e8by simp, hcrit0 x\u27e9)\n exact \u27e8\u27e8\u03b5, h\u03b5, hex\u27e9, hC\u27e9\n\n/-! ### v2.6: the cap and the elder death level on the torus, under CAP (1)\n\nP \u00a77 applies the cap theorem to the periodic lift of the field on `(\u211d/L\u2124)^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 `\u03c6 : \u211d \u00d7 E \u2243\u209c \u211d^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`\u211d`, and local connectedness passes to coinduced topologies. -/\ntheorem addCircle_locallyConnectedSpace (L : \u211d) : LocallyConnectedSp"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_capHyp_blocks",
+ "line": 5208,
+ "source_header": "cted spaces. -/\ntheorem torus_locallyConnectedSpace (L : \u211d) (d : \u2115) :\n LocallyConnectedSpace (Fin d \u2192 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 \u211d E]\n\n/-- **The cap on the torus under CAP (1).** Let `\u03c6 : \u211d \u00d7 E \u2243\u209c \u211d^d` be any frame and let\n`g = f \u2218 torusCover L d \u2218 \u03c6` be the lift of a function `f` on the torus `(\u211d/L\u2124)^d`. If `g` meets\nthe hypotheses of `ridge_capHyp_blocks` (CAP \u00a71's (1) with its partial-block norms, in the frame\n`\u03c6`), then `f` satisfies (C1)\u2013(C3) on the image of the cap in the torus, with `M` and `S` the images\nof the pins, and (C2\u207a): every other frontier point of the image is strictly below `f(S)`. -/\ntheorem torus_capHyp_blocks [FiniteDimensional \u211d E] {L : \u211d} {d : \u2115}\n (\u03c6 : \u211d \u00d7 E \u2243\u209c (Fin d \u2192 \u211d)) {f : (Fin d \u2192 AddCircle L) \u2192 \u211d} {g : \u211d \u00d7 E \u2192 \u211d}\n (hg : \u2200 p, g p = f (torusCover L d (\u03c6 p))) {U : Set (\u211d \u00d7 E)}\n {r k M3 M4 lam : \u211d} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r) \u2286 U)\n (hf : ContDiffOn \u211d 4 g U)\n (h30 : \u2200 x \u2208 Icc (-r / 2) (r / 2), |iteratedFDeriv \u211d 3 g (x, 0) ![(1, 0), (1, 0), (1, 0)]| \u2264 M3)\n (h31 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 y : E,\n |iteratedFDeriv \u211d 3 g p ![(0, y), (1, 0), (1, 0)]| \u2264 M3 * \u2016y\u2016)\n (h32 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 y\u2081 y\u2082 : E,\n |iteratedFDeriv \u211d 3 g p ![(0, y\u2081), (0, y\u2082), (1, 0)]| \u2264 M3 * \u2016y\u2081\u2016 * \u2016y\u2082\u2016)\n (h33 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 y\u2081 y\u2082 y\u2083 : E,\n |iteratedFDeriv \u211d 3 g p ![(0, y\u2081), (0, y\u2082), (0, y\u2083)]| \u2264 M3 * \u2016y\u2081\u2016 * \u2016y\u2082\u2016 * \u2016y\u2083\u2016)\n (h40 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv \u211d 4 g p ![(1, 0), (1, 0), (1, 0), (1, 0)]| \u2264 M4)\n (h41 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 v : E,\n |iteratedFDeriv \u211d 4 g p ![(0, v), (1, 0), (1, 0), (1, 0)]| \u2264 M4 * \u2016v\u2016)\n (hlam : \u2200 v : E, iteratedFDeriv \u211d 2 g (-r / 2, 0) ![(0, v), (0, v)] \u2264 -lam * \u2016v\u2016 ^ 2)\n (hH1 : 4 / (3 * k) * r * M3 ^ 2 < lam) (hH2 : r * M4 \u2264 3 * k / 10)\n (hM : fderiv \u211d g (-r / 2, 0) = 0) (hS : fderiv \u211d g (r / 2, 0) = 0)\n (hnorm : g (-r / 2, 0) - g (r / 2, 0) = k * r ^ 3) :\n \u2203 z, CapHyp f ((torusCover L d \u2218 \u03c6) '' (Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r)))"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_elder_death_level_blocks",
+ "line": 5251,
+ "source_header": "\u03c6) := funext hg\n subst hgf\n have hK : IsCompact (Icc (-2 * r) (r / 2) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r)) :=\n isCompact_Icc.prod (isCompact_closedBall 0 (2 * r))\n exact \u27e8_, hC.toTorus \u03c6 hK, CapHyp.map_saddle ((torusCover_continuous L d).comp \u03c6.continuous)\n ((torusCover_isOpenMap L d).comp \u03c6.isOpenMap) hK hSf\u27e9\n\n/-- **The elder death level on the torus under CAP (1).** For `L > 0` and a continuous `f` on\n`(\u211d/L\u2124)^d` whose lift in the frame `\u03c6` meets CAP \u00a71'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 \u211d E] {L : \u211d} [Fact (0 < L)] {d : \u2115}\n (\u03c6 : \u211d \u00d7 E \u2243\u209c (Fin d \u2192 \u211d)) {f : (Fin d \u2192 AddCircle L) \u2192 \u211d} (hfc : Continuous f)\n {g : \u211d \u00d7 E \u2192 \u211d} (hg : \u2200 p, g p = f (torusCover L d (\u03c6 p))) {U : Set (\u211d \u00d7 E)}\n {r k M3 M4 lam : \u211d} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r) \u2286 U)\n (hf : ContDiffOn \u211d 4 g U)\n (h30 : \u2200 x \u2208 Icc (-r / 2) (r / 2), |iteratedFDeriv \u211d 3 g (x, 0) ![(1, 0), (1, 0), (1, 0)]| \u2264 M3)\n (h31 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 y : E,\n |iteratedFDeriv \u211d 3 g p ![(0, y), (1, 0), (1, 0)]| \u2264 M3 * \u2016y\u2016)\n (h32 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 y\u2081 y\u2082 : E,\n |iteratedFDeriv \u211d 3 g p ![(0, y\u2081), (0, y\u2082), (1, 0)]| \u2264 M3 * \u2016y\u2081\u2016 * \u2016y\u2082\u2016)\n (h33 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 y\u2081 y\u2082 y\u2083 : E,\n |iteratedFDeriv \u211d 3 g p ![(0, y\u2081), (0, y\u2082), (0, y\u2083)]| \u2264 M3 * \u2016y\u2081\u2016 * \u2016y\u2082\u2016 * \u2016y\u2083\u2016)\n (h40 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv \u211d 4 g p ![(1, 0), (1, 0), (1, 0), (1, 0)]| \u2264 M4)\n (h41 : \u2200 p \u2208 Icc (-2 * r) (2 * r) \u00d7\u02e2 Metric.closedBall (0 : E) (2 * r), \u2200 v : E,\n |iteratedFDeriv \u211d 4 g p ![(0, v), (1, 0), (1, 0), (1, 0)]| \u2264 M4 * \u2016v\u2016)\n (hlam : \u2200 v : E, iteratedFDeriv \u211d 2 g (-r / 2, 0) ![(0, v), (0, v)] \u2264 -lam * \u2016"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "circleChart",
+ "line": 5285,
+ "source_header": "atest (CapHyp.olderPeakLevels f (torusCover L d (\u03c6 (-r / 2, 0))))\n (f (torusCover L d (\u03c6 (r / 2, 0)))) := by\n obtain \u27e8z, H, -\u27e9 := torus_capHyp_blocks \u03c6 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 : \u211d) (\u03b8 : AddCircle L) : \u211d :=\n \u2016\u03b8 + ((L / 4 : \u211d) : AddCircle L)\u2016 - 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 : \u2016((x + L / 4 : \u211d) : AddCircle L)\u2016 = |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 [\u2190 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 \u00b7 funext q\n simp only [mixedToyF, Pi.sub_apply, Pi.add_apply, Pi.mul_apply]\n ring\n \u00b7 ext <;> simp\n ring\n\n/-- `mixedToyF` is `C\u2074`. -/\ntheorem mixedToy_contDiff : ContDif"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "mixedToy_iteratedFDeriv_three",
+ "line": 5365,
+ "source_header": "h2.smul_const (ContinuousLinearMap.snd \u211d \u211d \u211d))\n have hfd : fderiv \u211d mixedToyF = fun p => (p.1 ^ 2 - 1 / 4 + p.2 ^ 2) \u2022\n ContinuousLinearMap.fst \u211d \u211d \u211d + (-40 * p.2 + 2 * p.1 * p.2) \u2022 ContinuousLinearMap.snd \u211d \u211d \u211d :=\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) \u2022 ContinuousLinearMap.fst \u211d \u211d \u211d +\n (2 * ((m 1).1 * (m 2).2 + (m 1).2 * (m 2).1)) \u2022\n ContinuousLinearMap.snd \u211d \u211d \u211d).hasFDerivAt"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torusToyF",
+ "line": 5398,
+ "source_header": "(Fin.tail m)) =\n fun _ => iteratedFDeriv \u211d 3 mixedToyF x (Fin.tail m) := by\n funext y; rw [mixedToy_iteratedFDeriv_three, mixedToy_iteratedFDeriv_three]\n have hg : HasFDerivAt (fun y => iteratedFDeriv \u211d 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 `(\u211d/16\u2124)\u00b2` whose lift equals `mixedToyF` on `(\u22124, 4)\u00b2`:\n`mixedToyF` read through `circleChart` in each coordinate. It is continuous. -/\nnoncomputable def torusToyF (\u03b8 : Fin 2 \u2192 AddCircle (16 : \u211d)) : \u211d :=\n mixedToyF (circleChart 16 (\u03b8 0), circleChart 16 (\u03b8 1))\n\n/-- **A concrete instance of the elder death level on the torus.** On `(\u211d/16\u2124)\u00b2`, with the standard\nframe `\u211d \u00d7 \u211d \u2243\u209c \u211d\u00b2`, 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 `\u03bb = 41`. `torus_elder_death_level_blocks`\nthen gives the death level of the class born at the image of `M = (\u22121/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."
+ ]
+ },
+ {
+ "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 : \u2115) : E d \u2243L[\u211d] (Fin d \u2192 \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinates_latticeVec",
+ "line": 20,
+ "source_header": "l\n\ntheorem coordinates_latticeVec (d : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124) :\n coordinates d (latticeVec d L n) = fun i => L * (n i : \u211d"
+ },
+ {
+ "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 : \u2115) (L : \u211d) (\u03c9 : SmoothSample d L) (x : E d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_smooth",
+ "line": 29,
+ "source_header": "x)\n\ntheorem actualField_smooth (d : \u2115) {L : \u211d} (hL : 0 < L)\n (\u03c9 : SmoothSample d L) : IsSmooth d (actualField d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_periodic",
+ "line": 35,
+ "source_header": "iff\n\ntheorem actualField_periodic (d : \u2115) {L : \u211d} (hL : 0 < L)\n (\u03c9 : 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 : \u2115) (L : \u211d) (x : E d) :\n Measurable (fun \u03c9 => actualField d L \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_eval_hasGaussianLaw",
+ "line": 48,
+ "source_header": "L)\n\ntheorem actualField_eval_hasGaussianLaw (d : \u2115) {L : \u211d} (hL : 0 < L)\n (x : E d) : HasGaussianLaw (fun \u03c9 => actualField d L \u03c9 x) (smoothLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_linearCombination_measurable",
+ "line": 53,
+ "source_header": "l 0\n\ntheorem actualField_linearCombination_measurable (d : \u2115) (L : \u211d) {m : \u2115}\n (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d) :\n Measurable (fun \u03c9 => \u2211 i, a i * actualField d L \u03c9 (x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_linearCombination_hasGaussianLaw",
+ "line": 59,
+ "source_header": ")))\n\ntheorem actualField_linearCombination_hasGaussianLaw (d : \u2115) {L : \u211d}\n (hL : 0 < L) {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d) :\n HasGaussianLaw (fun \u03c9 => \u2211 i, a i * actualField d L \u03c9 (x i)) (smoothLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_integral_zero",
+ "line": 73,
+ "source_header": "map\n\ntheorem actualField_integral_zero (d : \u2115) {L : \u211d} (hL : 0 < L) (x : E d) :\n \u222b \u03c9, actualField d L \u03c9 x \u2202smoothLaw d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_linearCombination_integral_zero",
+ "line": 82,
+ "source_header": "x)\n\ntheorem actualField_linearCombination_integral_zero (d : \u2115) {L : \u211d}\n (hL : 0 < L) {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d) :\n \u222b \u03c9, (\u2211 i, a i * actualField d L \u03c9 (x i)) \u2202smoothLaw d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_covariance_spectral",
+ "line": 90,
+ "source_header": "ro]\n\ntheorem actualField_covariance_spectral (d : \u2115) {L : \u211d} (hL : 0 < L)\n (x y : E d) :\n cov[fun \u03c9 => actualField d L \u03c9 x, fun \u03c9 => actualField d L \u03c9 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 : \u2115) {L : \u211d} (hL : 0 < L)\n (x y : E d) :\n cov[fun \u03c9 => actualField d L \u03c9 x, fun \u03c9 => actualField d L \u03c9 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 : \u2115) {L : \u211d} (hL : 0 < L)\n (x y : E d) :\n \u222b \u03c9, actualField d L \u03c9 x * actualField d L \u03c9 y \u2202smoothLaw 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 : \u2115) {L : \u211d} (hL : 0 < L)\n {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d) :\n Var[fun \u03c9 => \u2211 i, a i * actualField d L \u03c9 (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 : \u2115) {L : \u211d} (hL : 0 < L)\n {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d) :\n 0 \u2264 covQuadForm d L x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_linearCombination_map",
+ "line": 50,
+ "source_header": "_\n\ntheorem actualField_linearCombination_map (d : \u2115) {L : \u211d} (hL : 0 < L)\n {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d) :\n (smoothLaw d L).map (fun \u03c9 => \u2211 i, a i * actualField d L \u03c9 (x i)) =\n gaussianReal 0 \u27e8covQuadForm 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 : \u2115) (L : \u211d) (hL : 0 < L) :\n GaussianFieldInterface d L where"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualGaussianFieldInterface_exists",
+ "line": 76,
+ "source_header": "hL\n\ntheorem actualGaussianFieldInterface_exists (d : \u2115) (L : \u211d) (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 \u211d (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : \u2115) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "latticeVec",
+ "line": 77,
+ "source_header": "in d)\n\n/-- The lattice vector `L n` for `n \u2208 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 : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "thetaSum",
+ "line": 86,
+ "source_header": "i : \u211d))\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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) {m : \u2115} (x : Fin m \u2192 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 : \u2115) (L : \u211d) (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 `\u22a4`).\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 : \u2115) (g"
+ },
+ {
+ "kind": "structure",
+ "unqualified_name": "GaussianFieldInterface",
+ "line": 138,
+ "source_header": "\u2115, ContDiff \u211d 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 : \u2115) (L : \u211d) where\n /-- The underlying probability space (sample space). -/\n \u03a9 : 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\u03a9`.\n [m\u03a9 : MeasurableSpace \u03a9]\n /-- The probability measure `P`. -/\n P : Measure \u03a9\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `\u03c9 \u21a6 f_\u03c9 : R^d \u2192 \u211d`. -/\n F : \u03a9 \u2192 E d \u2192 \u211d\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : \u2200 \u03c9, IsSmooth d (F \u03c9)\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 : \u2200 \u03c9, IsLPeriodic d L (F \u03c9)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : \u2200 z : E d, Summable (fun n : Fin d \u2192 \u2124 => Real.exp (-(\u2016z + latticeVec d L n\u2016 ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : \u2200 {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d), 0 \u2264 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 : \u2200 {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d),\n Measure.map (fun \u03c9 => \u2211 i, a i * F \u03c9 (x i)) P =\n ProbabilityTheory.gaussianReal 0 \u27e8covQuadForm d L x a, quad_nonneg x a\u27e9\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : \u2200 x y : E d, \u222b \u03c9, F \u03c9 x * F \u03c9"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "hessian",
+ "line": 180,
+ "source_header": "y \u2202P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fr\u00e9chet\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": ": \u211d :=\n iteratedFDeriv \u211d 2 g x ![v, w]\n\n/-- Critical point: vanishing Fr\u00e9chet 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": "\u211d) (x : E d) : Prop :=\n fderiv \u211d 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": "(\u2200 w \u2208 W, w \u2260 0 \u2192 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 \u2227 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 \u2227 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": ": \u2115) (r : \u211d) (u : E d) : E d :=\n -((r / 2) \u2022 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 : \u2115) (r : \u211d) (u : E d) : E d :=\n (r / 2) \u2022 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 : \u2115) (g : E d \u2192 \u211d) (M S : E d) : \u211d :=\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 \u2227 IsIndexSaddle d g S \u2227 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 \u2192\n 0 < torusDist d L x y \u2192 g x \u2260 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 : \u2115) (L : \u211d) 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 \u2192 \u211d) \u2192 E d \u2192 \u211d\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 \u2192 \u211d) \u2192 E d \u2192 Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d \u2192 \u211d) \u2192 E d \u2192 E d \u2192 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192\n \u2200 M : E d, IsEssential g M \u2194 \u2200 y : E d, g y \u2264 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192\n \u2200 M : E d, \u00ac IsEssential g M \u2192 \u2200 h : \u211d,\n h < deathHeight g M \u2194\n \u2203 y : E d, g M < g y \u2227 \u2203 \u03b3 : Path M y, \u2200 t : unitInterval, h < g (\u03b3 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192 IsMorseDistinct d L g \u2192\n \u2200 M S : E d, ElderPartner g M S \u2194\n (IsNond"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "IsFiniteBar",
+ "line": 351,
+ "source_header": "gMax d g M \u2227 IsIndexSaddle d g S \u2227 \u00ac IsEssential g M \u2227 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`\u00ac 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 \u2227 0 < heightGap d g M S \u2227 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 : \u2115) (L : \u211d) (Pai"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pairCount",
+ "line": 374,
+ "source_header": "ndDomain d L \u2227 p.2 \u2208 FundDomain d L \u2227 Pair g p.1 p.2 \u2227 heightGap d g p.1 p.2 \u2208 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 \u2192 Prop)\n (g : E d \u2192 \u211d) (A : Set \u211d) : \u2115 :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `\u03bd` 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, `\u03bd` is integrable on every Borel `A \u2286 (0, \u221e)`, and\n`\u222b_A \u03bd = 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\u03a9` (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 : \u2115) (L : \u211d) (G : Gau"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "IsWindowPair",
+ "line": 407,
+ "source_header": "A \u2227\n \u222b \u2113 in A, \u03bd \u2113 = (\u222b \u03c9, ((pairCount d L Pair (G.F \u03c9) A : \u2115) : \u211d) \u2202G.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 <= \u03c1`, 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": ": \u211d) (g : E d \u2192 \u211d) (M S : E d) : Prop :=\n IsCandidatePair d L g M S \u2227 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 \u2264 p \u2264 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 : \u2115) (L : \u211d) (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 : \u211d \u2192 \u211d \u2192 \u211d \u2192 OrthonormalBasis (Fin d) \u211d (E d) \u2192 \u211d\n /-- `p` is a probability: nonnegative. -/\n p_nonneg : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (E d)), 0 \u2264 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 : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (E d)), p r b k R \u2264 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 \u2265 2`, `L > 0`,\ncompact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo \u2264 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 \u2264 r_*`, `b \u2208 B`, `k \u2208 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 `\u03bdc`, `\u03bde` with `\u03bdc(\u2113) ~ c_{B,K} \u2113^(-1/3)`,\n`\u03bde(\u2113) ~ c_{B,K} \u2113^(-1/3)` as `\u2113 \u2193 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and\n`0 \u2264 \u03bdc(\u2113) - \u03bde(\u2113) \u2264 C_{B,K} \u2113^(2/3)` for all sufficiently small `\u2113 > 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 `\u03bdc`, `\u03bde` 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 : \u211d, 0 < \u2113Star \u2227 \u2200 \u2113 : \u211d, 0 < \u2113 \u2192 \u2113 \u2264 \u2113Star \u2192\n 0 \u2264 \u03bdc \u2113 - \u03bde \u2113 \u2227 \u03bdc \u2113 - \u03bde \u2113 \u2264 C * \u2113 ^ ((2 : \u211d) / 3)\n\n/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and\nversions `\u03bdc`, `\u03bde` of the unrestricted candidate density and of the finite ordinary\nsuperlevel H0 bar density satisfy `\u03bdc(\u2113) ~ c \u2113^(-1/3)` and `\u03bde(\u2113) ~ c \u2113^(-1/3)` as `\u2113 \u2193 0`.\nThe essential global-maximum class is excluded from `\u03bde` 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": "\u2227\n Asymptotics.IsEquivalent (nhdsWithin (0 : \u211d) (Set.Ioi 0)) \u03bde\n (fun \u2113 : \u211d => c * \u2113 ^ ((-1 : \u211d) / 3))\n\n/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for\nfixed `d \u2265 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 `\u03bd(\u2113) ~ c_{d,L} \u2113^(-1/3)` as `\u2113 \u2193 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 \u2264 d \u2192 0 < L \u2192 \u2203 c : \u211d, 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 \u2265 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 < \u2113 \u2264 ell_*`,\n`|\u03bdc(\u2113) - c \u2113^(-1/3)| \u2264 C`, `0 \u2264 \u03bdc(\u2113) - \u03bde(\u2113) \u2264 C` and `|\u03bde(\u2113) - c \u2113^(-1/3)| \u2264 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 * \u2113 ^ ((-1 : \u211d) / 3)| \u2264 C \u2227\n 0 \u2264 \u03bdc \u2113 - \u03bde \u2113 \u2227 \u03bdc \u2113 - \u03bde \u2113 \u2264 C \u2227\n |\u03bde \u2113 - c * \u2113 ^ ((-1 : \u211d) / 3)| \u2264 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 \u2208 [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) \u2265 c r^3` for all\n`0 < r \u2264 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} \u2113^(2/3) \u2264 \u03bdc(\u2113) - \u03bde(\u2113) \u2264 C_{B,K} \u2113^(2/3)` for all `0 < \u2113 \u2264 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 : \u211d) (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 : \u2115"
+ },
+ {
+ "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 : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124) : torus_"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_field_latticeVec_formula",
+ "line": 26,
+ "source_header": "\u211d))\n\ntheorem torus_field_latticeVec_formula (d : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124) :\n torus_latticeVec d L n = \u2211 i, EuclideanSpace.single i (L * (n i :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torus_periodBasis",
+ "line": 29,
+ "source_header": "rfl\n\ndef torus_periodBasis (d : \u2115) (L : \u211d) (hL : 0 < L) :\n Module.Basis (Fin d) \u211d (torus_E"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torus_periodLattice",
+ "line": 34,
+ "source_header": "e')\n\ndef torus_periodLattice (d : \u2115) (L : \u211d) (hL : 0 < L) : Submodule \u2124 (torus_E"
+ },
+ {
+ "kind": "abbrev",
+ "unqualified_name": "torus_quotient",
+ "line": 37,
+ "source_header": "L))\n\nabbrev torus_quotient (d : \u2115) (L : \u211d) (hL : 0 <"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torus_proj",
+ "line": 40,
+ "source_header": "oup\n\ndef torus_proj (d : \u2115) (L : \u211d) (hL : 0 < L) : torus_E d \u2192 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 : \u2115) (L : \u211d) (hL : 0 < L)\n (n : Fin d \u2192 \u2124) :\n \u2211 i, n i \u2022 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 : \u2115) (L : \u211d) (hL : 0 < L) (x : torus_E d) :\n x \u2208 torus_periodLattice d L hL \u2194 \u2203 n : Fin d \u2192 \u2124, torus_latticeVec d L"
+ },
+ {
+ "kind": "instance",
+ "unqualified_name": "torus_lattice_discrete",
+ "line": 68,
+ "source_header": "eVec]\n\ninstance torus_lattice_discrete (d : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (hL : 0 < L) :\n IsZLattice \u211d (torus_periodLattice d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_proj_surjective",
+ "line": 83,
+ "source_header": "tance\n\ntheorem torus_proj_surjective (d : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (hL : 0 < L) (x y : torus_E d) :\n torus_proj d L hL x = torus_proj d L hL y \u2194\n \u2203 n : Fin d \u2192 \u2124, y = x + torus_latticeVec"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_control_lattice_translate",
+ "line": 102,
+ "source_header": "abel\u27e9\n\n/-- Duplicate representatives have exactly the same quotient image. -/\ntheorem torus_control_lattice_translate (d : \u2115) (L : \u211d) (hL : 0 < L)\n (x : torus_E d) (n : Fin d \u2192 \u2124) :\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": "\u27e9).symm\n\ntheorem torus_proj_isCoveringMap (d : \u2115) (L : \u211d) (hL : 0 < L) :\n IsCoveringMap (torus_proj"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_compact",
+ "line": 114,
+ "source_header": "ringMap\n\ntheorem torus_compact (d : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (g : torus_E d \u2192"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_field_periodic_formula",
+ "line": 129,
+ "source_header": "n) = g x\n\ntheorem torus_field_periodic_formula (d : \u2115) (L : \u211d) (g : torus_E d \u2192 \u211d) :\n torus_isPeriodic d L g \u2194\n \u2200 (x : EuclideanSpace \u211d (Fin d)) (n : Fin d \u2192 \u2124),\n g (x + \u2211 i, EuclideanSpace.single i (L * (n i : \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_periodic_respects",
+ "line": 134,
+ "source_header": "= Iff.rfl\n\ntheorem torus_periodic_respects (d : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (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 : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (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 : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (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 : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (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 : \u2115) (L : \u211d) (hL : 0 < L)\n {M : torus_E d} {y : torus_quotient d L hL}\n (\u03b3 : Path (torus_proj d L hL M) y) :\n \u2203 z : torus_E d, \u2203 \u0393 : Path M z,\n torus_proj d L hL z = y \u2227\n \u2200 t : unitInterval, torus_proj d L hL"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_control_constant_path_endpoint",
+ "line": 169,
+ "source_header": "\u03b3.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 : \u2115) (L : \u211d) (hL : 0 < L)\n {M z : torus_E d} (\u0393 : Path M z)\n (h\u0393 : \u2200 t : unitInterval, torus_proj d L hL (\u0393 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 : \u2115) (L : \u211d) (hL : 0 < L)\n (M : torus_E d) (n : Fin d \u2192 \u2124) (hn : torus_latticeVec d L n \u2260 0) :\n torus_proj d L hL (M + torus_latticeVec d L n) = torus_proj d L hL M \u2227\n \u00ac \u2203 \u0393 : Path M (M + torus_latticeVec d L n),\n \u2200 t : unitInterval, torus_proj d L hL (\u0393 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 : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (hg : torus_isPeriodic d L g) (M : torus_E d) (P : \u211d \u2192 Prop) :\n (\u2203 y : torus_E d, g M < g y \u2227 \u2203 \u03b3 : Path M y, \u2200 t : unitInterval, P (g (\u03b3 t))) \u2194\n (\u2203 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 \u2227\n \u2203 \u03b3 : Path (torus_proj d L hL M) y,\n \u2200 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 : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : \u211d) :\n (\u2203 y : torus_E d, g M < g y \u2227 \u2203 \u03b3 : Path M y, \u2200 t : unitInterval, h < g (\u03b3 t)) \u2194\n (\u2203 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 \u2227\n \u2203 \u03b3 : Path (torus_proj d L hL M) y,\n \u2200 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 : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : \u211d) :\n (\u2203 y : torus_E d, g M < g y \u2227 \u2203 \u03b3 : Path M y, \u2200 t : unitInterval, h \u2264 g (\u03b3 t)) \u2194\n (\u2203 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 \u2227\n \u2203 \u03b3 : Path (torus_proj d L hL M) y,\n \u2200 t : unitInterval, h \u2264 torus_descend d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torus_global_max_iff",
+ "line": 234,
+ "source_header": "(fun a => h \u2264 a)\n\ntheorem torus_global_max_iff (d : \u2115) (L : \u211d) (hL : 0 < L)\n (g : torus_E d \u2192 \u211d) (hg : torus_isPeriodic d L g) (M : torus_E d) :\n (\u2200 y : torus_E d, g y \u2264 g M) \u2194\n \u2200 y : torus_quotient d L hL,\n torus_descend d L hL g hg y \u2264 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} \u2964 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 \u27f6 Y) (q : ZerothHomotopy X) :\n Sigma.\u03b9 (fun _ : ZerothHomotopy X => R) q \u226b\n (ordinaryH0_componentCoproductFunctor R).map f =\n Sigma.\u03b9 (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 \u2192 \u211d) (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 \u2192 \u211d) (R : C) {s t : \u211d} (hst : s \u2264 t)\n (q : ZerothHomotopy (superlevel_set g s)) :\n Sigma.\u03b9 (fun _ : ZerothHomotopy (superlevel_set g s) => R) q \u226b\n (ordinaryH0_componentFiltration g R).map (homOfLE hst) =\n Sigma.\u03b9 (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 _\u298b0\u298c) :\n R \u27f6 S"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ordinaryH0_simplicialPointClass_iso",
+ "line": 107,
+ "source_header": ").homology\u03c0 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 _\u298b0\u298c) :\n ordinaryH0_simplicialPointClass S R x \u226b (S.homology\u2080Iso R).hom =\n Sigma.\u03b9 (fun _ : S.\u03c0\u2080 => R)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ordinaryH0_simplicialPointClass_map",
+ "line": 117,
+ "source_header": "y\u2080Iso_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 \u27f6 T) (x : S _\u298b0\u298c) :\n ordinaryH0_simplicialPointClass S R x \u226b 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 \u27f6 Y) (x : X) :\n (TopCat.toSSet.map f).app _ (TopCat.toSSetObj\u2080Equiv.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 \u27f6 ((singularHomologyFunc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ordinaryH0_pointClass_map",
+ "line": 144,
+ "source_header": "SSetObj\u2080Equiv.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 \u27f6 Y) (x : X) :\n ordinaryH0_pointClass X R x \u226b ((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 \u226b (TopCat.singularHomology\u2080Iso X R).hom =\n Sigma.\u03b9 (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.\u03b9 (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk x) \u226b\n (TopCat.singularHomology\u2080Iso 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 \u27f6 A}\n (h : \u2200 x : X, ordinaryH0_pointClass X R x \u226b 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 \u27f6 Y) :\n ((singularHomologyFunctor C 0).obj R).map f \u226b\n (TopCat.singularHomology\u2080Iso Y R).hom =\n (TopCat.singularHomology\u2080Iso X R).hom \u226b\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 \u2245 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 \u226b"
+ },
+ {
+ "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 : (\ud835\udfd9 R : R \u27f6 R) \u2260 0) (x :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ordinaryH0_pointClass_eq_of_component_eq",
+ "line": 236,
+ "source_header": ", zero_comp] at h\u03b5\n exact hR h\u03b5.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 : (\ud835\udfd9 R : R \u27f6 R) \u2260 0) (x y : X)\n (hxy : ZerothHomotopy.mk x \u2260 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 \u226b 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 : (\ud835\udfd9 R : R \u27f6 R) \u2260 0) (x y : X) :\n ordinaryH0_pointClass X R x = ordinaryH0_pointClass X R y \u2194"
+ },
+ {
+ "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 \u27f6 Y) (x y : X) :\n (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) \u226b\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 : (\ud835\udfd9 R : R \u27f6 R) \u2260 0)\n {X Y : TopCat.{w}} (f : X \u27f6 Y) (x y : X) :\n (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) \u226b\n ((singularHomologyFunctor C 0).obj R).map f = 0 \u2194"
+ },
+ {
+ "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 \u2192 \u211d) (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 \u2192 \u211d) (R : C) {s t : \u211d} (hst : s \u2264 t) :\n (superlevel_h0Filtration g R).map (homOfLE hst) \u226b\n (ordinaryH0_filtrationIso g R).hom.app t =\n (ordinaryH0_filtrationIso g R).hom.app s \u226b\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 \u2192 \u211d) (R : C)\n (hR : (\ud835\udfd9 R : R \u27f6 R) \u2260 0) {s t : \u211d} (hst : s \u2264 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) \u226b\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 : \u2115} {g : E d \u2192 \u211d} (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 : \u2115) (L : \u211d) : 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 : \u2115) (L : \u211d) :\n Nonempty (SuperlevelBarInterfa"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "superlevelBarField_deathHeight_eq",
+ "line": 79,
+ "source_header": "ce d L\u27e9\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 : \u2115} {L : \u211d} (g : E d \u2192 \u211d) (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 : \u2115} {L : \u211d} (g : E d \u2192 \u211d) (M : E d) :\n (superlevelBarField_interface d L).IsEssential g M \u2194 \u2200 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 : \u2115} {L : \u211d} (g : E d \u2192 \u211d) (M S : E d) :\n (superlevelBarField_interface d L).ElderPartner g M S \u2194\n (IsNondegMax d g M \u2227 IsIndexSaddle d g S \u2227 \u00ac superlevelBar_isEssential g M \u2227\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 : \u2115} {L : \u211d} (I : SuperlevelBarInterface d L)\n (g : E d \u2192 \u211d) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d) :\n I.IsEssential g M \u2194 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 : \u2115} {L : \u211d} (I : SuperlevelBarInterface d L)\n (g : E d \u2192 \u211d) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d)\n (hM : \u00ac 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 : \u2115} {L : \u211d} (I : SuperlevelBarInterface d L)\n (g : E d \u2192 \u211d) (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 \u2194 (superlevelBarField_interface d L)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "superlevelBarField_shift",
+ "line": 139,
+ "source_header": "hne').trans hdeath\u27e9\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 : \u2115) (L c : \u211d) : 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 : \u2115) (L c b : \u211d) (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 : \u2115) (b : \u211d) : 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 : \u2115) (L b : \u211d) :\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 : \u2115) (L : \u211d) (M : E d) :\n IsSmooth d (fun _ : E d => (0 : \u211d)) \u2227 IsLPeriodic d L (fun _ : E d => (0 : \u211d)) \u2227\n (superlevelBarField_interface d L).IsEssential (fun _ => (0 : \u211d)) M \u2227\n (superlevelBarField_shift d L 1).IsEssential (fun _ => (0 : \u211d)) M \u2227\n (superlevelBarField_interface d L).deathHeight (fun _ => (0 : \u211d)) M = 0 \u2227\n (superlevelBarField_shift d L 1).deathHeight (fun _ => (0 : \u211d)) M = 1 \u2227\n (superlevelBarField_interface d L).deathHeight (fun _ => (0 : \u211d)) M \u2260\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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (M : superlevelBar_E d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "superlevelBar_clearanceSet",
+ "line": 49,
+ "source_header": "\u2264 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (M : superlevelBar_E d)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "superlevelBar_deathHeight",
+ "line": 56,
+ "source_header": "(\u03b3 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (M : superlevelBar_E d) :\n superlevelBar_isEssential g M \u2194 \u2200 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (M : superlevelBar_E d) {h : \u211d} (hh : h \u2208 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\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\u27e9\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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (M : superlevelBar_E d)\n (he : superlevelBar_clearanceSet g M = \u2205) : 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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) {M y : superlevelBar_E d} (\u03b3 : Path M y) :\n \u2203 t\u2080 : unitInterval, \u2200 t : unitInt"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "superlevelBar_clearance_nonempty",
+ "line": 142,
+ "source_header": "=> hmin (Set.mem_univ t)\u27e9\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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : \u00ac 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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (hg : Continuous g) (M : superlevelBar_E d) :\n (superlevelBar_clearanceSet g M).Nonempty \u2194 \u00ac"
+ },
+ {
+ "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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (M : superlevelBar_E d) {h c : \u211d} (hhc : h < c)\n (hc : c \u2208 superlevelBar_clearanceSet g M) : h \u2208"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "superlevelBar_clearance_improve",
+ "line": 183,
+ "source_header": ", \u03b3, fun t => hhc.trans (h\u03b3 t)\u27e9\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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) (M : superlevelBar_E d) {h : \u211d}\n (hh : h \u2208 superlevelBar_clearanceSet g M) :\n \u2203 c : \u211d, h < c \u2227 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : \u00ac superlevelBar_isEssential g M) (h : \u211d) :\n h < superlevelBar_deathHeight g M \u2194"
+ },
+ {
+ "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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : \u00ac 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : \u00ac 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 : \u2115}\n (g : superlevelBar_E d \u2192 \u211d) (hg : Continuous g) (M : superlevelBar_E d)\n (hM : \u00ac 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 : \u2115} (g : superlevelBar_E d \u2192 \u211d)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : \u00ac superlevelBar_isEssential g M) (a : \u211d)\n (ha : \u2200 h : \u211d, h < a \u2194 h \u2208 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 : \u2115) (b : \u211d) (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 : \u2115) (M : superlevelBar_E d) :\n superlevelBar_deathHeight (fun _ : superlevelBar_E d => (-1 : \u211d)) M = 0 \u2227\n \u00ac 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 \u211d (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : \u2115) : T"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "latticeVec",
+ "line": 49,
+ "source_header": "d)\n\n/-- The lattice vector `L n` for `n \u2208 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 : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "thetaSum",
+ "line": 58,
+ "source_header": ": \u211d))\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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) {m : \u2115} (x : Fin m \u2192 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 : \u2115) (L : \u211d) (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 `\u22a4`).\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 : \u2115) (g :"
+ },
+ {
+ "kind": "structure",
+ "unqualified_name": "GaussianFieldInterface",
+ "line": 110,
+ "source_header": "ContDiff \u211d 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 : \u2115) (L : \u211d) where\n /-- The underlying probability space (sample space). -/\n \u03a9 : 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\u03a9`.\n [m\u03a9 : MeasurableSpace \u03a9]\n /-- The probability measure `P`. -/\n P : Measure \u03a9\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `\u03c9 \u21a6 f_\u03c9 : R^d \u2192 \u211d`. -/\n F : \u03a9 \u2192 E d \u2192 \u211d\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : \u2200 \u03c9, IsSmooth d (F \u03c9)\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 : \u2200 \u03c9, IsLPeriodic d L (F \u03c9)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : \u2200 z : E d, Summable (fun n : Fin d \u2192 \u2124 => Real.exp (-(\u2016z + latticeVec d L n\u2016 ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : \u2200 {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d), 0 \u2264 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 : \u2200 {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d),\n Measure.map (fun \u03c9 => \u2211 i, a i * F \u03c9 (x i)) P =\n ProbabilityTheory.gaussianReal 0 \u27e8covQuadForm d L x a, quad_nonneg x a\u27e9\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : \u2200 x y : E d, \u222b \u03c9, F \u03c9 x * F \u03c9 y"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "hessian",
+ "line": 152,
+ "source_header": "\u2202P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fr\u00e9chet\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": "\u211d :=\n iteratedFDeriv \u211d 2 g x ![v, w]\n\n/-- Critical point: vanishing Fr\u00e9chet 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 \u211d 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": "(\u2200 w \u2208 W, w \u2260 0 \u2192 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 \u2227 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 \u2227 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": "\u2115) (r : \u211d) (u : E d) : E d :=\n -((r / 2) \u2022 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 : \u2115) (r : \u211d) (u : E d) : E d :=\n (r / 2) \u2022 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 : \u2115) (g : E d \u2192 \u211d) (M S : E d) : \u211d :=\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 \u2227 IsIndexSaddle d g S \u2227 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 \u2192\n 0 < torusDist d L x y \u2192 g x \u2260 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 : \u2115) (L : \u211d) 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 \u2192 \u211d) \u2192 E d \u2192 \u211d\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 \u2192 \u211d) \u2192 E d \u2192 Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d \u2192 \u211d) \u2192 E d \u2192 E d \u2192 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192\n \u2200 M : E d, IsEssential g M \u2194 \u2200 y : E d, g y \u2264 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192\n \u2200 M : E d, \u00ac IsEssential g M \u2192 \u2200 h : \u211d,\n h < deathHeight g M \u2194\n \u2203 y : E d, g M < g y \u2227 \u2203 \u03b3 : Path M y, \u2200 t : unitInterval, h < g (\u03b3 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192 IsMorseDistinct d L g \u2192\n \u2200 M S : E d, ElderPartner g M S \u2194\n (IsNondeg"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "IsFiniteBar",
+ "line": 323,
+ "source_header": "ax d g M \u2227 IsIndexSaddle d g S \u2227 \u00ac IsEssential g M \u2227 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`\u00ac 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 \u2227 0 < heightGap d g M S \u2227 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 : \u2115) (L : \u211d) (Pair"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pairCount",
+ "line": 346,
+ "source_header": "Domain d L \u2227 p.2 \u2208 FundDomain d L \u2227 Pair g p.1 p.2 \u2227 heightGap d g p.1 p.2 \u2208 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 : \u2115"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "IsLifetimeDensityVersion",
+ "line": 357,
+ "source_header": "d \u2192 Prop)\n (g : E d \u2192 \u211d) (A : Set \u211d) : \u2115 :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `\u03bd` 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, `\u03bd` is integrable on every Borel `A \u2286 (0, \u221e)`, and\n`\u222b_A \u03bd = 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\u03a9` (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 : \u2115) (L : \u211d) (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 : \u211d) : 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 : \u211d) : 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 : \u211d} (ht : \u00ac 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 : \u211d) {s t : \u211d} (hst : s \u2264 t) :\n elderFiber k m d s \u2192\u2097[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 : \u211d) : \u211d \u2964 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 : \u211d} (ht : elderActive m d t) :\n k \u2192\u2097[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 : \u211d} (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 : \u211d) : \u00ac elderAc"
+ },
+ {
+ "kind": "structure",
+ "unqualified_name": "ElderTrap",
+ "line": 100,
+ "source_header": "X) (m d : \u211d)\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 \u2208 D\n older_outside : P \u2209 D\n height_ceiling : \u2200 x \u2208 D, g x \u2264 m\n active_clopen : \u2200 t, elderActive m d t \u2192\n IsClopen {x : superlevel_set g t | x.val \u2208 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 : \u211d}\n (ht : elderActive m d t) : M \u2208 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 : \u211d}\n (ht : elderActive m d t) : P \u2208 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\u27e9\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 : \u211d}\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 : \u211d}\n (ht : elderActive m d t) :\n ModuleCat.of k k \u27f6 (superlevel_h0Filtration g (Mod"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elderDifference_map",
+ "line": 159,
+ "source_header": "\u27e8P, T.older_mem ht\u27e9\n\ntheorem elderDifference_map (T : ElderTrap g M P m d D) {s t : \u211d}\n (hs : elderActive m d s) (ht : elderActive m d t) (hst : s \u2264 t) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elderDifference_map_dead",
+ "line": 168,
+ "source_header": "\u27e9 \u27e8P, T.older_mem hs\u27e9\n\ntheorem elderDifference_map_dead (T : ElderTrap g M P m d D) {s t : \u211d}\n (hs : elderActive m d s) (ht : -d \u2264 t) (hst : s \u2264 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 : \u211d}\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 \ud835\udfd9 _ else 0)\n\ntheorem elderProjection_point (T : ElderTrap g M P m d D) {t : \u211d}\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 \u226b"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elderDifference_projection",
+ "line": 198,
+ "source_header": "igma.\u03b9_comp_desc]\n rfl\n\ntheorem elderDifference_projection (T : ElderTrap g M P m d D) {t : \u211d}\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 : \u211d) :\n (elderInterval k m d).obj t \u27f6\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 : \u211d) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).obj t \u27f6\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 : \u211d}\n (hst : s \u2264 t) :\n (elderInterval k m d).map (homOfLE hst) \u226b elderSectionApp T t =\n elderSectionApp T s \u226b\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 \u27f6 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 : \u211d}\n (hs : elderActive m d s) (ht : elderActive m d t) (hst : s \u2264 t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) \u226b"
+ },
+ {
+ "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 : \u211d}\n (hs : s < -m) (ht : elderActive m d t) (hst : s \u2264 t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) \u226b"
+ },
+ {
+ "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 : \u211d}\n (hst : s \u2264 t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) \u226b\n elderRetractionApp T t =\n elderRetractionApp T s \u226b (elderInterv"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "elderRetraction",
+ "line": 328,
+ "source_header": "simp [htd]\n \u00b7 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) \u27f6 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 \u21a6 (qv,v-jqv) and (c,w) \u21a6 jc+w. -/\ndef elderDirectSummand (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k k) \u2245\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 : \u211d) (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 \u2192 \u211d) (D : Set X) (d t : \u211d)\n (htrace : IsClopen (elderTrap_strictTrace g D d)) (ht : t < -d) :\n IsClopen {x : superlevel_set g t | x.val \u2208"
+ },
+ {
+ "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 \u2192 \u211d) (D : Set X) (m d : \u211d) (M P : X)\n (hD : IsClosed D) (hboundary : \u2200 x \u2208 frontier D, g x \u2264 d)\n (hdm : d < m) (hMheight : g M = m) (hM : M \u2208 D)\n (hheight : \u2200 x \u2208 D, g x \u2264 m) (hP : m < g P)\n (\u03b3 : Path M P) (h\u03b3 : \u2200 t : unitInterval, d \u2264 g (\u03b3 t)) :\n ElderTrap g M P m d D where\n death_lt_"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "elderBoundaryDirectSummand",
+ "line": 52,
+ "source_header": "h\u03b3 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 \u2192 \u211d) (D : Set X) (m d : \u211d) (M P : X)\n (hD : IsClosed D) (hboundary : \u2200 x \u2208 frontier D, g x \u2264 d)\n (hdm : d < m) (hMheight : g M = m) (hM : M \u2208 D)\n (hheight : \u2200 x \u2208 D, g x \u2264 m) (hP : m < g P)\n (\u03b3 : Path M P) (h\u03b3 : \u2200 t : unitInterval, d \u2264 g (\u03b3 t)) :\n superlevel_h0Filtration g (ModuleCat.of k k) \u2245\n elderInterval k m d \u229e kernel (elderRetrac"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elderBoundary_death_eq",
+ "line": 67,
+ "source_header": "P \u03b3 h\u03b3)\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 : \u2115}\n (g : superlevelBar_E n \u2192 \u211d) (hg : Continuous g)\n (D : Set (superlevelBar_E n)) (m d : \u211d) (M P : superlevelBar_E n)\n (hD : IsClosed D) (hboundary : \u2200 x \u2208 frontier D, g x \u2264 d)\n (hMheight : g M = m) (hM : M \u2208 D)\n (hheight : \u2200 x \u2208 D, g x \u2264 m) (hP : m < g P)\n (\u03b3 : Path M P) (h\u03b3 : \u2200 t : unitInterval, d \u2264 g (\u03b3 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 \u2192 \u211d) (D : Set X) (d : \u211d) :\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 \u2192 \u211d) (D : Set X) (d : \u211d) (hD : IsClosed D)\n (hboundary : \u2200 x \u2208 frontier D, g x \u2264 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 \u2192 \u211d) (D : Set X) (d : \u211d)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n {M y : X} (hM : M \u2208 D) (\u03b3 : Path M y)\n (h\u03b3 : \u2200 t : unitInterval, d < g (\u03b3 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 \u2192 \u211d) (D : Set X) (d : \u211d)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : X) (hM : M \u2208 D) (hheight : \u2200 x \u2208 D, g x \u2264 g M)\n {y : X} (hy : g M < g y) (\u03b3 : Path M y) :\n \u2203 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 : \u2115}\n (g : superlevelBar_E n \u2192 \u211d) (D : Set (superlevelBar_E n)) (d : \u211d)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : superlevelBar_E n) (hM : M \u2208 D)\n (hheight : \u2200 x \u2208 D, g x \u2264 g M)\n (P : superlevelBar_E n) (hP : g M < g P) (\u03b3 : Path M P)\n (h\u03b3 : \u2200 t : unitInterval, d \u2264 g (\u03b3 t)) :\n superlevelBar_clearanceSet g M"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elderTrap_death_eq",
+ "line": 98,
+ "source_header": "hh (h\u03b3 t)\u27e9\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 : \u2115}\n (g : superlevelBar_E n \u2192 \u211d) (hg : Continuous g)\n (D : Set (superlevelBar_E n)) (d : \u211d)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : superlevelBar_E n) (hM : M \u2208 D)\n (hheight : \u2200 x \u2208 D, g x \u2264 g M)\n (P : superlevelBar_E n) (hP : g M < g P) (\u03b3 : Path M P)\n (h\u03b3 : \u2200 t : unitInterval, d \u2264 g (\u03b3 t)) :\n superlevelBar_deathH"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "elderTrap_closed_path_attains",
+ "line": 116,
+ "source_header": "P \u03b3 h\u03b3]\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 \u2192 \u211d) (D : Set X) (d : \u211d)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : X) (hM : M \u2208 D) (hheight : \u2200 x \u2208 D, g x \u2264 g M)\n {P : X} (hP : g M < g P) (\u03b3 : Path M P)\n (h\u03b3 : \u2200 t : unitInterval, d \u2264 g (\u03b3 t)) :\n \u2203 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."
+ ]
+ },
+ {
+ "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\u00b2` factor\n after the Cauchy\u2013Schwarz 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 : \u211d) (hr : r \u2260 0) (hcZ : cZ \u2260 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\u2013Schwarz numerator estimate and an exact\n normalizer lower bound. It does not formalize the measure-theoretic\n Cauchy\u2013Schwarz step itself. -/\ntheorem p02_lm008_cross_multiplied\n (n z r cW cZ q : \u211d)\n (hr : 0 < r) (hcW : 0 \u2264 cW) (hcZ : 0 < cZ) (hq : 0 \u2264 q)\n (hz : cZ * r ^ 2 \u2264 z)\n (hn : n \u2264 Real.sqrt cW * r ^ 2 * Real.sqrt q) :\n n * (cZ * r ^ 2) \u2264\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\u00b2` cancellation yield the Palm\n square-root transfer coefficient. -/\ntheorem p02_lm008_quotient_bound\n (n z r cW cZ q : \u211d)\n (hr : 0 < r) (hcW : 0 \u2264 cW) (hcZ : 0 < cZ) (hq : 0 \u2264 q)\n (hzpos : 0 < z) (hz : cZ * r ^ 2 \u2264 z)\n (hn : n \u2264 Real.sqrt cW * r ^ 2 * Real.sqrt q) :\n n / z \u2264 (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 \u2264 \u03b5` implies the fifth-power threshold used before Markov's\n inequality. -/\ntheorem p02_lm009_bad_event_threshold\n (r R \u03b5 : \u211d) (hr : 0 < r) (hbad : \u03b5 < r * R ^ 5) :\n \u03b5 / 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 : \u211d) :\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 \u2264 r \u2264 1`. -/\ntheorem p02_lm009_r4_le_r3\n (r : \u211d) (hr0 : 0 \u2264 r) (hr1 : r \u2264 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 \u2264 1`. -/\ntheorem p02_lm009_palm_r4_to_r3\n (p C r : \u211d) (hC : 0 \u2264 C) (hr0 : 0 \u2264 r) (hr1 : r \u2264 1)\n (hp : p \u2264 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 \u211d (Fin 6)) (S : Matrix (Fin 6) (Fin 6) \u211d)\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 \u2200\u1d50 x \u2202multivariateGaussian m S,\n x 0 = -1 \u2227 x 1 = 1 \u2227 x 2 + x 3 = 0 \u2227 x 4 - x 5 ="
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "gnl_positivePart_memLp",
+ "line": 64,
+ "source_header": "\u27e9\n\nprivate lemma gnl_positivePart_memLp {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} {f : \u03a9 \u2192 \u211d} {p : \u211d\u22650\u221e} (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 : \u211d) (m : EuclideanSpace \u211d (Fin 6))\n (S : Matrix (Fin 6) (Fin 6) \u211d) (hS : S.PosSemidef) :\n Integrable (fun x : EuclideanSpace \u211d (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 : \u211d \u2192 EuclideanSpace \u211d (Fin 6)) (S : \u211d \u2192 Matrix (Fin 6) (Fin 6) \u211d)\n (m0 : EuclideanSpace \u211d (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) \u211d)\n (hm : Tendsto m (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd m0))\n (hS : Tendsto S (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd S0))\n (hPSD : \u2200\u1da0 r in \ud835\udcdd[>] (0 : \u211d), (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 \u2203 c : \u211d, 0 < c \u2227 \u2203 \u03b4 : \u211d, 0 < \u03b4 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192 c*r^2 \u2264\n \u222b x : EuclideanSpace \u211d (Fin 6), r^2 * gn_normalizedWeight r (ofLp x)\n \u2202multivariateGaussian (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 : \u211d \u2192 EuclideanSpace \u211d (Fin 6)) (S : \u211d \u2192 Matrix (Fin 6) (Fin 6) \u211d)\n (m0 : EuclideanSpace \u211d (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) \u211d)\n (hm : Tendsto m (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd m0))\n (hS : Tendsto S (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd S0))\n (hPSD : \u2200\u1da0 r in \ud835\udcdd[>] (0 : \u211d), (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 \u2203 c : \u211d, 0 < c \u2227 \u2203 \u03b4 : \u211d, 0 < \u03b4 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192 c*r^2 \u2264\n \u222b x : EuclideanSpace \u211d (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]\n \u2202multivariateGaussian (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 \u2192 \u211d) : 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 : \u211d) (hr : 0 < r) :\n max (max (-a) 0 * max (-c) 0 - r * b ^ 2) 0 =\n if a < 0 \u2227 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 : \u211d) (j : Fin 6 \u2192 \u211d) (hr : 0 < r) :\n dm2Negative (egm_HM r j) \u2194 j 0 < 0 \u2227 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 : \u211d) (j : Fin 6 \u2192 \u211d) (hr : 0 < r) :\n (egm_HS r j).det < 0 \u2194 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 : \u211d) (j : Fin 6 \u2192 \u211d) (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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) (J : \u03a9 \u2192 Fin 6 \u2192 \u211d) (r : \u211d) (hr : 0 < r) :\n (\u222b \u03c9, egm_weight r (J \u03c9) \u2202P) =\n r ^ 2 * \u222b \u03c9, 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) (J : \u03a9 \u2192 Fin 6 \u2192 \u211d) (r : \u211d) (hr : 0 < r) :\n Integrable (fun \u03c9 => egm_weight r (J \u03c9)) P \u2194\n Integrable (fun \u03c9 => 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) [IsFiniteMeasure P]\n (J : \u03a9 \u2192 Fin 6 \u2192 \u211d) (hJ : Measurable J) (r : \u211d) (hr : 0 < r)\n (hsq : Integrable (fun \u03c9 => egm_weight r (J \u03c9) ^ 2) P) :\n Integrable (fun \u03c9 => egm_weight r (J \u03c9)) P \u2227\n Integrable (fun \u03c9 => gn_normalizedWeight r (enb_permut"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "enb_normalizer_floor_of_common_coupling",
+ "line": 149,
+ "source_header": ").mp hphysical\u27e9\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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) [IsProbabilityMeasure P]\n (J : \u211d \u2192 \u03a9 \u2192 Fin 6 \u2192 \u211d) (hJ : \u2200 r, Measurable (J r))\n (A Q : \u03a9 \u2192 \u211d) (m : \u211d) (v : \u211d\u22650) (hv : v \u2260 0)\n (hQ : HasLaw Q (gaussianReal m v) P)\n (hconv : \u2200\u1d50 \u03c9 \u2202P, Tendsto (fun r => J r \u03c9) (\ud835\udcdd[>] (0 : \u211d))\n (\ud835\udcdd ![-1,-A \u03c9/2,Q \u03c9,1,A \u03c9/2,Q \u03c9]))\n (hint : \u2200\u1da0 r in \ud835\udcdd[>] (0 : \u211d),\n Integrable (fun \u03c9 => egm_weight r (J r \u03c9)) P) :\n \u2203 c : \u211d, 0 < c \u2227 \u2203 \u03b4 : \u211d, 0 < \u03b4 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n c * r ^ 2 \u2264 \u222b \u03c9, 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 : \u211d) (j : Fin 6 \u2192 \u211d) : Matrix (Fin 2) (Fin 2)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "egm_HS",
+ "line": 16,
+ "source_header": "]\n\ndef egm_HS (r : \u211d) (j : Fin 6 \u2192 \u211d) : Matrix (Fin 2) (Fin 2)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "egm_weight",
+ "line": 19,
+ "source_header": "]\n\nnoncomputable def egm_weight (r : \u211d) (j : Fin 6 \u2192 \u211d) :"
+ },
+ {
+ "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 : \u211d) : Measurable (egm_weight"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "egm_coordinate_bound",
+ "line": 49,
+ "source_header": "nst\n\nprivate theorem egm_coordinate_bound (j : Fin 6 \u2192 \u211d) (i : Fin 6) :\n |j i| \u2264 gm8Radiu"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "egm_factor_bound",
+ "line": 56,
+ "source_header": "ith\n\nprivate theorem egm_factor_bound (r a b c R : \u211d) (hr : 0 \u2264 r) (hr1 : r \u2264 1)\n (hR : 0 \u2264 R) (ha : |a| \u2264 R) (hb : |b| \u2264 R) (hc : |c| \u2264 R) :\n |a * c - r * b ^ 2| \u2264 2 * R"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "egm_untyped",
+ "line": 68,
+ "source_header": "th)\n\nprivate theorem egm_untyped (r : \u211d) (j : Fin 6 \u2192 \u211d) (hr : 0 < r) (hr1 : r \u2264 1) :\n ((egm_HM r j).det * (egm_HS r j).det) ^ 2 \u2264\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 : \u211d) (j : Fin 6 \u2192 \u211d) (hr : 0 < r) (hr1 : r \u2264 1) :\n egm_weight r j ^ 2 \u2264 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (J : \u03a9 \u2192 Fin 6 \u2192 \u211d)\n (hJ : Measurable J) (m : Fin 6 \u2192 \u211d) (v : Fin 6 \u2192 \u211d\u22650)\n (B V r : \u211d) (hB : 0 \u2264 B) (hV : 0 \u2264 V) (hr : 0 < r) (hr1 : r \u2264 1)\n (hmean : \u2200 i, |m i| \u2264 B) (hvar : \u2200 i, (v i : \u211d) \u2264 V)\n (hlaw : \u2200 i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) \u03bc) :\n Integrable (fun x => egm_weight r (J x) ^ 2) \u03bc \u2227\n (\u222b x, egm_weight r (J x) ^ 2 \u2202\u03bc) \u2264 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) : Measur"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "prw_integrable_of_integrable_sq",
+ "line": 31,
+ "source_header": "\u03bc))\n\n/-- On a finite measure, a measurable square-integrable real weight is integrable. -/\ntheorem prw_integrable_of_integrable_sq {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) [IsFiniteMeasure \u03bc] (W : \u03a9 \u2192 \u211d) (hW : Measurable W)\n (hsq : Integrable (fun \u03c9 => W \u03c9 ^ 2) \u03bc) : Integrabl"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "prw_measure_apply",
+ "line": 42,
+ "source_header": "W \u03c9)]\n\n/-- The actual event mass is the normalized set integral, in extended reals. -/\ntheorem prw_measure_apply {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) (hW : Integrable W \u03bc)\n (hW0 : \u2200 \u03c9, 0 \u2264 W \u03c9) (hZ : 0 < \u222b x, W x \u2202\u03bc)\n (E : Set \u03a9) (hE : MeasurableSet E) :\n prwMeasure \u03bc W E = ENNReal.ofReal ((\u222b x in E, W x \u2202\u03bc) / \u222b 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) (hW : Integrable W \u03bc)\n (hW0 : \u2200 \u03c9, 0 \u2264 W \u03c9) (hZ : 0 < \u222b x, W x \u2202\u03bc) :\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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) (hW : Integrable W \u03bc)\n (hW0 : \u2200 \u03c9, 0 \u2264 W \u03c9) (hZ : 0 < \u222b x, W x \u2202\u03bc)\n (E : Set \u03a9) (hE : MeasurableSet E) :\n (prwMeasure \u03bc W).real E = (\u222b x in E, W x \u2202\u03bc) /"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "prw_numerator_bound",
+ "line": 73,
+ "source_header": "W0) hZ.le)]\n\n/-- Integral Cauchy\u2013Schwarz against the event indicator, including null events. -/\ntheorem prw_numerator_bound {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) [IsFiniteMeasure \u03bc] (W : \u03a9 \u2192 \u211d) (hW : Measurable W)\n (hW0 : \u2200 \u03c9, 0 \u2264 W \u03c9) (hsq : Integrable (fun \u03c9 => W \u03c9 ^ 2) \u03bc)\n (E : Set \u03a9) (hE : MeasurableSet E) :\n (\u222b x in E, W x \u2202\u03bc) \u2264\n Real.sqrt (\u222b x, W x ^ 2 \u2202\u03bc) * 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (W : \u03a9 \u2192 \u211d) (hW : Measurable W)\n (hW0 : \u2200 \u03c9, 0 \u2264 W \u03c9) (hsq : Integrable (fun \u03c9 => W \u03c9 ^ 2) \u03bc)\n (C c r : \u211d) (hC : 0 \u2264 C) (hc : 0 < c) (hr : 0 < r)\n (hmoment : (\u222b x, W x ^ 2 \u2202\u03bc) \u2264 C * r ^ 4)\n (hfloor : c * r ^ 2 \u2264 \u222b x, W x \u2202\u03bc)\n (E : Set \u03a9) (hE : MeasurableSet E) :\n IsProbabilityMeasure (prwMeasure \u03bc W) \u2227\n (prwMeasure \u03bc W).real E \u2264 (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 : \u2115} (j : Fin n \u2192 \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "gm8FiniteM8",
+ "line": 15,
+ "source_header": "|\n\n/-- One finite-dimensional Gaussian radius moment constant. -/\nnoncomputable def gm8FiniteM8 (n : \u2115) (B V : \u211d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gm8FiniteM8_nonneg",
+ "line": 19,
+ "source_header": "8))\n\ntheorem gm8FiniteM8_nonneg (n : \u2115) (B V : \u211d) : 0 \u2264 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 : \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gm8M8_nonneg",
+ "line": 28,
+ "source_header": "8C8))\n\ntheorem gm8M8_nonneg (B V : \u211d) : 0 \u2264 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 : \u2115) (j : Fin n \u2192 \u211d) :\n gm8Radius j ^ 8 \u2264 ((n+1 : \u2115) : \u211d)^7 * (1 + \u2211 i, |j"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gm8_finite_integrable_bound",
+ "line": 41,
+ "source_header": "ing h\n\ntheorem gm8_finite_integrable_bound (n : \u2115) {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (J : \u03a9 \u2192 Fin n \u2192 \u211d)\n (hJ : Measurable J) (m : Fin n \u2192 \u211d) (v : Fin n \u2192 \u211d\u22650)\n (B V : \u211d) (hB : 0 \u2264 B) (hV : 0 \u2264 V)\n (hmean : \u2200 i, |m i| \u2264 B) (hvar : \u2200 i, (v i : \u211d) \u2264 V)\n (hlaw : \u2200 i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) \u03bc) :\n Integrable (fun x => gm8Radius (J x)^8) \u03bc \u2227\n (\u222b x, gm8Radius (J x)^8 \u2202\u03bc) \u2264 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 \u2264 (10 : \u211d)^7 * (1 + \u2211 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (J : \u03a9 \u2192 DM2Jet)\n (hJ : Measurable J) (m : Fin 9 \u2192 \u211d) (v : Fin 9 \u2192 \u211d\u22650)\n (B V : \u211d) (hB : 0 \u2264 B) (hV : 0 \u2264 V)\n (hmean : \u2200 i, |m i| \u2264 B) (hvar : \u2200 i, (v i : \u211d) \u2264 V)\n (hlaw : \u2200 i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) \u03bc) :\n Integrable (fun x => dm2Radius (J x)^8) \u03bc \u2227\n (\u222b x, dm2Radius (J x)^8 \u2202\u03bc) \u2264"
+ },
+ {
+ "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)) (\u03bc r)) :\n 0 \u2264 16*gm8M8 B V \u2227 \u2200 r, 0 < r \u2192 r \u2264 r0 \u2192\n Integrable (fun x => dm2Weight r (J r x)^2) (\u03bc r) \u2227\n (\u222b x, dm2Weight r (J r x)^2 \u2202\u03bc r) \u2264 (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 {\u03b1 \u03b2 : Type*} [MeasurableSpace \u03b1] [MeasurableSpace \u03b2]\n (\u03bc : Measure \u03b1) (\u03bd : Measure \u03b2) [SFinite \u03bc] [SFinite \u03bd] :\n \u03bc \u2297\u2098 (Kernel.id \u00d7\u2096 Kernel.const \u03b1 \u03bd) =\n (\u03bc.prod \u03bd).map (fun p : \u03b1 \u00d7 \u03b2 => (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 {\u03a9 \u03b1 \u03b2 : Type*} [MeasurableSpace \u03a9]\n [MeasurableSpace \u03b1] [MeasurableSpace \u03b2] {P : Measure \u03a9} [IsProbabilityMeasure P]\n {X : \u03a9 \u2192 \u03b1} {R : \u03a9 \u2192 \u03b2} (hX : AEMeasurable X P) (hR : AEMeasurable R P)\n (hXR : IndepFun X R P) :\n HasCondDistrib (fun \u03c9 => (X \u03c9, R \u03c9)) X\n (Kernel.id \u00d7\u2096 Kernel.const \u03b1 (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 : \u2115}\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d)\n (p : (Fin n \u2192 \u211d) \u00d7 (Fin k \u2192 \u211d)) : Fi"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "regressionReconstruction_measurable",
+ "line": 66,
+ "source_header": "1 - mX)\n\nlemma regressionReconstruction_measurable {n k : \u2115}\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\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 : \u2115} (\u03bd : Measure (Fin k \u2192 \u211d))\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\n Kernel (Fin n \u2192 \u211d) (F"
+ },
+ {
+ "kind": "instance",
+ "unqualified_name": "regressionKernel_isMarkov",
+ "line": 79,
+ "source_header": "B mX mY)\n\ninstance regressionKernel_isMarkov {n k : \u2115} (\u03bd : Measure (Fin k \u2192 \u211d))\n [IsProbabilityMeasure \u03bd] (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d))\n (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\n IsMarkovKernel (regressionKernel \u03bd"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "regressionKernel_apply",
+ "line": 86,
+ "source_header": "B mX mY)\n\nlemma regressionKernel_apply {n k : \u2115} (\u03bd : Measure (Fin k \u2192 \u211d)) [SFinite \u03bd]\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d)\n (x : Fin n \u2192 \u211d) :\n regressionKernel \u03bd B mX mY x = \u03bd.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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} [IsProbabilityMeasure P] {n k : \u2115}\n {X : \u03a9 \u2192 Fin n \u2192 \u211d} {R : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hX : AEMeasurable X P) (hR : AEMeasurable R P) (hXR : IndepFun X R P)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\n HasCondDistrib (fun \u03c9 => R \u03c9 + mY + B (X \u03c9 - 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} {n k : \u2115} {X : \u03a9 \u2192 Fin n \u2192 \u211d} {R : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hXR : HasGaussianLaw (fun \u03c9 => (X \u03c9, R \u03c9)) P)\n (hzero : \u2200 i j, covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => R \u03c9 j) P = 0)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\n HasCondDistrib (fun \u03c9 => R \u03c9 + mY + B (X \u03c9 - 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 : \u2115} (\u03bd : Measure (Fin k \u2192 \u211d))\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} {n k : \u2115} {X : \u03a9 \u2192 Fin n \u2192 \u211d} {R : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hXR : HasGaussianLaw (fun \u03c9 => (X \u03c9, R \u03c9)) P)\n (hzero : \u2200 i j, covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => R \u03c9 j) P = 0)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\n IsMarkovKernel (regressionKernel (P.map R) B mX mY) \u2227\n Measurable (regressionKernel (P.map R) B mX mY) \u2227\n (\u2200 x, regressionKernel (P.map R) B mX mY x =\n (P.map R).map (fun r => r + mY + B (x - mX))) \u2227\n HasCondDistrib (fun \u03c9 => R \u03c9 + mY + B (X \u03c9 - mX)) X\n (regressionKernel (P."
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "regression_map_coordinate",
+ "line": 142,
+ "source_header": "XR hzero B mX mY\u27e9\n\n/-- Coordinates of a finite-vector continuous linear map in the standard basis. -/\nlemma regression_map_coordinate {n k : \u2115}\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (v : Fin n \u2192 \u211d) (j : Fin k) :\n B v j = \u2211 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} [IsProbabilityMeasure P] {n k : \u2115}\n {X : \u03a9 \u2192 Fin n \u2192 \u211d} (hX : HasGaussianLaw X P)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d)\n (i : Fin n) (j : Fin k) :\n covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => B (X \u03c9 - mX) j) P =\n \u2211 l, B (Pi.single l 1) j * covariance (fun \u03c9 => X \u03c9"
+ },
+ {
+ "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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} {n k : \u2115} {X : \u03a9 \u2192 Fin n \u2192 \u211d} {Y : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hXY : HasGaussianLaw (fun \u03c9 => (X \u03c9, Y \u03c9)) P)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d)\n (hnormal : \u2200 i j, covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => Y \u03c9 j) P =\n \u2211 l, B (Pi.single l 1) j * covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => X \u03c9 l) P) :\n \u2200 i j, covariance (fun \u03c9 => X \u03c9 i)\n (fun \u03c9 => (Y \u03c9 - 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 {\u03a9 : Type*} [MeasurableSpace \u03a9] {P : Measure \u03a9} {n k : \u2115}\n {X : \u03a9 \u2192 Fin n \u2192 \u211d} {Y : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hXY : HasGaussianLaw (fun \u03c9 => (X \u03c9, Y \u03c9)) P)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\n HasGaussianLaw (fun \u03c9 => (X \u03c9, 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} {n k : \u2115} {X : \u03a9 \u2192 Fin n \u2192 \u211d} {Y : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hXY : HasGaussianLaw (fun \u03c9 => (X \u03c9, Y \u03c9)) P)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d)\n (hnormal : \u2200 i j, covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => Y \u03c9 j) P =\n \u2211 l, B (Pi.single l 1) j * covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => X \u03c9 l) P) :\n HasCondDistrib Y X\n (regressionKernel (P.map (fun \u03c9 => Y \u03c9 - mY"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gaussianRegression_observed_spec",
+ "line": 246,
+ "source_header": "d using 1\n funext \u03c9\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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} {n k : \u2115} {X : \u03a9 \u2192 Fin n \u2192 \u211d} {Y : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hXY : HasGaussianLaw (fun \u03c9 => (X \u03c9, Y \u03c9)) P)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d)\n (hnormal : \u2200 i j, covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => Y \u03c9 j) P =\n \u2211 l, B (Pi.single l 1) j * covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => X \u03c9 l) P) :\n IsMarkovKernel\n (regressionKernel (P.map (fun \u03c9 => Y \u03c9 - mY - B (X \u03c9 - mX))) B mX mY) \u2227\n Measurable\n (regressionKernel (P.map (fun \u03c9 => Y \u03c9 - mY - B (X \u03c9 - mX))) B mX mY) \u2227\n (\u2200 x, regressionKernel (P.map (fun \u03c9 => Y \u03c9 - mY - B (X \u03c9 - mX))) B mX mY x =\n (P.map (fun \u03c9 => Y \u03c9 - mY - B (X \u03c9 - mX))).map\n (fun r => r + mY + B (x - mX))) \u2227\n HasCondDistrib Y X\n (regressionKernel (P.map (fun \u03c9 => Y \u03c9 - 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 {\u03b9 R : Type*} [Fintype \u03b9] [DecidableEq \u03b9]\n {u : Filter R} {S : R \u2192 Matrix \u03b9 \u03b9 \u211d} {S0 : Matrix \u03b9 \u03b9 \u211d}\n (hS : Tendsto S u (\ud835\udcdd S0)) (z : EuclideanSpace \u211d \u03b9) :\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 {\u03b9 : Type*} [Fintype \u03b9] [DecidableEq \u03b9]\n (m : EuclideanSpace \u211d \u03b9) (S : Matrix \u03b9 \u03b9 \u211d) (z : EuclideanSpace \u211d \u03b9) :\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 {\u03b9 : Type*} [Fintype \u03b9] [DecidableEq \u03b9]\n (m : EuclideanSpace \u211d \u03b9) (S : Matrix \u03b9 \u03b9 \u211d) :\n HasLaw (gc_coupledVector m S) (multivariateGaussian m S)\n (stdGaussian (EuclideanSpace \u211d \u03b9)) 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 {\u03b9 \u03ba : Type*} [Fintype \u03b9] [DecidableEq \u03b9]\n (u : Filter \u03ba) (m : \u03ba \u2192 EuclideanSpace \u211d \u03b9) (S : \u03ba \u2192 Matrix \u03b9 \u03b9 \u211d)\n (m0 : EuclideanSpace \u211d \u03b9) (S0 : Matrix \u03b9 \u03b9 \u211d)\n (hm : Tendsto m u (\ud835\udcdd m0)) (hS : Tendsto S u (\ud835\udcdd S0))\n (hPSD : \u2200\u1da0 t in u, (S t).PosSemidef) (hPSD0 : S0.PosSemidef)\n (z : EuclideanSpace \u211d \u03b9) :\n Tendsto (fun t => gc_coupledVector (m t) (S t) z) u\n (\ud835\udcdd (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\u00b2. -/\nnoncomputable def gn_normalizedWeight (r : \u211d) (v : Fin 6 \u2192 \u211d)"
+ },
+ {
+ "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 : \u211d) (v : \u211d\u22650) (hv : v \u2260 0) :\n Integrable (fun q : \u211d => (max (-q) 0)^2) (gaussianReal m v) \u2227\n 0 < \u222b q : \u211d, (max (-q) 0)^2 \u2202gaussianRea"
+ },
+ {
+ "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 : \u211d) (v : Fin 6 \u2192 \u211d)\n (hr : 0 \u2264 r) (hK : 0 < K) (hsmall : r * K^2 \u2264 1/4)\n (haM : v 0 \u2208 Set.Ioo (-5/4) (-3/4))\n (haS : v 1 \u2208 Set.Ioo (3/4) (5/4))\n (hbM : |v 2| < K) (_hbS : |v 3| < K)\n (hcM : v 4 \u2208 Set.Ioo (-2) (-1))\n (hcS : v 5 \u2208 Set.Ioo (-2) (-1)) :\n (3 : \u211d)/8 \u2264 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 : \u211d => |z| ^ 8) (gaussianReal 0 1"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gm8_standard_nonneg",
+ "line": 24,
+ "source_header": ")\n\ntheorem gm8_standard_nonneg : 0 \u2264 gm8C"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gm8_integrable",
+ "line": 27,
+ "source_header": ")\n\nprivate theorem gm8_integrable (m : \u211d) (v : \u211d\u22650) :\n Integrable (fun x : \u211d => |x| ^ 8) (gaussianReal m v"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gm8_sqrt_pow",
+ "line": 33,
+ "source_header": ")\n\nprivate theorem gm8_sqrt_pow (V : \u211d) (hV : 0 \u2264 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 : \u211d) (v : \u211d\u22650) :\n (gaussianReal 0 1).map (fun z : \u211d => m + Real.sqrt (v : \u211d) * 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 : \u211d) (v : \u211d\u22650) (hB : 0 \u2264 B) (hV : 0 \u2264 V)\n (hm : |m| \u2264 B) (hv : (v : \u211d) \u2264 V) (z : \u211d) :\n |m + Real.sqrt (v : \u211d) * z| ^ 8 \u2264 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 : \u211d) (v : \u211d\u22650)\n (hB : 0 \u2264 B) (hV : 0 \u2264 V) (hm : |m| \u2264 B) (hv : (v : \u211d) \u2264 V) :\n Integrable (fun x : \u211d => |x| ^ 8) (gaussianReal m v) \u2227\n (\u222b x : \u211d, |x| ^ 8 \u2202gaussianReal m v) \u2264\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 {\u03a9 \u03b9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) (u : Filter \u03b9) [IsCountablyGenerated u] [NeBot u]\n (f : \u03b9 \u2192 \u03a9 \u2192 \u211d) (g : \u03a9 \u2192 \u211d)\n (hmeas : \u2200 r, Measurable (f r))\n (hnonneg : \u2200 r \u03c9, 0 \u2264 f r \u03c9)\n (hg : Integrable g P) (hgpos : 0 < \u222b \u03c9, g \u03c9 \u2202P)\n (hconv : \u2200\u1d50 \u03c9 \u2202P, Tendsto (fun r => f r \u03c9) u (\ud835\udcdd (g \u03c9)))\n (hfint : \u2200\u1da0 r in u, Integrable (f r) P) :\n \u2200\u1da0 r in u, (\u222b \u03c9, g \u03c9 \u2202P)/2 \u2264 \u222b \u03c9, f r \u03c9 \u2202"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "nfloor_weight_continuous",
+ "line": 52,
+ "source_header": "e\n\nprivate theorem nfloor_weight_continuous :\n Continuous (fun p : \u211d \u00d7 (Fin 6 \u2192 \u211d) => 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 : \u211d) :\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 : \u211d \u2192 Fin 6 \u2192 \u211d) (a q : \u211d)\n (hX : Tendsto X (\ud835\udcdd[>] (0:\u211d)) (\ud835\udcdd ![-1,1,-a/2,a/2,q,q])) :\n Tendsto (fun r => gn_normalizedWeight r (X r)) (\ud835\udcdd[>] (0:\u211d))\n (\ud835\udcdd ((max (-q) 0)^2)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "nfloor_reference",
+ "line": 68,
+ "source_header": ")\nprivate theorem nfloor_reference {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) (Q : \u03a9 \u2192 \u211d) (m : \u211d) (v : \u211d\u22650) (hv : v \u2260 0)\n (hlaw : HasLaw Q (gaussianReal m v) P) :\n Integrable (fun \u03c9 => (max (-Q \u03c9) 0)^2) P \u2227\n 0 < \u222b \u03c9, (max (-Q \u03c9) 0)^2 \u2202"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gn_normalizer_floor_of_common_coupling",
+ "line": 78,
+ "source_header": "s\n\n/-- The actual integral of the physical r\u00b2-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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) [IsProbabilityMeasure P]\n (X : \u211d \u2192 \u03a9 \u2192 Fin 6 \u2192 \u211d) (hX : \u2200 r, Measurable (X r))\n (A Q : \u03a9 \u2192 \u211d) (m : \u211d) (v : \u211d\u22650) (hv : v \u2260 0)\n (hQ : HasLaw Q (gaussianReal m v) P)\n (hconv : \u2200\u1d50 \u03c9 \u2202P, Tendsto (fun r => X r \u03c9) (\ud835\udcdd[>] (0 : \u211d))\n (\ud835\udcdd ![-1,1,-A \u03c9/2,A \u03c9/2,Q \u03c9,Q \u03c9]))\n (hint : \u2200\u1da0 r in \ud835\udcdd[>] (0 : \u211d),\n Integrable (fun \u03c9 => gn_normalizedWeight r (X r \u03c9)) P) :\n \u2203 c : \u211d, 0 < c \u2227 \u2203 \u03b4 : \u211d, 0 < \u03b4 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n c * r^2 \u2264 \u222b \u03c9, r^2 * gn_normalizedWeight r (X r \u03c9)"
+ }
+ ]
+ },
+ {
+ "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) : \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "dm2HM",
+ "line": 24,
+ "source_header": "noncomputable def dm2HM (r : \u211d) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "dm2HS",
+ "line": 28,
+ "source_header": "noncomputable def dm2HS (r : \u211d) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) \u211d"
+ },
+ {
+ "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) \u211d) : Pro"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "dm2Weight",
+ "line": 36,
+ "source_header": "0\n\nnoncomputable def dm2Weight (r : \u211d) (j : DM2Jet) :"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "dm2_scale",
+ "line": 41,
+ "source_header": "0\n\nprivate lemma dm2_scale (r x : \u211d) (hr : 0 \u2264 r) (hr1 : r \u2264 1) :\n |r*x| \u2264 |x"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "dm2_factors",
+ "line": 46,
+ "source_header": "]\n\nprivate lemma dm2_factors (r A B C R : \u211d) (hr : 0 \u2264 r) (hr1 : r \u2264 1)\n (hR : 0 \u2264 R) (hA : |A| \u2264 R) (hB : |B| \u2264 R) (hC : |C| \u2264 R) :\n |A*C-r*B^2| \u2264 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 : \u211d) (j : DM2Jet) (hr : 0 < r) (hr1 : r \u2264 1) :\n ((dm2HM r j).det * (dm2HS r j).det)^2 \u2264 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 : \u211d) (j : DM2Jet) (hr : 0 < r) (hr1 : r \u2264 1) :\n dm2Weight r j ^ 2 \u2264 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 : \u211d) :\n dm2Negative !![a,b;b,c] \u2194 a < 0 \u2227 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 : \u211d) : 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 {\u03a9 : Type*} [MeasurableSpace \u03a9] (\u03bc : MeasureTheory.Measure \u03a9)\n (J : \u03a9 \u2192 DM2Jet) (hJ : Measurable J) (r M8 : \u211d) (hr : 0 < r) (hr1 : r \u2264 1)\n (h8 : MeasureTheory.Integrable (fun x => dm2Radius (J x)^8) \u03bc)\n (hM8 : (\u222b x, dm2Radius (J x)^8 \u2202\u03bc) \u2264 M8) :\n MeasureTheory.Integrable (fun x => dm2Weight r (J x)^2) \u03bc \u2227\n (\u222b x, dm2Weight r (J x)^2 \u2202\u03bc)"
+ }
+ ]
+ },
+ {
+ "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/AlgebraV2.lean",
+ "sha256": "71e4327df9f7d6979f1467f7e0d880e0ab0a70ab6d234802d8c7a1624b9ce2d9",
+ "declarations_lexical": [
+ {
+ "kind": "def",
+ "unqualified_name": "foldPotential",
+ "line": 9,
+ "source_header": "/-- Canonical A\u2082 normal-form potential, parameterized by `s` with \u03bb = s\u00b2. -/\nnoncomputable def foldPotential (s x : \u211d) :"
+ },
+ {
+ "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 : \u211d) :\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 : \u211d) :\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 (\u03b1 K c \u03b7 : \u211d) :\n (K + 8 * \u03b1 * c * \u03b7) ^ 2 + 64 * \u03b1 * (1 - \u03b1) * c ^ 2 * \u03b7 ^ 2 =\n (1 - \u03b1) * K ^ 2 + \u03b1 * (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 (\u03b1 a \u03b7 : \u211d) :\n (a + (1 - 2 * \u03b1) * \u03b7) ^ 2 + 4 * \u03b1 * (1 - \u03b1) * \u03b7 ^ 2 =\n (1 - \u03b1) * (a + \u03b7) ^ 2 + \u03b1 * (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 : \u211d) :\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 : \u211d) (hr : r \u2260 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."
+ ]
+ },
+ {
+ "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 \u2192 Y}\n (he : IsOpenEmbedding e) (x : X) :\n (\ud835\udcdd (e x)).HasBasis\n (fun V : Set Y => V \u2208 \ud835\udcdd (e x) \u2227 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 \u2208 U) :\n (\ud835\udcdd x).HasBasis (fun V : Set X => V \u2208 \ud835\udcdd x \u2227 IsPathConnected"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "relative_chart_homeomorph",
+ "line": 37,
+ "source_header": ", hx\u27e9\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 : \u2200 y \u2208 p.source, y \u2208 S \u2194 p y \u2208 T) :\n {y : S // y.val \u2208 p.source} \u2243\u209c {z : T // z.val \u2208 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 : \u2200 y \u2208 p.source, y \u2208 S \u2194 p y \u2208 T)\n (x : S) (hx : x.val \u2208 p.source) :\n (\ud835\udcdd x).HasBasis (fun V : Set S => V \u2208 \ud835\udcdd x \u2227 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 : \u2115} {g : E d \u2192 \u211d} {F : Type*}\n [NormedAddCommGroup F] [NormedSpace \u211d F]\n (a : \u211d) (x : {y : E d // a \u2264 g y})\n (p : OpenPartialHomeomorph (E d) (\u211d \u00d7 F))\n (hx : x.val \u2208 p.source)\n (hcoord : \u2200 y \u2208 p.source, (p y).fst = g y) :\n (\ud835\udcdd x).HasBasis\n (fun V : Set {y : E d // a \u2264 g y} => V \u2208 \ud835\udcdd x \u2227 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 : \u2115} {g : E d \u2192 \u211d} (hg : Continuous g)\n (a : \u211d) (x : {y : E d // a \u2264 g y}) (hx : a < g x.val) :\n (\ud835\udcdd x).HasBasis\n (fun V : Set {y : E d // a \u2264 g y} => V \u2208 \ud835\udcdd x \u2227 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 : \u2115} {g : E d \u2192 \u211d}\n (hsmooth : IsSmooth d g)\n (a : \u211d) (x : {y : E d // a \u2264 g y})\n (hregular : \u00ac IsCriticalPoint d g x.val) :\n (\ud835\udcdd x).HasBasis\n (fun V : Set {y : E d // a \u2264 g y} =>\n V \u2208 \ud835\udcdd x \u2227 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 : \u2115} {g : E d \u2192 \u211d}\n (hsmooth : IsSmooth d g)\n (a : \u211d) (x : {y : E d // a \u2264 g y})\n (hx : a < g x.val \u2228 \u00ac IsCriticalPoint d g x.val) :\n (\ud835\udcdd x).HasBasis\n (fun V : Set {y : E d // a \u2264 g y} =>\n V \u2208 \ud835\udcdd x \u2227 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 \u211d (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : \u2115) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "latticeVec",
+ "line": 77,
+ "source_header": "in d)\n\n/-- The lattice vector `L n` for `n \u2208 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 : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "thetaSum",
+ "line": 86,
+ "source_header": "i : \u211d))\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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) {m : \u2115} (x : Fin m \u2192 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 : \u2115) (L : \u211d) (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 `\u22a4`).\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 : \u2115) (g"
+ },
+ {
+ "kind": "structure",
+ "unqualified_name": "GaussianFieldInterface",
+ "line": 138,
+ "source_header": "\u2115, ContDiff \u211d 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 : \u2115) (L : \u211d) where\n /-- The underlying probability space (sample space). -/\n \u03a9 : 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\u03a9`.\n [m\u03a9 : MeasurableSpace \u03a9]\n /-- The probability measure `P`. -/\n P : Measure \u03a9\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `\u03c9 \u21a6 f_\u03c9 : R^d \u2192 \u211d`. -/\n F : \u03a9 \u2192 E d \u2192 \u211d\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : \u2200 \u03c9, IsSmooth d (F \u03c9)\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 : \u2200 \u03c9, IsLPeriodic d L (F \u03c9)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : \u2200 z : E d, Summable (fun n : Fin d \u2192 \u2124 => Real.exp (-(\u2016z + latticeVec d L n\u2016 ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : \u2200 {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d), 0 \u2264 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 : \u2200 {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d),\n Measure.map (fun \u03c9 => \u2211 i, a i * F \u03c9 (x i)) P =\n ProbabilityTheory.gaussianReal 0 \u27e8covQuadForm d L x a, quad_nonneg x a\u27e9\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : \u2200 x y : E d, \u222b \u03c9, F \u03c9 x * F \u03c9"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "hessian",
+ "line": 180,
+ "source_header": "y \u2202P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fr\u00e9chet\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": ": \u211d :=\n iteratedFDeriv \u211d 2 g x ![v, w]\n\n/-- Critical point: vanishing Fr\u00e9chet 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": "\u211d) (x : E d) : Prop :=\n fderiv \u211d 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": "(\u2200 w \u2208 W, w \u2260 0 \u2192 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 \u2227 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 \u2227 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": ": \u2115) (r : \u211d) (u : E d) : E d :=\n -((r / 2) \u2022 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 : \u2115) (r : \u211d) (u : E d) : E d :=\n (r / 2) \u2022 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 : \u2115) (g : E d \u2192 \u211d) (M S : E d) : \u211d :=\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 \u2227 IsIndexSaddle d g S \u2227 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 \u2192\n 0 < torusDist d L x y \u2192 g x \u2260 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 : \u2115) (L : \u211d) 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 \u2192 \u211d) \u2192 E d \u2192 \u211d\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 \u2192 \u211d) \u2192 E d \u2192 Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d \u2192 \u211d) \u2192 E d \u2192 E d \u2192 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192\n \u2200 M : E d, IsEssential g M \u2194 \u2200 y : E d, g y \u2264 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192\n \u2200 M : E d, \u00ac IsEssential g M \u2192 \u2200 h : \u211d,\n h < deathHeight g M \u2194\n \u2203 y : E d, g M < g y \u2227 \u2203 \u03b3 : Path M y, \u2200 t : unitInterval, h < g (\u03b3 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192 IsMorseDistinct d L g \u2192\n \u2200 M S : E d, ElderPartner g M S \u2194\n (IsNond"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "IsFiniteBar",
+ "line": 351,
+ "source_header": "gMax d g M \u2227 IsIndexSaddle d g S \u2227 \u00ac IsEssential g M \u2227 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`\u00ac 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 \u2227 0 < heightGap d g M S \u2227 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 : \u2115) (L : \u211d) (Pai"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pairCount",
+ "line": 374,
+ "source_header": "ndDomain d L \u2227 p.2 \u2208 FundDomain d L \u2227 Pair g p.1 p.2 \u2227 heightGap d g p.1 p.2 \u2208 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 \u2192 Prop)\n (g : E d \u2192 \u211d) (A : Set \u211d) : \u2115 :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `\u03bd` 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, `\u03bd` is integrable on every Borel `A \u2286 (0, \u221e)`, and\n`\u222b_A \u03bd = 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\u03a9` (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 : \u2115) (L : \u211d) (G : Gau"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "IsWindowPair",
+ "line": 407,
+ "source_header": "A \u2227\n \u222b \u2113 in A, \u03bd \u2113 = (\u222b \u03c9, ((pairCount d L Pair (G.F \u03c9) A : \u2115) : \u211d) \u2202G.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 <= \u03c1`, 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": ": \u211d) (g : E d \u2192 \u211d) (M S : E d) : Prop :=\n IsCandidatePair d L g M S \u2227 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 \u2264 p \u2264 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 : \u2115) (L : \u211d) (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 : \u211d \u2192 \u211d \u2192 \u211d \u2192 OrthonormalBasis (Fin d) \u211d (E d) \u2192 \u211d\n /-- `p` is a probability: nonnegative. -/\n p_nonneg : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (E d)), 0 \u2264 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 : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (E d)), p r b k R \u2264 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 \u2265 2`, `L > 0`,\ncompact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo \u2264 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 \u2264 r_*`, `b \u2208 B`, `k \u2208 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 `\u03bdc`, `\u03bde` with `\u03bdc(\u2113) ~ c_{B,K} \u2113^(-1/3)`,\n`\u03bde(\u2113) ~ c_{B,K} \u2113^(-1/3)` as `\u2113 \u2193 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and\n`0 \u2264 \u03bdc(\u2113) - \u03bde(\u2113) \u2264 C_{B,K} \u2113^(2/3)` for all sufficiently small `\u2113 > 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 `\u03bdc`, `\u03bde` 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 : \u211d, 0 < \u2113Star \u2227 \u2200 \u2113 : \u211d, 0 < \u2113 \u2192 \u2113 \u2264 \u2113Star \u2192\n 0 \u2264 \u03bdc \u2113 - \u03bde \u2113 \u2227 \u03bdc \u2113 - \u03bde \u2113 \u2264 C * \u2113 ^ ((2 : \u211d) / 3)\n\n/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and\nversions `\u03bdc`, `\u03bde` of the unrestricted candidate density and of the finite ordinary\nsuperlevel H0 bar density satisfy `\u03bdc(\u2113) ~ c \u2113^(-1/3)` and `\u03bde(\u2113) ~ c \u2113^(-1/3)` as `\u2113 \u2193 0`.\nThe essential global-maximum class is excluded from `\u03bde` 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": "\u2227\n Asymptotics.IsEquivalent (nhdsWithin (0 : \u211d) (Set.Ioi 0)) \u03bde\n (fun \u2113 : \u211d => c * \u2113 ^ ((-1 : \u211d) / 3))\n\n/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for\nfixed `d \u2265 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 `\u03bd(\u2113) ~ c_{d,L} \u2113^(-1/3)` as `\u2113 \u2193 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 \u2264 d \u2192 0 < L \u2192 \u2203 c : \u211d, 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 \u2265 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 < \u2113 \u2264 ell_*`,\n`|\u03bdc(\u2113) - c \u2113^(-1/3)| \u2264 C`, `0 \u2264 \u03bdc(\u2113) - \u03bde(\u2113) \u2264 C` and `|\u03bde(\u2113) - c \u2113^(-1/3)| \u2264 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 * \u2113 ^ ((-1 : \u211d) / 3)| \u2264 C \u2227\n 0 \u2264 \u03bdc \u2113 - \u03bde \u2113 \u2227 \u03bdc \u2113 - \u03bde \u2113 \u2264 C \u2227\n |\u03bde \u2113 - c * \u2113 ^ ((-1 : \u211d) / 3)| \u2264 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 \u2208 [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) \u2265 c r^3` for all\n`0 < r \u2264 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} \u2113^(2/3) \u2264 \u03bdc(\u2113) - \u03bde(\u2113) \u2264 C_{B,K} \u2113^(2/3)` for all `0 < \u2113 \u2264 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 : \u211d) (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 : \u00ac IsCriticalPoint d g x) :\n (fderiv \u211d 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 \u211d 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 : \u00ac IsCriticalPoint d g x) :\n OpenPartialHomeomorph (E d) (\u211d \u00d7 (fderiv \u211d g"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "regularPointChart_fst",
+ "line": 40,
+ "source_header": "/\n@[simp]\ntheorem regularPointChart_fst (hg : IsSmooth d g) (hx : \u00ac 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 : \u00ac 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 : \u00ac IsCriticalPoint d g x) :\n x \u2208 (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 : \u00ac IsCriticalPoint d g x) :\n (g x, 0) \u2208 (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 \u2192 Y}\n (he : IsOpenEmbedding e) (x : X) :\n (\ud835\udcdd (e x)).HasBasis\n (fun V : Set Y => V \u2208 \ud835\udcdd (e x) \u2227 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 \u2208 U) :\n (\ud835\udcdd x).HasBasis (fun V : Set X => V \u2208 \ud835\udcdd x \u2227 IsPathConnected"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "relative_chart_homeomorph",
+ "line": 37,
+ "source_header": ", hx\u27e9\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 : \u2200 y \u2208 p.source, y \u2208 S \u2194 p y \u2208 T) :\n {y : S // y.val \u2208 p.source} \u2243\u209c {z : T // z.val \u2208 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 : \u2200 y \u2208 p.source, y \u2208 S \u2194 p y \u2208 T)\n (x : S) (hx : x.val \u2208 p.source) :\n (\ud835\udcdd x).HasBasis (fun V : Set S => V \u2208 \ud835\udcdd x \u2227 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 : \u2115} {g : E d \u2192 \u211d} {F : Type*}\n [NormedAddCommGroup F] [NormedSpace \u211d F]\n (a : \u211d) (x : {y : E d // a \u2264 g y})\n (p : OpenPartialHomeomorph (E d) (\u211d \u00d7 F))\n (hx : x.val \u2208 p.source)\n (hcoord : \u2200 y \u2208 p.source, (p y).fst = g y) :\n (\ud835\udcdd x).HasBasis\n (fun V : Set {y : E d // a \u2264 g y} => V \u2208 \ud835\udcdd x \u2227 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 : \u2115} {g : E d \u2192 \u211d} (hg : Continuous g)\n (a : \u211d) (x : {y : E d // a \u2264 g y}) (hx : a < g x.val) :\n (\ud835\udcdd x).HasBasis\n (fun V : Set {y : E d // a \u2264 g y} => V \u2208 \ud835\udcdd x \u2227 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 \u2192 Y}\n (he : IsOpenEmbedding e) (x : X) :\n (\ud835\udcdd (e x)).HasBasis\n (fun V : Set Y => V \u2208 \ud835\udcdd (e x) \u2227 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 \u2208 U) :\n (\ud835\udcdd x).HasBasis (fun V : Set X => V \u2208 \ud835\udcdd x \u2227 IsPathConnected"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "relative_chart_homeomorph",
+ "line": 37,
+ "source_header": ", hx\u27e9\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 : \u2200 y \u2208 p.source, y \u2208 S \u2194 p y \u2208 T) :\n {y : S // y.val \u2208 p.source} \u2243\u209c {z : T // z.val \u2208 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 : \u2200 y \u2208 p.source, y \u2208 S \u2194 p y \u2208 T)\n (x : S) (hx : x.val \u2208 p.source) :\n (\ud835\udcdd x).HasBasis (fun V : Set S => V \u2208 \ud835\udcdd x \u2227 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 : \u2115} {g : E d \u2192 \u211d} {F : Type*}\n [NormedAddCommGroup F] [NormedSpace \u211d F]\n (a : \u211d) (x : {y : E d // a \u2264 g y})\n (p : OpenPartialHomeomorph (E d) (\u211d \u00d7 F))\n (hx : x.val \u2208 p.source)\n (hcoord : \u2200 y \u2208 p.source, (p y).fst = g y) :\n (\ud835\udcdd x).HasBasis\n (fun V : Set {y : E d // a \u2264 g y} => V \u2208 \ud835\udcdd x \u2227 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 : \u2115} {g : E d \u2192 \u211d} (hg : Continuous g)\n (a : \u211d) (x : {y : E d // a \u2264 g y}) (hx : a < g x.val) :\n (\ud835\udcdd x).HasBasis\n (fun V : Set {y : E d // a \u2264 g y} => V \u2208 \ud835\udcdd x \u2227 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."
+ ]
+ },
+ {
+ "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 : \u211d) : 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 : \u211d} (hc : c \u2260 0)\n (z : Fin 7 \u2192 \u211d) (h : (contactWitness c)\u1d40 *\u1d65 z = 0) : z ="
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "contactWitness_transpose_injective",
+ "line": 58,
+ "source_header": "n\n\nlemma contactWitness_transpose_injective {c : \u211d} (hc : c \u2260 0) :\n Function.Injective ((contactWitness c)\u1d40).mulVe"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "contactWitness_amplitude_transpose_injective",
+ "line": 65,
+ "source_header": "]\n\nlemma contactWitness_amplitude_transpose_injective {c : \u211d} (hc : c \u2260 0)\n (a : Fin 7 \u2192 \u211d) (ha : \u2200 s, a s \u2260 0) :\n Function.Injective ((contactWitness c * diagonal a)\u1d40).mulVe"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "coefficientGram",
+ "line": 76,
+ "source_header": "s\n\nnoncomputable def coefficientGram {\u03b9 : Type*} {n : \u2115} (coeff : Fin n \u2192 \u03b9 \u2192 \u211d) :\n Matrix (Fin n) (Fin n)"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "coefficient_product_summable",
+ "line": 79,
+ "source_header": "m\n\nlemma coefficient_product_summable {\u03b9 : Type*} {a b : \u03b9 \u2192 \u211d}\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 {\u03b9 : Type*} {n : \u2115} (coeff : Fin n \u2192 \u03b9 \u2192 \u211d)\n (hc : \u2200 i, Summable (coeff i)) (z : Fin n \u2192 \u211d) :\n HasSum (fun m => (\u2211 i, z i * coeff i m)^2)\n (star z \u2b1d\u1d65 (coefficientGram coeff *\u1d65 z)"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "coefficientGram_posDef_of_separating",
+ "line": 104,
+ "source_header": "]\n\nlemma coefficientGram_posDef_of_separating {\u03b9 : Type*} {n : \u2115}\n (coeff : Fin n \u2192 \u03b9 \u2192 \u211d) (hc : \u2200 i, Summable (coeff i))\n (hsep : \u2200 z : Fin n \u2192 \u211d, z \u2260 0 \u2192 \u2203 m, (\u2211 i, z i * coeff i m) \u2260 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 {\u03b9 : Type*} (coeff : Fin 7 \u2192 \u03b9 \u2192 \u211d)\n (hcoeff : \u2200 i, Summable (coeff i)) {c : \u211d} (hc : c \u2260 0)\n (mode : Fin 7 \u2192 \u03b9) (a : Fin 7 \u2192 \u211d) (ha : \u2200 s, a s \u2260 0)\n (hcolumns : \u2200 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) \u211d)\n (B : Matrix (Fin 6) Unit \u211d) (D : Matrix Unit Unit \u211d)\n (hG : (Matrix.fromBlocks A B B\u1d34 D).PosDef) :\n A.PosDef \u2227 0 < (D - B\u1d34 * A\u207b\u00b9 * 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 \u2192 \u211d) : Fin 6"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourcePhysicalIndex",
+ "line": 32,
+ "source_header": "5]\n\ndef sourcePhysicalIndex : Fin 6 \u2192 Fi"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourcePhysicalCoordinates_apply",
+ "line": 34,
+ "source_header": ",5]\n\ntheorem sourcePhysicalCoordinates_apply (v : Fin 6 \u2192 \u211d) (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 \u2192 \u211d) :\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 : \u211d) (v : Fin 6 \u2192 \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpointWeight_measurable",
+ "line": 51,
+ "source_header": "es v)\n\ntheorem sourceEndpointWeight_measurable (r : \u211d) : Measurable (sourceEndpointWeig"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpointWeight_nonneg",
+ "line": 54,
+ "source_header": "rable\n\ntheorem sourceEndpointWeight_nonneg (r : \u211d) (v : Fin 6 \u2192 \u211d) :\n 0 \u2264 sourceEndpointWeigh"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpointWeight_eq_continuous",
+ "line": 61,
+ "source_header": "e_rfl\n\ntheorem sourceEndpointWeight_eq_continuous (r : \u211d) (hr : 0 < r) (v : Fin 6 \u2192 \u211d) :\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 : \u211d) : Measure (Fin 6"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceEndpointMean",
+ "line": 69,
+ "source_header": "r b)\n\ndef sourceEndpointMean (L r b : \u211d) : Fin"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpointLaw_isProbabilityMeasure",
+ "line": 72,
+ "source_header": "r b)\n\ntheorem sourceEndpointLaw_isProbabilityMeasure {L : \u211d} (hL : L \u2260 0) (r b : \u211d) :\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 : \u211d} (hL : L \u2260 0) (r b : \u211d)\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 : \u211d} (hL : L \u2260 0) (r b : \u211d)\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 : \u211d} (hL : L \u2260 0) (r b : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n (\u222b v, sourceEndpointWeight r v \u2202sourceEndpointLaw L r b) =\n \u222b x : EuclideanSpace \u211d (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]\n \u2202multivariateGaussian (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 : \u211d} (hL : L \u2260 0)\n (r b B V : \u211d) (hG : IsUnit (sourcePinCovarianceAt L r))\n (hB : 0 \u2264 B) (hV : 0 \u2264 V) (hr : 0 < r) (hr1 : r \u2264 1)\n (hmean : \u2200 i, |sourceEndpointMean L r b i| \u2264 B)\n (hvar : \u2200 i, |sourceEndpointSchurAt L r i i| \u2264 V) :\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b) \u2227\n (\u222b v, sourceEndpointWeight r v ^ 2 \u2202sourceEndpointLaw L r b) \u2264\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 : \u211d} (hL : L \u2260 0)\n (r b : \u211d) (hG : IsUnit (sourcePinCovarianceAt L r)) (hr : 0 < r) (hr1 : r \u2264 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 : \u211d} (hL : L \u2260 0)\n (r b : \u211d) (hG : IsUnit (sourcePinCovarianceAt L r)) (hr : 0 < r) (hr1 : r \u2264 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 : \u211d) :\n Tendsto (fun r => sourcePrescribedPins r b) (\ud835\udcdd[>] (0 : \u211d))\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 : \u211d) :"
+ },
+ {
+ "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 : \u211d} (hL : L \u2260 0)\n (r b C c : \u211d) (hC : 0 \u2264 C) (hc : 0 < c) (hr : 0 < r)\n (hsq : Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b))\n (hmoment : (\u222b v, sourceEndpointWeight r v ^ 2 \u2202sourceEndpointLaw L r b) \u2264 C*r^4)\n (hfloor : c*r^2 \u2264 \u222b v, sourceEndpointWeight r v \u2202sourceEndpointLaw L r b)\n (E : Set (Fin 6 \u2192 \u211d)) (hE : MeasurableSet E) :\n IsProbabilityMeasure (sourceEndpointWeightedProbability L r b) \u2227\n (sourceEndpointWeightedProbability L r b).real E \u2264\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 : \u211d} (hL : L \u2260 0) (b : \u211d) :\n (\u2200\u1da0 r in \ud835\udcdd[>] (0 : \u211d), IsUnit (sourcePinCovarianceAt L r)) \u2227\n Tendsto (fun r => toLp 2 (sourceEndpointMean L r b)) (\ud835\udcdd[>] (0 : \u211d))\n (\ud835\udcdd (toLp 2 (sourceContactEndpointMean L b))) \u2227\n Tendsto (sourceEndpointSchurAt L) (\ud835\udcdd[>] (0 : \u211d))\n (\ud835\udcdd (sourceCon"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpoint_uniform_parameter_bounds",
+ "line": 216,
+ "source_header": "hm\n \u00b7 exact hp.2.2.2\n\ntheorem sourceEndpoint_uniform_parameter_bounds {L : \u211d} (hL : L \u2260 0) (b : \u211d) :\n \u2203 M V \u03b4 : \u211d, 0 \u2264 M \u2227 0 \u2264 V \u2227 0 < \u03b4 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192 IsUnit (sourcePinCovarianceAt L r) \u2227\n (\u2200 i, |sourceEndpointMean L r b i| \u2264 M) \u2227\n (\u2200 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 : \u211d} (hL : L \u2260 0) (b : \u211d) :\n \u2203 c : \u211d, 0 < c \u2227 \u2203 \u03b4 : \u211d, 0 < \u03b4 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n c * r^2 \u2264 \u222b v, sourceEndpointWeight r v"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpoint_estimates",
+ "line": 270,
+ "source_header": "le hr\u03b4 (min_le_left _ _))\n\ntheorem sourceEndpoint_estimates {L : \u211d} (hL : L \u2260 0) (b : \u211d) :\n \u2203 C c \u03b4 : \u211d, 0 \u2264 C \u2227 0 < c \u2227 0 < \u03b4 \u2227 \u03b4 \u2264 1 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b) \u2227\n (\u222b v, sourceEndpointWeight r v ^ 2 \u2202sourceEndpointLaw L r b) \u2264 C*r^4 \u2227\n c*r^2 \u2264 \u222b v, sourceEndpointWeight r v"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpoint_estimates_and_weighted_events",
+ "line": 291,
+ "source_header": "q,hbound,hfloor r hr hrF\u27e9\n\ntheorem sourceEndpoint_estimates_and_weighted_events {L : \u211d} (hL : L \u2260 0) (b : \u211d) :\n \u2203 C c \u03b4 : \u211d, 0 \u2264 C \u2227 0 < c \u2227 0 < \u03b4 \u2227 \u03b4 \u2264 1 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b) \u2227\n (\u222b v, sourceEndpointWeight r v ^ 2 \u2202sourceEndpointLaw L r b) \u2264 C*r^4 \u2227\n c*r^2 \u2264 (\u222b v, sourceEndpointWeight r v \u2202sourceEndpointLaw L r b) \u2227\n IsProbabilityMeasure (sourceEndpointWeightedProbability L r b) \u2227\n \u2200 E : Set (Fin 6 \u2192 \u211d), MeasurableSet E \u2192\n (sourceEndpointWeightedProbability L r b).real E \u2264\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 : \u211d} (hL : L \u2260 0) (r b : \u211d) :\n sourcePhysicalEndpointLaw L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourcePhysicalEndpointLaw_isProbabilityMeasure",
+ "line": 325,
+ "source_header": "ntKernel_at_prescribed hL r b\n\ntheorem sourcePhysicalEndpointLaw_isProbabilityMeasure {L : \u211d} (hL : L \u2260 0) (r b : \u211d) :\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 : \u211d} (hL : L \u2260 0) :\n \u2200\u1da0 r in \ud835\udcdd[>] (0 : \u211d),\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 : \u211d} (hL : L \u2260 0) (r b : \u211d) :\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 : \u211d} (hL : L \u2260 0) (b : \u211d) :\n \u2203 C c \u03b4 : \u211d, 0 \u2264 C \u2227 0 < c \u2227 0 < \u03b4 \u2227 \u03b4 \u2264 1 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourcePhysicalEndpointLaw L r b) \u2227\n (\u222b v, sourceEndpointWeight r v ^ 2 \u2202sourcePhysicalEndpointLaw L r b) \u2264 C*r^4 \u2227\n c*r^2 \u2264 (\u222b v, sourceEndpointWeight r v \u2202sourcePhysicalEndpointLaw L r b) \u2227\n IsProbabilityMeasure (sourcePhysicalEndpointWeightedProbability L r b) \u2227\n \u2200 E : Set (Fin 6 \u2192 \u211d), MeasurableSet E \u2192\n (sourcePhysicalEndpointWeightedProbability L r b).real E \u2264\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 \u211d) (C : Matrix t p \u211d) (d : p \u2192 \u211d) : t"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "regressionCovariance",
+ "line": 31,
+ "source_header": "\u1d65 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 \u211d) (C : Matrix t p \u211d) (B : Matrix t t \u211d) : Matrix"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "tendsto_matrix_mul_explicit",
+ "line": 36,
+ "source_header": "spose\n\nprivate theorem tendsto_matrix_mul_explicit {\u03b1 p t q : Type*} [Fintype t]\n {u : Filter \u03b1} {A : \u03b1 \u2192 Matrix p t \u211d} {A0 : Matrix p t \u211d}\n {B : \u03b1 \u2192 Matrix t q \u211d} {B0 : Matrix t q \u211d}\n (hA : Tendsto A u (\ud835\udcdd A0)) (hB : Tendsto B u (\ud835\udcdd B0)) :\n Tendsto (fun r => A r * B r) u (\ud835\udcdd (A0 *"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "tendsto_matrix_mulVec_explicit",
+ "line": 53,
+ "source_header": "k j))\n\nprivate theorem tendsto_matrix_mulVec_explicit {\u03b1 p t : Type*} [Fintype t]\n {u : Filter \u03b1} {A : \u03b1 \u2192 Matrix p t \u211d} {A0 : Matrix p t \u211d}\n {b : \u03b1 \u2192 (t \u2192 \u211d)} {b0 : t \u2192 \u211d}\n (hA : Tendsto A u (\ud835\udcdd A0)) (hb : Tendsto b u (\ud835\udcdd b0)) :\n Tendsto (fun r => A r *\u1d65 b r) u (\ud835\udcdd (A0 *\u1d65"
+ },
+ {
+ "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 \u2192 Matrix p p \u211d) (C : a \u2192 Matrix t p \u211d)\n (B : a \u2192 Matrix t t \u211d) (d : a \u2192 p \u2192 \u211d)\n (G0 : Matrix p p \u211d) (C0 : Matrix t p \u211d) (B0 : Matrix t t \u211d) (d0 : p \u2192 \u211d)\n (hG : Tendsto G u (\ud835\udcdd G0)) (hC : Tendsto C u (\ud835\udcdd C0))\n (hB : Tendsto B u (\ud835\udcdd B0)) (hd : Tendsto d u (\ud835\udcdd d0)) (hG0 : IsUnit G0) :\n (\u2200\u1da0 r in u, IsUnit (G r)) \u2227\n Tendsto (fun r => (G r)\u207b\u00b9) u (\ud835\udcdd G0\u207b\u00b9) \u2227\n Tendsto (fun r => regressionMean (G r) (C r) (d r)) u\n (\ud835\udcdd (regressionMean G0 C0 d0)) \u2227\n Tendsto (fun r => regressionCovariance (G r) (C r) (B r)) u\n (\ud835\udcdd (regressionCovariance G0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "bounds_from_limits",
+ "line": 104,
+ "source_header": ", hcov\u27e9\n\nprivate theorem bounds_from_limits {\u03b9 : Type*} [Fintype \u03b9]\n (f : \u211d \u2192 (\u03b9 \u2192 \u211d)) (g : \u211d \u2192 Matrix \u03b9 \u03b9 \u211d)\n (f0 : \u03b9 \u2192 \u211d) (g0 : Matrix \u03b9 \u03b9 \u211d)\n (hf : Tendsto f (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd f0))\n (hg : Tendsto g (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd g0)) :\n \u2203 B V \u03b4 : \u211d, 0 \u2264 B \u2227 0 \u2264 V \u2227 0 < \u03b4 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n (\u2200 i, |f r i| \u2264 B) \u2227 (\u2200 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 : \u211d \u2192 Matrix p p \u211d) (C : \u211d \u2192 Matrix t p \u211d)\n (B : \u211d \u2192 Matrix t t \u211d) (d : \u211d \u2192 p \u2192 \u211d)\n (G0 : Matrix p p \u211d) (C0 : Matrix t p \u211d) (B0 : Matrix t t \u211d) (d0 : p \u2192 \u211d)\n (hG : Tendsto G (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd G0))\n (hC : Tendsto C (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd C0))\n (hB : Tendsto B (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd B0))\n (hd : Tendsto d (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd d0)) (hG0 : IsUnit G0) :\n \u2203 M V \u03b4 : \u211d, 0 \u2264 M \u2227 0 \u2264 V \u2227 0 < \u03b4 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192 IsUnit (G r) \u2227\n (\u2200 i, |regressionMean (G r) (C r) (d r) i| \u2264 M) \u2227\n (\u2200 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 : \u211d) (v : Fin 6 \u2192 \u211d) : 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 : \u211d) (p : Fin 6 \u2192 \u211d) : Fin"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rawTransform_confluentTransform",
+ "line": 34,
+ "source_header": "/ 2]\n\ntheorem rawTransform_confluentTransform (r : \u211d) (hr : r \u2260 0) (v : Fin 6 \u2192 \u211d) :\n rawTransform r (confluentTransform r v"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "confluentTransform_rawTransform",
+ "line": 41,
+ "source_header": "ring\n\ntheorem confluentTransform_rawTransform (r : \u211d) (hr : r \u2260 0) (p : Fin 6 \u2192 \u211d) :\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 : \u211d) (hr : r \u2260 0) : (Fin 6 \u2192 \u211d) \u2243L[\u211d] (Fin 6 \u2192 \u211d) 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 : \u211d) (hr : r \u2260 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 : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "endpointS",
+ "line": 80,
+ "source_header": "r / 2, 0]\ndef endpointS (r : \u211d) :"
+ },
+ {
+ "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 : \u211d) (\u03c9 : 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 : \u211d} (hL : L \u2260 0) (r : \u211d) :\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 : \u211d) (hr : r \u2260 0) (\u03c9 : SmoothSample 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "confluentPins_hasGaussianLaw",
+ "line": 113,
+ "source_header": "(rawPins L r \u03c9)\n\ntheorem confluentPins_hasGaussianLaw {L : \u211d} (hL : L \u2260 0) (r : \u211d) (hr : r \u2260 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 : \u211d) (\u03c9 : 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 : \u211d} (hL : L \u2260 0) (r : \u211d) :\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 {\u03a9 E : Type*} [MeasurableSpace \u03a9] [MeasurableSpace E]\n (\u03bc : Measure \u03a9) (F : \u03a9 \u2192 E) (w : E \u2192 \u211d\u22650\u221e) (hF : Measurable F)\n (hw : Measurable w) :\n (\u03bc.withDensity (fun \u03c9 => w (F \u03c9))).map F = (\u03bc.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 {\u03a9 E : Type*} [MeasurableSpace \u03a9] [MeasurableSpace E]\n (\u03bc : Measure \u03a9) (F : \u03a9 \u2192 E) (W : E \u2192 \u211d) (hF : Measurable F)\n (hW : Measurable W) :\n (prwMeasure \u03bc (W \u2218 F)).map F = prwMeasure (\u03bc.map F"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "prwMeasure_absolutelyContinuous",
+ "line": 48,
+ "source_header": "op)\n\nlemma prwMeasure_absolutelyContinuous {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) : prwMeasure \u03bc W"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "prwMeasure_ae_of_ae",
+ "line": 52,
+ "source_header": "_ _\n\nlemma prwMeasure_ae_of_ae {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) {p : \u03a9 \u2192 Prop} (hp : \u2200\u1d50 \u03c9 \u2202\u03bc, p \u03c9) :\n \u2200\u1d50 \u03c9 \u2202prwMeasure \u03bc W,"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "prwMeasure_ae_weight_pos",
+ "line": 57,
+ "source_header": "hp\n\nlemma prwMeasure_ae_weight_pos {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) (hW : Measurable W)\n (hZ : 0 < \u222b \u03c9, W \u03c9 \u2202\u03bc) :\n \u2200\u1d50 \u03c9 \u2202prwMeasure \u03bc W, 0 <"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceSmoothLaw",
+ "line": 67,
+ "source_header": "hd\n\ndef sourceSmoothLaw {L : \u211d} (hL : L \u2260 0) (r b : \u211d) : Measure (SmoothSample 2"
+ },
+ {
+ "kind": "instance",
+ "unqualified_name": "sourceSmoothLaw_isProbabilityMeasure",
+ "line": 70,
+ "source_header": "b)\n\ninstance sourceSmoothLaw_isProbabilityMeasure {L : \u211d} (hL : L \u2260 0) (r b : \u211d) :\n IsProbabilityMeasure (sourceSmoothLaw hL r"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "rawPins_prescribed_iff",
+ "line": 75,
+ "source_header": "nce\n\nlemma rawPins_prescribed_iff {L : \u211d} (r b : \u211d) (hr : r \u2260 0) (\u03c9 : SmoothSample 2 L) :\n rawPins L r \u03c9 = ![b,b-r^3/6,0,0,0,0] \u2194\n sourceConfluentPinsAt L r \u03c9 = sourcePrescribedPins"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceSmoothLaw_raw_pin_fiber",
+ "line": 83,
+ "source_header": "ymm\n\ntheorem sourceSmoothLaw_raw_pin_fiber {L : \u211d} (hL : L \u2260 0) (r b : \u211d)\n (hr : r \u2260 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n sourceSmoothLaw hL r b {\u03c9 | rawPins L r \u03c9 = ![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 : \u211d} (hL : L \u2260 0) (r : \u211d) (hr : r \u2260 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 : \u211d} (hL : L \u2260 0) (r b : \u211d)\n (hr : r \u2260 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n \u2200\u1d50 \u03c9 \u2202sourceSmoothLaw hL r b, rawPins L r \u03c9 = ![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 : \u211d} (hL : L \u2260 0) (r b : \u211d)\n (hr : r \u2260 0) (hG : IsUnit (sourcePinCovarianceAt L r))\n (\u03bd : Measure (SmoothSample 2 L)) [IsProbabilityMeasure \u03bd]\n (h\u03bd : \u03bd \u226a sourceSmoothLaw hL r b) :\n \u03bd {\u03c9 | rawPins L r \u03c9 = ![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 : \u211d} (hL : L \u2260 0) (r b : \u211d)\n (hr : r \u2260 0) (hG : IsUnit (sourcePinCovarianceAt L r)) (W : SmoothSample 2 L \u2192 \u211d)\n [IsProbabilityMeasure (prwMeasure (sourceSmoothLaw hL r b) W)] :\n prwMeasure (sourceSmoothLaw hL r b) W\n {\u03c9 | rawPins L r \u03c9 = ![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 : \u211d) (\u03c9 : 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 : \u211d) (\u03c9 : SmoothSample 2 L) : Matrix (Fin 2)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceSmoothTyped",
+ "line": 140,
+ "source_header": "10,v 11]\n\ndef sourceSmoothTyped (L r : \u211d) (\u03c9 : 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 : \u211d) (\u03c9 : SmoothSamp"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "sourceRawHM_eq_normalized",
+ "line": 148,
+ "source_header": "det| else 0\n\nlemma sourceRawHM_eq_normalized (L r : \u211d) (hr : r \u2260 0) (\u03c9 : SmoothSample 2 L) :\n sourceRawHM L r \u03c9 = 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 : \u211d) (hr : r \u2260 0) (\u03c9 : SmoothSample 2 L) :\n sourceRawHS L r \u03c9 = egm_HS r (sourcePhysicalCoordinates (sourceNormalizedEndpoi"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceSmoothWeight_eq",
+ "line": 162,
+ "source_header": "d_simp [hr]\n\ntheorem sourceSmoothWeight_eq (L r : \u211d) (hr : r \u2260 0) (\u03c9 : SmoothSample 2 L) :\n sourceSmoothWeight L r \u03c9 = sourceEndpointWeight r (sourceNormalizedEndpo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceSmoothWeight_nonneg",
+ "line": 168,
+ "source_header": "ifs <;> rfl\n\ntheorem sourceSmoothWeight_nonneg (L r : \u211d) (\u03c9 : SmoothSample 2 L) :\n 0 \u2264 sourceSmoothW"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceSmoothWeight_measurable",
+ "line": 175,
+ "source_header": "xact le_rfl\n\ntheorem sourceSmoothWeight_measurable {L : \u211d} (hL : L \u2260 0) (r : \u211d) (hr : r \u2260 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 : \u211d) (\u03c9 : SmoothSample 2 L) :\n 0 < sourceSmoothWeight L r \u03c9 \u2194 sourceSmooth"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceSmoothTyped_measurableSet",
+ "line": 195,
+ "source_header": "Weight, ht]\n\ntheorem sourceSmoothTyped_measurableSet {L : \u211d} (hL : L \u2260 0) (r : \u211d) (hr : r \u2260 0) :\n MeasurableSet {\u03c9 : 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 : \u211d} (hL : L \u2260 0) (r b : \u211d) : Measure (Smoo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceSmoothLaw_endpoint_hasLaw",
+ "line": 208,
+ "source_header": "thWeight L r)\n\ntheorem sourceSmoothLaw_endpoint_hasLaw {L : \u211d} (hL : L \u2260 0) (r b : \u211d)\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 : \u211d} (hL : L \u2260 0) (r b : \u211d)\n (hr : r \u2260 0) (hG : IsUnit (sourcePinCovarianceAt L r))\n (hsq : Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourcePhysicalEndpointLaw L r b)) :\n Integrable (fun \u03c9 => sourceSmoothWeight L r \u03c9 ^ 2) (sourceSmoo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceSmoothLaw_weight_integral",
+ "line": 222,
+ "source_header": "able_comp hsq\n\ntheorem sourceSmoothLaw_weight_integral {L : \u211d} (hL : L \u2260 0) (r b : \u211d)\n (hr : r \u2260 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n (\u222b \u03c9, sourceSmoothWeight L r \u03c9 \u2202sourceSmoothLaw hL r b) =\n \u222b v, sourceEndpointWeight r v \u2202sourcePhysicalEndp"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceSmoothLaw_weight_square_integral",
+ "line": 230,
+ "source_header": "glyMeasurable\n\ntheorem sourceSmoothLaw_weight_square_integral {L : \u211d} (hL : L \u2260 0) (r b : \u211d)\n (hr : r \u2260 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n (\u222b \u03c9, sourceSmoothWeight L r \u03c9 ^ 2 \u2202sourceSmoothLaw hL r b) =\n \u222b v, sourceEndpointWeight r v ^ 2 \u2202sourcePhysicalEndp"
+ },
+ {
+ "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 : \u211d} (hL : L \u2260 0) (r b : \u211d)\n (hr : r \u2260 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 : \u211d} (hL : L \u2260 0)\n (r b C c : \u211d) (hC : 0 \u2264 C) (hc : 0 < c) (hr : 0 < r)\n (hsq : Integrable (fun \u03c9 => sourceSmoothWeight L r \u03c9 ^ 2) (sourceSmoothLaw hL r b))\n (hmoment : (\u222b \u03c9, sourceSmoothWeight L r \u03c9 ^ 2 \u2202sourceSmoothLaw hL r b) \u2264 C*r^4)\n (hfloor : c*r^2 \u2264 \u222b \u03c9, sourceSmoothWeight L r \u03c9 \u2202sourceSmoothLaw hL r b)\n (E : Set (SmoothSample 2 L)) (hE : MeasurableSet E) :\n IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) \u2227\n (sourceSmoothWeightedLaw hL r b).real E \u2264\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 : \u211d} (hL : L \u2260 0) (r b : \u211d) (hr : r \u2260 0)\n [IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b)]\n (hZ : 0 < \u222b \u03c9, sourceSmoothWeight L r \u03c9 \u2202sourceSmoothLaw hL r b) :\n sourceSmoothWeightedLaw hL r b {\u03c9 | sourceSmo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceSmoothWeightedLaw_raw_pins",
+ "line": 274,
+ "source_header": "os_iff L r \u03c9).mp h\u03c9\n\n/-- The density preserves the exact raw prescribed values and all four zero first derivatives. -/\ntheorem sourceSmoothWeightedLaw_raw_pins {L : \u211d} (hL : L \u2260 0) (r b : \u211d)\n (hr : r \u2260 0) (hG : IsUnit (sourcePinCovarianceAt L r))\n [IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b)] :\n sourceSmoothWeightedLaw hL r b {\u03c9 | rawPins L r \u03c9 = ![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 : \u211d} (hL : L \u2260 0) (b : \u211d) :\n \u2203 C c \u03b4 : \u211d, 0 \u2264 C \u2227 0 < c \u2227 0 < \u03b4 \u2227 \u03b4 \u2264 1 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n Integrable (fun \u03c9 => sourceSmoothWeight L r \u03c9 ^ 2) (sourceSmoothLaw hL r b) \u2227\n (\u222b \u03c9, sourceSmoothWeight L r \u03c9 ^ 2 \u2202sourceSmoothLaw hL r b) \u2264 C*r^4 \u2227\n c*r^2 \u2264 (\u222b \u03c9, sourceSmoothWeight L r \u03c9 \u2202sourceSmoothLaw hL r b) \u2227\n IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) \u2227\n (\u2200 E : Set (SmoothSample 2 L), MeasurableSet E \u2192\n (sourceSmoothWeightedLaw hL r b).real E \u2264\n (Real.sqrt C/c) * Real.sqrt ((sourceSmoothLaw hL r b).real E)) \u2227\n (sourceSmoothWeightedLaw hL r b).map (sourceNormalizedEndpoints L r) =\n sourcePhysicalEndpointWeightedProbability L r b \u2227\n sourceSmoothWeightedLaw hL r b\n {\u03c9 | rawPins L r \u03c9 = ![b,b-r^3/6,0,0,0,0]} = 1 \u2227\n sourceSmoothWeightedLaw hL r b {\u03c9 | 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 : \u211d} (w : SourceMode 2 \u2192 \u211d) (\u03c9 : SmoothSample 2 L) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceDerivativeMajorant",
+ "line": 29,
+ "source_header": "|\n\ndef sourceDerivativeMajorant (L : \u211d) (k : \u2115) (\u03c9 : SmoothSample 2 L) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sampleMajorant_nonneg",
+ "line": 32,
+ "source_header": "\u03c9\n\ntheorem sampleMajorant_nonneg {L : \u211d} (w : SourceMode 2 \u2192 \u211d)\n (hw : \u2200 m, 0 \u2264 w m) (\u03c9 : SmoothSample 2 L) : 0 \u2264 sampleMajorant w"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "derivativeMajorant_weighted_summable",
+ "line": 36,
+ "source_header": ")\n\ntheorem derivativeMajorant_weighted_summable {L : \u211d} (\u03c9 : SmoothSample 2 L)\n (k : \u2115) (u : Fin k \u2192 (Fin 2 \u2192 \u211d)) :\n Summable (fun m => derivativeMajorant 2 L k u m * |\u03c9.val m|"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "confluentMajorant_weighted_summable",
+ "line": 42,
+ "source_header": "h\n\ntheorem confluentMajorant_weighted_summable {L : \u211d} (\u03c9 : SmoothSample 2 L) :\n Summable (fun m => confluentModeMajorant L m * |\u03c9.val m|"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pinCoefficient_abs_le",
+ "line": 52,
+ "source_header": "]\n\ntheorem pinCoefficient_abs_le {L : \u211d} (hL : L \u2260 0) (r : \u211d) (hr : r \u2260 0)\n (i : Fin 6) (m : SourceMode 2) : |pinCoefficient L r i m| \u2264 confluentModeMajorant L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceConfluentPins_abs_le",
+ "line": 57,
+ "source_header": "m\n\ntheorem sourceConfluentPins_abs_le {L : \u211d} (hL : L \u2260 0) (r : \u211d) (hr : r \u2260 0)\n (\u03c9 : SmoothSample 2 L) (i : Fin 6) :\n |sourceConfluentPinsAt L r \u03c9 i| \u2264 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) \u211d)\n (K T : \u211d) (hK : 0 \u2264 K) (_hT : 0 \u2264 T)\n (hM : \u2200 i j, |M i j| \u2264 K) (y : Fin 6 \u2192 \u211d) (hy : \u2200 j, |y j| \u2264 T) (i : Fin 6) :\n |(M *\u1d65 y) i| \u2264 6*K*"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pinLift_abs_le",
+ "line": 80,
+ "source_header": "g\n\ntheorem pinLift_abs_le {L : \u211d} (hL : L \u2260 0) (r : \u211d) (hr : r \u2260 0)\n (K D : \u211d) (hK : 0 \u2264 K) (hD : 0 \u2264 D)\n (hInv : \u2200 i j, |(sourcePinCovarianceAt L r)\u207b\u00b9 i j| \u2264 K)\n (x : Fin 6 \u2192 \u211d) (hx : \u2200 i, |x i| \u2264 D) (\u03c9 : SmoothSample 2 L) (m : SourceMode 2) :\n |pinLift L r (x - sourceConfluentPinsAt L r \u03c9) m| \u2264\n 36*K*confluentModeMajorant L m *\n (D + sampleMajorant (confluentModeMajorant L) \u03c9"
+ },
+ {
+ "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 : \u211d} (hL : L \u2260 0) (r : \u211d) (hr : r \u2260 0)\n (w : SourceMode 2 \u2192 \u211d) (hw0 : \u2200 m, 0 \u2264 w m)\n (hwA : Summable (fun m => w m * confluentModeMajorant L m))\n (K D : \u211d) (hK : 0 \u2264 K) (hD : 0 \u2264 D)\n (hInv : \u2200 i j, |(sourcePinCovarianceAt L r)\u207b\u00b9 i j| \u2264 K)\n (x : Fin 6 \u2192 \u211d) (hx : \u2200 i, |x i| \u2264 D) (\u03c9 : SmoothSample 2 L)\n (hw\u03c9 : Summable (fun m => w m * |\u03c9.val m|)) :\n Summable (fun m => w m * |(posteriorSample hL r x \u03c9).val m|) \u2227\n sampleMajorant w (posteriorSample hL r x \u03c9) \u2264 sampleMajorant w \u03c9 +\n 36*K*(\u2211' 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 : \u211d} (hL : L \u2260 0) (b : \u211d) :\n \u2203 K D \u03b4 : \u211d, 0 \u2264 K \u2227 0 \u2264 D \u2227 0 < \u03b4 \u2227 \u03b4 \u2264 1 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n (\u2200 i j, |(sourcePinCovarianceAt L r)\u207b\u00b9 i j| \u2264 K) \u2227\n (\u2200 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 : \u211d} (hL : L \u2260 0)\n (k : \u2115) (\u03c9 : SmoothSample 2 L) (x : Fin 2 \u2192 \u211d) :\n \u2016iteratedFDeriv \u211d k (smoothSourceField 2 L \u03c9) x\u2016 \u2264 sourceDerivativeMajoran"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sampleMajorant_measurable",
+ "line": 204,
+ "source_header": "using h\n\ntheorem sampleMajorant_measurable (L : \u211d) (w : SourceMode 2 \u2192 \u211d) :\n Measurable (sampleMajo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceDerivativeMajorant_measurable",
+ "line": 209,
+ "source_header": "pe_coe)\n\ntheorem sourceDerivativeMajorant_measurable (L : \u211d) (k : \u2115) :\n Measurable (sourceDerivativeMajora"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sampleMajorant_add",
+ "line": 212,
+ "source_header": "ble L _\n\ntheorem sampleMajorant_add {L : \u211d} (w v : SourceMode 2 \u2192 \u211d) (\u03c9 : SmoothSample 2 L)\n (hw : Summable (fun m => w m * |\u03c9.val m|))\n (hv : Summable (fun m => v m * |\u03c9.val m|)) :\n sampleMajorant (fun m => w m+v m) \u03c9 = sampleMajorant w \u03c9 + sampleMajor"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sampleMajorant_const_mul",
+ "line": 220,
+ "source_header": "_add hv\n\ntheorem sampleMajorant_const_mul {L : \u211d} (c : \u211d) (w : SourceMode 2 \u2192 \u211d)\n (\u03c9 : SmoothSample 2 L) :\n sampleMajorant (fun m => c*w m) \u03c9 = 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 : \u211d} (hL : L \u2260 0)\n (b : \u211d) (k : \u2115) :\n \u2203 a : \u211d, \u2203 w : SourceMode 2 \u2192 \u211d, \u2203 \u03b4 : \u211d,\n 0 \u2264 a \u2227 (\u2200 m, 0 \u2264 w m) \u2227 Summable w \u2227 0 < \u2211' m, w m \u2227 0 < \u03b4 \u2227 \u03b4 \u2264 1 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192 \u2200 \u03c9 : SmoothSample 2 L,\n sourceDerivativeMajorant L k (posteriorSample hL r (sourcePrescribedPins r b) \u03c9) \u2264\n a + sampleMaj"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "source_coordinate_hasLaw",
+ "line": 275,
+ "source_header": "w0]; ring\n\ntheorem source_coordinate_hasLaw {L : \u211d} (hL : L \u2260 0) (m : SourceMode 2) :\n HasLaw (fun \u03c9 : SmoothSample 2 L => \u03c9.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 : \u211d} (hL : L \u2260 0)\n (w : SourceMode 2 \u2192 \u211d) (hw0 : \u2200 m, 0 \u2264 w m) (hw : Summable w) (n : \u2115) :\n Integrable (fun \u03c9 : SmoothSample 2 L => sampleMajorant w \u03c9 ^ n) (smoothLaw 2 L) \u2227\n (\u222b \u03c9, sampleMajorant w \u03c9 ^ n \u2202smoothLaw 2 L) \u2264\n (\u2211' 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 : \u211d} (hL : L \u2260 0)\n (a : \u211d) (ha : 0 \u2264 a) (w : SourceMode 2 \u2192 \u211d) (hw0 : \u2200 m, 0 \u2264 w m)\n (hw : Summable w) (n : \u2115) :\n Integrable (fun \u03c9 : SmoothSample 2 L => (a+sampleMajorant w \u03c9)^n) (smoot"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceConditionalDerivative_moments",
+ "line": 305,
+ "source_header": "hw0 \u03c9) 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 : \u211d} (hL : L \u2260 0) (b : \u211d) (k : \u2115) :\n \u2203 \u03b4 : \u211d, 0 < \u03b4 \u2227 \u03b4 \u2264 1 \u2227 \u2200 n : \u2115, \u2203 M : \u211d, 0 \u2264 M \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n Integrable (fun \u03c9 => sourceDerivativeMajorant L k \u03c9 ^ n)\n (sourceSmoothKernel hL r (sourcePrescribedPins r b)) \u2227\n (\u222b \u03c9, sourceDerivativeMajorant L k \u03c9 ^ n\n \u2202sourceSmoothKernel 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 : \u211d} (hL : L \u2260 0)\n (b : \u211d) (k n : \u2115) :\n \u2203 M \u03b4 : \u211d, 0 \u2264 M \u2227 0 < \u03b4 \u2227 \u03b4 \u2264 1 \u2227 \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n (sourceSmoothKernel hL r (sourcePrescribedPins r b)).real\n {\u03c9 | r\u207b\u00b9 < 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 : \u211d} (hL : L \u2260 0)\n (b : \u211d) (k : \u2115) :\n \u2203 a s \u03b4 : \u211d, 0 \u2264 a \u2227 0 < s \u2227 0 < \u03b4 \u2227 \u03b4 \u2264 1 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192 \u2200 R : \u211d, 0 \u2264 R \u2192\n (sourceSmoothKernel hL r (sourcePrescribedPins r b)).real\n {\u03c9 | a+R \u2264 sourceDerivativeMajorant L k \u03c9} \u2264\n 2*Real.exp ("
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceWeightedDerivative_cutoff_tail",
+ "line": 411,
+ "source_header": "_ \u2264 _ := 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\u2013Rice/Palm law asserted. -/\ntheorem sourceWeightedDerivative_cutoff_tail {L : \u211d} (hL : L \u2260 0)\n (b : \u211d) (k n : \u2115) :\n \u2203 M \u03b4 : \u211d, 0 \u2264 M \u2227 0 < \u03b4 \u2227 \u03b4 \u2264 1 \u2227 \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) \u2227\n (sourceSmoothWeightedLaw hL r b).real\n {\u03c9 | r\u207b\u00b9 < 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 : \u211d \u2192 \u211d) (r : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pin4",
+ "line": 26,
+ "source_header": "r\n\ndef pin4 (H : \u211d \u2192 \u211d) (r : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pin5",
+ "line": 29,
+ "source_header": "r\n\ndef pin5 (F : \u211d \u2192 \u211d) (r : \u211d) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scaled_hasDerivAt",
+ "line": 33,
+ "source_header": ")\n\nprivate theorem scaled_hasDerivAt (g g' : \u211d \u2192 \u211d)\n (hg : \u2200 x, HasDerivAt g (g' x) x) (r u : \u211d) :\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' : \u211d \u2192 \u211d)\n (hg : \u2200 x, HasDerivAt g (g' x) x) (hc : Continuous g') (r : \u211d) (hr : r \u2260 0) :\n (g (r / 2) - g (-r / 2)) / r =\n \u222b u in (-1/2 : \u211d)..(1/2 : \u211d), g' (r * u"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "left_endpoint_identity",
+ "line": 56,
+ "source_header": "]\n\nprivate theorem left_endpoint_identity (g g' : \u211d \u2192 \u211d)\n (hg : \u2200 x, HasDerivAt g (g' x) x) (hc : Continuous g') (r : \u211d) (hr : r \u2260 0) :\n (g (-r/2) - \u222b u in (-1/2 : \u211d)..(1/2 : \u211d), g (r*u)) / r =\n -(\u222b u in (-1/2 : \u211d)..(1/2 : \u211d), (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' : \u211d \u2192 \u211d)\n (hg : \u2200 x, HasDerivAt g (g' x) x) (hc : Continuous g') (r : \u211d) (hr : r \u2260 0) :\n (g (r/2) - \u222b u in (-1/2 : \u211d)..(1/2 : \u211d), g (r*u)) / r =\n \u222b u in (-1/2 : \u211d)..(1/2 : \u211d), (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 : \u211d \u2192 \u211d)\n (h0 : \u2200 x, HasDerivAt f (f1 x) x)\n (h1 : \u2200 x, HasDerivAt f1 (f2 x) x)\n (h2 : \u2200 x, HasDerivAt f2 (f3 x) x) (hc3 : Continuous f3)\n (r : \u211d) (hr : r \u2260 0) :\n (12 / r ^ 2) * ((f1 (r/2) + f1 (-r/2))/2 - (f (r/2) - f (-r/2))/r) =\n 6 * \u222b u in (-1/2 : \u211d)..(1/2 : \u211d), (1/4-u^2) * f3 (r*u"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "iterated_hasDerivAt",
+ "line": 140,
+ "source_header": "]\n\nprivate theorem iterated_hasDerivAt {F : \u211d \u2192 \u211d} {n : \u2115}\n (hF : ContDiff \u211d n F) (k : \u2115) (hk : k < n) (x : \u211d) :\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 : \u211d \u2192 \u211d) (hF : ContDiff \u211d 3 F) (r : \u211d) (hr : r \u2260 0) :\n pin3 F r = \u222b u in (-1/2 : \u211d)..(1/2 : \u211d), 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 : \u211d \u2192 \u211d) (hH : ContDiff \u211d 2 H) (r : \u211d) (hr : r \u2260 0) :\n pin4 H r = \u222b u in (-1/2 : \u211d)..(1/2 : \u211d), 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 : \u211d \u2192 \u211d) (hF : ContDiff \u211d 3 F) (r : \u211d) (hr : r \u2260 0) :\n pin5 F r = 6 * \u222b u in (-1/2 : \u211d)..(1/2 : \u211d),\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 : \u211d \u2192 \u211d) (hF : ContDiff \u211d 3 F) (r : \u211d) (hr : r \u2260 0) :\n (iteratedDeriv 2 F (-r/2) - pin3 F r) / r =\n -(\u222b u in (-1/2 : \u211d)..(1/2 : \u211d), (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 : \u211d \u2192 \u211d) (hF : ContDiff \u211d 3 F) (r : \u211d) (hr : r \u2260 0) :\n (iteratedDeriv 2 F (r/2) - pin3 F r) / r =\n \u222b u in (-1/2 : \u211d)..(1/2 : \u211d), (u+1/2) * iteratedDeriv 3"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "adjusted_transverse_left",
+ "line": 187,
+ "source_header": ")) r hr\n\ntheorem adjusted_transverse_left (H : \u211d \u2192 \u211d) (hH : ContDiff \u211d 2 H) (r : \u211d) (hr : r \u2260 0) :\n (deriv H (-r/2) - pin4 H r) / r =\n -(\u222b u in (-1/2 : \u211d)..(1/2 : \u211d), (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 : \u211d \u2192 \u211d) (hH : ContDiff \u211d 2 H) (r : \u211d) (hr : r \u2260 0) :\n (deriv H (r/2) - pin4 H r) / r =\n \u222b u in (-1/2 : \u211d)..(1/2 : \u211d), (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 : \u211d) (\u03c9 : 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 : \u211d) (\u03c9 : SmoothSample 2 L) : Fin"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceContactEndpointCrossCovariance",
+ "line": 32,
+ "source_header": "L \u03c9]\n\n/-- Literal limiting endpoint/pin cross covariance C0. -/\ndef sourceContactEndpointCrossCovariance (L : \u211d) : 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 : \u211d) : Matrix (Fin 6)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceContactEndpointRegression",
+ "line": 42,
+ "source_header": "hLaw 2 L)\n\ndef sourceContactEndpointRegression (L : \u211d) : Matrix (Fin 6)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceContactPinValue",
+ "line": 45,
+ "source_header": "ance L)\u207b\u00b9\n\n/-- The prescribed limiting pin retains an arbitrary level b. -/\ndef sourceContactPinValue (b : \u211d)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceContactEndpointMean",
+ "line": 48,
+ "source_header": ",0,0,0,0,2]\n\ndef sourceContactEndpointMean (L b : \u211d)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceContactEndpointSchur",
+ "line": 51,
+ "source_header": "tPinValue b\n\ndef sourceContactEndpointSchur (L : \u211d) : Matrix (Fin 6"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceContactEndpointResidual",
+ "line": 56,
+ "source_header": "ariance L)\u1d40\n\ndef sourceContactEndpointResidual (L : \u211d) (\u03c9 : SmoothSample 2 L)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "contact_generic_residual_covariance",
+ "line": 60,
+ "source_header": "nVector L \u03c9\n\nprivate theorem contact_generic_residual_covariance {\u03a9 \u03b9 \u03ba : Type*} [MeasurableSpace \u03a9]\n [Fintype \u03b9] [DecidableEq \u03b9] [Fintype \u03ba] [DecidableEq \u03ba]\n {P : Measure \u03a9} [IsFiniteMeasure P]\n (J : \u03a9 \u2192 \u03b9 \u2192 \u211d) (T : \u03a9 \u2192 \u03ba \u2192 \u211d)\n (hJ : \u2200 i, MemLp (fun \u03c9 => J \u03c9 i) 2 P)\n (hT : \u2200 i, MemLp (fun \u03c9 => T \u03c9 i) 2 P)\n (hG : IsUnit (Matrix.of (fun i j => covariance (fun \u03c9 => J \u03c9 i) (fun \u03c9 => J \u03c9 j) P) : Matrix \u03b9 \u03b9 \u211d)) :\n let G : M"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceContactA_memLp",
+ "line": 129,
+ "source_header": "m] using hp\n\nprivate theorem sourceContactA_memLp {L : \u211d} (hL : L \u2260 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 : \u211d} (hL : L \u2260 0) (i : Fin 6) :\n MemLp (fun \u03c9 => sourcePinVector L \u03c9 i) 2 (smo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceContactEndpoint_memLp",
+ "line": 138,
+ "source_header": ").memLp_two\n\nprivate theorem sourceContactEndpoint_memLp {L : \u211d} (hL : L \u2260 0) (i : Fin 6) :\n MemLp (fun \u03c9 => sourceContactEndpointVector L \u03c9 i) 2 (smo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "cross_row_zero",
+ "line": 153,
+ "source_header": "\u00b7 exact hQ\n\nprivate theorem cross_row_zero (L : \u211d) (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 : \u211d) (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 : \u211d) (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 : \u211d) (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 : \u211d} (hL : L \u2260 0) (x : Fin 6 \u2192 \u211d) :\n (sourceContactEndpointRegression L *\u1d65 x) 0 = -x 5 / 2 \u2227\n (sourceContactEndpointRegression L *\u1d65 x)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "regression_other_coordinates",
+ "line": 214,
+ "source_header": "[hc]; ring\n\nprivate theorem regression_other_coordinates (L : \u211d) (x : Fin 6 \u2192 \u211d) :\n (sourceContactEndpointRegression L *\u1d65 x) 2 =\n -(sourceContactEndpointRegression L *\u1d65 x) 3 \u2227\n (sourceContactEndpointRegression L *\u1d65 x) 4 =\n (sourceContactEndpointRegressio"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceContactEndpointMean_contact",
+ "line": 224,
+ "source_header": "s_row_four]\n\ntheorem sourceContactEndpointMean_contact {L : \u211d} (hL : L \u2260 0) (b : \u211d) :\n sourceContactEndpointMean L b 0 = -1 \u2227\n sourceContactEndpointMean L b 1 = 1 \u2227\n sourceContactEndpointMean L b 2 + sourceContactEndpointMean L b 3 = 0 \u2227\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 : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample 2 L) :\n sourceContactEndpointResidual L \u03c9 0 = 0 \u2227\n sourceContactEndpointResidual L \u03c9 1 = 0 \u2227\n sourceContactEndpointResidual L \u03c9 2 = -sourceContactEndpointResidual L \u03c9 3 \u2227\n sourceContactEndpointResidual L \u03c9 4 = sourceContactEndpointRes"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceContactEndpointSchur_covariance",
+ "line": 255,
+ "source_header": "\u00b7 rw [ho.2]\n\n/-- The limiting Schur matrix is the actual least-squares endpoint residual covariance. -/\ntheorem sourceContactEndpointSchur_covariance {L : \u211d} (hL : L \u2260 0) :\n (\u2200 i j, covariance (fun \u03c9 => sourceContactEndpointResidual L \u03c9 i)\n (fun \u03c9 => sourceContactEndpointResidual L \u03c9 j) (smoothLaw 2 L) =\n sourceContactEndpointSchur L i j) \u2227 (sourceContactEndpointSchur"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceContactEndpointSchur_posSemidef",
+ "line": 270,
+ "source_header": "_memLp hL) hG\n\ntheorem sourceContactEndpointSchur_posSemidef {L : \u211d} (hL : L \u2260 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 : \u211d} (hL : L \u2260 0) :\n sourceContactEndpointSchur L 0 0 = 0 \u2227\n sourceContactEndpointSchur L 1 1 = 0 \u2227\n sourceContactEndpointSchur L 2 2 + 2 * sourceContactEndpointSchur L 2 3 +\n sourceContactEndpointSchur L 3 3 = 0 \u2227\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 : \u211d) (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 : \u211d) :\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 : \u211d} (hL : L \u2260 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 : \u2115) (L : \u211d) : SmoothSample d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "exists_measurable_sampleProjection",
+ "line": 35,
+ "source_header": "\u27e9\n\ntheorem exists_measurable_sampleProjection (d : \u2115) (L : \u211d) :\n \u2203 q : (SourceMode d \u2192 \u211d) \u2192 SmoothSample d L,\n Measurable q \u2227 \u2200 \u03c9 : SmoothSample d L, q (sampleInclusion d L \u03c9) ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSample_add",
+ "line": 41,
+ "source_header": "\u27e9\n\ntheorem goodSample_add {d : \u2115} {L : \u211d}\n (\u03c9 \u03b7 : SourceMode d \u2192 \u211d) (h\u03c9 : goodSample d L \u03c9) (h\u03b7 : goodSample d L \u03b7) :\n goodSample d L (\u03c9 + \u03b7"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSample_neg",
+ "line": 53,
+ "source_header": ")\n\ntheorem goodSample_neg {d : \u2115} {L : \u211d}\n (\u03c9 : SourceMode d \u2192 \u211d) (h\u03c9 : goodSample d L \u03c9) : goodSample d L (-\u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "derivativeCoefficient_weighted_summable",
+ "line": 58,
+ "source_header": "n\n\n\ntheorem derivativeCoefficient_weighted_summable {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample 2 L) (k : \u2115) (x : Fin 2 \u2192 \u211d) (u : Fin k \u2192 (Fin 2 \u2192 \u211d)) :\n Summable (fun m => derivativeCoefficient 2 L k x u m * sampleInclusion 2 L \u03c9 m"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "finiteCoefficient_weighted_summable",
+ "line": 72,
+ "source_header": "g\n\ntheorem finiteCoefficient_weighted_summable {\u03b9 : Type*} {n q : \u2115}\n (a : Fin n \u2192 \u03b9 \u2192 \u211d) (\u03c9 : \u03b9 \u2192 \u211d)\n (ha : \u2200 i, Summable (fun m => a i m * \u03c9 m))\n (T : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin q \u2192 \u211d)) (j : Fin q) :\n Summable (fun m => T (fun i => a i m) j * \u03c9 m"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pinCoefficient_weighted_summable",
+ "line": 89,
+ "source_header": "_\n\ntheorem pinCoefficient_weighted_summable {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (\u03c9 : SmoothSample 2 L) (i : Fin 6) :\n Summable (fun m => pinCoefficient L r i m * sampleInclusion 2 L \u03c9 m"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "adjustedCoefficient_weighted_summable",
+ "line": 97,
+ "source_header": "i\n\ntheorem adjustedCoefficient_weighted_summable {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (\u03c9 : SmoothSample 2 L) (i : Fin 6) :\n Summable (fun m => adjustedCoefficient L r i m * sampleInclusion 2 L \u03c9 m"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceConfluentPinsAt_measurable",
+ "line": 105,
+ "source_header": "i\n\ntheorem sourceConfluentPinsAt_measurable {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\n Measurable (sourceConfluentPinsAt L r"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceAdjustedEndpoints_measurable",
+ "line": 115,
+ "source_header": ")\n\ntheorem sourceAdjustedEndpoints_measurable {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\n Measurable (sourceAdjustedEndpoints L r"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pinLift",
+ "line": 125,
+ "source_header": ")\n\ndef pinLift (L r : \u211d) (y : Fin 6 \u2192 \u211d) (m : SourceMode 2) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pinLift_zero",
+ "line": 128,
+ "source_header": ")\n\ntheorem pinLift_zero (L r : \u211d) : pinLift L r 0 ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pinLift_add",
+ "line": 132,
+ "source_header": "]\n\ntheorem pinLift_add (L r : \u211d) (x y : Fin 6 \u2192 \u211d) :\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 : \u211d) (x : Fin 6 \u2192 \u211d) :\n pinLift L r (-x) = -pinLift L r"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pinLift_goodSample",
+ "line": 142,
+ "source_header": "]\n\ntheorem pinLift_goodSample {L : \u211d} (hL : L \u2260 0) (r : \u211d) (y : Fin 6 \u2192 \u211d) :\n goodSample 2 L (pinLift L r y"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pinLift_measurable",
+ "line": 162,
+ "source_header": "]\n\ntheorem pinLift_measurable (L r : \u211d) : Measurable (pinLift L r"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "addLift",
+ "line": 168,
+ "source_header": "p\n\ndef addLift {L : \u211d} (hL : L \u2260 0) (r : \u211d) (y : Fin 6 \u2192 \u211d)\n (\u03c9 : SmoothSample 2 L) : SmoothSample 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "addLift_measurable",
+ "line": 177,
+ "source_header": "l\n\ntheorem addLift_measurable {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\n Measurable (fun p : (Fin 6 \u2192 \u211d) \u00d7 SmoothSample 2 L => addLift hL r p.1 p.2"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "posteriorSample",
+ "line": 184,
+ "source_header": ")\n\ndef posteriorSample {L : \u211d} (hL : L \u2260 0) (r : \u211d) (x : Fin 6 \u2192 \u211d)\n (\u03c9 : SmoothSample 2 L) : SmoothSample 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "posteriorSample_measurable",
+ "line": 193,
+ "source_header": "l\n\ntheorem posteriorSample_measurable {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\n Measurable (fun p : (Fin 6 \u2192 \u211d) \u00d7 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 {\u03b9 : Type*} {n : \u2115}\n (a : \u03b9 \u2192 \u211d) (b : Fin n \u2192 \u03b9 \u2192 \u211d) (\u03c9 : \u03b9 \u2192 \u211d) (c : Fin n \u2192 \u211d)\n (ha : Summable a) (hb : \u2200 j, Summable (b j))\n (h\u03c9 : Summable (fun m => a m * \u03c9 m)) :\n scalarSeries a (fun m => \u03c9 m + \u2211 j, b j m * c j) =\n scalarSeries a \u03c9 + \u2211 j, (\u2211' m, a m * b j m) * c"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceConfluentPinsAt_addLift",
+ "line": 229,
+ "source_header": "l\n\ntheorem sourceConfluentPinsAt_addLift {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (y : Fin 6 \u2192 \u211d) (\u03c9 : SmoothSample 2 L) :\n sourceConfluentPinsAt L r (addLift hL r y \u03c9) = sourceConfluentPinsAt L r \u03c9 +\n sourcePinCovarianceAt L r *\u1d65 ((sourcePinCovarianceAt L r)\u207b\u00b9 *\u1d65 y"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceAdjustedEndpoints_addLift",
+ "line": 245,
+ "source_header": "l\n\ntheorem sourceAdjustedEndpoints_addLift {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (y : Fin 6 \u2192 \u211d) (\u03c9 : SmoothSample 2 L) :\n sourceAdjustedEndpoints L r (addLift hL r y \u03c9) = sourceAdjustedEndpoints L r \u03c9 +\n sourceRegressionMapAt L r"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceConfluentPinsAt_posteriorSample",
+ "line": 263,
+ "source_header": "l\n\ntheorem sourceConfluentPinsAt_posteriorSample {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 \u2192 \u211d)\n (\u03c9 : SmoothSample 2 L) :\n sourceConfluentPinsAt L r (posteriorSample hL r x \u03c9) ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceAdjustedEndpoints_posteriorSample",
+ "line": 272,
+ "source_header": "l\n\ntheorem sourceAdjustedEndpoints_posteriorSample {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (x : Fin 6 \u2192 \u211d) (\u03c9 : SmoothSample 2 L) :\n sourceAdjustedEndpoints L r (posteriorSample hL r x \u03c9) =\n sourceAdjustedEndpoints L r \u03c9 +\n sourceRegressionMapAt L r (x - sourceConfluentPinsAt L r \u03c9"
+ },
+ {
+ "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 : \u211d} (hL : L \u2260 0) (r : \u211d) :\n Kernel (Fin 6 \u2192 \u211d) (SmoothSample 2"
+ },
+ {
+ "kind": "instance",
+ "unqualified_name": "sourceSmoothKernel_isMarkov",
+ "line": 293,
+ "source_header": ".2)\n\ninstance sourceSmoothKernel_isMarkov {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\n IsMarkovKernel (sourceSmoothKernel hL"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceSmoothKernel_measurable",
+ "line": 298,
+ "source_header": "r)\n\ntheorem sourceSmoothKernel_measurable {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\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 : \u211d} (hL : L \u2260 0) (r : \u211d) (x : Fin 6 \u2192 \u211d) :\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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 \u2192 \u211d) :\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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 \u2192 \u211d) :\n sourceSmoothKernel hL r x {\u03c9 | sourceConfluentPinsAt L r \u03c9 = 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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (x : Fin 6 \u2192 \u211d) :\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 {\u03b9 \u03c4 : Type*} [Countable \u03b9] [Fintype \u03c4]\n (a : \u03c4 \u2192 \u03b9 \u2192 \u211d) (ha : \u2200 j, Summable (a j)) :\n HasGaussianLaw (fun \u03b7 j => scalarSeries (a j) \u03b7) (coeffici"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "residualCoefficient",
+ "line": 373,
+ "source_header": "using hG\n\ndef residualCoefficient (L r : \u211d) (\u03c9 : SmoothSample 2 L) (m : SourceMo"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "scalarSeries_single",
+ "line": 376,
+ "source_header": "L r \u03c9) m\n\nlemma scalarSeries_single {\u03b9 : Type*} [DecidableEq \u03b9] (m : \u03b9) (\u03b7 : \u03b9 \u2192 \u211d) :\n scalarSeries (Pi.single m (1 : \u211d)"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "scalarSeries_coordinate_covariance",
+ "line": 380,
+ "source_header": "le_apply]\n\nlemma scalarSeries_coordinate_covariance {\u03b9 : Type*} [Countable \u03b9]\n (a : \u03b9 \u2192 \u211d) (ha : Summable a) (m : \u03b9) :\n covariance (scalarSeries a) (fun \u03c9 : \u03b9 \u2192 \u211d => \u03c9 m) (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pin_coefficient_covariance",
+ "line": 395,
+ "source_header": "mul_ite]\n\ntheorem pin_coefficient_covariance {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (i : Fin 6) (m : SourceMode 2) :\n covariance (fun \u03c9 => sourceConfluentPinsAt L r \u03c9 i)\n (fun \u03c9 : SmoothSample 2 L => \u03c9.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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (I : Finset (SourceMode 2)) :\n HasGaussianLaw (fun \u03c9 : SmoothSample 2 L =>\n (sourceConfluentPinsAt L r \u03c9, fun m : I => \u03c9.val m)) (smoot"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "finiteLift",
+ "line": 444,
+ "source_header": "val \u03c9.val\n\ndef finiteLift (L r : \u211d) (I : Finset (SourceMode 2)) :\n (Fin 6 \u2192 \u211d) \u2192L[\u211d"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "finiteLift_apply",
+ "line": 449,
+ "source_header": "LinearMap\n\nlemma finiteLift_apply (L r : \u211d) (I : Finset (SourceMode 2)) (y : Fin 6 \u2192 \u211d) (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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (I : Finset (SourceMode 2)) :\n HasGaussianLaw (fun \u03c9 : SmoothSample 2 L =>\n (sourceConfluentPinsAt L r \u03c9, fun m : I => residualCoefficient L r \u03c9 m.val))\n (smoot"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "coefficient_hasGaussianLaw",
+ "line": 474,
+ "source_header": "]\n rfl\n\nlemma coefficient_hasGaussianLaw {L : \u211d} (hL : L \u2260 0) (m : SourceMode 2) :\n HasGaussianLaw (fun \u03c9 : SmoothSample 2 L => \u03c9.val m) (smoot"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "residualCoefficient_zero_covariance",
+ "line": 481,
+ "source_header": "_instance\n\ntheorem residualCoefficient_zero_covariance {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (i : Fin 6) (m : SourceMode 2) :\n covariance (fun \u03c9 => sourceConfluentPinsAt L r \u03c9 i)\n (fun \u03c9 => residualCoefficient L r \u03c9 m) (smoothLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "residualCoefficient_finite_indepFun",
+ "line": 523,
+ "source_header": "sub_self]\n\ntheorem residualCoefficient_finite_indepFun {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (I : Finset (SourceMode 2)) :\n IndepFun (sourceConfluentPinsAt L r)\n (fun (\u03c9 : SmoothSample 2 L) (m : I) => residualCoefficient L r \u03c9 m.val) (smoot"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "residualCoefficient_indepFun",
+ "line": 530,
+ "source_header": "i m.val)\n\ntheorem residualCoefficient_indepFun {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n IndepFun (sourceConfluentPinsAt L r) (fun \u03c9 m => residualCoefficient L r \u03c9 m)\n (smoot"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceNormalizedEndpoints_measurable",
+ "line": 551,
+ "source_header": "nditional\n\ntheorem sourceNormalizedEndpoints_measurable {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 \u2192 \u211d) :\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 : \u211d} (hL : L \u2260 0) (r b : \u211d)\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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (\u03c9 : 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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (x : Fin 6 \u2192 \u211d) (\u03c9 : SmoothSample 2 L) :\n addLift hL r x (posteriorSample hL r 0 \u03c9) = posterior"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "addLift_observation_residual",
+ "line": 619,
+ "source_header": "g_apply]\n abel\n\ntheorem addLift_observation_residual {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (\u03c9 : SmoothSample 2 L) :\n addLift hL r (sourceConfluentPinsAt L r \u03c9) (posteriorSampl"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "posteriorSample_zero_inclusion",
+ "line": 624,
+ "source_header": "iorSample_self]\n\ntheorem posteriorSample_zero_inclusion {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (\u03c9 : SmoothSample 2 L) :\n sampleInclusion 2 L (posteriorSample hL r 0 \u03c9) = residualCo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "posteriorSample_zero_indepFun",
+ "line": 632,
+ "source_header": ", Pi.neg_apply]\n\ntheorem posteriorSample_zero_indepFun {L : \u211d} (hL : L \u2260 0) (r : \u211d)\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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n HasCondDistrib (id : SmoothSample 2 L \u2192 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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) {E : Type*} [MeasurableSpace E]\n (F : SmoothSample 2 L \u2192 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 : \u2115) (L : \u211d) :\n Measurable (smo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceSmoothKernel_field_hasCondDistrib",
+ "line": 696,
+ "source_header": "ion_measurable d L)\n\ntheorem sourceSmoothKernel_field_hasCondDistrib {L : \u211d} (hL : L \u2260 0) (r : \u211d)\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 : \u211d} (hL : L \u2260 0) :\n \u2200\u1da0 r in \ud835\udcdd[>] (0 : \u211d),\n HasCondDistrib (id : SmoothSample 2 L \u2192 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 : \u211d} (hL : L \u2260 0)\n {E : Type*} [MeasurableSpace E] (F : SmoothSample 2 L \u2192 E) (hF : Measurable F) :\n \u2200\u1da0 r in \ud835\udcdd[>] (0 : \u211d),\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 : \u211d) (\u03c9 : 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 : \u211d) (\u03c9 : 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 : \u211d) : 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 : \u211d) : 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 : \u211d) : Matrix (Fin 6"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceRegressionMatrixAt",
+ "line": 56,
+ "source_header": "othLaw 2 L)\n\ndef sourceRegressionMatrixAt (L r : \u211d) : Matrix (Fin 6"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceRegressionMapAt",
+ "line": 59,
+ "source_header": "ceAt L r)\u207b\u00b9\n\ndef sourceRegressionMapAt (L r : \u211d) : (Fin 6 \u2192 \u211d) \u2192L[\u211d]"
+ },
+ {
+ "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 : \u211d) :\n (Fin 12 \u2192 \u211d) \u2192L[\u211d] ((Fin 6 \u2192 \u211d) \u00d7 (Fin 6 \u2192 \u211d)) wh"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "endpointObservationMap_actual",
+ "line": 76,
+ "source_header": "fun_prop\n\nlemma endpointObservationMap_actual (L r : \u211d) (\u03c9 : SmoothSample 2 L) :\n endpointObservationMap r (rawPinsWithHessians L r \u03c9) =\n (sourceConfluentPinsAt L r \u03c9, 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 : \u211d} (hL : L \u2260 0) (r : \u211d) :\n HasGaussianLaw (fun \u03c9 => (sourceConfluentPinsAt L r \u03c9, sourceAdjustedEndpoints L r \u03c9))"
+ },
+ {
+ "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 : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n \u2200 i j, covariance (fun \u03c9 => sourceConfluentPinsAt L r \u03c9 i)\n (fun \u03c9 => sourceAdjustedEndpoints L r \u03c9 j) (smoothLaw 2 L) =\n \u2211 l, sourceRegressionMapAt L r (Pi.single l 1) j *\n covariance (fun \u03c9 => sourceConfluentPinsAt L r \u03c9 i)\n (fun \u03c9 => sourceConfluentPinsAt L r \u03c9 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 : \u211d) (\u03c9 : SmoothSamp"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceEndpointKernel",
+ "line": 135,
+ "source_header": "fluentPinsAt L r \u03c9)\n\n/-- The canonical actual endpoint kernel, specified at every pin value. -/\ndef sourceEndpointKernel (L r : \u211d) : Kernel (F"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpointKernel_markov",
+ "line": 140,
+ "source_header": "ressionMapAt L r) 0 0\n\ntheorem sourceEndpointKernel_markov {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\n IsMarkovKernel (sour"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpointKernel_measurable",
+ "line": 146,
+ "source_header": "rnel\n infer_instance\n\ntheorem sourceEndpointKernel_measurable (L r : \u211d) : 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 : \u211d} (hL : L \u2260 0) (r : \u211d) (x : Fin 6 \u2192 \u211d) :\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 : \u211d} (hL : L \u2260 0) (r : \u211d)\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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n IsMarkovKernel (sourceEndpointKernel L r) \u2227\n Measurable (sourceEndpointKernel L r) \u2227\n (\u2200 x, sourceEndpointKernel L r x =\n ((smoothLaw 2 L).map (sourceEndpointResidual L r)).map\n (fun v => v + sourceRegressionMapAt L r x)) \u2227\n HasCondDistrib (sourceAdjustedEndpoints L r) (sourceConfluentPinsAt L r)\n (sourceEndpoint"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceNormalizedEndpoints",
+ "line": 184,
+ "source_header": "nel_hasCondDistrib hL r hG\u27e9\n\n/-- The literal physical normalized endpoint vector in LM006 order. -/\ndef sourceNormalizedEndpoints (L r : \u211d) (\u03c9 :"
+ },
+ {
+ "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": "\u2192 \u211d := ![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 : \u211d) (\u03c9 : SmoothSample 2 L)\n (h3 : sourceConfluentPinsAt L r \u03c9 3 = 0) (h4 : sourceConfluentPinsAt L r \u03c9 4 = 0) :\n sourceAdjustedEndpoints L r \u03c9 ="
+ },
+ {
+ "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 : \u211d) (\u03c9 : SmoothSample 2 L)\n (hp : sourceConfluentPinsAt L r \u03c9 = sourcePrescribedPins r b) :\n sourceAdjustedEndpoints L r \u03c9"
+ }
+ ]
+ },
+ {
+ "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 : \u2115) (L : \u211d) (k : \u2115) (u : Fin k \u2192 (Fin d \u2192 \u211d))\n (m : SourceMode d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "derivativeMajorant_nonneg",
+ "line": 19,
+ "source_header": "j\u2016\n\ntheorem derivativeMajorant_nonneg (d : \u2115) (L : \u211d) (k : \u2115)\n (u : Fin k \u2192 (Fin d \u2192 \u211d)) (m : SourceMode d) :\n 0 \u2264 derivativeMajorant d L k"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "derivativeMajorant_summable",
+ "line": 25,
+ "source_header": "_))\n\ntheorem derivativeMajorant_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0) (k : \u2115)\n (u : Fin k \u2192 (Fin d \u2192 \u211d)) : Summable (derivativeMajorant d L k"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "derivativeCoefficient_bound",
+ "line": 29,
+ "source_header": "t _\n\ntheorem derivativeCoefficient_bound (d : \u2115) {L : \u211d} (hL : L \u2260 0) (k : \u2115)\n (u : Fin k \u2192 (Fin d \u2192 \u211d)) (m : SourceMode d) (x : Fin d \u2192 \u211d) :\n \u2016derivativeCoefficient d L k x u m\u2016 \u2264 derivativeMajorant d L k"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "derivativeCoefficient_continuous",
+ "line": 36,
+ "source_header": ")))\n\ntheorem derivativeCoefficient_continuous (d : \u2115) (L : \u211d) (k : \u2115)\n (u : Fin k \u2192 (Fin d \u2192 \u211d)) (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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k l : \u2115) (u : Fin k \u2192 (Fin d \u2192 \u211d)) (v : Fin l \u2192 (Fin d \u2192 \u211d)) :\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 : \u2115) {L : \u211d}\n (hL : L \u2260 0) (k l : \u2115) (u : Fin k \u2192 (Fin d \u2192 \u211d))\n (v : Fin l \u2192 (Fin d \u2192 \u211d)) :\n Continuous (fun xy : (Fin d \u2192 \u211d) \u00d7 (Fin d \u2192 \u211d) =>\n cov[fun \u03c9 => iteratedFDeriv \u211d k (smoothSourceField d L \u03c9) xy.1 u,\n fun \u03c9 => iteratedFDeriv \u211d l (smoothSourceField d L \u03c9) 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k : \u2115) (x : Fin d \u2192 \u211d) (u : Fin k \u2192 (Fin d \u2192 \u211d)) :\n (\u222b \u03c9, iteratedFDeriv \u211d k (smoothSourceField d L \u03c9) x u \u2202smoothLaw 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 : \u2115) (L : \u211d) (m : SourceMode d) :\n ContDiff \u211d (\u22a4 : \u2115\u221e) (modeCoefficient d L m"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weighted_iteratedFDeriv",
+ "line": 31,
+ "source_header": "p\n\nprivate theorem weighted_iteratedFDeriv (d : \u2115) (L : \u211d) (m : SourceMode d)\n (c : \u211d) (k : \u2115) (x : Fin d \u2192 \u211d) :\n iteratedFDeriv \u211d k (fun y => modeCoefficient d L m y * c) x =\n c \u2022 iteratedFDeriv \u211d k (modeCoefficient d L m)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weighted_iteratedFDeriv_bound",
+ "line": 43,
+ "source_header": "]\n\nprivate theorem weighted_iteratedFDeriv_bound (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (m : SourceMode d) (c : \u211d) (k : \u2115) (x : Fin d \u2192 \u211d) :\n \u2016iteratedFDeriv \u211d k (fun y => modeCoefficient d L m y * c) x\u2016 \u2264\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 : \u2115) (L : \u211d) (k : \u2115) (x : Fin d \u2192 \u211d)\n (u : Fin k \u2192 (Fin d \u2192 \u211d)) (m : SourceMode d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "derivativeCoefficient_summable",
+ "line": 56,
+ "source_header": "x u\n\ntheorem derivativeCoefficient_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k : \u2115) (x : Fin d \u2192 \u211d) (u : Fin k \u2192 (Fin d \u2192 \u211d)) :\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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample d L) (k : \u2115) (x : Fin d \u2192 \u211d)\n (u : Fin k \u2192 (Fin d \u2192 \u211d)) :\n iteratedFDeriv \u211d k (smoothSourceField d L \u03c9) 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 {\u03b9 : Type*} [Countable \u03b9] (n : \u2115) (a : Fin n \u2192 \u03b9 \u2192 \u211d)\n (ha : \u2200 j, Summable (a j)) (c : Fin n \u2192 \u211d) :\n HasGaussianLaw (fun \u03c9 => \u2211 j, c j * scalarSeries (a j) \u03c9) (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 {\u03b9 : Type*} [Countable \u03b9] (n : \u2115) (a : Fin n \u2192 \u03b9 \u2192 \u211d)\n (ha : \u2200 j, Summable (a j)) :\n HasGaussianLaw (fun \u03c9 j => scalarSeries (a j) \u03c9) (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 : \u2115) {L : \u211d}\n (hL : L \u2260 0) (n : \u2115) (k : Fin n \u2192 \u2115) (x : Fin n \u2192 (Fin d \u2192 \u211d))\n (u : \u2200 j, Fin (k j) \u2192 (Fin d \u2192 \u211d)) :\n HasGaussianLaw (fun \u03c9 j =>\n iteratedFDeriv \u211d (k j) (smoothSourceField d L \u03c9) (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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k l : \u2115) (x y : Fin d \u2192 \u211d) (u : Fin k \u2192 (Fin d \u2192 \u211d))\n (v : Fin l \u2192 (Fin d \u2192 \u211d)) :\n cov[fun \u03c9 => iteratedFDeriv \u211d k (smoothSourceField d L \u03c9) x u,\n fun \u03c9 => iteratedFDeriv \u211d l (smoothSourceField d L \u03c9) y v; smoothLaw d L] =\n \u2211' 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 \u2192"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "rawDerivativePoint",
+ "line": 25,
+ "source_header": "]\n\ndef rawDerivativePoint (r : \u211d) : Fin 12 \u2192 (Fin 2 \u2192 \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "rawDerivativeDirections",
+ "line": 29,
+ "source_header": "]\n\ndef rawDerivativeDirections : (i : Fin 12) \u2192 Fin (rawDerivativeOrder i) \u2192 (Fin 2 \u2192 \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "rawDerivativeCoefficient",
+ "line": 34,
+ "source_header": "Y\n\ndef rawDerivativeCoefficient (L r : \u211d) (i : Fin 12) (m : SourceMode 2) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pinObservationMap",
+ "line": 38,
+ "source_header": "m\n\ndef pinObservationMap (r : \u211d) : (Fin 12 \u2192 \u211d) \u2192L[\u211d] (Fin 6 \u2192 \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "adjustedObservationMap",
+ "line": 41,
+ "source_header": ")\n\ndef adjustedObservationMap (r : \u211d) : (Fin 12 \u2192 \u211d) \u2192L[\u211d] (Fin 6 \u2192 \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pinCoefficient",
+ "line": 44,
+ "source_header": ")\n\ndef pinCoefficient (L r : \u211d) (i : Fin 6) (m : SourceMode 2) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "adjustedCoefficient",
+ "line": 47,
+ "source_header": "i\n\ndef adjustedCoefficient (L r : \u211d) (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 : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample 2 L) (k : \u2115) (x : Fin 2 \u2192 \u211d) (u : Fin k \u2192 (Fin 2 \u2192 \u211d)) :\n Summable (fun m => derivativeCoefficient 2 L k x u m * sampleInclusion 2 L \u03c9 m"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "finiteSeries_map",
+ "line": 63,
+ "source_header": "g\n\nprivate theorem finiteSeries_map {\u03b9 : Type*} {n q : \u2115}\n (a : Fin n \u2192 \u03b9 \u2192 \u211d) (\u03c9 : \u03b9 \u2192 \u211d)\n (ha : \u2200 i, Summable (fun m => a i m * \u03c9 m))\n (T : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin q \u2192 \u211d)) :\n T (fun i => scalarSeries (a i) \u03c9) =\n (fun j => scalarSeries (fun m => T (fun i => a i m) j) \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "finiteCoefficient_map_summable",
+ "line": 86,
+ "source_header": "m\n\nprivate theorem finiteCoefficient_map_summable {\u03b9 : Type*} {n q : \u2115}\n (a : Fin n \u2192 \u03b9 \u2192 \u211d) (ha : \u2200 i, Summable (a i))\n (T : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin q \u2192 \u211d)) (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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (\u03c9 : SmoothSample 2 L) :\n rawPinsWithHessians L r \u03c9 =\n (fun i => scalarSeries (rawDerivativeCoefficient L r i) (sampleInclusion 2 L \u03c9)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pinCoefficient_summable",
+ "line": 117,
+ "source_header": "l\n\ntheorem pinCoefficient_summable {L : \u211d} (hL : L \u2260 0) (r : \u211d) (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 : \u211d} (hL : L \u2260 0) (r : \u211d) (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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (\u03c9 : SmoothSample 2 L) :\n sourceConfluentPinsAt L r \u03c9 =\n (fun i => scalarSeries (pinCoefficient L r i) (sampleInclusion 2 L \u03c9)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceAdjustedEndpoints_series",
+ "line": 141,
+ "source_header": ")\n\ntheorem sourceAdjustedEndpoints_series {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (\u03c9 : SmoothSample 2 L) :\n sourceAdjustedEndpoints L r \u03c9 =\n (fun i => scalarSeries (adjustedCoefficient L r i) (sampleInclusion 2 L \u03c9)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourcePinCovarianceAt_coefficient",
+ "line": 153,
+ "source_header": ")\n\ntheorem sourcePinCovarianceAt_coefficient {L : \u211d} (hL : L \u2260 0) (r : \u211d) (i j : Fin 6) :\n sourcePinCovarianceAt L r i j = \u2211' 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 : \u211d} (hL : L \u2260 0) (r : \u211d) (i j : Fin 6) :\n sourceCrossCovarianceAt L r i j =\n \u2211' 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 : \u211d} (hL : L \u2260 0) (r : \u211d) (i j : Fin 6) :\n sourceEndpointCovarianceAt L r i j =\n \u2211' m, adjustedCoefficient L r i m * adjustedCoefficient L r j"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "axisMap",
+ "line": 194,
+ "source_header": "ins\n\ndef axisMap : \u211d \u2192L[\u211d] (Fin 2 \u2192 \u211d) where\n toFu"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "mode_smooth",
+ "line": 200,
+ "source_header": "rop\n\ntheorem mode_smooth (L : \u211d) (m : SourceMode 2) :\n ContDiff \u211d (\u22a4 : \u2115\u221e) (modeCoefficient 2 L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "axis_iteratedDeriv",
+ "line": 214,
+ "source_header": "rop\n\ntheorem axis_iteratedDeriv (f : (Fin 2 \u2192 \u211d) \u2192 \u211d)\n (hf : ContDiff \u211d (\u22a4 : \u2115\u221e) f) (k : \u2115) (t : \u211d) :\n iteratedDeriv k (fun s => f ![s,0]) t =\n iteratedFDeriv \u211d 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 \u2192 \u211d) \u2192 \u211d)\n (hf : ContDiff \u211d (\u22a4 : \u2115\u221e) f) :\n ContDiff \u211d (\u22a4 : \u2115\u221e) (fun t => fderiv \u211d f ![t,0] directio"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "axis_transverse_iteratedDeriv",
+ "line": 230,
+ "source_header": "iff\n\ntheorem axis_transverse_iteratedDeriv (f : (Fin 2 \u2192 \u211d) \u2192 \u211d)\n (hf : ContDiff \u211d (\u22a4 : \u2115\u221e) f) (k : \u2115) (t : \u211d) :\n iteratedDeriv k (fun s => fderiv \u211d f ![s,0] directionY) t =\n iteratedFDeriv \u211d (k+1) f ![t,0] (Fin.snoc (fun _ => directionX) directio"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "modeF",
+ "line": 245,
+ "source_header": "st]\n\ndef modeF (L : \u211d) (m : SourceMode 2) (t : \u211d)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "modeH",
+ "line": 247,
+ "source_header": ",0]\ndef modeH (L : \u211d) (m : SourceMode 2) (t : \u211d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeH_eq",
+ "line": 249,
+ "source_header": "] m\n\ntheorem modeH_eq (L : \u211d) (m : SourceMode 2) :\n modeH L m = fun t => fderiv \u211d (modeCoefficient 2 L m) ![t,0] directi"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeF_C3",
+ "line": 254,
+ "source_header": "y _\n\ntheorem modeF_C3 (L : \u211d) (m : SourceMode 2) : ContDiff \u211d 3 (modeF L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeH_C2",
+ "line": 257,
+ "source_header": "mp)\n\ntheorem modeH_C2 (L : \u211d) (m : SourceMode 2) : ContDiff \u211d 2 (modeH L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeF_deriv",
+ "line": 261,
+ "source_header": "mp)\n\ntheorem modeF_deriv (L : \u211d) (m : SourceMode 2) (t : \u211d) :\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 : \u211d) (m : SourceMode 2) (t : \u211d) :\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 : \u211d) (m : SourceMode 2) (t : \u211d) :\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 : \u211d) (m : SourceMode 2) (t : \u211d) :\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 : \u211d) (m : SourceMode 2) (t : \u211d) :\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 : \u211d) (m : SourceMode 2) (t : \u211d)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "modeRawValues",
+ "line": 311,
+ "source_header": "] m\n\ndef modeRawValues (L r : \u211d) (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 : \u211d) (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 : \u211d) (m : SourceMode 2) : Fin 6"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pinCoefficient_explicit",
+ "line": 400,
+ "source_header": "r]\n\ntheorem pinCoefficient_explicit (L r : \u211d) (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 : \u211d) (m : SourceMode 2) : Fin 6"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "adjustedCoefficient_explicit",
+ "line": 416,
+ "source_header": "2)]\n\ntheorem adjustedCoefficient_explicit (L r : \u211d) (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 : \u211d) (k : \u2115) (u : Fin k \u2192 (Fin 2 \u2192 \u211d))\n (m : SourceMode 2) (w : \u211d \u2192 \u211d) (r : \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weighted_integrand_bound",
+ "line": 442,
+ "source_header": "] u m\n\ntheorem weighted_integrand_bound {L : \u211d} (hL : L \u2260 0) (k : \u2115)\n (u : Fin k \u2192 (Fin 2 \u2192 \u211d)) (m : SourceMode 2) (w : \u211d \u2192 \u211d)\n (K : \u211d) (hK : 0 \u2264 K)\n (hwbound : \u2200 t \u2208 Set.uIoc (-1/2 : \u211d) (1/2 : \u211d), |w t| \u2264 K)\n (r t : \u211d) (ht : t \u2208 Set.uIoc (-1/2 : \u211d) (1/2 : \u211d)) :\n \u2016w t * derivativeCoefficient 2 L k ![r*t,0] u m\u2016 \u2264\n K * derivativeMajorant 2 L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weightedDerivativeIntegral_continuous",
+ "line": 453,
+ "source_header": "_) hK\n\ntheorem weightedDerivativeIntegral_continuous {L : \u211d} (hL : L \u2260 0) (k : \u2115)\n (u : Fin k \u2192 (Fin 2 \u2192 \u211d)) (m : SourceMode 2) (w : \u211d \u2192 \u211d) (hw : Continuous w)\n (K : \u211d) (hK : 0 \u2264 K)\n (hwbound : \u2200 t \u2208 Set.uIoc (-1/2 : \u211d) (1/2 : \u211d), |w t| \u2264 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 : \u211d} (hL : L \u2260 0) (k : \u2115)\n (u : Fin k \u2192 (Fin 2 \u2192 \u211d)) (m : SourceMode 2) (w : \u211d \u2192 \u211d)\n (K : \u211d) (hK : 0 \u2264 K)\n (hwbound : \u2200 t \u2208 Set.uIoc (-1/2 : \u211d) (1/2 : \u211d), |w t| \u2264 K) (r : \u211d) :\n \u2016weightedDerivativeIntegral L k u m w r\u2016 \u2264 K * derivativeMajorant 2 L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weightedDerivativeIntegral_zero",
+ "line": 482,
+ "source_header": "ing h\n\ntheorem weightedDerivativeIntegral_zero (L : \u211d) (k : \u2115)\n (u : Fin k \u2192 (Fin 2 \u2192 \u211d)) (m : SourceMode 2) (w : \u211d \u2192 \u211d) :\n weightedDerivativeIntegral L k u m w 0 =\n (\u222b t in (-1/2 : \u211d)..(1/2 : \u211d), w t) * derivativeCoefficient 2 L k"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "peanoLeft",
+ "line": 497,
+ "source_header": "grals\n\ndef peanoLeft (t : \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "peanoRight",
+ "line": 499,
+ "source_header": "1/2-t\ndef peanoRight (t : \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "peanoCubic",
+ "line": 500,
+ "source_header": "t+1/2\ndef peanoCubic (t : \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "peano_one_bound",
+ "line": 501,
+ "source_header": "4-t^2\n\nprivate theorem peano_one_bound (t : \u211d)\n (_ht : t \u2208 Set.uIoc (-1/2 : \u211d) (1/2 : \u211d)) : |(1 : \u211d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "peano_left_bound",
+ "line": 504,
+ "source_header": "m_num\n\nprivate theorem peano_left_bound (t : \u211d)\n (ht : t \u2208 Set.uIoc (-1/2 : \u211d) (1/2 : \u211d)) : |peanoLeft t"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "peano_right_bound",
+ "line": 510,
+ "source_header": "t.1]\u27e9\n\nprivate theorem peano_right_bound (t : \u211d)\n (ht : t \u2208 Set.uIoc (-1/2 : \u211d) (1/2 : \u211d)) : |peanoRight t"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "peano_cubic_bound",
+ "line": 516,
+ "source_header": "t.2]\u27e9\n\nprivate theorem peano_cubic_bound (t : \u211d)\n (ht : t \u2208 Set.uIoc (-1/2 : \u211d) (1/2 : \u211d)) : |peanoCubic t"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "peano_kernel_masses",
+ "line": 525,
+ "source_header": "g t]\u27e9\n\ntheorem peano_kernel_masses :\n (\u222b _t in (-1/2 : \u211d)..(1/2 : \u211d), (1 : \u211d)) = 1 \u2227\n (\u222b t in (-1/2 : \u211d)..(1/2 : \u211d), peanoLeft t) = 1/2 \u2227\n (\u222b t in (-1/2 : \u211d)..(1/2 : \u211d), peanoRight t) = 1/2 \u2227\n 6 * (\u222b t in (-1/2 : \u211d)..(1/2 : \u211d), 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 : \u211d) (i : Fin 6) (m : SourceMode"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "regularizedAdjustedCoefficient",
+ "line": 555,
+ "source_header": "ic r] i\n\ndef regularizedAdjustedCoefficient (L r : \u211d) (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 : \u211d) (hr : r \u2260 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 : \u211d) (hr : r \u2260 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 : \u211d) (i : Fin 6) (m : SourceMo"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "contactAdjustedCoefficient",
+ "line": 623,
+ "source_header": "astSucc m\n\ndef contactAdjustedCoefficient (L : \u211d) (i : Fin 6) (m : SourceMo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "contactPinCoefficient_summable",
+ "line": 631,
+ "source_header": "onY] m] i\n\ntheorem contactPinCoefficient_summable {L : \u211d} (hL : L \u2260 0) (i : Fin 6) :\n Summable (contactPinCoeffic"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "contactAdjustedCoefficient_summable",
+ "line": 635,
+ "source_header": ".castSucc\n\ntheorem contactAdjustedCoefficient_summable {L : \u211d} (hL : L \u2260 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 : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample 2 L) (i : Fin 6) :\n sourcePinVector L \u03c9 i =\n scalarSeries (contactPinCoefficient L i) (sampleInclusi"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_div",
+ "line": 660,
+ "source_header": "castSucc)\n\nprivate theorem scalarSeries_div {\u03b9 : Type*} (a : \u03b9 \u2192 \u211d) (\u03c9 : \u03b9 \u2192 \u211d) (c : \u211d) :\n scalarSeries (fun m => a m / c) \u03c9 = scalarSerie"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_neg",
+ "line": 664,
+ "source_header": "iv_const]\n\nprivate theorem scalarSeries_neg {\u03b9 : Type*} (a : \u03b9 \u2192 \u211d) (\u03c9 : \u03b9 \u2192 \u211d) :\n scalarSeries (fun m => -a m) \u03c9 = -scalarS"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceContactEndpointVector_eq_contactSeries",
+ "line": 668,
+ "source_header": "tsum_neg]\n\ntheorem sourceContactEndpointVector_eq_contactSeries {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample 2 L) (i : Fin 6) :\n sourceContactEndpointVector L \u03c9 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 : \u211d} (hL : L \u2260 0)\n (i j : Fin 6) : sourcePinCovariance L i j =\n \u2211' 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 : \u211d}\n (hL : L \u2260 0) (i j : Fin 6) : sourceContactEndpointCrossCovariance L i j =\n \u2211' 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 : \u211d}\n (hL : L \u2260 0) (i j : Fin 6) : sourceContactEndpointCovariance L i j =\n \u2211' m, contactAdjustedCoefficient L i m * contactAdjustedCoeffici"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "modeComponentMajorant",
+ "line": 738,
+ "source_header": "entLimits\n\ndef modeComponentMajorant (L : \u211d) (m : SourceMode 2) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "confluentModeMajorant",
+ "line": 748,
+ "source_header": "tionY] m]\n\ndef confluentModeMajorant (L : \u211d) (m : SourceMo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeComponentMajorant_nonneg",
+ "line": 751,
+ "source_header": "ant L m s\n\nprivate theorem modeComponentMajorant_nonneg (L : \u211d) (m : SourceMode 2) (s : Fin 8) :\n 0 \u2264 modeComponentMajor"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "confluentModeMajorant_nonneg",
+ "line": 756,
+ "source_header": "2 L _ _ m\n\ntheorem confluentModeMajorant_nonneg (L : \u211d) (m : SourceMode 2) :\n 0 \u2264 confluentModeMaj"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "confluentModeMajorant_summable",
+ "line": 760,
+ "source_header": "g L m s))\n\ntheorem confluentModeMajorant_summable {L : \u211d} (hL : L \u2260 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 : \u211d) (m : SourceMode 2) (s : Fin 8) :\n 6 * modeComponentMajorant L m s \u2264 confluentModeMaj"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "component_le_majorant",
+ "line": 773,
+ "source_header": "m_univ s)\n\nprivate theorem component_le_majorant (L : \u211d) (m : SourceMode 2) (s : Fin 8) :\n modeComponentMajorant L m s \u2264 confluentModeMaj"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "average_norm_le",
+ "line": 779,
+ "source_header": "linarith\n\nprivate theorem average_norm_le (a b M : \u211d) (ha : \u2016a\u2016 \u2264 M) (hb : \u2016b\u2016 \u2264 M) :\n \u2016(a+"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "integral_bound_one",
+ "line": 787,
+ "source_header": "= by ring\n\nprivate theorem integral_bound_one {L : \u211d} (hL : L \u2260 0) (k : \u2115)\n (u : Fin k \u2192 (Fin 2 \u2192 \u211d)) (m : SourceMode 2) (w : \u211d \u2192 \u211d)\n (hw : \u2200 t \u2208 Set.uIoc (-1/2 : \u211d) (1/2 : \u211d), |w t| \u2264 1) (r : \u211d) :\n \u2016weightedDerivativeIntegral L k u m w r\u2016 \u2264 derivativeMajorant"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeF_norm_bound",
+ "line": 794,
+ "source_header": "] using h\n\nprivate theorem modeF_norm_bound {L : \u211d} (hL : L \u2260 0) (m : SourceMode 2) (t : \u211d) :\n \u2016modeF L m t\u2016 \u2264 derivativeMajorant 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "regularizedPinCoefficient_bound",
+ "line": 799,
+ "source_header": "m ![t,0]\n\ntheorem regularizedPinCoefficient_bound {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (i : Fin 6) (m : SourceMode 2) :\n \u2016regularizedPinCoefficient L r i m\u2016 \u2264 confluentModeMaj"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "regularizedAdjustedCoefficient_bound",
+ "line": 826,
+ "source_header": "ant L m 5\n\ntheorem regularizedAdjustedCoefficient_bound {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (i : Fin 6) (m : SourceMode 2) :\n \u2016regularizedAdjustedCoefficient L r i m\u2016 \u2264 confluentModeMaj"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "helper_left_bound",
+ "line": 864,
+ "source_header": "luentLimits\n\nprivate theorem helper_left_bound (t : \u211d)\n (ht : t \u2208 Set.uIoc (-1/2 : \u211d) (1/2 : \u211d)) : |peano"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "helper_right_bound",
+ "line": 870,
+ "source_header": "ith [ht.1]\u27e9\n\nprivate theorem helper_right_bound (t : \u211d)\n (ht : t \u2208 Set.uIoc (-1/2 : \u211d) (1/2 : \u211d)) : |peanoR"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "helper_cubic_bound",
+ "line": 876,
+ "source_header": "ith [ht.2]\u27e9\n\nprivate theorem helper_cubic_bound (t : \u211d)\n (ht : t \u2208 Set.uIoc (-1/2 : \u211d) (1/2 : \u211d)) : |peanoC"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "regularizedPinCoefficient_continuous",
+ "line": 885,
+ "source_header": "_nonneg t]\u27e9\n\ntheorem regularizedPinCoefficient_continuous {L : \u211d} (hL : L \u2260 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 : \u211d} (hL : L \u2260 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 : \u211d) (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 : \u211d) (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 : \u211d) : Matrix (Fin"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "regularizedCrossCovariance",
+ "line": 1001,
+ "source_header": "cient L r j m\n\ndef regularizedCrossCovariance (L r : \u211d) : Matrix (Fin"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "regularizedEndpointCovariance",
+ "line": 1004,
+ "source_header": "cient L r j m\n\ndef regularizedEndpointCovariance (L r : \u211d) : Matrix (Fin"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "regularizedGram_continuous",
+ "line": 1007,
+ "source_header": "cient L r j m\n\nprivate theorem regularizedGram_continuous {L : \u211d} (hL : L \u2260 0)\n (a b : \u211d \u2192 Fin 6 \u2192 SourceMode 2 \u2192 \u211d)\n (ha : \u2200 i m, Continuous (fun r => a r i m))\n (hb : \u2200 i m, Continuous (fun r => b r i m))\n (hba : \u2200 r i m, \u2016a r i m\u2016 \u2264 confluentModeMajorant L m)\n (hbb : \u2200 r i m, \u2016b r i m\u2016 \u2264 confluentModeMajorant L m) :\n Continuous (fun r => (fun i j => \u2211' 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 : \u211d} (hL : L \u2260 0) :\n Continuous (regularizedPin"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "regularizedCrossCovariance_continuous",
+ "line": 1034,
+ "source_header": "ent_bound hL)\n\ntheorem regularizedCrossCovariance_continuous {L : \u211d} (hL : L \u2260 0) :\n Continuous (regularizedCross"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "regularizedEndpointCovariance_continuous",
+ "line": 1040,
+ "source_header": "ent_bound hL)\n\ntheorem regularizedEndpointCovariance_continuous {L : \u211d} (hL : L \u2260 0) :\n Continuous (regularizedEndpoint"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourcePinCovarianceAt_eq_regularized",
+ "line": 1046,
+ "source_header": "ent_bound hL)\n\ntheorem sourcePinCovarianceAt_eq_regularized {L : \u211d} (hL : L \u2260 0) (r : \u211d) (hr : r \u2260 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 : \u211d} (hL : L \u2260 0) (r : \u211d) (hr : r \u2260 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 : \u211d} (hL : L \u2260 0) (r : \u211d) (hr : r \u2260 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 : \u211d} (hL : L \u2260 0) :\n regularizedPinCovariance L 0 = sourcePi"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "regularizedCrossCovariance_zero",
+ "line": 1080,
+ "source_header": "ficient_zero]\n\ntheorem regularizedCrossCovariance_zero {L : \u211d} (hL : L \u2260 0) :\n regularizedCrossCovariance L 0 = sourceContactEndpointCros"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "regularizedEndpointCovariance_zero",
+ "line": 1087,
+ "source_header": "ficient_zero]\n\ntheorem regularizedEndpointCovariance_zero {L : \u211d} (hL : L \u2260 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 : \u211d} (hL : L \u2260 0) :\n Tendsto (sourcePinCovarianceAt L) (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd (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 : \u211d} (hL : L \u2260 0) :\n Tendsto (sourceCrossCovarianceAt L) (\ud835\udcdd[>] (0 : \u211d))\n (\ud835\udcdd (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 : \u211d} (hL : L \u2260 0) :\n Tendsto (sourceEndpointCovarianceAt L) (\ud835\udcdd[>] (0 : \u211d))\n (\ud835\udcdd (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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k : \u2115) (x : Fin d \u2192 \u211d) (u : Fin k \u2192 (Fin d \u2192 \u211d)) :\n (\u222b \u03c9, iteratedFDeriv \u211d k (smoothSourceField d L \u03c9) x u \u2202smoothLaw d L) ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rawPinsWithHessians_integral_zero",
+ "line": 39,
+ "source_header": ")\n\ntheorem rawPinsWithHessians_integral_zero {L : \u211d} (hL : L \u2260 0) (r : \u211d) (i : Fin 12) :\n (\u222b \u03c9, rawPinsWithHessians L r \u03c9 i \u2202smoothLaw 2 L) ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rawPinsWithHessians_integral_vector_zero",
+ "line": 52,
+ "source_header": "]\n\ntheorem rawPinsWithHessians_integral_vector_zero {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\n (\u222b \u03c9, rawPinsWithHessians L r \u03c9 \u2202smoothLaw 2 L) ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourcePins_adjusted_integral_zero",
+ "line": 63,
+ "source_header": "i\n\ntheorem sourcePins_adjusted_integral_zero {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\n (\u222b \u03c9, (sourceConfluentPinsAt L r \u03c9, sourceAdjustedEndpoints L r \u03c9) \u2202smoothLaw 2 L) ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceConfluentPinsAt_integral_zero",
+ "line": 71,
+ "source_header": "h\n\ntheorem sourceConfluentPinsAt_integral_zero {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\n (\u222b \u03c9, sourceConfluentPinsAt L r \u03c9 \u2202smoothLaw 2 L) ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceAdjustedEndpoints_integral_zero",
+ "line": 77,
+ "source_header": "h\n\ntheorem sourceAdjustedEndpoints_integral_zero {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\n (\u222b \u03c9, sourceAdjustedEndpoints L r \u03c9 \u2202smoothLaw 2 L) ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpointResidual_integral_zero",
+ "line": 83,
+ "source_header": "h\n\ntheorem sourceEndpointResidual_integral_zero {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\n (\u222b \u03c9, sourceEndpointResidual L r \u03c9 \u2202smoothLaw 2 L) ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpointResidual_covariance",
+ "line": 92,
+ "source_header": "]\n\ntheorem sourceEndpointResidual_covariance {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (i j : Fin 6) :\n covariance (fun \u03c9 => sourceEndpointResidual L r \u03c9 i)\n (fun \u03c9 => sourceEndpointResidual L r \u03c9 j) (smoothLaw 2 L) =\n sourceEndpointCovarianceAt L r i j -\n (sourceCrossCovarianceAt L r * (sourcePinCovarianceAt L r)\u207b\u00b9 *\n (sourceCrossCovarianceAt L r)\u1d40) i"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "finiteGaussian_law_parameters",
+ "line": 149,
+ "source_header": "l\n\nlemma finiteGaussian_law_parameters {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} {n : \u2115} {Z : \u03a9 \u2192 Fin n \u2192 \u211d}\n (hZ : HasGaussianLaw Z P) (m : Fin n \u2192 \u211d) (hm : (\u222b \u03c9, Z \u03c9 \u2202P) = m)\n (S : Matrix (Fin n) (Fin n) \u211d)\n (hcov : \u2200 i j, covariance (fun \u03c9 => Z \u03c9 i) (fun \u03c9 => Z \u03c9 j) P = S i j) :\n S.PosSemidef \u2227 P.map (fun \u03c9 => toLp 2 (Z \u03c9)) = 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 : \u211d) : Matrix (Fin 6) (Fin 6"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpointResidual_hasGaussianLaw",
+ "line": 195,
+ "source_header": "r)\u1d40\n\n/-- Gaussianity is inherited from the actual jointly Gaussian pin/endpoint vector. -/\ntheorem sourceEndpointResidual_hasGaussianLaw {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\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 : \u211d) (x : Fin 6 \u2192 \u211d) (\u03c9 : SmoothSample 2 L) : Fi"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpointPosterior_hasGaussianLaw",
+ "line": 207,
+ "source_header": "t L r x\n\ntheorem sourceEndpointPosterior_hasGaussianLaw {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (x : Fin 6 \u2192 \u211d) : HasGaussianLaw (sourceEndpointPosterior L r x) (smoothL"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpointPosterior_integral",
+ "line": 217,
+ "source_header": "]\n rfl\n\ntheorem sourceEndpointPosterior_integral {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (x : Fin 6 \u2192 \u211d) : (\u222b \u03c9, sourceEndpointPosterior L r x \u03c9 \u2202smoothLaw 2 L) =\n sourceRegressionMapA"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceEndpointPosterior_covariance",
+ "line": 226,
+ "source_header": "simp\n\ntheorem sourceEndpointPosterior_covariance {L : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 \u2192 \u211d) (i j : Fin 6) :\n covariance (fun \u03c9 => sourceEndpointPosterior L r x \u03c9 i)\n (fun \u03c9 => sourceEndpointPosterior L r x \u03c9 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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (x : Fin 6 \u2192 \u211d) : 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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (x : Fin 6 \u2192 \u211d) : 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 : \u211d} (hL : L \u2260 0) (r : \u211d)\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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 \u2192 \u211d) :\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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (x : Fin 6 \u2192 \u211d) : (\u222b v, v \u2202sourceEndpointKernel 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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 \u2192 \u211d) (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 : \u211d) (\u03c9 : 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 : \u211d) (\u03c9 : SmoothSample 2 L"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourcePinCovariance",
+ "line": 33,
+ "source_header": "L \u03c9 6\n\n/-- Principal covariance of the literal six origin pin coordinates. -/\ndef sourcePinCovariance (L : \u211d) : 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 : \u211d) (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 : \u211d) : Matrix (Fi"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceContactQMatrix",
+ "line": 47,
+ "source_header": "ctCross L i\n\ndef sourceContactQMatrix (L : \u211d) : 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 : \u211d) :\n (sourceContactCovariance L).submatrix sourceContactBlockEquiv sourceContactBlockEquiv =\n Matrix.fromBlocks (sourcePinCovariance L) (sourceContactCrossMatrix L)\n (sourceContactCrossMatrix L)\u1d34 (source"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourcePinCovariance_posDef",
+ "line": 89,
+ "source_header": "v => cases v; rfl\n\ntheorem sourcePinCovariance_posDef {L : \u211d} (hL : L \u2260 0) :\n (sourcePinCov"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourcePinCovariance_isUnit",
+ "line": 93,
+ "source_header": "Succ_injective 6)\n\ntheorem sourcePinCovariance_isUnit {L : \u211d} (hL : L \u2260 0) :\n IsUnit (sourc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceContactQVariance_eq_variance",
+ "line": 102,
+ "source_header": "Unit hL).invertible\n\ntheorem sourceContactQVariance_eq_variance {L : \u211d} (hL : L \u2260 0) :\n sourceContactQVariance L =\n Var[fun \u03c9 => 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 : \u211d} (hL : L \u2260 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\u00b2 covariance identity; its normal equations are derived. -/\nlemma contact_residual_variance_of_isUnit_covariance {\u03a9 \u03b9 : Type*} [MeasurableSpace \u03a9]\n [Fintype \u03b9] [DecidableEq \u03b9] {P : Measure \u03a9} [IsFiniteMeasure P]\n (J : \u03a9 \u2192 \u03b9 \u2192 \u211d) (Q : \u03a9 \u2192 \u211d)\n (hJ : \u2200 i, MemLp (fun \u03c9 => J \u03c9 i) 2 P) (hQ : MemLp Q 2 P)\n (hG : IsUnit (Matrix.of (fun i j =>\n covariance (fun \u03c9 => J \u03c9 i) (fun \u03c9 => J \u03c9 j) P) : Matrix \u03b9 \u03b9 \u211d)) :"
+ },
+ {
+ "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 : \u211d) ("
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceContactResidual_variance",
+ "line": 178,
+ "source_header": "L) \u2b1d\u1d65 sourcePinVector L \u03c9\n\n/-- The strictly positive Schur complement is the actual curvature residual variance. -/\ntheorem sourceContactResidual_variance {L : \u211d} (hL : L \u2260 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 : \u211d} (hL : L \u2260 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 \u2192"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "contactE0",
+ "line": 19,
+ "source_header": "]\n\ndef contactE0 : Fin 2 \u2192"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "contactE1",
+ "line": 21,
+ "source_header": "]\ndef contactE1 : Fin 2 \u2192"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "contactDirections",
+ "line": 22,
+ "source_header": "]\n\ndef contactDirections : (i : Fin 7) \u2192 Fin (contactOrder i) \u2192 (Fin 2 \u2192 \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceContactVector",
+ "line": 31,
+ "source_header": ")\n\ndef sourceContactVector (L : \u211d) (\u03c9 : SmoothSample 2 L) (i : Fin 7) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceContactCoefficient",
+ "line": 34,
+ "source_header": ")\n\ndef sourceContactCoefficient (L : \u211d) (i : Fin 7) (m : SourceMode 2) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceContactCovariance",
+ "line": 37,
+ "source_header": "m\n\ndef sourceContactCovariance (L : \u211d) : Matrix (Fin 7) (Fin 7)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceContactVector_hasGaussianLaw",
+ "line": 41,
+ "source_header": "]\n\ntheorem sourceContactVector_hasGaussianLaw {L : \u211d} (hL : L \u2260 0) :\n HasGaussianLaw (sourceContactVector L) (smoothLaw 2 L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceContactCoefficient_summable",
+ "line": 46,
+ "source_header": "s\n\ntheorem sourceContactCoefficient_summable {L : \u211d} (hL : L \u2260 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 : \u211d} (hL : L \u2260 0) :\n sourceContactCovariance L = coefficientGram (sourceContactCoefficient L"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "frequency10",
+ "line": 56,
+ "source_header": ")\n\nprivate def frequency10 : \u21a5(halfLattice 2"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "frequency01",
+ "line": 61,
+ "source_header": "\u27e9\n\nprivate def frequency01 : \u21a5(halfLattice 2"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "frequency11",
+ "line": 66,
+ "source_header": "\u27e9\n\nprivate def frequency11 : \u21a5(halfLattice 2"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "frequency20",
+ "line": 71,
+ "source_header": "\u27e9\n\nprivate def frequency20 : \u21a5(halfLattice 2"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceContactMode",
+ "line": 76,
+ "source_header": "\u27e9\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 \u2192 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 \u2192 \u2124)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceModeAmplitude",
+ "line": 90,
+ "source_header": "rty\n\ndef sourceModeAmplitude (L : \u211d) (m : SourceMode 2)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceContactAmplitude",
+ "line": 94,
+ "source_header": "L)\n\ndef sourceContactAmplitude (L : \u211d) (s : Fin 7)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceContactAmplitude_pos",
+ "line": 97,
+ "source_header": "s)\n\ntheorem sourceContactAmplitude_pos {L : \u211d} (hL : L \u2260 0) (s : Fin 7) :\n 0 < sourceContactAmplitude"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "derivativeCoefficient_none",
+ "line": 109,
+ "source_header": "s _\n\nprivate theorem derivativeCoefficient_none (L : \u211d) (k : \u2115)\n (u : Fin k \u2192 (Fin 2 \u2192 \u211d)) :\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 : \u211d) (k : \u21a5(halfLattice 2)) (b : Bool)\n (n : \u2115) (u : Fin n \u2192 (Fin 2 \u2192 \u211d)) :\n derivativeCoefficient 2 L n 0 u (some (k,b)) =\n Real.sqrt (2 * sourceWeight 2 L k / sourceZ 2 L) *\n ((\u220f 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 : \u211d) (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 : \u211d} (hL : L \u2260 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 : \u211d) : (Fin 6 \u2192 \u211d) \u2192L[\u211d] (Fin 6 \u2192 \u211d) where\n toFu"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourcePhysicalRegressionMap",
+ "line": 29,
+ "source_header": "rop\n\ndef sourcePhysicalRegressionMap (L r : \u211d) : (Fin 6 \u2192 \u211d) \u2192L[\u211d] (Fin 6 \u2192"
+ },
+ {
+ "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 : \u211d) (\u03c9 : SmoothSample 2 L) :\n sourceNormalizedEndpoints L r \u03c9 =\n sourceAdjustedEndpoints L r \u03c9 + 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 : \u211d) : Kernel (Fin 6 \u2192 \u211d) (Fin"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourcePhysicalEndpointKernel_markov",
+ "line": 45,
+ "source_header": "r) 0 0\n\ntheorem sourcePhysicalEndpointKernel_markov {L : \u211d} (hL : L \u2260 0) (r : \u211d) :\n IsMarkovKernel (sourcePhysicalEndpointKern"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourcePhysicalEndpointKernel_measurable",
+ "line": 51,
+ "source_header": "nstance\n\ntheorem sourcePhysicalEndpointKernel_measurable (L r : \u211d) :\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 : \u211d} (hL : L \u2260 0) (r : \u211d) (x : Fin 6 \u2192 \u211d) :\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 : \u211d} (hL : L \u2260 0) (r : \u211d)\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 : \u211d) :\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 : \u211d} (hL : L \u2260 0) (r b : \u211d) :\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 : \u211d} (hL : L \u2260 0) (r : \u211d) (x : Fin 6 \u2192 \u211d) :\n (\u222b v, v \u2202sourcePhysicalEndpointKernel 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 : \u211d} (hL : L \u2260 0) (r : \u211d)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n IsMarkovKernel (sourcePhysicalEndpointKernel L r) \u2227\n Measurable (sourcePhysicalEndpointKernel L r) \u2227\n (\u2200 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)) \u2227\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 \u03a9 : Type*} (w : I \u2192 \u211d) (U : I \u2192 \u03a9 \u2192 \u211d) (\u03c9 : \u03a9) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "standardAbsMoment",
+ "line": 29,
+ "source_header": "|\n\ndef standardAbsMoment (n : \u2115) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "standardAbsMoment_integrable",
+ "line": 31,
+ "source_header": "1\n\ntheorem standardAbsMoment_integrable (n : \u2115) :\n Integrable (fun z : \u211d => |z| ^ n) (gaussianReal 0 1"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weightedAbsSeries_nonneg",
+ "line": 36,
+ "source_header": "'\n\ntheorem weightedAbsSeries_nonneg {I \u03a9 : Type*} (w : I \u2192 \u211d) (U : I \u2192 \u03a9 \u2192 \u211d)\n (hw0 : \u2200 i, 0 \u2264 w i) (\u03c9 : \u03a9) : 0 \u2264 weightedAbsSeries w U"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weightedAbsSeries_measurable",
+ "line": 40,
+ "source_header": ")\n\ntheorem weightedAbsSeries_measurable {I \u03a9 : Type*} [Countable I] [MeasurableSpace \u03a9]\n (w : I \u2192 \u211d) (U : I \u2192 \u03a9 \u2192 \u211d) (hU : \u2200 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 \u03a9 : Type*} [MeasurableSpace \u03a9] (P : Measure \u03a9)\n (w : I \u2192 \u211d) (U : I \u2192 \u03a9 \u2192 \u211d) (hw0 : \u2200 i, 0 \u2264 w i)\n (hlaw : \u2200 i, HasLaw (U i) (gaussianReal 0 1) P) (p : \u211d\u22650\u221e) (i : I) :\n eLpNorm (fun \u03c9 => w i * |U i \u03c9|) 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 \u03a9 : Type*} [Countable I] [MeasurableSpace \u03a9]\n (P : Measure \u03a9) [IsProbabilityMeasure P] (w : I \u2192 \u211d) (U : I \u2192 \u03a9 \u2192 \u211d)\n (hU : \u2200 i, Measurable (U i)) (hw0 : \u2200 i, 0 \u2264 w i) (hw : Summable w)\n (hlaw : \u2200 i, HasLaw (U i) (gaussianReal 0 1) P)\n (p : \u211d\u22650) (hp : 1 \u2264 p) :\n MemLp (weightedAbsSeries w U) p P \u2227\n eLpNorm (weightedAbsSeries w U) p P \u2264\n ENNReal.ofReal (\u2211' i, w i) * eLpNorm id p (gaussianReal 0 1"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weightedAbsSeries_ae_summable",
+ "line": 110,
+ "source_header": "\u27e9\n\ntheorem weightedAbsSeries_ae_summable {I \u03a9 : Type*} [Countable I] [MeasurableSpace \u03a9]\n (P : Measure \u03a9) [IsProbabilityMeasure P] (w : I \u2192 \u211d) (U : I \u2192 \u03a9 \u2192 \u211d)\n (_hU : \u2200 i, Measurable (U i)) (hw0 : \u2200 i, 0 \u2264 w i) (hw : Summable w)\n (hlaw : \u2200 i, HasLaw (U i) (gaussianReal 0 1) P) :\n \u2200\u1d50 \u03c9 \u2202P, Summable (fun i => w i * |U i \u03c9|"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "eLpNorm_nat_pow_integral",
+ "line": 124,
+ "source_header": "\u03c9\n\nprivate theorem eLpNorm_nat_pow_integral {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) (f : \u03a9 \u2192 \u211d) (hf : AEStronglyMeasurable f P)\n (hnonneg : \u2200 \u03c9, 0 \u2264 f \u03c9) (n : \u2115) (hn : n \u2260 0)\n (hint : Integrable (fun \u03c9 => f \u03c9 ^ n) P) :\n eLpNorm f n P ^ n = ENNReal.ofReal (\u222b \u03c9, f \u03c9 ^ n \u2202P"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weightedAbsSeries_moment",
+ "line": 138,
+ "source_header": "]\n\ntheorem weightedAbsSeries_moment {I \u03a9 : Type*} [Countable I] [MeasurableSpace \u03a9]\n (P : Measure \u03a9) [IsProbabilityMeasure P] (w : I \u2192 \u211d) (U : I \u2192 \u03a9 \u2192 \u211d)\n (hU : \u2200 i, Measurable (U i)) (hw0 : \u2200 i, 0 \u2264 w i) (hw : Summable w)\n (hlaw : \u2200 i, HasLaw (U i) (gaussianReal 0 1) P) (n : \u2115) :\n Integrable (fun \u03c9 => weightedAbsSeries w U \u03c9 ^ n) P \u2227\n (\u222b \u03c9, weightedAbsSeries w U \u03c9 ^ n \u2202P) \u2264\n (\u2211' 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 : \u211d) :\n Real.exp (s * |x|) \u2264 Real.exp (s*x) + Real.exp ((-s)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "foldedGaussian_exp",
+ "line": 186,
+ "source_header": "x)]\n\nprivate theorem foldedGaussian_exp (s : \u211d) :\n Integrable (fun z : \u211d => Real.exp (s * |z|)) (gaussianReal 0 1) \u2227\n (\u222b z : \u211d, Real.exp (s * |z|) \u2202gaussianReal 0 1) \u2264 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 \u2192 \u211d)\n (W t : \u211d) (hW : 0 < W) (hw : \u2200 i, 0 \u2264 w i)\n (hsum : \u2211 i \u2208 s, w i \u2264 W) :\n Real.exp (t * \u2211 i \u2208 s, w i * |x i|) \u2264\n (1-\u2211 i \u2208 s, w i/W) + \u2211 i \u2208 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 \u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) [IsProbabilityMeasure P] (s : Finset I) (w : I \u2192 \u211d)\n (U : I \u2192 \u03a9 \u2192 \u211d) (hmeas : \u2200 i, Measurable (U i))\n (W t K : \u211d) (hW : 0 < W) (hw : \u2200 i, 0 \u2264 w i)\n (hsum : \u2211 i \u2208 s, w i \u2264 W) (hK : 1 \u2264 K)\n (hUi : \u2200 i, Integrable (fun \u03c9 => Real.exp (t*W*|U i \u03c9|)) P)\n (hUb : \u2200 i, (\u222b \u03c9, Real.exp (t*W*|U i \u03c9|) \u2202P) \u2264 K) :\n Integrable (fun \u03c9 => Real.exp (t*\u2211 i \u2208 s, w i*|U i \u03c9|)) P \u2227\n (\u222b \u03c9, Real.exp (t*\u2211 i \u2208 s, w i*|U i \u03c9|) \u2202P)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weightedAbsSeries_exp_posWeight",
+ "line": 269,
+ "source_header": "ith\n\n\nprivate theorem weightedAbsSeries_exp_posWeight {I \u03a9 : Type*} [Countable I] [MeasurableSpace \u03a9]\n (P : Measure \u03a9) [IsProbabilityMeasure P] (w : I \u2192 \u211d) (U : I \u2192 \u03a9 \u2192 \u211d)\n (hmeas : \u2200 i, Measurable (U i)) (hw : \u2200 i, 0 \u2264 w i) (hws : Summable w)\n (hlaw : \u2200 i, HasLaw (U i) (gaussianReal 0 1) P)\n (haesum : \u2200\u1d50 \u03c9 \u2202P, Summable (fun i => w i*|U i \u03c9|))\n (hW : 0 < \u2211' i, w i) (t : \u211d) :\n Integrable (fun \u03c9 => Real.exp (t*weightedAbsSeries w U \u03c9)) P \u2227\n (\u222b \u03c9, Real.exp (t*weightedAbsSeries w U \u03c9) \u2202P) \u2264\n 2*Real.exp (t^2*(\u2211' i, w i)^2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weightedAbsSeries_exp_bound",
+ "line": 334,
+ "source_header": "W]\n\n\ntheorem weightedAbsSeries_exp_bound {I \u03a9 : Type*} [Countable I] [MeasurableSpace \u03a9]\n (P : Measure \u03a9) [IsProbabilityMeasure P] (w : I \u2192 \u211d) (U : I \u2192 \u03a9 \u2192 \u211d)\n (hmeas : \u2200 i, Measurable (U i)) (hw : \u2200 i, 0 \u2264 w i) (hws : Summable w)\n (hlaw : \u2200 i, HasLaw (U i) (gaussianReal 0 1) P)\n (t : \u211d) :\n Integrable (fun \u03c9 => Real.exp (t*weightedAbsSeries w U \u03c9)) P \u2227\n (\u222b \u03c9, Real.exp (t*weightedAbsSeries w U \u03c9) \u2202P) \u2264\n 2*Real.exp (t^2*(\u2211' 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\u00b2 gives the Gaussian upper tail without independence. -/\ntheorem weightedAbsSeries_upper_tail {I \u03a9 : Type*} [Countable I] [MeasurableSpace \u03a9]\n (P : Measure \u03a9) [IsProbabilityMeasure P] (w : I \u2192 \u211d) (U : I \u2192 \u03a9 \u2192 \u211d)\n (hU : \u2200 i, Measurable (U i)) (hw0 : \u2200 i, 0 \u2264 w i) (hw : Summable w)\n (hlaw : \u2200 i, HasLaw (U i) (gaussianReal 0 1) P)\n (hW : 0 < \u2211' i, w i) (R : \u211d) (hR : 0 \u2264 R) :\n P.real {\u03c9 | R \u2264 weightedAbsSeries w U \u03c9} \u2264\n 2 * Real.exp (-(R ^ 2) / (2 * (\u2211' 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 : \u2115) (a c : \u211d) (k : \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderProductBound",
+ "line": 27,
+ "source_header": "n\n\ndef orderProductBound (n d : \u2115) (a c : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderPairedBound",
+ "line": 30,
+ "source_header": ")\n\ndef orderPairedBound (n d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderModeBound",
+ "line": 33,
+ "source_header": "k\n\ndef orderModeBound (n d : \u2115) (L : \u211d) (m : SourceMode d) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderCoordinateBound_summable",
+ "line": 38,
+ "source_header": "k\n\ntheorem orderCoordinateBound_summable (n : \u2115) {a c : \u211d} (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 : \u2115) {a c : \u211d} (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 : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k : Fin d \u2192 \u2124) :\n orderPairedBound n d L k =\n Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n \u220f i, (1 + |sourceC L * (k i : \u211d)|) ^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderModeBound_nonneg",
+ "line": 92,
+ "source_header": "g\n\ntheorem orderModeBound_nonneg (n d : \u2115) (L : \u211d) (m : SourceMode d) :\n 0 \u2264 orderModeBound n d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderModeBound_summable",
+ "line": 100,
+ "source_header": "y\n\ntheorem orderModeBound_summable (n d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n Summable (orderModeBound n d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderModeBound_four",
+ "line": 115,
+ "source_header": "e\n\ntheorem orderModeBound_four (d : \u2115) (L : \u211d) (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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (m : SourceMode d) (j : \u2115) (x : Fin d \u2192 \u211d) :\n \u2016iteratedFDeriv \u211d j (modeCoefficient d L m) x\u2016 \u2264 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 : \u2115) (L : \u211d) (\u03c9 : SourceMode d \u2192 \u211d) : P"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSample_ae",
+ "line": 183,
+ "source_header": "m|)\n\ntheorem goodSample_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, goodSample d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_smooth_of_goodSample",
+ "line": 190,
+ "source_header": "hL)\n\ntheorem sourceField_smooth_of_goodSample (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SourceMode d \u2192 \u211d) (h\u03c9 : goodSample d L \u03c9) :\n \u2200 n : \u2115, ContDiff \u211d n (sourceField d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_smooth_ae",
+ "line": 222,
+ "source_header": "m))\n\ntheorem sourceField_smooth_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, \u2200 n : \u2115, ContDiff \u211d n (sourceField d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSample_congr_cofinite",
+ "line": 227,
+ "source_header": "h\u03c9\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 : \u2115) (L : \u211d)\n (\u03c9 \u03b7 : SourceMode d \u2192 \u211d) (h\u03c9\u03b7 : \u03c9 =\u1da0[Filter.cofinite] \u03b7) :\n goodSample d L \u03c9 \u2194 goodSample"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSample_finite_change_iff",
+ "line": 242,
+ "source_header": "[hm]\n\ntheorem goodSample_finite_change_iff (d : \u2115) (L : \u211d)\n (\u03c9 \u03b7 : SourceMode d \u2192 \u211d) (s : Finset (SourceMode d))\n (h\u03c9\u03b7 : \u2200 m \u2209 s, \u03c9 m = \u03b7 m) :\n goodSample d L \u03c9 \u2194 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 : \u2115) (L : \u211d) : Set (SourceMode d \u2192"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderAbsNN",
+ "line": 34,
+ "source_header": "\u03c9}\n\nprivate def orderAbsNN (n d : \u2115) (L : \u211d) (\u03c9 : SourceMode d \u2192 \u211d)\n (m : SourceMode d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderAbsTotal",
+ "line": 39,
+ "source_header": "_)\u27e9\n\nprivate def orderAbsTotal (n d : \u2115) (L : \u211d) (\u03c9 : SourceMode d \u2192 \u211d) : \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderAbsTotal_ne_top_iff",
+ "line": 42,
+ "source_header": "0\u221e)\n\nprivate theorem orderAbsTotal_ne_top_iff (n d : \u2115) (L : \u211d)\n (\u03c9 : SourceMode d \u2192 \u211d) :\n orderAbsTotal n d L \u03c9 \u2260 \u221e \u2194\n Summable (fun m => orderModeBound n d L m * |\u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderAbsTotal_measurable",
+ "line": 48,
+ "source_header": "\u03c9)\n\nprivate theorem orderAbsTotal_measurable (n d : \u2115) (L : \u211d) :\n Measurable (orderAbsTotal n d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSet_measurable",
+ "line": 62,
+ "source_header": "eal\n\ntheorem goodSet_measurable (d : \u2115) (L : \u211d) : MeasurableSet (goodSet d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSet_ae",
+ "line": 75,
+ "source_header": "imp\n\ntheorem goodSet_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, \u03c9 \u2208 goodSet"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSet_measure_one",
+ "line": 79,
+ "source_header": "hL\n\ntheorem goodSet_measure_one (d : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) (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 : \u2115) (L : \u211d) : SmoothSample d L \u2192 (SourceMode"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sampleInclusion_measurable",
+ "line": 90,
+ "source_header": "ype.val\n\ntheorem sampleInclusion_measurable (d : \u2115) (L : \u211d) :\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 : \u2115) (L : \u211d) : Measure (SmoothSa"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sampleInclusion_map",
+ "line": 98,
+ "source_header": "sion d L)\n\ntheorem sampleInclusion_map (d : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) {L : \u211d} (hL : L \u2260 0) :\n MeasurePreserving (sampleInclusion d L) (smoothLaw d L) (sou"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothLaw_isProbabilityMeasure",
+ "line": 109,
+ "source_header": "map d hL\u27e9\n\ntheorem smoothLaw_isProbabilityMeasure (d : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d \u2192 \u211d) \u2192 E) (hX : Measurable X) :\n (smoothLaw d L).map (fun \u03c9 => X (sampleInclusion d L \u03c9)) = (sourceL"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_marginal",
+ "line": 121,
+ "source_header": "n_map d hL]\n\ntheorem coordinate_marginal (d : \u2115) {L : \u211d} (hL : L \u2260 0) (m : SourceMode d) :\n (smoothLaw d L).map (fun \u03c9 => sampleInclusion d L \u03c9 m) = gauss"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "finiteCoordinate_map_eq",
+ "line": 126,
+ "source_header": "_marginal m\n\ntheorem finiteCoordinate_map_eq (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (m : Fin n \u2192 SourceMode d) :\n (smoothLaw d L).map (fun \u03c9 j => sampleInclusion d L \u03c9 (m j)) =\n (sourceLaw d).map (fun \u03c9 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 : \u2115) (L : \u211d) (\u03c9 : SmoothSample d L) (x : F"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothSourceField_contDiff",
+ "line": 136,
+ "source_header": "sion d L \u03c9) x\n\ntheorem smoothSourceField_contDiff (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample d L) (n : \u2115) : ContDiff \u211d n (smoothSourc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothSourceField_smooth",
+ "line": 140,
+ "source_header": "\u03c9.property n\n\ntheorem smoothSourceField_smooth (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample d L) : ContDiff \u211d (\u22a4 : \u2115\u221e) (smoothSourc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothSourceField_finiteVector_map_eq",
+ "line": 144,
+ "source_header": "tDiff d hL \u03c9)\n\ntheorem smoothSourceField_finiteVector_map_eq (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (x : Fin n \u2192 (Fin d \u2192 \u211d)) :\n (smoothLaw d L).map (fun \u03c9 j => smoothSourceField d L \u03c9 (x j)) =\n (sourceLaw d).map (fun \u03c9 j => sourceField"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothSourceField_finiteVector_hasGaussianLaw",
+ "line": 151,
+ "source_header": "e d L (x j)))\n\ntheorem smoothSourceField_finiteVector_hasGaussianLaw (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (x : Fin n \u2192 (Fin d \u2192 \u211d)) :\n HasGaussianLaw (fun \u03c9 j => smoothSourceField d L \u03c9 (x j)) (s"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "covariance_comp_inclusion",
+ "line": 161,
+ "source_header": "sGaussian_map\n\ntheorem covariance_comp_inclusion (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (X Y : (SourceMode d \u2192 \u211d) \u2192 \u211d) (hX : Measurable X) (hY : Measurable Y) :\n cov[fun \u03c9 => X (sampleInclusion d L \u03c9), fun \u03c9 => Y (sampleInclusion d L \u03c9); 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (x y : Fin d \u2192 \u211d) :\n cov[fun \u03c9 => smoothSourceField d L \u03c9 x, fun \u03c9 => smoothSourceField d L \u03c9 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 : \u2115) (L : \u211d) [Fact (0 < L)]\n (\u03c9 : SmoothSample d L) (q : Sourc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothTorusSourceField_smooth",
+ "line": 188,
+ "source_header": "ualChartedSpace\n\ntheorem smoothTorusSourceField_smooth (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (\u03c9 : SmoothSample d L) :\n ContMDiff \ud835\udcd8(\u211d, Fin d \u2192 \u211d) \ud835\udcd8(\u211d) (\u22a4 : \u2115\u221e) (smoothTorusSou"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothTorusSourceField_finiteVector_hasGaussianLaw",
+ "line": 205,
+ "source_header": "ontDiffWithinAt\n\ntheorem smoothTorusSourceField_finiteVector_hasGaussianLaw (d : \u2115) (L : \u211d)\n [Fact (0 < L)] (n : \u2115) (q : Fin n \u2192 SourceTorus d L) :\n HasGaussianLaw (fun \u03c9 j => smoothTorusSourceField d L \u03c9 (q j))"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothTorusSourceField_covariance",
+ "line": 218,
+ "source_header": ".isGaussian_map\n\ntheorem smoothTorusSourceField_covariance (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun \u03c9 => smoothTorusSourceField d L \u03c9 q, fun \u03c9 => smoothTorusSourceField d L \u03c9 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 : \u2115) : SourceMode d \u2243 (Fin d \u2192 \u2124)"
+ },
+ {
+ "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 : \u2115) (L : \u211d) (z : Fin d \u2192 \u211d) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "tsum_mode",
+ "line": 15,
+ "source_header": ")\n\nprivate theorem tsum_mode (d : \u2115) (f : SourceMode d \u2192 \u211d) (hf : Summable f) :\n (\u2211' m, f m) = f none + \u2211' k : \u21a5(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 : \u2115) {L : \u211d} (hL : L \u2260 0) (x y : Fin d \u2192 \u211d) :\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 : \u2115) {L : \u211d} (hL : L \u2260 0) (z : Fin d \u2192 \u211d) :\n Summable (fun k : Fin d \u2192 \u2124 =>\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 : \u2115) {L : \u211d} (hL : L \u2260 0) (x y : Fin d \u2192 \u211d) :\n (\u2211' 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 : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) (L : \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torusProjection",
+ "line": 15,
+ "source_header": "L\n\ndef torusProjection (d : \u2115) (L : \u211d) (x : Fin d \u2192 \u211d) : SourceTorus d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torusRepresentative",
+ "line": 18,
+ "source_header": ")\n\ndef torusRepresentative (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (q : SourceTorus d L) : Fin d \u2192"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torusSourceField",
+ "line": 22,
+ "source_header": "1\n\ndef torusSourceField (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (\u03c9 : SourceMode d \u2192 \u211d) (q : SourceTorus d L) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusProjection_measurable",
+ "line": 26,
+ "source_header": ")\n\ntheorem torusProjection_measurable (d : \u2115) (L : \u211d) : Measurable (torusProjection d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusRepresentative_measurable",
+ "line": 29,
+ "source_header": ")\n\ntheorem torusRepresentative_measurable (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n Measurable (torusRepresentative d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusProjection_representative",
+ "line": 34,
+ "source_header": ")\n\ntheorem torusProjection_representative (d : \u2115) (L : \u211d) [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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SourceMode d \u2192 \u211d) (x y : Fin d \u2192 \u211d)\n (h : torusProjection d L x = torusProjection d L y) :\n sourceField d L \u03c9 x = sourceField d L \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_pullback",
+ "line": 57,
+ "source_header": "m\n\ntheorem torusSourceField_pullback (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (\u03c9 : SourceMode d \u2192 \u211d) (x : Fin d \u2192 \u211d) :\n torusSourceField d L \u03c9 (torusProjection d L x) = sourceField d L \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_eval_measurable",
+ "line": 64,
+ "source_header": ")\n\ntheorem torusSourceField_eval_measurable (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (q : SourceTorus d L) : Measurable (fun \u03c9 => torusSourceField d L \u03c9 q"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_joint_measurable",
+ "line": 68,
+ "source_header": ")\n\ntheorem torusSourceField_joint_measurable (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n Measurable (fun p : (SourceMode d \u2192 \u211d) \u00d7 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 : \u2115) (L : \u211d) [Fact (0 < L)]\n (n : \u2115) (q : Fin n \u2192 SourceTorus d L) :\n HasGaussianLaw (fun \u03c9 j => torusSourceField d L \u03c9 (q j)) (sourceLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_isGaussianProcess",
+ "line": 90,
+ "source_header": ")\n\ntheorem torusSourceField_isGaussianProcess (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n IsGaussianProcess (fun q \u03c9 => torusSourceField d L \u03c9 q) (sourceLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_covariance",
+ "line": 95,
+ "source_header": ")\n\ntheorem torusSourceField_covariance (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun \u03c9 => torusSourceField d L \u03c9 q, fun \u03c9 => torusSourceField d L \u03c9 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 : \u2115) (L : \u211d) [Fact (0 < L)]\n (x y : Fin d \u2192 \u211d) :\n cov[fun \u03c9 => torusSourceField d L \u03c9 (torusProjection d L x),\n fun \u03c9 => torusSourceField d L \u03c9 (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 : \u211d) (k : \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "coordinateBound",
+ "line": 16,
+ "source_header": ")\ndef coordinateBound (a c : \u211d) (k : \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "productDecay",
+ "line": 18,
+ "source_header": "4\ndef productDecay (d : \u2115) (a : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "productBound",
+ "line": 20,
+ "source_header": ")\ndef productBound (d : \u2115) (a c : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceA",
+ "line": 22,
+ "source_header": ")\ndef sourceA (L : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceC",
+ "line": 23,
+ "source_header": "2\ndef sourceC (L : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceWeight",
+ "line": 24,
+ "source_header": "L\ndef sourceWeight (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceZ",
+ "line": 26,
+ "source_header": "k\ndef sourceZ (d : \u2115) (L : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pairedBound",
+ "line": 27,
+ "source_header": "k\ndef pairedBound (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "summable_decay_pow",
+ "line": 29,
+ "source_header": "k\n\ntheorem summable_decay_pow {a : \u211d} (ha : 0 < a) (n : \u2115) :\n Summable (fun k : \u2124 => decay a k * |(k : \u211d)| ^ n"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinateBound_summable",
+ "line": 40,
+ "source_header": "b\n\ntheorem coordinateBound_summable {a c : \u211d} (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 : \u2124 \u2192 \u211d} (hf : Summable f) (hn : \u2200 k, 0 \u2264 f k)\n (d : \u2115) : Summable (fun k : Fin d \u2192 \u2124 => \u220f i, f (k i)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "productBound_summable",
+ "line": 72,
+ "source_header": "p\n\ntheorem productBound_summable {a c : \u211d} (ha : 0 < a) (d : \u2115) :\n Summable (productBound d a c"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "productDecay_eq_exp",
+ "line": 77,
+ "source_header": "d\n\ntheorem productDecay_eq_exp (d : \u2115) (a : \u211d) (k : Fin d \u2192 \u2124) :\n productDecay d a k = exp (-a * \u2211 i, (k i : \u211d) ^ 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "frequency_l1_le_product",
+ "line": 82,
+ "source_header": "]\n\ntheorem frequency_l1_le_product (d : \u2115) (v : Fin d \u2192 \u211d) (hv : \u2200 i, 0 \u2264 v i) :\n 1 + \u2211 i, v i \u2264 \u220f i, (1 + v i"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceA_pos",
+ "line": 98,
+ "source_header": "v\n\ntheorem sourceA_pos {L : \u211d} (hL : L \u2260 0) : 0 < sourceA"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceWeight_eq_physical",
+ "line": 102,
+ "source_header": "y\n\ntheorem sourceWeight_eq_physical (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :\n sourceWeight d L k = exp (-(\u2211 i, (sourceC L * (k i : \u211d)) ^ 2) / 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceWeight_summable",
+ "line": 117,
+ "source_header": "g\n\ntheorem sourceWeight_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n Summable (sourceWeight d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceZ_pos",
+ "line": 124,
+ "source_header": "d\n\ntheorem sourceZ_pos (d : \u2115) {L : \u211d} (hL : L \u2260 0) : 0 < sourceZ d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pairedBound_eq_amplitude",
+ "line": 129,
+ "source_header": "]\n\ntheorem pairedBound_eq_amplitude (d : \u2115) {L : \u211d} (hL : L \u2260 0) (k : Fin d \u2192 \u2124) :\n pairedBound d L k = Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n \u220f i, (1 + |sourceC L * (k i : \u211d)|) ^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pairedBound_summable",
+ "line": 151,
+ "source_header": "g\n\ntheorem pairedBound_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n Summable (pairedBound d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pairedBound_subtype_summable",
+ "line": 155,
+ "source_header": "_\n\ntheorem pairedBound_subtype_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (S : Set (Fin d \u2192 \u2124)) : 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 : \u2115) : Set (Fin d \u2192"
+ },
+ {
+ "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 : \u2115) : Measure (SourceMode d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "phase",
+ "line": 24,
+ "source_header": "de d)\n\ndef phase (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d"
+ },
+ {
+ "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 : \u2115) (L : \u211d) (m : SourceMode d) (x : Fin d \u2192"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "modeMajorant",
+ "line": 34,
+ "source_header": "L k x)\n\ndef modeMajorant (d : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (\u03c9 : SourceMode d \u2192 \u211d) (x : Fin d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeMajorant_nonneg",
+ "line": 43,
+ "source_header": "L m x) \u03c9\n\ntheorem modeMajorant_nonneg (d : \u2115) (L : \u211d) (m : SourceMode d) :\n 0 \u2264 modeMajor"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeMajorant_summable",
+ "line": 52,
+ "source_header": "ositivity\n\ntheorem modeMajorant_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n Summable (modeMajo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeCoefficient_bound",
+ "line": 66,
+ "source_header": ".summable\n\ntheorem modeCoefficient_bound (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (m : SourceMode d) (x : Fin d \u2192 \u211d) :\n |modeCoefficient d L m x| \u2264 modeMajor"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_eval_measurable",
+ "line": 98,
+ "source_header": "rans hamp\n\ntheorem sourceField_eval_measurable (d : \u2115) (L : \u211d) (x : Fin d \u2192 \u211d) :\n Measurable (fun \u03c9 => sourceField"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceMajorant_ae",
+ "line": 102,
+ "source_header": "surable _\n\ntheorem sourceMajorant_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw 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 : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d,\n HasSumUniformly (fun m x => |modeCoefficient d L m x * \u03c9 m|)\n (fun x => \u2211' m, |modeCoefficient d L m"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_uniform_ae",
+ "line": 117,
+ "source_header": "nonneg _)\n\ntheorem sourceField_uniform_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d,\n HasSumUniformly (fun m x => modeCoefficient d L m x * \u03c9 m)\n (sourceFie"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_continuous_ae",
+ "line": 128,
+ "source_header": "nonneg _)\n\ntheorem sourceField_continuous_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw 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 : \u03b9 \u2192 \u211d) (ha : Summable a) (hb : Summable b) :\n cov[scalarSeries a, scalarSeries b; coefficientLaw \u03b9] = \u2211' i, a i * b i"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_integral_zero",
+ "line": 51,
+ "source_header": "theorem sourceField_integral_zero (d : \u2115) {L : \u211d} (hL : L \u2260 0) (x : Fin d \u2192 \u211d) :\n \u222b \u03c9, sourceField d L \u03c9 x \u2202sourceLaw d = 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_covariance",
+ "line": 58,
+ "source_header": "theorem sourceField_covariance (d : \u2115) {L : \u211d} (hL : L \u2260 0) (x y : Fin d \u2192 \u211d) :\n cov[fun \u03c9 => sourceField d L \u03c9 x, fun \u03c9 => sourceField d L \u03c9 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 : \u2115) {L : \u211d} (hL : L \u2260 0) (x : Fin d \u2192 \u211d) :\n Var[fun \u03c9 => sourceField d L \u03c9 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 : \u03b9 \u2192 \u211d) (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 : \u03b9 \u2192 \u211d) (s : Finset \u03b9) (t : \u211d) :\n charFun ((coefficientLaw \u03b9).map (fun \u03c9 => \u2211 i \u2208 s, a i * \u03c9 i)) t =\n Complex.exp (-((\u2211 i \u2208 s, a i ^ 2 : \u211d) : \u2102) * (t : \u2102) ^ 2 / 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "charFun_partial_tendsto",
+ "line": 55,
+ "source_header": "]\n\nprivate theorem charFun_partial_tendsto (a : \u03b9 \u2192 \u211d) (ha : Summable a) (t : \u211d) :\n Filter.Tendsto\n (fun s : Finset \u03b9 => charFun ((coefficientLaw \u03b9).map\n (fun \u03c9 => \u2211 i \u2208 s, a i * \u03c9 i)) t)\n Filter.atTop (\ud835\udcdd (charFun ((coefficientLaw \u03b9).map (scalarSeries a)) t)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_map_gaussian",
+ "line": 90,
+ "source_header": "\u03c9\n\ntheorem scalarSeries_map_gaussian (a : \u03b9 \u2192 \u211d) (ha : Summable a) :\n (coefficientLaw \u03b9).map (scalarSeries a) =\n gaussianReal 0 (\u2211' i, a i ^ 2).toNNRea"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_integral_zero",
+ "line": 109,
+ "source_header": "g\n\ntheorem scalarSeries_integral_zero (a : \u03b9 \u2192 \u211d) (ha : Summable a) :\n \u222b \u03c9, scalarSeries a \u03c9 \u2202coefficientLaw \u03b9 ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_variance",
+ "line": 116,
+ "source_header": "h\n\ntheorem scalarSeries_variance (a : \u03b9 \u2192 \u211d) (ha : Summable a) :\n Var[scalarSeries a; coefficientLaw \u03b9] = \u2211' i, a i ^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "source_linearCombination_hasGaussianLaw",
+ "line": 122,
+ "source_header": ")\n\ntheorem source_linearCombination_hasGaussianLaw (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (x : Fin n \u2192 (Fin d \u2192 \u211d)) (c : Fin n \u2192 \u211d) :\n HasGaussianLaw (fun \u03c9 => \u2211 j, c j * sourceField d L \u03c9 (x j)) (sourceLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "source_finiteVector_hasGaussianLaw",
+ "line": 147,
+ "source_header": ")\n\ntheorem source_finiteVector_hasGaussianLaw (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (x : Fin n \u2192 (Fin d \u2192 \u211d)) :\n HasGaussianLaw (fun \u03c9 j => sourceField d L \u03c9 (x j)) (sourceLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_isGaussianProcess",
+ "line": 174,
+ "source_header": "l\n\ntheorem sourceField_isGaussianProcess (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n IsGaussianProcess (fun x \u03c9 => sourceField d L \u03c9 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 (\u03b9 : Type*) : Measure (\u03b9 \u2192"
+ },
+ {
+ "kind": "instance",
+ "unqualified_name": "coefficientLaw_isProbabilityMeasure",
+ "line": 19,
+ "source_header": "1)\n\ninstance coefficientLaw_isProbabilityMeasure (\u03b9 : Type*) :\n IsProbabilityMeasure (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_measurePreserving",
+ "line": 24,
+ "source_header": "nce\n\ntheorem coordinate_measurePreserving {\u03b9 : Type*} (i : \u03b9) :\n MeasurePreserving (fun \u03c9 : \u03b9 \u2192 \u211d => \u03c9 i) (coefficientLaw \u03b9)\n (gaussianReal 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_marginal",
+ "line": 29,
+ "source_header": ") i\n\ntheorem coordinate_marginal {\u03b9 : Type*} (i : \u03b9) :\n (coefficientLaw \u03b9).map (fun \u03c9 => \u03c9 i) = gaussianReal"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinates_independent",
+ "line": 33,
+ "source_header": "_eq\n\ntheorem coordinates_independent (\u03b9 : Type*) :\n iIndepFun (fun i (\u03c9 : \u03b9 \u2192 \u211d) => \u03c9 i) (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_memLp",
+ "line": 38,
+ "source_header": "id)\n\ntheorem coordinate_memLp {\u03b9 : Type*} (i : \u03b9) (p : \u211d\u22650\u221e) (hp : p \u2260 \u221e) :\n MemLp (fun \u03c9 : \u03b9 \u2192 \u211d => \u03c9 i) p (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_integrable",
+ "line": 43,
+ "source_header": "i)\n\ntheorem coordinate_integrable {\u03b9 : Type*} (i : \u03b9) :\n Integrable (fun \u03c9 : \u03b9 \u2192 \u211d => \u03c9 i) (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_abs_integrable",
+ "line": 47,
+ "source_header": "p))\n\ntheorem coordinate_abs_integrable {\u03b9 : Type*} (i : \u03b9) :\n Integrable (fun \u03c9 : \u03b9 \u2192 \u211d => |\u03c9 i|) (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weighted_abs_summable_ae",
+ "line": 51,
+ "source_header": "orm\n\ntheorem weighted_abs_summable_ae {\u03b9 : Type*} [Countable \u03b9]\n (a : \u03b9 \u2192 \u211d) (ha : \u2200 i, 0 \u2264 a i) (hs : Summable a) :\n \u2200\u1d50 \u03c9 \u2202coefficientLaw \u03b9, Summable (fun i => a i * |\u03c9"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "scalarSeries",
+ "line": 75,
+ "source_header": "h\u03c9\n\n/-- The actual scalar sum; its convergence is proved separately on the product law. -/\ndef scalarSeries {\u03b9 : Type*} (a : \u03b9 \u2192 \u211d) (\u03c9 : \u03b9 \u2192 \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_measurable",
+ "line": 79,
+ "source_header": "* \u03c9 i\n\ntheorem scalarSeries_measurable {\u03b9 : Type*} [Countable \u03b9] (a : \u03b9 \u2192 \u211d) :\n Measurable (scalarSeri"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_hasSum_ae",
+ "line": 86,
+ "source_header": "ly i)\n\ntheorem scalarSeries_hasSum_ae {\u03b9 : Type*} [Countable \u03b9]\n (a : \u03b9 \u2192 \u211d) (hs : Summable a) :\n \u2200\u1d50 \u03c9 \u2202coefficientLaw \u03b9, HasSum (fun i => a i * \u03c9 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 : \u2115) (L : \u211d) [Fact (0 < L)] (a : Fin d \u2192 \u211d) :\n OpenPartialHomeomorph (SourceTorus d L) (Fin d \u2192 \u211d)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "chartCenter",
+ "line": 16,
+ "source_header": "def chartCenter (d : \u2115) (L : \u211d) [Fact (0 < L)] (q : SourceTorus d L) : Fin d \u2192 \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "quotientChart_symm",
+ "line": 19,
+ "source_header": "theorem quotientChart_symm (d : \u2115) (L : \u211d) [Fact (0 < L)] (a : Fin d \u2192 \u211d) :\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 : \u2115) (L : \u211d) [Fact (0 < L)] (q : SourceTorus d L) :\n q \u2208 (quotientChart d L (chartCenter d L q)).source"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "chart_transition_contDiff",
+ "line": 51,
+ "source_header": "theorem chart_transition_contDiff (d : \u2115) (L : \u211d) [Fact (0 < L)] (a b : Fin d \u2192 \u211d) :\n ContDiffOn \u211d \u221e ((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 : \u2115) (L : \u211d) [Fact (0 < L)] :\n IsManifold \ud835\udcd8(\u211d, Fin d \u2192 \u211d) \u221e (SourceTorus d L)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_contMDiff_ae",
+ "line": 110,
+ "source_header": "theorem torusSourceField_contMDiff_ae (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n \u2200\u1d50 sample \u2202sourceLaw d,\n ContMDiff \ud835\udcd8(\u211d, Fin d \u2192 \u211d) \ud835\udcd8(\u211d) 4 (torusSourceField d L sample)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_weakSuperlevel_closed_ae",
+ "line": 126,
+ "source_header": "theorem torusSourceField_weakSuperlevel_closed_ae (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n \u2200\u1d50 sample \u2202sourceLaw d, \u2200 h : \u211d,\n IsClosed {q : SourceTorus d L | h \u2264 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 : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) : (Fin d \u2192 \u211d) \u2192L[\u211d]"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "phaseCLM_apply",
+ "line": 16,
+ "source_header": "i\n\ntheorem phaseCLM_apply (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d) :\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 : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :\n \u2016phaseCLM d L k\u2016 \u2264 \u2211 i, |sourceC L * (k i : \u211d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeCoefficient_iteratedFDeriv_bound",
+ "line": 35,
+ "source_header": "]\n\ntheorem modeCoefficient_iteratedFDeriv_bound (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (m : SourceMode d) (j : \u2115) (hj : j \u2264 4) (x : Fin d \u2192 \u211d) :\n \u2016iteratedFDeriv \u211d j (modeCoefficient d L m) x\u2016 \u2264 modeMajorant d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_contDiff_ae",
+ "line": 102,
+ "source_header": "]\n\ntheorem sourceField_contDiff_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, ContDiff \u211d 4 (sourceField d L \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_contDiff_affine_ae",
+ "line": 133,
+ "source_header": ")\n\ntheorem sourceField_contDiff_affine_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, \u2200 (T : (Fin d \u2192 \u211d) \u2192L[\u211d] (Fin d \u2192 \u211d)) (a : Fin d \u2192 \u211d),\n ContDiff \u211d 4 (fun x => sourceField d L \u03c9 (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 : \u2115) (m : SourceMode d) : Fin d \u2192 \u2124"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "halfLattice_ne_zero",
+ "line": 13,
+ "source_header": "theorem halfLattice_ne_zero (d : \u2115) {k : Fin d \u2192 \u2124} (hk : k \u2208 halfLattice d) :\n k \u2260 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "halfLattice_partition",
+ "line": 20,
+ "source_header": "theorem halfLattice_partition (d : \u2115) {k : Fin d \u2192 \u2124} (hk : k \u2260 0) :\n (k \u2208 halfLattice d \u2228 -k \u2208 halfLattice d) \u2227\n \u00ac (k \u2208 halfLattice d \u2227 -k \u2208 halfLattice d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceWeight_neg",
+ "line": 59,
+ "source_header": "theorem sourceWeight_neg (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :\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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k n : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d) :\n phase d L k (fun i => x i + L * (n i : \u211d)) =\n phase d L k x + ((\u2211 i, k i * n i : \u2124) : \u211d) * (2 * Real.pi)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeCoefficient_lattice_shift",
+ "line": 78,
+ "source_header": "theorem modeCoefficient_lattice_shift (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (m : SourceMode d) (n : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d) :\n modeCoefficient d L m (fun i => x i + L * (n i : \u211d)) =\n modeCoefficient d L m x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_lattice_shift",
+ "line": 90,
+ "source_header": "theorem sourceField_lattice_shift (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SourceMode d \u2192 \u211d) (n : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d) :\n sourceField d L \u03c9 (fun i => x i + L * (n i : \u211d)) = sourceField d L \u03c9 x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pairedCoefficient_kernel",
+ "line": 100,
+ "source_header": "theorem pairedCoefficient_kernel (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k : \u21a5(halfLattice d)) (x y : Fin d \u2192 \u211d) :\n (\u2211 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 : \u2115) : 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 \u211d (Fin 6)) (S : Matrix (Fin 6) (Fin 6) \u211d)\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 \u2200\u1d50 x \u2202multivariateGaussian m S,\n x 0 = -1 \u2227 x 1 = 1 \u2227 x 2 + x 3 = 0 \u2227 x 4 - x 5 ="
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "gnl_positivePart_memLp",
+ "line": 64,
+ "source_header": "\u27e9\n\nprivate lemma gnl_positivePart_memLp {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} {f : \u03a9 \u2192 \u211d} {p : \u211d\u22650\u221e} (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 : \u211d) (m : EuclideanSpace \u211d (Fin 6))\n (S : Matrix (Fin 6) (Fin 6) \u211d) (hS : S.PosSemidef) :\n Integrable (fun x : EuclideanSpace \u211d (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 : \u211d \u2192 EuclideanSpace \u211d (Fin 6)) (S : \u211d \u2192 Matrix (Fin 6) (Fin 6) \u211d)\n (m0 : EuclideanSpace \u211d (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) \u211d)\n (hm : Tendsto m (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd m0))\n (hS : Tendsto S (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd S0))\n (hPSD : \u2200\u1da0 r in \ud835\udcdd[>] (0 : \u211d), (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 \u2203 c : \u211d, 0 < c \u2227 \u2203 \u03b4 : \u211d, 0 < \u03b4 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192 c*r^2 \u2264\n \u222b x : EuclideanSpace \u211d (Fin 6), r^2 * gn_normalizedWeight r (ofLp x)\n \u2202multivariateGaussian (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 : \u211d \u2192 EuclideanSpace \u211d (Fin 6)) (S : \u211d \u2192 Matrix (Fin 6) (Fin 6) \u211d)\n (m0 : EuclideanSpace \u211d (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) \u211d)\n (hm : Tendsto m (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd m0))\n (hS : Tendsto S (\ud835\udcdd[>] (0 : \u211d)) (\ud835\udcdd S0))\n (hPSD : \u2200\u1da0 r in \ud835\udcdd[>] (0 : \u211d), (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 \u2203 c : \u211d, 0 < c \u2227 \u2203 \u03b4 : \u211d, 0 < \u03b4 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192 c*r^2 \u2264\n \u222b x : EuclideanSpace \u211d (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]\n \u2202multivariateGaussian (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 \u2192 \u211d) : 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 : \u211d) (hr : 0 < r) :\n max (max (-a) 0 * max (-c) 0 - r * b ^ 2) 0 =\n if a < 0 \u2227 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 : \u211d) (j : Fin 6 \u2192 \u211d) (hr : 0 < r) :\n dm2Negative (egm_HM r j) \u2194 j 0 < 0 \u2227 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 : \u211d) (j : Fin 6 \u2192 \u211d) (hr : 0 < r) :\n (egm_HS r j).det < 0 \u2194 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 : \u211d) (j : Fin 6 \u2192 \u211d) (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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) (J : \u03a9 \u2192 Fin 6 \u2192 \u211d) (r : \u211d) (hr : 0 < r) :\n (\u222b \u03c9, egm_weight r (J \u03c9) \u2202P) =\n r ^ 2 * \u222b \u03c9, 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) (J : \u03a9 \u2192 Fin 6 \u2192 \u211d) (r : \u211d) (hr : 0 < r) :\n Integrable (fun \u03c9 => egm_weight r (J \u03c9)) P \u2194\n Integrable (fun \u03c9 => 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) [IsFiniteMeasure P]\n (J : \u03a9 \u2192 Fin 6 \u2192 \u211d) (hJ : Measurable J) (r : \u211d) (hr : 0 < r)\n (hsq : Integrable (fun \u03c9 => egm_weight r (J \u03c9) ^ 2) P) :\n Integrable (fun \u03c9 => egm_weight r (J \u03c9)) P \u2227\n Integrable (fun \u03c9 => gn_normalizedWeight r (enb_permut"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "enb_normalizer_floor_of_common_coupling",
+ "line": 149,
+ "source_header": ").mp hphysical\u27e9\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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) [IsProbabilityMeasure P]\n (J : \u211d \u2192 \u03a9 \u2192 Fin 6 \u2192 \u211d) (hJ : \u2200 r, Measurable (J r))\n (A Q : \u03a9 \u2192 \u211d) (m : \u211d) (v : \u211d\u22650) (hv : v \u2260 0)\n (hQ : HasLaw Q (gaussianReal m v) P)\n (hconv : \u2200\u1d50 \u03c9 \u2202P, Tendsto (fun r => J r \u03c9) (\ud835\udcdd[>] (0 : \u211d))\n (\ud835\udcdd ![-1,-A \u03c9/2,Q \u03c9,1,A \u03c9/2,Q \u03c9]))\n (hint : \u2200\u1da0 r in \ud835\udcdd[>] (0 : \u211d),\n Integrable (fun \u03c9 => egm_weight r (J r \u03c9)) P) :\n \u2203 c : \u211d, 0 < c \u2227 \u2203 \u03b4 : \u211d, 0 < \u03b4 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n c * r ^ 2 \u2264 \u222b \u03c9, 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 : \u211d) (j : Fin 6 \u2192 \u211d) : Matrix (Fin 2) (Fin 2)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "egm_HS",
+ "line": 16,
+ "source_header": "]\n\ndef egm_HS (r : \u211d) (j : Fin 6 \u2192 \u211d) : Matrix (Fin 2) (Fin 2)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "egm_weight",
+ "line": 19,
+ "source_header": "]\n\nnoncomputable def egm_weight (r : \u211d) (j : Fin 6 \u2192 \u211d) :"
+ },
+ {
+ "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 : \u211d) : Measurable (egm_weight"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "egm_coordinate_bound",
+ "line": 49,
+ "source_header": "nst\n\nprivate theorem egm_coordinate_bound (j : Fin 6 \u2192 \u211d) (i : Fin 6) :\n |j i| \u2264 gm8Radiu"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "egm_factor_bound",
+ "line": 56,
+ "source_header": "ith\n\nprivate theorem egm_factor_bound (r a b c R : \u211d) (hr : 0 \u2264 r) (hr1 : r \u2264 1)\n (hR : 0 \u2264 R) (ha : |a| \u2264 R) (hb : |b| \u2264 R) (hc : |c| \u2264 R) :\n |a * c - r * b ^ 2| \u2264 2 * R"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "egm_untyped",
+ "line": 68,
+ "source_header": "th)\n\nprivate theorem egm_untyped (r : \u211d) (j : Fin 6 \u2192 \u211d) (hr : 0 < r) (hr1 : r \u2264 1) :\n ((egm_HM r j).det * (egm_HS r j).det) ^ 2 \u2264\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 : \u211d) (j : Fin 6 \u2192 \u211d) (hr : 0 < r) (hr1 : r \u2264 1) :\n egm_weight r j ^ 2 \u2264 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (J : \u03a9 \u2192 Fin 6 \u2192 \u211d)\n (hJ : Measurable J) (m : Fin 6 \u2192 \u211d) (v : Fin 6 \u2192 \u211d\u22650)\n (B V r : \u211d) (hB : 0 \u2264 B) (hV : 0 \u2264 V) (hr : 0 < r) (hr1 : r \u2264 1)\n (hmean : \u2200 i, |m i| \u2264 B) (hvar : \u2200 i, (v i : \u211d) \u2264 V)\n (hlaw : \u2200 i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) \u03bc) :\n Integrable (fun x => egm_weight r (J x) ^ 2) \u03bc \u2227\n (\u222b x, egm_weight r (J x) ^ 2 \u2202\u03bc) \u2264 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) : Measur"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "prw_integrable_of_integrable_sq",
+ "line": 31,
+ "source_header": "\u03bc))\n\n/-- On a finite measure, a measurable square-integrable real weight is integrable. -/\ntheorem prw_integrable_of_integrable_sq {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) [IsFiniteMeasure \u03bc] (W : \u03a9 \u2192 \u211d) (hW : Measurable W)\n (hsq : Integrable (fun \u03c9 => W \u03c9 ^ 2) \u03bc) : Integrabl"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "prw_measure_apply",
+ "line": 42,
+ "source_header": "W \u03c9)]\n\n/-- The actual event mass is the normalized set integral, in extended reals. -/\ntheorem prw_measure_apply {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) (hW : Integrable W \u03bc)\n (hW0 : \u2200 \u03c9, 0 \u2264 W \u03c9) (hZ : 0 < \u222b x, W x \u2202\u03bc)\n (E : Set \u03a9) (hE : MeasurableSet E) :\n prwMeasure \u03bc W E = ENNReal.ofReal ((\u222b x in E, W x \u2202\u03bc) / \u222b 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) (hW : Integrable W \u03bc)\n (hW0 : \u2200 \u03c9, 0 \u2264 W \u03c9) (hZ : 0 < \u222b x, W x \u2202\u03bc) :\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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) (W : \u03a9 \u2192 \u211d) (hW : Integrable W \u03bc)\n (hW0 : \u2200 \u03c9, 0 \u2264 W \u03c9) (hZ : 0 < \u222b x, W x \u2202\u03bc)\n (E : Set \u03a9) (hE : MeasurableSet E) :\n (prwMeasure \u03bc W).real E = (\u222b x in E, W x \u2202\u03bc) /"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "prw_numerator_bound",
+ "line": 73,
+ "source_header": "W0) hZ.le)]\n\n/-- Integral Cauchy\u2013Schwarz against the event indicator, including null events. -/\ntheorem prw_numerator_bound {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) [IsFiniteMeasure \u03bc] (W : \u03a9 \u2192 \u211d) (hW : Measurable W)\n (hW0 : \u2200 \u03c9, 0 \u2264 W \u03c9) (hsq : Integrable (fun \u03c9 => W \u03c9 ^ 2) \u03bc)\n (E : Set \u03a9) (hE : MeasurableSet E) :\n (\u222b x in E, W x \u2202\u03bc) \u2264\n Real.sqrt (\u222b x, W x ^ 2 \u2202\u03bc) * 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (W : \u03a9 \u2192 \u211d) (hW : Measurable W)\n (hW0 : \u2200 \u03c9, 0 \u2264 W \u03c9) (hsq : Integrable (fun \u03c9 => W \u03c9 ^ 2) \u03bc)\n (C c r : \u211d) (hC : 0 \u2264 C) (hc : 0 < c) (hr : 0 < r)\n (hmoment : (\u222b x, W x ^ 2 \u2202\u03bc) \u2264 C * r ^ 4)\n (hfloor : c * r ^ 2 \u2264 \u222b x, W x \u2202\u03bc)\n (E : Set \u03a9) (hE : MeasurableSet E) :\n IsProbabilityMeasure (prwMeasure \u03bc W) \u2227\n (prwMeasure \u03bc W).real E \u2264 (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 : \u2115} (j : Fin n \u2192 \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "gm8FiniteM8",
+ "line": 15,
+ "source_header": "|\n\n/-- One finite-dimensional Gaussian radius moment constant. -/\nnoncomputable def gm8FiniteM8 (n : \u2115) (B V : \u211d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gm8FiniteM8_nonneg",
+ "line": 19,
+ "source_header": "8))\n\ntheorem gm8FiniteM8_nonneg (n : \u2115) (B V : \u211d) : 0 \u2264 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 : \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gm8M8_nonneg",
+ "line": 28,
+ "source_header": "8C8))\n\ntheorem gm8M8_nonneg (B V : \u211d) : 0 \u2264 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 : \u2115) (j : Fin n \u2192 \u211d) :\n gm8Radius j ^ 8 \u2264 ((n+1 : \u2115) : \u211d)^7 * (1 + \u2211 i, |j"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gm8_finite_integrable_bound",
+ "line": 41,
+ "source_header": "ing h\n\ntheorem gm8_finite_integrable_bound (n : \u2115) {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (J : \u03a9 \u2192 Fin n \u2192 \u211d)\n (hJ : Measurable J) (m : Fin n \u2192 \u211d) (v : Fin n \u2192 \u211d\u22650)\n (B V : \u211d) (hB : 0 \u2264 B) (hV : 0 \u2264 V)\n (hmean : \u2200 i, |m i| \u2264 B) (hvar : \u2200 i, (v i : \u211d) \u2264 V)\n (hlaw : \u2200 i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) \u03bc) :\n Integrable (fun x => gm8Radius (J x)^8) \u03bc \u2227\n (\u222b x, gm8Radius (J x)^8 \u2202\u03bc) \u2264 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 \u2264 (10 : \u211d)^7 * (1 + \u2211 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (\u03bc : Measure \u03a9) [IsProbabilityMeasure \u03bc] (J : \u03a9 \u2192 DM2Jet)\n (hJ : Measurable J) (m : Fin 9 \u2192 \u211d) (v : Fin 9 \u2192 \u211d\u22650)\n (B V : \u211d) (hB : 0 \u2264 B) (hV : 0 \u2264 V)\n (hmean : \u2200 i, |m i| \u2264 B) (hvar : \u2200 i, (v i : \u211d) \u2264 V)\n (hlaw : \u2200 i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) \u03bc) :\n Integrable (fun x => dm2Radius (J x)^8) \u03bc \u2227\n (\u222b x, dm2Radius (J x)^8 \u2202\u03bc) \u2264"
+ },
+ {
+ "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)) (\u03bc r)) :\n 0 \u2264 16*gm8M8 B V \u2227 \u2200 r, 0 < r \u2192 r \u2264 r0 \u2192\n Integrable (fun x => dm2Weight r (J r x)^2) (\u03bc r) \u2227\n (\u222b x, dm2Weight r (J r x)^2 \u2202\u03bc r) \u2264 (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 {\u03b1 \u03b2 : Type*} [MeasurableSpace \u03b1] [MeasurableSpace \u03b2]\n (\u03bc : Measure \u03b1) (\u03bd : Measure \u03b2) [SFinite \u03bc] [SFinite \u03bd] :\n \u03bc \u2297\u2098 (Kernel.id \u00d7\u2096 Kernel.const \u03b1 \u03bd) =\n (\u03bc.prod \u03bd).map (fun p : \u03b1 \u00d7 \u03b2 => (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 {\u03a9 \u03b1 \u03b2 : Type*} [MeasurableSpace \u03a9]\n [MeasurableSpace \u03b1] [MeasurableSpace \u03b2] {P : Measure \u03a9} [IsProbabilityMeasure P]\n {X : \u03a9 \u2192 \u03b1} {R : \u03a9 \u2192 \u03b2} (hX : AEMeasurable X P) (hR : AEMeasurable R P)\n (hXR : IndepFun X R P) :\n HasCondDistrib (fun \u03c9 => (X \u03c9, R \u03c9)) X\n (Kernel.id \u00d7\u2096 Kernel.const \u03b1 (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 : \u2115}\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d)\n (p : (Fin n \u2192 \u211d) \u00d7 (Fin k \u2192 \u211d)) : Fi"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "regressionReconstruction_measurable",
+ "line": 66,
+ "source_header": "1 - mX)\n\nlemma regressionReconstruction_measurable {n k : \u2115}\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\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 : \u2115} (\u03bd : Measure (Fin k \u2192 \u211d))\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\n Kernel (Fin n \u2192 \u211d) (F"
+ },
+ {
+ "kind": "instance",
+ "unqualified_name": "regressionKernel_isMarkov",
+ "line": 79,
+ "source_header": "B mX mY)\n\ninstance regressionKernel_isMarkov {n k : \u2115} (\u03bd : Measure (Fin k \u2192 \u211d))\n [IsProbabilityMeasure \u03bd] (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d))\n (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\n IsMarkovKernel (regressionKernel \u03bd"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "regressionKernel_apply",
+ "line": 86,
+ "source_header": "B mX mY)\n\nlemma regressionKernel_apply {n k : \u2115} (\u03bd : Measure (Fin k \u2192 \u211d)) [SFinite \u03bd]\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d)\n (x : Fin n \u2192 \u211d) :\n regressionKernel \u03bd B mX mY x = \u03bd.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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} [IsProbabilityMeasure P] {n k : \u2115}\n {X : \u03a9 \u2192 Fin n \u2192 \u211d} {R : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hX : AEMeasurable X P) (hR : AEMeasurable R P) (hXR : IndepFun X R P)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\n HasCondDistrib (fun \u03c9 => R \u03c9 + mY + B (X \u03c9 - 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} {n k : \u2115} {X : \u03a9 \u2192 Fin n \u2192 \u211d} {R : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hXR : HasGaussianLaw (fun \u03c9 => (X \u03c9, R \u03c9)) P)\n (hzero : \u2200 i j, covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => R \u03c9 j) P = 0)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\n HasCondDistrib (fun \u03c9 => R \u03c9 + mY + B (X \u03c9 - 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 : \u2115} (\u03bd : Measure (Fin k \u2192 \u211d))\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} {n k : \u2115} {X : \u03a9 \u2192 Fin n \u2192 \u211d} {R : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hXR : HasGaussianLaw (fun \u03c9 => (X \u03c9, R \u03c9)) P)\n (hzero : \u2200 i j, covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => R \u03c9 j) P = 0)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\n IsMarkovKernel (regressionKernel (P.map R) B mX mY) \u2227\n Measurable (regressionKernel (P.map R) B mX mY) \u2227\n (\u2200 x, regressionKernel (P.map R) B mX mY x =\n (P.map R).map (fun r => r + mY + B (x - mX))) \u2227\n HasCondDistrib (fun \u03c9 => R \u03c9 + mY + B (X \u03c9 - mX)) X\n (regressionKernel (P."
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "regression_map_coordinate",
+ "line": 142,
+ "source_header": "XR hzero B mX mY\u27e9\n\n/-- Coordinates of a finite-vector continuous linear map in the standard basis. -/\nlemma regression_map_coordinate {n k : \u2115}\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (v : Fin n \u2192 \u211d) (j : Fin k) :\n B v j = \u2211 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} [IsProbabilityMeasure P] {n k : \u2115}\n {X : \u03a9 \u2192 Fin n \u2192 \u211d} (hX : HasGaussianLaw X P)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d)\n (i : Fin n) (j : Fin k) :\n covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => B (X \u03c9 - mX) j) P =\n \u2211 l, B (Pi.single l 1) j * covariance (fun \u03c9 => X \u03c9"
+ },
+ {
+ "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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} {n k : \u2115} {X : \u03a9 \u2192 Fin n \u2192 \u211d} {Y : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hXY : HasGaussianLaw (fun \u03c9 => (X \u03c9, Y \u03c9)) P)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d)\n (hnormal : \u2200 i j, covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => Y \u03c9 j) P =\n \u2211 l, B (Pi.single l 1) j * covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => X \u03c9 l) P) :\n \u2200 i j, covariance (fun \u03c9 => X \u03c9 i)\n (fun \u03c9 => (Y \u03c9 - 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 {\u03a9 : Type*} [MeasurableSpace \u03a9] {P : Measure \u03a9} {n k : \u2115}\n {X : \u03a9 \u2192 Fin n \u2192 \u211d} {Y : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hXY : HasGaussianLaw (fun \u03c9 => (X \u03c9, Y \u03c9)) P)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d) :\n HasGaussianLaw (fun \u03c9 => (X \u03c9, 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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} {n k : \u2115} {X : \u03a9 \u2192 Fin n \u2192 \u211d} {Y : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hXY : HasGaussianLaw (fun \u03c9 => (X \u03c9, Y \u03c9)) P)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d)\n (hnormal : \u2200 i j, covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => Y \u03c9 j) P =\n \u2211 l, B (Pi.single l 1) j * covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => X \u03c9 l) P) :\n HasCondDistrib Y X\n (regressionKernel (P.map (fun \u03c9 => Y \u03c9 - mY"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gaussianRegression_observed_spec",
+ "line": 246,
+ "source_header": "d using 1\n funext \u03c9\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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n {P : Measure \u03a9} {n k : \u2115} {X : \u03a9 \u2192 Fin n \u2192 \u211d} {Y : \u03a9 \u2192 Fin k \u2192 \u211d}\n (hXY : HasGaussianLaw (fun \u03c9 => (X \u03c9, Y \u03c9)) P)\n (B : (Fin n \u2192 \u211d) \u2192L[\u211d] (Fin k \u2192 \u211d)) (mX : Fin n \u2192 \u211d) (mY : Fin k \u2192 \u211d)\n (hnormal : \u2200 i j, covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => Y \u03c9 j) P =\n \u2211 l, B (Pi.single l 1) j * covariance (fun \u03c9 => X \u03c9 i) (fun \u03c9 => X \u03c9 l) P) :\n IsMarkovKernel\n (regressionKernel (P.map (fun \u03c9 => Y \u03c9 - mY - B (X \u03c9 - mX))) B mX mY) \u2227\n Measurable\n (regressionKernel (P.map (fun \u03c9 => Y \u03c9 - mY - B (X \u03c9 - mX))) B mX mY) \u2227\n (\u2200 x, regressionKernel (P.map (fun \u03c9 => Y \u03c9 - mY - B (X \u03c9 - mX))) B mX mY x =\n (P.map (fun \u03c9 => Y \u03c9 - mY - B (X \u03c9 - mX))).map\n (fun r => r + mY + B (x - mX))) \u2227\n HasCondDistrib Y X\n (regressionKernel (P.map (fun \u03c9 => Y \u03c9 - 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 {\u03b9 R : Type*} [Fintype \u03b9] [DecidableEq \u03b9]\n {u : Filter R} {S : R \u2192 Matrix \u03b9 \u03b9 \u211d} {S0 : Matrix \u03b9 \u03b9 \u211d}\n (hS : Tendsto S u (\ud835\udcdd S0)) (z : EuclideanSpace \u211d \u03b9) :\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 {\u03b9 : Type*} [Fintype \u03b9] [DecidableEq \u03b9]\n (m : EuclideanSpace \u211d \u03b9) (S : Matrix \u03b9 \u03b9 \u211d) (z : EuclideanSpace \u211d \u03b9) :\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 {\u03b9 : Type*} [Fintype \u03b9] [DecidableEq \u03b9]\n (m : EuclideanSpace \u211d \u03b9) (S : Matrix \u03b9 \u03b9 \u211d) :\n HasLaw (gc_coupledVector m S) (multivariateGaussian m S)\n (stdGaussian (EuclideanSpace \u211d \u03b9)) 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 {\u03b9 \u03ba : Type*} [Fintype \u03b9] [DecidableEq \u03b9]\n (u : Filter \u03ba) (m : \u03ba \u2192 EuclideanSpace \u211d \u03b9) (S : \u03ba \u2192 Matrix \u03b9 \u03b9 \u211d)\n (m0 : EuclideanSpace \u211d \u03b9) (S0 : Matrix \u03b9 \u03b9 \u211d)\n (hm : Tendsto m u (\ud835\udcdd m0)) (hS : Tendsto S u (\ud835\udcdd S0))\n (hPSD : \u2200\u1da0 t in u, (S t).PosSemidef) (hPSD0 : S0.PosSemidef)\n (z : EuclideanSpace \u211d \u03b9) :\n Tendsto (fun t => gc_coupledVector (m t) (S t) z) u\n (\ud835\udcdd (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\u00b2. -/\nnoncomputable def gn_normalizedWeight (r : \u211d) (v : Fin 6 \u2192 \u211d)"
+ },
+ {
+ "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 : \u211d) (v : \u211d\u22650) (hv : v \u2260 0) :\n Integrable (fun q : \u211d => (max (-q) 0)^2) (gaussianReal m v) \u2227\n 0 < \u222b q : \u211d, (max (-q) 0)^2 \u2202gaussianRea"
+ },
+ {
+ "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 : \u211d) (v : Fin 6 \u2192 \u211d)\n (hr : 0 \u2264 r) (hK : 0 < K) (hsmall : r * K^2 \u2264 1/4)\n (haM : v 0 \u2208 Set.Ioo (-5/4) (-3/4))\n (haS : v 1 \u2208 Set.Ioo (3/4) (5/4))\n (hbM : |v 2| < K) (_hbS : |v 3| < K)\n (hcM : v 4 \u2208 Set.Ioo (-2) (-1))\n (hcS : v 5 \u2208 Set.Ioo (-2) (-1)) :\n (3 : \u211d)/8 \u2264 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 : \u211d => |z| ^ 8) (gaussianReal 0 1"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gm8_standard_nonneg",
+ "line": 24,
+ "source_header": ")\n\ntheorem gm8_standard_nonneg : 0 \u2264 gm8C"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gm8_integrable",
+ "line": 27,
+ "source_header": ")\n\nprivate theorem gm8_integrable (m : \u211d) (v : \u211d\u22650) :\n Integrable (fun x : \u211d => |x| ^ 8) (gaussianReal m v"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gm8_sqrt_pow",
+ "line": 33,
+ "source_header": ")\n\nprivate theorem gm8_sqrt_pow (V : \u211d) (hV : 0 \u2264 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 : \u211d) (v : \u211d\u22650) :\n (gaussianReal 0 1).map (fun z : \u211d => m + Real.sqrt (v : \u211d) * 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 : \u211d) (v : \u211d\u22650) (hB : 0 \u2264 B) (hV : 0 \u2264 V)\n (hm : |m| \u2264 B) (hv : (v : \u211d) \u2264 V) (z : \u211d) :\n |m + Real.sqrt (v : \u211d) * z| ^ 8 \u2264 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 : \u211d) (v : \u211d\u22650)\n (hB : 0 \u2264 B) (hV : 0 \u2264 V) (hm : |m| \u2264 B) (hv : (v : \u211d) \u2264 V) :\n Integrable (fun x : \u211d => |x| ^ 8) (gaussianReal m v) \u2227\n (\u222b x : \u211d, |x| ^ 8 \u2202gaussianReal m v) \u2264\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 {\u03a9 \u03b9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) (u : Filter \u03b9) [IsCountablyGenerated u] [NeBot u]\n (f : \u03b9 \u2192 \u03a9 \u2192 \u211d) (g : \u03a9 \u2192 \u211d)\n (hmeas : \u2200 r, Measurable (f r))\n (hnonneg : \u2200 r \u03c9, 0 \u2264 f r \u03c9)\n (hg : Integrable g P) (hgpos : 0 < \u222b \u03c9, g \u03c9 \u2202P)\n (hconv : \u2200\u1d50 \u03c9 \u2202P, Tendsto (fun r => f r \u03c9) u (\ud835\udcdd (g \u03c9)))\n (hfint : \u2200\u1da0 r in u, Integrable (f r) P) :\n \u2200\u1da0 r in u, (\u222b \u03c9, g \u03c9 \u2202P)/2 \u2264 \u222b \u03c9, f r \u03c9 \u2202"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "nfloor_weight_continuous",
+ "line": 52,
+ "source_header": "e\n\nprivate theorem nfloor_weight_continuous :\n Continuous (fun p : \u211d \u00d7 (Fin 6 \u2192 \u211d) => 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 : \u211d) :\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 : \u211d \u2192 Fin 6 \u2192 \u211d) (a q : \u211d)\n (hX : Tendsto X (\ud835\udcdd[>] (0:\u211d)) (\ud835\udcdd ![-1,1,-a/2,a/2,q,q])) :\n Tendsto (fun r => gn_normalizedWeight r (X r)) (\ud835\udcdd[>] (0:\u211d))\n (\ud835\udcdd ((max (-q) 0)^2)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "nfloor_reference",
+ "line": 68,
+ "source_header": ")\nprivate theorem nfloor_reference {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) (Q : \u03a9 \u2192 \u211d) (m : \u211d) (v : \u211d\u22650) (hv : v \u2260 0)\n (hlaw : HasLaw Q (gaussianReal m v) P) :\n Integrable (fun \u03c9 => (max (-Q \u03c9) 0)^2) P \u2227\n 0 < \u222b \u03c9, (max (-Q \u03c9) 0)^2 \u2202"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gn_normalizer_floor_of_common_coupling",
+ "line": 78,
+ "source_header": "s\n\n/-- The actual integral of the physical r\u00b2-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 {\u03a9 : Type*} [MeasurableSpace \u03a9]\n (P : Measure \u03a9) [IsProbabilityMeasure P]\n (X : \u211d \u2192 \u03a9 \u2192 Fin 6 \u2192 \u211d) (hX : \u2200 r, Measurable (X r))\n (A Q : \u03a9 \u2192 \u211d) (m : \u211d) (v : \u211d\u22650) (hv : v \u2260 0)\n (hQ : HasLaw Q (gaussianReal m v) P)\n (hconv : \u2200\u1d50 \u03c9 \u2202P, Tendsto (fun r => X r \u03c9) (\ud835\udcdd[>] (0 : \u211d))\n (\ud835\udcdd ![-1,1,-A \u03c9/2,A \u03c9/2,Q \u03c9,Q \u03c9]))\n (hint : \u2200\u1da0 r in \ud835\udcdd[>] (0 : \u211d),\n Integrable (fun \u03c9 => gn_normalizedWeight r (X r \u03c9)) P) :\n \u2203 c : \u211d, 0 < c \u2227 \u2203 \u03b4 : \u211d, 0 < \u03b4 \u2227\n \u2200 r : \u211d, 0 < r \u2192 r < \u03b4 \u2192\n c * r^2 \u2264 \u222b \u03c9, r^2 * gn_normalizedWeight r (X r \u03c9)"
+ }
+ ]
+ },
+ {
+ "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) : \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "dm2HM",
+ "line": 24,
+ "source_header": "noncomputable def dm2HM (r : \u211d) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "dm2HS",
+ "line": 28,
+ "source_header": "noncomputable def dm2HS (r : \u211d) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) \u211d"
+ },
+ {
+ "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) \u211d) : Pro"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "dm2Weight",
+ "line": 36,
+ "source_header": "0\n\nnoncomputable def dm2Weight (r : \u211d) (j : DM2Jet) :"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "dm2_scale",
+ "line": 41,
+ "source_header": "0\n\nprivate lemma dm2_scale (r x : \u211d) (hr : 0 \u2264 r) (hr1 : r \u2264 1) :\n |r*x| \u2264 |x"
+ },
+ {
+ "kind": "lemma",
+ "unqualified_name": "dm2_factors",
+ "line": 46,
+ "source_header": "]\n\nprivate lemma dm2_factors (r A B C R : \u211d) (hr : 0 \u2264 r) (hr1 : r \u2264 1)\n (hR : 0 \u2264 R) (hA : |A| \u2264 R) (hB : |B| \u2264 R) (hC : |C| \u2264 R) :\n |A*C-r*B^2| \u2264 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 : \u211d) (j : DM2Jet) (hr : 0 < r) (hr1 : r \u2264 1) :\n ((dm2HM r j).det * (dm2HS r j).det)^2 \u2264 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 : \u211d) (j : DM2Jet) (hr : 0 < r) (hr1 : r \u2264 1) :\n dm2Weight r j ^ 2 \u2264 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 : \u211d) :\n dm2Negative !![a,b;b,c] \u2194 a < 0 \u2227 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 : \u211d) : 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 {\u03a9 : Type*} [MeasurableSpace \u03a9] (\u03bc : MeasureTheory.Measure \u03a9)\n (J : \u03a9 \u2192 DM2Jet) (hJ : Measurable J) (r M8 : \u211d) (hr : 0 < r) (hr1 : r \u2264 1)\n (h8 : MeasureTheory.Integrable (fun x => dm2Radius (J x)^8) \u03bc)\n (hM8 : (\u222b x, dm2Radius (J x)^8 \u2202\u03bc) \u2264 M8) :\n MeasureTheory.Integrable (fun x => dm2Weight r (J x)^2) \u03bc \u2227\n (\u222b x, dm2Weight r (J x)^2 \u2202\u03bc)"
+ }
+ ]
+ }
+ ],
+ "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."
+ ]
+ },
+ {
+ "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 : \u2115) : E d \u2243L[\u211d] (Fin d \u2192 \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinates_latticeVec",
+ "line": 20,
+ "source_header": "l\n\ntheorem coordinates_latticeVec (d : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124) :\n coordinates d (latticeVec d L n) = fun i => L * (n i : \u211d"
+ },
+ {
+ "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 : \u2115) (L : \u211d) (\u03c9 : SmoothSample d L) (x : E d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_smooth",
+ "line": 29,
+ "source_header": "x)\n\ntheorem actualField_smooth (d : \u2115) {L : \u211d} (hL : 0 < L)\n (\u03c9 : SmoothSample d L) : IsSmooth d (actualField d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_periodic",
+ "line": 35,
+ "source_header": "iff\n\ntheorem actualField_periodic (d : \u2115) {L : \u211d} (hL : 0 < L)\n (\u03c9 : 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 : \u2115) (L : \u211d) (x : E d) :\n Measurable (fun \u03c9 => actualField d L \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_eval_hasGaussianLaw",
+ "line": 48,
+ "source_header": "L)\n\ntheorem actualField_eval_hasGaussianLaw (d : \u2115) {L : \u211d} (hL : 0 < L)\n (x : E d) : HasGaussianLaw (fun \u03c9 => actualField d L \u03c9 x) (smoothLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_linearCombination_measurable",
+ "line": 53,
+ "source_header": "l 0\n\ntheorem actualField_linearCombination_measurable (d : \u2115) (L : \u211d) {m : \u2115}\n (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d) :\n Measurable (fun \u03c9 => \u2211 i, a i * actualField d L \u03c9 (x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_linearCombination_hasGaussianLaw",
+ "line": 59,
+ "source_header": ")))\n\ntheorem actualField_linearCombination_hasGaussianLaw (d : \u2115) {L : \u211d}\n (hL : 0 < L) {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d) :\n HasGaussianLaw (fun \u03c9 => \u2211 i, a i * actualField d L \u03c9 (x i)) (smoothLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_integral_zero",
+ "line": 73,
+ "source_header": "map\n\ntheorem actualField_integral_zero (d : \u2115) {L : \u211d} (hL : 0 < L) (x : E d) :\n \u222b \u03c9, actualField d L \u03c9 x \u2202smoothLaw d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_linearCombination_integral_zero",
+ "line": 82,
+ "source_header": "x)\n\ntheorem actualField_linearCombination_integral_zero (d : \u2115) {L : \u211d}\n (hL : 0 < L) {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d) :\n \u222b \u03c9, (\u2211 i, a i * actualField d L \u03c9 (x i)) \u2202smoothLaw d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_covariance_spectral",
+ "line": 90,
+ "source_header": "ro]\n\ntheorem actualField_covariance_spectral (d : \u2115) {L : \u211d} (hL : 0 < L)\n (x y : E d) :\n cov[fun \u03c9 => actualField d L \u03c9 x, fun \u03c9 => actualField d L \u03c9 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 : \u2115) (L : \u211d) (hL : 0 < L) :\n GaussianFieldInterface d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "literalCarrier",
+ "line": 16,
+ "source_header": "L\n\ntheorem literalCarrier (d : \u2115) (L : \u211d) (hL : 0 < L) :\n (actualGaussianFieldInterface d L hL).\u03a9 = SmoothSample d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "literalLaw",
+ "line": 19,
+ "source_header": "l\n\ntheorem literalLaw (d : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (hL : 0 < L)\n (\u03c9 : SmoothSample d L) (x : E d) :\n (actualGaussianFieldInterface d L hL).F \u03c9 x =\n smoothSourceField d L \u03c9 (EuclideanSpace.equiv (Fin d) \u211d x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sameCarrierOrders",
+ "line": 27,
+ "source_header": "l\n\ntheorem sameCarrierOrders (d : \u2115) (L : \u211d) (hL : 0 < L)\n (\u03c9 : SmoothSample d L) :\n ContDiff \u211d 5 ((actualGaussianFieldInterface d L hL).F \u03c9) \u2227\n ContDiff \u211d 37 ((actualGaussianFieldInterface d L hL).F \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "wholeCoefficientLaw",
+ "line": 34,
+ "source_header": "\u27e9\n\ntheorem wholeCoefficientLaw (d : \u2115) (L : \u211d) (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 : \u2115) {L : \u211d} (hL : 0 < L) :\n periodicCovariance d L 0 ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rawDiagonalOne",
+ "line": 42,
+ "source_header": ")\n\ntheorem rawDiagonalOne (d : \u2115) {L : \u211d} (hL : 0 < L) (x : E d) :\n \u222b \u03c9, actualField d L \u03c9 x * actualField d L \u03c9 x \u2202smoothLaw d L ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "zeroMean",
+ "line": 46,
+ "source_header": "]\n\ntheorem zeroMean (d : \u2115) {L : \u211d} (hL : 0 < L) (x : E d) :\n \u222b \u03c9, actualField d L \u03c9 x \u2202smoothLaw d L ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "dimensionZeroTheta",
+ "line": 50,
+ "source_header": "x\n\ntheorem dimensionZeroTheta (L : \u211d) : thetaSum 0 L 0 ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "dimensionZeroSpectralNormalizer",
+ "line": 53,
+ "source_header": "]\n\ntheorem dimensionZeroSpectralNormalizer (L : \u211d) : I4Weights.sourceZ 0 L ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "dimensionZeroRawVariance",
+ "line": 56,
+ "source_header": "]\n\ntheorem dimensionZeroRawVariance (L : \u211d) (hL : 0 < L) :\n \u222b \u03c9, actualField 0 L \u03c9 0 * actualField 0 L \u03c9 0 \u2202smoothLaw 0 L ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "emptyQuad",
+ "line": 60,
+ "source_header": "0\n\ntheorem emptyQuad (d : \u2115) (L : \u211d) (x : Fin 0 \u2192 E d) (a : Fin 0 \u2192 \u211d) :\n covQuadForm d L x a ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "emptyFamilyLaw",
+ "line": 63,
+ "source_header": "]\n\ntheorem emptyFamilyLaw (d : \u2115) {L : \u211d} (hL : 0 < L)\n (x : Fin 0 \u2192 E d) (a : Fin 0 \u2192 \u211d) :\n (smoothLaw d L).map (fun \u03c9 => \u2211 i, a i * actualField d L \u03c9 (x i)) =\n Measure.dirac"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "cancelledQuad",
+ "line": 73,
+ "source_header": ")\n\ntheorem cancelledQuad (d : \u2115) {L : \u211d} (_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 : \u2115) (L : \u211d) (x : E d) (\u03c9 : SmoothSample d L) :\n (\u2211 i : Fin 2, (![1, -1] : Fin 2 \u2192 \u211d) i *\n actualField d L \u03c9 ((![x, x] : Fin 2 \u2192 E d) i)) ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "cancelledLaw",
+ "line": 82,
+ "source_header": "]\n\ntheorem cancelledLaw (d : \u2115) {L : \u211d} (hL : 0 < L) (x : E d) :\n (smoothLaw d L).map (fun \u03c9 => \u2211 i : Fin 2,\n (![1, -1] : Fin 2 \u2192 \u211d) i * actualField d L \u03c9 ((![x, x] : Fin 2 \u2192 E d) i)) =\n Measure.dirac"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "reinforcedQuad",
+ "line": 93,
+ "source_header": ")\n\ntheorem reinforcedQuad (d : \u2115) {L : \u211d} (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 : \u2115) {L : \u211d} (hL : 0 < L) (x : E d) :\n (smoothLaw d L).map (fun \u03c9 => \u2211 i : Fin 2,\n (![1, 1] : Fin 2 \u2192 \u211d) i * actualField d L \u03c9 ((![x, x] : Fin 2 \u2192 E d) i)) =\n gaussianReal 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "everyLatticeTranslation",
+ "line": 106,
+ "source_header": "m\n\ntheorem everyLatticeTranslation (d : \u2115) (L : \u211d) (hL : 0 < L)\n (\u03c9 : SmoothSample d L) (x : E d) (n : Fin d \u2192 \u2124) :\n actualField d L \u03c9 (x + latticeVec d L n) = actualField d L \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "euclideanNormSquared",
+ "line": 111,
+ "source_header": "n\n\ntheorem euclideanNormSquared :\n \u2016(WithLp.toLp 2 (![1, 1] : Fin 2 \u2192 \u211d) : E 2)\u2016 ^ 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 : \u2115) {L : \u211d} (hL : 0 < L) (x : E d) :\n \u222b \u03c9, (actualField d L \u03c9 x + 1) \u2202smoothLaw 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 : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124) (j : Fin d) :\n latticeVec d L n j = L * (n j : \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "theta_summand_eq_product",
+ "line": 21,
+ "source_header": "p\n\ntheorem theta_summand_eq_product (d : \u2115) (L : \u211d) (z : E d) (n : Fin d \u2192 \u2124) :\n Real.exp (-(\u2016z + latticeVec d L n\u2016 ^ 2) / 2) =\n \u220f j, Real.exp (-((z j + L * (n j : \u211d)) ^ 2) / 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "shifted_gaussian_le",
+ "line": 29,
+ "source_header": "]\n\ntheorem shifted_gaussian_le (L t : \u211d) (n : \u2124) :\n Real.exp (-((t + L * (n : \u211d)) ^ 2) / 2) \u2264\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 : \u211d} (hL : 0 < L) (t : \u211d) :\n Summable (fun n : \u2124 => Real.exp (-((t + L * (n : \u211d)) ^ 2) / 2)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "theta_summable",
+ "line": 45,
+ "source_header": "n\n\ntheorem theta_summable (d : \u2115) {L : \u211d} (hL : 0 < L) (z : E d) :\n Summable (fun n : Fin d \u2192 \u2124 =>\n Real.exp (-(\u2016z + latticeVec d L n\u2016 ^ 2) / 2)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "theta_zero_pos",
+ "line": 61,
+ "source_header": "]\n\ntheorem theta_zero_pos (d : \u2115) {L : \u211d} (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 : \u2115) (f : Fin d \u2192 \u2124 \u2192 \u211d)\n (hf : \u2200 j, Summable (f j)) (hn : \u2200 j n, 0 \u2264 f j n) :\n Summable (fun k : Fin d \u2192 \u2124 => \u220f 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 : \u2115) (f : Fin d \u2192 \u2124 \u2192 \u2102)\n (hf : \u2200 j, Summable (fun n : \u2124 => \u2016f j n\u2016)) :\n Summable (fun k : Fin d \u2192 \u2124 => \u2016\u220f j, f j (k j)\u2016"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "tsum_fin_product",
+ "line": 99,
+ "source_header": ")\n\nprivate theorem tsum_fin_product\n (d : \u2115) (f : Fin d \u2192 \u2124 \u2192 \u2102)\n (hf : \u2200 j, Summable (fun n : \u2124 => \u2016f j n\u2016)) :\n (\u2211' k : Fin d \u2192 \u2124, \u220f j, f j (k j)) = \u220f j, \u2211' n : \u2124, f j"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "poissonScale",
+ "line": 113,
+ "source_header": "]\n\nprivate def poissonScale (L : \u211d) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "poissonScale_eq",
+ "line": 116,
+ "source_header": ")\n\nprivate theorem poissonScale_eq {L : \u211d} (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 : \u211d) (k : \u2124) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "spectral1Term_norm",
+ "line": 127,
+ "source_header": ")\n\nprivate theorem spectral1Term_norm (L t : \u211d) (k : \u2124) :\n \u2016spectral1Term L t k\u2016 = decay (2 * sourceA L)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "spectral1Term_summable_norm",
+ "line": 133,
+ "source_header": "]\n\nprivate theorem spectral1Term_summable_norm {L : \u211d} (hL : 0 < L) (t : \u211d) :\n Summable (fun k => \u2016spectral1Term L t k\u2016"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "poisson_one_dimension",
+ "line": 139,
+ "source_header": "0\n\nprivate theorem poisson_one_dimension {L : \u211d} (hL : 0 < L) (t : \u211d) :\n ((\u2211' n : \u2124, Real.exp (-((t + L * (n : \u211d)) ^ 2) / 2) : \u211d) : \u2102) =\n (poissonScale L : \u2102) * \u2211' k : \u2124, spectral1Term L t"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "spectral1Term_prod",
+ "line": 191,
+ "source_header": "g\n\nprivate theorem spectral1Term_prod (d : \u2115) (L : \u211d) (x : Fin d \u2192 \u211d)\n (k : Fin d \u2192 \u2124) :\n (\u220f j, spectral1Term L (x j) (k j)) =\n (sourceWeight d L k : \u2102) * Complex.exp ((phase d L k x : \u2102) * Complex.I"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "complex_spectral_summable",
+ "line": 202,
+ "source_header": "]\n\nprivate theorem complex_spectral_summable (d : \u2115) {L : \u211d} (hL : 0 < L)\n (x : Fin d \u2192 \u211d) :\n Summable (fun k : Fin d \u2192 \u2124 => (sourceWeight d L k : \u2102) *\n Complex.exp ((phase d L k x : \u2102) * Complex.I)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "thetaSum_complex",
+ "line": 214,
+ "source_header": "]\n\nprivate theorem thetaSum_complex (d : \u2115) {L : \u211d} (hL : 0 < L) (z : E d) :\n (thetaSum d L z : \u2102) = (poissonScale L : \u2102) ^ d *\n \u2211' k : Fin d \u2192 \u2124, (sourceWeight d L k : \u2102) *\n Complex.exp ((phase d L k (fun i => z i) : \u2102) * Complex.I"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "thetaSum_eq_scaled_cos",
+ "line": 238,
+ "source_header": "k\n\ntheorem thetaSum_eq_scaled_cos (d : \u2115) {L : \u211d} (hL : 0 < L) (z : E d) :\n thetaSum d L z = (Real.sqrt (2 * Real.pi) / L) ^ d *\n \u2211' k : Fin d \u2192 \u2124, 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 : \u2115) {L : \u211d} (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 : \u2115) {L : \u211d} (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 : \u2115) {L : \u211d} (hL : 0 < L)\n (x y : E d) :\n cov[fun \u03c9 => actualField d L \u03c9 x, fun \u03c9 => actualField d L \u03c9 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 : \u2115) {L : \u211d} (hL : 0 < L)\n (x y : E d) :\n \u222b \u03c9, actualField d L \u03c9 x * actualField d L \u03c9 y \u2202smoothLaw 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 : \u2115) {L : \u211d} (hL : 0 < L)\n {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d) :\n Var[fun \u03c9 => \u2211 i, a i * actualField d L \u03c9 (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 : \u2115) {L : \u211d} (hL : 0 < L)\n {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d) :\n 0 \u2264 covQuadForm d L x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualField_linearCombination_map",
+ "line": 50,
+ "source_header": "_\n\ntheorem actualField_linearCombination_map (d : \u2115) {L : \u211d} (hL : 0 < L)\n {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d) :\n (smoothLaw d L).map (fun \u03c9 => \u2211 i, a i * actualField d L \u03c9 (x i)) =\n gaussianReal 0 \u27e8covQuadForm 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 : \u2115) (L : \u211d) (hL : 0 < L) :\n GaussianFieldInterface d L where"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "actualGaussianFieldInterface_exists",
+ "line": 76,
+ "source_header": "hL\n\ntheorem actualGaussianFieldInterface_exists (d : \u2115) (L : \u211d) (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 : \u2115) (a c : \u211d) (k : \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderProductBound",
+ "line": 27,
+ "source_header": "n\n\ndef orderProductBound (n d : \u2115) (a c : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderPairedBound",
+ "line": 30,
+ "source_header": ")\n\ndef orderPairedBound (n d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderModeBound",
+ "line": 33,
+ "source_header": "k\n\ndef orderModeBound (n d : \u2115) (L : \u211d) (m : SourceMode d) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderCoordinateBound_summable",
+ "line": 38,
+ "source_header": "k\n\ntheorem orderCoordinateBound_summable (n : \u2115) {a c : \u211d} (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 : \u2115) {a c : \u211d} (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 : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k : Fin d \u2192 \u2124) :\n orderPairedBound n d L k =\n Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n \u220f i, (1 + |sourceC L * (k i : \u211d)|) ^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderModeBound_nonneg",
+ "line": 92,
+ "source_header": "g\n\ntheorem orderModeBound_nonneg (n d : \u2115) (L : \u211d) (m : SourceMode d) :\n 0 \u2264 orderModeBound n d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderModeBound_summable",
+ "line": 100,
+ "source_header": "y\n\ntheorem orderModeBound_summable (n d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n Summable (orderModeBound n d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderModeBound_four",
+ "line": 115,
+ "source_header": "e\n\ntheorem orderModeBound_four (d : \u2115) (L : \u211d) (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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (m : SourceMode d) (j : \u2115) (x : Fin d \u2192 \u211d) :\n \u2016iteratedFDeriv \u211d j (modeCoefficient d L m) x\u2016 \u2264 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 : \u2115) (L : \u211d) (\u03c9 : SourceMode d \u2192 \u211d) : P"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSample_ae",
+ "line": 183,
+ "source_header": "m|)\n\ntheorem goodSample_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, goodSample d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_smooth_of_goodSample",
+ "line": 190,
+ "source_header": "hL)\n\ntheorem sourceField_smooth_of_goodSample (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SourceMode d \u2192 \u211d) (h\u03c9 : goodSample d L \u03c9) :\n \u2200 n : \u2115, ContDiff \u211d n (sourceField d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_smooth_ae",
+ "line": 222,
+ "source_header": "m))\n\ntheorem sourceField_smooth_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, \u2200 n : \u2115, ContDiff \u211d n (sourceField d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSample_congr_cofinite",
+ "line": 227,
+ "source_header": "h\u03c9\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 : \u2115) (L : \u211d)\n (\u03c9 \u03b7 : SourceMode d \u2192 \u211d) (h\u03c9\u03b7 : \u03c9 =\u1da0[Filter.cofinite] \u03b7) :\n goodSample d L \u03c9 \u2194 goodSample"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSample_finite_change_iff",
+ "line": 242,
+ "source_header": "[hm]\n\ntheorem goodSample_finite_change_iff (d : \u2115) (L : \u211d)\n (\u03c9 \u03b7 : SourceMode d \u2192 \u211d) (s : Finset (SourceMode d))\n (h\u03c9\u03b7 : \u2200 m \u2209 s, \u03c9 m = \u03b7 m) :\n goodSample d L \u03c9 \u2194 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 : \u2115) (L : \u211d) : Set (SourceMode d \u2192"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderAbsNN",
+ "line": 34,
+ "source_header": "\u03c9}\n\nprivate def orderAbsNN (n d : \u2115) (L : \u211d) (\u03c9 : SourceMode d \u2192 \u211d)\n (m : SourceMode d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderAbsTotal",
+ "line": 39,
+ "source_header": "_)\u27e9\n\nprivate def orderAbsTotal (n d : \u2115) (L : \u211d) (\u03c9 : SourceMode d \u2192 \u211d) : \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderAbsTotal_ne_top_iff",
+ "line": 42,
+ "source_header": "0\u221e)\n\nprivate theorem orderAbsTotal_ne_top_iff (n d : \u2115) (L : \u211d)\n (\u03c9 : SourceMode d \u2192 \u211d) :\n orderAbsTotal n d L \u03c9 \u2260 \u221e \u2194\n Summable (fun m => orderModeBound n d L m * |\u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderAbsTotal_measurable",
+ "line": 48,
+ "source_header": "\u03c9)\n\nprivate theorem orderAbsTotal_measurable (n d : \u2115) (L : \u211d) :\n Measurable (orderAbsTotal n d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSet_measurable",
+ "line": 62,
+ "source_header": "eal\n\ntheorem goodSet_measurable (d : \u2115) (L : \u211d) : MeasurableSet (goodSet d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSet_ae",
+ "line": 75,
+ "source_header": "imp\n\ntheorem goodSet_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, \u03c9 \u2208 goodSet"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSet_measure_one",
+ "line": 79,
+ "source_header": "hL\n\ntheorem goodSet_measure_one (d : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) (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 : \u2115) (L : \u211d) : SmoothSample d L \u2192 (SourceMode"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sampleInclusion_measurable",
+ "line": 90,
+ "source_header": "ype.val\n\ntheorem sampleInclusion_measurable (d : \u2115) (L : \u211d) :\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 : \u2115) (L : \u211d) : Measure (SmoothSa"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sampleInclusion_map",
+ "line": 98,
+ "source_header": "sion d L)\n\ntheorem sampleInclusion_map (d : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) {L : \u211d} (hL : L \u2260 0) :\n MeasurePreserving (sampleInclusion d L) (smoothLaw d L) (sou"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothLaw_isProbabilityMeasure",
+ "line": 109,
+ "source_header": "map d hL\u27e9\n\ntheorem smoothLaw_isProbabilityMeasure (d : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d \u2192 \u211d) \u2192 E) (hX : Measurable X) :\n (smoothLaw d L).map (fun \u03c9 => X (sampleInclusion d L \u03c9)) = (sourceL"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_marginal",
+ "line": 121,
+ "source_header": "n_map d hL]\n\ntheorem coordinate_marginal (d : \u2115) {L : \u211d} (hL : L \u2260 0) (m : SourceMode d) :\n (smoothLaw d L).map (fun \u03c9 => sampleInclusion d L \u03c9 m) = gauss"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "finiteCoordinate_map_eq",
+ "line": 126,
+ "source_header": "_marginal m\n\ntheorem finiteCoordinate_map_eq (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (m : Fin n \u2192 SourceMode d) :\n (smoothLaw d L).map (fun \u03c9 j => sampleInclusion d L \u03c9 (m j)) =\n (sourceLaw d).map (fun \u03c9 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 : \u2115) (L : \u211d) (\u03c9 : SmoothSample d L) (x : F"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothSourceField_contDiff",
+ "line": 136,
+ "source_header": "sion d L \u03c9) x\n\ntheorem smoothSourceField_contDiff (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample d L) (n : \u2115) : ContDiff \u211d n (smoothSourc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothSourceField_smooth",
+ "line": 140,
+ "source_header": "\u03c9.property n\n\ntheorem smoothSourceField_smooth (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample d L) : ContDiff \u211d (\u22a4 : \u2115\u221e) (smoothSourc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothSourceField_finiteVector_map_eq",
+ "line": 144,
+ "source_header": "tDiff d hL \u03c9)\n\ntheorem smoothSourceField_finiteVector_map_eq (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (x : Fin n \u2192 (Fin d \u2192 \u211d)) :\n (smoothLaw d L).map (fun \u03c9 j => smoothSourceField d L \u03c9 (x j)) =\n (sourceLaw d).map (fun \u03c9 j => sourceField"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothSourceField_finiteVector_hasGaussianLaw",
+ "line": 151,
+ "source_header": "e d L (x j)))\n\ntheorem smoothSourceField_finiteVector_hasGaussianLaw (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (x : Fin n \u2192 (Fin d \u2192 \u211d)) :\n HasGaussianLaw (fun \u03c9 j => smoothSourceField d L \u03c9 (x j)) (s"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "covariance_comp_inclusion",
+ "line": 161,
+ "source_header": "sGaussian_map\n\ntheorem covariance_comp_inclusion (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (X Y : (SourceMode d \u2192 \u211d) \u2192 \u211d) (hX : Measurable X) (hY : Measurable Y) :\n cov[fun \u03c9 => X (sampleInclusion d L \u03c9), fun \u03c9 => Y (sampleInclusion d L \u03c9); 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (x y : Fin d \u2192 \u211d) :\n cov[fun \u03c9 => smoothSourceField d L \u03c9 x, fun \u03c9 => smoothSourceField d L \u03c9 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 : \u2115) (L : \u211d) [Fact (0 < L)]\n (\u03c9 : SmoothSample d L) (q : Sourc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothTorusSourceField_smooth",
+ "line": 188,
+ "source_header": "ualChartedSpace\n\ntheorem smoothTorusSourceField_smooth (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (\u03c9 : SmoothSample d L) :\n ContMDiff \ud835\udcd8(\u211d, Fin d \u2192 \u211d) \ud835\udcd8(\u211d) (\u22a4 : \u2115\u221e) (smoothTorusSou"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothTorusSourceField_finiteVector_hasGaussianLaw",
+ "line": 205,
+ "source_header": "ontDiffWithinAt\n\ntheorem smoothTorusSourceField_finiteVector_hasGaussianLaw (d : \u2115) (L : \u211d)\n [Fact (0 < L)] (n : \u2115) (q : Fin n \u2192 SourceTorus d L) :\n HasGaussianLaw (fun \u03c9 j => smoothTorusSourceField d L \u03c9 (q j))"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothTorusSourceField_covariance",
+ "line": 218,
+ "source_header": ".isGaussian_map\n\ntheorem smoothTorusSourceField_covariance (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun \u03c9 => smoothTorusSourceField d L \u03c9 q, fun \u03c9 => smoothTorusSourceField d L \u03c9 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 \u211d (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : \u2115) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "latticeVec",
+ "line": 77,
+ "source_header": "in d)\n\n/-- The lattice vector `L n` for `n \u2208 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 : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "thetaSum",
+ "line": 86,
+ "source_header": "i : \u211d))\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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) {m : \u2115} (x : Fin m \u2192 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 : \u2115) (L : \u211d) (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 `\u22a4`).\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 : \u2115) (g"
+ },
+ {
+ "kind": "structure",
+ "unqualified_name": "GaussianFieldInterface",
+ "line": 138,
+ "source_header": "\u2115, ContDiff \u211d 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 : \u2115) (L : \u211d) where\n /-- The underlying probability space (sample space). -/\n \u03a9 : 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\u03a9`.\n [m\u03a9 : MeasurableSpace \u03a9]\n /-- The probability measure `P`. -/\n P : Measure \u03a9\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `\u03c9 \u21a6 f_\u03c9 : R^d \u2192 \u211d`. -/\n F : \u03a9 \u2192 E d \u2192 \u211d\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : \u2200 \u03c9, IsSmooth d (F \u03c9)\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 : \u2200 \u03c9, IsLPeriodic d L (F \u03c9)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : \u2200 z : E d, Summable (fun n : Fin d \u2192 \u2124 => Real.exp (-(\u2016z + latticeVec d L n\u2016 ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : \u2200 {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d), 0 \u2264 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 : \u2200 {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d),\n Measure.map (fun \u03c9 => \u2211 i, a i * F \u03c9 (x i)) P =\n ProbabilityTheory.gaussianReal 0 \u27e8covQuadForm d L x a, quad_nonneg x a\u27e9\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : \u2200 x y : E d, \u222b \u03c9, F \u03c9 x * F \u03c9"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "hessian",
+ "line": 180,
+ "source_header": "y \u2202P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fr\u00e9chet\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": ": \u211d :=\n iteratedFDeriv \u211d 2 g x ![v, w]\n\n/-- Critical point: vanishing Fr\u00e9chet 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": "\u211d) (x : E d) : Prop :=\n fderiv \u211d 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": "(\u2200 w \u2208 W, w \u2260 0 \u2192 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 \u2227 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 \u2227 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": ": \u2115) (r : \u211d) (u : E d) : E d :=\n -((r / 2) \u2022 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 : \u2115) (r : \u211d) (u : E d) : E d :=\n (r / 2) \u2022 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 : \u2115) (g : E d \u2192 \u211d) (M S : E d) : \u211d :=\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 \u2227 IsIndexSaddle d g S \u2227 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 \u2192\n 0 < torusDist d L x y \u2192 g x \u2260 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 : \u2115) (L : \u211d) 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 \u2192 \u211d) \u2192 E d \u2192 \u211d\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 \u2192 \u211d) \u2192 E d \u2192 Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d \u2192 \u211d) \u2192 E d \u2192 E d \u2192 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192\n \u2200 M : E d, IsEssential g M \u2194 \u2200 y : E d, g y \u2264 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192\n \u2200 M : E d, \u00ac IsEssential g M \u2192 \u2200 h : \u211d,\n h < deathHeight g M \u2194\n \u2203 y : E d, g M < g y \u2227 \u2203 \u03b3 : Path M y, \u2200 t : unitInterval, h < g (\u03b3 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192 IsMorseDistinct d L g \u2192\n \u2200 M S : E d, ElderPartner g M S \u2194\n (IsNond"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "IsFiniteBar",
+ "line": 351,
+ "source_header": "gMax d g M \u2227 IsIndexSaddle d g S \u2227 \u00ac IsEssential g M \u2227 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`\u00ac 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 \u2227 0 < heightGap d g M S \u2227 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 : \u2115) (L : \u211d) (Pai"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pairCount",
+ "line": 374,
+ "source_header": "ndDomain d L \u2227 p.2 \u2208 FundDomain d L \u2227 Pair g p.1 p.2 \u2227 heightGap d g p.1 p.2 \u2208 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 \u2192 Prop)\n (g : E d \u2192 \u211d) (A : Set \u211d) : \u2115 :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `\u03bd` 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, `\u03bd` is integrable on every Borel `A \u2286 (0, \u221e)`, and\n`\u222b_A \u03bd = 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\u03a9` (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 : \u2115) (L : \u211d) (G : Gau"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "IsWindowPair",
+ "line": 407,
+ "source_header": "A \u2227\n \u222b \u2113 in A, \u03bd \u2113 = (\u222b \u03c9, ((pairCount d L Pair (G.F \u03c9) A : \u2115) : \u211d) \u2202G.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 <= \u03c1`, 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": ": \u211d) (g : E d \u2192 \u211d) (M S : E d) : Prop :=\n IsCandidatePair d L g M S \u2227 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 \u2264 p \u2264 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 : \u2115) (L : \u211d) (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 : \u211d \u2192 \u211d \u2192 \u211d \u2192 OrthonormalBasis (Fin d) \u211d (E d) \u2192 \u211d\n /-- `p` is a probability: nonnegative. -/\n p_nonneg : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (E d)), 0 \u2264 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 : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (E d)), p r b k R \u2264 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 \u2265 2`, `L > 0`,\ncompact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo \u2264 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 \u2264 r_*`, `b \u2208 B`, `k \u2208 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 `\u03bdc`, `\u03bde` with `\u03bdc(\u2113) ~ c_{B,K} \u2113^(-1/3)`,\n`\u03bde(\u2113) ~ c_{B,K} \u2113^(-1/3)` as `\u2113 \u2193 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and\n`0 \u2264 \u03bdc(\u2113) - \u03bde(\u2113) \u2264 C_{B,K} \u2113^(2/3)` for all sufficiently small `\u2113 > 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 `\u03bdc`, `\u03bde` 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 : \u211d, 0 < \u2113Star \u2227 \u2200 \u2113 : \u211d, 0 < \u2113 \u2192 \u2113 \u2264 \u2113Star \u2192\n 0 \u2264 \u03bdc \u2113 - \u03bde \u2113 \u2227 \u03bdc \u2113 - \u03bde \u2113 \u2264 C * \u2113 ^ ((2 : \u211d) / 3)\n\n/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and\nversions `\u03bdc`, `\u03bde` of the unrestricted candidate density and of the finite ordinary\nsuperlevel H0 bar density satisfy `\u03bdc(\u2113) ~ c \u2113^(-1/3)` and `\u03bde(\u2113) ~ c \u2113^(-1/3)` as `\u2113 \u2193 0`.\nThe essential global-maximum class is excluded from `\u03bde` 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": "\u2227\n Asymptotics.IsEquivalent (nhdsWithin (0 : \u211d) (Set.Ioi 0)) \u03bde\n (fun \u2113 : \u211d => c * \u2113 ^ ((-1 : \u211d) / 3))\n\n/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for\nfixed `d \u2265 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 `\u03bd(\u2113) ~ c_{d,L} \u2113^(-1/3)` as `\u2113 \u2193 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 \u2264 d \u2192 0 < L \u2192 \u2203 c : \u211d, 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 \u2265 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 < \u2113 \u2264 ell_*`,\n`|\u03bdc(\u2113) - c \u2113^(-1/3)| \u2264 C`, `0 \u2264 \u03bdc(\u2113) - \u03bde(\u2113) \u2264 C` and `|\u03bde(\u2113) - c \u2113^(-1/3)| \u2264 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 * \u2113 ^ ((-1 : \u211d) / 3)| \u2264 C \u2227\n 0 \u2264 \u03bdc \u2113 - \u03bde \u2113 \u2227 \u03bdc \u2113 - \u03bde \u2113 \u2264 C \u2227\n |\u03bde \u2113 - c * \u2113 ^ ((-1 : \u211d) / 3)| \u2264 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 \u2208 [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) \u2265 c r^3` for all\n`0 < r \u2264 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} \u2113^(2/3) \u2264 \u03bdc(\u2113) - \u03bde(\u2113) \u2264 C_{B,K} \u2113^(2/3)` for all `0 < \u2113 \u2264 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 : \u211d) (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 : \u2115) : SourceMode d \u2243 (Fin d \u2192 \u2124)"
+ },
+ {
+ "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 : \u2115) (L : \u211d) (z : Fin d \u2192 \u211d) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "tsum_mode",
+ "line": 15,
+ "source_header": ")\n\nprivate theorem tsum_mode (d : \u2115) (f : SourceMode d \u2192 \u211d) (hf : Summable f) :\n (\u2211' m, f m) = f none + \u2211' k : \u21a5(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 : \u2115) {L : \u211d} (hL : L \u2260 0) (x y : Fin d \u2192 \u211d) :\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 : \u2115) {L : \u211d} (hL : L \u2260 0) (z : Fin d \u2192 \u211d) :\n Summable (fun k : Fin d \u2192 \u2124 =>\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 : \u2115) {L : \u211d} (hL : L \u2260 0) (x y : Fin d \u2192 \u211d) :\n (\u2211' 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 : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) (L : \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torusProjection",
+ "line": 15,
+ "source_header": "L\n\ndef torusProjection (d : \u2115) (L : \u211d) (x : Fin d \u2192 \u211d) : SourceTorus d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torusRepresentative",
+ "line": 18,
+ "source_header": ")\n\ndef torusRepresentative (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (q : SourceTorus d L) : Fin d \u2192"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torusSourceField",
+ "line": 22,
+ "source_header": "1\n\ndef torusSourceField (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (\u03c9 : SourceMode d \u2192 \u211d) (q : SourceTorus d L) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusProjection_measurable",
+ "line": 26,
+ "source_header": ")\n\ntheorem torusProjection_measurable (d : \u2115) (L : \u211d) : Measurable (torusProjection d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusRepresentative_measurable",
+ "line": 29,
+ "source_header": ")\n\ntheorem torusRepresentative_measurable (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n Measurable (torusRepresentative d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusProjection_representative",
+ "line": 34,
+ "source_header": ")\n\ntheorem torusProjection_representative (d : \u2115) (L : \u211d) [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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SourceMode d \u2192 \u211d) (x y : Fin d \u2192 \u211d)\n (h : torusProjection d L x = torusProjection d L y) :\n sourceField d L \u03c9 x = sourceField d L \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_pullback",
+ "line": 57,
+ "source_header": "m\n\ntheorem torusSourceField_pullback (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (\u03c9 : SourceMode d \u2192 \u211d) (x : Fin d \u2192 \u211d) :\n torusSourceField d L \u03c9 (torusProjection d L x) = sourceField d L \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_eval_measurable",
+ "line": 64,
+ "source_header": ")\n\ntheorem torusSourceField_eval_measurable (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (q : SourceTorus d L) : Measurable (fun \u03c9 => torusSourceField d L \u03c9 q"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_joint_measurable",
+ "line": 68,
+ "source_header": ")\n\ntheorem torusSourceField_joint_measurable (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n Measurable (fun p : (SourceMode d \u2192 \u211d) \u00d7 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 : \u2115) (L : \u211d) [Fact (0 < L)]\n (n : \u2115) (q : Fin n \u2192 SourceTorus d L) :\n HasGaussianLaw (fun \u03c9 j => torusSourceField d L \u03c9 (q j)) (sourceLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_isGaussianProcess",
+ "line": 90,
+ "source_header": ")\n\ntheorem torusSourceField_isGaussianProcess (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n IsGaussianProcess (fun q \u03c9 => torusSourceField d L \u03c9 q) (sourceLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_covariance",
+ "line": 95,
+ "source_header": ")\n\ntheorem torusSourceField_covariance (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun \u03c9 => torusSourceField d L \u03c9 q, fun \u03c9 => torusSourceField d L \u03c9 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 : \u2115) (L : \u211d) [Fact (0 < L)]\n (x y : Fin d \u2192 \u211d) :\n cov[fun \u03c9 => torusSourceField d L \u03c9 (torusProjection d L x),\n fun \u03c9 => torusSourceField d L \u03c9 (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 : \u211d) (k : \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "coordinateBound",
+ "line": 16,
+ "source_header": ")\ndef coordinateBound (a c : \u211d) (k : \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "productDecay",
+ "line": 18,
+ "source_header": "4\ndef productDecay (d : \u2115) (a : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "productBound",
+ "line": 20,
+ "source_header": ")\ndef productBound (d : \u2115) (a c : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceA",
+ "line": 22,
+ "source_header": ")\ndef sourceA (L : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceC",
+ "line": 23,
+ "source_header": "2\ndef sourceC (L : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceWeight",
+ "line": 24,
+ "source_header": "L\ndef sourceWeight (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceZ",
+ "line": 26,
+ "source_header": "k\ndef sourceZ (d : \u2115) (L : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pairedBound",
+ "line": 27,
+ "source_header": "k\ndef pairedBound (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "summable_decay_pow",
+ "line": 29,
+ "source_header": "k\n\ntheorem summable_decay_pow {a : \u211d} (ha : 0 < a) (n : \u2115) :\n Summable (fun k : \u2124 => decay a k * |(k : \u211d)| ^ n"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinateBound_summable",
+ "line": 40,
+ "source_header": "b\n\ntheorem coordinateBound_summable {a c : \u211d} (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 : \u2124 \u2192 \u211d} (hf : Summable f) (hn : \u2200 k, 0 \u2264 f k)\n (d : \u2115) : Summable (fun k : Fin d \u2192 \u2124 => \u220f i, f (k i)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "productBound_summable",
+ "line": 72,
+ "source_header": "p\n\ntheorem productBound_summable {a c : \u211d} (ha : 0 < a) (d : \u2115) :\n Summable (productBound d a c"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "productDecay_eq_exp",
+ "line": 77,
+ "source_header": "d\n\ntheorem productDecay_eq_exp (d : \u2115) (a : \u211d) (k : Fin d \u2192 \u2124) :\n productDecay d a k = exp (-a * \u2211 i, (k i : \u211d) ^ 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "frequency_l1_le_product",
+ "line": 82,
+ "source_header": "]\n\ntheorem frequency_l1_le_product (d : \u2115) (v : Fin d \u2192 \u211d) (hv : \u2200 i, 0 \u2264 v i) :\n 1 + \u2211 i, v i \u2264 \u220f i, (1 + v i"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceA_pos",
+ "line": 98,
+ "source_header": "v\n\ntheorem sourceA_pos {L : \u211d} (hL : L \u2260 0) : 0 < sourceA"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceWeight_eq_physical",
+ "line": 102,
+ "source_header": "y\n\ntheorem sourceWeight_eq_physical (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :\n sourceWeight d L k = exp (-(\u2211 i, (sourceC L * (k i : \u211d)) ^ 2) / 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceWeight_summable",
+ "line": 117,
+ "source_header": "g\n\ntheorem sourceWeight_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n Summable (sourceWeight d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceZ_pos",
+ "line": 124,
+ "source_header": "d\n\ntheorem sourceZ_pos (d : \u2115) {L : \u211d} (hL : L \u2260 0) : 0 < sourceZ d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pairedBound_eq_amplitude",
+ "line": 129,
+ "source_header": "]\n\ntheorem pairedBound_eq_amplitude (d : \u2115) {L : \u211d} (hL : L \u2260 0) (k : Fin d \u2192 \u2124) :\n pairedBound d L k = Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n \u220f i, (1 + |sourceC L * (k i : \u211d)|) ^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pairedBound_summable",
+ "line": 151,
+ "source_header": "g\n\ntheorem pairedBound_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n Summable (pairedBound d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pairedBound_subtype_summable",
+ "line": 155,
+ "source_header": "_\n\ntheorem pairedBound_subtype_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (S : Set (Fin d \u2192 \u2124)) : 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 : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, \u2200 n : \u2115, ContDiff \u211d n (sourceField d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "represented_sample_order_five",
+ "line": 19,
+ "source_header": "hL\n\ntheorem represented_sample_order_five (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample d L) : ContDiff \u211d 5 (smoothSourceField d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "represented_sample_order_thirtyseven",
+ "line": 23,
+ "source_header": "\u03c9 5\n\ntheorem represented_sample_order_thirtyseven (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample d L) : ContDiff \u211d 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample d L) :\n ContDiff \u211d 5 (smoothSourceField d L \u03c9) \u2227\n ContDiff \u211d 37 (smoothSourceField d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "literal_field_everywhere",
+ "line": 34,
+ "source_header": "hL \u03c9\u27e9\n\ntheorem literal_field_everywhere (d : \u2115) (L : \u211d) (\u03c9 : SmoothSample d L)\n (x : Fin d \u2192 \u211d) :\n smoothSourceField d L \u03c9 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 : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d \u2192 \u211d) \u2192 E) (hX : Measurable X) :\n (smoothLaw d L).map (fun \u03c9 => X (sampleInclusion d L \u03c9)) = (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 : \u2115) (L : \u211d)\n (\u03c9 \u03b7 : SourceMode d \u2192 \u211d) (s : Finset (SourceMode d))\n (h\u03c9\u03b7 : \u2200 m \u2209 s, \u03c9 m = \u03b7 m) :\n goodSample d L \u03c9 \u2194 goodSampl"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "field_variance_one",
+ "line": 54,
+ "source_header": "\u03b7 s h\u03c9\u03b7\n\n/-- The restricted field keeps variance one, which excludes a zero-field substitution. -/\ntheorem field_variance_one (d : \u2115) {L : \u211d} (hL : L \u2260 0) (x : Fin d \u2192 \u211d) :\n cov[fun \u03c9 => smoothSourceField d L \u03c9 x,\n fun \u03c9 => smoothSourceField d L \u03c9 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 : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) : Set (Fin d \u2192"
+ },
+ {
+ "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 : \u2115) : Measure (SourceMode d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "phase",
+ "line": 24,
+ "source_header": "de d)\n\ndef phase (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d"
+ },
+ {
+ "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 : \u2115) (L : \u211d) (m : SourceMode d) (x : Fin d \u2192"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "modeMajorant",
+ "line": 34,
+ "source_header": "L k x)\n\ndef modeMajorant (d : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (\u03c9 : SourceMode d \u2192 \u211d) (x : Fin d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeMajorant_nonneg",
+ "line": 43,
+ "source_header": "L m x) \u03c9\n\ntheorem modeMajorant_nonneg (d : \u2115) (L : \u211d) (m : SourceMode d) :\n 0 \u2264 modeMajor"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeMajorant_summable",
+ "line": 52,
+ "source_header": "ositivity\n\ntheorem modeMajorant_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n Summable (modeMajo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeCoefficient_bound",
+ "line": 66,
+ "source_header": ".summable\n\ntheorem modeCoefficient_bound (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (m : SourceMode d) (x : Fin d \u2192 \u211d) :\n |modeCoefficient d L m x| \u2264 modeMajor"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_eval_measurable",
+ "line": 98,
+ "source_header": "rans hamp\n\ntheorem sourceField_eval_measurable (d : \u2115) (L : \u211d) (x : Fin d \u2192 \u211d) :\n Measurable (fun \u03c9 => sourceField"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceMajorant_ae",
+ "line": 102,
+ "source_header": "surable _\n\ntheorem sourceMajorant_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw 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 : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d,\n HasSumUniformly (fun m x => |modeCoefficient d L m x * \u03c9 m|)\n (fun x => \u2211' m, |modeCoefficient d L m"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_uniform_ae",
+ "line": 117,
+ "source_header": "nonneg _)\n\ntheorem sourceField_uniform_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d,\n HasSumUniformly (fun m x => modeCoefficient d L m x * \u03c9 m)\n (sourceFie"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_continuous_ae",
+ "line": 128,
+ "source_header": "nonneg _)\n\ntheorem sourceField_continuous_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw 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 : \u03b9 \u2192 \u211d) (ha : Summable a) (hb : Summable b) :\n cov[scalarSeries a, scalarSeries b; coefficientLaw \u03b9] = \u2211' i, a i * b i"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_integral_zero",
+ "line": 51,
+ "source_header": "theorem sourceField_integral_zero (d : \u2115) {L : \u211d} (hL : L \u2260 0) (x : Fin d \u2192 \u211d) :\n \u222b \u03c9, sourceField d L \u03c9 x \u2202sourceLaw d = 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_covariance",
+ "line": 58,
+ "source_header": "theorem sourceField_covariance (d : \u2115) {L : \u211d} (hL : L \u2260 0) (x y : Fin d \u2192 \u211d) :\n cov[fun \u03c9 => sourceField d L \u03c9 x, fun \u03c9 => sourceField d L \u03c9 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 : \u2115) {L : \u211d} (hL : L \u2260 0) (x : Fin d \u2192 \u211d) :\n Var[fun \u03c9 => sourceField d L \u03c9 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 : \u03b9 \u2192 \u211d) (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 : \u03b9 \u2192 \u211d) (s : Finset \u03b9) (t : \u211d) :\n charFun ((coefficientLaw \u03b9).map (fun \u03c9 => \u2211 i \u2208 s, a i * \u03c9 i)) t =\n Complex.exp (-((\u2211 i \u2208 s, a i ^ 2 : \u211d) : \u2102) * (t : \u2102) ^ 2 / 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "charFun_partial_tendsto",
+ "line": 55,
+ "source_header": "]\n\nprivate theorem charFun_partial_tendsto (a : \u03b9 \u2192 \u211d) (ha : Summable a) (t : \u211d) :\n Filter.Tendsto\n (fun s : Finset \u03b9 => charFun ((coefficientLaw \u03b9).map\n (fun \u03c9 => \u2211 i \u2208 s, a i * \u03c9 i)) t)\n Filter.atTop (\ud835\udcdd (charFun ((coefficientLaw \u03b9).map (scalarSeries a)) t)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_map_gaussian",
+ "line": 90,
+ "source_header": "\u03c9\n\ntheorem scalarSeries_map_gaussian (a : \u03b9 \u2192 \u211d) (ha : Summable a) :\n (coefficientLaw \u03b9).map (scalarSeries a) =\n gaussianReal 0 (\u2211' i, a i ^ 2).toNNRea"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_integral_zero",
+ "line": 109,
+ "source_header": "g\n\ntheorem scalarSeries_integral_zero (a : \u03b9 \u2192 \u211d) (ha : Summable a) :\n \u222b \u03c9, scalarSeries a \u03c9 \u2202coefficientLaw \u03b9 ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_variance",
+ "line": 116,
+ "source_header": "h\n\ntheorem scalarSeries_variance (a : \u03b9 \u2192 \u211d) (ha : Summable a) :\n Var[scalarSeries a; coefficientLaw \u03b9] = \u2211' i, a i ^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "source_linearCombination_hasGaussianLaw",
+ "line": 122,
+ "source_header": ")\n\ntheorem source_linearCombination_hasGaussianLaw (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (x : Fin n \u2192 (Fin d \u2192 \u211d)) (c : Fin n \u2192 \u211d) :\n HasGaussianLaw (fun \u03c9 => \u2211 j, c j * sourceField d L \u03c9 (x j)) (sourceLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "source_finiteVector_hasGaussianLaw",
+ "line": 147,
+ "source_header": ")\n\ntheorem source_finiteVector_hasGaussianLaw (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (x : Fin n \u2192 (Fin d \u2192 \u211d)) :\n HasGaussianLaw (fun \u03c9 j => sourceField d L \u03c9 (x j)) (sourceLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_isGaussianProcess",
+ "line": 174,
+ "source_header": "l\n\ntheorem sourceField_isGaussianProcess (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n IsGaussianProcess (fun x \u03c9 => sourceField d L \u03c9 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 (\u03b9 : Type*) : Measure (\u03b9 \u2192"
+ },
+ {
+ "kind": "instance",
+ "unqualified_name": "coefficientLaw_isProbabilityMeasure",
+ "line": 19,
+ "source_header": "1)\n\ninstance coefficientLaw_isProbabilityMeasure (\u03b9 : Type*) :\n IsProbabilityMeasure (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_measurePreserving",
+ "line": 24,
+ "source_header": "nce\n\ntheorem coordinate_measurePreserving {\u03b9 : Type*} (i : \u03b9) :\n MeasurePreserving (fun \u03c9 : \u03b9 \u2192 \u211d => \u03c9 i) (coefficientLaw \u03b9)\n (gaussianReal 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_marginal",
+ "line": 29,
+ "source_header": ") i\n\ntheorem coordinate_marginal {\u03b9 : Type*} (i : \u03b9) :\n (coefficientLaw \u03b9).map (fun \u03c9 => \u03c9 i) = gaussianReal"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinates_independent",
+ "line": 33,
+ "source_header": "_eq\n\ntheorem coordinates_independent (\u03b9 : Type*) :\n iIndepFun (fun i (\u03c9 : \u03b9 \u2192 \u211d) => \u03c9 i) (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_memLp",
+ "line": 38,
+ "source_header": "id)\n\ntheorem coordinate_memLp {\u03b9 : Type*} (i : \u03b9) (p : \u211d\u22650\u221e) (hp : p \u2260 \u221e) :\n MemLp (fun \u03c9 : \u03b9 \u2192 \u211d => \u03c9 i) p (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_integrable",
+ "line": 43,
+ "source_header": "i)\n\ntheorem coordinate_integrable {\u03b9 : Type*} (i : \u03b9) :\n Integrable (fun \u03c9 : \u03b9 \u2192 \u211d => \u03c9 i) (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_abs_integrable",
+ "line": 47,
+ "source_header": "p))\n\ntheorem coordinate_abs_integrable {\u03b9 : Type*} (i : \u03b9) :\n Integrable (fun \u03c9 : \u03b9 \u2192 \u211d => |\u03c9 i|) (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weighted_abs_summable_ae",
+ "line": 51,
+ "source_header": "orm\n\ntheorem weighted_abs_summable_ae {\u03b9 : Type*} [Countable \u03b9]\n (a : \u03b9 \u2192 \u211d) (ha : \u2200 i, 0 \u2264 a i) (hs : Summable a) :\n \u2200\u1d50 \u03c9 \u2202coefficientLaw \u03b9, Summable (fun i => a i * |\u03c9"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "scalarSeries",
+ "line": 75,
+ "source_header": "h\u03c9\n\n/-- The actual scalar sum; its convergence is proved separately on the product law. -/\ndef scalarSeries {\u03b9 : Type*} (a : \u03b9 \u2192 \u211d) (\u03c9 : \u03b9 \u2192 \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_measurable",
+ "line": 79,
+ "source_header": "* \u03c9 i\n\ntheorem scalarSeries_measurable {\u03b9 : Type*} [Countable \u03b9] (a : \u03b9 \u2192 \u211d) :\n Measurable (scalarSeri"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_hasSum_ae",
+ "line": 86,
+ "source_header": "ly i)\n\ntheorem scalarSeries_hasSum_ae {\u03b9 : Type*} [Countable \u03b9]\n (a : \u03b9 \u2192 \u211d) (hs : Summable a) :\n \u2200\u1d50 \u03c9 \u2202coefficientLaw \u03b9, HasSum (fun i => a i * \u03c9 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 : \u2115) (L : \u211d) [Fact (0 < L)] (a : Fin d \u2192 \u211d) :\n OpenPartialHomeomorph (SourceTorus d L) (Fin d \u2192 \u211d)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "chartCenter",
+ "line": 16,
+ "source_header": "def chartCenter (d : \u2115) (L : \u211d) [Fact (0 < L)] (q : SourceTorus d L) : Fin d \u2192 \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "quotientChart_symm",
+ "line": 19,
+ "source_header": "theorem quotientChart_symm (d : \u2115) (L : \u211d) [Fact (0 < L)] (a : Fin d \u2192 \u211d) :\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 : \u2115) (L : \u211d) [Fact (0 < L)] (q : SourceTorus d L) :\n q \u2208 (quotientChart d L (chartCenter d L q)).source"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "chart_transition_contDiff",
+ "line": 51,
+ "source_header": "theorem chart_transition_contDiff (d : \u2115) (L : \u211d) [Fact (0 < L)] (a b : Fin d \u2192 \u211d) :\n ContDiffOn \u211d \u221e ((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 : \u2115) (L : \u211d) [Fact (0 < L)] :\n IsManifold \ud835\udcd8(\u211d, Fin d \u2192 \u211d) \u221e (SourceTorus d L)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_contMDiff_ae",
+ "line": 110,
+ "source_header": "theorem torusSourceField_contMDiff_ae (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n \u2200\u1d50 sample \u2202sourceLaw d,\n ContMDiff \ud835\udcd8(\u211d, Fin d \u2192 \u211d) \ud835\udcd8(\u211d) 4 (torusSourceField d L sample)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_weakSuperlevel_closed_ae",
+ "line": 126,
+ "source_header": "theorem torusSourceField_weakSuperlevel_closed_ae (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n \u2200\u1d50 sample \u2202sourceLaw d, \u2200 h : \u211d,\n IsClosed {q : SourceTorus d L | h \u2264 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 : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) : (Fin d \u2192 \u211d) \u2192L[\u211d]"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "phaseCLM_apply",
+ "line": 16,
+ "source_header": "i\n\ntheorem phaseCLM_apply (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d) :\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 : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :\n \u2016phaseCLM d L k\u2016 \u2264 \u2211 i, |sourceC L * (k i : \u211d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeCoefficient_iteratedFDeriv_bound",
+ "line": 35,
+ "source_header": "]\n\ntheorem modeCoefficient_iteratedFDeriv_bound (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (m : SourceMode d) (j : \u2115) (hj : j \u2264 4) (x : Fin d \u2192 \u211d) :\n \u2016iteratedFDeriv \u211d j (modeCoefficient d L m) x\u2016 \u2264 modeMajorant d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_contDiff_ae",
+ "line": 102,
+ "source_header": "]\n\ntheorem sourceField_contDiff_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, ContDiff \u211d 4 (sourceField d L \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_contDiff_affine_ae",
+ "line": 133,
+ "source_header": ")\n\ntheorem sourceField_contDiff_affine_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, \u2200 (T : (Fin d \u2192 \u211d) \u2192L[\u211d] (Fin d \u2192 \u211d)) (a : Fin d \u2192 \u211d),\n ContDiff \u211d 4 (fun x => sourceField d L \u03c9 (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 : \u2115) (m : SourceMode d) : Fin d \u2192 \u2124"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "halfLattice_ne_zero",
+ "line": 13,
+ "source_header": "theorem halfLattice_ne_zero (d : \u2115) {k : Fin d \u2192 \u2124} (hk : k \u2208 halfLattice d) :\n k \u2260 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "halfLattice_partition",
+ "line": 20,
+ "source_header": "theorem halfLattice_partition (d : \u2115) {k : Fin d \u2192 \u2124} (hk : k \u2260 0) :\n (k \u2208 halfLattice d \u2228 -k \u2208 halfLattice d) \u2227\n \u00ac (k \u2208 halfLattice d \u2227 -k \u2208 halfLattice d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceWeight_neg",
+ "line": 59,
+ "source_header": "theorem sourceWeight_neg (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :\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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k n : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d) :\n phase d L k (fun i => x i + L * (n i : \u211d)) =\n phase d L k x + ((\u2211 i, k i * n i : \u2124) : \u211d) * (2 * Real.pi)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeCoefficient_lattice_shift",
+ "line": 78,
+ "source_header": "theorem modeCoefficient_lattice_shift (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (m : SourceMode d) (n : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d) :\n modeCoefficient d L m (fun i => x i + L * (n i : \u211d)) =\n modeCoefficient d L m x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_lattice_shift",
+ "line": 90,
+ "source_header": "theorem sourceField_lattice_shift (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SourceMode d \u2192 \u211d) (n : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d) :\n sourceField d L \u03c9 (fun i => x i + L * (n i : \u211d)) = sourceField d L \u03c9 x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pairedCoefficient_kernel",
+ "line": 100,
+ "source_header": "theorem pairedCoefficient_kernel (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k : \u21a5(halfLattice d)) (x y : Fin d \u2192 \u211d) :\n (\u2211 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 : \u2115) : 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."
+ ]
+ },
+ {
+ "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 : \u2115) (a c : \u211d) (k : \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderProductBound",
+ "line": 27,
+ "source_header": "n\n\ndef orderProductBound (n d : \u2115) (a c : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderPairedBound",
+ "line": 30,
+ "source_header": ")\n\ndef orderPairedBound (n d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderModeBound",
+ "line": 33,
+ "source_header": "k\n\ndef orderModeBound (n d : \u2115) (L : \u211d) (m : SourceMode d) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderCoordinateBound_summable",
+ "line": 38,
+ "source_header": "k\n\ntheorem orderCoordinateBound_summable (n : \u2115) {a c : \u211d} (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 : \u2115) {a c : \u211d} (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 : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k : Fin d \u2192 \u2124) :\n orderPairedBound n d L k =\n Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n \u220f i, (1 + |sourceC L * (k i : \u211d)|) ^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderModeBound_nonneg",
+ "line": 92,
+ "source_header": "g\n\ntheorem orderModeBound_nonneg (n d : \u2115) (L : \u211d) (m : SourceMode d) :\n 0 \u2264 orderModeBound n d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderModeBound_summable",
+ "line": 100,
+ "source_header": "y\n\ntheorem orderModeBound_summable (n d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n Summable (orderModeBound n d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderModeBound_four",
+ "line": 115,
+ "source_header": "e\n\ntheorem orderModeBound_four (d : \u2115) (L : \u211d) (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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (m : SourceMode d) (j : \u2115) (x : Fin d \u2192 \u211d) :\n \u2016iteratedFDeriv \u211d j (modeCoefficient d L m) x\u2016 \u2264 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 : \u2115) (L : \u211d) (\u03c9 : SourceMode d \u2192 \u211d) : P"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSample_ae",
+ "line": 183,
+ "source_header": "m|)\n\ntheorem goodSample_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, goodSample d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_smooth_of_goodSample",
+ "line": 190,
+ "source_header": "hL)\n\ntheorem sourceField_smooth_of_goodSample (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SourceMode d \u2192 \u211d) (h\u03c9 : goodSample d L \u03c9) :\n \u2200 n : \u2115, ContDiff \u211d n (sourceField d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_smooth_ae",
+ "line": 222,
+ "source_header": "m))\n\ntheorem sourceField_smooth_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, \u2200 n : \u2115, ContDiff \u211d n (sourceField d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSample_congr_cofinite",
+ "line": 227,
+ "source_header": "h\u03c9\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 : \u2115) (L : \u211d)\n (\u03c9 \u03b7 : SourceMode d \u2192 \u211d) (h\u03c9\u03b7 : \u03c9 =\u1da0[Filter.cofinite] \u03b7) :\n goodSample d L \u03c9 \u2194 goodSample"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSample_finite_change_iff",
+ "line": 242,
+ "source_header": "[hm]\n\ntheorem goodSample_finite_change_iff (d : \u2115) (L : \u211d)\n (\u03c9 \u03b7 : SourceMode d \u2192 \u211d) (s : Finset (SourceMode d))\n (h\u03c9\u03b7 : \u2200 m \u2209 s, \u03c9 m = \u03b7 m) :\n goodSample d L \u03c9 \u2194 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 : \u2115) (L : \u211d) : Set (SourceMode d \u2192"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderAbsNN",
+ "line": 34,
+ "source_header": "\u03c9}\n\nprivate def orderAbsNN (n d : \u2115) (L : \u211d) (\u03c9 : SourceMode d \u2192 \u211d)\n (m : SourceMode d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "orderAbsTotal",
+ "line": 39,
+ "source_header": "_)\u27e9\n\nprivate def orderAbsTotal (n d : \u2115) (L : \u211d) (\u03c9 : SourceMode d \u2192 \u211d) : \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderAbsTotal_ne_top_iff",
+ "line": 42,
+ "source_header": "0\u221e)\n\nprivate theorem orderAbsTotal_ne_top_iff (n d : \u2115) (L : \u211d)\n (\u03c9 : SourceMode d \u2192 \u211d) :\n orderAbsTotal n d L \u03c9 \u2260 \u221e \u2194\n Summable (fun m => orderModeBound n d L m * |\u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "orderAbsTotal_measurable",
+ "line": 48,
+ "source_header": "\u03c9)\n\nprivate theorem orderAbsTotal_measurable (n d : \u2115) (L : \u211d) :\n Measurable (orderAbsTotal n d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSet_measurable",
+ "line": 62,
+ "source_header": "eal\n\ntheorem goodSet_measurable (d : \u2115) (L : \u211d) : MeasurableSet (goodSet d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSet_ae",
+ "line": 75,
+ "source_header": "imp\n\ntheorem goodSet_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, \u03c9 \u2208 goodSet"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "goodSet_measure_one",
+ "line": 79,
+ "source_header": "hL\n\ntheorem goodSet_measure_one (d : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) (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 : \u2115) (L : \u211d) : SmoothSample d L \u2192 (SourceMode"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sampleInclusion_measurable",
+ "line": 90,
+ "source_header": "ype.val\n\ntheorem sampleInclusion_measurable (d : \u2115) (L : \u211d) :\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 : \u2115) (L : \u211d) : Measure (SmoothSa"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sampleInclusion_map",
+ "line": 98,
+ "source_header": "sion d L)\n\ntheorem sampleInclusion_map (d : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) {L : \u211d} (hL : L \u2260 0) :\n MeasurePreserving (sampleInclusion d L) (smoothLaw d L) (sou"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothLaw_isProbabilityMeasure",
+ "line": 109,
+ "source_header": "map d hL\u27e9\n\ntheorem smoothLaw_isProbabilityMeasure (d : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d \u2192 \u211d) \u2192 E) (hX : Measurable X) :\n (smoothLaw d L).map (fun \u03c9 => X (sampleInclusion d L \u03c9)) = (sourceL"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_marginal",
+ "line": 121,
+ "source_header": "n_map d hL]\n\ntheorem coordinate_marginal (d : \u2115) {L : \u211d} (hL : L \u2260 0) (m : SourceMode d) :\n (smoothLaw d L).map (fun \u03c9 => sampleInclusion d L \u03c9 m) = gauss"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "finiteCoordinate_map_eq",
+ "line": 126,
+ "source_header": "_marginal m\n\ntheorem finiteCoordinate_map_eq (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (m : Fin n \u2192 SourceMode d) :\n (smoothLaw d L).map (fun \u03c9 j => sampleInclusion d L \u03c9 (m j)) =\n (sourceLaw d).map (fun \u03c9 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 : \u2115) (L : \u211d) (\u03c9 : SmoothSample d L) (x : F"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothSourceField_contDiff",
+ "line": 136,
+ "source_header": "sion d L \u03c9) x\n\ntheorem smoothSourceField_contDiff (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample d L) (n : \u2115) : ContDiff \u211d n (smoothSourc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothSourceField_smooth",
+ "line": 140,
+ "source_header": "\u03c9.property n\n\ntheorem smoothSourceField_smooth (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample d L) : ContDiff \u211d (\u22a4 : \u2115\u221e) (smoothSourc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothSourceField_finiteVector_map_eq",
+ "line": 144,
+ "source_header": "tDiff d hL \u03c9)\n\ntheorem smoothSourceField_finiteVector_map_eq (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (x : Fin n \u2192 (Fin d \u2192 \u211d)) :\n (smoothLaw d L).map (fun \u03c9 j => smoothSourceField d L \u03c9 (x j)) =\n (sourceLaw d).map (fun \u03c9 j => sourceField"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothSourceField_finiteVector_hasGaussianLaw",
+ "line": 151,
+ "source_header": "e d L (x j)))\n\ntheorem smoothSourceField_finiteVector_hasGaussianLaw (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (x : Fin n \u2192 (Fin d \u2192 \u211d)) :\n HasGaussianLaw (fun \u03c9 j => smoothSourceField d L \u03c9 (x j)) (s"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "covariance_comp_inclusion",
+ "line": 161,
+ "source_header": "sGaussian_map\n\ntheorem covariance_comp_inclusion (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (X Y : (SourceMode d \u2192 \u211d) \u2192 \u211d) (hX : Measurable X) (hY : Measurable Y) :\n cov[fun \u03c9 => X (sampleInclusion d L \u03c9), fun \u03c9 => Y (sampleInclusion d L \u03c9); 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (x y : Fin d \u2192 \u211d) :\n cov[fun \u03c9 => smoothSourceField d L \u03c9 x, fun \u03c9 => smoothSourceField d L \u03c9 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 : \u2115) (L : \u211d) [Fact (0 < L)]\n (\u03c9 : SmoothSample d L) (q : Sourc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothTorusSourceField_smooth",
+ "line": 188,
+ "source_header": "ualChartedSpace\n\ntheorem smoothTorusSourceField_smooth (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (\u03c9 : SmoothSample d L) :\n ContMDiff \ud835\udcd8(\u211d, Fin d \u2192 \u211d) \ud835\udcd8(\u211d) (\u22a4 : \u2115\u221e) (smoothTorusSou"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothTorusSourceField_finiteVector_hasGaussianLaw",
+ "line": 205,
+ "source_header": "ontDiffWithinAt\n\ntheorem smoothTorusSourceField_finiteVector_hasGaussianLaw (d : \u2115) (L : \u211d)\n [Fact (0 < L)] (n : \u2115) (q : Fin n \u2192 SourceTorus d L) :\n HasGaussianLaw (fun \u03c9 j => smoothTorusSourceField d L \u03c9 (q j))"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "smoothTorusSourceField_covariance",
+ "line": 218,
+ "source_header": ".isGaussian_map\n\ntheorem smoothTorusSourceField_covariance (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun \u03c9 => smoothTorusSourceField d L \u03c9 q, fun \u03c9 => smoothTorusSourceField d L \u03c9 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 : \u2115) : SourceMode d \u2243 (Fin d \u2192 \u2124)"
+ },
+ {
+ "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 : \u2115) (L : \u211d) (z : Fin d \u2192 \u211d) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "tsum_mode",
+ "line": 15,
+ "source_header": ")\n\nprivate theorem tsum_mode (d : \u2115) (f : SourceMode d \u2192 \u211d) (hf : Summable f) :\n (\u2211' m, f m) = f none + \u2211' k : \u21a5(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 : \u2115) {L : \u211d} (hL : L \u2260 0) (x y : Fin d \u2192 \u211d) :\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 : \u2115) {L : \u211d} (hL : L \u2260 0) (z : Fin d \u2192 \u211d) :\n Summable (fun k : Fin d \u2192 \u2124 =>\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 : \u2115) {L : \u211d} (hL : L \u2260 0) (x y : Fin d \u2192 \u211d) :\n (\u2211' 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 : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) (L : \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torusProjection",
+ "line": 15,
+ "source_header": "L\n\ndef torusProjection (d : \u2115) (L : \u211d) (x : Fin d \u2192 \u211d) : SourceTorus d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torusRepresentative",
+ "line": 18,
+ "source_header": ")\n\ndef torusRepresentative (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (q : SourceTorus d L) : Fin d \u2192"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torusSourceField",
+ "line": 22,
+ "source_header": "1\n\ndef torusSourceField (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (\u03c9 : SourceMode d \u2192 \u211d) (q : SourceTorus d L) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusProjection_measurable",
+ "line": 26,
+ "source_header": ")\n\ntheorem torusProjection_measurable (d : \u2115) (L : \u211d) : Measurable (torusProjection d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusRepresentative_measurable",
+ "line": 29,
+ "source_header": ")\n\ntheorem torusRepresentative_measurable (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n Measurable (torusRepresentative d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusProjection_representative",
+ "line": 34,
+ "source_header": ")\n\ntheorem torusProjection_representative (d : \u2115) (L : \u211d) [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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SourceMode d \u2192 \u211d) (x y : Fin d \u2192 \u211d)\n (h : torusProjection d L x = torusProjection d L y) :\n sourceField d L \u03c9 x = sourceField d L \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_pullback",
+ "line": 57,
+ "source_header": "m\n\ntheorem torusSourceField_pullback (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (\u03c9 : SourceMode d \u2192 \u211d) (x : Fin d \u2192 \u211d) :\n torusSourceField d L \u03c9 (torusProjection d L x) = sourceField d L \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_eval_measurable",
+ "line": 64,
+ "source_header": ")\n\ntheorem torusSourceField_eval_measurable (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (q : SourceTorus d L) : Measurable (fun \u03c9 => torusSourceField d L \u03c9 q"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_joint_measurable",
+ "line": 68,
+ "source_header": ")\n\ntheorem torusSourceField_joint_measurable (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n Measurable (fun p : (SourceMode d \u2192 \u211d) \u00d7 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 : \u2115) (L : \u211d) [Fact (0 < L)]\n (n : \u2115) (q : Fin n \u2192 SourceTorus d L) :\n HasGaussianLaw (fun \u03c9 j => torusSourceField d L \u03c9 (q j)) (sourceLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_isGaussianProcess",
+ "line": 90,
+ "source_header": ")\n\ntheorem torusSourceField_isGaussianProcess (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n IsGaussianProcess (fun q \u03c9 => torusSourceField d L \u03c9 q) (sourceLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_covariance",
+ "line": 95,
+ "source_header": ")\n\ntheorem torusSourceField_covariance (d : \u2115) (L : \u211d) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun \u03c9 => torusSourceField d L \u03c9 q, fun \u03c9 => torusSourceField d L \u03c9 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 : \u2115) (L : \u211d) [Fact (0 < L)]\n (x y : Fin d \u2192 \u211d) :\n cov[fun \u03c9 => torusSourceField d L \u03c9 (torusProjection d L x),\n fun \u03c9 => torusSourceField d L \u03c9 (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 : \u211d) (k : \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "coordinateBound",
+ "line": 16,
+ "source_header": ")\ndef coordinateBound (a c : \u211d) (k : \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "productDecay",
+ "line": 18,
+ "source_header": "4\ndef productDecay (d : \u2115) (a : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "productBound",
+ "line": 20,
+ "source_header": ")\ndef productBound (d : \u2115) (a c : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceA",
+ "line": 22,
+ "source_header": ")\ndef sourceA (L : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceC",
+ "line": 23,
+ "source_header": "2\ndef sourceC (L : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceWeight",
+ "line": 24,
+ "source_header": "L\ndef sourceWeight (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "sourceZ",
+ "line": 26,
+ "source_header": "k\ndef sourceZ (d : \u2115) (L : \u211d) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pairedBound",
+ "line": 27,
+ "source_header": "k\ndef pairedBound (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "summable_decay_pow",
+ "line": 29,
+ "source_header": "k\n\ntheorem summable_decay_pow {a : \u211d} (ha : 0 < a) (n : \u2115) :\n Summable (fun k : \u2124 => decay a k * |(k : \u211d)| ^ n"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinateBound_summable",
+ "line": 40,
+ "source_header": "b\n\ntheorem coordinateBound_summable {a c : \u211d} (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 : \u2124 \u2192 \u211d} (hf : Summable f) (hn : \u2200 k, 0 \u2264 f k)\n (d : \u2115) : Summable (fun k : Fin d \u2192 \u2124 => \u220f i, f (k i)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "productBound_summable",
+ "line": 72,
+ "source_header": "p\n\ntheorem productBound_summable {a c : \u211d} (ha : 0 < a) (d : \u2115) :\n Summable (productBound d a c"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "productDecay_eq_exp",
+ "line": 77,
+ "source_header": "d\n\ntheorem productDecay_eq_exp (d : \u2115) (a : \u211d) (k : Fin d \u2192 \u2124) :\n productDecay d a k = exp (-a * \u2211 i, (k i : \u211d) ^ 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "frequency_l1_le_product",
+ "line": 82,
+ "source_header": "]\n\ntheorem frequency_l1_le_product (d : \u2115) (v : Fin d \u2192 \u211d) (hv : \u2200 i, 0 \u2264 v i) :\n 1 + \u2211 i, v i \u2264 \u220f i, (1 + v i"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceA_pos",
+ "line": 98,
+ "source_header": "v\n\ntheorem sourceA_pos {L : \u211d} (hL : L \u2260 0) : 0 < sourceA"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceWeight_eq_physical",
+ "line": 102,
+ "source_header": "y\n\ntheorem sourceWeight_eq_physical (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :\n sourceWeight d L k = exp (-(\u2211 i, (sourceC L * (k i : \u211d)) ^ 2) / 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceWeight_summable",
+ "line": 117,
+ "source_header": "g\n\ntheorem sourceWeight_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n Summable (sourceWeight d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceZ_pos",
+ "line": 124,
+ "source_header": "d\n\ntheorem sourceZ_pos (d : \u2115) {L : \u211d} (hL : L \u2260 0) : 0 < sourceZ d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pairedBound_eq_amplitude",
+ "line": 129,
+ "source_header": "]\n\ntheorem pairedBound_eq_amplitude (d : \u2115) {L : \u211d} (hL : L \u2260 0) (k : Fin d \u2192 \u2124) :\n pairedBound d L k = Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n \u220f i, (1 + |sourceC L * (k i : \u211d)|) ^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pairedBound_summable",
+ "line": 151,
+ "source_header": "g\n\ntheorem pairedBound_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n Summable (pairedBound d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pairedBound_subtype_summable",
+ "line": 155,
+ "source_header": "_\n\ntheorem pairedBound_subtype_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (S : Set (Fin d \u2192 \u2124)) : 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 : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, \u2200 n : \u2115, ContDiff \u211d n (sourceField d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "represented_sample_order_five",
+ "line": 19,
+ "source_header": "hL\n\ntheorem represented_sample_order_five (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample d L) : ContDiff \u211d 5 (smoothSourceField d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "represented_sample_order_thirtyseven",
+ "line": 23,
+ "source_header": "\u03c9 5\n\ntheorem represented_sample_order_thirtyseven (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample d L) : ContDiff \u211d 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SmoothSample d L) :\n ContDiff \u211d 5 (smoothSourceField d L \u03c9) \u2227\n ContDiff \u211d 37 (smoothSourceField d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "literal_field_everywhere",
+ "line": 34,
+ "source_header": "hL \u03c9\u27e9\n\ntheorem literal_field_everywhere (d : \u2115) (L : \u211d) (\u03c9 : SmoothSample d L)\n (x : Fin d \u2192 \u211d) :\n smoothSourceField d L \u03c9 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 : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d \u2192 \u211d) \u2192 E) (hX : Measurable X) :\n (smoothLaw d L).map (fun \u03c9 => X (sampleInclusion d L \u03c9)) = (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 : \u2115) (L : \u211d)\n (\u03c9 \u03b7 : SourceMode d \u2192 \u211d) (s : Finset (SourceMode d))\n (h\u03c9\u03b7 : \u2200 m \u2209 s, \u03c9 m = \u03b7 m) :\n goodSample d L \u03c9 \u2194 goodSampl"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "field_variance_one",
+ "line": 54,
+ "source_header": "\u03b7 s h\u03c9\u03b7\n\n/-- The restricted field keeps variance one, which excludes a zero-field substitution. -/\ntheorem field_variance_one (d : \u2115) {L : \u211d} (hL : L \u2260 0) (x : Fin d \u2192 \u211d) :\n cov[fun \u03c9 => smoothSourceField d L \u03c9 x,\n fun \u03c9 => smoothSourceField d L \u03c9 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 : \u2115) {L : \u211d} (hL : L \u2260 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 : \u2115) : Set (Fin d \u2192"
+ },
+ {
+ "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 : \u2115) : Measure (SourceMode d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "phase",
+ "line": 24,
+ "source_header": "de d)\n\ndef phase (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d"
+ },
+ {
+ "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 : \u2115) (L : \u211d) (m : SourceMode d) (x : Fin d \u2192"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "modeMajorant",
+ "line": 34,
+ "source_header": "L k x)\n\ndef modeMajorant (d : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (\u03c9 : SourceMode d \u2192 \u211d) (x : Fin d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeMajorant_nonneg",
+ "line": 43,
+ "source_header": "L m x) \u03c9\n\ntheorem modeMajorant_nonneg (d : \u2115) (L : \u211d) (m : SourceMode d) :\n 0 \u2264 modeMajor"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeMajorant_summable",
+ "line": 52,
+ "source_header": "ositivity\n\ntheorem modeMajorant_summable (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n Summable (modeMajo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeCoefficient_bound",
+ "line": 66,
+ "source_header": ".summable\n\ntheorem modeCoefficient_bound (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (m : SourceMode d) (x : Fin d \u2192 \u211d) :\n |modeCoefficient d L m x| \u2264 modeMajor"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_eval_measurable",
+ "line": 98,
+ "source_header": "rans hamp\n\ntheorem sourceField_eval_measurable (d : \u2115) (L : \u211d) (x : Fin d \u2192 \u211d) :\n Measurable (fun \u03c9 => sourceField"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceMajorant_ae",
+ "line": 102,
+ "source_header": "surable _\n\ntheorem sourceMajorant_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw 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 : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d,\n HasSumUniformly (fun m x => |modeCoefficient d L m x * \u03c9 m|)\n (fun x => \u2211' m, |modeCoefficient d L m"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_uniform_ae",
+ "line": 117,
+ "source_header": "nonneg _)\n\ntheorem sourceField_uniform_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d,\n HasSumUniformly (fun m x => modeCoefficient d L m x * \u03c9 m)\n (sourceFie"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_continuous_ae",
+ "line": 128,
+ "source_header": "nonneg _)\n\ntheorem sourceField_continuous_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw 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 : \u03b9 \u2192 \u211d) (ha : Summable a) (hb : Summable b) :\n cov[scalarSeries a, scalarSeries b; coefficientLaw \u03b9] = \u2211' i, a i * b i"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_integral_zero",
+ "line": 51,
+ "source_header": "theorem sourceField_integral_zero (d : \u2115) {L : \u211d} (hL : L \u2260 0) (x : Fin d \u2192 \u211d) :\n \u222b \u03c9, sourceField d L \u03c9 x \u2202sourceLaw d = 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_covariance",
+ "line": 58,
+ "source_header": "theorem sourceField_covariance (d : \u2115) {L : \u211d} (hL : L \u2260 0) (x y : Fin d \u2192 \u211d) :\n cov[fun \u03c9 => sourceField d L \u03c9 x, fun \u03c9 => sourceField d L \u03c9 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 : \u2115) {L : \u211d} (hL : L \u2260 0) (x : Fin d \u2192 \u211d) :\n Var[fun \u03c9 => sourceField d L \u03c9 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 : \u03b9 \u2192 \u211d) (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 : \u03b9 \u2192 \u211d) (s : Finset \u03b9) (t : \u211d) :\n charFun ((coefficientLaw \u03b9).map (fun \u03c9 => \u2211 i \u2208 s, a i * \u03c9 i)) t =\n Complex.exp (-((\u2211 i \u2208 s, a i ^ 2 : \u211d) : \u2102) * (t : \u2102) ^ 2 / 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "charFun_partial_tendsto",
+ "line": 55,
+ "source_header": "]\n\nprivate theorem charFun_partial_tendsto (a : \u03b9 \u2192 \u211d) (ha : Summable a) (t : \u211d) :\n Filter.Tendsto\n (fun s : Finset \u03b9 => charFun ((coefficientLaw \u03b9).map\n (fun \u03c9 => \u2211 i \u2208 s, a i * \u03c9 i)) t)\n Filter.atTop (\ud835\udcdd (charFun ((coefficientLaw \u03b9).map (scalarSeries a)) t)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_map_gaussian",
+ "line": 90,
+ "source_header": "\u03c9\n\ntheorem scalarSeries_map_gaussian (a : \u03b9 \u2192 \u211d) (ha : Summable a) :\n (coefficientLaw \u03b9).map (scalarSeries a) =\n gaussianReal 0 (\u2211' i, a i ^ 2).toNNRea"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_integral_zero",
+ "line": 109,
+ "source_header": "g\n\ntheorem scalarSeries_integral_zero (a : \u03b9 \u2192 \u211d) (ha : Summable a) :\n \u222b \u03c9, scalarSeries a \u03c9 \u2202coefficientLaw \u03b9 ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_variance",
+ "line": 116,
+ "source_header": "h\n\ntheorem scalarSeries_variance (a : \u03b9 \u2192 \u211d) (ha : Summable a) :\n Var[scalarSeries a; coefficientLaw \u03b9] = \u2211' i, a i ^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "source_linearCombination_hasGaussianLaw",
+ "line": 122,
+ "source_header": ")\n\ntheorem source_linearCombination_hasGaussianLaw (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (x : Fin n \u2192 (Fin d \u2192 \u211d)) (c : Fin n \u2192 \u211d) :\n HasGaussianLaw (fun \u03c9 => \u2211 j, c j * sourceField d L \u03c9 (x j)) (sourceLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "source_finiteVector_hasGaussianLaw",
+ "line": 147,
+ "source_header": ")\n\ntheorem source_finiteVector_hasGaussianLaw (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (n : \u2115) (x : Fin n \u2192 (Fin d \u2192 \u211d)) :\n HasGaussianLaw (fun \u03c9 j => sourceField d L \u03c9 (x j)) (sourceLaw d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_isGaussianProcess",
+ "line": 174,
+ "source_header": "l\n\ntheorem sourceField_isGaussianProcess (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n IsGaussianProcess (fun x \u03c9 => sourceField d L \u03c9 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 (\u03b9 : Type*) : Measure (\u03b9 \u2192"
+ },
+ {
+ "kind": "instance",
+ "unqualified_name": "coefficientLaw_isProbabilityMeasure",
+ "line": 19,
+ "source_header": "1)\n\ninstance coefficientLaw_isProbabilityMeasure (\u03b9 : Type*) :\n IsProbabilityMeasure (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_measurePreserving",
+ "line": 24,
+ "source_header": "nce\n\ntheorem coordinate_measurePreserving {\u03b9 : Type*} (i : \u03b9) :\n MeasurePreserving (fun \u03c9 : \u03b9 \u2192 \u211d => \u03c9 i) (coefficientLaw \u03b9)\n (gaussianReal 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_marginal",
+ "line": 29,
+ "source_header": ") i\n\ntheorem coordinate_marginal {\u03b9 : Type*} (i : \u03b9) :\n (coefficientLaw \u03b9).map (fun \u03c9 => \u03c9 i) = gaussianReal"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinates_independent",
+ "line": 33,
+ "source_header": "_eq\n\ntheorem coordinates_independent (\u03b9 : Type*) :\n iIndepFun (fun i (\u03c9 : \u03b9 \u2192 \u211d) => \u03c9 i) (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_memLp",
+ "line": 38,
+ "source_header": "id)\n\ntheorem coordinate_memLp {\u03b9 : Type*} (i : \u03b9) (p : \u211d\u22650\u221e) (hp : p \u2260 \u221e) :\n MemLp (fun \u03c9 : \u03b9 \u2192 \u211d => \u03c9 i) p (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_integrable",
+ "line": 43,
+ "source_header": "i)\n\ntheorem coordinate_integrable {\u03b9 : Type*} (i : \u03b9) :\n Integrable (fun \u03c9 : \u03b9 \u2192 \u211d => \u03c9 i) (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coordinate_abs_integrable",
+ "line": 47,
+ "source_header": "p))\n\ntheorem coordinate_abs_integrable {\u03b9 : Type*} (i : \u03b9) :\n Integrable (fun \u03c9 : \u03b9 \u2192 \u211d => |\u03c9 i|) (coefficientLaw"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "weighted_abs_summable_ae",
+ "line": 51,
+ "source_header": "orm\n\ntheorem weighted_abs_summable_ae {\u03b9 : Type*} [Countable \u03b9]\n (a : \u03b9 \u2192 \u211d) (ha : \u2200 i, 0 \u2264 a i) (hs : Summable a) :\n \u2200\u1d50 \u03c9 \u2202coefficientLaw \u03b9, Summable (fun i => a i * |\u03c9"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "scalarSeries",
+ "line": 75,
+ "source_header": "h\u03c9\n\n/-- The actual scalar sum; its convergence is proved separately on the product law. -/\ndef scalarSeries {\u03b9 : Type*} (a : \u03b9 \u2192 \u211d) (\u03c9 : \u03b9 \u2192 \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_measurable",
+ "line": 79,
+ "source_header": "* \u03c9 i\n\ntheorem scalarSeries_measurable {\u03b9 : Type*} [Countable \u03b9] (a : \u03b9 \u2192 \u211d) :\n Measurable (scalarSeri"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "scalarSeries_hasSum_ae",
+ "line": 86,
+ "source_header": "ly i)\n\ntheorem scalarSeries_hasSum_ae {\u03b9 : Type*} [Countable \u03b9]\n (a : \u03b9 \u2192 \u211d) (hs : Summable a) :\n \u2200\u1d50 \u03c9 \u2202coefficientLaw \u03b9, HasSum (fun i => a i * \u03c9 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 : \u2115) (L : \u211d) [Fact (0 < L)] (a : Fin d \u2192 \u211d) :\n OpenPartialHomeomorph (SourceTorus d L) (Fin d \u2192 \u211d)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "chartCenter",
+ "line": 16,
+ "source_header": "def chartCenter (d : \u2115) (L : \u211d) [Fact (0 < L)] (q : SourceTorus d L) : Fin d \u2192 \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "quotientChart_symm",
+ "line": 19,
+ "source_header": "theorem quotientChart_symm (d : \u2115) (L : \u211d) [Fact (0 < L)] (a : Fin d \u2192 \u211d) :\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 : \u2115) (L : \u211d) [Fact (0 < L)] (q : SourceTorus d L) :\n q \u2208 (quotientChart d L (chartCenter d L q)).source"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "chart_transition_contDiff",
+ "line": 51,
+ "source_header": "theorem chart_transition_contDiff (d : \u2115) (L : \u211d) [Fact (0 < L)] (a b : Fin d \u2192 \u211d) :\n ContDiffOn \u211d \u221e ((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 : \u2115) (L : \u211d) [Fact (0 < L)] :\n IsManifold \ud835\udcd8(\u211d, Fin d \u2192 \u211d) \u221e (SourceTorus d L)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_contMDiff_ae",
+ "line": 110,
+ "source_header": "theorem torusSourceField_contMDiff_ae (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n \u2200\u1d50 sample \u2202sourceLaw d,\n ContMDiff \ud835\udcd8(\u211d, Fin d \u2192 \u211d) \ud835\udcd8(\u211d) 4 (torusSourceField d L sample)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "torusSourceField_weakSuperlevel_closed_ae",
+ "line": 126,
+ "source_header": "theorem torusSourceField_weakSuperlevel_closed_ae (d : \u2115) (L : \u211d) [Fact (0 < L)] :\n \u2200\u1d50 sample \u2202sourceLaw d, \u2200 h : \u211d,\n IsClosed {q : SourceTorus d L | h \u2264 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 : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) : (Fin d \u2192 \u211d) \u2192L[\u211d]"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "phaseCLM_apply",
+ "line": 16,
+ "source_header": "i\n\ntheorem phaseCLM_apply (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d) :\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 : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :\n \u2016phaseCLM d L k\u2016 \u2264 \u2211 i, |sourceC L * (k i : \u211d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeCoefficient_iteratedFDeriv_bound",
+ "line": 35,
+ "source_header": "]\n\ntheorem modeCoefficient_iteratedFDeriv_bound (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (m : SourceMode d) (j : \u2115) (hj : j \u2264 4) (x : Fin d \u2192 \u211d) :\n \u2016iteratedFDeriv \u211d j (modeCoefficient d L m) x\u2016 \u2264 modeMajorant d L"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_contDiff_ae",
+ "line": 102,
+ "source_header": "]\n\ntheorem sourceField_contDiff_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, ContDiff \u211d 4 (sourceField d L \u03c9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_contDiff_affine_ae",
+ "line": 133,
+ "source_header": ")\n\ntheorem sourceField_contDiff_affine_ae (d : \u2115) {L : \u211d} (hL : L \u2260 0) :\n \u2200\u1d50 \u03c9 \u2202sourceLaw d, \u2200 (T : (Fin d \u2192 \u211d) \u2192L[\u211d] (Fin d \u2192 \u211d)) (a : Fin d \u2192 \u211d),\n ContDiff \u211d 4 (fun x => sourceField d L \u03c9 (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 : \u2115) (m : SourceMode d) : Fin d \u2192 \u2124"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "halfLattice_ne_zero",
+ "line": 13,
+ "source_header": "theorem halfLattice_ne_zero (d : \u2115) {k : Fin d \u2192 \u2124} (hk : k \u2208 halfLattice d) :\n k \u2260 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "halfLattice_partition",
+ "line": 20,
+ "source_header": "theorem halfLattice_partition (d : \u2115) {k : Fin d \u2192 \u2124} (hk : k \u2260 0) :\n (k \u2208 halfLattice d \u2228 -k \u2208 halfLattice d) \u2227\n \u00ac (k \u2208 halfLattice d \u2227 -k \u2208 halfLattice d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceWeight_neg",
+ "line": 59,
+ "source_header": "theorem sourceWeight_neg (d : \u2115) (L : \u211d) (k : Fin d \u2192 \u2124) :\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 : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k n : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d) :\n phase d L k (fun i => x i + L * (n i : \u211d)) =\n phase d L k x + ((\u2211 i, k i * n i : \u2124) : \u211d) * (2 * Real.pi)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "modeCoefficient_lattice_shift",
+ "line": 78,
+ "source_header": "theorem modeCoefficient_lattice_shift (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (m : SourceMode d) (n : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d) :\n modeCoefficient d L m (fun i => x i + L * (n i : \u211d)) =\n modeCoefficient d L m x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sourceField_lattice_shift",
+ "line": 90,
+ "source_header": "theorem sourceField_lattice_shift (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (\u03c9 : SourceMode d \u2192 \u211d) (n : Fin d \u2192 \u2124) (x : Fin d \u2192 \u211d) :\n sourceField d L \u03c9 (fun i => x i + L * (n i : \u211d)) = sourceField d L \u03c9 x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "pairedCoefficient_kernel",
+ "line": 100,
+ "source_header": "theorem pairedCoefficient_kernel (d : \u2115) {L : \u211d} (hL : L \u2260 0)\n (k : \u21a5(halfLattice d)) (x y : Fin d \u2192 \u211d) :\n (\u2211 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 : \u2115) : 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."
+ ]
+ },
+ {
+ "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 : \u211d"
+ },
+ {
+ "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\u00b2 = q(1 \u2212 4q) (L28). -/\ndef srcDe"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "srcSchur",
+ "line": 48,
+ "source_header": "* (q * (1 - 4 * q))\n/-- NOTE L35, with e\u00b2 = q(1 \u2212 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(\u03b8) = (1 \u2212 cos 4\u03b8)/8. -/"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "d2Alpha_eq_src",
+ "line": 59,
+ "source_header": "1 - Real.cos (4 * \u03b8)) / 8\n\n/-! ## W3d (b): the missing link det V = \u03b1\u03b3 \u2212 k4\u00b2 e\u00b2 -/\n\ntheorem d2Alpha_eq_src (m2 m4 q : \u211d) : 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 : \u211d) : d2Gamma"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "srcE_sq",
+ "line": 67,
+ "source_header": "2Gamma srcGamma k2 k4; ring\n\ntheorem srcE_sq (c s : \u211d) (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 : \u211d) :\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 : \u211d) : 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 : \u211d) (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 : \u211d) (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 : \u211d) :\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) \u2260\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 \u2014 q = c\u00b2s\u00b2 over the unit circle is exactly [0, 1/4] -/\n\ntheorem srcQ_mem_Icc (c s : \u211d) (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 : \u211d) (hq : q \u2208 Set.Icc (0 : \u211d) (1 / 4)) :\n \u2203 c s : \u211d, 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 : \u211d | \u2203 c s : \u211d, c ^ 2 + s ^ 2 = 1 \u2227 q = sr"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "unit_q_image",
+ "line": 136,
+ "source_header": "q hq\n exact \u27e8c, s, hu, h.symm\u27e9\n\n/-- (a) Same, as an image of the unit circle. -/\ntheorem unit_q_image :\n (fun p : \u211d \u00d7 \u211d => srcQ p.1 p.2) '' {p : \u211d \u00d7 \u211d | p.1 ^ 2 + p.2 ^ 2 ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "srcQTheta_eq",
+ "line": 146,
+ "source_header": ", hu, rfl\u27e9; exact \u27e8\u27e8c, s\u27e9, hu, rfl\u27e9\n\n/-- NOTE L43's angle parameterization agrees with q = c\u00b2s\u00b2 at (c, s) = (cos \u03b8, sin \u03b8). -/\ntheorem srcQTheta_eq (\u03b8 : \u211d) : srcQThe"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "srcQTheta_range",
+ "line": 156,
+ "source_header": "q \u03b8; linarith\n rw [h4, h2, hs]; ring\n\n/-- (a) Angle form: the range of q(\u03b8) = (1 \u2212 cos 4\u03b8)/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 : \u211d) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n IsLeast (d2Schur m2 m4 '' Set.Icc (0 : \u211d) (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 : \u211d) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n sInf (d2Schur m2 m4 '' Set.Icc (0 : \u211d) (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 : \u211d) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n IsLeast {\u03c3 : \u211d | \u2203 c s : \u211d, c ^ 2 + s ^ 2 = 1 \u2227 \u03c3 = 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 \u03b8 \u2208 \u211d (q(\u03b8) = (1 \u2212 cos 4\u03b8)/8). -/\ntheorem d2_schur_min_over_angles (m2 m4 : \u211d) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n IsLeast (Set.range fun \u03b8 : \u211d => d2Schur m2 m4 (srcQTheta \u03b8))\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 \u2194 raw moments -/\n\n/-- Inverse map (symmetric law): m4 = k4 + 3k2\u00b2, m6 = k6 + 15 k2 k4 + 15 k2\u00b3. -/\ntheorem moments_of_cumulants (m2 m4 m6 : \u211d) :\n m2 = k2 m2 \u2227 m4 = k4 m2 m4 + 3 * k2 m2 ^ 2 \u2227\n m6 = k6"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "cumulants_of_moments",
+ "line": 221,
+ "source_header": "unfold k2 k4 k6; refine \u27e8rfl, by ring, by ring\u27e9\n\n/-- Round trip from cumulants: any (K2, K4, K6) is hit by exactly the moments above. -/\ntheorem cumulants_of_moments (K2 K4 K6 : \u211d) :\n k2 K2 = K2 \u2227 k4 K2 (K4 + 3 * K2 ^ 2) = K4 \u2227\n k6 K2 (K4 +"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "gaussian_cumulants_iff",
+ "line": 227,
+ "source_header": "y\n unfold k2 k4 k6; refine \u27e8rfl, by ring, by ring\u27e9\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 : \u211d) :\n (k2 m2 = 1 \u2227 k4 m2 m4"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "k4_sq_div",
+ "line": 239,
+ "source_header": "fl, by linarith\u27e9\n \u00b7 rintro \u27e8rfl, rfl, rfl\u27e9; norm_num\n\n/-- Helper: (m4 \u2212 3m2\u00b2)\u00b2/m2 = m4\u00b2/m2 \u2212 6 m4 m2 + 9 m2\u00b3 for ALL real m2 (both sides 0 at m2 = 0). -/\ntheorem k4_sq_div (m2 m4 : \u211d) :\n k4 m2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "d2Tau_eq_srcTau",
+ "line": 247,
+ "source_header": "m2 0 with h | h\n \u00b7 subst h; simp\n \u00b7 field_simp; ring\n\n/-- The NOTE's \u03c4\u00b2 in cumulants equals the Lean `d2Tau` with NO hypothesis on m2\n(the existing `d2_tau_cumulant_eq` assumes m2 \u2260 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 \u03a3_{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, \u2190 d2Alpha_eq_src, \u2190 d2Gamma_eq_src]\n unfold k4; ring\n\n/-- Comment 6005199919 L15/L17 right-hand side: x(2x+b)(4x+b), x = m2\u00b2, b = k4. -/\ntheorem d2Numerator_eq_comment (m2 m4 : \u211d) :\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: \u0394 = m6 \u2212 m4\u00b2/m2 is literally `d2Delta`. NOTE's k6 \u2212 k4\u00b2/k2 in moments. -/\ntheorem src_delta_cumulant (m2 m4 m6 : \u211d) :\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 : \u211d \u2192 Prop} (h : \u2200 q, P q) :\n (\u2200 q \u2208 Set.Icc (0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "note_section2_every_direction",
+ "line": 278,
+ "source_header": "1 \u2192 P (srcQ c s)) :=\n \u27e8fun q _ => h q, fun c s _ => h (srcQ c s)\u27e9\n\n/-- NOTE \u00a72 L34\u201336 in every unit direction, obtained from the all-q identities by specialization. -/\ntheorem note_section2_every_direction (m2 m4 m6 c s : \u211d) (hu : c ^ 2 + s ^ 2 = 1) :\n srcQ c s \u2208 Set.Icc (0 : \u211d) (1 / 4) \u2227\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 \u2227\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 \u2227\n d2Schur m2 m4 (srcQ c s) = srcSchur m2 m4 (srcQ c s) \u2227\n d2Tau m2 m4 m6 (srcQ c s) = srcTau m2 m4 m6 (srcQ c s) \u2227\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 _ _ _\u27e9\n\n/-- NOTE L48 Gaussian controls hold on [0, 1/4] (specialization of `d2_gaussian_control`). -/\ntheorem gaussian_control_on_Icc :\n \u2200 q \u2208 Set.Icc (0 : \u211d)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "positivity_every_direction",
+ "line": 298,
+ "source_header": "8 / 3 \u2227 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\u00b2 < m4, 0 < \u0394 give \u03c4\u00b2, det V, \u03a3_{A|V} > 0 for every unit u. -/\ntheorem positivity_every_direction (m2 m4 m6 : \u211d) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (h\u0394 : 0 < d2Delta m2 m4 m6) (c s : \u211d) (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\u0394 h0 h1\u27e9\n\n/-- Weighted Lagrange identity (finite sums). -/\ntheorem lagrange_weighted {\u03b9 : Type*} [Fintype \u03b9] (p f g : \u03b9 \u2192 \u211d) :\n 2 * ((\u2211 i, p i * f i ^ 2) * (\u2211 i, p i * g i ^ 2) - (\u2211 i, p i"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "finMoment",
+ "line": 321,
+ "source_header": "strib, Finset.sum_add_distrib, \u2190 Finset.mul_sum,\n \u2190 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 {\u03b9 : Type*} [Fintype \u03b9] (p x : \u03b9 \u2192 \u211d) (n : \u2115) : \u211d := \u2211 i, p i * x i ^ n\n\ntheorem double_sum_pos {\u03b9 : Type*} [Fintype \u03b9] (F : \u03b9 \u2192 \u03b9 \u2192 \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "finite_law_moment_hyps",
+ "line": 329,
+ "source_header": "et.mem_univ _, Finset.sum_pos' (fun j _ => hF a j) \u27e8b, Finset.mem_univ _, hab\u27e9\u27e9\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 {\u03b9 : Type*} [Fintype \u03b9] (p x : \u03b9 \u2192 \u211d) (hp : \u2200 i, 0 \u2264 p i)\n (hsum : \u2211 i, p i = 1) (a b : \u03b9) (hpa : 0 < p a) (hpb : 0 < p b) (ha0 : x a \u2260 0)\n (hb0 : x b \u2260 0) (hab : x a ^ 2 \u2260 x b ^ 2) :\n 0 < finMoment p x 2 \u2227 finMoment p x 2 ^ 2 < finMomen"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "finite_law_positivity_every_direction",
+ "line": 379,
+ "source_header": "refine \u27e8hm2, hm4, ?_\u27e9\n unfold d2Delta\n rw [sub_pos, div_lt_iff\u2080 hm2]\n linarith\n\n/-- (b)2 general statement for finite laws: positivity of \u03c4\u00b2, det V, \u03a3_{A|V} in every direction. -/\ntheorem finite_law_positivity_every_direction {\u03b9 : Type*} [Fintype \u03b9] (p x : \u03b9 \u2192 \u211d)\n (hp : \u2200 i, 0 \u2264 p i) (hsum : \u2211 i, p i = 1) (a b : \u03b9) (hpa : 0 < p a) (hpb : 0 < p b)\n (ha0 : x a \u2260 0) (hb0 : x b \u2260 0) (hab : x a ^ 2 \u2260 x b ^ 2) (c s : \u211d) (hu : c ^ 2 + s ^ 2 = 1) :\n 0 < d2DetV (finMoment p x 2) (finMoment p x 4) (srcQ c s) \u2227\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 \u03b8 cosine identity (Poisson summation) -/\n\n/-- \u03b8_L(t) = (L\u00b2/(2\u03c0))^{-1/2} \u03a3_k w_k cos(2\u03c0kt/L) for every real t, L \u2260 0. -/\ntheorem theta_eq_cos_series {L : \u211d} (hL : L \u2260 0) (t : \u211d) :\n theta L t = 1 / (L ^ 2 / (2 * \u03c0)) ^ (1 / 2 : \u211d) *\n \u2211' k : \u2124, 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\u00b2/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 : \u2115) (x : \u211d) :\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 \u2124) :\n \u2203 B : \u211d, 0 \u2264 B \u2227 \u2200 x : \u211d, |Polynomial.aeval x p| \u2264 B * R"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "abs_sub_sq_le",
+ "line": 122,
+ "source_header": "orial : \u211d)]\n\ntheorem abs_sub_sq_le {L R t : \u211d} (ht : |t| \u2264 R) (n : \u2124) :\n |t + L * n| - (t + L * n) ^ 2 / 2 \u2264\n R + -\u03c0 * (L ^ 2 / (2 * \u03c0) * (n : \u211d) ^ 2 - 2 * ((R + 1) * |L| / (2 * \u03c0)) *"
+ },
+ {
+ "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| \u2264 R. -/\ntheorem iterate_deriv_gauss_bound (j : \u2115) : \u2203 B : \u211d, 0 \u2264 B \u2227 \u2200 (L R t : \u211d), |t| \u2264 R \u2192 \u2200 n : \u2124,\n \u2016deriv^[j] gauss (t + L * n)\u2016 \u2264 B * (Real.exp R *\n Real.exp (-\u03c0 * (L ^ 2 / (2 * \u03c0) * (n : \u211d) ^ 2 - 2 * ((R + 1) * |L| / (2 * \u03c0)) *"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "summable_majorant",
+ "line": 154,
+ "source_header": "Real.exp_add]\n\ntheorem summable_majorant {L : \u211d} (hL : L \u2260 0) (B R : \u211d) :\n Summable fun n : \u2124 => B * (Real.exp R *\n Real.exp (-\u03c0 * (L ^ 2 / (2 * \u03c0) * (n : \u211d) ^ 2 - 2 * ((R + 1) * |L| / (2 * \u03c0)) *"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "thetaD",
+ "line": 162,
+ "source_header": "_).mul_left _\n\n/-- Termwise j-th derivative series of \u03b8_L: \u03a3_n g^{(j)}(t + Ln). -/\ndef thetaD (L : \u211d) (j :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "summable_thetaD_terms",
+ "line": 165,
+ "source_header": "uss (t + L * n)\n\ntheorem summable_thetaD_terms {L : \u211d} (hL : L \u2260 0) (j : \u2115) (t : \u211d) :\n Summable fun n : \u2124 => deriv^[j] ga"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "hasDerivAt_thetaD",
+ "line": 170,
+ "source_header": "|t| t le_rfl n)\n\ntheorem hasDerivAt_thetaD {L : \u211d} (hL : L \u2260 0) (j : \u2115) (y : \u211d) :\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: \u03a3_k w_k \u03c9_k^j cos(\u03c9_k t + j\u03c0/2). -/\ndef cosD (L : \u211d) (j"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "summable_abs_weight_mul_atom_pow",
+ "line": 193,
+ "source_header": "t + j * (\u03c0 / 2)))\n\ntheorem summable_abs_weight_mul_atom_pow {L : \u211d} (hL : L \u2260 0) (j : \u2115) :\n Summable fun k : \u2124 => 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 : \u211d) (j : \u2115) (k : \u2124) (t : \u211d) :\n \u2016weight L k * (atom L k ^ j * Real.cos (atom L k * t + j * (\u03c0 / 2)))\u2016 \u2264\n weight L k"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "hasDerivAt_cosD",
+ "line": 205,
+ "source_header": "eight_pos L k).le\n\ntheorem hasDerivAt_cosD {L : \u211d} (hL : L \u2260 0) (j : \u2115) (y : \u211d) :\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 : \u211d) : thetaD"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "cosD_zero",
+ "line": 232,
+ "source_header": "]\n congr 1; ring\n\ntheorem cosD_zero (L t : \u211d) : cosD L 0 t = \u2211' k : \u2124, weight L k * Real.c"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "iteratedDeriv_theta",
+ "line": 235,
+ "source_header": "unfold cosD; simp\n\n/-- Term-by-term differentiation, \u03b8 side: iteratedDeriv j \u03b8_L = \u03a3_n g^{(j)}(\u00b7 + Ln). -/\ntheorem iteratedDeriv_theta {L : \u211d} (hL : L \u2260 0) (j : \u2115) : 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 : \u211d} (hL : L \u2260 0) (j : \u2115) (t : \u211d) :\n iteratedDeriv j (theta L) t =\n \u2211' n : \u2124, 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 : \u211d} (hL : L \u2260 0) (j : \u2115) :\n iteratedDeriv j (fun t => \u2211' k : \u2124, 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 : \u211d} (hL : L \u2260 0) (j : \u2115) (t : \u211d) :\n thetaD L j t = 1 / (L ^ 2 / (2 * \u03c0)) ^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "imageSum_even_eq_thetaD",
+ "line": 271,
+ "source_header": "cosD hL j t).const_mul _)\n\n/-! ## (c) \u03b8-route moments = dual-law moments -/\n\ntheorem imageSum_even_eq_thetaD (L : \u211d) (m : \u2115) : 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: \u03b8_L^{(2m)}(0) = \u03a3_n He_{2m}(Ln) e^{\u2212(Ln)\u00b2/2}. -/\ntheorem iteratedDeriv_theta_zero_even {L : \u211d} (hL : L \u2260 0) (m : \u2115) :\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 : \u211d) (m : \u2115) :\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 : \u211d} (hL : L \u2260 0) (m : \u2115) :\n imageSum L (2 * m) = 1 / (L ^ 2 / (2 * \u03c0)) ^ (1 / 2 : \u211d) *\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: \u03b8-route moment (N L53 / C L153) = dual-law moment (N L54 / C L156-177), every even\norder, every L \u2260 0. -/\ntheorem imageMoment_even_eq_dualMoment {L : \u211d} (hL : L \u2260 0) (m : \u2115) :\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 \u2260 0 instead of 0 < L). -/\ntheorem imageMoment_eq_dualMoment {L : \u211d} (hL : L \u2260 0) (j : \u2115) (hj : j = 2 \u2228 j = 4 \u2228 j = 6) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "image_moment_hyps",
+ "line": 324,
+ "source_header": "ageMoment_even_eq_dualMoment hL 3\n\n/-- Corollary: the \u03b8-route moments satisfy 0 < m2, m2\u00b2 < m4, \u0394 > 0 for every L \u2260 0. -/\ntheorem image_moment_hyps {L : \u211d} (hL : L \u2260 0) :\n 0 < imageMoment L 2 \u2227 imageMoment L 2 ^ 2 < imageMoment L 4 \u2227\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 \u03b8-route moments, every L \u2260 0 (R3: c\u00b2+s\u00b2=1). -/\ntheorem image_positivity_every_direction {L : \u211d} (hL : L \u2260 0) (c s : \u211d) (hu : c ^ 2 + s ^ 2 = 1) :\n 0 < d2DetV (imageMoment L 2) (imageMoment L 4) (srcQ c s) \u2227\n 0 < d2Schur (imageMoment L 2) (imageMoment L 4) (srcQ c s) \u2227\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": "\u211d)\n\n/-- Unnormalized moment sum \u03a3 w_i a_i^n. -/\ndef rawSum (n : \u2115"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "lawMoment",
+ "line": 41,
+ "source_header": "i ^ n\n/-- Normalized raw moment m_n = \u03a3 w a^n / \u03a3 w. -/\ndef lawMoment (n :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "residual4_tsum",
+ "line": 45,
+ "source_header": "e {w a}\n\ntheorem residual4_tsum (hs : \u2200 n : \u2115, Summable fun i => w i * a i ^ n) (m : \u211d) :\n Summable (fun i => w i * (a i ^ 2 - m) ^ 2) \u2227\n \u2211' 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 : \u2200 n : \u2115, Summable fun i => w i * a i ^ n) (c : \u211d) :\n Summable (fun i => w i * (a i ^ 3 - c * a i) ^ 2) \u2227\n \u2211' 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 : \u211d} (hx : x \u2260 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\u00b2 < m4 and \u0394 > 0. -/\ntheorem countable_law_moment_hyps (hw : \u2200 i, 0 \u2264 w i)\n (hs : \u2200 n : \u2115, Summable fun i => w i * a i ^ n) (i j : \u03b9) (hwi : 0 < w i) (hwj : 0 < w j)\n (hai : a i \u2260 0) (haj : a j \u2260 0) (hij : a i ^ 2 \u2260 a j ^ 2) :\n 0 < lawMoment w a 2 \u2227 lawMoment w a 2 ^ 2 < lawMoment w a 4 \u2227\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\u03c0k/L (N L54). -/\ndef atom (L : \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "weight",
+ "line": 139,
+ "source_header": "2 * \u03c0 * k / L\n/-- Unnormalized weight e^{\u2212(2\u03c0k/L)\u00b2/2} (N L54). -/\ndef weight (L :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "dualZ",
+ "line": 141,
+ "source_header": "m L k) ^ 2 / 2)\n/-- Normalizer \u03a3_k e^{\u2212(2\u03c0k/L)\u00b2/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 : \u211d) (k :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "summable_weight_mul_atom_pow",
+ "line": 147,
+ "source_header": "k := Real.exp_pos _\n\n/-- Summability of \u03a3_k w_k \u00b7 atom_k^n for every n (in particular n = 6: X\u2076 integrability). -/\ntheorem summable_weight_mul_atom_pow {L : \u211d} (hL : L \u2260 0) (n : \u2115) :\n Summable fun k : \u2124 => weig"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "summable_sixth",
+ "line": 164,
+ "source_header": "[Int.cast_abs]\n ring\n\n/-- X\u2076 integrability of the dual law, stated as summability. -/\ntheorem summable_sixth {L : \u211d} (hL : L \u2260 0) : Summable fun k : \u2124 => we"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "dualZ_pos",
+ "line": 168,
+ "source_header": "eight_mul_atom_pow hL 6\n\ntheorem dualZ_pos {L : \u211d} (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 : \u211d} (hL : L \u2260 0) : \u2211' k : \u2124,"
+ },
+ {
+ "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(\u2212k) = \u2212atom(k), weight even). -/\ntheorem dual_odd_moment_zero (L : \u211d) (m : \u2115) : 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 : \u211d} (hL : L \u2260 0) :\n 0 < dualMoment L 2 \u2227 dualMoment L 2 ^ 2 < dualMoment L 4 \u2227\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 \u2260 0 statement. N certifies \"positive in every direction\" (N L59, L78) only numerically, by\ninterval enclosures, at the six values L \u2208 {24, 8, 2\u03c0, 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 : \u211d} (hL : L \u2260 0) (c s : \u211d) (hu : c ^ 2 + s ^ 2 = 1) :\n 0 < d2DetV (dualMoment L 2) (dualMoment L 4) (srcQ c s) \u2227\n 0 < d2Schur (dualMoment L 2) (dualMoment L 4) (srcQ c s) \u2227\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 \u03b8-series route (N L21, L53; C L137-153) -/\n\n/-- \u03b8_L(t) = \u03a3_n e^{\u2212(t+Ln)\u00b2/2}"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "imageSum",
+ "line": 228,
+ "source_header": "\u2124, Real.exp (-(t + L * n) ^ 2 / 2)\n/-- Image sum \u03a3_n He_j(Ln) e^{\u2212(Ln)\u00b2/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/-- \u03b8-route moment m_j = (\u22121)^(j/2) \u03b8^{(j)}(0)/\u03b8(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): \u03b8_L(0) = (L\u00b2/(2\u03c0))^{\u22121/2} \u00b7 \u03a3_k e^{\u2212(2\u03c0k/L)\u00b2/2}, from\nMathlib's `Real.tsum_exp_neg_mul_int_sq`. -/\ntheorem theta_zero_eq_dual {L : \u211d} (hL : L \u2260 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 \u03b8-term is\n(\u22121)^j He_j(y) e^{\u2212y\u00b2/2} (Mathlib `deriv_gaussian_eq_hermite_mul_gaussian`). -/\ntheorem theta_term_iteratedDeriv (y : \u211d) (j : \u2115) :\n iteratedDeriv j (fun t => Real.exp (-(t + y) ^ 2 / 2)) 0 =\n (-1 : \u211d) ^ 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 \u03b8_L at 0. (The exchange of \u03a3 and d/dt, for L \u2260 0, is in `Side24Poisson`:\n`iteratedDeriv_theta`, `iteratedDeriv_theta_zero_even`.) -/\ntheorem imageSum_even_eq_tsum_termwise (L : \u211d) (m : \u2115) :\n imageSum L (2 * m) =\n \u2211' n : \u2124, 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."
+ ]
+ },
+ {
+ "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 \u2192 \u211d}\n (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 1) (U : Finset Y) : 0 \u2264 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 \u222a T` with `T \u2286 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 \u2286 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 \u222a 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 \u2192 \u211d)\n {M T : Finset Y} (h : Disjoint M T) :\n weight p (M \u222a T) =\n (\u220f v \u2208 M, p v) * ((\u220f v \u2208 T, p v) * \u220f v \u2208 ((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`\u220f_{v \u2208 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 \u2192 \u211d)\n (M : Finset Y) :\n \u2211 U \u2208 (univ : Finset Y).powerset.filter (fun U => M \u2286 U), weight p U = \u220f"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sum_weight_ite_superset",
+ "line": 86,
+ "source_header": ", \u2190 e\u2082, 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 \u2192 \u211d)\n (M : Finset Y) :\n \u2211 U \u2208 (univ : Finset Y).powerset, (if M \u2286 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 \u2192 \u211d) :\n 1 - mu F p =\n \u2211 U \u2208 (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 `\ud835\udcdc`, then\n`1 - mu_p(D) \u2264 \u2211_{M \u2208 \ud835\udcdc} \u220f_{v \u2208 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 \u2192 \u211d) (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 1) (\ud835\udcdc : Finset (Finset X))\n (h\ud835\udcdc : \u2200 U : Finset X, \u00ac IsGood F U \u2192 \u2203 M \u2208 \ud835\udcdc, M \u2286 U) :\n 1 - mu F p \u2264 \u2211"
+ },
+ {
+ "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 : \u00ac IsGood F U) :\n \u2203 M : Finset X, IsMinim"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "card_of_isTransversal",
+ "line": 152,
+ "source_header": ", hv, hb\u27e9\u27e9, subset_rfl\u27e9\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 \u00d7 Fin 409))\n (hU : \u00ac IsGood benchmark816 U) : \u2203 M \u2208"
+ },
+ {
+ "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 : \u211d) / 40900) \u2264 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 \u2264 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 \u2229 2^(X_i) = {S \u2286 X_i : |S| \u2264 a_i}`).\nMethod: for `S \u2286 X_i`, `S \u2229 X_i = S`, so goodness gives `|S| \u2264 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 `\u2211 d_i` when\nevery edge has at least two indices (`P15Structure.Aux.isPaletteFeasible_paletteNumber`), so the\ninfimum over `\u2115` 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) \u2264 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 `\u2211_{U \u2287 M} w(U) = \u220f_{v \u2208 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 : \u211d) < \u2211 i \u2208 Finset.range 10, (288 / 125 : \u211d) ^ 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 : \u211d) < 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 : \u211d) ^ 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 : \u211d) <"
+ },
+ {
+ "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 \u2265 1`: `(j+1)^9 \u2264 512 j^9` since `j + 1 \u2264 2 j`. -/\ntheorem pow_succ_le (j : \u2115) (hj : 1 \u2264 j) : ((j : \u211d) + 1) ^ 9 \u2264"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "exp_succ_le",
+ "line": 81,
+ "source_header": "\u211d) ^ 9 := by ring\n\n/-- The exponential factor for `j \u2265 1`: `exp (-288 (j+1)^2) \u2264 exp (-864) exp (-288 j^2)`. -/\ntheorem exp_succ_le (j : \u2115) (hj : 1 \u2264 j) :\n Real.exp (-288 * ((j : \u211d) + 1) ^ 2) \u2264 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 : \u211d) / 3) =\n (24 : \u211d) ^ ((1 : \u211d) / 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 : \u211d) :\n HasDerivAt (fun z : \u211d => -(((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": "\u27e8Aux.ten_lt_exp, Aux.exp_neg_lt\u27e9\n\n/-- Proves: `UniversalLaw.Spec.Side24.SuccessiveTermRatio` (register row `side24-coefficient`).\nMethod: `(j+1)^9 \u2264 (2j)^9 = 512 j^9` and `-288 (j+1)^2 \u2264 -864 - 288 j^2` for `j \u2265 1`;\n`512 exp (-864) < 1/2` from the quadratic lower bound `1 + 864 + 864^2/2 \u2264 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 : \u211d) ^ 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 : \u211d) :\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 : \u211d) (h : NegDefCone (s, x, y)) :\n s < 0 \u2227 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 \u2192 \u211d` has positive squared norm `v 0 ^ 2 + v 1 ^ 2`. -/\ntheorem cm_sq_add_sq_pos (v : Fin 2 \u2192 \u211d) (hv : v \u2260 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) \u2260 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| \u2264 sqrt (x^2 + y^2) (a^2 + b^2) < -s (a^2 + b^2)` (`nlinarith`). -/\ntheorem cm_quad_pos (s x y a b : \u211d) (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 : \u211d) (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 \u2227 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 : \u211d \u00d7 \u211d \u00d7 \u211d) :\n NegDefCone q \u2194 q.1 < 0 \u2227 q.2.1 ^ 2 + q.2."
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "cm_radial_integral",
+ "line": 166,
+ "source_header": "q.2.2 h.1 h.2\u27e9\n\n/-! ## `cm_` (b): the planar Gaussian integral of the disk integrand -/\n\n/-- The radial integral `\u222b_0^{sqrt a} r (a - r^2)^2 (2\u03c0)\u207b\u00b9 exp (-r^2/2) dr =\n(2\u03c0)\u207b\u00b9 (a^2 - 4a + 8 - 8 exp (-a/2))`: the substitution `z = r^2`\n(`intervalIntegral.integral_comp_mul_deriv`) turns it into `(2\u03c0)\u207b\u00b9` times the interval integral\nof `ElementaryConeIntegral`, which `Side24Elementary.elementaryConeIntegral` evaluates. -/\ntheorem cm_radial_integral (a : \u211d) (ha : 0 \u2264 a) :\n \u222b r in (0 : \u211d)..Real.sqrt a,\n r * ((a - r ^ 2) ^ 2 * ((2 * Real.pi)\u207b\u00b9 * Real.exp (-(r ^ 2) / 2))) =\n (2 * Real.pi)\u207b\u00b9 * (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 \u2022 1_D (a - |q|^2)^2 \u03c6(q.1) \u03c6(q.2)` at\n`q = polarCoord.symm p` is the radial function `1_{r^2 \u2264 a} r (a - r^2)^2 (2\u03c0)\u207b\u00b9 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 : \u211d) (p : \u211d \u00d7 \u211d) :\n p.1 \u2022 Set.indicator {q : \u211d \u00d7 \u211d | q.1 ^ 2 + q.2 ^ 2 \u2264 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 : \u211d | r ^ 2 \u2264 a}\n (fun r => r * ((a - r ^ 2) ^ 2 * ((2 * Real.pi)\u207b\u00b9 * 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 \u2264 a} (a - |q|^2)^2 \u03c6(q.1) \u03c6(q.2)` (`\u03c6` 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\u03c0` (`rl_angular_integral`) and the radial integral `cm_radial_integral`. -/\ntheorem cm_disk_integral (a : \u211d) (ha : 0 \u2264 a) :\n \u222b p, Set.indicator {q : \u211d \u00d7 \u211d | q.1 ^ 2 + q.2 ^ 2 \u2264 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 \u2297 gaussianReal 0 1`, the integral of\n`1{|q|^2 \u2264 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 : \u211d) (ha : 0 \u2264 a) :\n \u222b p, Set.indicator {q : \u211d \u00d7 \u211d | q.1 ^ 2 + q.2 ^ 2 \u2264 a} (fun q => (a - q.1 ^ 2 - q.2 ^ 2) ^ 2) p\n \u2202((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 \u21a6 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 : \u211d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "cm_integrable_exp",
+ "line": 287,
+ "source_header": "bs_of_nonneg (by positivity)]\n\n/-- `t \u21a6 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 : \u211d => 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 : \u211d => 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 `\u222b t^4 = 3 (5/3)^2`\n(`tm_fourth_moment`), `\u222b t^2 = 5/3` (`c1_second_moment_gaussianReal`) and\n`\u222b exp (-t^2/2) = sqrt (3/8)` (`tm_exp_moment`). -/\ntheorem cm_integral_bracket :\n \u222b t, (t ^ 4 - 4 * t ^ 2 + 8 - 8 * Real.exp (-(t ^ 2) / 2)) \u2202(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 \u2260 0`, the integral of `1_{Iio 0} h` against\n`gaussianReal 0 v` is half the integral of `h`: the change of variables `t \u21a6 -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 \u2260 0) (h : \u211d \u2192 \u211d) (hm : Measurable h)\n (heven : \u2200 t, h (-t) = h t) (hint : Integrable h (gaussianReal 0 v)) :\n \u222b t, Set.indicator (Set.Iio 0) h t \u2202(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 \u2227 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 : \u211d \u00d7 \u211d \u00d7 \u211d) :\n coneIntegrand q = Set.indicator {q : \u211d \u00d7 \u211d \u00d7 \u211d | q.1 < 0 \u2227 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| \u2264 q.1^4`: inside the cone `0 \u2264 q.1^2 - q.2.1^2 - q.2.2^2 \u2264 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) \u2297 (N(0, 1) \u2297 N(0, 1))`: it is dominated by\n`q \u21a6 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 \u21a6 coneIntegrand (s, p)` is the closed-disk integrand\n`1{|p|^2 \u2264 s^2} (s^2 - |p|^2)^2` (on the circle `|p|^2 = s^2` both sides vanish). -/\ntheorem cm_coneIntegrand_neg (s : \u211d) (p : \u211d \u00d7 \u211d) (hs : s < 0) :\n coneIntegrand (s, p) = Set.indicator {q : \u211d \u00d7 \u211d | q.1 ^ 2 + q.2 ^ 2 \u2264 s ^ 2}"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "cm_coneIntegrand_nonneg",
+ "line": 425,
+ "source_header": ":= by linarith\n rw [he']\n norm_num\n \u00b7 rfl\n\n/-- For `s \u2265 0` the slice `p \u21a6 coneIntegrand (s, p)` vanishes (the cone needs `s < 0`). -/\ntheorem cm_coneIntegrand_nonneg (s : \u211d)"
+ },
+ {
+ "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: `\u222b coneIntegrand (s, \u00b7) d(N(0, 1) \u2297 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 : \u211d) :\n \u222b p, coneIntegrand (s, p) \u2202((gaussianReal 0 1).prod (gaussianReal 0 1)) =\n Set.indicator (Set.Iio 0)\n (fun t : \u211d => 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| \u2264 q.1^4`, `Aux.cm_integrable_coneIntegrand`), the cone identification `NegDefCone (s, x, y) \u2194 s < 0 \u2227 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 \u2265 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 : \u211d) / 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 : \u211d) /"
+ },
+ {
+ "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 \u2264 exp x_U` from `Real.exp_bound` at degree 16. -/\ntheorem f3_exp_xU_ge :\n (83296775704110158100003160908803 : \u211d) / 10 ^ 32 \u2264\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 \u2264 0.83296775704110158098837919695330` from `Real.exp_bound` at degree 16. -/\ntheorem f3_exp_xL_le :\n Real.exp (-15452018275101327933 / 84547981724898672067) \u2264\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 : \u211d) < 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 : \u211d) < 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 \u2260 i} p_v *\nprod_{v notin U, v \u2260 i} (1 - p_v)`. -/\nnoncomputable def cc_wOther {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y \u2192"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "cc_wOther_nonneg",
+ "line": 194,
+ "source_header": "v \u2208 (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 \u2192 \u211d}\n (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 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 \u2192 \u211d}\n (hp : \u2200 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 \u2192 \u211d) (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 \u2192 \u211d) (i : Y) :\n \u220f v \u2208 s, f v = (if i \u2208"
+ },
+ {
+ "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 \u2208 U`, times the reduced weight. -/\ntheorem cc_weight_update {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y \u2192 \u211d) (i : Y) (x : \u211d)\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 \u2192 \u211d) (i : Y) (x : \u211d) :\n muOf A (Function.update p i x) =\n x * \u2211 U \u2208 A.filter (fun U => i \u2208 U), cc_wOther p i U\n + (1 - x) * \u2211 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 \u21a6 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 : \u2200 U \u2208 A, \u2200 V : Finset Y, V \u2286 U \u2192 V \u2208 A) {p : Y \u2192 \u211d}\n (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 1) (i : Y) :\n \u2211 U \u2208 A.filter (fun U => i \u2208 U), cc_wOther p i U\n \u2264 \u2211"
+ },
+ {
+ "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 `\u2205 \u2208 A` and every `p_v < 1`. -/\ntheorem cc_sum_out_pos {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}\n (h0 : \u2205 \u2208 A) {p : Y \u2192 \u211d} (hp : \u2200 v, 0 \u2264 p v \u2227 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 : \u2200 U \u2208 A, \u2200 V : Finset Y, V \u2286 U \u2192 V \u2208 A) {p : Y \u2192 \u211d}\n (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 1) (i : Y) {x y : \u211d} (hxy : x \u2264 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 \u21a6 -log(a + b exp(-s))` (display (F5)) -/\n\n/-- `a + b exp(-s) > 0` for `a, b \u2265 0` with `a + b > 0`. -/\ntheorem cc_affineExp_pos {a b : \u211d} (ha : 0 \u2264 a) (hb : 0 \u2264 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 : \u211d} (ha : 0 \u2264 a) (hb : 0 \u2264 b) (hab : 0 < a + b) (s : \u211d) :\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 : \u211d} (ha : 0 \u2264 a) (hb : 0 \u2264 b) (hab : 0 < a + b) (s : \u211d) :\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 \u21a6 -log(a + b exp(-s))` is concave on `[0, 1]` for\n`a, b \u2265 0`, `a + b > 0` (`concaveOn_of_deriv2_nonpos`). -/\ntheorem cc_concaveOn_negLog {a b : \u211d} (ha : 0 \u2264 a) (hb : 0 \u2264 b) (hab : 0 < a + b) :\n ConcaveOn \u211d (Se"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "cc_hazardCoord_update_eq",
+ "line": 365,
+ "source_header": "b) (Real.exp_pos _).le\n linarith\n \u00b7 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 \u2192 \u211d) (i : Y) (s : \u211d) :\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 `\u2205` and `t` in the\ncube, `s \u21a6 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 : \u2205 \u2208 A) (hdown : \u2200 U \u2208 A, \u2200 V : Finset Y, V \u2286 U \u2192 V \u2208 A)\n (i : Y) (t : Y \u2192 \u211d) (ht : \u2200 j, 0 \u2264 t j \u2227 t j \u2264 1) :\n ConcaveOn \u211d (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) \u2265 (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) \u2264 1` for `p` in the cube: `A \u2286 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 \u2264 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) \u2208 [0, 1]` for `u \u2208 [0, 1]` (indeed for every `u \u2265 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 \u00b7 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 \u2192 \u211d} (hu : \u2200 j, 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "f6_hazardCoord_nonneg",
+ "line": 449,
+ "source_header": "(-u v) \u2227 1 - Real.exp (-u v) \u2264 1 :=\n fun v => f6_one_sub_exp_neg_mem (hu v)\n\n/-- `0 \u2264 F_A(u)` on the cube: `-log m \u2265 0` for `0 \u2264 m \u2264 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, \u2026, 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 : \u211d)) = 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 \u21a6 F_A(update u i s)` is concave on `[0, 1]` and\n`u` lies in the cube, then `u_i \u00b7 F_A(update u i 1) \u2264 F_A(u)`. -/\ntheorem f6_chord {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y)) (i : Y)\n (u : Y \u2192 \u211d) (hu : \u2200 j, 0 \u2264 u j \u2227 u j \u2264 1)\n (hconc : ConcaveOn \u211d (Set.Icc (0 : \u211d) 1)\n (fun s : \u211d => 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 \u2192 \u211d} (ht : \u2200 j, 0 \u2264 t j \u2227 t j \u2264 1)\n (s : Finset Y)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "f6_raised_insert",
+ "line": 497,
+ "source_header": "t j) \u2264 1 := by\n intro j\n split_ifs\n \u00b7 exact \u27e8zero_le_one, le_refl 1\u27e9\n \u00b7 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 \u2192 \u211d) (a : Y) (s : Finset Y) :\n (fun j => if j \u2208 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 \u00b7 subst hj\n simp\n \u00b7 simp [Finset.mem_insert, hj]\n\n/-- Iterated chord inequality: for every finite set `s` of coordinates,\n`(prod_{j \u2208 s} t_j) \u00b7 F_A(u_s) \u2264 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 : \u2200 (i : Y) (u : Y \u2192 \u211d), (\u2200 j, 0 \u2264 u j \u2227 u j \u2264 1) \u2192\n ConcaveOn \u211d (Set.Icc (0 : \u211d) 1) (fun s : \u211d => hazardCoord A (Function.update u i s)))\n (t : Y \u2192 \u211d) (ht : \u2200 j, 0 \u2264 t j \u2227 t j \u2264 1) (s : Finset Y) :\n (\u220f 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 _ \u2264 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, \u2026, 1)` and\n`F_A(1, \u2026, 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 : \u211d) := 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) \u2265 H_A prod_i phi(p_i)`\n\n### (a) The transformed price `phi` maps `[0,1]` into `[0,1]` -/\n\n/-- `0 \u2264 phi x` for `x \u2265 0`: when `x < 1`, `"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "f7_phi_le_one",
+ "line": 563,
+ "source_header": "log (1 - x) \u2264 0 := Real.log_nonpos (by linarith) (by linarith)\n linarith\n \u00b7"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "f7_phi_mem",
+ "line": 570,
+ "source_header": "\u211d) : phi x \u2264 1 := by\n unfold phi\n split_ifs with h\n \u00b7 exact min_le_left _ _\n \u00b7 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 : \u211d} (hx : 0 \u2264 x \u2227 x \u2264 1) : 0 \u2264 phi x \u2227 phi x \u2264 1 :=\n \u27e8f7_phi_nonneg hx.1, f7_phi_le_one x\u27e9\n\n/-! ### (b) `p' = 1 - exp(-phi p)` lies in `[0, p]` -/\n\n/-- `0 \u2264 1 - exp(-phi x)` for `x \u2265 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) \u2264 1 := Real.exp_le_one_iff.2 (by linarith [f7_phi_nonneg hx])\n linarith\n\n/-- `1 - exp(-phi x) \u2264 x` on `[0,1]`: for `x < 1`, `phi x \u2264 -log(1 - x)` so\n`exp(-phi x) \u2265 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 : \u211d)\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 \u2192 \u211d} (hp : \u2200 j, 0 \u2264 p j \u2227 p j \u2264 1)\n (hq : \u2200 j, 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "f7_mix_insert",
+ "line": 614,
+ "source_header": "then q j else p j) \u2227 (if j \u2208 s then q j else p j) \u2264 1 := by\n intro j\n split_ifs\n \u00b7 exact hq j\n \u00b7 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 \u2192 \u211d) (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 \u00b7 subst hj\n simp\n \u00b7 simp [Finset.mem_insert, hj]\n\n/-- For `a \u2209 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 \u2192 \u211d) (a : Y) (s : Finset Y)\n (ha : a \u2209 s"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "f7_muOf_le_mix",
+ "line": 635,
+ "source_header": "if j \u2208 s then q j else p j) a (p a) := by\n funext j\n by_cases hj : j = a\n \u00b7 subst hj\n simp [ha]\n \u00b7 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) \u2264 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 : \u2200 U \u2208 A, \u2200 V : Finset Y, V \u2286 U \u2192 V \u2208 A) {p q : Y \u2192 \u211d}\n (hp : \u2200 j, 0 \u2264 p j \u2227 p j \u2264 1) (hq : \u2200 j, 0 \u2264 q"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "f7_muOf_antitone",
+ "line": 652,
+ "source_header": "(hqp a)\n rw [\u2190 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 \u2264 p` pointwise, both in\nthe cube, gives `mu_p(A) \u2264 mu_q(A)`. -/\ntheorem f7_muOf_antitone {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}\n (hA : \u2200 U \u2208 A, \u2200 V : Finset Y, V \u2286 U \u2192 V \u2208 A) {p q :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "f7_hazardPhiBound_of_productBound",
+ "line": 665,
+ "source_header": ": (fun j : Y => if j \u2208 (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) \u2208 [0,1]` and `p'_i := 1 - exp(-t_i) \u2208 [0, p_i]`, antitonicity gives\n`0 < mu_p(A) \u2264 mu_p'(A)`, so `-log mu_p(A) \u2265 -log mu_p'(A) = F_A(t) \u2265 (prod_i t_i) H_A`. -/\ntheorem f"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "f8_prod_phi_le_one",
+ "line": 690,
+ "source_header": ":= mul_comm _ _\n _ \u2264 -Real.log (muOf A (fun j => 1 - Real.exp (-phi (p j)))) := h6'\n _ \u2264 -Real.log (muOf A p) := hlog\n\n/-! ## (F8) The full-ground price bound -/\n\n/-- `prod_i phi(p_i) \u2264 1` for `p \u2208 [0, 1]^n`, from `0 \u2264 phi \u2264 1` on `[0, 1]`\n(`Fins"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "f8_prod_le_prod_phi",
+ "line": 698,
+ "source_header": "p j \u2264 1) :\n \u220f i, phi (p i) \u2264 1 :=\n Finset.prod_le_one\u2080 (fun i _ => f7_phi_nonneg (hp i).1) (fun i _ => f7_phi_le_one (p i))\n\n/-- `prod_i c_i \u2264 prod_i phi(p_i)` for `0 \u2264 c_i \u2264 phi(p_i)` (`Finset.prod_le_prod\u2080`"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "f8_fullGroundPriceBound_of_phiBound",
+ "line": 703,
+ "source_header": "0 \u2264 c j \u2227 c j \u2264 phi (p j)) :\n \u220f i, c i \u2264 \u220f i, phi (p i) :=\n Finset.prod_le_prod\u2080 (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 \u2208 [0, 1]^n` and `0 \u2264 c \u2264 phi \u2218 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) \u2264 -log mu_p(A)` and `0 < H_A` (`P15Elementary.hazardStarPositive`), so\n`prod_i phi(p_i) = H_A\u207b\u00b9 (H_A prod_i phi(p_i)) \u2264 H_A\u207b\u00b9 [-log mu_p(A)]` (`inv_mul_cancel_left\u2080`,\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 \u2264 prod_i phi(p_i)` for `p \u2208 [0, 1]^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "bi_budget_of_one_le_hazardStar",
+ "line": 732,
+ "source_header": "n : \u2115} (p : Fin n \u2192 \u211d) (hp : \u2200 j, 0 \u2264 p j \u2227 p j \u2264 1) :\n 0 \u2264 \u220f i, phi (p i) :=\n Finset.prod_nonneg fun i _ => f7_phi_nonneg (hp i).1\n\n/-- The (\u21d0) direction, display (F8) with `rho = 1`: given display (F7) and `1 \u2264 H_A`, every\n`p \u2208 [0, 1]^n` and `0 \u2264 c \u2264 phi \u2218 p` satisfy `prod_i c_i \u2264 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) \u2264 H_A prod_i phi(p_i)` (`le_mul_of_one_le_left`, from `0 \u2264 prod_i phi(p_i)`\nand `1 \u2264 H_A`) and `H_A prod_i phi(p_i) \u2264 -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 : \u2115}\n {A : Finset (Finset (Fin n))} (hn : 1 \u2264 n) (hA : IsProperDownset A)\n (h1 : 1 \u2264 hazardSta"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "bi_muOf_pStar_pos",
+ "line": 753,
+ "source_header": "\u220f i, phi (p i) := le_mul_of_one_le_left hphi0 h1\n _ \u2264 -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 \u2208 (0, 1)` is nonnegative (`P15Budget.Aux.weight_nonneg`), and the member `\u2205 \u2208 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 : \u211d) < 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 (\u21d2) direction: if every `p \u2208 [0, 1]^n` and `0 \u2264 c \u2264 phi \u2218 p` satisfy\n`prod_i c_i \u2264 cappedHazard 1 (mu_p(A))`, then `1 \u2264 H_A`. Instantiate at `p \u2261 p_star`, `c \u2261 1`,\nadmissible since `0 \u2264 p_star \u2264 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 \u2264 -log mu_{p_star}(A)`, which is `hazardStar A` by definition. -/\ntheorem bi_one_le_hazardStar_of_budget {n : \u2115} {A : Finset (Finset (Fin n))}\n (hA : IsProperDownset A)\n (hall : \u2200 (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, \u2193reduceIte, 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 \u2265 1` and a proper\ndownset `A` on `Fin n`, the universal capped budget at `rho = 1` holds iff `1 \u2264 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 \u00b7 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 \u2286 Fin n : |T| \u2264 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 \u2264 a := (mem_filter.mp hU).2\n exact mem_filter.mpr \u27e8mem_powerset.mpr (subset_univ V), le_trans (card_le_card hVU) hU'\u27e9\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 \u00b7 intro v\n constructor\n \u00b7 intro hv\n exact \u27e8B.equivFin \u27e8v, hv\u27e9, by simp\u27e9\n \u00b7 rintro \u27e8k, rfl\u27e9\n exact (B.equivFin.symm k).2\n\n/-- An injection `e : Fin n \u2192 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 \u27e8e, he\u27e9 = 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 : \u2200 v, v \u2208 B \u2194 \u2203 k, e k = v) (f : X \u2192 \u211d) :\n \u220f k, f (e k) = \u220f v \u2208 B, f v := by\n rw [\u2190 lp_map_univ_eq e he hrange, Finset.prod_map]\n rfl\n\n/-- For `S \u2286 B`, the image of the preimage `{k : e k \u2208 S}` is `S`. -/\ntheorem lp_map_filter_eq {X : Type} [DecidableEq X] {B : Finset X} {n : \u2115} (e : Fin n \u2192 X)\n (he : Functio"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "lp_filter_map_eq",
+ "line": 875,
+ "source_header": "ction.Embedding.coeFn_mk]\n constructor\n \u00b7 rintro \u27e8k, hk, rfl\u27e9\n exact hk\n \u00b7 intro hv\n obtain \u27e8k, rfl\u27e9 := (hrange v).mp (hS hv)\n exact \u27e8k, hv, rfl\u27e9\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 \u00b7 rintro \u27e8a, ha, hak\u27e9\n rwa [he hak] at ha\n \u00b7 intro hk\n exact \u27e8k, hk, rfl\u27e9\n\n/-! ### Transport of the local good probability to the capacity family -/\n\n/-- Along an enumeration `e : Fin n \u2192 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| \u2264 a_i}` on `Fin n` under\nthe transported vector `p \u2218 e`. Uses `LocalRestriction` (a block subset is good iff its size is\nat most `a_i`) and the bijection `T \u21a6 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 \u2192 \u211d) (i : Fin F.b) {n : \u2115} (e :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "lp_localPriceBoundFull_of_phiBound",
+ "line": 943,
+ "source_header": ".map \u27e8e, he\u27e9, p v) * \u220f v \u2208 block F i \\ T.map \u27e8e, he\u27e9, (1 - p v)\n unfold weight\n rw [Finset.prod_map, \u2190 hmapuniv, \u2190 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 \u2265 2`, every `p \u2208 [0,1]^X`, every `0 \u2264 c_v \u2264 phi(p_v)` and every block with\n`mu_p(D_i) > 0`, `price(X_i) \u2264 rho_star \u00b7 (-log mu_p(D_i))` and `price(X_i) \u2264 1`. -/\ntheorem lp_localPriceBoundFull_of"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "f2_rhoStar_nonneg",
+ "line": 1004,
+ "source_header": "od]\n _ \u2264 -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\u2080 hhpos, mul_comm]\n exact key\n\n/-! ## (F2) The full transformed-price budget -/\n\n/-- `0 \u2264 rh"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "f2_fullTransformedPriceBudget_of_local",
+ "line": 1014,
+ "source_header": "ave h : (1 : \u211d) < 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 : \u2200 {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 \u2192 hazardProductBound \u2192 hazardPhiBound \u2192 fullGroundPriceBound,\nfullGroundBudgetIff, localPriceBoundFull \u2192 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\u2080`, `lt_div_iff\u2080`); 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 \u27e8Aux.f3_lower_lt_rhoStar, Aux.f3_rhoStar_lt_upper, Aux.f3_upper_lt_six_sevenths\u27e9\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 \u2264 S_in \u2264 S_out` for a\ndownset (`Aux.cc_sum_in_le_sum_out`, the injection `U \u21a6 U.erase i`) and `S_out > 0` since `\u2205 \u2208 A`\nand every `p_j(t) < 1` on the cube (`Aux.cc_sum_out_pos`); then `s \u21a6 -log(a + b exp(-s))` with\n`a, b \u2265 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 \u2264 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 \u27e8h0, -, hdown\u27e9 := 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) \u2265 (1-s) f(0) + s f(1) \u2265 s f(1)` since `f(0) = -log mu \u2265 0`\n(`Aux.f6_hazardCoord_nonneg`, from `mu_p(A) \u2264 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, \u2026, 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) \u2208 [0,1]` (`Aux.f7_phi_mem`) and `p'_i := 1 - exp(-t_i) \u2208 [0, p_i]`\n(`Aux.f7_one_sub_exp_neg_phi_le`, from `phi p \u2264 -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 \u2264 S_out` by\n`Finset.sum_image` along `U \u21a6 U.erase i`, iterated by `Finset.induction_on`), so\n`0 < mu_p(A) \u2264 mu_p'(A)` and `Real.log_le_log` give `-log mu_p(A) \u2265 -log mu_p'(A) = F_A(t)`;\ndisplay (F6) `hazardProductBound` then gives `F_A(t) \u2265 (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 \u2264 prod_i phi(p_i)` for `0 \u2264 c_i \u2264 phi(p_i)` (`Finset.prod_le_prod\u2080`) and\n`prod_i phi(p_i) \u2264 1` from `0 \u2264 phi \u2264 1` on `[0,1]` (`Finset.prod_le_one\u2080`, `Real.log_nonpos`)\ngive the cap; when `mu_p(A) > 0`, display (F7), `hazardPhiBound`, gives\n`H_A prod_i phi(p_i) \u2264 -log mu_p(A)` and `H_A > 0` (`P15Elementary.hazardStarPositive`), so\n`prod_i phi(p_i) \u2264 (1/H_A) [-log mu_p(A)]` (`inv_mul_cancel_left\u2080`, `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: (\u21d0) is display (F8) with `rho = 1`: `prod_i c_i \u2264 prod_i phi(p_i) \u2264 1`\n(`Finset.prod_le_prod\u2080`, `Finset.prod_le_one\u2080`) and, when `mu_p(A) > 0`,\n`prod_i phi(p_i) \u2264 H_A prod_i phi(p_i) \u2264 -log mu_p(A)` from `1 \u2264 H_A` (`le_mul_of_one_le_left`)\nand display (F7), `hazardPhiBound`, reaching the cap by `P15Budget.Aux.le_cappedHazard_of`.\n(\u21d2) instantiates the budget at `p \u2261 p_star`, `c \u2261 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`\u2205 \u2208 A` contributes `(1 - p_star)^n > 0` (`Finset.single_le_sum`, `P15Budget.Aux.weight_nonneg`),\nso `1 \u2264 min 1 (-log mu_{p_star}(A))` and `le_min_iff` gives `1 \u2264 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| \u2264 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 \u2264 H_{n_i,a_i}` by `CapacityWorstCase` and `\u220f c \u2264 \u220f phi \u2264 1` by\n`Finset.prod_le_prod\u2080`, `Finset.prod_le_one\u2080`; `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 \u2264 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 \u2264 1` by the cover `{\u2205}` (`P15Budget.Aux.coverCost_le_one`); for `K \u2265 K_H(d)`\nthe full blocks cover, so `covercost \u2264 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) \u2264 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) \u2264 rho_star [-log mu_p(D)]` with\n`rho_star \u2265 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 `\u2115` -/\n\n/-- `\u2211_{n \u2265 1} \u03bc n = 1 - \u03bc 0` for a summable family of total mass one. -/\ntheorem rc_tail_one_eq (\u03bc : \u2115 \u2192 \u211d) (hs : Summable \u03bc) (h1 : \u2211' n, \u03bc n = 1) :\n \u2211' n : \u2115, \u03bc (n + 1) = 1"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rc_tail_two_eq",
+ "line": 59,
+ "source_header": "arith\n\n/-- `\u2211_{n \u2265 2} \u03bc n = 1 - \u03bc 0 - \u03bc 1` for a summable family of total mass one. -/\ntheorem rc_tail_two_eq (\u03bc : \u2115 \u2192 \u211d) (hs : Summable \u03bc) (h1 : \u2211' n, \u03bc n = 1) :\n \u2211' n : \u2115, \u03bc (n + 2) = 1 - \u03bc"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rc_tail_one_le_mean",
+ "line": 67,
+ "source_header": "inarith\n\n/-- Markov for the mean: `\u2211_{n \u2265 1} \u03bc n \u2264 \u2211 n \u03bc n` for a nonnegative family with summable\nmean. -/\ntheorem rc_tail_one_le_mean (\u03bc : \u2115 \u2192 \u211d) (h0 : \u2200 n, 0 \u2264 \u03bc n) (hs : Summable \u03bc)\n (hm : Summable (fun n : \u2115 => (n : \u211d) * \u03bc n)) :\n \u2211' n : \u2115, \u03bc (n + 1) \u2264 \u2211' n : \u2115, (n :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rc_one_sub_head_le_mean",
+ "line": 84,
+ "source_header": "_of_eq h2\n\n/-- `1 - \u03bc 0 \u2264 \u2211 n \u03bc n` for a probability mass function with summable mean. -/\ntheorem rc_one_sub_head_le_mean (\u03bc : \u2115 \u2192 \u211d) (h0 : \u2200 n, 0 \u2264 \u03bc n) (hs : Summable \u03bc)\n (h1 : \u2211' n, \u03bc n = 1) (hm : Summable (fun n : \u2115 => (n : \u211d) * \u03bc n)) :\n 1 - \u03bc 0 \u2264 \u2211' n : \u2115, (n"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rc_two_mul_tail_two_le_mean",
+ "line": 91,
+ "source_header": "hs h1] at h\n\n/-- `2 (1 - \u03bc 0 - \u03bc 1) \u2264 \u2211 n \u03bc n`: the mean dominates twice the mass of `{n \u2265 2}` (this is the\nsource's remark `2a \u2264 A`, before dividing by `r^3`). -/\ntheorem rc_two_mul_tail_two_le_mean (\u03bc : \u2115 \u2192 \u211d) (h0 : \u2200 n, 0 \u2264 \u03bc n) (hs : Summable \u03bc)\n (h1 : \u2211' n, \u03bc n = 1) (hm : Summable (fun n : \u2115 => (n : \u211d) * \u03bc n)) :\n 2 * (1 - \u03bc 0 - \u03bc 1) \u2264 \u2211' n : \u2115,"
+ },
+ {
+ "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 \u2265 0` (Mathlib's\n`ProbabilityTheory.hasSum_one_poissonMeasure`, whose summand is definitionally\n`poissonPMF lam n`). -/\ntheorem rc_hasSum_poissonPMF (lam : \u211d) (hl : 0 \u2264 lam) : HasSum ("
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rc_poissonPMF_zero",
+ "line": 121,
+ "source_header": "am, hl\u27e9\n exact h\n\n/-- `poissonPMF lam 0 = e^{-lam}`. -/\ntheorem rc_poissonPMF_zero (lam : \u211d) : 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 : \u211d) : poissonPMF lam 1 ="
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rc_poisson_tail_one",
+ "line": 129,
+ "source_header": "y\n simp [poissonPMF]\n\n/-- The Poisson tail `\u2211_{n \u2265 1} Pois(lam)(n) = 1 - e^{-lam}` for `lam \u2265 0`. -/\ntheorem rc_poisson_tail_one (lam : \u211d) (hl : 0 \u2264 lam) :\n \u2211' n : \u2115, 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 `\u2211_{n \u2265 2} Pois(lam)(n) = 1 - e^{-lam} - lam e^{-lam}` for `lam \u2265 0`. -/\ntheorem rc_poisson_tail_two (lam : \u211d) (hl : 0 \u2264 lam) :\n \u2211' n : \u2115, 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 \u2264 1 - e^{-x}` for `0 \u2264 x \u2264 1/2`, from `|e^y - 1 - y| \u2264 y^2` on `|y| \u2264 1`. -/\ntheorem rc_half_le_one_sub_exp (x : \u211d) (h0 : 0 \u2264 x) (h1 : x \u2264 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 \u2265 2) = 1 - e^{-lam} - lam e^{-lam} \u2264 lam^2` for `lam \u2265 0`, from\n`1 + y \u2264 e^y` multiplied by `1 + lam \u2265 0`. -/\ntheorem rc_poisson_tail_two_le_sq (lam : \u211d) (h0 : 0 \u2264 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 `\u03b4_0` and against tail events -/\n\n/-- The upper half's witness: `pmfTV \u03bc (poissonPMF 0) = 1 - \u03bc 0` for a probability mass\nfunction `\u03bc` (`poissonPMF 0 = \u03b4_0`). -/\ntheorem rc_pmfTV_poissonPMF_zero (\u03bc : \u2115 \u2192 \u211d) (h0 : \u2200 n, 0 \u2264 \u03bc n) (hs : Summable \u03bc)\n (h1 : \u2211' n, \u03bc n = 1) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rc_abs_tail_sub_le_pmfTV",
+ "line": 188,
+ "source_header": "l, rc_tail_one_eq \u03bc hs h1]\n ring\n\n/-- Half the `l^1` distance dominates the difference of the masses of every tail event\n`{n \u2265 k}`, for two summable families of total mass one: the head and the tail of `\u03bc - \u03bd` 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 (\u03bc \u03bd : \u2115 \u2192 \u211d) (h\u03bc : Summable \u03bc) (h\u03bd : Summable \u03bd)\n (h1 : \u2211' n, \u03bc n = 1) (h1' : \u2211' n, \u03bd n = 1) (k : \u2115) :\n |(\u2211' n : \u2115, \u03bc (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 \u2265 2}` against `Pois(lam)`:\n`|(1 - \u03bc 0 - \u03bc 1) - (1 - e^{-lam} - lam e^{-lam})| \u2264 pmfTV \u03bc (poissonPMF lam)`. -/\ntheorem rc_tail_two_bound (\u03bc : \u2115 \u2192 \u211d) (hs : Summable \u03bc) (h1 : \u2211' n, \u03bc n = 1) (lam : \u211d)\n (hl : 0 \u2264 lam) :\n |(1 - \u03bc 0 - \u03bc 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 \u2265 1}` against `Pois(lam)`:\n`|(1 - \u03bc 0) - (1 - e^{-lam})| \u2264 pmfTV \u03bc (poissonPMF lam)`. -/\ntheorem rc_tail_one_bound (\u03bc : \u2115 \u2192 \u211d) (hs : Summable \u03bc) (h1 : \u2211' n, \u03bc n = 1) (lam : \u211d)\n (hl : 0 \u2264 lam) :\n |(1 - \u03bc 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 \u2264 min (a/2) (min (1/(a + 2A)) (1/2))`, for a\nprobability mass function `\u03bc` with summable mean satisfying (H1) and (H2) at `r`: every\n`lam \u2265 0` is at distance at least `(a/2) r^3`. -/\ntheorem rc_lower_half (\u03bc : \u2115 \u2192 \u211d) (a A r : \u211d) (hA : 0 < A) (hr : 0 < r)\n (hr_a : r \u2264 a / 2) (hr_A : r \u2264 1 / (a + 2 * A)) (hr_half : r \u2264 1 / 2)\n (h0 : \u2200 n, 0 \u2264 \u03bc n) (hs : Summable \u03bc) (h1 : \u2211' n, \u03bc n = 1)\n (hm : Summable (fun n : \u2115 => (n : \u211d) * \u03bc n)) (hmean : \u2211' n : \u2115, (n : \u211d) * \u03bc n \u2264 A * r ^ 3)\n (hH2 : a * r ^ 3 \u2264 1 - \u03bc 0 - \u03bc 1) (lam : \u211d) (hlam : 0 \u2264 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 \u03bc (poissonPMF 0) = 1 - \u03bc 0 \u2264\n\u2211 n \u03bc n \u2264 A r^3`. -/\ntheorem rc_upper_half (\u03bc : \u2115 \u2192 \u211d) (A r : \u211d) (h0 : \u2200 n, 0 \u2264 \u03bc n) (hs : Summable \u03bc)\n (h1 : \u2211' n, \u03bc n = 1) (hm : Summable (fun n : \u2115 => (n : \u211d) * \u03bc n))\n (hmean : \u2211' n : \u2115, (n : \u211d) * \u03bc n \u2264 A * r"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rareClusterPoissonObstructionO",
+ "line": 285,
+ "source_header": "d_le_mean \u03bc h0 hs h1 hm).trans hmean\n\nend Aux\n\n/-! ## Theorem O's shape: the abstract implication (H1) \u2227 (H2) \u21d2 (3.1) -/\n\n/-- Proves: `UniversalLaw.Spec.RN.RareClusterPoissonObstructionO` (claim `OA-C6-RARE-CLUSTER-20260929-v1`).\nMethod: the antecedents at `r0` give `2a \u2264 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 (\u03bc r) (poissonPMF 0) = 1 - \u03bc r 0 \u2264 \u2211 n \u03bc 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 \u2265 2}` when `lam \u2264 r^2` and the tail `{n \u2265 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 `\u03bc` 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 \u2264 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 (\u03bc : \u211d \u2192 \u2115 \u2192 \u211d) (a A : \u211d) :\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 \u2260 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 {\u03a9 : Type} [MeasurableSpace \u03a9] (P : Measure \u03a9)\n [IsProbabilityMeasure P] (A : \u03a9 \u2192 \u211d) {v : NNReal} (hv : v \u2260 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 \u21a6 1_{Iio 0}(a) a^2` is measurable. -/\ntheorem c1_measurable_indicator_sq :\n Measurable (fun a : \u211d => Set.indicator (Set.Iio (0 : \u211d)) (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 \u222b t, t ^ 2 \u2202(gaussianReal 0"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "c1_integrable_sq_gaussianReal",
+ "line": 96,
+ "source_header": "simpa using h\n\n/-- `a \u21a6 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 : \u211d => 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 \u21a6 -a` (`integral_map`),\nusing `neg_lt_zero` and `neg_sq` pointwise. -/\ntheorem c1_setIntegral_sq_Iio_eq_Ioi (v : NNReal) :\n \u222b a in Set.Iio (0 : \u211d), a ^ 2 \u2202(gaussianReal 0 v) =\n \u222b a in Set.Ioi (0 : \u211d), a ^ 2 \u2202("
+ },
+ {
+ "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 \u2260 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 \u2260 0) :\n \u222b a in Set.Iio (0 : \u211d), a ^ 2 \u2202(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 \u21a6 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 `(\u03a9, P, A)` so that the interface's own instance\nfields `I.m\u03a9`, `I.isProb` are supplied explicitly at the point of use. -/\ntheorem c1_integral_indicator_eq {\u03a9 : Type} [MeasurableSpace \u03a9] (P : Measure \u03a9)\n [IsProbabilityMeasure P] (A : \u03a9 \u2192 \u211d)\n (hlaw : Measure.map A P = gaussianReal 0 (8 / 3 : NNReal)) :\n \u222b \u03c9, Set.indicator (Set.Iio (0 : \u211d)) (fun a => a ^ 2) (A \u03c9) \u2202P =\n \u222b a in Set.Iio (0 : \u211d), a ^ 2 \u2202(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 \u21a6 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 : \u211d) :\n HasDerivAt (fun t : \u211d => 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 \u21a6 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 : \u211d) :\n iteratedDeriv 4 (fun t : \u211d => 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 `\u222b t^2 = v` is `c1_second_moment_gaussianReal` above (the `tm_` copy was\nremoved at integration). -/\n\n/-- Fourth moment of `N(0, v)`: `\u222b t^4 = 3 v^2`, from the fourth derivative at `0` of the\nmoment generating function `t \u21a6 exp (v t^2 / 2)` (`iteratedDeriv_mgf_zero`,\n`mgf_fun_id_gaussianReal`, `tm_iteratedDeriv_four`). -/\ntheorem tm_fourth_moment (v : NNReal) :\n \u222b t, t ^ 4 \u2202("
+ },
+ {
+ "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)`: `\u222b exp (-t^2/2) = sqrt (3/8)`. The density\n`(sqrt (10 \u03c0 / 3))\u207b\u00b9 exp (-3 t^2 / 10)` times `exp (-t^2/2)` is\n`(sqrt (10 \u03c0 / 3))\u207b\u00b9 exp (-(4/5) t^2)`, whose Lebesgue integral is `sqrt (\u03c0 / (4/5))`\n(`integral_gaussian`); the square roots combine to `sqrt (3/8)`. -/\ntheorem tm_exp_moment :\n \u222b t, Real.exp (-(t ^ 2) / 2) \u2202(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 \u2218 (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 : \u211d \u2192 \u211d`, `\u222b f (s \u03c9) dP = \u222b 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 : \u211d \u2192 \u211d) (hf : Measurable f) :\n \u222b \u03c9, f (I.s \u03c9) \u2202"
+ },
+ {
+ "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`: `\u222b_0^a exp (-z/2)/2 dz = 1 - exp (-a/2)`, by\nthe fundamental theorem of calculus with antiderivative `z \u21a6 -exp (-z/2)`. -/\ntheorem rl_rhs_integral (a : \u211d) :\n \u222b 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`\u222b_0^{sqrt a} r (2\u03c0)\u207b\u00b9 exp (-r^2/2) dr = (2\u03c0)\u207b\u00b9 (1 - exp (-a/2))`, by the fundamental\ntheorem of calculus with antiderivative `r \u21a6 -(2\u03c0)\u207b\u00b9 exp (-r^2/2)`. -/\ntheorem rl_radial_integral (a : \u211d) (ha : 0 \u2264 a) :\n \u222b r in (0 : \u211d)..Real.sqrt a, r * ((2 * Real.pi)\u207b\u00b9 * 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: `\u222b_{Ioo (-\u03c0) \u03c0} 1 = 2\u03c0`. -/\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\u03c0)\u207b\u00b9 exp (-(x^2 + y^2)/2)`. -/\ntheorem rl_pdf_mul (x y : \u211d) :\n gaussianPDFReal 0 1 x * gaussianPDFReal"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rl_measurableSet_disk",
+ "line": 377,
+ "source_header": "2) := by\n rw [hs, \u2190 Real.exp_add]\n congr 2\n ring\n\n/-- The closed disk `{p | p.1^2 + p.2^2 \u2264 a}` is measurable. -/\ntheorem rl_measurableSet_dis"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rl_measurableSet_radial",
+ "line": 382,
+ "source_header": "p.2 ^ 2 \u2264 a} :=\n measurableSet_le (by fun_prop) measurable_const\n\n/-- The set `{r | r^2 \u2264 a}` is measurable. -/\ntheorem"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rl_polar_integrand",
+ "line": 386,
+ "source_header": "\u211d | r ^ 2 \u2264 a} :=\n measurableSet_le (by fun_prop) measurable_const\n\n/-- In polar coordinates the disk integrand `p.1 \u2022 1_D (density \u2218 polarCoord.symm) p` is the\nradial function `1_{r^2 \u2264 a} (r (2\u03c0)\u207b\u00b9 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 : \u211d) (p : \u211d \u00d7 \u211d) :\n p.1 \u2022 Set.indicator {q : \u211d \u00d7 \u211d | q.1 ^ 2 + q.2 ^ 2 \u2264 a}\n (fun q => gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2) (polarCoord.symm p) =\n Set.indicator {r : \u211d | r ^ 2 \u2264 a}\n (fun r => r * ((2 * Real.pi)\u207b\u00b9"
+ },
+ {
+ "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 \u2265 0`, `Ioi 0 \u2229 {r | r^2 \u2264 a} = Ioc 0 (sqrt a)`. -/\ntheorem rl_Ioi_inter_eq (a : \u211d) (ha : 0 \u2264 a"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rl_disk_integral",
+ "line": 412,
+ "source_header": ".2 hr\u27e9\n \u00b7 rintro \u27e8h0, hr\u27e9\n exact \u27e8h0, (Real.le_sqrt h0.le ha).1 hr\u27e9\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\u03c0` and the radial\nintegral `(2\u03c0)\u207b\u00b9 (1 - exp (-a/2))`. -/\ntheorem rl_disk_integral (a : \u211d) (ha : 0 \u2264 a) :\n \u222b p in {p : \u211d \u00d7 \u211d | p.1 ^ 2 + p.2 ^ 2 \u2264 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 \u2297 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 : \u211d) (ha : 0 \u2264 a) :\n ((gaussianReal 0 1).prod (gaussianReal 0 1)) {p : \u211d"
+ },
+ {
+ "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\u03a9 (fun \u03c9 => (I.x \u03c9, I.y \u03c9)) I.P :=\n (tm_aemeasurable_triple I).snd\n\n/-- The law of `(x, y)` is `gaussianReal 0 1 \u2297 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 \u2218 (s, x, y)` is `(x, y)`). -/\ntheorem rl_law_xy (I : ConeMomentInterface) :\n @Measure.map _ _ I.m\u03a9 _"
+ },
+ {
+ "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 \u2264 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 : \u211d) :\n I.P {\u03c9 | I.x \u03c9 ^ 2 + I.y \u03c9 ^ 2 \u2264 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.\u03a9`, `I.m\u03a9`, `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: `\u222b t^2 = 5/3` (`Aux.c1_second_moment_gaussianReal`, shared with `ConeMomentD1Identity`,\nfrom `variance_fun_id_gaussianReal`),\n`\u222b 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 `\u222b 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 \u2265 0`, `P {x^2 + y^2 \u2264 a}` is the measure of the closed disk of radius `sqrt a`\nunder `gaussianReal 0 1 \u2297 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\u03c0` and the radial integral by the fundamental theorem of calculus); the\nright-hand side `\u222b_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 \u2264 a)` for `a \u2265 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 \u2264 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 `\u2264 N`\ngive, for every `k \u2264 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 {\u03b1 E F : Type*} [NormedAddCommGroup E] [NormedSpace \u211d E]\n [NormedAddCommGroup F] [CompleteSpace F] [NormedSpace \u211d F]\n {f : \u03b1 \u2192 E \u2192 F} {v : \u2115 \u2192 \u03b1 \u2192 \u211d} {N : \u2115\u221e} {U : Set E}\n (hU : IsOpen U) (hU' : IsPreconnected U)\n (hf : \u2200 i, ContDiff \u211d N (f i))\n (hv : \u2200 k : \u2115, (k : \u2115\u221e) \u2264 N \u2192 Summable (v k))\n (h'f : \u2200 (k : \u2115) (i : \u03b1) (x : E), (k : \u2115\u221e) \u2264 N \u2192 x \u2208 U \u2192\n \u2016iteratedFDeriv \u211d k (f i) x\u2016 \u2264 v k i)\n {k : \u2115} (hk : (k : \u2115\u221e) \u2264 N) {x : E} (hx : x \u2208 U) :\n iteratedFDeriv \u211d k (fun y => \u2211' n, f n y) x = \u2211' n, iteratedFDeriv \u211d k (f"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ib_pairingSum_mono",
+ "line": 114,
+ "source_header": "_tsum\n\n/-- The pairing sums are monotone in `r \u2265 0`: every term is a nonnegative multiple of `r^m`. -/\ntheorem ib_pairingSum_mono (q : \u2115) {r s : \u211d} (hr : 0 \u2264 r) (hrs : r \u2264 s) :\n pairingSum q r \u2264 pairing"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ib_pairingSum_le",
+ "line": 124,
+ "source_header": ")) hden\n\n/-- For `q \u2264 6` and `r \u2265 0`, `pairingSum q r \u2264 76 (1 + r)^6`. -/\ntheorem ib_pairingSum_le (q : \u2115) (hq : q \u2264 6) {r : \u211d} (hr : 0 \u2264 r) :\n pairingSum q r \u2264 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) \u2264 720 e^2 e^(-r^2/4)` for `r \u2265 0`: `(1 + r)^6 \u2264 6! e^(1 + r)` and\n`1 + r - r^2/2 \u2264 2 - r^2/4`, that is `(r - 2)^2 \u2265 0`. -/\ntheorem ib_poly_gauss_le {r : \u211d} (hr : 0 \u2264 r) :\n (1 + r) ^ 6 * Real.exp (-(r ^ 2) / 2) \u2264 720 * Real.exp 2 * Real.exp (-("
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ib_exp_shift_le",
+ "line": 149,
+ "source_header": ":= by ring\n\n/-- `exp(-\u2016z + v\u2016^2/4) \u2264 exp(\u2016z\u2016^2/4) exp(-\u2016v\u2016^2/8)`, from `\u2016v\u2016 \u2264 \u2016z + v\u2016 + \u2016z\u2016`. -/\ntheorem ib_exp_shift_le {d : \u2115} (z v : E d) :\n Real.exp (-(\u2016z + v\u2016 ^ 2) / 4) \u2264 Real.exp (\u2016z\u2016 ^ 2 / 4) * Real.exp (-("
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ib_exp_lattice_eighth",
+ "line": 161,
+ "source_header": "+ v\u2016 - \u2016z\u2016)]\n\n/-- `exp(-\u201624 n\u2016^2/8) = \u220f i, exp(-72 n_i^2)`. -/\ntheorem ib_exp_lattice_eighth (d : \u2115) (n : Fin d \u2192 \u2124) :\n Real.exp (-(\u2016latticeVec d n\u2016 ^ 2) / 8) = \u220f 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 \u2264 6` of a lattice translate of `Kinf d` is\nbounded by the summable family `C \u220f i, exp(-72 n_i^2)`. -/\ntheorem ib_translate_bound {d : \u2115} (k : \u2115) (hk : k \u2264 6) (n : Fin d \u2192 \u2124) {z : E d}\n (hz : z \u2208 Metric.ball (0 : E d) 1) :\n \u2016iteratedFDeriv \u211d k (Kinf d) (z + latticeVec d n)\u2016 \u2264\n 76 * (720 * Real.exp 2) * Real.exp (1 / 4) * \u220f 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 : \u2115) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ib_theta0_ge_one",
+ "line": 207,
+ "source_header": "simp [latticeVec]\n\n/-- `\u03b8(0) = \u2211_n exp(-\u201624 n\u2016^2/2) \u2265 1`: the summand at `n = 0` is `1` and the others are positive. -/\ntheorem ib_theta0_ge_one (d : \u2115)"
+ },
+ {
+ "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 : \u2115) :\n K24 d = fun z => \u2211' n : Fin d \u2192 \u2124, (thetaSum24 d 0)\u207b\u00b9 \u2022 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^\u221e`. -/\ntheorem ib_contDiff_term (d : \u2115) (c : \u211d) (n : Fin d \u2192 \u2124) :\n ContDiff \u211d \u221e (fun z : E d => c \u2022 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 : \u2115) (c : \u211d) (n : Fin d \u2192 \u2124) (z : E d) :\n iteratedFDeriv \u211d k (fun z : E d => c \u2022 Kinf d (z + latticeVec d n)) z =\n c \u2022 iteratedFDeriv \u211d 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 : \u2115) :\n Summable (fun n : Fin d \u2192 \u2124 =>\n 76 * (720 * Real.exp 2) * Real.exp (1 / 4) * \u220f 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 \u2264 c \u2264 1`. -/\ntheorem ib_term_bound {d : \u2115} {c : \u211d} (hc0 : 0 \u2264 c) (hc1 : c \u2264 1) (k : \u2115) (hk : k \u2264 6)\n (n : Fin d \u2192 \u2124) {z : E d} (hz : z \u2208 Metric.ball (0 : E d) 1) :\n \u2016iteratedFDeriv \u211d k (fun z : E d => c \u2022 Kinf d (z + latticeVec d n)) z\u2016 \u2264\n 76 * (720 * Real.exp 2) * Real.exp (1 / 4) * \u220f 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 : \u2115) (hq : q \u2264 6) :\n iteratedFDeriv \u211d q (K24 d) 0 =\n \u2211' n : Fin d \u2192 \u2124, (thetaSum24 d 0)\u207b\u00b9 \u2022 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 \u2265 1`. -/\ntheorem ib_intNormSq_ge_one {d : \u2115} {n : Fin d \u2192"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ib_lattice_term",
+ "line": 293,
+ "source_header": "eg _)\n (Finset.mem_univ i)\n\n/-- For `n \u2260 0`: `\u201624 n\u2016^6 exp(-\u201624 n\u2016^2/2) = 24^6 imageTerm d n`. -/\ntheorem ib_lattice_term (d : \u2115) {n : Fin d \u2192 \u2124} (hn : n \u2260 0) :\n \u2016latticeVec d n\u2016 ^ 6 * Real.exp (-(\u2016latticeVec 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 \u2260 0`: `exp(-\u201624 n\u2016^2/2) \u2264 imageTerm d n` (the factor `|n|^6 \u2265 1`). -/\ntheorem ib_gauss_le_image (d : \u2115) {n : Fin d \u2192 \u2124} (hn : n \u2260 0) :\n Real.exp (-(\u2016(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 \u00b7 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 : \u2203 j, u = R j`), every direction attached to a joint\ncoordinate is a frame vector `R j`. -/\ntheorem ec_mem_jetDirs {d : \u2115} {u : E d} {R : Fin d \u2192 E d} (hu : \u2203 j, u = R j)\n (x : JointIndex d) {v : E"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ec_length_jetDirs_le",
+ "line": 341,
+ "source_header": "\u00b7 exact \u27e8p.1.1, h\u27e9\n \u00b7 exact \u27e8p.1.2, h\u27e9\n\n/-- Each joint coordinate carries at most three directions. -/\ntheorem ec_length_jetDirs_le {d : \u2115} (u : E d) (R : Fin d \u2192 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 `\u221a2`: nonnegative and at most `\u221a2`. -/\ntheorem ec_svecScale_bounds {d : \u2115} (x : JointIndex d) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ec_scale_le",
+ "line": 360,
+ "source_header": "one, h1\u27e9\n \u00b7 exact \u27e8Real.sqrt_nonneg _, le_rfl\u27e9\n\n/-- `|svecScale a \u00b7 svecScale b \u00b7 (-1)^n| \u2264 2`. -/\ntheorem ec_scale_le {d : \u2115} (a b : JointIndex d) (n : \u2115) :"
+ },
+ {
+ "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^\u03c9`): the exponential of a polynomial. -/\nt"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "co_kinf_perm",
+ "line": 377,
+ "source_header": "ontDiff_exp.comp ((contDiff_norm_sq \u211d).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 : \u2115} (y : E d) (v : Fin n \u2192 E d) (\u03c3 : 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 \u03c3\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 : \u2115} (q : \u2115) (y : E d) (v : Fin q \u2192 E d) :\n iteratedFDeriv \u211d q (Kinf"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "co_latticeVec_neg",
+ "line": 401,
+ "source_header": "rw [h2, \u2190 mul_assoc, \u2190 pow_add, \u2190 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 : \u2115) (hq : q \u2264 6) (v : Fin q \u2192 E d) :\n iteratedFDeriv \u211d q (K24 d) 0 v =\n (thetaSum24 d 0)\u207b\u00b9 * \u2211"
+ },
+ {
+ "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 \u21a6 -n`, with `co_kinf_neg_apply`). -/\ntheorem co_K24_odd (d q : \u2115) (hq : q \u2264 6) (hodd :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "co_derivContraction_cast",
+ "line": 442,
+ "source_header": "_neg\n have h0 : \u2211' n, f n = 0 := by linarith\n rw [h0, mul_zero]\n\n/-- `derivContraction` through a length cast. -/\ntheorem co_derivContraction_cast {d : \u2115} (K : E d \u2192 \u211d) (x : E d) (l : List (E d)) (n : \u2115)\n (h : l.length = n) :\n derivContraction d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "co_rot",
+ "line": 449,
+ "source_header": "\u211d n K x (fun i => l.get (Fin.cast h.symm i)) := by\n subst h\n rfl\n\n/-- The block rotation `i \u21a6 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 : \u2115} (x : E d) (l\u2081 l\u2082 : 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 : \u2115} (l\u2081 l\u2082 : List (E d)) (hl : (l\u2081 ++ l\u2082).length \u2264 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\u2081 l\u2082\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 : \u2115} (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 : \u2115} (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| \u2264 c` bounds the quadratic form by `c \u00b7 card \u00b7 (x \u2b1d\u1d65 x)`. -/\ntheorem co_quad_le {\u03b9 : Type*} [Fintype \u03b9] (A : Matrix \u03b9 \u03b9 \u211d) {c : \u211d} (hc : 0 \u2264 c)\n (hA : \u2200 i"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "co_card_le",
+ "line": 571,
+ "source_header": "ul_of_nonneg_left h3 hc\n _ = c * Fintype.card \u03b9 * (x \u2b1d\u1d65 x) := by rw [h4]; ring\n\n/-- `card (JointIndex d) \u2264 13` for `d"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "co_margin",
+ "line": 582,
+ "source_header": "[JointIndex, Fintype.card_sum]\n rw [h2]\n have : d * d \u2264 9 := by nlinarith\n omega\n\n/-- The margin: `2 image"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "imageBound",
+ "line": 590,
+ "source_header": "eConstE * 13 \u2264 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 \u2208 {2, 3}`, every order `q \u2264 6`\nand every unit tuple `u`, `|D^q K_24(0) u - D^q K_\u221e(0) u| < imageConstE`.\nMethod: `D^q K_24(0) = \u03b8(0)\u207b\u00b9 \u2211_n D^q K_\u221e(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 `\u03b8(0)\u207b\u00b9 (\u2211_{n \u2260 0} D^q K_\u221e(24 n) u - (\u03b8(0) - 1) D^q K_\u221e(0) u)`, bounded, with\n`\u03b8(0) \u2265 1` (`Aux.ib_theta0_ge_one`) and `0 \u2264 \u03b8(0) - 1 \u2264 \u2211_{n \u2260 0} imageTerm d n` (`|n|^6 \u2265 1`,\n`Aux.ib_gauss_le_image`), by `76 \u00b7 24^6 \u00b7 1458 e^(-288) + 15 \u00b7 1458 e^(-288)` through the packet's\ntheorems\n`Side24Analysis.derivativeBoundAtLeastOne`, `derivativeBoundAtZero` and `latticeImageSumBound`,\nand `1458 (76 \u00b7 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 \u2209 {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 \u2208 {2, 3}` and every\northonormal frame `R` with `u = R 0`, `|C_24 a b - C_ref a b| \u2264 2 imageConstE` for every pair of\njoint coordinates.\nMethod: the two entries share the factor `svecScale a \u00b7 svecScale b \u00b7 (-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 \u2208 {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 `\u03b8(0)\u207b\u00b9 \u2211_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 \u21a6 -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 `\u0394 = C_24 - C_ref`, `|\u0394 a b| \u2264 2 imageConstE` (`entrywiseCovarianceBound`), so\n`|x \u2b1d \u0394 x| \u2264 2 imageConstE \u00b7 card \u00b7 (x \u2b1d x)` (Cauchy-Schwarz), the cardinality of the joint index\nis at most `d + 1 + d^2 \u2264 13` for `d \u2264 3` (its exact value `6` or `10` is not used), and\n`26 imageConstE (x \u2b1d x) \u2264 (epsilon / 3) (x \u2b1d x) \u2264 epsilon (x \u2b1d C_ref x)` (`Aux.co_margin` and\n`C_ref - I/3 \u2265 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 \u2264 epsilon / 3`, that is `78E \u2264 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 \u2265 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 \u2208 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 \u2208 block F i \u2194 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 \u2192 \u211d) :\n famPrice c (fullBlockFamily F) = \u2211 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} \u00d7\u02e2 (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 \u2208 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 \u2208 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 : \u211d) :\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 : \u211d) (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 : \u2115) {K : \u2115} (P : Fin b \u2192 Finset (Fin K)) :\n (\u2200 e \u2208 completeClutter b s, \u2200 \u2113 : Fin K, \u2203 i \u2208 e, \u2113 \u2209 P i) \u2194\n \u2200 \u2113 : Fin K, (univ.filter (fu"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sum_card_eq_sum_fiber",
+ "line": 147,
+ "source_header": "have := h \u2113\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 : \u2115} (P : Fin b \u2192 Finset (Fin K)) :\n \u2211 i, (P i).card = \u2211 \u2113 : 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 : \u2115} {d : Fin b \u2192 \u2115}\n (hK : IsPaletteFeasible b (completeClutter b s) d K) :\n (\u2200 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 : \u2115}"
+ },
+ {
+ "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 : \u2115} (d : Fin b \u2192 \u2115) {i i' : Fin b} (h : i < i') :\n prefi"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "prefixSum_add_le",
+ "line": 187,
+ "source_header": "\u00b7 exact h\n \u00b7 exact hj.trans h\n\ntheorem prefixSum_add_le {b : \u2115} (d : Fin b \u2192 \u2115) (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 := \u27e8n % K, Nat.mod_lt _ hK\u27e9\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 : \u2115} (d : Fin b \u2192 \u2115) (K : \u2115) (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 : \u2115} (d : Fin b \u2192 \u2115) (K : \u2115) (hK : 0 < K) (i : Fin b) (\u2113 : Fin K) :\n \u2113 \u2208 cycPalette d K hK i \u2194\n \u2203 n, n \u2208 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 : \u2115} (d : Fin b \u2192 \u2115) (K : \u2115) (hK : 0 < K) (i : Fin b)\n (hd : d i \u2264 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 `\u2113` (or `0` if there is none). -/\nnoncomputable def firstPos {b : \u2115} (d :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "firstPos_spec",
+ "line": 230,
+ "source_header": "i) \u2227 n % K = \u2113 then Nat.find h else 0\n\ntheorem firstPos_spec {b : \u2115} (d : Fin b \u2192 \u2115) (K \u2113 : \u2115) (i : Fin b)\n (hex : \u2203 n, n \u2208 Ico (prefixSum d i) (prefixSum d i + d i) \u2227 n % K = \u2113) :\n firstPos d K \u2113 i \u2208 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 : \u2115} (hK : 0 < K) (hD : D \u2264 s * K) (\u2113 : \u2115) :\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 : \u2115} (d : Fin b \u2192 \u2115) (hdK : \u2200 i, d i \u2264 K)\n (hsum : \u2211 i, d i \u2264 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 : \u2115) (d : Fin b \u2192 \u2115) (hs : 1 \u2264 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 : \u2211 i, d i \u2264 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 : \u2115} (H : Finset (Finset (Fin b))) (d : Fin b \u2192 \u2115)\n (hH : \u2200 e \u2208 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 `\u2265 2`). -/\ntheorem isPaletteFeasible_mono {b : \u2115} (H : Finset (Finset (Fin b))) (d : Fin b \u2192 \u2115)\n (hH : \u2200 e \u2208 H, 2 \u2264 e.card) {K K' : \u2115} (hKK' : K \u2264 K')\n (h : IsPale"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "isPaletteFeasible_paletteNumber",
+ "line": 369,
+ "source_header": ", _, hcast\u27e9 := hmem\n rw [\u2190 hcast]\n simp\n\n/-- The palette number is attained and bounded by `sum d_i` when every edge has size `\u2265 2`. -/\ntheorem isPaletteFeasible_paletteNumber {b : \u2115} (H : Finset (Finset (Fin b))) (d : Fin b \u2192 \u2115)\n (hH : \u2200 e \u2208 H, 2 \u2264 e.ca"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "isPaletteFeasible_of_paletteNumber_le",
+ "line": 376,
+ "source_header": "\u27e8\u2211 i, d i, isPaletteFeasible_sum H d hH\u27e9\n exact h\n\ntheorem isPaletteFeasible_of_paletteNumber_le {b : \u2115} (H : Finset (Finset (Fin b)))\n (d : Fin b \u2192 \u2115) (hH : \u2200 e \u2208 H, 2 \u2264 e.card) {K : \u2115} (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 : \u2115} (H : Finset (Finset (Fin b))) (d : Fin b \u2192 \u2115)\n {K : \u2115} (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 \u2229 X_i| \u2264 a_i |P_i|`: `P_i` is the set of\nparts meeting `X_i`. -/\ntheorem palette_of_decomposable {K : \u2115} {U : Finset X} (h : IsKDecomposable F K U) :\n \u2203 P : Fin F.b \u2192 Finset (Fin K), (\u2200 i, (U \u2229 block F i).card \u2264 F.a i * (P i)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "idxIn",
+ "line": 426,
+ "source_header": "em_image]\n exact \u27e8v, hv.1, blk_eq_of_mem_block hv.2\u27e9\n\n/-- The index of `v` within `U \u2229 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 \u2229 block F i).equivFin \u27e8v, h\u27e9).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 \u2208 U \u2229 block F i) (hw : w \u2208 U \u2229 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 : \u2115} (P : Fin b"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "labOf_mem",
+ "line": 449,
+ "source_header": ").card then some ((P i).orderEmbOfFin rfl \u27e8r, h\u27e9) else none\n\ntheorem labOf_mem {b K : \u2115} (P : Fin b \u2192 Finset (Fin K)) (i : Fin b) ("
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "labOf_inj",
+ "line": 457,
+ "source_header": "n.some_inj] at h\n rw [\u2190 h]\n exact orderEmbOfFin_mem _ _ _\n\ntheorem labOf_inj {b K : \u2115} (P : Fin b \u2192 Finset (Fin K)) (i : Fin b) {r r' : \u2115} {\u2113 : 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 : \u2115} (P : Fin b \u2192 Finset (Fin K)) (i : Fin b) {r"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "colOf",
+ "line": 471,
+ "source_header": "= some \u2113 := by\n unfold labOf\n split_ifs\n exact \u27e8_, rfl\u27e9\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 : \u2115"
+ },
+ {
+ "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 `\u2113` 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 \u2113)\n\ntheorem colOf_isSome (hF : IsRealizedFamily F) {U : Finset X} {K : \u2115}\n {P : Fin F.b \u2192 Finset (Fin K)} (hcard : \u2200 i, (U \u2229 block F i).card \u2264 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 : \u2115}\n {P : Fin F.b \u2192 Finset (Fin K)}\n (hedge : \u2200 e \u2208 F.H, \u2200 \u2113 : 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 _ \u2113 h1)\n\ntheorem partOf_disjoint (F : RealizedData X) (U : Finset X) {K : \u2115}\n (P : Fin F.b \u2192 Finset (Fin K)) {\u2113 \u2113' : Fin K}"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "biUnion_partOf",
+ "line": 554,
+ "source_header": "] at hv hv'\n apply h\n rw [\u2190 Option.some_inj, \u2190 hv.2, \u2190 hv'.2]\n\ntheorem biUnion_partOf (hF : IsRealizedFamily F) {U : Finset X} {K : \u2115}\n {P : Fin F.b \u2192 Finset (Fin K)} (hcard : \u2200 i, (U \u2229 block F i).card \u2264 F.a i * (P i)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "decomposable_of_palette",
+ "line": 566,
+ "source_header": "me hF hcard hv\n exact \u27e8\u2113, mem_univ _, mem_filter.2 \u27e8hv, h\u2113\u27e9\u27e9\n\n/-- A palette with `|U \u2229 X_i| \u2264 a_i |P_i|` yields a `K`-decomposition of `U`. -/\ntheorem decomposable_of_palette (hF : IsRealizedFamily F) {K : \u2115} {U : Finset X}\n (P : Fin F.b \u2192 Finset (Fin K)) (hcard : \u2200 i, (U \u2229 block F i).card \u2264 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\u27e9\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| \u2264 a_i k}`, in expanded form. -/\ntheorem localDecomposability_expanded (hF : IsRealizedFamily F) (i : Fin F.b) (k : \u2115)\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 \u2208 supp F U \u2194 \u2203 v \u2208 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": "\u27e8hw, hb\u27e9\n \u00b7 rintro \u27e8hw, hb\u27e9\n refine \u27e8\u27e8fun hwv => h (hwv \u25b8 hb), hw\u27e9, hb\u27e9\n\n/-- Proposition P1 in expanded form. -/\ntheorem minimalForbidden_iff (hF : IsRealizedFamily F) (U : Finset X) :\n IsMinimalForbidden F U \u2194"
+ },
+ {
+ "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 \u00d7 Fin 409)) :\n IsMinimalForbidden benchmark816 U \u2194\n ((\u2203 i, U \u2286 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 \u00d7 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 \u27e8v, hv, blk_eq_of_mem_block (hU hv)\u27e9\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 {\u03b9 \u03b2 : Type} [Fintype \u03b9] [DecidableEq \u03b9] [Fintype \u03b2] [DecidableEq \u03b2]\n\n/-- The candidate transversals of `e` in a product ground type: the images of `e` under\n`i \u21a6 (\u03c3 i, g i)` for `g` ranging over a product set (`b\u2080` is a dummy value off `e`). -/\ndef transOf (F : RealizedData (\u03b9"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sigma_injective",
+ "line": 825,
+ "source_header": "un i => (\u03c3 i, g i)))\n\nomit [Fintype \u03b9] [DecidableEq \u03b9] [Fintype \u03b2] [DecidableEq \u03b2] in\ntheorem sigma_injective {F : RealizedData (\u03b9 \u00d7 \u03b2)} {\u03c3 : Fin F.b \u2192 \u03b9} (b\u2080 : \u03b2)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "mem_transOf",
+ "line": 831,
+ "source_header": "\u03c3 _ _).2 rfl\n have hj : F.blk (\u03c3 i, b\u2080) = j := (h\u03c3 _ _).2 h\n exact hi.symm.trans hj\n\ntheorem mem_transOf {F : RealizedData (\u03b9 \u00d7 \u03b2)} {\u03c3 : Fin F.b \u2192 \u03b9} {b\u2080 : \u03b2}\n (h\u03c3 : \u2200 (v : \u03b9 \u00d7 \u03b2) (i : Fin F.b), F.blk v = i \u2194 v.1 = \u03c3 i) (e : Fi"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "card_transOf",
+ "line": 902,
+ "source_header": ")\n rw [mem_image]\n exact \u27e8F.blk v, hv1, this.symm\u27e9\n\nomit [Fintype \u03b9] in\ntheorem card_transOf {F : RealizedData (\u03b9 \u00d7 \u03b2)} {\u03c3 : Fin F.b \u2192 \u03b9} {b\u2080 : \u03b2}\n (h\u03c3 : \u2200 (v : \u03b9 \u00d7 \u03b2) (i : Fin F.b), F.blk v = i \u2194 v.1"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "h\u03c3816",
+ "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\u03c3816 : \u2200 (v : Fin 6 \u00d7 Fin 409) (i : Fin benchmar"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "transAll816",
+ "line": 945,
+ "source_header": "6.blk v = i \u2194 v.1 = (fun i => i : Fin benchmark816.b \u2192 Fin 6) i :=\n fun _ _ => Iff.rfl"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "mem_transAll816",
+ "line": 949,
+ "source_header": "nset (Fin 6 \u00d7 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 \u00d7 Fin 409)"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "minForbSet4_eq",
+ "line": 1008,
+ "source_header": "\u27e8Or.inl \u27e8i, hUi, hcard\u27e9, ?_\u27e9\n rw [supp_eq_singleton_of_pair hUi hcard, card_singleton]\n\ntheorem minForbSet4_eq :\n {U : Finset (Fin 6 \u00d7 Fin 409) |"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "benchmark816IsRealized",
+ "line": 1027,
+ "source_header": "r \u27e8e, he, hsupp, hone\u27e9, ?_\u27e9\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\u27e9\n rw [Aux.famPrice_const_benchmark816, one_div, div_eq_mul_inv, \u2190 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 \u2264 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 \u00b7 exfalso\n exact h (by norm_num)\n \u00b7 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 \u2264 K` and `sum d_i \u2264 s K`; the\ncyclic palette (block `i` takes positions `c_i, \u2026, 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 \u2264 b` and `1 \u2264 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 \u23083/1\u2309\u208a = 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 \u23082448/3\u2309\u208a = 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 \u2286 X_i` into `k` good parts has parts of size `\u2264 a_i`; conversely\nthe chunks of size `\u2264 a_i` of an enumeration of `S` are good (one block, support of size `\u2264 1`\ncontains no edge of size `\u2265 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 \u00b7 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 \u2229 X_i| \u2264 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) \u2264 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": "\u2229 block F i).card \u2264 F.a i * F.d i := by omega\n _ \u2264 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 _ \u2264 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 \u23082454/3\u2309\u208a = 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 \u00b7 rw [h 818, hpal]\n \u00b7 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 \u2286 X_i` with `|U| = a_i + 1` (removing any\noutside vertex or any vertex keeps the violation); otherwise an edge `e \u2286 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 `\u2264 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 \u21a6 (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 : \u2115) (n : Fin d \u2192 \u2124) (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/-- `\u201624 n\u2016^2 = 576 * \u2211 i, n_i^2` (`EuclideanSpace.norm_sq_eq`, coordinatewise). -/\ntheorem th_norm_latticeVec_sq (d : \u2115) (n : Fin d \u2192 \u2124) :\n \u2016latticeVec d n\u2016 ^ 2 = 576 * intN"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "th_exp_neg_norm_latticeVec_sq",
+ "line": 100,
+ "source_header": "s]\n ring\n\n/-- `exp(-\u201624 n\u2016^2/4) = \u220f i, exp(-144 n_i^2)`, by `Real.exp_sum` and the previous lemma. -/\ntheorem th_exp_neg_norm_latticeVec_sq (d : \u2115) (n : Fin d \u2192 \u2124) :\n Real.exp (-(\u2016latticeVec d n\u2016 ^ 2) / 4) = \u220f i, Real.exp (-144 * ((n i : \u2124"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "th_summable_gauss_int",
+ "line": 109,
+ "source_header": "> ?_\n ring\n\n/-! ### (b) One-dimensional Gaussian summability on `\u2124` -/\n\n/-- `m \u21a6 exp(-c m^2)` is summable on `\u2124` for `c > 0`: Mathlib's\n`HurwitzKernelBounds.summable_f_int 0 0` at `t = c/\u03c0` after `-\u03c0 m^2 (c/\u03c0) = -c m^2`. -/\ntheorem th_summable_gauss_int (c : \u211d) (hc : 0 < c) :\n Summable (fun m : \u2124 => 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 \u2192 \u2124` -/\n\n/-- For a nonnegative summable `g : \u2124 \u2192 \u211d`, the product `n \u21a6 \u220f i, g (n i)` is summable over\n`Fin d \u2192 \u2124`: a finite set `s` of lattice points lies in the box `Fintype.piFinset t` with\n`t i = s.image (\u00b7 i)`, over which the sum factors as `\u220f i, \u2211 m \u2208 t i, g m \u2264 (\u2211' m, g m)^d`. -/\ntheorem th_summable_pi_prod (d : \u2115) (g : \u2124 \u2192 \u211d) (hg0 : \u2200 m, 0 \u2264 g m) (hg : Summable g) :\n Summable (fun n : Fin d \u2192"
+ },
+ {
+ "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(-\u2016z + v\u2016^2/2) \u2264 exp(\u2016z\u2016^2/2) exp(-\u2016v\u2016^2/4)`: from `\u2016v\u2016 \u2264 \u2016z + v\u2016 + \u2016z\u2016` one has\n`\u2016v\u2016^2/4 \u2264 (\u2016z + v\u2016 + \u2016z\u2016)^2/4 \u2264 \u2016z + v\u2016^2/2 + \u2016z\u2016^2/2`. -/\ntheorem th_exp_shift_le (d : \u2115) (z v : E d) :\n Real.exp (-(\u2016z + v\u2016 ^ 2) / 2) \u2264 Real.exp (\u2016z\u2016 ^ 2 / 2) * Re"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "th_summable_dominant",
+ "line": 159,
+ "source_header": "nonneg (\u2016z + v\u2016 - \u2016z\u2016)]\n\n/-- The dominating family `n \u21a6 exp(\u2016z\u2016^2/2) \u220f i, exp(-144 n_i^2)` is summable over\n`Fin d \u2192 \u2124`. -/\ntheorem th_summable_dominant (d : \u2115) (z : E d) :\n Summable (fun n : Fin d \u2192 \u2124 =>\n Real.exp (\u2016z\u2016 ^ 2 / 2) * \u220f 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 : \u2115) (z : E d) (n : Fin d \u2192 \u2124) :\n Real.exp (-(\u2016z + latticeVec d n\u2016 ^ 2) / 2) \u2264\n Real.exp (\u2016z\u2016 ^ 2 / 2) * \u220f 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 (-\u2016\u00b7\u2016^2 / 2)` is `C^\u221e` 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 \u2022 (-(innerSL \u211d x))`, i.e.\n`v \u21a6 -\u27eax, v\u27eb Kinf d x`. -/\ntheorem dp_hasFDerivAt_Kinf (d : \u2115) (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 : \u2115) :\n fderiv \u211d (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 \u211d y)` -/\n\n/-- `y \u21a6 -(innerSL \u211d y)` is `C^\u221e` (it is a continuous linear map). -/\ntheorem dp_contDiff_g (d : \u2115) : Con"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "dp_g_eq",
+ "line": 214,
+ "source_header": "inuousLinearMap.contDiff (innerSL \u211d)).neg\n\n/-- The factor as the coercion of the continuous linear map `-(innerSL \u211d)`. -/\ntheorem dp_g_eq (d : \u2115) :\n (fun y"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "dp_norm_g_zero",
+ "line": 220,
+ "source_header": "erSL \u211d (E := E d))) := by\n funext y\n simp\n\n/-- Order zero: `\u2016g x\u2016 = \u2016x\u2016` (`innerSL_apply_norm`). -/\ntheorem dp_norm_g_zero (d : \u2115) (x : E d) :\n \u2016iteratedFDeriv"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "dp_norm_g_one",
+ "line": 225,
+ "source_header": "tedFDeriv_zero, norm_neg, innerSL_apply_norm]\n\n/-- Order one: `\u2016D g x\u2016 = \u2016innerSL \u211d\u2016 \u2264 1` (`norm_innerSL_le`). -/\ntheorem dp_norm_g_one (d : \u2115) (x : E d) :\n \u2016iteratedFD"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "dp_g_higher",
+ "line": 231,
+ "source_header": "Map.fderiv, norm_neg]\n exact norm_innerSL_le \u211d\n\n/-- Orders `k \u2265 2` of the linear factor vanish. -/\ntheorem dp_g_higher (d : \u2115) (x : E d) (k : \u2115) (hk : 2 \u2264 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 = \u2016D^q Kinf (x)\u2016`:\n`b_{q+2} \u2264 \u2016x\u2016 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 : \u2115) (x : E d) (q : \u2115) :\n \u2016iteratedFDeriv \u211d (q + 2) (Kinf d) x\u2016 \u2264\n \u2016x\u2016 * \u2016iteratedFDeriv \u211d (q + 1) (Kinf d) x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "dp_Kinf_pos",
+ "line": 269,
+ "source_header": "l_nonneg (by positivity : (0 : \u211d) \u2264 (q : \u211d) + 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 : \u2115) (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 * \u2016x\u2016`. -/\ntheorem dp_b1 (d : \u2115)"
+ },
+ {
+ "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 \u2264 Kinf d x * (\u2016x\u2016^2 + 1)`. -/\ntheorem dp_b2 (d : \u2115) (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 \u2264 Kinf d x * (\u2016x\u2016^3 + 3 \u2016x\u2016)`. -/\ntheorem dp_b3 (d : \u2115) (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 \u2264 Kinf d x * (\u2016x\u2016^4 + 6 \u2016x\u2016^2 + 3)`. -/\ntheorem dp_b4 (d : \u2115) (x : E d) :\n \u2016iter"
+ },
+ {
+ "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 \u2264 Kinf d x * (\u2016x\u2016^5 + 10 \u2016x\u2016^3 + 15 \u2016x\u2016)`. -/\ntheorem dp_b5 (d : \u2115) (x : E d) :\n \u2016iteratedFD"
+ },
+ {
+ "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 \u2264 Kinf d x * (\u2016x\u2016^6 + 15 \u2016x\u2016^4 + 45 \u2016x\u2016^2 + 15)`. -/\ntheorem dp_b6 (d : \u2115) (x : E d) :\n \u2016iteratedFDeriv \u211d 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 \u2264 6`, `b_q \u2264 Kinf d x * pairingSum q \u2016x\u2016`: the explicit bounds `dp_b0` to `dp_b6`\nmatch the unfolded pairing sums (`Finset.sum_range_succ`, `Nat.factorial`). -/\ntheorem dp_pairing_all (d : \u2115) (x : E d) (q : \u2115) (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 `\u220f \u2016u i\u2016 = 1`). -/\ntheorem dp_abs_le_opNorm (d q : \u2115) (x : E d) (u : Fin q \u2192 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| \u2265 1` (`DerivativeBoundAtLeastOne`) -/\n\n/-! ### The elementary pairing-sum bound at `r \u2265 1` -/\n\n/-- For `q \u2264 6` and `1 \u2264 r`, `pairingSum q r \u2264 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, \u2026, 6`; every monomial `r^k`, `k \u2264 6`, is at most `r^6`\n(`pow_le_pow_right\u2080`, `one_le_pow\u2080`). -/\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 \u2264 \u2016x\u2016` the pairing bound\n`|D^q Kinf (x) u| \u2264 exp(-\u2016x\u2016\u00b2/2) \u00b7 pairingSum q \u2016x\u2016` and `pairingSum q \u2016x\u2016 \u2264 76 \u2016x\u2016^6`\n(`d1_pairingSum_le_of_one_le`) give the Prop by `mul_le_mul_of_nonneg_left` with\n`0 \u2264 exp(-\u2016x\u2016\u00b2/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 * \u2016x\u2016 ^ 6 * Real.exp (-(\u2016x\u2016 ^ 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 \u2264 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 `\u20160\u2016 = 0` and `exp (-(0 ^ 2) / 2) = 1`, and bound\n`pairingSum q 0 \u2264 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)\u2016 = 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 (-\u2016\u00b7\u2016^2 / 2)` is `C^\u221e` ("
+ },
+ {
+ "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 \u211d)) 2)\n\n/-- The Fr\u00e9chet derivative of `Kinf d` at `y`, as `HasFDerivAt` (chain rule through\n`hasStrictFDerivAt_norm_sq` and `HasFDerivAt.exp`). -/\ntheorem rb_hasFDerivAt_kinf {d : \u2115} (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 \u211d (Kinf d) y v = -(\u27eay, v\u27eb * 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^\u221e` real function `f`, `D^{n+1} f x [m] = D^n (y \u21a6 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 : \u2115} (f : E d \u2192 \u211d) (hf : ContDiff \u211d (\u22a4 : \u2115\u221e) f) (n : \u2115) (x : E d)\n (m : Fin (n + 1) \u2192 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 : \u2115} (v : E d) : ContDiff \u211d (\u22a4 : \u2115\u221e) (fun y : E d => \u27eay, v\u27eb) :=\n contDiff_id.inner \u211d contDiff_const\n\n/-! ### (c) Level one: `g\u2081 y = -(\u27eay, v\u27eb Kinf d y)` -/\n\n/-- Smoothness of the level-one"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rb_fderiv_g1",
+ "line": 487,
+ "source_header": ":\n ContDiff \u211d (\u22a4 : \u2115\u221e) (fun y : E d => -(\u27eay, v\u27eb * 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 : \u2115} (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\u2082 y = -(\u27eaw, v\u27eb Kinf d y) + \u27eay, v\u27eb \u27eay, w\u27eb 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 : \u2115} (v w y a : E d) :\n fderiv \u211d (fun y : E d => -(\u27eaw, v\u27eb * Kinf d y) + \u27eay, v\u27eb * \u27eay, w\u27eb * 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 : \u2115} (v w a c : E d) :\n fderiv \u211d (fun y : E d => \u27eaw, v\u27eb * \u27eay, a\u27eb * Kinf d y\n + (\u27eaa, v\u27eb * \u27eay, w\u27eb + \u27eay, v\u27eb"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rb_order_four",
+ "line": 543,
+ "source_header": "inner \u211d (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 `\u27eaw, v\u27eb\u27eac, a\u27eb + \u27eaa, v\u27eb\u27eac, w\u27eb + \u27eac, v\u27eb\u27eaa, w\u27eb`. -/\ntheorem rb_order_four {"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rb_P3_contDiff",
+ "line": 569,
+ "source_header": "a, v\u27eb * \u27eay, w\u27eb + \u27eay, v\u27eb * \u27eaa, w\u27eb) * Kinf d y\n - \u27eay, v\u27eb * \u27eay, w\u27eb * \u27eay, a\u27eb * 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 \u27eau,u\u27eb \u27eay,u\u27eb - \u27eay,u\u27eb^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 : \u2115} (u y : E d) :\n fderiv \u211d (fun y : E d => (3 * \u27eau, u\u27eb * \u27eay, u\u27eb - \u27eay, u\u27eb * \u27eay, u\u27eb * \u27eay,"
+ },
+ {
+ "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 : \u2115} (u : E d) : ContDiff \u211d"
+ },
+ {
+ "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 : \u2115} (u y : E d) :\n fderiv \u211d (fun y : E d => (3 * \u27eau, u\u27eb * \u27eau, u\u27eb - 6 * \u27eau, u\u27eb * (\u27eay, u\u27eb * \u27eay, u\u27eb)\n + \u27eay, u\u27eb * \u27eay, u\u27eb * \u27eay, u\u27eb * \u27eay, u\u27eb) * 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 \u27eau, u\u27eb^3`. -/\ntheorem rb_fderiv_P5_zero {d : \u2115} (u : E d) :\n fderiv \u211d (fun y : E d => (-15 * (\u27eau, u\u27eb * \u27eau, u\u27eb) * \u27eay, u\u27eb\n + 10 * \u27eau,"
+ },
+ {
+ "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 * \u27eau, u\u27eb * (\u27eay, u\u27eb * \u27eay, u\u27eb * \u27eay, u\u27eb)\n - \u27eay, u\u27eb * \u27eay, u\u27eb * \u27eay, u\u27eb * \u27eay, u\u27eb * \u27eay, u\u27eb) * 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 \u211d (fun y : E d => -(\u27eay, b\u27eb * Kinf d y)) 0 a = -\u27eaa, b\u27eb\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, \u2026, 1)`. -/\ntheorem rb_pinCov {d : \u2115} (h"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rb_thirdGradCov",
+ "line": 710,
+ "source_header": "j\n norm_num\n \u00b7 simp [Ne.symm hj]\n \u00b7 by_cases hj : j = \u27e80, hd\u27e9\n \u00b7 subst hj\n simp [hi, Ne.symm hi]\n \u00b7 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, \u2026, 0)`. -/\ntheorem rb_thir"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rb_thirdVar",
+ "line": 722,
+ "source_header": "rb_order_four, hite]\n by_cases hj : j = \u27e80, hd\u27e9\n \u00b7 simp [hj]; norm_num\n \u00b7 have hj' : \u00ac ((\u27e80, hd\u27e9 : 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 \u211d R) :\n thirdVar d (Kinf d) (R \u27e80, hd\u27e9) = 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, \u2026, 1)) = 3` (the single `3"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rp_density_algebra",
+ "line": 748,
+ "source_header": "(d : \u2115) (hd : 0 < d) :\n (Matrix.diagonal fun i : Fin d => if i = \u27e80, hd\u27e9 then (3 : \u211d) 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, \u2026, 1)`: `(2\u03c0)^(-d/2) \u00b7 (2\u03c0)^(-d/2) \u00b7 3^(-1/2) = (2\u03c0)^(-d) / \u221a3`. -/\ntheorem rp_density_algebra (d : \u2115) (hd : 0 < d) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rp_referencePinDensityProduct_of_blockIdentities",
+ "line": 762,
+ "source_header": "2 = -(d : \u211d) by ring,\n show (-1 : \u211d) / 2 = -(1 / 2) by norm_num, Real.rpow_neg (by norm_num : (0 : \u211d) \u2264 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, \u2026, 1)` (for `d \u2208 {2, 3}` and orthonormal `R`), by\nrewriting the blocks and `rp_density_algebra`. -/\ntheorem rp_referencePinDensityProduct_of_blockIdentities\n (hblk : \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192 \u2200 (hd : 0 < d) (R : Fin d \u2192 E d), Orthonormal \u211d R \u2192\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 \u27e8hG, hV\u27e9 := 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, \u2026, 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 \u27e8hG, -, -, hV, -\u27e9 := h d hd23 hd R hR\n exact \u27e8hG, hV\u27e9\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 : \u211d)"
+ },
+ {
+ "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 : \u211d) := 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": ": \u211d) < 1 - epsilon := by\n have := ir_epsilon_lt\n linarith\n\n/-- `1 \u2264 1 + epsilon`. -/\ntheorem ir_one_le_one_add_epsilon : (1 : \u211d) \u2264 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 \u2264 5`, `(1 + epsilon)^b \u2264 (1 + epsilon)^5`: monotonicity of the real\npower in the exponent for a base `\u2265 1` (`R"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ir_bernoulli",
+ "line": 824,
+ "source_header": "(1 + epsilon) ^ b \u2264 (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 : \u211d) = ((5 : \u2115) : \u211d) 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\u03b5 := ir_epsilon_lt\n have h := one_add_mul_self_le_rpow_one_add (show (-1 : \u211d) \u2264 -epsilon by linarith) ha\n rw [show (1 : \u211d) + -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 \u2264 1 - 5 epsilon`, exact rational arithmetic. -/\ntheorem ir_lower_rational : (1 - 13 * epsilon) * (1 + epsilon) ^ 5 \u2264 1 - 5 * epsilon := by\n u"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ir_lower_bound",
+ "line": 844,
+ "source_header": "+ epsilon)^5 \u2264 (1 + 28 epsilon)(1 - 5 epsilon)`, exact rational arithmetic. -/\ntheorem ir_upper_rational : (1 + epsilon) ^ 5 \u2264 (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 \u2264 a \u2264 5` and `1 \u2264"
+ },
+ {
+ "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 _ \u2264 1 - 5 * epsilon := ir_lower_rational\n _ \u2264 1 - a * epsilon := by linarith\n _ \u2264 (1 - epsilon) ^ a := ir_bernoulli a ha1\n\n/-- Upper bound: for `a \u2264 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 _ \u2264 (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 \u2264 a \u2264 5` and `1 \u2264 b \u2264 5`. -/\ntheorem ir"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "ir_exponentA_two",
+ "line": 883,
+ "source_header": ": b \u2264 5) :\n 1 - 13 * epsilon \u2264 (1 - epsilon) ^ a / (1 + epsilon) ^ b \u2227\n (1 + epsilon) ^ a / (1 - epsilon) ^ b \u2264 1 + 28 * epsilon :=\n \u27e8ir_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) \u2264 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": "\u211d) + 1) ^ 9 * Real.exp (-288 * ((n : \u211d) + 1) ^ 2)) :=\n h1\n _ \u2264 (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 : \u211d) \u2264 n := by positivity\n have h1 : (1 : \u211d) \u2264 (n : \u211d) + 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 : \u211d) \u2264 n := by positivity\n have h1 : (1 : \u211d) \u2264 ((n : \u211d) + 1) ^ 9 := one_le_pow\u2080 (by linarith)\n exact le_mul_of_one_le_left (Real.exp_pos _).le h1\n\n/-! ### (b) One-dimensional sums over `\u2124` -/\n\n/-- A nonnegative `\u03c6 : \u2124 \u2192 \u211d` whose values at `n+1` and at `-(n+1)` are at most\n`exp(-288) (1/2)^n` is summable over `\u2124`, with `\u2211' \u03c6 \u2264 \u03c6 0 + 4 exp(-288)`: split `\u2124` into `\u2115`\nand the negatives (`tsum_of_nat_of_neg_add_one`), peel off `\u03c6 0` (`Summable.tsum_eq_zero_add`)\nand compare both tails with the geometric series (`tsum_geometric_two`). -/\ntheorem li_summable_int_tsum_le (\u03c6 :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "li_gauss_int",
+ "line": 981,
+ "source_header": "ve hsum2 : \u2211' n : \u2115, \u03c6 (-((n : \u2124) + 1)) \u2264 2 * Real.exp (-288) := by\n rw [\u2190 hgeo_sum]\n exact hs2.tsum_le_tsum hneg hgeo\n refine \u27e8Summable.of_nat_of_neg_add_one hs0 hs2, ?_\u27e9\n rw [tsum_of_nat_of_neg_add_one hs0 hs2]\n linarith\n\n/-- The Gaussian weight `m \u21a6 exp(-288 m^2)` is su"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "li_pow_gauss_int",
+ "line": 1002,
+ "source_header": "ine \u27e8h.1, h.2.trans ?_\u27e9\n have he := UniversalLaw.Proofs.Side24Elementary.Aux.exp_neg_lt\n have hp : (1 : \u211d) / 10 ^ 125 \u2264 1 / 4 := by norm_num\n have h0 : Real.exp (-288 * ((0 : \u2124) : \u211d) ^ 2) = 1 := by simp\n simp only [h0]\n linarith\n\n/-- The weight `m \u21a6 m^6 exp(-288 m^2)` is summable over `\u2124` 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 \u27e8h.1, h.2.trans ?_\u27e9\n simp\n\n/-! ### (c) Finite sums of products over `Fin d \u2192 \u2124` -/\n\n/-- For `h : Fin d \u2192 \u2124 \u2192 \u211d` nonnegative and summable in each coordinate, the sum of\n`\u220f k, h k (n k)` over a finite set `s` of lattice points is at most `\u220f k, \u2211' m, h k m`: `s` lies\nin the box `Fintype.piFinset (fun k => s.image (\u00b7 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 _ = \u220f k, \u2211 m \u2208 t k, h k m := (Finset.prod_univ_sum t fun k m => h k m).symm\n _ \u2264 \u220f k, \u2211' m, h k m :=\n Finset.prod_le_prod\u2080 (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 [\u2190 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 : \u2115) (n : Fin d \u2192 \u2124) :\n \u220f k : Fin d, Real.exp (-288 * ((n k : \u2124) : \u211d) ^ 2) = Real.exp (-288 * intNormSq d n) := by\n rw [\u2190 Real.exp_sum, intNormSq, Finset.mul_sum]\n\n/-! ### (d) The pointwise domination for `d \u2264 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 (\u2211 i, a i) ^ 3 \u2264 (\u2211 i, a i ^ 3) * (d : \u211d) ^"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "li_imageTerm_le",
+ "line": 1084,
+ "source_header": "`imageTerm d n \u2265 0`. -/\ntheorem li_imageTerm_nonneg (d : \u2115) (n : Fin d \u2192 \u2124) : 0 \u2264 imageTerm d n := by\n unfold imageTerm\n split_ifs\n \u00b7 exact le_rfl\n \u00b7 exact mul_nonneg (pow_nonneg (Finset.sum_nonneg fun i _ => sq_nonneg _) 3) (Real.exp_pos _).le\n\n/-- Pointwise domination for `d \u2264 3`: `imageTerm d n \u2264 9 \u2211 i, \u220f 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 \u2260 i`. Each product equals\n`(n_i^2)^3 exp(-288 |n|^2)` (`li_prod_ite_eq`, `li_prod_exp`), and `(\u2211 n_k^2)^3 \u2264 9 \u2211 (n_i^2)^3`\nis `li_sum_cube_le"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "li_partial_sum_le",
+ "line": 1114,
+ "source_header": "i, (((n i : \u2124) : \u211d) ^ 2) ^ 3) * Real.exp (-288 * \u2211 i, ((n i : \u2124) : \u211d) ^ 2) :=\n mul_le_mul_of_nonneg_right h (Real.exp_pos _).le\n _ = 9 * ((\u2211 i, (((n i : \u2124) : \u211d) ^ 2) ^ 3) * Real.exp (-288 * \u2211 i, ((n i : \u2124) : \u211d) ^ 2)) := by\n ring\n\n/-! ### (e) The uniform partial-sum bound -/\n\n/-- For `d \u2264 3` and every finite `s`, `\u2211 n \u2208 s, imageTerm d n \u2264 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 \u2264 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 _ \u2264 9 * (3 * (16 * Real.exp (-288))) := by\n have hd' : (d : \u211d) \u2264 3 := by exact_mod_cast hd\n gcongr\n _ \u2264 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 : \u211d) < 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\u207b\u00b9 * (C - A) + (C - A)\n = C * A\u207b\u00b9 * C - C * (A\u207b\u00b9 * A) - (A * A\u207b\u00b9) * C + (A * A\u207b\u00b9) * A + (C - A) := by\n noncomm_ring\n _ = C * A\u207b\u00b9 * 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\u207b\u00b9 * C = 1 := Matrix.nonsing_inv_mul C hC\n calc C\u207b\u00b9 * (C * A\u207b\u00b9 * C - C) * C\u207b\u00b9\n = (C\u207b\u00b9 * C) * A\u207b\u00b9 * (C * C\u207b\u00b9) - C\u207b\u00b9 * (C * C\u207b\u00b9) := by\n noncomm_ring\n _ = A\u207b\u00b9 - C\u207b\u00b9 := 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\u207b\u00b9).conjTranspose * (C * A\u207b\u00b9 * C - C) * C\u207b\u00b9).PosSemidef :=\n hP.conjTranspose_mul_mul_same C\u207b\u00b9\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 \u2192 \u211d) :\n dotProduct x (Matrix.mulVec C\u207b\u00b9 x) \u2264 dotProduct x (Matrix.mulVec A\u207b\u00b9 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 \u2208 spectrum \u211d M - ({1} : Set \u211d) :=\n Set.sub_mem_sub hmem (Set.mem_singleton (1 : \u211d))\n rw [spectrum.sub_singleton_eq] at h\n simpa using h\n have h0 : (0 : \u211d) \u2264 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": "\u207b\u00b9).det := by\n ring\n have hSS2 : 0 \u2264 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 _ \u2264 S.det * S.det * (S\u207b\u00b9 * C * S\u207b\u00b9).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 \u2022 C) = c ^ k * det C` for a `k \u00d7 k` real matrix. -/\ntheorem dc_det_smul {k : \u2115} (C : Matrix (Fin k) (Fin k) \u211d) (c : \u211d) :\n (c \u2022 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 : \u211d) / 2) \u2260 0 := (Real.rpow_pos_of_pos ha _).ne'\n have hbpos : b ^ ((k : \u211d) / 2) \u2260 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 \u2264 dC) (hdC : 0 \u2264 dC) (he : eA \u2264 eC) (heA : 0 \u2264 eA) :\n s * (P * dA * eA) \u2264 P * dC * eC := by\n calc s * (P * dA * eA) = P * (s * dA) * eA := by ring\n _ = P * dB * eA := by rw [hs]\n _ \u2264 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 \u2264 dA) (he : eC \u2264 eB) (heC : 0 \u2264 eC) :\n P * dC * eC \u2264 s * (P * dB * eB) := by\n calc P * dC * eC \u2264 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(\u2016z\u2016^2/2) \u220f i, exp(-144 n_i^2)` (`Aux.th_term_le_dominant`, from `\u201624 n\u2016^2 = 576 \u2211 n_i^2`\nand `Real.exp_sum`); that family is summable (`Aux.th_summable_dominant`) because\n`m \u21a6 exp(-144 m^2)` is summable on `\u2124` (`HurwitzKernelBounds.summable_f_int`) and products of\na nonnegative summable function are summable over `Fin d \u2192 \u2124` (`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 : \u2115) : 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 `\u2016iteratedFDeriv \u211d q (Kinf d) x\u2016`\n(`Aux.dp_abs_le_opNorm`, from `ContinuousMultilinearMap.le_opNorm`); the operator norms satisfy the\nHermite-type recursion `b_{q+2} \u2264 \u2016x\u2016 b_{q+1} + (q+1) b_q` (`Aux.dp_recursion`, from\n`norm_iteratedFDeriv_fderiv`, the explicit derivative `fderiv \u211d (Kinf d) y = Kinf d y \u2022 (-(innerSL \u211d y))`\nand the Leibniz bound `norm_iteratedFDeriv_smul_le`, the linear factor's derivatives of order `\u2265 2`\nvanishing), and with `b_0 = Kinf d x`, `b_1 = Kinf d x \u2016x\u2016` the orders `q \u2264 6` are matched to the\nunfolded `pairingSum q \u2016x\u2016` (`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 \u211d q`) with the source's\n(PENDING_INDEPENDENT_REVIEW); validity for `q > 6` (the Prop restricts to `q \u2264 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| \u2265 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| \u2264 exp(-\u2016x\u2016\u00b2/2) \u00b7 pairingSum q \u2016x\u2016` is the\ninventory theorem `derivativePairingBound` of this module (the Hermite-type recursion\n`b_{q+2} \u2264 \u2016x\u2016 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 \u2264 76 r^6` for `1 \u2264 r`, `q \u2264 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 \u2264 r^6` from `pow_le_pow_right\u2080`, `one_le_pow\u2080`), by `mul_le_mul_of_nonneg_left` with\n`0 \u2264 exp(-\u2016x\u2016\u00b2/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 \u211d 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 `\u2016x\u2016 < 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 `\u20160\u2016 = 0`,\n`exp (-(0 ^ 2) / 2) = 1` and `pairingSum q 0 \u2264 15` for `q \u2264 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 \u211d 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 \u2264 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` (`-\u27eaa, b\u27eb`), `Aux.rb_order_four` (the three pairings) and `Aux.rb_order_six`\n(`-15 \u27eau, u\u27eb^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 \u27e8Aux.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\u27e9\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, \u2026, 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 \u211d` at `0`, `Orthonormal \u211d R`) with the source's (PENDING_INDEPENDENT_REVIEW); the\ndeterminant identity `det diag(3,1,\u2026,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, \u2026, 0)`, `tau^2 = 6`), which this theorem does not use; the value for\n`d \u2209 {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 \u2264 a, b \u2264 5` both bounds follow\n(`Aux.ir_ratio_bounds`) from Bernoulli's inequality `1 - a epsilon \u2264 (1 - epsilon)^a`\n(`one_add_mul_self_le_rpow_one_add`, `Aux.ir_bernoulli`), exponent monotonicity\n`(1 + epsilon)^b \u2264 (1 + epsilon)^5` (`Real.rpow_le_rpow_of_exponent_le`,\n`Aux.ir_rpow_le_pow_five`), `le_div_iff\u2080` / `div_le_iff\u2080`, and the two exact rational\ninequalities `(1 - 13 epsilon)(1 + epsilon)^5 \u2264 1 - 5 epsilon` and\n`(1 + epsilon)^5 \u2264 (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 \u2264 32`, `28 \u2264 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 \u00b7 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 \u00b7 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 \u2264 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 \u2211 i, \u220f 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 `\u2124` 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) \u2264 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 \u2192 \u2124` with the source's\n`sum_{n \u2260 0} |n|^6 e^(-288|n|^2)` is PENDING_INDEPENDENT_REVIEW); the intermediate shell count\n`729 \u2211_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\u00b727 = 729`, `729\u00b72 = 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 \u27e8summable_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)\u27e9\n\n/-! ## The Section 4 Gaussian density comparison -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.DensityComparison` (claim `side24-coefficient`).\nMethod: with `A = (1 - epsilon) \u2022 C0` and `B = (1 + epsilon) \u2022 C0` (positive definite by\n`Matrix.PosDef.smul`), the Loewner lemmas `Aux.dc_det_le_det` (`det A \u2264 det C \u2264 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 \u2b1d B\u207b\u00b9 x \u2264 x \u2b1d C\u207b\u00b9 x \u2264 x \u2b1d A\u207b\u00b9 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 \u2213 epsilon)/(1 \u00b1 epsilon))^(n/2) \u00b7 det((1 \u2213 epsilon) \u2022 C0)^(-1/2)` into\n`det((1 \u00b1 epsilon) \u2022 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 \u00b1 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 \u00b1 epsilon) \u2022 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 \u2192 \u211d) (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 \u2192 \u211d)\n (i : Fin F.b) :\n localGood F p i =\n \u2211 S \u2208 (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 \u2192 \u211d} (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 1) (i : Fin F.b) (S : Finset X) :\n 0 \u2264 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 \u2192 \u211d) (i : Fin F.b) :\n \u2211 S \u2208 (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 \u2286 X_i`, the block weights of the supersets of `S` inside the\nblock sum to `prod_{v in S} p_v` (bijection `T \u21a6 T \\ S` onto `2^(X_i \\ S)`). -/\ntheorem sum_blockWeight_filter_supset {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) (p : X \u2192 \u211d) (i : Fin F.b) {S : Finset X} (hS : S \u2286 block F i) :\n \u2211 T \u2208 (block F i).powerset with S \u2286 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 \u2264 mu_p(D_i)`. -/\ntheorem localGood_nonneg {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X \u2192 \u211d} (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 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) \u2264 1`. -/\ntheorem localGood_le_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X \u2192 \u211d} (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 1) (i : Fin F.b) :"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "localFailure_nonneg",
+ "line": 121,
+ "source_header": "ht_nonneg F hp i S)\n\n/-- `0 \u2264 q_i`. -/\ntheorem localFailure_nonneg {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X \u2192 \u211d} (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 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 \u2264 1`. -/\ntheorem localFailure_le_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X \u2192 \u211d} (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 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 \u2192 \u211d) (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) \u2264 1 - prod_{v in S} p_v` for every such `S \u2286 X_i` (marginal identity plus the\ntermwise bound `indicator \u2264 weight`). -/\ntheorem localGood_le_one_sub_prod {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X \u2192 \u211d} (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 1) {i : Fin F.b} {S : Finset X}\n (hS : S \u2286 block F i) (hcard : F.a i + 1 \u2264 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 \u2286 X_i` with\n`|S| \u2265 a_i + 1`, `prod_{v in S} p_v \u2264 q_i`. -/\ntheorem prod_le_localFailure_of_card {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) {p : X \u2192 \u211d} (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 1) {i : Fin F.b}\n {S : Finset X} (hS : S \u2286 block F i) (hcard : F.a i + 1 \u2264 S.card) :\n \u220f 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 \u2265 a_i + 1` coordinates, so `prod_{v in X_i} p_v \u2264 q_i`. -/\ntheorem prod_block_le_localFailure {X : Type} [Fintype X] [DecidableEq X]\n {F : RealizedData X} (hF : IsRealizedFamily F) {p : X \u2192 \u211d}\n (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 1) (i : Fin F.b) :\n \u220f v \u2208 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 \u2264 -log(1 - q)` for `q < 1` (from `1 - q \u2264 exp(-q)`). -/\ntheorem neg_log_one_sub_ge {q : \u211d} ("
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "le_phi_self",
+ "line": 196,
+ "source_header": "rw [Real.log_exp] at h2\n linarith\n\n/-- `q \u2264 phi(q)` for `q \u2264 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 \u00b7 exact h1\n\n/-! ### Blocks partition the ground set -/\n\n/-- The traces `T \u2229 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 (\u2191(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 \u2192 \u211d) (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 \u2229 X_i)`. -/\ntheorem weight_eq_prod_blockWeight {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (p : X \u2192 \u211d) (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 \u2229 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 \u00b7 exact image_subset_image inter_subset_left\n\n/-- Termwise: `1_D(U) w(U) \u2264 prod_i 1_D(U \u2229 X_i) w_i(U \u2229 X_i)`. -/\ntheorem indicator_weight_le {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X \u2192 \u211d} (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 1) (U : Finset X) :\n Set.indicator (downset F) (weight p) U \u2264\n \u220f 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 \u2286 X} prod_i g_i(U \u2229 X_i) = prod_i sum_{S \u2286 X_i} g_i(S)`: the bijection\n`U \u21a6 (i \u21a6 U \u2229 X_i)` from `2^X` onto `prod_i 2^(X_i)` with inverse `x \u21a6 \u22c3_i x_i`. -/\ntheorem sum_prod_blocks {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (g : Fin F.b \u2192 Finset X \u2192 \u211d) :\n \u2211 U \u2208 (univ : Finset X).powerset, \u220f i, g i (U"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "mu_le_prod_localGood",
+ "line": 303,
+ "source_header": "ro hv\n exact \u27e8\u27e8i, hv\u27e9, hx' i hv\u27e9\n \u00b7 intro U _\n rfl\n\n/-- The factorisation `mu_p(D) \u2264 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 \u2192 \u211d}"
+ },
+ {
+ "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 \u2192 \u211d} (hp : \u2200 v, 0 \u2264 p v \u2227 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 \u2192 \u211d} (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 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) \u2264 -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 \u2192 \u211d} (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 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\u2080` for `0 \u2264 c \u2264 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 \u2265 a_i + 1`\ncoordinates and is therefore bad); `q \u2264 phi(q)` on `[0,1]` from `1 - q \u2264 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\u2080 (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 \u2264 -log(1 - q_i)` by\n`Aux.neg_log_one_sub_ge`, and `-log prod \u2264 -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) \u2264 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 \u2192 \u211d} (hc : \u2200 v, 0 \u2264 c v) (G : Finset (Finset Y)) :\n 0 \u2264 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 : \u2115)\n {c : X \u2192 \u211d} (hc : \u2200 v, 0 \u2264 c v) :\n BddBelow {t : \u211d | \u2203 G : Finset (Finset X), IsGeneratorCover F K G \u2227 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 : \u2115) {c : X \u2192 \u211d} (hc : \u2200 v, 0 \u2264 c v) {G : Finset (Finset X)}\n (hG : IsGeneratorCover F K G) : coverCost F K c \u2264 fam"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "isGeneratorCover_singleton_empty",
+ "line": 56,
+ "source_header": "hG, rfl\u27e9\n\n/-- `{\u2205}` covers every obstruction. -/\ntheorem isGeneratorCover_singleton_empty {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) (K : \u2115) : IsGeneratorCo"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "famPrice_singleton_empty",
+ "line": 61,
+ "source_header": "y_subset U\u27e9\n\n/-- The cover `{\u2205}` has price `1`. -/\ntheorem famPrice_singleton_empty {Y : Type} (c : Y \u2192 \u211d) : famPr"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coverCost_le_one",
+ "line": 65,
+ "source_header": "ce, genPrice]\n\n/-- `covercost \u2264 1` (the cover `{\u2205}`). -/\ntheorem coverCost_le_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (K : \u2115)\n {c : X \u2192 \u211d} (hc : \u2200 v, 0 \u2264 c v) : cove"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coverCost_le_sum_block",
+ "line": 71,
+ "source_header": "ton_empty] at h\n\n/-- For `K \u2265 K_H(d)` the full blocks cover, so `covercost \u2264 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 \u2192 \u211d} (hc : \u2200 v, 0 \u2264 c v) {K : \u2115}\n (hK : paletteNumber F.b F.H F.d \u2264 K) :\n coverCost F K c \u2264 \u2211 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 `\u03c1 (-log m)` is at most the capped hazard. -/\ntheorem le_cappedHazard_of {\u03c1 m x : \u211d} (hx1 : x \u2264 1) (hx2 : 0 < m \u2192 x \u2264 \u03c1 * -Real.log m) :\n x"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "sum_localFailure_le_neg_log_mu",
+ "line": 89,
+ "source_header": "x2 h)\n \u00b7 exact hx1\n\n/-- `sum_i q_i \u2264 -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 \u2192 \u211d} (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 1)\n (hmu : 0 < mu F p) : \u2211 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) \u2264 p/(1-p)` for `0 \u2264 p < 1` (display (T2)). -/\ntheorem phi_le_div {p : \u211d} (h0 : 0 \u2264 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 \u2264 prod_{X_i} p/(1-p)`, split along `S \u2286 X_i`. -/\ntheorem genPrice_le_ratio {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p c : X \u2192 \u211d} (hc : \u2200 v, 0 \u2264 c v \u2227 c v \u2264 phi (p v)) {i : Fin F.b}\n (hp : \u2200 v \u2208 block F i, 0 \u2264 p v \u2227 p v < 1) {S : Finset X} (hS : S \u2286 block F i) :\n genPrice c (block F i) \u2264\n (\u220f v \u2208 S, p v) * ((\u220f v \u2208 block F i \\ S, p v) * \u220f"
+ },
+ {
+ "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 \u2192 \u211d} {B : \u211d}\n (hp : \u2200 v \u2208 s, 0 \u2264 p v \u2227 p v \u2264 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)\u207b\u00b9` with `p_v \u2264 B < 1` is at most `((1 - B)\u207b\u00b9)^|s|`. -/\ntheorem prod_inv_le_pow {X : Type} {s : Finset X} {p : X \u2192 \u211d} {B : \u211d} (hB : B < 1)\n (hp : \u2200 v \u2208 s, p v \u2264 B) : \u220f v \u2208 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 \u2264 c \u2264 phi(p)`, `0 \u2264 p \u2264 B < 1` on the block and `S \u2286 X_i`,\n`price(X_i) \u2264 (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 \u2192 \u211d} (hc : \u2200 v, 0 \u2264 c v \u2227 c v \u2264 phi (p v)) {i : Fin F.b} {B : \u211d} (hB0 : 0 \u2264 B)\n (hB : B < 1) (hp : \u2200 v \u2208 block F i, 0 \u2264 p v \u2227 p v \u2264 B) {S : Finset X}\n (hS : S \u2286 block F i) :\n genPrice c (block F i) \u2264\n (\u220f v \u2208 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 : \u2115) :\n (1 / 4 : \u211d) ^ 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 \u2265 1`, `n \u2265 2a + 1`,\n`(1/4)^(n-a-1) (3/4)^(-n) \u2264 16/27`. -/\ntheorem quarter_ratio_le {a n : \u2115} (ha : 1 \u2264 a) (hn : 2 * a + 1 \u2264 n) :\n (1 / 4 : \u211d) ^ (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 \u2192 \u211d} {i : Fin F.b} (h : \u2200 v \u2208 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 \u2192 \u211d} {i : Fin F.b} (h : \u2200 v \u2208 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 \u2264 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 \u2192 \u211d} {i : Fin F.b} (hp : \u2200 v \u2208 block F i, 0 \u2264 p v \u2227 p v \u2264 1)\n {S : Finset X} (hS : S \u2286 block F i) (hcard : F.a i + 1 \u2264 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 \u2265 1`, `d_i \u2265 2`, `0 \u2264 p \u2264 1/4` and\n`0 \u2264 c \u2264 phi(p)`, `price(X_i) \u2264 (16/27) q_i`. -/\ntheorem genPrice_le_budget {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n (hF : IsRealizedFamily F) (hd : \u2200 i, 2 \u2264 F.d i) {p c : X \u2192 \u211d}\n (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 1 / 4) (hc : \u2200 v, 0 \u2264 c v \u2227 c v \u2264 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) \u2264 (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 : \u2200 i, 2 \u2264 F.d i) {p c : X \u2192 \u211d}\n (hp : \u2200 v, 0 \u2264 p v \u2227 p v \u2264 1 / 4) (hc : \u2200 v, 0 \u2264 c v \u2227 c v \u2264 phi (p v))\n (hmu : 0 < mu F p) :\n \u2211 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 \u2192 \u211d}\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 \u2264 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) \u2264 1/40899`. -/"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "phi_benchmark",
+ "line": 290,
+ "source_header": "b_one_of_pos (by norm_num : (0 : \u211d) < 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 \u2264 log(40900/40899)` is at most `1/40899`. -/\ntheorem genPrice_benchmark_le {c : Fin 6 \u00d7 Fin 409 \u2192 \u211d}\n (hc : \u2200 v, 0 \u2264 c v \u2227 c v \u2264 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 \u2264 log(40900/40899)` is at most `6/40899 \u2264 1`. -/\ntheorem famPrice_benchmark_le_one {c : Fin 6 \u00d7 Fin 409 \u2192 \u211d}\n (hc : \u2200 v, 0 \u2264 c v \u2227 c v \u2264 Real.log"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "coverCostHazardBound",
+ "line": 325,
+ "source_header": "rw [nsmul_eq_mul]\n norm_num\n _ \u2264 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 `{\u2205}` has price `1`, so\n`covercost \u2264 1` (`csInf_le`); for `K \u2265 K_H(d)` the full blocks cover (`fullBlockCoverIff`), so\n`covercost \u2264 sum_i price(X_i) \u2264 sum_i q_i` (display (P4), `P15Hazard.localPriceChain`) and, when\n`mu_p(D) > 0`, `sum_i q_i \u2264 -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": "_ \u2264 -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) \u2264 -log(1-p) \u2264 p/(1-p)` (display (T2), `P15Elementary.logRatioBound`); a subset\n`S \u2286 X_i` with `|S| = a_i + 1` exists since `|X_i| = a_i d_i + 1`; `prod_{X_i} c \u2264 prod_{X_i}\np/(1-p) \u2264 (prod_S p) (1/4)^(n-a-1) (4/3)^n = (prod_S p) 4^(a+1)/3^n \u2264 (16/27) prod_S p`\n(display (T3), `P15Elementary.ratioExponentBound` with `n \u2265 2a + 1` from `d_i \u2265 2`); `prod_S p \u2264\nq_i` (block-local marginal bound of `P15Hazard`); `(16/27) q \u2264 q \u2264 phi(q)` on `[0, 1]`.\nDoes not establish: the informal display (T4) or its review and acceptance; sharpness of the\nrange `p_v \u2264 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 _ \u2264 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 \u2286 X_i` with\n`|S| = a_i + 1`, `prod_{X_i} c \u2264 prod_{X_i} p/(1-p) \u2264 (prod_S p) p_*^(n-a-1) (1-p_*)^(-n) =\n(prod_S p) rho(a_i, d_i, p_*) \u2264 prod_S p` since `n = a_i d_i + 1`, and `prod_S p \u2264 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 _ = \u220f v \u2208 S, p v := mul_one _\n _ \u2264 localFailure F p i := hprodS\n\n/-- Proves: `UniversalLaw.Spec.P15.RestrictedTransformedPriceBudget` (claim\n`p15-price-budget-restricted`, display (T1)).\nMethod: `covercost \u2264 1` by the cover `{\u2205}`; for `K \u2265 K_H(d)` the full blocks cover\n(`fullBlockCoverIff`), so `covercost \u2264 sum_i price(X_i) \u2264 (16/27) sum_i q_i` (display (T4), the\nlocal budget of this module) and, when `mu_p(D) > 0`, `sum_i q_i \u2264 -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)\u207b\u00b9`, `Real.log_inv` and `log(40900/40899) \u2264 1/40899 \u2264 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 `\u2264 (1/40899)^409 \u2264\n1/40899` and from the summed local budget (T4) at `p_v = 1/40900 \u2264 1/4`, `d_i = 408 \u2265 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 \u00b7 1_E = 1_E \u00b7 N` pointwise. -/\ntheorem mul_indicator_one_eq {\u03a9 : Type} (Ev : Set \u03a9) (N : \u03a9 \u2192 \u2115) (\u03c9 : \u03a9) :\n (N \u03c9 : \u211d) * Ev.indicator (fun _ => (1 : \u211d)) \u03c9 = Ev.indicator (fun \u03c9 => (N \u03c9 : \u211d)"
+ },
+ {
+ "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)\u207b\u00b9 \u2022 P.restrict E`, `integral_smul_measure`,\n`integral_indicator`, cancel `P(E) \u00b7 P(E)\u207b\u00b9`.\nDoes not establish: the informal Theorem N, the bounded-conditional-mean equivalence, the lower\ncomparison `q \u2265 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\u00f6lder 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`\u222b 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 \u21a6 x^(1/p)` and `x \u21a6 x^(1-1/p)` on\n`[0, \u221e)` and the rpow algebra `(A r^(-\u03b2))^(1/p) (C r^3)^(1-1/p) = A^(1/p) C^(1-1/p)\nr^((3(p-1)-\u03b2)/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 \u2264 a \u2264 1` is `a`. -/\ntheorem uniformLaw_Iic {a : \u211d} (ha0 : 0 \u2264 a) (ha1 : a \u2264 1) :\n (uniformLaw (Set.Iic a))"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "integral_counterCount",
+ "line": 149,
+ "source_header": "ofReal ha0]\n\n/-- `\u222b N_r dU = ceil(log(1/r)) \u00b7 U(E_r)`. -/\ntheorem integral_counterCount (r : \u211d) :\n \u222b u, counterCount r u \u2202uniformLaw =\n (\u2308Real.log (1 / r)\u2309\u208a : \u211d) * (uniformLaw (Set.Iic (r"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "integral_counterCount_rpow",
+ "line": 157,
+ "source_header": "mul, mul_one]\n\n/-- `\u222b N_r^p dU = ceil(log(1/r))^p \u00b7 U(E_r)` for `p \u2260 0`. -/\ntheorem integral_counterCount_rpow (r : \u211d) {p : \u211d} (hp : p \u2260 0) :\n \u222b u, counterCount r u ^ p \u2202uniformLaw =\n (\u2308Real.log (1 / r)\u2309\u208a : \u211d) ^ 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 \u2264 e^(-1)`. -/\ntheorem n4_fixed (r : \u211d) (hr : 0 < r) (hre : r \u2264 Real.exp (-1)) :\n (uniformLaw (Set.Iic (r ^ 3))).toReal = r ^ 3 \u2227\n (\u222b u, counterCount r u \u2202uniformLaw) / r ^ 3 = (\u2308Real.l"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "one_le_log_one_div",
+ "line": 181,
+ "source_header": "hr3.ne', mul_one]\n\n/-- `log (1/r) \u2265 1` for `0 < r \u2264 e^(-1)`. -/\ntheorem one_le_log_one_div {r : \u211d} (hr : 0 < r) (hre : r \u2264 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 : \u211d} (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/-- `\u222b_0^\u221e exp(-s/B) ds = B` for `B > 0`. -/\ntheorem integral_exp_neg_div_Ioi_zero {B : \u211d} (hB : 0 < B) :\n \u222b s in Set.Ioi (0 : \u211d)"
+ },
+ {
+ "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`; `\u222b N_r dU = ceil(log(1/r)) r^3`\nby `integral_indicator_const`; the limit from `log \u2218 inv \u2192 \u221e` on `\ud835\udcdd[>] 0` and\n`x \u2264 \u2308x\u2309\u208a`; the moment bound with the explicit constant `A_p = 2^n n!`, `n = \u2308p\u2309\u208a`, via\n`\u2308t\u2309\u208a^p \u2264 (2t)^n` for `t = log(1/r) \u2265 1` and `t^n \u2264 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\u2080 = B log(A/q) \u2265 0`, the pointwise bound `N 1_E \u2264 t\u2080 1_E + (N - t\u2080)\u207a`; the\nlayer-cake formula `Integrable.integral_eq_integral_meas_lt` for `(N - t\u2080)\u207a`; the tail\nhypothesis at `t = s + t\u2080`; and `\u222b_0^\u221e A e^(-(s+t\u2080)/B) ds = A B e^(-t\u2080/B) = B q`\n(`integral_comp_mul_left_Ioi`, `integral_exp_neg_Ioi_zero`).\nDoes not establish: the source's intermediate identity `\u222b_0^\u221e 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 : \u211d) < 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 : \u211d) < 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 (\u2211 j \u2208 Finset.range 6, (11 / 6 : \u211d) ^ j / (Nat.factorial j : \u211d)) =\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 : \u211d"
+ },
+ {
+ "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\u2080 (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 \u2192 \u211d) :\n \u2211 U \u2208 (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) \u2264 k) = P(Bin(n,p) \u2264 k) - C(n,k) p^(k+1) (1-p)^(n-k)` for\n`k \u2264 n` (Pascal's rule, induction on `k`). -/\ntheorem binomTail_succ_left (n k : \u2115) (p : \u211d) (hk : k \u2264 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 \u2264 n`). -/\ntheorem muOf_capacityFamily (n a : \u2115) (han : a \u2264 n) (c : \u211d) :\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 \u2264 n`, `0 \u2264 c \u2264 1`). -/\ntheorem binomTail_antitone_step (n a : \u2115) (han : a \u2264 n) (c : \u211d) (h0 : 0 \u2264 c) (h1 : c \u2264 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 \u2264 binomTail m a c` for `a \u2264 m \u2264 n`. -/\ntheorem binomTail_le_of_le (a m n : \u2115) (hm : a \u2264 m) (hmn : m \u2264 n) (c : \u211d) (h0 : 0 \u2264 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 \u2264 c < 1` (the `j = 0` term is `(1-c)^n > 0`). -/\ntheorem binomTail_pos (n a : \u2115) (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) \u2264 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 : \u2115)\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) \u2194 U.card \u2264 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', ?_\u27e9\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": "\u00b7 rintro rfl\n rw [Finset.card_univ, Fintype.card_fin]; omega\n\n/-- The side conditions hold for `cap \u2265 1`. -/\ntheorem oneBlock_"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "oneBlock_mu",
+ "line": 273,
+ "source_header": ", \u2200 f \u2208 (\u2205 : Finset (Finset (Fin 1))),\n e \u2286 f \u2192 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 = \u220f 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 \u27e8fun i => {i}, fun i => by simp, ?_\u27e9\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 \u00b7 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 : \u211d) < 1 + x)\n (by intro h; linarith : (1 : \u211d) + x \u2260 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 \u2286 X`, whose price\n`(2/3)^|g| \u2265 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 : \u211d) \u2264 phi (1 / 2)\n rw [hphi]; linarith\n \u00b7 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)\u207b\u00b9` 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)\u207b\u00b9 - 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 \u2264 q < 1`,\n`-log(1-q) \u2265 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 \u00b7 subst h\n simp\n\n/-- Proves: `UniversalLaw.Spec.P15.RatioExponentBound` (register row `p15-price-budget-restricted`).\nMethod: `3^n \u2265 3^(2a+1)` and the exact identity `4^(a+1)/3^(2a+1) = (4/3)(4/9)^a`; then\n`(4/9)^a \u2264 4/9` for `a \u2265 1`.\nDoes not establish: the ratio steps of (T3) preceding the exponent"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "rhoStarBelowSixSevenths",
+ "line": 524,
+ "source_header": "/ 9 : \u211d) ^ a \u2264 (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\u27e9\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 : \u211d) < 1 - Real.exp (-1)))\n (by linarith : (0 : \u211d) < 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 : \u211d) - (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 \u2208 (0,1)` all weights are nonnegative, the empty set\ncontributes `(1-p_star)^n > 0`, and since `X \u2209 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 \u2208 (1/2, 1)`: `P(Bin(2a+1,p) \u2264 a) \u2264 P(Bin(3,p) \u2264 1)` for `a \u2265 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 \u21a6 a+1` at `p_star > 1/2` (F10), so\n`binomTail n a \u2264 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 \u21d4 `|U| \u2264 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 \u2265 1`; `Real.log_lt_log`; for `rho \u2264 1` the capped\nhazard is `min(1, rho(-log mu)) \u2264 -log mu < 1 \u2264 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 _ \u2264 coverCost (demandOneBlock cap) 1 (fun _ => (1 : \u211d)) := 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 \u2264 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 \u2264 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 \u00b7 ring\n \u00b7 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 \u2264 1) \u2227\n (\u2200 e \u2208 (\u2205 : Finset (Finset (Fin 1))), \u00ac e \u2286 supp tripleBlock U) \u2194 U.card \u2264 1\n simp [tripleBlock_block]\n\n/-- Two-decomposability is `|U| \u2264 2`: two good parts have at most two elements in all\n(`Finset.card_biUnion_le`), and a set of size `\u2264 2"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "tripleBlock_obstruction",
+ "line": 847,
+ "source_header": "mp only; split_ifs <;> simp\n \u00b7 intro j j' hjj'\n fin_cases j <;> fin_cases j' <;> simp_all [hxy.symm]\n \u00b7 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 \u00b7 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 \u2264 e.card\n simp\n \u00b7 change \u2200 e \u2208 (\u2205 : Finset (Finset (Fin 1))), \u2200 f \u2208 (\u2205 : Finset (Finset (Fin 1))),"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "tripleBlock_palette",
+ "line": 884,
+ "source_header": "Finset.mem_singleton]\n constructor\n \u00b7 rintro \u27e8i, rfl\u27e9\n exact tripleBlock_block i\n \u00b7 rintro rfl\n exact \u27e8(0 : Fin 1), tripleBlock_block 0\u27e9\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 \u2264 (P 0).card := hP 0\n have h0 : (P 0).card \u2264 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 \u00b7 rw [Set.indicator_of_notMem\n (show U \u2209 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 : \u211d)) 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 _ \u2264 \u2211 g \u2208 G, genPrice (fun _ => (1 : \u211d)) 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 \u27e8Finset.univ, Finset.mem_singleton_self _, by rw [hU]\u27e9\n\n/-- The"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "tripleBlock_coverCost",
+ "line": 940,
+ "source_header": "lock_fullBlock_price :\n famPrice (fun _ => (1 : \u211d)) (fullBlockFamily tripleBlock) = 1 := by\n rw [tripleBlock_fullBlockFamily]\n simp [famPrice, g"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "tripleBlock_mu_pStar",
+ "line": 949,
+ "source_header": "\u27e8\u27e8fullBlockFamily tripleBlock, tripleBlock_fullBlock_cover,\n tripleBlock_fullBlock_price\u27e9, ?_\u27e9\n rintro t \u27e8G, hG, rfl\u27e9\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 `\u03c1 < \u03c1_star = 1/h_star` makes the capped"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "capacityHazardIsBinomial",
+ "line": 980,
+ "source_header": "\u2193reduceIte]\n rw [hlog]\n calc min 1 (\u03c1 * hStar) \u2264 \u03c1 * hStar := min_le_right _ _\n _ < rhoStar * hStar := mul_lt_mul_of_pos_right h\u03c1 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 \u2264 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| \u2264 a}` and `P(Bin(n, p_star) \u2264 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 `\u2264 1`, and a\nset is `2`-decomposable iff it has size `\u2264 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 `\u2265 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 `\u03c1 < \u03c1_star = 1/h_star`,\n`min 1 (\u03c1 h_star) \u2264 \u03c1 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 \u2218 (-id) = Kinf d` (`norm_neg`). -/\ntheorem cv_kinf_comp_neg {d : \u2115} :\n (Kinf d \u2218 (-ContinuousLinearMap.id \u211d (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 : \u2115} (n : \u2115) (hn : Odd n) (m : Fin n \u2192 E d) :\n iteratedFDeriv \u211d 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 : \u2115} (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 \u00b7 (-\u27eaR i, R j\u27eb) = \u27eaR i, R j\u27eb`. -/\ntheorem cv_GG {d : \u2115} (u : E d) (R : Fin d \u2192 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 \u00b7 D^4 Kinf 0 [R i, u, u, u] = -3 \u27eau, u\u27eb \u27eaR i, u\u27eb`. -/\ntheorem cv_Gt {d : \u2115} (u : E d) (R : Fin d \u2192 E d) (i : Fin d) (t : Unit) :\n Cref d u R (Sum.inl i) (Sum.inr (Sum.inl t)) = -(3 * (\u27eau,"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "cv_tG",
+ "line": 122,
+ "source_header": "er_four]\n ring\n\n/-- `t`/gradient entry: `(-1)^1 \u00b7 D^4 Kinf 0 [u, u, u, R j] = -3 \u27eau, u\u27eb \u27eau, R j\u27eb`. -/\ntheorem cv_tG {d : \u2115} (u : E d) (R : Fin d \u2192 E d) (j : Fin d) (t : Unit) :\n Cref d u R (Sum.inr (Sum.inl t)) (Sum.inl j) = -(3 * (\u27eau"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "cv_tt",
+ "line": 128,
+ "source_header": "rder_four]\n ring\n\n/-- `t`/`t` entry: `(-1)^3 \u00b7 D^6 Kinf 0 [u, \u2026, u] = 15 \u27eau, u\u27eb^3`. -/\ntheorem cv_tt {d : \u2115} (u : E d) (R : Fin d \u2192 E d) (t t' : Unit) :\n Cref d u R (Sum.inr (Sum.inl t)) (Sum.inr (Sum.inl t')) =\n 15 * (\u27eau, u\u27eb"
+ },
+ {
+ "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 : \u2115} (u : E d) (R : Fin d \u2192 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": "_ \u27e81, rfl\u27e9, mul_zero]\n\n/-- Hessian/gradient entry: an order-three contraction, hence `0`. -/\ntheorem cv_HG {d : \u2115} (u : E d) (R : Fin d \u2192 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 _ \u27e81, rfl\u27e9, mul_zero]\n\n/-- `t`/Hessian entry: an order-five contraction, hence `0`. -/\ntheorem cv_tH {d : \u2115} (u : E d) (R : Fin d \u2192 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 _ \u27e82, rfl\u27e9, mul_zero]\n\n/-- Hessian/`t` entry: an order-five contraction, hence `0`. -/\ntheorem cv_Ht {d : \u2115} (u : E d) (R : Fin d \u2192 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 _ \u27e82, rfl\u27e9, 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\u2081, R p\u2082, R q\u2081, R q\u2082]`. -/\ntheorem cv_HH {d : \u2115} (u : E d) (R : Fin d \u2192 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 (\u27eaR q.1.1, R q.1.2\u27eb * \u27eaR p.1.1, R p.1.2\u27eb + \u27eaR p.1.2, R q.1.2\u27eb * \u27eaR p.1.1, R q.1.1\u27eb\n + \u27eaR 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\u1d40` with `v = e_{G_0} - (9/2) e_t` plus `w w\u1d40` with `w` the\nindicator of the diagonal Hessian coordinates. -/\ntheorem cv_decomp {d : \u2115} (hd : 0 < d) (R : Fin d \u2192 E d) (hR : Orthonormal \u211d R) :\n Cref d (R \u27e80, hd\u27e9) R - (1 / 3 : \u211d) \u2022 (1 : Matrix (JointIndex d) (JointIndex d) \u211d) =\n Matrix.diagonal (Sum.elim (fun i : Fin d => if i = \u27e80, hd\u27e9 then (0 : \u211d) else 2 / 3)\n (Sum.elim (fun _ : Unit => (7 / 6 : \u211d)) (fun _ : SymIndex d => (5 / 3 : \u211d))))\n + (2 / 3 : \u211d) \u2022 Matrix.vecMulVec\n (Sum.elim (fun i : Fin d => if i = \u27e80, hd\u27e9 then (1 : \u211d) else 0)\n (Sum.elim (fun _ : Unit => (-9 / 2 : \u211d)) (fun _ : SymIndex d => (0 : \u211d))))\n (Sum.elim (fun i : Fin d => if i = \u27e80, hd\u27e9 then (1 : \u211d) else 0)\n (Sum.elim (fun _ : Unit => (-9 / 2 : \u211d)) (fun _ : SymIndex d => (0 : \u211d))))\n + Matrix.vecMulVec\n (Sum.elim (fun _ : Fin d => (0 : \u211d))\n (Sum.elim (fun _ : Unit => (0 : \u211d))\n (fun p : SymIndex d => if p.1.1 = p.1.2 then (1 : \u211d) else 0)))\n (Sum.elim (fun _ : Fin d => (0 : \u211d))\n (Sum.elim (fun _ : Unit => (0 : \u211d))\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 : \u2115} (hd : 0 < d) (R : Fin d \u2192 E d) (hR : Orthonormal \u211d R) :\n (Cref d (R \u27e80, hd\u27e9) R -\n (1 / 3 : \u211d) \u2022 (1 : Matrix (JointInd"
+ },
+ {
+ "kind": "theorem",
+ "unqualified_name": "referenceCovarianceLowerBound",
+ "line": 247,
+ "source_header": "1.2 then (1 : \u211d) 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, \u2026, 2/3; 7/6; 5/3, \u2026, 5/3) + (2/3) v v\u1d40 + w w\u1d40` 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 \u2228 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 \u00b1 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 \u00b1 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."
+ ]
+ },
+ {
+ "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 \u2192 \u211d) (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 \u2192"
+ },
+ {
+ "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 \u2192 \u211d) (g : Fins"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "famPrice",
+ "line": 101,
+ "source_header": "\u2208 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 \u2192 \u211d) (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 : \u2115\n /-- The block of each original coordinate. -/\n blk : X \u2192 Fin b\n /-- The capacities `a_i`. -/\n a : Fin b \u2192 \u2115\n /-- The demands `d_i`. -/\n d : Fin b \u2192 \u2115\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": "\u2208 F.H, \u2200 f \u2208 F.H, e \u2286 f \u2192 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": "\u2264 F.a i) \u2227 \u2200 e \u2208 F.H, \u00ac e \u2286 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 | \u00ac 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 \u2208 obstruction F K \u2192 \u2203 g \u2208 G, g \u2286 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 \u2227 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": "(\u220f v \u2208 S, p v) * \u220f v \u2208 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 \u2192 \u211d) (i : Fin F.b) : \u211d :=\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 : \u2115) (H"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "paletteNumber",
+ "line": 299,
+ "source_header": "(P i).card) \u2227\n \u2200 e \u2208 H, \u2200 \u2113 : Fin K, \u2203 i \u2208 e, \u2113 \u2209 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 `\u2115` 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 \u2192 \u2115) : \u2115 :=\n sInf {K : \u2115 | 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 \u2192 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 \u00ac IsGood F U \u2227 \u2200 v \u2208 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 \u2227 \u2200 i \u2208 e, (U \u2229 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 \u2286 block F i \u2227 U.card = F.a i + 1) \u2228 \u2203 e \u2208 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 \u2286 block F i \u2192\n (IsGood F S \u2194 S.card \u2264 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 \u2286 block F i \u2192\n (IsKDecomposable F k S \u2194 S.card \u2264 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 \u2286 block F i \u2192\n (\u00ac IsKDecomposable F (F.d i) S \u2194 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 \u2264 localFailure F p i \u2227\n localFailure F p i \u2264 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)) \u2227\n -Real.log (\u220f i, (1 - localFailure F p i)) \u2264 -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": "\u2200 K : \u2115,\n IsGeneratorCover F K (fullBlockFamily F) \u2194 paletteNumber F.b F.H F.d \u2264 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": "\u2200 K : \u2115, paletteNumber F.b F.H F.d \u2264 K \u2192 coverCost F K c \u2264 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": ": \u2115,\n IsKDecomposable F K Finset.univ \u2194 paletteNumber F.b F.H (fun i => F.d i + 1) \u2264 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 : \u2115) : 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) \u2308((\u2211 i, d i : \u2115) : \u211a) / (s : \u211a)\u2309\u208a\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 \u00d7 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) \u2227\n \u00ac 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 \u2227 \u00ac 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 \u00d7 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 : \u211d) / 40900) (fullBlockFamily benchmark816) = 6 / 40900 ^ 409 \u2227\n (0 : \u211d) < 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 \u2227\n (2449227 / 8180000000 : \u211d) < 3 / 10000 \u2227\n (9997 / 10000 : \u211d) < mu benchmark816 (fun _ => (1 : \u211d) / 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 := \u2205\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 \u2192 \u211d := 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 \u2192 \u211d := 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 \u2205 = 1 \u2227 genPrice twoCoordC {0} = 2 / 3 \u2227 genPrice twoCoordC {1} = 2 / 3 \u2227\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 \u2227 (1 / 3 : \u211d) < 4 / 9 \u2227\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 \u2200 x : \u211d, 0 < x \u2192 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 \u2200 p : \u211d, 0 \u2264 p \u2192 p < 1 \u2192 -Real.log (1 - p) \u2264 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 \u2200 a n : \u2115, 1 \u2264 a \u2192 2 * a + 1 \u2264 n \u2192\n (4 : \u211d) ^ (a + 1) / 3 ^ n \u2264 (4 / 3) * (4 / 9) ^ a \u2227 (4 / 3 : \u211d) * (4 / 9) ^ a \u2264 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": "\u2200 i : Fin F.b, genPrice c (block F i) \u2264 (16 / 27) * localFailure F p i \u2227\n (16 / 27) * localFailure F p i \u2264 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": ") \u2192 (\u2200 v, 0 \u2264 c v \u2227 c v \u2264 phi (p v)) \u2192\n \u2200 K : \u2115, paletteNumber F.b F.H F.d \u2264 K \u2192\n coverCost F K c \u2264 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 : \u2115) (pBound : \u211d) : \u211d :=\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, (\u2200 v \u2208 block F i, 0 \u2264 p v \u2227 p v \u2264 pBound) \u2192\n rhoTest (F.a i) (F.d i) pBound \u2264 1 \u2192\n genPrice c (block F i) \u2264 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 \u2227 \u2200 q : \u211d, 2 / 3 \u2264 q \u2192 q \u2264 1 \u2192 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 : \u211d) / 40900)) \u2227\n coverCost benchmark816 816 c \u2264\n cappedHazard (16 / 27) (mu benchmark816 (fun _ => (1 : \u211d) / 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 : \u211d) < phi (1 / 40900) \u2227\n famPrice (fun _ => (81801 : \u211d) / 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 : \u211d := 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 : \u211d := 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 : \u211d := 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 : \u211d := 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 : \u211d := 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 \u2192 \u211d), (\u2200 v, 0 \u2264 p v \u2227 p v \u2264 1) \u2192 (\u2200 v, 0 \u2264 c v \u2227 c v \u2264 phi (p v)) \u2192\n \u2200 K : \u2115, paletteNumber F.b F.H F.d \u2264 K \u2192 coverCost F K c \u2264 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 \u2227 rhoStar < rhoStarUpper \u2227 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 \u2205 \u2208 A \u2227 Finset.univ \u2209 A \u2227 \u2200 U \u2208 A, \u2200 V : Finset Y, V \u2286 U \u2192 V \u2208 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 \u2192 \u211d) : \u211d :=\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)) : \u211d :=\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 \u2200 (n : \u2115) (A : Finset (Finset (Fin n))), 1 \u2264 n \u2192 IsProperDownset A \u2192 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": "\u2264 n \u2192 IsProperDownset A \u2192\n \u2200 (i : Fin n) (t : Fin n \u2192 \u211d), (\u2200 j, 0 \u2264 t j \u2227 t j \u2264 1) \u2192\n ConcaveOn \u211d (Set.Icc (0 : \u211d) 1) (fun s : \u211d => 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 \u2200 (n : \u2115) (A : Finset (Finset (Fin n))), 1 \u2264 n \u2192 IsProperDownset A \u2192\n \u2200 t : Fin n \u2192 \u211d, (\u2200 j, 0 \u2264 t j \u2227 t j \u2264 1) \u2192 (\u220f i, t i) * hazardStar A \u2264 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": "\u2115) (A : Finset (Finset (Fin n))), 1 \u2264 n \u2192 IsProperDownset A \u2192\n \u2200 p : Fin n \u2192 \u211d, (\u2200 j, 0 \u2264 p j \u2227 p j \u2264 1) \u2192 0 < muOf A p \u2192\n hazardStar A * \u220f i, phi (p i) \u2264 -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 \u2264 n \u2192 IsProperDownset A \u2192\n \u2200 (p c : Fin n \u2192 \u211d), (\u2200 j, 0 \u2264 p j \u2227 p j \u2264 1) \u2192 (\u2200 j, 0 \u2264 c j \u2227 c j \u2264 phi (p j)) \u2192\n \u220f i, c i \u2264 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 \u2264 n \u2192 IsProperDownset A \u2192\n ((\u2200 (p c : Fin n \u2192 \u211d), (\u2200 j, 0 \u2264 p j \u2227 p j \u2264 1) \u2192 (\u2200 j, 0 \u2264 c j \u2227 c j \u2264 phi (p j)) \u2192\n \u220f i, c i \u2264 cappedHazard 1 (muOf A p)) \u2194 1 \u2264 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 : \u2115) : Finset (Finset (Fin n)) :=\n (Finset.univ : Finset (Fin n)).powerset.filter (fun U => U.card \u2264 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 : \u2115) (p : \u211d) : \u211d :=\n \u2211 j \u2208 Finset.range (a + 1), (Nat.choose n j : \u211d) * 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 \u2200 n a : \u2115, 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 : \u211d) * p ^ a * (1 - p) ^ (a + 1)) \u2227\n (1 / 2 < p \u2192 p < 1 \u2192 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) \u2264 hazardStar (capacityFamily n a)) \u2227\n hazardStar (capacityFamily 3 1) = -Real.log (3 * Real.exp (-2) - 2 * Real.exp (-3)) \u2227\n -Real.log (3 * Real.exp (-2) - 2 * Real.exp (-3)) = hStar \u2227\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 \u2227\n Real.exp 1 ^ 2 - (3 * Real.exp 1 - 2) = (Real.exp 1 - 1) * (Real.exp 1 - 2) \u2227\n 0 < (Real.exp 1 - 1) * (Real.exp 1 - 2) \u2227\n 3 * Real.exp (-2) - 2 * Real.exp (-3) < Real.exp (-1) \u2227\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": "\u2200 v, 0 \u2264 p v \u2227 p v \u2264 1) \u2192 (\u2200 v, 0 \u2264 c v \u2227 c v \u2264 phi (p v)) \u2192\n \u2200 i : Fin F.b, 0 < localGood F p i \u2192\n genPrice c (block F i) \u2264 rhoStar * (-Real.log (localGood F p i)) \u2227\n genPrice c (block F i) \u2264 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 \u2192 \u2200 p : X \u2192 \u211d, (\u2200 v, 0 \u2264 p v \u2227 p v \u2264 1) \u2192\n mu F p \u2264 \u220f i, localGood F p i \u2227\n (0 < mu F p \u2192 \u2211 i, -Real.log (localGood F p i) \u2264 -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 := \u2205\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 \u2227\n coverCost tripleBlock 2 (fun _ => (1 : \u211d)) = 1 \u2227\n -Real.log (mu tripleBlock (fun _ => pStar)) = hStar \u2227\n \u2200 \u03c1 : \u211d, \u03c1 < rhoStar \u2192 cappedHazard \u03c1 (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 : \u2115) : RealizedData (Fin (cap + 1)) where\n b := 1\n blk := fun _ => 0\n a := fun _ => cap\n d := fun _ => 1\n H := \u2205\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) \u2227\n -Real.log (mu (demandOneBlock cap) (fun _ => pStar)) < 1 \u2227\n \u2200 \u03c1 : \u211d, \u03c1 \u2264 1 \u2192\n cappedHazard \u03c1 (mu (demandOneBlock cap) (fun _ => pStar)) <\n coverCost (demandOneBlock cap) 1 (fun _ => (1 : \u211d))\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 \u211d (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : \u2115) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "latticeVec",
+ "line": 77,
+ "source_header": "in d)\n\n/-- The lattice vector `L n` for `n \u2208 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 : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "thetaSum",
+ "line": 86,
+ "source_header": "i : \u211d))\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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) {m : \u2115} (x : Fin m \u2192 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 : \u2115) (L : \u211d) (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 `\u22a4`).\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 : \u2115) (g"
+ },
+ {
+ "kind": "structure",
+ "unqualified_name": "GaussianFieldInterface",
+ "line": 138,
+ "source_header": "\u2115, ContDiff \u211d 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 : \u2115) (L : \u211d) where\n /-- The underlying probability space (sample space). -/\n \u03a9 : 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\u03a9`.\n [m\u03a9 : MeasurableSpace \u03a9]\n /-- The probability measure `P`. -/\n P : Measure \u03a9\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `\u03c9 \u21a6 f_\u03c9 : R^d \u2192 \u211d`. -/\n F : \u03a9 \u2192 E d \u2192 \u211d\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : \u2200 \u03c9, IsSmooth d (F \u03c9)\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 : \u2200 \u03c9, IsLPeriodic d L (F \u03c9)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : \u2200 z : E d, Summable (fun n : Fin d \u2192 \u2124 => Real.exp (-(\u2016z + latticeVec d L n\u2016 ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : \u2200 {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d), 0 \u2264 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 : \u2200 {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d),\n Measure.map (fun \u03c9 => \u2211 i, a i * F \u03c9 (x i)) P =\n ProbabilityTheory.gaussianReal 0 \u27e8covQuadForm d L x a, quad_nonneg x a\u27e9\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : \u2200 x y : E d, \u222b \u03c9, F \u03c9 x * F \u03c9"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "hessian",
+ "line": 180,
+ "source_header": "y \u2202P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fr\u00e9chet\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": ": \u211d :=\n iteratedFDeriv \u211d 2 g x ![v, w]\n\n/-- Critical point: vanishing Fr\u00e9chet 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": "\u211d) (x : E d) : Prop :=\n fderiv \u211d 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": "(\u2200 w \u2208 W, w \u2260 0 \u2192 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 \u2227 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 \u2227 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": ": \u2115) (r : \u211d) (u : E d) : E d :=\n -((r / 2) \u2022 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 : \u2115) (r : \u211d) (u : E d) : E d :=\n (r / 2) \u2022 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 : \u2115) (g : E d \u2192 \u211d) (M S : E d) : \u211d :=\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 \u2227 IsIndexSaddle d g S \u2227 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 \u2192\n 0 < torusDist d L x y \u2192 g x \u2260 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 : \u2115) (L : \u211d) 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 \u2192 \u211d) \u2192 E d \u2192 \u211d\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 \u2192 \u211d) \u2192 E d \u2192 Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d \u2192 \u211d) \u2192 E d \u2192 E d \u2192 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192\n \u2200 M : E d, IsEssential g M \u2194 \u2200 y : E d, g y \u2264 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192\n \u2200 M : E d, \u00ac IsEssential g M \u2192 \u2200 h : \u211d,\n h < deathHeight g M \u2194\n \u2203 y : E d, g M < g y \u2227 \u2203 \u03b3 : Path M y, \u2200 t : unitInterval, h < g (\u03b3 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192 IsMorseDistinct d L g \u2192\n \u2200 M S : E d, ElderPartner g M S \u2194\n (IsNond"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "IsFiniteBar",
+ "line": 351,
+ "source_header": "gMax d g M \u2227 IsIndexSaddle d g S \u2227 \u00ac IsEssential g M \u2227 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`\u00ac 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 \u2227 0 < heightGap d g M S \u2227 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 : \u2115) (L : \u211d) (Pai"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pairCount",
+ "line": 374,
+ "source_header": "ndDomain d L \u2227 p.2 \u2208 FundDomain d L \u2227 Pair g p.1 p.2 \u2227 heightGap d g p.1 p.2 \u2208 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 \u2192 Prop)\n (g : E d \u2192 \u211d) (A : Set \u211d) : \u2115 :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `\u03bd` 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, `\u03bd` is integrable on every Borel `A \u2286 (0, \u221e)`, and\n`\u222b_A \u03bd = 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\u03a9` (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 : \u2115) (L : \u211d) (G : Gau"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "IsWindowPair",
+ "line": 407,
+ "source_header": "A \u2227\n \u222b \u2113 in A, \u03bd \u2113 = (\u222b \u03c9, ((pairCount d L Pair (G.F \u03c9) A : \u2115) : \u211d) \u2202G.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 <= \u03c1`, 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": ": \u211d) (g : E d \u2192 \u211d) (M S : E d) : Prop :=\n IsCandidatePair d L g M S \u2227 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 \u2264 p \u2264 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 : \u2115) (L : \u211d) (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 : \u211d \u2192 \u211d \u2192 \u211d \u2192 OrthonormalBasis (Fin d) \u211d (E d) \u2192 \u211d\n /-- `p` is a probability: nonnegative. -/\n p_nonneg : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (E d)), 0 \u2264 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 : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (E d)), p r b k R \u2264 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 \u2265 2`, `L > 0`,\ncompact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo \u2264 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 \u2264 r_*`, `b \u2208 B`, `k \u2208 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 `\u03bdc`, `\u03bde` with `\u03bdc(\u2113) ~ c_{B,K} \u2113^(-1/3)`,\n`\u03bde(\u2113) ~ c_{B,K} \u2113^(-1/3)` as `\u2113 \u2193 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and\n`0 \u2264 \u03bdc(\u2113) - \u03bde(\u2113) \u2264 C_{B,K} \u2113^(2/3)` for all sufficiently small `\u2113 > 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 `\u03bdc`, `\u03bde` 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 : \u211d, 0 < \u2113Star \u2227 \u2200 \u2113 : \u211d, 0 < \u2113 \u2192 \u2113 \u2264 \u2113Star \u2192\n 0 \u2264 \u03bdc \u2113 - \u03bde \u2113 \u2227 \u03bdc \u2113 - \u03bde \u2113 \u2264 C * \u2113 ^ ((2 : \u211d) / 3)\n\n/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and\nversions `\u03bdc`, `\u03bde` of the unrestricted candidate density and of the finite ordinary\nsuperlevel H0 bar density satisfy `\u03bdc(\u2113) ~ c \u2113^(-1/3)` and `\u03bde(\u2113) ~ c \u2113^(-1/3)` as `\u2113 \u2193 0`.\nThe essential global-maximum class is excluded from `\u03bde` 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": "\u2227\n Asymptotics.IsEquivalent (nhdsWithin (0 : \u211d) (Set.Ioi 0)) \u03bde\n (fun \u2113 : \u211d => c * \u2113 ^ ((-1 : \u211d) / 3))\n\n/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for\nfixed `d \u2265 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 `\u03bd(\u2113) ~ c_{d,L} \u2113^(-1/3)` as `\u2113 \u2193 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 \u2264 d \u2192 0 < L \u2192 \u2203 c : \u211d, 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 \u2265 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 < \u2113 \u2264 ell_*`,\n`|\u03bdc(\u2113) - c \u2113^(-1/3)| \u2264 C`, `0 \u2264 \u03bdc(\u2113) - \u03bde(\u2113) \u2264 C` and `|\u03bde(\u2113) - c \u2113^(-1/3)| \u2264 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 * \u2113 ^ ((-1 : \u211d) / 3)| \u2264 C \u2227\n 0 \u2264 \u03bdc \u2113 - \u03bde \u2113 \u2227 \u03bdc \u2113 - \u03bde \u2113 \u2264 C \u2227\n |\u03bde \u2113 - c * \u2113 ^ ((-1 : \u211d) / 3)| \u2264 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 \u2208 [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) \u2265 c r^3` for all\n`0 < r \u2264 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} \u2113^(2/3) \u2264 \u03bdc(\u2113) - \u03bde(\u2113) \u2264 C_{B,K} \u2113^(2/3)` for all `0 < \u2113 \u2264 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 : \u211d) (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 \u211d (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : \u2115) : T"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "latticeVec",
+ "line": 49,
+ "source_header": "d)\n\n/-- The lattice vector `L n` for `n \u2208 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 : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "thetaSum",
+ "line": 58,
+ "source_header": ": \u211d))\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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) (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 : \u2115) (L : \u211d) {m : \u2115} (x : Fin m \u2192 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 : \u2115) (L : \u211d) (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 `\u22a4`).\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 : \u2115) (g :"
+ },
+ {
+ "kind": "structure",
+ "unqualified_name": "GaussianFieldInterface",
+ "line": 110,
+ "source_header": "ContDiff \u211d 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 : \u2115) (L : \u211d) where\n /-- The underlying probability space (sample space). -/\n \u03a9 : 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\u03a9`.\n [m\u03a9 : MeasurableSpace \u03a9]\n /-- The probability measure `P`. -/\n P : Measure \u03a9\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `\u03c9 \u21a6 f_\u03c9 : R^d \u2192 \u211d`. -/\n F : \u03a9 \u2192 E d \u2192 \u211d\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : \u2200 \u03c9, IsSmooth d (F \u03c9)\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 : \u2200 \u03c9, IsLPeriodic d L (F \u03c9)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : \u2200 z : E d, Summable (fun n : Fin d \u2192 \u2124 => Real.exp (-(\u2016z + latticeVec d L n\u2016 ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : \u2200 {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d), 0 \u2264 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 : \u2200 {m : \u2115} (x : Fin m \u2192 E d) (a : Fin m \u2192 \u211d),\n Measure.map (fun \u03c9 => \u2211 i, a i * F \u03c9 (x i)) P =\n ProbabilityTheory.gaussianReal 0 \u27e8covQuadForm d L x a, quad_nonneg x a\u27e9\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : \u2200 x y : E d, \u222b \u03c9, F \u03c9 x * F \u03c9 y"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "hessian",
+ "line": 152,
+ "source_header": "\u2202P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fr\u00e9chet\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": "\u211d :=\n iteratedFDeriv \u211d 2 g x ![v, w]\n\n/-- Critical point: vanishing Fr\u00e9chet 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 \u211d 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": "(\u2200 w \u2208 W, w \u2260 0 \u2192 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 \u2227 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 \u2227 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": "\u2115) (r : \u211d) (u : E d) : E d :=\n -((r / 2) \u2022 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 : \u2115) (r : \u211d) (u : E d) : E d :=\n (r / 2) \u2022 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 : \u2115) (g : E d \u2192 \u211d) (M S : E d) : \u211d :=\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 \u2227 IsIndexSaddle d g S \u2227 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 \u2192\n 0 < torusDist d L x y \u2192 g x \u2260 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 : \u2115) (L : \u211d) 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 \u2192 \u211d) \u2192 E d \u2192 \u211d\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 \u2192 \u211d) \u2192 E d \u2192 Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d \u2192 \u211d) \u2192 E d \u2192 E d \u2192 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192\n \u2200 M : E d, IsEssential g M \u2194 \u2200 y : E d, g y \u2264 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192\n \u2200 M : E d, \u00ac IsEssential g M \u2192 \u2200 h : \u211d,\n h < deathHeight g M \u2194\n \u2203 y : E d, g M < g y \u2227 \u2203 \u03b3 : Path M y, \u2200 t : unitInterval, h < g (\u03b3 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 : \u2200 (g : E d \u2192 \u211d), IsSmooth d g \u2192 IsLPeriodic d L g \u2192 IsMorseDistinct d L g \u2192\n \u2200 M S : E d, ElderPartner g M S \u2194\n (IsNondeg"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "IsFiniteBar",
+ "line": 323,
+ "source_header": "ax d g M \u2227 IsIndexSaddle d g S \u2227 \u00ac IsEssential g M \u2227 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`\u00ac 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 \u2227 0 < heightGap d g M S \u2227 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 : \u2115) (L : \u211d) (Pair"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pairCount",
+ "line": 346,
+ "source_header": "Domain d L \u2227 p.2 \u2208 FundDomain d L \u2227 Pair g p.1 p.2 \u2227 heightGap d g p.1 p.2 \u2208 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 : \u2115"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "IsLifetimeDensityVersion",
+ "line": 357,
+ "source_header": "d \u2192 Prop)\n (g : E d \u2192 \u211d) (A : Set \u211d) : \u2115 :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `\u03bd` 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, `\u03bd` is integrable on every Borel `A \u2286 (0, \u221e)`, and\n`\u222b_A \u03bd = 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\u03a9` (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 : \u2115) (L : \u211d) (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 \u2208 {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 \u211d (Fin d)`.\nDoes not claim: anything about the field or the torus `R^d/(24 Z^d)`. -/\nabbrev E (d : \u2115) : 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 \u2208 {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 \u2209 {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 \u2264 6`); nothing here encloses the coef"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "DerivativeBoundAtLeastOne",
+ "line": 234,
+ "source_header": "Real.exp (-(\u2016x\u2016 ^ 2) / 2) * pairingSum q \u2016x\u2016\n\n/-- Section 2: at `|x| \u2265 1` every unit-direction contraction of order `q \u2264 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| \u2264 76 * \u2016x\u2016 ^ 6 * Real.exp (-(\u2016x\u2016 ^ 2) / 2)\n\n/-- Section 2: at zero every unit-direction contraction of order `q \u2264 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 \u2192\n |iteratedFDeriv \u211d q (Kinf d) 0 u| \u2264 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 \u2192 \u2124) : \u211d :=\n \u2211 i, ((n i : \u2124) : \u211d) ^ 2\n\n/-- The lattice-image term `|n|^6 exp(-288 |n|^2)` for `n \u2260 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 \u2264 3`, the image family is summable and\n`sum_{n \u2260 0} |n|^6 exp(-288|n|^2) \u2264 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 \u2192 \u2124, imageTerm d n) \u2264 1458 * Real.exp (-288)\n\n/-- Section 2: successive terms `j^9 exp(-288 j^2)`, `j \u2265 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 : \u211d) ^ 2))) \u2227\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) \u2227 Real.exp (-288) < 1 / 10 ^ 125\n\n/-- Display (2): for `d \u2208 {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 \u211d 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 \u211d 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 \u2264 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 : \u2115) : Type := {p : Fin d \u00d7 Fin d // p.1 \u2264 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 : \u2115) : Type := Fin d \u2295 Unit \u2295 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 = \u2202_{R i} f`, `t = \u2202_u^3 f`, `H_{ij} = \u2202_{R i} \u2202_{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 : \u2115) (u : E d) (R : Fin d \u2192 E d) : JointIndex d \u2192 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 : \u2115) : JointIndex d \u2192 \u211d\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, \u2026, 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)) : \u211d :=\n iteratedFDeriv \u211d 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(\u2202^\u03b1 f, \u2202^\u03b2 f) = (-1)^{|\u03b2|} \u2202^{\u03b1+\u03b2} 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 : \u2115) (K : E d \u2192"
+ },
+ {
+ "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) = -\u2202_{R i} \u2202_{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) \u211d :=\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 = \u2202_u \u2202_{R i} f`:\n`Cov(V_i, V_j) = \u2202_u \u2202_{R i} \u2202_u \u2202_{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) \u211d :=\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) = -\u2202_u^3 \u2202_{R j} K(0)` of `t = \u2202_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, \u2026, 0)` (that is `ReferenceOddAndPinBlocks`). -/\nnoncomputab"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "thirdVar",
+ "line": 419,
+ "source_header": ": Fin d \u2192 E d) : Fin d \u2192 \u211d :=\n fun j => - derivContraction d K 0 [u, u, u, R j]\n\n/-- The variance `Var(t) = -\u2202_u^6 K(0)` of `t = \u2202_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 : \u2115) (K : E d \u2192 \u211d) (u : E d) : \u211d :=\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)\u207b\u00b9 (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 \u2192 E d) :\n Matrix (JointIndex d) (JointIndex d) \u211d :=\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 \u2192 E d) :\n Matrix (JointIndex d) (JointIndex d) \u211d :=\n jointCov d (K24 d) u R\n\n/-- Display (3): for `d \u2208 {2, 3}`, in every orthonormal frame `R` (with `u = R 0`),\n`(1-epsilon) C_ref \u2264 C_24 \u2264 (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 \u2227\n ((1 + epsilon) \u2022 Cref d (R \u27e80, hd\u27e9) R - C24 d (R \u27e80, hd\u27e9) 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 \u27e80, hd\u27e9) R a b - Cref d (R \u27e80, hd\u27e9) R a b| \u2264 2 * imageConstE\n\n/-- Section 3: `C_ref \u2265 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 \u00b1 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 \u27e80, hd\u27e9) R - (1 / 3 : \u211d) \u2022 (1 : Matrix (JointIndex d) (JointIndex d) \u211d)).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, \u2026, 0)`, `Cov(V) = diag(3, 1, \u2026, 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 = \u27e80, hd\u27e9 then 3 else 1) \u2227\n condThirdVariance d (Kinf d) (R \u27e80, hd\u27e9) 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 : \u211d) / 2) * C.det ^ (-(1 : \u211d) / 2) *\n Real.exp (-(dotProduct x (Matrix.mulVec C\u207b\u00b9 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 : \u2115) : \u2115 := m * (m + 1) / 2\n\n/-- Section 4 density comparison: if `(1-epsilon) C0 \u2264 C \u2264 (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} \u2264 phi_C \u2264 [(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 \u00b1 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 : \u211d) / 2) *\n gaussDensity (symCoordDim m) ((1 + epsilon) \u2022 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 : \u2115) : \u211d :=\n ((d - 1 : \u2115) : \u211d) + 2 / 3 + (symCoordDim (d - 1) : \u211d) / 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 : \u2115) : \u211d :=\n (d : \u211d) + (symCoordDim (d - 1) : \u211d) / 2\n\n/-- Section 4 ratio bounds: for `d \u2208 {2, 3}`,\n`1 - 13 epsilon \u2264 (1-epsilon)^a / (1+epsilon)^b` and `(1+epsilon)^a / (1-epsilon)^b \u2264 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 \u2264 32`, `28 \u2264 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 \u2227\n (1 + epsilon) ^ exponentA d / (1 - epsilon) ^ exponentB d \u2264 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,\u2026,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 \u27e80, hd\u27e9) R) 0 =\n (2 * Real.pi) ^ (-(d : \u211d)) / 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 : \u2115) : \u211d :=\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 : \u211d)) / Real.sqrt 3) * (Real.sqrt 6) ^ ((4 : \u211d) / 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 + \u2026` formula (kernel-checked arithmetic on main, `UniversalLaw.Side24.trace_and_traceless_variances`). -/\nstructure ConeMomentInterface where\n /-- The sample space. -/\n \u03a9 : Type\n /-- Its sigma-algebra. -/\n [m\u03a9 : MeasurableSpace \u03a9]\n /-- The probability measure. -/\n P : Measure \u03a9\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 : \u03a9 \u2192 \u211d\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 : \u03a9 \u2192 \u211d\n /-- The traceless coordinate `x`. -/\n x : \u03a9 \u2192 \u211d\n /-- The traceless coordinate `y`. -/\n y : \u03a9 \u2192 \u211d\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 \u03c9 => (s \u03c9, x \u03c9, y \u03c9)"
+ },
+ {
+ "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 : \u211d) : Matrix (Fin 2) (Fin 2) \u211d :=\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 : \u211d \u00d7 \u211d \u00d7 \u211d) : 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 : \u211d \u00d7 \u211d \u00d7 \u211d) : \u211d :=\n Set.indicator {q : \u211d \u00d7 \u211d \u00d7 \u211d | 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 \u222b \u03c9, Set.indicator (Set.Iio (0 : \u211d)) (fun a => a ^ 2) (I.A \u03c9) \u2202I.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 \u222b \u03c9, coneIntegrand (I.s \u03c9, I.x \u03c9, I.y \u03c9) \u2202I.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 : \u211d) * (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 \u222b \u03c9, I.s \u03c9 ^ 2 \u2202I.P = 5 / 3 \u2227\n \u222b \u03c9, I.s \u03c9 ^ 4 \u2202I.P = 25 / 3 \u2227\n \u222b \u03c9, Real.exp (-(I.s \u03c9 ^ 2) / 2) \u2202I.P = Real.sqrt (3 / 8)\n\n/-- Section 1: `R^2 = x^2 + y^2` has density `exp(-z/2)/2` on `(0, \u221e)`, written through its\ndistribution function `P(R^2 \u2264 a) = \u222b_0^a exp(-z/2)/2 dz` for `a \u2265 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 \u2200 a : \u211d, 0 \u2264 a \u2192\n (I.P {\u03c9 | I.x \u03c9 ^ 2 + I.y \u03c9 ^ 2 \u2264 a}).toReal = \u222b z in (0 : \u211d)..a, Real.exp (-z / 2) / 2\n\n/-- Section 1 elementary integral: for `a \u2265 0`,\n`\u222b_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 \u2200 a : \u211d, 0 \u2264 a \u2192\n \u222b z in (0 : \u211d)..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 : \u2115 \u2192 \u211d\n /-- Scope clause \"using ordinary sphere area\": the surface measure `sigma` on `S^(d-1)`. -/\n sphereMeasure : (d : \u2115) \u2192 Measure (E d)\n /-- The sphere measure is carried by the unit sphere. -/\n sphereMeasure_support : \u2200 d : \u2115, sphereMeasure d ((Metric.sphere (0 : E d) 1)\u1d9c) = 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 \u2227 (sphereMeasure 3 Set.univ).toReal = 4 * Real.pi\n /-- Parent (15.2) ingredient: the gradient density at zero `p_G(0)`. -/\n pG0 : \u2115 \u2192 \u211d\n /-- Parent (15.2) ingredient: the pin density at zero `p_{V_u}(0)` for the direction `u`. -/\n pV0 : (d : \u2115) \u2192 E d \u2192 \u211d\n /-- Parent (15.1) ingredient: `tau_u`, with `tau_u^2 = Var(t_u | G = 0)`. -/\n tau : (d : \u2115) \u2192 E d \u2192 \u211d\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 : \u2115) \u2192 E d \u2192 \u211d\n /-- Parent clause: positive density `p_G(0)`. -/\n pG0_pos : \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192 0 < pG0 d\n /-- Parent clause: positive density `p_{V_u}(0)` for every unit direction. -/\n pV0_pos : \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192 \u2200 u : E d, \u2016u\u2016 = 1 \u2192 0 < pV0 d u\n /-- Parent clause: `tau_u > 0` for every unit direction. -/\n tau_pos : \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192 \u2200 u : E d, \u2016u\u2016 = 1 \u2192 0 < tau d u\n /-- Parent clause: `D_u > 0` for every unit direction. -/\n coneMoment_pos : \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192 \u2200 u : E d, \u2016u\u2016 = 1 \u2192 0 < coneMoment d u\n /-- The theta family of `K_24` is summable. -/\n theta_summable : \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192 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 : \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192 \u2200 R : Fin d \u2192 E d, Orthonormal \u211d R \u2192\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 : \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192 \u2200 (hd : 0 < d) (R : Fin d \u2192 E d), Orthonormal \u211d R \u2192\n pV0 d (R \u27e80, hd\u27e9) = gaussDensity d (pinCov d (K24 d) (R \u27e80, hd\u27e9) 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 : \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192 \u2200 (hd : 0 < d) (R : Fin d \u2192 E d), Orthonormal \u211d R \u2192\n tau d (R \u27e80, hd\u27e9) ^ 2 = condThirdVariance d (K24 d) (R \u27e80, hd\u27e9) R\n /-- Parent display (15.2), for `d \u2208 {2, 3}`. -/\n eq_15"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "CoefficientEnclosure",
+ "line": 815,
+ "source_header": "2 : \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192\n c24 d = Real.Gamma (7 / 6) / ((24 : \u211d) ^ ((1 : \u211d) / 3) * Real.sqrt Real.pi) *\n \u222b u, pG0 d * pV0 d u * tau d u ^ ((4 : \u211d) / 3) * coneMoment d u \u2202(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 \u2227 I.c24 2 < d2Upper \u2227 d3Lower < I.c24 3 \u2227 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 \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192 |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 \u2260 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 : \u2115) : Type := {i : Fin d // 0 < i.val}\n\n/-- Transverse `svec` coordinates: the `svec` indices `(i, j)`, `i \u2264 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 : \u2115) : 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 : \u2115) (a : TransIndex d) : \u211d :=\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 = \u2202_{R i} \u2202_{R j} f`, `i, j \u2260 0`, by the\nstationary rule `Cov(\u2202^\u03b1 f, \u2202^\u03b2 f) = (-1)^{|\u03b2|} \u2202^{\u03b1+\u03b2} 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": ": \u2115) (K : E d \u2192 \u211d) (R : Fin d \u2192 E d) :\n Matrix (TransIndex d) (TransIndex d) \u211d :=\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 = \u2202_u \u2202_{R i} f`: `Cov(A_ab, V_i) = \u2202_{R a} \u2202_{R b} \u2202_u \u2202_{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 : \u2115) (K : E d \u2192 \u211d) (u : E d) (R : Fin d \u2192 E d) :\n Matrix (TransIndex d) (Fin d) \u211d :=\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 : \u2115) (K : E d \u2192 \u211d) (u : E d) (R : Fin d \u2192 E d) :\n Matrix (TransIndex d) (TransIndex d) \u211d :=\n transCov d K R - transPinCov d K u R * (pinCov d K u R)\u207b\u00b9 * (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) \u211d :=\n Matrix.of fun i j =>\n if h : i.1 \u2264 j.1 then v \u27e8\u27e8(i.1, j.1), h\u27e9, i.2\u27e9 / (if i = j then 1 else Real.sqrt 2)\n else v \u27e8\u27e8(j.1, i.1), le_of_not_ge h\u27e9, j.2\u27e9 / 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 : \u2115) (v : EuclideanSpace \u211d (TransIndex d)) : \u211d :=\n Set.indicator {v : EuclideanSpace \u211d (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 : \u2115) (K : E d \u2192 \u211d) (u : E d) (R : Fin d \u2192 E d) : \u211d :=\n \u222b v, coneIntegrandTrans d v \u2202(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 : \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192 \u2200 (hd : 0 < d) (R : Fin d \u2192 E d), Orthonormal \u211d R \u2192\n (pinCov d (K24 d) (R \u27e80, hd\u27e9) 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 : \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192 \u2200 (hd : 0 < d) (R : Fin d \u2192 E d), Orthonormal \u211d R \u2192\n (condHessianCov d (K24 d) (R \u27e80, hd\u27e9) 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 : \u2200 d : \u2115, d = 2 \u2228 d = 3 \u2192 \u2200 (hd : 0 < d) (R : Fin d \u2192 E d), Orthonormal \u211d R \u2192\n coneMoment d (R \u27e80, hd\u27e9) = coneMomentOf d (K24 d) (R \u27e80, hd\u27e9) 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 \u211d (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : \u2115) :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "latticeVec",
+ "line": 120,
+ "source_header": "in d)\n\n/-- The lattice vector `L n` for `n \u2208 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 : \u2115) (L : \u211d) (n : Fin d \u2192 \u2124"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "hessian",
+ "line": 129,
+ "source_header": "i : \u211d))\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fr\u00e9chet\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 : \u2115) (g : E d \u2192 \u211d) (x v w :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "IsCriticalPoint",
+ "line": 139,
+ "source_header": "x ![v, w]\n\n/-- Critical point: vanishing Fr\u00e9chet 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 : \u2115) (g : E d \u2192 \u211d) (x :"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "HessianHasInertia",
+ "line": 148,
+ "source_header": "v \u211d 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 : \u2115) (g : E d \u2192 \u211d) (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 : \u2115) (r : \u211d)"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "pinS",
+ "line": 173,
+ "source_header": "-((r / 2) \u2022 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 : \u2115) (r : \u211d"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "torusDist",
+ "line": 182,
+ "source_header": ":=\n (r / 2) \u2022 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] \u2264 (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 \u2264 A r^(-\u03b2)` and `P(E) \u2264 C r^3` then\n`E[N 1_E] \u2264 A^(1/p) C^(1-1/p) r^((3(p-1)-\u03b2)/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`, `\u03b2`, `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) - \u03b2) / 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)\u207b\u00b9 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 \u2265 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 : \u211d) 1)\n\n/-- The counterexample count `N_r = ceil(log(1/r)) 1_{E_r}` with `E_r = {U \u2264 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 : \u211d)) u\n\n/-- Shape of the sharp counterexample (N4): for `0 < r \u2264 e^(-1)`, `P(E_r) = r^3` and\n`E N_r / r^3 = ceil(log(1/r))`, which tends to infinity as `r \u2193 0`, while for EACH finite\n`p \u2265 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 \u2202uniformLaw \u2264 A)\n\n/-- Shape of (N5), the exponential-tail layer-cake bound: if `P(N > t) \u2264 A exp(-t/B)` for\nall `t \u2265 0` with `A \u2265 1`, `B > 0`, and `q = P(E) > 0`, then\n`E[N 1_E] \u2264 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 `\u03a9` 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 \u2265 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` (`\u2016S - M\u2016 = 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 `\u039b` 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 `\u039b` 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 : \u2115) [NeZero d] (L : \u211d) (\u03a9 : Type) [MeasurableSpace \u03a9] where\n /-- The sample paths `\u03c9 \u21a6 f_\u03c9 : R^d \u2192 \u211d`. -/\n F : \u03a9 \u2192 E d \u2192 \u211d\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 : \u2200 (\u03c9 : \u03a9) (n : \u2115), ContDiff \u211d n (F \u03c9)\n /-- Section 1 clause: the field lives \"On X=R^d/(L Z^d)\"; every sample path is `L`-periodic. -/\n periodic : \u2200 (\u03c9 : \u03a9) (x : E d) (n : Fin d \u2192 \u2124), F \u03c9 (x + latticeVec d L n) = F \u03c9 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 : \u211d \u2192 \u211d \u2192 \u211d \u2192 OrthonormalBasis (Fin d) \u211d (E d) \u2192 Measure \u03a9\n /-- `Q_r` is a probability measure. -/\n Q_prob : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (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 : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (E d)), 0 < r \u2192 r < L \u2192\n \u2200\u1d50 \u03c9 \u2202(Q r b k R),\n F \u03c9 (pinM d r (R 0)) = b \u2227 F \u03c9 (pinS d r (R 0)) = b - k * r ^ 3 \u2227\n IsCriticalPoint d (F \u03c9) (pinM d r (R 0)) \u2227 IsCriticalPoint d (F \u03c9) (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 : \u211d \u2192 \u211d \u2192 \u211d \u2192 OrthonormalBasis (Fin d) \u211d (E d) \u2192 \u03a9 \u2192 \u211d\n /-- `W_r \u2265 0` (a product of filtered absolute determinants). -/\n W_nonneg : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (E d)) (\u03c9 : \u03a9), 0 \u2264 W r b k R \u03c9\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 \u2260 0` forces `H_M` negative definite and `H_S` of index\n `d-1`. -/\n W_typed : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (E d)) (\u03c9 : \u03a9), W r b k R \u03c9 \u2260 0 \u2192\n HessianHasInertia d (F \u03c9) (pinM d r (R 0)) d \u2227 HessianHasInertia d (F \u03c9) (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 : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (E d)), 0 < r \u2192 r < L \u2192\n 0 < \u222b \u03c9, W r b k R \u03c9 \u2202(Q r b k R)\n /-- The tilted law `Q_r^W`. -/\n QW : \u211d \u2192 \u211d \u2192 \u211d \u2192 OrthonormalBasis (Fin d) \u211d (E d) \u2192 Measure \u03a9\n /-- Section 1 clause: `dQ_r^W=(W_r/Z_r)dQ_r`, exactly, in the pin regime `0 < r < L`. -/\n QW_eq : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (E d)), 0 < r \u2192 r < L \u2192\n QW r b k R = (Q r b k R).withDensity\n (fun \u03c9 => ENNReal.ofReal (W r b k R \u03c9 / \u222b \u03c9', W r b k R \u03c9' \u2202(Q r b k R)))\n /-- `Q_r^W` is a probability measure. -/\n QW_prob : \u2200 (r b k : \u211d) (R : OrthonormalBasis (Fin d) \u211d (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 \u039b : \u2115 \u2192 \u211d \u2192 \u211d \u2192 E d \u2192 E d \u2192 \u211d\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 \u2227 HessianHasInertia d g x j \u2227\n b - k * r ^ 3 < g x \u2227 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 \u2208 A \u2227 IsCriticalPoint d g x \u2227 b - k * r ^ 3 < g x \u2227 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)) : \u2115 :=\n \u2211 j \u2208 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 \u2208 A \u2227 IsCriticalPoint d g x \u2227 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 \u03c1 : \u211d) : Set (E d) :=\n {x : E d | x \u2208 FundDomain d L \u2227 \u03c1 \u2264 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 \u2227 0 < torusDist d L x (pinM d r u) \u2227 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 : \u2115) [NeZero d] (L : \u211d) (\u03a9 : Type) [MeasurableSpace \u03a9]\n (I : Pin"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "nearPinPairCount",
+ "line": 457,
+ "source_header": "\u211d (E d)) (\u03c9 : \u03a9) : \u2115 :=\n windowCountAll d (I.F \u03c9) 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 `\u03b7` 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 `\u03b7` 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 \u2227\n (torusDist d L q.1 (pinM d r u) < \u03b7 \u2228 torusDist d L q.1 (pinS d r u) < \u03b7)}\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 \u21a6 x0 + r \u2211 p_i R_i`. With `x0 = 0` these\nare the midpoint scaled coordinates `X = r(u, v)`, in which the pins are `(\u00b11/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 `(\u00b11/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 : \u2115) ("
+ },
+ {
+ "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 \u2022 \u2211 i, p i \u2022 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_{\u03b7,R}` without defining it, and this definition is ta"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "omegaD",
+ "line": 501,
+ "source_header": "0 : Fin d) (-(1 : \u211d) / 2)\u2016 \u2227\n \u03b7 \u2264 \u2016p - EuclideanSpace.single (0 : Fin d) ((1 : \u211d) / 2)\u2016}\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) : \u211d :=\n (max \u2016p - EuclideanSpace.single (0 : Fin d) (p 0)\u2016 (r * |p 0|)) ^ ((2 : \u211d) - 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 : \u2115) [NeZero d] (L : \u211d) (\u03a9 : Type) [MeasurableSpace \u03a9]\n (I : PinnedLawInte"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "meanAllHeightCount",
+ "line": 522,
+ "source_header": "(j : \u2115)\n (A : Set (E d)) : \u211d :=\n \u222b \u03c9, (windowCount d (I.F \u03c9) b k r j A : \u211d) \u2202(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 : \u2115) [NeZero d] (L : \u211d) (\u03a9 : Type) [MeasurableSpace \u03a9]\n (I : PinnedLawIn"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "FixedRemoteMeanMeasureA2",
+ "line": 533,
+ "source_header": "d)) (j : \u2115)\n (A : Set (E d)) : \u211d :=\n \u222b \u03c9, (allHeightCount d (I.F \u03c9) j A : \u211d) \u2202(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 \u2265 2`, `L > 0`,\n`0 < \u03c1 < 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 \u2264 r_*`, `b \u2208 B`, `k \u2208 K`, frames `R`, indices `j \u2264 d` and Borel `E \u2286 D_\u03c1`,\n`| E_(Q_r^W) N_(r,j)(E)/(k r^3) - \u222b_E Lambda_j(x;b,k,u) dx | \u2264 C r |E|`; and the kernel\n`Lambda_j` is continuous on `D_\u03c1`, 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 `\u039b`) is a given object; the statement is about any `\u039b` 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.\u039b` with the kernel (13); the total-variation convergence remark; the multi-witness Section 6; any numerical `C` or `r_*`; uniformity as `\u03c1 \u2192 0`; nonauthor review or acceptance (the landing disposition HOLD_WITH_DOMAIN is transcribed by the register, not here). -/\ndef FixedRemoteMeanMeasureA2 (d : \u2115) [NeZero d] (L"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "FixedRemoteCountBoundA3",
+ "line": 561,
+ "source_header": "I r b k R j A / (k * r ^ 3) - \u222b x in A, I.\u039b j b k (R 0) x| \u2264\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 \u2264 r_*`, `b \u2208 B`, `k \u2208 K`, frames,\nindices and Borel `E \u2286 D_\u03c1`, `E_(Q_r^W) N_(r,j)(E) \u2264 C k r^3 |E|` and\n`P_(Q_r^W){N_(r,j)(E) \u2265 1} \u2264 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 : \u2115) [NeZero d] ("
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "FixedAnnulusWindowCandidateA2",
+ "line": 581,
+ "source_header": "R) {\u03c9 | 1 \u2264 windowCount d (I.F \u03c9) b k r j A}).toReal \u2264\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 \u2208 [bLo, bHi]`, `0 < kLo \u2264 k \u2264 kHi`), fixed scaled annulus\n`K = {A0 \u2264 |(u,t)| \u2264 B0}` with `1 < A0 < B0`; there are `C, r_* > 0`, uniform in the frame,\nthe marks, the Borel `E0 \u2286 K` and `j \u2208 {0,1,2}`, such that\n`E_(Q_r^W) N_j(r E0) \u2264 C k r^3 area(E0)` for `0 < r \u2264 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 \u2192 0`, as `B0 \u2192 \u221e`, or for `d \u2265 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 \u03a9 I r b k R j (scaledAt 2 R r 0 E0) \u2264\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 \u2264 |(u,v)| \u2264 B}` with\n`1 < A < B`; there are `C, r_* > 0`, uniform in the marks, frames, Borel `E \u2286 K_AB` and\n`j \u2208 {0,1,2}`, such that `E_(Q_r^W) N_j(rE) \u2264 C r^3 area(E)` for `0 < r \u2264 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 \u2282 {0 < p\u00b2 + q\u00b2 \u2264 1/16}` in the endpoint chart, `E_{Q_r^W} N_j(M + rE) \u2264 C r\u00b3|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) \u2264 C r\u00b3|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 \u03a9 I r b k R j (scaledAt 2 R r (pinS 2 r (R 0)) E0) \u2264\n C * r ^ 3 * (volume E0).toReal\n\n/-- Shape of row D5-b (microdisk): all heights; for fixed `\u03ba > 0`, the expected index-`j`\ncount in the punctured disk of physical radius `\u03ba r\u00b2` about each pin is `O(r\u2075)`: there are\n`C, r_* > 0` with `E_{Q_r^W} N_j(disk) \u2264 C r^5` for `0 < r \u2264 r_*`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"the nested disks of radius `\u03bar\u00b2` about each pin, for fixed `\u03ba`: `O(r\u2075)`\"\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 `\u03ba`; nonauthor review or acceptance. -/\ndef"
+ },
+ {
+ "kind": "def",
+ "unqualified_name": "D5cCollarC1",
+ "line": 669,
+ "source_header": "t 2 L \u03a9 I r b k R j\n {x : E 2 | 0 < \u2016x - pinS 2 r (R 0)\u2016 \u2227 \u2016x - pinS 2 r (R 0)\u2016 \u2264 \u03ba * r ^ 2} \u2264 C * r ^ 5\n\n/-- Shape of row D5-c (C1, compact collar): all heights; for fixed `R \u2265 1` and\n`0 < \u03b7 \u2264 1/4`, for Borel `E \u2282 C_{\u03b7,R}` in midpoint scaled coordinates,\n`E_{Q_r^W} N_j(rE) \u2264 C r\u00b3|E|`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"for Borel `E \u2282 C_{\u03b7,R}`, `\u03b7 \u2264 1/4`, fixed `R \u2265 1`\"\nInterface: `I` is a given object; `C_{\u03b7,R}` is `collar 2 \u03b7 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 \u03a9 I r b k R j (scaledAt 2 R r 0 E0) \u2264\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 \u2265 1`, `E_{Q_r^W} N_j(r B_R \u2216 {M,S}) \u2264 C_R r\u00b3`, 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 \u2216 {M,S}) \u2264 C_R r\u00b3\"\nInterface: `I` is a given object.\nDoes not claim: the composition `D5-a + D5-c at \u03b7 = 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 : \u211d) / 2) \u2227\n p \u2260 EuclideanSpace.single (0 : Fin 2) ((1 : \u211d) / 2)}) \u2264 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 \u2264 |X| \u2264 \u03c1}` satisfy `E N \u2264 C r\u00b3(A_0^{\u22122} + \u03c1\u00b2)`: there are `C, s_0 > 0` such that\nfor `A_0 \u2265 4` and `A_0 r < \u03c1 \u2264 s_0` the expected index-`j` window count in\n`{A_0 r \u2264 |X| \u2264 \u03c1}` (distance from the midpoint) is at most `C r^3 (A_0^(-2) + \u03c1^2)`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"E N \u2264 C r\u00b3(A_0^{\u22122} + \u03c1\u00b2)\"\nInterface: `I` is a given object; the side conditions `A_0 \u2265 4`, `A_0 r < \u03c1 \u2264 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 \u03a9 I r b k R j {x : E 2 | A0 * r \u2264 \u2016x\u2016 \u2227 \u2016x\u2016 \u2264 \u03c1} \u2264\n C * r ^ 3 * ((A0 ^ 2)\u207b\u00b9 + \u03c1 ^ 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\u00b2 \u2216 {M,S}) \u2264 C r\u00b3`, and for the event `A_r` that some critical\npoint other than `M, S` has height in `I_r`, `c r\u00b3 \u2264 P(A_r) \u2264 C r\u00b3` 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\u00b2 \u2216 {M,S}) \u2264 C r\u00b3\"\nInterface: `I` is a given object; `A_r` is the event `{N \u2265 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 \u03a9 I r b k R \u03c9}).toReal \u2227\n ((I.QW r b k R) {\u03c9 | 1 \u2264 torusWindowCount 2 L \u03a9 I r b k R \u03c9}).toReal \u2264 C * r ^ 3)\n\n/-! ### The dimension lift: Theorems P_d, C_d, I_d, G_d (every fixed d \u2265 2) -/\n\n/-- Shape of Theorem P_d (all-height punctured pin ball), display (1.2): fixed `d \u2265 2`,\n`L > 0`, compact marks; there are `C, C', r_* > 0` such that for `0 < r \u2264 r_*`, all `b, k, R, j`\nand every Borel `E \u2286 D = {0 < p\u00b2 + |q|\u00b2 \u2264 1/16}` in the endpoint chart,\n`E_(Q_r^W) N_j(M + r E) \u2264 C r^3 \u222b_E omega_d \u2264 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) \u2264\n C * r ^ 3 * \u222b p in E0, omegaD d r p \u2227\n C * r ^ 3 * \u222b p in E0, omegaD d r p \u2264 C' * r ^ 3)\n\n/-- Shape of Theorem C_d (compact collar), display (1.3): fixed `d \u2265 2`, `L > 0`, compact\nmarks, fixed `R \u2265 1` and `0 < \u03b7 \u2264 1/4`; there are `C, r_* > 0` such that for every Borel\n`E \u2286 C(\u03b7, R)`, `E_(Q_r^W) N_j(r E) \u2264 C r^3 |E|` for `0 < r \u2264 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(\u03b7, R)` is `collar d \u03b7 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 \u03b7 R0 \u2192\n meanAllHeightCount d L \u03a9 I r b k R j (scaledAt d R r 0 E0) \u2264\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 \u2264 s/4` and `0 < s \u2264 s_0`,\n`E_(Q_r^W) N_(r,j)({ s \u2264 |X| \u2264 2 s }) \u2264 C r^3 [ (r/s)^2 + s^2 ]`, and hence, uniformly for\n`A_0 \u2265 4` and `A_0 r < \u03c1 \u2264 s_0`, `E_(Q_r^W) N_(r,j)({ A_0 r \u2264 |X| \u2264 \u03c1 }) \u2264 C r^3 (A_0^(-2) + \u03c1^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 \u03a9 I r b k R j {x : E d | A0 * r \u2264 \u2016x\u2016 \u2227 \u2016x\u2016 \u2264 \u03c1} \u2264\n C * r ^ 3 * ((A0 ^ 2)\u207b\u00b9 + \u03c1 ^ 2))\n\n/-- Shape of Theorem G_d (global height-window first moment), display (1.7): fixed `d \u2265 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} ) \u2264 C r^3` for `0 < r \u2264 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) \u211d (E d), \u2200 j : \u2115, j \u2264 d \u2192\n meanWindowCount d L \u03a9 I r b k R j (torusMinusPins d L r (R 0)) \u2264 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 \u2264 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) \u2264 C r^3 log(1/r)` for `0 < r \u2264 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": "\u222b \u03c9, (Nat.descFactorial (torusWindowCount 2 L \u03a9 I r b k R \u03c9) 2 : \u211d) \u2202(I.QW r b k R) \u2264\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 \u2265 2`, `L > 0`, compact marks; for every fixed integer `q \u2265 2` there are `C_q, r_* > 0`\nsuch that `E_(Q_r^W)[ (N)_q ] \u2264 C_q r^3` for `0 < r \u2264 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 \u2264 r_*`, all `b, k, R` and every fixed integer `q \u2265 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\u00e9 tail, the marked Kac-Rice formula with H\u00f6lder insertion, the regimes R1-R4); the dependence on [C6L] and [DL] at their bytes; a lower bound for `q \u2265 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) \u211d (E d),\n \u222b \u03c9, (Nat.descFactorial (torusWindowCount d L \u03a9 I r b k R \u03c9) q : \u211d) \u2202(I.QW r b k R) \u2264\n Cq * r ^ 3\n\n/-- Shape of Corollary Theta (the C6 order is `r^3`): in every fixed `d \u2265 2`, there are\n`c > 0`, `C` and `r_* > 0` such that `c r^3 \u2264 E_(Q_r^W)[ N(N-1) ] \u2264 C r^3` and\n`c r^3 \u2264 Q_r^W{ N \u2265 2 } \u2264 C r^3` for `0 < r \u2264 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 \u2264 torusWindowCount d L \u03a9 I r b k R \u03c9}).toReal \u2227\n ((I.QW r b k R) {\u03c9 | 2 \u2264 torusWindowCount d L \u03a9 I r b k R \u03c9}).toReal \u2264 C * r ^ 3\n\n/-! ### C6 rare-cluster consequences: Theorem O (abstract, on laws on \u2115) -/\n\n/-- Total-variation distance between two probability mass functions on `\u2115`: 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 (\u03bc \u03bd : \u2115 \u2192 \u211d) : \u211d :=\n (1 / 2) * \u2211' n : \u2115, |\u03bc n - \u03bd n|\n\n/-- The Poisson probability mass function `Pois(lam)(n) = exp(-lam) lam^n / n!`\n(for `lam \u2265 0`; `Pois(0) = \u03b4_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 \u2265 0`, not stated). -/\nnoncomputable def poissonPMF (lam : \u211d) (n : \u2115) : \u211d :=\n Real.exp (-lam) * lam ^ n / (Nat.factorial n : \u211d)\n\n/-- Shape of Theorem O (sharp ordinary-Poisson obstruction): for a family of laws\n`\u03bc_r` on `\u2115` (the law of the window count `N_r`) which, for all sufficiently small `r`\n(that is, for `0 < r \u2264 r_0` for some `r_0 > 0`), are probability mass functions with\nsummable mean satisfying only (H1) `E N_r \u2264 A r^3` and (H2) `P(N_r \u2265 2) \u2265 a r^3` with\n`a > 0`: then, for all sufficiently small `r`,\n`(a/2) r^3 \u2264 inf_{lambda \u2265 0} dTV(Law N_r, Pois(lambda)) \u2264 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 \u2264 r_0`, as in the source (\"for all sufficiently small\nr\"); imposing (H2) for every `r > 0` would be unsatisfiable (`a r^3 \u2264 1` fails for large\n`r`) and would make the statement hold for every family. The source's remark that the\npremises imply `2a \u2264 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 `\u03bc_r` are given probability mass functions on `\u2115` (nonnegative, summing to one, with summable mean) for `0 < r \u2264 r_0`; the hypotheses (H1), (H2) are hypotheses on that range only; nothing ties `\u03bc_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 \u2264 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: `\u2203 lam \u2265 0, dTV(Law N_r, Pois(lam)) \u2264 A r^3` implies `inf_{lam \u2265 0} dTV \u2264 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 \u2192\n (\u2200 lam : \u211d, 0 \u2264 lam \u2192 (a / 2) * r ^ 3 \u2264 pmfTV (\u03bc r) (poissonPMF lam)) \u2227\n (\u2203 lam : \u211d, 0 \u2264 lam \u2227 pmfTV (\u03bc r) (poissonPMF lam) \u2264 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 \u2265 2`,\n`L > 0`, `0 < \u03c1 < L/4`, compact marks; there are `C` and `r_* > 0` such that for\n`0 < r \u2264 r_*`, all marks and frames and every Borel `E \u2286 D_\u03c1`,\n`E_(Q_r^W) N(E)(N(E)-1) \u2264 C r^5 |E|` and `Q_r^W{ N(E) \u2265 2 } \u2264 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_\u03c1`, 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 \u2227\n ((I.QW r b k R) {\u03c9 | 2 \u2264 windowCountIndexSum d (I.F \u03c9) b k r A}).toReal \u2264\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 `\u03b7` of a pin\", at every mutual separation (the fixed-remote `P_\u03b7`\nof Corollary D covers only pairs with both witnesses at distance `\u2265 \u03b7` from the pins). The\nProp below is that target: fixed `d \u2265 2`, `L > 0`, `\u03b7 > 0`, compact marks; there are `C` and\n`r_* > 0` with `E_(Q_r^W) #{ordered window pairs with the first witness within \u03b7 of a pin} \u2264 C r^3`\nfor `0 < r \u2264 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 \u00a75 states its open obligation for the planar\ncase and makes no claim for `d > 2`; the formal target quantifies every `d \u2265 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 `\u03b7` 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\u22121)` 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\u22121) \u2265 2c r\u00b3` 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."
+ ]
+ }
+ ]
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/REPORT.txt b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/REPORT.txt
new file mode 100644
index 000000000..0c0cd2a25
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/REPORT.txt
@@ -0,0 +1,145 @@
+Lean/kernel foundation report — OpenAI/Codex — 2026-10-29
+
+Deliverable outcome
+
+Main's31 literal arithmetic theorem statements have actual pinned build, kernel,
+axiom, negative-control and finite-domain nonvacuity evidence. They do not close
+an analytic parent, identify a Gaussian moment, or enclose a SIDE24 coefficient.
+The portable command is:
+ python -B -S tools/cbz_lean_check.py
+with the pinned Lean bin directory on PATH. Its source inputs are NEW files
+ tools/cbz_lean_check.py
+ tools/CBZNonvacuity.lean
+ tests/test_cbz_lean_check.py
+No original Lean statement, manifest, source scope, dependency pin, or failing
+test was changed. The17 original Main formal files remain byte-identical.
+No Git refs, commits, PRs or remote settings were written by this worker.
+
+Actual Main evidence
+
+Initial source commit4ef1867175dbe1072a54a02e95f80c4e2c70a4ff; all17 formal files
+were compared to their actual Git objects. Manifest SHA256:
+38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0.
+The initial exact preserved-copy existing-gate execution passed31 target axiom
+reports (all empty),10 intended rejection controls and normal named-module
+replay. The stronger --fresh replay passed; its earlier150s timeout is retained.
+
+Latest portable end-to-end observed receipt checked_commit:
+f20cc54d4d136e854608853372249882eb4c949f.
+Actual result:45 project constants plus4 witness/auditor constants,31 original ConstantInfo.thmInfo proofs,6/6 real
+census/premise controls,4 witness axiom reports,named witness recheck and full
+--fresh UniversalLaw empty-environment replay all pass. The preserved receipt
+is portable-main-receipt.json; the repository-native receipt is
+formal/.lake/cbz-evidence/receipt.json. The new audit files are bound by exact
+hashes. They were untracked at this run; rerun the final portable command after
+the integration commit for the final current-commit record.
+
+The29 theorem rows without proposition binders are distinguished from the two
+finite-domain conditional rows:
+- UniversalLaw.Side24.pairing_sum_le_six: q in [0,1,2,3,4,5,6].
+- UniversalLaw.Side24.exponent_bounds: d in [2,3].
+Explicit witnesses for every admissible value and both existential domains were
+compiled and kernel-rechecked. Their only transitive axioms are propext and
+Quot.sound. No custom axiom was introduced.
+MAIN_PROOF_INDEX.json records exact statements,modules,source hashes and premise
+boundaries. Definitions and statement-only Props are not promoted to proofs.
+
+The pinned LeanChecker source establishes that a normal module argument selects
+its entire module-name prefix. Thus the existing UniversalLaw call already
+covers all four project modules; there is no established empty-root flaw.
+--fresh additionally replays imported and project constants into a new kernel
+environment. This is Lean's own kernel,not a separately implemented verifier.
+
+Portable audit controls / tests
+
+The14 protocol unit tests passed normal andoptimized Python. Initial missing-
+feature red output is preserved. Actual six controls compile honest,unused
+custom axiom,sorry,native computation,False-premise and missing-module cases.
+The False-premise theorem passes Lean's axiom check but the premise gate refuses
+its promotion. This explicitly demonstrates why an empty axiom list alone does
+not prove hypothesis satisfiability. The existing Main gate49 tests were also rerun with the pinned bin on PATH:
+all49 pass in each normal/optimized mode with no skips. Earlier PATH-dependent skips remain preserved in their
+original logs, and the runtime phase is independently observed in the portable
+command. This worker does not
+claim the entire repository regression is100%; Root owns that final run.
+
+Current Math source / gates
+
+Current proper Git clone:
+/workspace/cbz0/repos/Math-
+commit8151f592918a845bf19eb8eafaf8444540a32734.
+All162 Lean files are hash-inventoried and originals preserved. The older Oct23
+snapshot has88 Lean files; all previous88 are unchanged,74 sources are added in
+the current tree. Current63-target scalar pilot source gate passes with effective
+manifest+overlay digest:
+481653d73d00f64bf06fefbf24be994f60ebe5c54f826abf899461f6e6937066.
+Its244 selftests pass in each normal/optimized mode. The current strict statement
+and proof source gates pass with23/23 source objects verified in Git history and
+CLEAN worktree.143 Prop definitions specify statements; the78 proof-packet
+proofs are distinct. No current Math kernel execution is inferred from them.
+
+Additional observed source gates: cap152 targets and38 selftests; determinant
+source gate and78 selftests; four torus/d2 companion source gates; lifetime
+strict static evidence validator and its mutation controls all pass at their
+explicit source/static scope. These results are not Lean executions.
+
+Do not erase actual current mathematical progress: the C291 literal
+GaussianFieldInterface constructor is present and its historical raw evidence
+passes static source binding. Current derivative/endpoint/whole-carrier sources
+also contain actual lower-normalizer and weighted-law constructions,with saved
+182-target endpoint and109-declaration field-conditioning ledgers. This worker
+has not rerun those packages. Historical evidence is preserved with its original
+OpenAI/source-exposed attribution. No new organizationally independent review,
+human approval,or parent acceptance is inferred or required as an invented gate.
+
+Toolchain / Math execution attempts
+
+Observed Lean4.34.1 commit5045d0056413266e57c625dcd7c365b10e377c52;
+Lake5.0.0-src+5045d00. Existing installation initially omitted headers/static
+libraries and could not compile the official cache executable. The existing
+580432872-byte pinned release archive was SHA256-verified:
+47bf4bbd78f70c2e9670598ab7124d92b6efb7330ff33e5fbb4030f6fd72e4e4.
+Only missing include files and28 native library/object files (420819322 bytes)
+were added. Every restored file was compared byte-for-byte by SHA256 against
+its archive member. Existing executables were unchanged; lean/lake/leanchecker/LeanChecker.olean and the233708536-byte shared kernel library additionally match their pinned archive members byte-for-byte. Official cache now
+compiles. All9 installed dependency Git revisions match the lock and are clean;
+mathlib is d13f23b723b8a846827a245b89c10fc7d3f11612.
+
+Ordinary Math build initially reached286 dependency modules,then was stopped
+for official cache strategy. Six official cache invocations are preserved (two native-toolchain failures and four progressing download attempts);
+resource monitors stop only their task-owned process group,with an observed
+inert-fixture termination selftest. Cache is still incomplete at the latest
+recorded pause (~439 of8908 packed entries remaining;some in-flight decompression may also remain),and the shared1400MiB reserve
+was reached. No Math project build,kernel or axiom pass is claimed. Partial
+cache is reusable. Further safe duplicate-space recovery can unblock the last
+cache entries; packed temporary caches may only be removed after actual unpack
+and content verification plus a reacquisition manifest.
+
+Unmet boundaries / minimal repairs
+
+QUARANTINE_BOUNDARIES.json gives16 exact source/hash runtime/semantic boundaries
+covering all162 current Math Lean files,owner:none. This is explicit current
+closure residue; it neither retracts historical kernel evidence nor calls source
+theorems false because a current run lacks resources. No failed test is removed
+or disabled. Main's closed dependency-free formal package imports none of these
+Math sources,so its31 literal closures are isolated from the residue.
+
+STATEMENT_ALIGNMENT_GAPS.json gives seven exact declaration/path/hash boundaries:
+Main arithmetic versus analytic claims; unconstrained PairLawInterface p;
+RN law/Palm/count binding; exact coefficient enclosures; existing actual-field
+witness versus Morse/bar/density parents; current whole-carrier progress versus
+geometric critical-point-process Palm identification; and regular/interior level
+geometry versus boundary critical points/full bar correspondence. Follow those
+concrete repair obligations without weakening original statements or bounds.
+
+TOOL_REGISTRY.json records reusable commands,tool hashes,selftests,official
+pinned tool versions and each demonstrated scope. Source token scans are
+inventory only; no lexical scan,primitive arithmetic success,static validator,
+hash,green test or merged source is substituted for a missing source theorem.
+
+Latest runtime handoff: proper current Math clone remains CLEAN. Its ignored
+formal/.lake/packages is linked to the preserved pinned cache. Once cache retrieval
+completes,run LEAN_NUM_THREADS=2 and pinned PATH with:
+ python -B -S /workspace/cbz0/repos/Math-/formal/gate.py --execute
+The source-only readiness gate on this proper clone passes. No actual Math
+project execution is claimed by that readiness check.
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/RESULT.json b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/RESULT.json
new file mode 100644
index 000000000..5135a5c54
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/RESULT.json
@@ -0,0 +1,39 @@
+{
+ "status": "PARTIAL_FOUNDATION_WITH_MAIN_LITERAL_CLOSURE",
+ "Main": {
+ "original_formal_files_unchanged": 17,
+ "formal_modules": 4,
+ "actual_proofs": 31,
+ "original_project_constants": 45,
+ "auditor_witness_constants": 4,
+ "prop_premise_theorems": 2,
+ "nonvacuity": "All finite-domain witnesses kernel checked",
+ "portable_full_run": "PASS",
+ "portable_tests_per_mode": 14,
+ "existing_gate_tests_per_mode": 49,
+ "test_skips_in_final_runs": 0,
+ "receipt": "portable-main-receipt.json"
+ },
+ "Math": {
+ "commit": "8151f592918a845bf19eb8eafaf8444540a32734",
+ "source_files": 162,
+ "source_hash_bound_groups": 16,
+ "current_formal_tests_per_mode": 244,
+ "current_project_build": "UNOBSERVED_RESOURCE_BLOCKED",
+ "current_project_kernel": "UNOBSERVED_RESOURCE_BLOCKED",
+ "missing_cache_packed_entries_approx": 439,
+ "dependency_source_pins": "9/9 MATCH_CLEAN",
+ "proper_clone_source_gate": "PASS",
+ "historical_evidence": "PRESERVED_AT_ORIGINAL_SCOPE"
+ },
+ "toolchain_runtime_files_archive_verified": 5,
+ "product_files_added": [
+ "tools/cbz_lean_check.py",
+ "tools/CBZNonvacuity.lean",
+ "tests/test_cbz_lean_check.py"
+ ],
+ "source_weakening": false,
+ "custom_axioms_added": false,
+ "remote_Git_writes": false,
+ "whole_CBZ_claim": false
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json
new file mode 100644
index 000000000..a0159960c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json
@@ -0,0 +1,396 @@
+{
+ "actual_controls": {
+ "false_premise": "EXPECTED_REJECTION",
+ "honest": "EXPECTED_ACCEPTANCE",
+ "missing_module": "EXPECTED_REJECTION",
+ "native": "EXPECTED_REJECTION",
+ "sorry": "EXPECTED_REJECTION",
+ "unused_axiom": "EXPECTED_REJECTION",
+ "weakened_witness_types": "REJECTED_BY_EXACT_TYPE_CENSUS_AND_LEAN_ASCRIPTION"
+ },
+ "auditor_input_hashes": {
+ "tools/CBZNonvacuity.lean": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f",
+ "tools/cbz_lean_check.py": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d",
+ "tools/formal_gate_check.py": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5"
+ },
+ "checked_commit": "a7f602241f759285190d8deebfefb017a6167ee8",
+ "files": {
+ "cbz-gate/AuditWeakenedWitness.lean": {
+ "bytes": 1996,
+ "sha256": "e371bdfc23bdce4823e34a6ba256f20b8786def91aaafe7fc4bed771119fc668"
+ },
+ "cbz-gate/Audit_false_premise.lean": {
+ "bytes": 2937,
+ "sha256": "bc649d9293515f6a1f707503b0883fb6ea2b845c20fccd9f42f3dee6216215e1"
+ },
+ "cbz-gate/Audit_honest.lean": {
+ "bytes": 2923,
+ "sha256": "7e3db1846b209bf1b1c4309ccc319d70eaca67932ceff91c2e1eb5183ba79c75"
+ },
+ "cbz-gate/Audit_native.lean": {
+ "bytes": 2923,
+ "sha256": "b7c80d76545ac4de9cd065cd23b65e9363a6e9585469f445764d138772c1c20b"
+ },
+ "cbz-gate/Audit_sorry.lean": {
+ "bytes": 2921,
+ "sha256": "f05c64a3378544e29d991af8346187542dd50938e2488132152e1179a8af500e"
+ },
+ "cbz-gate/Audit_unused_axiom.lean": {
+ "bytes": 2935,
+ "sha256": "17e7bd63d299fb6ca43b4b791d75268499a1af711bc82aa3fbcc2a56da941175"
+ },
+ "cbz-gate/CBZControl_false_premise.lean": {
+ "bytes": 61,
+ "sha256": "90c2c80bb3fbc9cc7ae30816d050ae5d0eac8903b3d2455136b48ebea7281dc0"
+ },
+ "cbz-gate/CBZControl_honest.lean": {
+ "bytes": 56,
+ "sha256": "d8099911accbf7a768892136256820e31afa9158d8d15c92d7437bb695a53295"
+ },
+ "cbz-gate/CBZControl_native.lean": {
+ "bytes": 75,
+ "sha256": "4c5529b6c627afca507e031a24f43750a8376f5b5179b349efc4d63a24ed2187"
+ },
+ "cbz-gate/CBZControl_sorry.lean": {
+ "bytes": 52,
+ "sha256": "9326bf1f792972f852fc0449f52b530e1ebb1b6a092993dd745e873600620683"
+ },
+ "cbz-gate/CBZControl_unused_axiom.lean": {
+ "bytes": 77,
+ "sha256": "e45b7df50d35aa6fd7f9cfcd89157a664f4474fd7f11bebf2b7883afe27a914a"
+ },
+ "cbz-gate/CBZNonvacuity.lean": {
+ "bytes": 3008,
+ "sha256": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f"
+ },
+ "cbz-gate/CBZWeakenedWitness.lean": {
+ "bytes": 258,
+ "sha256": "810e160d7666b4ad02f616ff0e02502bc2d83bd99f934d692aa7a420b2b05c07"
+ },
+ "cbz-gate/MissingModule.lean": {
+ "bytes": 2929,
+ "sha256": "c14bbecc2f99170c2c56c3e2865493a89a144a55927bc036c751e7f5ad3a039c"
+ },
+ "cbz-gate/SelfAudit.lean": {
+ "bytes": 1986,
+ "sha256": "d9a5c1d0b99420d6731163698f53a83253cb9913c5e1a793d7c12e3df6005bdd"
+ },
+ "cbz-gate/WeakenedWitnessContract.lean": {
+ "bytes": 542,
+ "sha256": "ce758e7ce7d3c30865f9ccc01b1f6f27d582e6ff5e9d5f411a09daaa9cc6fcf7"
+ },
+ "cbz-gate/WitnessTypeContract.lean": {
+ "bytes": 537,
+ "sha256": "613a79ffe608808ca7b2a4e06e76453b72b390116adf4d880b50106ab7c34596"
+ },
+ "cbz-gate/all-declarations-and-witnesses.log": {
+ "bytes": 10360,
+ "sha256": "dcc81dc13a6dce4b25a6300fd616966e835877f124b8e6448b452878df9673ea"
+ },
+ "cbz-gate/auditor-module-census.log": {
+ "bytes": 1028,
+ "sha256": "6b9bf4260474d13fb392b71b0fa3b3dadc75fc99fb06310b9caaff31feb3ce4c"
+ },
+ "cbz-gate/false_premise-audit.log": {
+ "bytes": 538,
+ "sha256": "424799495dafb2dac297a8206c364a73e8c41bed48ac772b0e806443811bfac1"
+ },
+ "cbz-gate/false_premise-compile.log": {
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ "cbz-gate/fresh-kernel.log": {
+ "bytes": 36,
+ "sha256": "765e0f77863dc012524cd125d2699754f19e967f4ec35908a2aed7903057572e"
+ },
+ "cbz-gate/honest-audit.log": {
+ "bytes": 485,
+ "sha256": "62390300f3aaa05474dd1d9b75e47728635f0e2c4b0b49dc9daf0914ec506d87"
+ },
+ "cbz-gate/honest-compile.log": {
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ "cbz-gate/missing-module.log": {
+ "bytes": 450,
+ "sha256": "2d9fdde838c729bf8630456eec1033381833a4a2eb42c8f07ca910d9d636f121"
+ },
+ "cbz-gate/native-audit.log": {
+ "bytes": 502,
+ "sha256": "468963ce795fd68a13b99e1e5b9e90e817f273fe2099bda696deb61552697200"
+ },
+ "cbz-gate/native-compile.log": {
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ "cbz-gate/receipt.json": {
+ "bytes": 26957,
+ "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c"
+ },
+ "cbz-gate/sorry-audit.log": {
+ "bytes": 441,
+ "sha256": "938f55996c45f78c29d90750ce73a1cfba8bd488b34f5b9e99ced19993bab2f4"
+ },
+ "cbz-gate/sorry-compile.log": {
+ "bytes": 136,
+ "sha256": "693c90261e9a6a2c68216209a5692f39ee06659d9a50919b2e551ffbd8f8deaa"
+ },
+ "cbz-gate/unused_axiom-audit.log": {
+ "bytes": 581,
+ "sha256": "972d65c1ff8afddb2e2f9024fbaf972b80292d7b9c0d774f8d946dee28fc12f6"
+ },
+ "cbz-gate/unused_axiom-compile.log": {
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ "cbz-gate/weakened-witness-audit.log": {
+ "bytes": 665,
+ "sha256": "3da011e5e28b010ac0851c66e96f3c3d7f501dbb8febcf944f597f239d4412d4"
+ },
+ "cbz-gate/weakened-witness-compile.log": {
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ "cbz-gate/weakened-witness-contract.log": {
+ "bytes": 1180,
+ "sha256": "727a132984645d32ac0f4607e61132c096ab4aa1dfe82bcfe9ad4756744d9346"
+ },
+ "cbz-gate/witness-kernel.log": {
+ "bytes": 24,
+ "sha256": "ab7e01501bc759b00ba24bb39ea9d9bf5e475a179a06f32ee13f3cb1bbc2492d"
+ },
+ "cbz-gate/witness-type-contract.log": {
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ "formal-gate/Audit.lean": {
+ "bytes": 1837,
+ "sha256": "09b59390c165b16d1c7b5bae189da6b806d79e8491ee0df1e2e83bb911674c71"
+ },
+ "formal-gate/Types.lean": {
+ "bytes": 1648,
+ "sha256": "e235933f1ff52b448b3b80952f7ec9ac932723520c22766e85dd81046d558884"
+ },
+ "formal-gate/axioms.log": {
+ "bytes": 2375,
+ "sha256": "856d934eabb250bffb96085454fc04b3ddd64a47bb92829728f7d5bb7d286d0c"
+ },
+ "formal-gate/build.log": {
+ "bytes": 237,
+ "sha256": "6a7ae1a06694eb7d44106bbd4e578aa965abdae391a1678ac0a14ec7e0b0908e"
+ },
+ "formal-gate/custom_imported.lean": {
+ "bytes": 146,
+ "sha256": "dc222fa20546b3443101625ac0793b3cd9e2cd563af489b8db03990e11afd6d5"
+ },
+ "formal-gate/custom_imported.log": {
+ "bytes": 46,
+ "sha256": "6e7f917c7fe2fdc3efe1943dcc327c56acadd0b0ca96507a4327073fdfd2f083"
+ },
+ "formal-gate/elaborated-types.log": {
+ "bytes": 25152,
+ "sha256": "10a954ced98371c5cf98eecada196d50c1e6e570af9ea8e07caade4a80b0aab8"
+ },
+ "formal-gate/false_covariance_bound.lean": {
+ "bytes": 7025,
+ "sha256": "621b585e6a025d9a606cc21c7dfdd2dbc5095b432d4e51d7ea9b2b713a637030"
+ },
+ "formal-gate/false_covariance_bound.log": {
+ "bytes": 224,
+ "sha256": "3e9f3d67aa666c88ed8e2b0b126163336cd5982dee6ce21b1118fa200292a4dd"
+ },
+ "formal-gate/false_eigenvalue_third.lean": {
+ "bytes": 7025,
+ "sha256": "1380775e4a2dc33ffb8c126dea5d2194ed7bdf7428b6d9d3dca1f8a3addafcb9"
+ },
+ "formal-gate/false_eigenvalue_third.log": {
+ "bytes": 192,
+ "sha256": "fda3cc4e985c3309e132c150d4ba988a4d4699095ef2f0cab010dc8e2a5094b2"
+ },
+ "formal-gate/false_endpoint_adjacency.lean": {
+ "bytes": 1940,
+ "sha256": "f3874de8ca4cab2016d51822373ea1932fcf64b233bec9b653e6a73360a19c0c"
+ },
+ "formal-gate/false_endpoint_adjacency.log": {
+ "bytes": 221,
+ "sha256": "62af9c46e66215424a5c82c4a1ee83700bbe7ca84906c14400cc4bfdcd5b276a"
+ },
+ "formal-gate/false_exp_partial_sum.lean": {
+ "bytes": 7025,
+ "sha256": "c3bd8d4579b8f23a53e7185bd74e44e3a09b92fe904c61a25ddb3001a33341a4"
+ },
+ "formal-gate/false_exp_partial_sum.log": {
+ "bytes": 221,
+ "sha256": "a82d1d1651352ec73a73ee7ad17a596d225fc808b9a3723dbbdd41f982f5328e"
+ },
+ "formal-gate/false_exponent_bound_d3.lean": {
+ "bytes": 7025,
+ "sha256": "2822b2cce0cf09eccc1926df9be7b48d06a0747a5b79bf14d5187057ea10c588"
+ },
+ "formal-gate/false_exponent_bound_d3.log": {
+ "bytes": 262,
+ "sha256": "bccf477ff397333506812af1a4a1475a3716f50a0ac0f3a20de77b421064b78d"
+ },
+ "formal-gate/false_trace_variance.lean": {
+ "bytes": 4409,
+ "sha256": "07963f41f4b3b682042b048a8133b8315ecfc47f59a441d9684d075585cc18b4"
+ },
+ "formal-gate/false_trace_variance.log": {
+ "bytes": 265,
+ "sha256": "685a68785e68c9590b0479754dc6479d4e1be7a9f89b29a40bfed17c24a376bb"
+ },
+ "formal-gate/leanchecker.log": {
+ "bytes": 0,
+ "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ "formal-gate/native.lean": {
+ "bytes": 100,
+ "sha256": "7a79ea6c867f3a79ef2474d2290e7265ab56a775212c6e67dc1bbad9e4334f37"
+ },
+ "formal-gate/native.log": {
+ "bytes": 70,
+ "sha256": "8a0b9f79f3265724af58b27461627f9d532535f8a23681361da731c9ea37c101"
+ },
+ "formal-gate/preflight-version.log": {
+ "bytes": 106,
+ "sha256": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680"
+ },
+ "formal-gate/receipt.json": {
+ "bytes": 4378,
+ "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1"
+ },
+ "formal-gate/sorry.lean": {
+ "bytes": 80,
+ "sha256": "8d3b8320eba70953d8de1bc5665cd3665d0d1dfe90f783a7270b1bb1bfab353e"
+ },
+ "formal-gate/sorry.log": {
+ "bytes": 168,
+ "sha256": "50c0e4557dee071a09d39a848a5eb54324115cd8958a4564f1e845380a64677a"
+ },
+ "formal-gate/version.log": {
+ "bytes": 106,
+ "sha256": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680"
+ },
+ "formal-gate/wrong_image_constant.lean": {
+ "bytes": 7025,
+ "sha256": "bb6e6665b42659821261de1b84674ef6a0a19811e8599671f9a7d2d90e81eb77"
+ },
+ "formal-gate/wrong_image_constant.log": {
+ "bytes": 204,
+ "sha256": "56114d671544669de953160f6688ba962a052a17b8a00e614dc5cdab711744b1"
+ },
+ "main-latest-17-source-preservation.json": {
+ "bytes": 3659,
+ "sha256": "924affa17b07d78efb9aa612bde8f10a9227660db9ab78af3af88e23419f2038"
+ },
+ "r3-full-main-run.exit": {
+ "bytes": 2,
+ "sha256": "9a271f2a916b0b6ee6cecb2426f0b3206ef074578be55d9bc94f6f3fe3ab86aa"
+ },
+ "r3-full-main-run.log": {
+ "bytes": 511,
+ "sha256": "b4f578ceb447f3c447c89b114f02b54b3b878784f7f7bd9b775eecc45820958a"
+ },
+ "r3-reviewer-original-probe-rejection.log": {
+ "bytes": 665,
+ "sha256": "2fd63f0be170493a6f41b2d6e39f3e5f8b4a5adb80224087766a3971b6d36735"
+ },
+ "r3-tests-green.log": {
+ "bytes": 2562,
+ "sha256": "39c8ddcf0bef091f78841a14e109d6afdb31053b02490afee04e2acc0db5c1d3"
+ },
+ "r3-tests-optimized.log": {
+ "bytes": 2562,
+ "sha256": "cd92d4ffedf3b4f9d47aa065c341071a2488599f605ae1694b7b71856ed6be78"
+ },
+ "source/formal/ALIGNMENT.md": {
+ "bytes": 7923,
+ "sha256": "059fcf3b501e2a6e73b3c20c6294eb57467ffc9118db696e05c8c3fcd7b2fa75"
+ },
+ "source/formal/GLOSSARY.md": {
+ "bytes": 10035,
+ "sha256": "342d4efb374fea31c39e51f8f6bcdbc50d7fb5fea1fd393eda21afff92c62fb8"
+ },
+ "source/formal/README.md": {
+ "bytes": 9154,
+ "sha256": "137e7c7ed44d732042d803eb4a0ee75f9ddc6475950a2bb6226a7711a44be14b"
+ },
+ "source/formal/REVIEW_LANE.md": {
+ "bytes": 5151,
+ "sha256": "54d32104aa012e917ef40b73fa3a40228d023249b339cf30fe4bdb7dcbfed414"
+ },
+ "source/formal/SCOPE.md": {
+ "bytes": 6279,
+ "sha256": "fd06700628b1fbc81c5cfe3786aaa455032375bcb879914f068a66b726802a17"
+ },
+ "source/formal/UniversalLaw.lean": {
+ "bytes": 586,
+ "sha256": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e"
+ },
+ "source/formal/UniversalLaw/Side24/ConeMoments.lean": {
+ "bytes": 4409,
+ "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c"
+ },
+ "source/formal/UniversalLaw/Side24/Endpoints.lean": {
+ "bytes": 1940,
+ "sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd"
+ },
+ "source/formal/UniversalLaw/Side24/Ledger.lean": {
+ "bytes": 7025,
+ "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7"
+ },
+ "source/formal/lake-manifest.json": {
+ "bytes": 144,
+ "sha256": "562d38ad95598486b2b592e6d072d5d3212735bfeb1cb6d8eb8ec04492522ba2"
+ },
+ "source/formal/lakefile.toml": {
+ "bytes": 464,
+ "sha256": "58f0fa6864cc03e9bcbef2d8c0404e9f3385a30a6124000454319367906cbe4a"
+ },
+ "source/formal/lean-toolchain": {
+ "bytes": 25,
+ "sha256": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b"
+ },
+ "source/formal/manifest.json": {
+ "bytes": 18104,
+ "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0"
+ },
+ "source/formal/reviews/README.md": {
+ "bytes": 906,
+ "sha256": "333ca71e7c676cee89e5d01cd61999c21bb0584e41d6bdacb18afa410109f95d"
+ },
+ "source/formal/reviews/TEMPLATE_alignment_review.json": {
+ "bytes": 1061,
+ "sha256": "e722e928ca43c16981e063d8eb1c91e9bf8c683241d9dcf156400a419e72feb3"
+ },
+ "source/formal/sources/side24_v1/ENCLOSURE.json": {
+ "bytes": 1090,
+ "sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811"
+ },
+ "source/formal/sources/side24_v1/PROOF.md": {
+ "bytes": 10272,
+ "sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769"
+ },
+ "source/tests/test_cbz_lean_check.py": {
+ "bytes": 6992,
+ "sha256": "8642d2bb63acf3d9ab56c89dad4132449f6b9b964431ca14ce9cf52ed3eac3d6"
+ },
+ "source/tools/CBZNonvacuity.lean": {
+ "bytes": 3008,
+ "sha256": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f"
+ },
+ "source/tools/cbz_lean_check.py": {
+ "bytes": 14610,
+ "sha256": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d"
+ },
+ "source/tools/formal_gate_check.py": {
+ "bytes": 23845,
+ "sha256": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5"
+ },
+ "toolchain-runtime-archive-verification.json": {
+ "bytes": 978,
+ "sha256": "75932d8d2d5461188f48b9184ecea495599213e7e18dc52ef397adc01dda797a"
+ }
+ },
+ "seal_scope": "Exact R3 source+actual receipt+all log outputs,hash-bound before RootfullPython. Read-only snapshot; no claim of storage-level immutability against a privileged writer."
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.sha256 b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.sha256
new file mode 100644
index 000000000..dd33ea6e5
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.sha256
@@ -0,0 +1 @@
+63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6 MANIFEST.json
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/AuditWeakenedWitness.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/AuditWeakenedWitness.lean
new file mode 100644
index 000000000..4aa51b31d
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/AuditWeakenedWitness.lean
@@ -0,0 +1,40 @@
+import Lean
+import CBZWeakenedWitness
+open Lean Meta Elab Command
+run_cmd do
+ let env ← getEnv
+ let modules : Array Name := #[`CBZWeakenedWitness]
+ 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/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_false_premise.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_false_premise.lean
new file mode 100644
index 000000000..6377b002f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_false_premise.lean
@@ -0,0 +1,57 @@
+import Lean
+import CBZControl_false_premise
+
+/-! 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 := #[`CBZControl_false_premise]
+ 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/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_honest.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_honest.lean
new file mode 100644
index 000000000..fb41ada93
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_honest.lean
@@ -0,0 +1,57 @@
+import Lean
+import CBZControl_honest
+
+/-! 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 := #[`CBZControl_honest]
+ 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/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_native.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_native.lean
new file mode 100644
index 000000000..30f137786
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_native.lean
@@ -0,0 +1,57 @@
+import Lean
+import CBZControl_native
+
+/-! 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 := #[`CBZControl_native]
+ 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/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_sorry.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_sorry.lean
new file mode 100644
index 000000000..3c1e19467
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_sorry.lean
@@ -0,0 +1,57 @@
+import Lean
+import CBZControl_sorry
+
+/-! 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 := #[`CBZControl_sorry]
+ 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/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_unused_axiom.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_unused_axiom.lean
new file mode 100644
index 000000000..ad5f369ce
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_unused_axiom.lean
@@ -0,0 +1,57 @@
+import Lean
+import CBZControl_unused_axiom
+
+/-! 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 := #[`CBZControl_unused_axiom]
+ 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/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_false_premise.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_false_premise.lean
new file mode 100644
index 000000000..ba93d7024
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_false_premise.lean
@@ -0,0 +1,2 @@
+import UniversalLaw
+theorem vacuous (h : False) : False := h
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_honest.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_honest.lean
new file mode 100644
index 000000000..6394b8a24
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_honest.lean
@@ -0,0 +1,2 @@
+import UniversalLaw
+theorem honest : True := True.intro
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_native.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_native.lean
new file mode 100644
index 000000000..47387d627
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_native.lean
@@ -0,0 +1,2 @@
+import UniversalLaw
+theorem native : (2 : Nat) + 2 = 4 := by native_decide
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_sorry.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_sorry.lean
new file mode 100644
index 000000000..4d8c2cb07
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_sorry.lean
@@ -0,0 +1,2 @@
+import UniversalLaw
+theorem bad : False := by sorry
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_unused_axiom.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_unused_axiom.lean
new file mode 100644
index 000000000..5ca9d9ac6
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_unused_axiom.lean
@@ -0,0 +1,3 @@
+import UniversalLaw
+axiom hidden : False
+theorem honest : True := True.intro
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZNonvacuity.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZNonvacuity.lean
new file mode 100644
index 000000000..3efd43999
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/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/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZWeakenedWitness.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZWeakenedWitness.lean
new file mode 100644
index 000000000..660e19217
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZWeakenedWitness.lean
@@ -0,0 +1,7 @@
+import UniversalLaw
+namespace CBZNonvacuity
+theorem pairing_domain_inhabited : True := True.intro
+theorem pairing_all_seven : True := True.intro
+theorem dimensions_inhabited : True := True.intro
+theorem dimensions_both : True := True.intro
+end CBZNonvacuity
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/MissingModule.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/MissingModule.lean
new file mode 100644
index 000000000..afea6af9c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/MissingModule.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, `MissingModule]
+ 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/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/SelfAudit.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/SelfAudit.lean
new file mode 100644
index 000000000..fbe67829d
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/SelfAudit.lean
@@ -0,0 +1,40 @@
+import Lean
+import CBZNonvacuity
+open Lean Meta Elab Command
+run_cmd do
+ let env ← getEnv
+ let modules : Array Name := #[`CBZNonvacuity]
+ 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/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/WeakenedWitnessContract.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/WeakenedWitnessContract.lean
new file mode 100644
index 000000000..a5be3ea8f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/WeakenedWitnessContract.lean
@@ -0,0 +1,5 @@
+import CBZWeakenedWitness
+example : (∃ q : Nat, q ∈ [0,1,2,3,4,5,6]) := CBZNonvacuity.pairing_domain_inhabited
+example : ((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]) := CBZNonvacuity.pairing_all_seven
+example : (∃ d : Nat, d ∈ [2,3]) := CBZNonvacuity.dimensions_inhabited
+example : ((2:Nat) ∈ [2,3] ∧ (3:Nat) ∈ [2,3]) := CBZNonvacuity.dimensions_both
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/WitnessTypeContract.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/WitnessTypeContract.lean
new file mode 100644
index 000000000..31ed5f063
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/WitnessTypeContract.lean
@@ -0,0 +1,5 @@
+import CBZNonvacuity
+example : (∃ q : Nat, q ∈ [0,1,2,3,4,5,6]) := CBZNonvacuity.pairing_domain_inhabited
+example : ((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]) := CBZNonvacuity.pairing_all_seven
+example : (∃ d : Nat, d ∈ [2,3]) := CBZNonvacuity.dimensions_inhabited
+example : ((2:Nat) ∈ [2,3] ∧ (3:Nat) ∈ [2,3]) := CBZNonvacuity.dimensions_both
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/all-declarations-and-witnesses.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/all-declarations-and-witnesses.log
new file mode 100644
index 000000000..2ccbba98a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/all-declarations-and-witnesses.log
@@ -0,0 +1,50 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.lattice_shell_constant","prop_premises":[],"statement":"27 * 27 = 729 ∧ 729 * 2 = 1458"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.pairing_terms_six","prop_premises":[],"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"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.geometric_ratio_constants","prop_premises":[],"statement":"2 ^ 9 = 512 ∧ 288 * 3 = 864"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.expTaylorNumerator","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact._f","prop_premises":[],"statement":"(x : Nat) → Nat.below x → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.exponent_bounds","prop_premises":[{"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"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.pairing_sum_six","prop_premises":[],"statement":"UniversalLaw.Side24.pairingSum 6 = 76"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.covariance_relative_bound","prop_premises":[],"statement":"2 * 10 * 3 = 60 ∧ 60 * UniversalLaw.Side24.imageConstant < 10 ^ 17"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.smaller_eigenvalue_exceeds_third","prop_premises":[],"statement":"58 * 9 < 23 ^ 2"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.imageConstant","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.odd_block_shifted_minors","prop_premises":[],"statement":"3 * 1 - 1 = 2 ∧ 3 * 15 - 1 = 44 ∧ 2 * 44 - -9 * -9 = 7"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.sixB","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.density_comparison_below_reported","prop_premises":[],"statement":"32 * 10 ^ 106 < 10 ^ 108"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.period_exponent","prop_premises":[],"statement":"24 ^ 2 / 2 = 288"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.odd_block_eigenvalues","prop_premises":[],"statement":"1 + 15 = 2 * 8 ∧ 1 * 15 - -3 * -3 = 6 ∧ 8 ^ 2 - 58 = 6"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.sixA","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.pairing_sum_le_six","prop_premises":[{"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"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact._sunfold","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.image_constant_value","prop_premises":[],"statement":"UniversalLaw.Side24.imageConstant = 21175738586478"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten","prop_premises":[],"statement":"10 * (125 ^ 20 * UniversalLaw.Side24.fact 20) < UniversalLaw.Side24.expTaylorNumerator"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact._unsafe_rec","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.pairingSum","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.sixth_moment_double_factorial","prop_premises":[],"statement":"1 * 3 * 5 = 15"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact","prop_premises":[],"statement":"Nat → Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.exponent_values","prop_premises":[],"statement":"UniversalLaw.Side24.sixA 2 = 13 ∧\n UniversalLaw.Side24.sixB 2 = 15 ∧ UniversalLaw.Side24.sixA 3 = 25 ∧ UniversalLaw.Side24.sixB 3 = 27"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.ratio_constant_ordering","prop_premises":[],"statement":"13 ≤ 32 ∧ 28 ≤ 32"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Ledger","name":"UniversalLaw.Side24.fact.match_1","prop_premises":[],"statement":"(motive : Nat → Sort u_1) → (x : Nat) → (Unit → motive 0) → ((n : Nat) → motive n.succ) → motive x"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.conditional_third_derivative_variance","prop_premises":[],"statement":"15 - -3 * -3 / 1 = 6"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.cube_root_simplification","prop_premises":[],"statement":"6 ^ 2 * 2 = 3 * 24"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.exponential_moment_of_trace","prop_premises":[],"statement":"3 + 5 = 8"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.fourth_moment_of_trace","prop_premises":[],"statement":"3 * 5 ^ 2 * 3 = 25 * 9"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.hessian_block_eigenvalues","prop_premises":[],"statement":"2 + 2 = 4 ∧ 3 + 2 = 5 ∧ 1 < 3 * 2"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.pin_determinant_and_joint_dimension","prop_premises":[],"statement":"3 * 1 * 1 = 3 ∧ 2 + 1 + 2 * 3 / 2 = 6 ∧ 3 + 1 + 3 * 4 / 2 = 10"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.transverse_covariance_entries_thirds","prop_premises":[],"statement":"2 + 3 + 3 = 8 ∧ 0 + 3 + 0 = 3 ∧ 2 + 0 + 0 = 2"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.trace_and_traceless_variances","prop_premises":[],"statement":"8 + 8 + 2 * 2 = 20 ∧ 20 * 3 = 5 * 12 ∧ 8 + 8 - 2 * 2 = 12 ∧ 12 = 1 * 12 ∧ 8 - 8 = 0"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.cone_moment_m1_thirds","prop_premises":[],"statement":"8 = 2 * 4"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.ConeMoments","name":"UniversalLaw.Side24.cone_moment_m2_algebra","prop_premises":[],"statement":"4 * 5 = 20 ∧ 25 - 20 + 24 = 29 ∧ 4 ^ 2 * 3 = 6 * 8"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d3Upper","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d2Lower","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d2_endpoints_adjacent","prop_premises":[],"statement":"UniversalLaw.Side24.d2Lower < UniversalLaw.Side24.d2Upper ∧\n UniversalLaw.Side24.d2Upper = UniversalLaw.Side24.d2Lower + 1"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d3Lower","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d3_endpoints_adjacent","prop_premises":[],"statement":"UniversalLaw.Side24.d3Lower < UniversalLaw.Side24.d3Upper ∧\n UniversalLaw.Side24.d3Upper = UniversalLaw.Side24.d3Lower + 1"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.endpoints_in_unit_tenth","prop_premises":[],"statement":"0 < UniversalLaw.Side24.d3Lower ∧ UniversalLaw.Side24.d2Upper < 10 ^ 19"}
+CBZ_RECORD {"axioms":[],"kind":"definition","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d2Upper","prop_premises":[],"statement":"Nat"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"UniversalLaw.Side24.Endpoints","name":"UniversalLaw.Side24.d3_below_d2","prop_premises":[],"statement":"UniversalLaw.Side24.d3Upper < UniversalLaw.Side24.d2Lower"}
+CBZ_END {"count":45,"modules":["UniversalLaw.Side24.Ledger","UniversalLaw.Side24.ConeMoments","UniversalLaw.Side24.Endpoints","UniversalLaw"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/auditor-module-census.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/auditor-module-census.log
new file mode 100644
index 000000000..7effdc667
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/auditor-module-census.log
@@ -0,0 +1,5 @@
+CBZ_RECORD {"axioms":["propext","Quot.sound"],"kind":"theorem","module":"CBZNonvacuity","name":"CBZNonvacuity.dimensions_inhabited","prop_premises":[],"statement":"∃ d, d ∈ [2, 3]"}
+CBZ_RECORD {"axioms":["propext","Quot.sound"],"kind":"theorem","module":"CBZNonvacuity","name":"CBZNonvacuity.pairing_all_seven","prop_premises":[],"statement":"0 ∈ [0, 1, 2, 3, 4, 5, 6] ∧\n 1 ∈ [0, 1, 2, 3, 4, 5, 6] ∧\n 2 ∈ [0, 1, 2, 3, 4, 5, 6] ∧\n 3 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 4 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 5 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 6 ∈ [0, 1, 2, 3, 4, 5, 6]"}
+CBZ_RECORD {"axioms":["propext","Quot.sound"],"kind":"theorem","module":"CBZNonvacuity","name":"CBZNonvacuity.dimensions_both","prop_premises":[],"statement":"2 ∈ [2, 3] ∧ 3 ∈ [2, 3]"}
+CBZ_RECORD {"axioms":["propext","Quot.sound"],"kind":"theorem","module":"CBZNonvacuity","name":"CBZNonvacuity.pairing_domain_inhabited","prop_premises":[],"statement":"∃ q, q ∈ [0, 1, 2, 3, 4, 5, 6]"}
+CBZ_END {"count":4,"modules":["CBZNonvacuity"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/false_premise-audit.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/false_premise-audit.log
new file mode 100644
index 000000000..678dc0f15
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/false_premise-audit.log
@@ -0,0 +1,6 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZControl_false_premise","name":"vacuous","prop_premises":[{"name":"h","type":"False"}],"statement":"False → False"}
+CBZ_END {"count":1,"modules":["CBZControl_false_premise"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/false_premise-compile.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/false_premise-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/fresh-kernel.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/fresh-kernel.log
new file mode 100644
index 000000000..dd6c2b20d
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/fresh-kernel.log
@@ -0,0 +1 @@
+replaying UniversalLaw with --fresh
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/honest-audit.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/honest-audit.log
new file mode 100644
index 000000000..ab1971291
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/honest-audit.log
@@ -0,0 +1,6 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZControl_honest","name":"honest","prop_premises":[],"statement":"True"}
+CBZ_END {"count":1,"modules":["CBZControl_honest"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/honest-compile.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/honest-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/missing-module.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/missing-module.log
new file mode 100644
index 000000000..be2f08351
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/missing-module.log
@@ -0,0 +1,5 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/MissingModule.lean:21:0: error: CBZ_MISSING_MODULE [MissingModule]
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/native-audit.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/native-audit.log
new file mode 100644
index 000000000..d3f616d31
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/native-audit.log
@@ -0,0 +1,5 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/Audit_native.lean:21:0: error: CBZ_FORBIDDEN native._native.native_decide.ax_1_1 [native._native.native_decide.ax_1_1]
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/native-compile.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/native-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json
new file mode 100644
index 000000000..79bb6cd6e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json
@@ -0,0 +1,748 @@
+{
+ "all_project_constants": [
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.lattice_shell_constant",
+ "prop_premises": [],
+ "statement": "27 * 27 = 729 \u2227 729 * 2 = 1458"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_terms_six",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.fact 6 / (2 ^ 0 * UniversalLaw.Side24.fact 0 * UniversalLaw.Side24.fact 6) = 1 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 1 * UniversalLaw.Side24.fact 1 * UniversalLaw.Side24.fact 4) = 15 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 2 * UniversalLaw.Side24.fact 2 * UniversalLaw.Side24.fact 2) = 45 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 3 * UniversalLaw.Side24.fact 3 * UniversalLaw.Side24.fact 0) = 15"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.geometric_ratio_constants",
+ "prop_premises": [],
+ "statement": "2 ^ 9 = 512 \u2227 288 * 3 = 864"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.expTaylorNumerator",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact._f",
+ "prop_premises": [],
+ "statement": "(x : Nat) \u2192 Nat.below x \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exponent_bounds",
+ "prop_premises": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "d \u2208 [2, 3]"
+ }
+ ],
+ "statement": "\u2200 (d : Nat),\n d \u2208 [2, 3] \u2192\n UniversalLaw.Side24.sixA d + 2 * UniversalLaw.Side24.sixB d < 84 \u2227\n 2 * UniversalLaw.Side24.sixA d + UniversalLaw.Side24.sixB d < 78"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_sum_six",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.pairingSum 6 = 76"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.covariance_relative_bound",
+ "prop_premises": [],
+ "statement": "2 * 10 * 3 = 60 \u2227 60 * UniversalLaw.Side24.imageConstant < 10 ^ 17"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third",
+ "prop_premises": [],
+ "statement": "58 * 9 < 23 ^ 2"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.imageConstant",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.odd_block_shifted_minors",
+ "prop_premises": [],
+ "statement": "3 * 1 - 1 = 2 \u2227 3 * 15 - 1 = 44 \u2227 2 * 44 - -9 * -9 = 7"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.sixB",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.density_comparison_below_reported",
+ "prop_premises": [],
+ "statement": "32 * 10 ^ 106 < 10 ^ 108"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.period_exponent",
+ "prop_premises": [],
+ "statement": "24 ^ 2 / 2 = 288"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.odd_block_eigenvalues",
+ "prop_premises": [],
+ "statement": "1 + 15 = 2 * 8 \u2227 1 * 15 - -3 * -3 = 6 \u2227 8 ^ 2 - 58 = 6"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.sixA",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_sum_le_six",
+ "prop_premises": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "q \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ }
+ ],
+ "statement": "\u2200 (q : Nat), q \u2208 [0, 1, 2, 3, 4, 5, 6] \u2192 UniversalLaw.Side24.pairingSum q \u2264 76"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact._sunfold",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.image_constant_value",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.imageConstant = 21175738586478"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten",
+ "prop_premises": [],
+ "statement": "10 * (125 ^ 20 * UniversalLaw.Side24.fact 20) < UniversalLaw.Side24.expTaylorNumerator"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact._unsafe_rec",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairingSum",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.sixth_moment_double_factorial",
+ "prop_premises": [],
+ "statement": "1 * 3 * 5 = 15"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact",
+ "prop_premises": [],
+ "statement": "Nat \u2192 Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exponent_values",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.sixA 2 = 13 \u2227\n UniversalLaw.Side24.sixB 2 = 15 \u2227 UniversalLaw.Side24.sixA 3 = 25 \u2227 UniversalLaw.Side24.sixB 3 = 27"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.ratio_constant_ordering",
+ "prop_premises": [],
+ "statement": "13 \u2264 32 \u2227 28 \u2264 32"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.fact.match_1",
+ "prop_premises": [],
+ "statement": "(motive : Nat \u2192 Sort u_1) \u2192 (x : Nat) \u2192 (Unit \u2192 motive 0) \u2192 ((n : Nat) \u2192 motive n.succ) \u2192 motive x"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.conditional_third_derivative_variance",
+ "prop_premises": [],
+ "statement": "15 - -3 * -3 / 1 = 6"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cube_root_simplification",
+ "prop_premises": [],
+ "statement": "6 ^ 2 * 2 = 3 * 24"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.exponential_moment_of_trace",
+ "prop_premises": [],
+ "statement": "3 + 5 = 8"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.fourth_moment_of_trace",
+ "prop_premises": [],
+ "statement": "3 * 5 ^ 2 * 3 = 25 * 9"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.hessian_block_eigenvalues",
+ "prop_premises": [],
+ "statement": "2 + 2 = 4 \u2227 3 + 2 = 5 \u2227 1 < 3 * 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.pin_determinant_and_joint_dimension",
+ "prop_premises": [],
+ "statement": "3 * 1 * 1 = 3 \u2227 2 + 1 + 2 * 3 / 2 = 6 \u2227 3 + 1 + 3 * 4 / 2 = 10"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.transverse_covariance_entries_thirds",
+ "prop_premises": [],
+ "statement": "2 + 3 + 3 = 8 \u2227 0 + 3 + 0 = 3 \u2227 2 + 0 + 0 = 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.trace_and_traceless_variances",
+ "prop_premises": [],
+ "statement": "8 + 8 + 2 * 2 = 20 \u2227 20 * 3 = 5 * 12 \u2227 8 + 8 - 2 * 2 = 12 \u2227 12 = 1 * 12 \u2227 8 - 8 = 0"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cone_moment_m1_thirds",
+ "prop_premises": [],
+ "statement": "8 = 2 * 4"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cone_moment_m2_algebra",
+ "prop_premises": [],
+ "statement": "4 * 5 = 20 \u2227 25 - 20 + 24 = 29 \u2227 4 ^ 2 * 3 = 6 * 8"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3Upper",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d2Lower",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d2_endpoints_adjacent",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d2Lower < UniversalLaw.Side24.d2Upper \u2227\n UniversalLaw.Side24.d2Upper = UniversalLaw.Side24.d2Lower + 1"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3Lower",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3_endpoints_adjacent",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d3Lower < UniversalLaw.Side24.d3Upper \u2227\n UniversalLaw.Side24.d3Upper = UniversalLaw.Side24.d3Lower + 1"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.endpoints_in_unit_tenth",
+ "prop_premises": [],
+ "statement": "0 < UniversalLaw.Side24.d3Lower \u2227 UniversalLaw.Side24.d2Upper < 10 ^ 19"
+ },
+ {
+ "axioms": [],
+ "kind": "definition",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d2Upper",
+ "prop_premises": [],
+ "statement": "Nat"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3_below_d2",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d3Upper < UniversalLaw.Side24.d2Lower"
+ }
+ ],
+ "audit_input_sha256": {
+ "tools/CBZNonvacuity.lean": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f",
+ "tools/cbz_lean_check.py": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d",
+ "tools/formal_gate_check.py": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5"
+ },
+ "audit_module_constants": [
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.dimensions_inhabited",
+ "prop_premises": [],
+ "statement": "\u2203 d, d \u2208 [2, 3]"
+ },
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.pairing_all_seven",
+ "prop_premises": [],
+ "statement": "0 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 1 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 2 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227\n 3 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 4 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 5 \u2208 [0, 1, 2, 3, 4, 5, 6] \u2227 6 \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ },
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.dimensions_both",
+ "prop_premises": [],
+ "statement": "2 \u2208 [2, 3] \u2227 3 \u2208 [2, 3]"
+ },
+ {
+ "axioms": [
+ "propext",
+ "Quot.sound"
+ ],
+ "kind": "theorem",
+ "module": "CBZNonvacuity",
+ "name": "CBZNonvacuity.pairing_domain_inhabited",
+ "prop_premises": [],
+ "statement": "\u2203 q, q \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ }
+ ],
+ "baseline_receipt_sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1",
+ "checked_commit": "a7f602241f759285190d8deebfefb017a6167ee8",
+ "fresh_kernel": "PASS",
+ "lean_version": "Lean (version 4.34.1, x86_64-unknown-linux-gnu, commit 5045d0056413266e57c625dcd7c365b10e377c52, Release)",
+ "logs": {
+ "all-declarations-and-witnesses.log": "dcc81dc13a6dce4b25a6300fd616966e835877f124b8e6448b452878df9673ea",
+ "auditor-module-census.log": "6b9bf4260474d13fb392b71b0fa3b3dadc75fc99fb06310b9caaff31feb3ce4c",
+ "false_premise-audit.log": "424799495dafb2dac297a8206c364a73e8c41bed48ac772b0e806443811bfac1",
+ "false_premise-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "fresh-kernel.log": "765e0f77863dc012524cd125d2699754f19e967f4ec35908a2aed7903057572e",
+ "honest-audit.log": "62390300f3aaa05474dd1d9b75e47728635f0e2c4b0b49dc9daf0914ec506d87",
+ "honest-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "missing-module.log": "2d9fdde838c729bf8630456eec1033381833a4a2eb42c8f07ca910d9d636f121",
+ "native-audit.log": "468963ce795fd68a13b99e1e5b9e90e817f273fe2099bda696deb61552697200",
+ "native-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "sorry-audit.log": "938f55996c45f78c29d90750ce73a1cfba8bd488b34f5b9e99ced19993bab2f4",
+ "sorry-compile.log": "693c90261e9a6a2c68216209a5692f39ee06659d9a50919b2e551ffbd8f8deaa",
+ "unused_axiom-audit.log": "972d65c1ff8afddb2e2f9024fbaf972b80292d7b9c0d774f8d946dee28fc12f6",
+ "unused_axiom-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "weakened-witness-audit.log": "3da011e5e28b010ac0851c66e96f3c3d7f501dbb8febcf944f597f239d4412d4",
+ "weakened-witness-compile.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "weakened-witness-contract.log": "727a132984645d32ac0f4607e61132c096ab4aa1dfe82bcfe9ad4756744d9346",
+ "witness-kernel.log": "ab7e01501bc759b00ba24bb39ea9d9bf5e475a179a06f32ee13f3cb1bbc2492d",
+ "witness-type-contract.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
+ },
+ "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0",
+ "proofs": [
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.lattice_shell_constant",
+ "prop_premises": [],
+ "statement": "27 * 27 = 729 \u2227 729 * 2 = 1458"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_terms_six",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.fact 6 / (2 ^ 0 * UniversalLaw.Side24.fact 0 * UniversalLaw.Side24.fact 6) = 1 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 1 * UniversalLaw.Side24.fact 1 * UniversalLaw.Side24.fact 4) = 15 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 2 * UniversalLaw.Side24.fact 2 * UniversalLaw.Side24.fact 2) = 45 \u2227\n UniversalLaw.Side24.fact 6 / (2 ^ 3 * UniversalLaw.Side24.fact 3 * UniversalLaw.Side24.fact 0) = 15"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.geometric_ratio_constants",
+ "prop_premises": [],
+ "statement": "2 ^ 9 = 512 \u2227 288 * 3 = 864"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exponent_bounds",
+ "prop_premises": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "d \u2208 [2, 3]"
+ }
+ ],
+ "statement": "\u2200 (d : Nat),\n d \u2208 [2, 3] \u2192\n UniversalLaw.Side24.sixA d + 2 * UniversalLaw.Side24.sixB d < 84 \u2227\n 2 * UniversalLaw.Side24.sixA d + UniversalLaw.Side24.sixB d < 78"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_sum_six",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.pairingSum 6 = 76"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.covariance_relative_bound",
+ "prop_premises": [],
+ "statement": "2 * 10 * 3 = 60 \u2227 60 * UniversalLaw.Side24.imageConstant < 10 ^ 17"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third",
+ "prop_premises": [],
+ "statement": "58 * 9 < 23 ^ 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.odd_block_shifted_minors",
+ "prop_premises": [],
+ "statement": "3 * 1 - 1 = 2 \u2227 3 * 15 - 1 = 44 \u2227 2 * 44 - -9 * -9 = 7"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.density_comparison_below_reported",
+ "prop_premises": [],
+ "statement": "32 * 10 ^ 106 < 10 ^ 108"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.period_exponent",
+ "prop_premises": [],
+ "statement": "24 ^ 2 / 2 = 288"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.odd_block_eigenvalues",
+ "prop_premises": [],
+ "statement": "1 + 15 = 2 * 8 \u2227 1 * 15 - -3 * -3 = 6 \u2227 8 ^ 2 - 58 = 6"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.pairing_sum_le_six",
+ "prop_premises": [
+ {
+ "name": "a._@._internal._hyg.0",
+ "type": "q \u2208 [0, 1, 2, 3, 4, 5, 6]"
+ }
+ ],
+ "statement": "\u2200 (q : Nat), q \u2208 [0, 1, 2, 3, 4, 5, 6] \u2192 UniversalLaw.Side24.pairingSum q \u2264 76"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.image_constant_value",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.imageConstant = 21175738586478"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten",
+ "prop_premises": [],
+ "statement": "10 * (125 ^ 20 * UniversalLaw.Side24.fact 20) < UniversalLaw.Side24.expTaylorNumerator"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.sixth_moment_double_factorial",
+ "prop_premises": [],
+ "statement": "1 * 3 * 5 = 15"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.exponent_values",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.sixA 2 = 13 \u2227\n UniversalLaw.Side24.sixB 2 = 15 \u2227 UniversalLaw.Side24.sixA 3 = 25 \u2227 UniversalLaw.Side24.sixB 3 = 27"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Ledger",
+ "name": "UniversalLaw.Side24.ratio_constant_ordering",
+ "prop_premises": [],
+ "statement": "13 \u2264 32 \u2227 28 \u2264 32"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.conditional_third_derivative_variance",
+ "prop_premises": [],
+ "statement": "15 - -3 * -3 / 1 = 6"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cube_root_simplification",
+ "prop_premises": [],
+ "statement": "6 ^ 2 * 2 = 3 * 24"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.exponential_moment_of_trace",
+ "prop_premises": [],
+ "statement": "3 + 5 = 8"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.fourth_moment_of_trace",
+ "prop_premises": [],
+ "statement": "3 * 5 ^ 2 * 3 = 25 * 9"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.hessian_block_eigenvalues",
+ "prop_premises": [],
+ "statement": "2 + 2 = 4 \u2227 3 + 2 = 5 \u2227 1 < 3 * 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.pin_determinant_and_joint_dimension",
+ "prop_premises": [],
+ "statement": "3 * 1 * 1 = 3 \u2227 2 + 1 + 2 * 3 / 2 = 6 \u2227 3 + 1 + 3 * 4 / 2 = 10"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.transverse_covariance_entries_thirds",
+ "prop_premises": [],
+ "statement": "2 + 3 + 3 = 8 \u2227 0 + 3 + 0 = 3 \u2227 2 + 0 + 0 = 2"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.trace_and_traceless_variances",
+ "prop_premises": [],
+ "statement": "8 + 8 + 2 * 2 = 20 \u2227 20 * 3 = 5 * 12 \u2227 8 + 8 - 2 * 2 = 12 \u2227 12 = 1 * 12 \u2227 8 - 8 = 0"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cone_moment_m1_thirds",
+ "prop_premises": [],
+ "statement": "8 = 2 * 4"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.ConeMoments",
+ "name": "UniversalLaw.Side24.cone_moment_m2_algebra",
+ "prop_premises": [],
+ "statement": "4 * 5 = 20 \u2227 25 - 20 + 24 = 29 \u2227 4 ^ 2 * 3 = 6 * 8"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d2_endpoints_adjacent",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d2Lower < UniversalLaw.Side24.d2Upper \u2227\n UniversalLaw.Side24.d2Upper = UniversalLaw.Side24.d2Lower + 1"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3_endpoints_adjacent",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d3Lower < UniversalLaw.Side24.d3Upper \u2227\n UniversalLaw.Side24.d3Upper = UniversalLaw.Side24.d3Lower + 1"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.endpoints_in_unit_tenth",
+ "prop_premises": [],
+ "statement": "0 < UniversalLaw.Side24.d3Lower \u2227 UniversalLaw.Side24.d2Upper < 10 ^ 19"
+ },
+ {
+ "axioms": [],
+ "kind": "theorem",
+ "module": "UniversalLaw.Side24.Endpoints",
+ "name": "UniversalLaw.Side24.d3_below_d2",
+ "prop_premises": [],
+ "statement": "UniversalLaw.Side24.d3Upper < UniversalLaw.Side24.d2Lower"
+ }
+ ],
+ "schema_version": 1,
+ "scientific_effect": "NONE",
+ "scope": "31 literal Main arithmetic statements only; no analytic/source parent closure",
+ "self_tests": {
+ "false_premise": "EXPECTED_REJECTION",
+ "honest": "EXPECTED_ACCEPTANCE",
+ "missing_module": "EXPECTED_REJECTION",
+ "native": "EXPECTED_REJECTION",
+ "sorry": "EXPECTED_REJECTION",
+ "unused_axiom": "EXPECTED_REJECTION",
+ "weakened_witness_types": "REJECTED_BY_EXACT_TYPE_CENSUS_AND_LEAN_ASCRIPTION"
+ },
+ "source_alignment": "NOT_INFERRED",
+ "witness_axioms": {
+ "CBZNonvacuity.dimensions_both": [
+ "Quot.sound",
+ "propext"
+ ],
+ "CBZNonvacuity.dimensions_inhabited": [
+ "Quot.sound",
+ "propext"
+ ],
+ "CBZNonvacuity.pairing_all_seven": [
+ "Quot.sound",
+ "propext"
+ ],
+ "CBZNonvacuity.pairing_domain_inhabited": [
+ "Quot.sound",
+ "propext"
+ ]
+ },
+ "witness_type_contract": {
+ "CBZNonvacuity.dimensions_both": "(2:Nat) \u2208 [2,3] \u2227 (3:Nat) \u2208 [2,3]",
+ "CBZNonvacuity.dimensions_inhabited": "\u2203 d : Nat, d \u2208 [2,3]",
+ "CBZNonvacuity.pairing_all_seven": "(0:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (1:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (2:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (3:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (4:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (5:Nat) \u2208 [0,1,2,3,4,5,6] \u2227 (6:Nat) \u2208 [0,1,2,3,4,5,6]",
+ "CBZNonvacuity.pairing_domain_inhabited": "\u2203 q : Nat, q \u2208 [0,1,2,3,4,5,6]"
+ }
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/sorry-audit.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/sorry-audit.log
new file mode 100644
index 000000000..6368c5815
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/sorry-audit.log
@@ -0,0 +1,5 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/Audit_sorry.lean:21:0: error: CBZ_FORBIDDEN bad [sorryAx]
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/sorry-compile.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/sorry-compile.log
new file mode 100644
index 000000000..856f03ef6
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/sorry-compile.log
@@ -0,0 +1 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/CBZControl_sorry.lean:2:8: warning: declaration uses `sorry`
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/unused_axiom-audit.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/unused_axiom-audit.log
new file mode 100644
index 000000000..e1c241735
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/unused_axiom-audit.log
@@ -0,0 +1,6 @@
+'CBZNonvacuity.pairing_domain_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.pairing_all_seven' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_inhabited' depends on axioms: [propext, Quot.sound]
+'CBZNonvacuity.dimensions_both' depends on axioms: [propext, Quot.sound]
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZControl_unused_axiom","name":"honest","prop_premises":[],"statement":"True"}
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/Audit_unused_axiom.lean:21:0: error: CBZ_FORBIDDEN hidden [hidden]
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/unused_axiom-compile.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/unused_axiom-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-audit.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-audit.log
new file mode 100644
index 000000000..29960ffd9
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-audit.log
@@ -0,0 +1,5 @@
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZWeakenedWitness","name":"CBZNonvacuity.dimensions_inhabited","prop_premises":[],"statement":"True"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZWeakenedWitness","name":"CBZNonvacuity.pairing_all_seven","prop_premises":[],"statement":"True"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZWeakenedWitness","name":"CBZNonvacuity.dimensions_both","prop_premises":[],"statement":"True"}
+CBZ_RECORD {"axioms":[],"kind":"theorem","module":"CBZWeakenedWitness","name":"CBZNonvacuity.pairing_domain_inhabited","prop_premises":[],"statement":"True"}
+CBZ_END {"count":4,"modules":["CBZWeakenedWitness"]}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-compile.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-compile.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-contract.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-contract.log
new file mode 100644
index 000000000..af3197f70
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-contract.log
@@ -0,0 +1,27 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/WeakenedWitnessContract.lean:2:46: error: Type mismatch
+ CBZNonvacuity.pairing_domain_inhabited
+has type
+ True
+but is expected to have type
+ ∃ q, q ∈ [0, 1, 2, 3, 4, 5, 6]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/WeakenedWitnessContract.lean:3:209: error: Type mismatch
+ CBZNonvacuity.pairing_all_seven
+has type
+ True
+but is expected to have type
+ 0 ∈ [0, 1, 2, 3, 4, 5, 6] ∧
+ 1 ∈ [0, 1, 2, 3, 4, 5, 6] ∧
+ 2 ∈ [0, 1, 2, 3, 4, 5, 6] ∧
+ 3 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 4 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 5 ∈ [0, 1, 2, 3, 4, 5, 6] ∧ 6 ∈ [0, 1, 2, 3, 4, 5, 6]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/WeakenedWitnessContract.lean:4:36: error: Type mismatch
+ CBZNonvacuity.dimensions_inhabited
+has type
+ True
+but is expected to have type
+ ∃ d, d ∈ [2, 3]
+/workspace/universal-law/website-repair-20261028/formal/.lake/cbz-evidence/WeakenedWitnessContract.lean:5:49: error: Type mismatch
+ CBZNonvacuity.dimensions_both
+has type
+ True
+but is expected to have type
+ 2 ∈ [2, 3] ∧ 3 ∈ [2, 3]
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/witness-kernel.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/witness-kernel.log
new file mode 100644
index 000000000..00b3a20b0
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/witness-kernel.log
@@ -0,0 +1 @@
+replaying CBZNonvacuity
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/witness-type-contract.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/witness-type-contract.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/Audit.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/Audit.lean
new file mode 100644
index 000000000..e6fd8903c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/Audit.lean
@@ -0,0 +1,32 @@
+import UniversalLaw
+#print axioms UniversalLaw.Side24.pairing_sum_six
+#print axioms UniversalLaw.Side24.pairing_sum_le_six
+#print axioms UniversalLaw.Side24.pairing_terms_six
+#print axioms UniversalLaw.Side24.sixth_moment_double_factorial
+#print axioms UniversalLaw.Side24.lattice_shell_constant
+#print axioms UniversalLaw.Side24.geometric_ratio_constants
+#print axioms UniversalLaw.Side24.period_exponent
+#print axioms UniversalLaw.Side24.image_constant_value
+#print axioms UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten
+#print axioms UniversalLaw.Side24.covariance_relative_bound
+#print axioms UniversalLaw.Side24.odd_block_eigenvalues
+#print axioms UniversalLaw.Side24.odd_block_shifted_minors
+#print axioms UniversalLaw.Side24.smaller_eigenvalue_exceeds_third
+#print axioms UniversalLaw.Side24.exponent_bounds
+#print axioms UniversalLaw.Side24.exponent_values
+#print axioms UniversalLaw.Side24.ratio_constant_ordering
+#print axioms UniversalLaw.Side24.density_comparison_below_reported
+#print axioms UniversalLaw.Side24.conditional_third_derivative_variance
+#print axioms UniversalLaw.Side24.transverse_covariance_entries_thirds
+#print axioms UniversalLaw.Side24.cone_moment_m1_thirds
+#print axioms UniversalLaw.Side24.trace_and_traceless_variances
+#print axioms UniversalLaw.Side24.fourth_moment_of_trace
+#print axioms UniversalLaw.Side24.exponential_moment_of_trace
+#print axioms UniversalLaw.Side24.cone_moment_m2_algebra
+#print axioms UniversalLaw.Side24.cube_root_simplification
+#print axioms UniversalLaw.Side24.pin_determinant_and_joint_dimension
+#print axioms UniversalLaw.Side24.hessian_block_eigenvalues
+#print axioms UniversalLaw.Side24.d2_endpoints_adjacent
+#print axioms UniversalLaw.Side24.d3_endpoints_adjacent
+#print axioms UniversalLaw.Side24.d3_below_d2
+#print axioms UniversalLaw.Side24.endpoints_in_unit_tenth
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/Types.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/Types.lean
new file mode 100644
index 000000000..bf35db692
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/Types.lean
@@ -0,0 +1,33 @@
+import UniversalLaw
+set_option pp.explicit true
+#check UniversalLaw.Side24.pairing_sum_six
+#check UniversalLaw.Side24.pairing_sum_le_six
+#check UniversalLaw.Side24.pairing_terms_six
+#check UniversalLaw.Side24.sixth_moment_double_factorial
+#check UniversalLaw.Side24.lattice_shell_constant
+#check UniversalLaw.Side24.geometric_ratio_constants
+#check UniversalLaw.Side24.period_exponent
+#check UniversalLaw.Side24.image_constant_value
+#check UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten
+#check UniversalLaw.Side24.covariance_relative_bound
+#check UniversalLaw.Side24.odd_block_eigenvalues
+#check UniversalLaw.Side24.odd_block_shifted_minors
+#check UniversalLaw.Side24.smaller_eigenvalue_exceeds_third
+#check UniversalLaw.Side24.exponent_bounds
+#check UniversalLaw.Side24.exponent_values
+#check UniversalLaw.Side24.ratio_constant_ordering
+#check UniversalLaw.Side24.density_comparison_below_reported
+#check UniversalLaw.Side24.conditional_third_derivative_variance
+#check UniversalLaw.Side24.transverse_covariance_entries_thirds
+#check UniversalLaw.Side24.cone_moment_m1_thirds
+#check UniversalLaw.Side24.trace_and_traceless_variances
+#check UniversalLaw.Side24.fourth_moment_of_trace
+#check UniversalLaw.Side24.exponential_moment_of_trace
+#check UniversalLaw.Side24.cone_moment_m2_algebra
+#check UniversalLaw.Side24.cube_root_simplification
+#check UniversalLaw.Side24.pin_determinant_and_joint_dimension
+#check UniversalLaw.Side24.hessian_block_eigenvalues
+#check UniversalLaw.Side24.d2_endpoints_adjacent
+#check UniversalLaw.Side24.d3_endpoints_adjacent
+#check UniversalLaw.Side24.d3_below_d2
+#check UniversalLaw.Side24.endpoints_in_unit_tenth
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/axioms.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/axioms.log
new file mode 100644
index 000000000..4948445ef
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/axioms.log
@@ -0,0 +1,31 @@
+'UniversalLaw.Side24.pairing_sum_six' does not depend on any axioms
+'UniversalLaw.Side24.pairing_sum_le_six' does not depend on any axioms
+'UniversalLaw.Side24.pairing_terms_six' does not depend on any axioms
+'UniversalLaw.Side24.sixth_moment_double_factorial' does not depend on any axioms
+'UniversalLaw.Side24.lattice_shell_constant' does not depend on any axioms
+'UniversalLaw.Side24.geometric_ratio_constants' does not depend on any axioms
+'UniversalLaw.Side24.period_exponent' does not depend on any axioms
+'UniversalLaw.Side24.image_constant_value' does not depend on any axioms
+'UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten' does not depend on any axioms
+'UniversalLaw.Side24.covariance_relative_bound' does not depend on any axioms
+'UniversalLaw.Side24.odd_block_eigenvalues' does not depend on any axioms
+'UniversalLaw.Side24.odd_block_shifted_minors' does not depend on any axioms
+'UniversalLaw.Side24.smaller_eigenvalue_exceeds_third' does not depend on any axioms
+'UniversalLaw.Side24.exponent_bounds' does not depend on any axioms
+'UniversalLaw.Side24.exponent_values' does not depend on any axioms
+'UniversalLaw.Side24.ratio_constant_ordering' does not depend on any axioms
+'UniversalLaw.Side24.density_comparison_below_reported' does not depend on any axioms
+'UniversalLaw.Side24.conditional_third_derivative_variance' does not depend on any axioms
+'UniversalLaw.Side24.transverse_covariance_entries_thirds' does not depend on any axioms
+'UniversalLaw.Side24.cone_moment_m1_thirds' does not depend on any axioms
+'UniversalLaw.Side24.trace_and_traceless_variances' does not depend on any axioms
+'UniversalLaw.Side24.fourth_moment_of_trace' does not depend on any axioms
+'UniversalLaw.Side24.exponential_moment_of_trace' does not depend on any axioms
+'UniversalLaw.Side24.cone_moment_m2_algebra' does not depend on any axioms
+'UniversalLaw.Side24.cube_root_simplification' does not depend on any axioms
+'UniversalLaw.Side24.pin_determinant_and_joint_dimension' does not depend on any axioms
+'UniversalLaw.Side24.hessian_block_eigenvalues' does not depend on any axioms
+'UniversalLaw.Side24.d2_endpoints_adjacent' does not depend on any axioms
+'UniversalLaw.Side24.d3_endpoints_adjacent' does not depend on any axioms
+'UniversalLaw.Side24.d3_below_d2' does not depend on any axioms
+'UniversalLaw.Side24.endpoints_in_unit_tenth' does not depend on any axioms
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/build.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/build.log
new file mode 100644
index 000000000..4e096fa7f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/build.log
@@ -0,0 +1,5 @@
+✔ [2/6] Built UniversalLaw.Side24.Endpoints (436ms)
+✔ [3/6] Built UniversalLaw.Side24.Ledger (586ms)
+✔ [4/6] Built UniversalLaw.Side24.ConeMoments (587ms)
+✔ [5/6] Built UniversalLaw (239ms)
+Build completed successfully (6 jobs).
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/custom_imported.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/custom_imported.lean
new file mode 100644
index 000000000..2d0df8256
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/custom_imported.lean
@@ -0,0 +1,5 @@
+import UniversalLaw
+axiom hiddenPremise : False
+theorem middle : False := hiddenPremise
+theorem injected : False := middle
+#print axioms injected
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/custom_imported.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/custom_imported.log
new file mode 100644
index 000000000..52be5f132
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/custom_imported.log
@@ -0,0 +1 @@
+'injected' depends on axioms: [hiddenPremise]
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/elaborated-types.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/elaborated-types.log
new file mode 100644
index 000000000..be7907e96
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/elaborated-types.log
@@ -0,0 +1,389 @@
+UniversalLaw.Side24.pairing_sum_six :
+ @Eq Nat (UniversalLaw.Side24.pairingSum (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))
+ (@OfNat.ofNat Nat (nat_lit 76) (instOfNatNat (nat_lit 76)))
+UniversalLaw.Side24.pairing_sum_le_six (q : Nat) :
+ @Membership.mem Nat (List Nat) (@List.instMembership Nat)
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))) (@List.nil Nat))))))))
+ q →
+ @LE.le Nat instLENat (UniversalLaw.Side24.pairingSum q) (@OfNat.ofNat Nat (nat_lit 76) (instOfNatNat (nat_lit 76)))
+UniversalLaw.Side24.pairing_terms_six :
+ And
+ (@Eq Nat
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0)))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))))
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
+ (And
+ (@Eq Nat
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4))))))
+ (@OfNat.ofNat Nat (nat_lit 15) (instOfNatNat (nat_lit 15))))
+ (And
+ (@Eq Nat
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))))
+ (@OfNat.ofNat Nat (nat_lit 45) (instOfNatNat (nat_lit 45))))
+ (@Eq Nat
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))))))
+ (@OfNat.ofNat Nat (nat_lit 15) (instOfNatNat (nat_lit 15))))))
+UniversalLaw.Side24.sixth_moment_double_factorial :
+ @Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5))))
+ (@OfNat.ofNat Nat (nat_lit 15) (instOfNatNat (nat_lit 15)))
+UniversalLaw.Side24.lattice_shell_constant :
+ And
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 27) (instOfNatNat (nat_lit 27)))
+ (@OfNat.ofNat Nat (nat_lit 27) (instOfNatNat (nat_lit 27))))
+ (@OfNat.ofNat Nat (nat_lit 729) (instOfNatNat (nat_lit 729))))
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 729) (instOfNatNat (nat_lit 729)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 1458) (instOfNatNat (nat_lit 1458))))
+UniversalLaw.Side24.geometric_ratio_constants :
+ And
+ (@Eq Nat
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 9) (instOfNatNat (nat_lit 9))))
+ (@OfNat.ofNat Nat (nat_lit 512) (instOfNatNat (nat_lit 512))))
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 288) (instOfNatNat (nat_lit 288)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 864) (instOfNatNat (nat_lit 864))))
+UniversalLaw.Side24.period_exponent :
+ @Eq Nat
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 24) (instOfNatNat (nat_lit 24)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 288) (instOfNatNat (nat_lit 288)))
+UniversalLaw.Side24.image_constant_value :
+ @Eq Nat UniversalLaw.Side24.imageConstant
+ (@OfNat.ofNat Nat (nat_lit 21175738586478) (instOfNatNat (nat_lit 21175738586478)))
+UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten :
+ @LT.lt Nat instLTNat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10)))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 125) (instOfNatNat (nat_lit 125)))
+ (@OfNat.ofNat Nat (nat_lit 20) (instOfNatNat (nat_lit 20))))
+ (UniversalLaw.Side24.fact (@OfNat.ofNat Nat (nat_lit 20) (instOfNatNat (nat_lit 20))))))
+ UniversalLaw.Side24.expTaylorNumerator
+UniversalLaw.Side24.covariance_relative_bound :
+ And
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10))))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 60) (instOfNatNat (nat_lit 60))))
+ (@LT.lt Nat instLTNat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 60) (instOfNatNat (nat_lit 60)))
+ UniversalLaw.Side24.imageConstant)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10)))
+ (@OfNat.ofNat Nat (nat_lit 17) (instOfNatNat (nat_lit 17)))))
+UniversalLaw.Side24.odd_block_eigenvalues :
+ And
+ (@Eq Int
+ (@HAdd.hAdd Int Int Int (@instHAdd Int Int.instAdd) (@OfNat.ofNat Int (nat_lit 1) (@instOfNat (nat_lit 1)))
+ (@OfNat.ofNat Int (nat_lit 15) (@instOfNat (nat_lit 15))))
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul) (@OfNat.ofNat Int (nat_lit 2) (@instOfNat (nat_lit 2)))
+ (@OfNat.ofNat Int (nat_lit 8) (@instOfNat (nat_lit 8)))))
+ (And
+ (@Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub)
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul) (@OfNat.ofNat Int (nat_lit 1) (@instOfNat (nat_lit 1)))
+ (@OfNat.ofNat Int (nat_lit 15) (@instOfNat (nat_lit 15))))
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul)
+ (@Neg.neg Int Int.instNegInt (@OfNat.ofNat Int (nat_lit 3) (@instOfNat (nat_lit 3))))
+ (@Neg.neg Int Int.instNegInt (@OfNat.ofNat Int (nat_lit 3) (@instOfNat (nat_lit 3))))))
+ (@OfNat.ofNat Int (nat_lit 6) (@instOfNat (nat_lit 6))))
+ (@Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub)
+ (@HPow.hPow Int Nat Int (@instHPow Int Nat (@instPowNat Int Int.instNatPow))
+ (@OfNat.ofNat Int (nat_lit 8) (@instOfNat (nat_lit 8)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Int (nat_lit 58) (@instOfNat (nat_lit 58))))
+ (@OfNat.ofNat Int (nat_lit 6) (@instOfNat (nat_lit 6)))))
+UniversalLaw.Side24.odd_block_shifted_minors :
+ And
+ (@Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub)
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul) (@OfNat.ofNat Int (nat_lit 3) (@instOfNat (nat_lit 3)))
+ (@OfNat.ofNat Int (nat_lit 1) (@instOfNat (nat_lit 1))))
+ (@OfNat.ofNat Int (nat_lit 1) (@instOfNat (nat_lit 1))))
+ (@OfNat.ofNat Int (nat_lit 2) (@instOfNat (nat_lit 2))))
+ (And
+ (@Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub)
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul) (@OfNat.ofNat Int (nat_lit 3) (@instOfNat (nat_lit 3)))
+ (@OfNat.ofNat Int (nat_lit 15) (@instOfNat (nat_lit 15))))
+ (@OfNat.ofNat Int (nat_lit 1) (@instOfNat (nat_lit 1))))
+ (@OfNat.ofNat Int (nat_lit 44) (@instOfNat (nat_lit 44))))
+ (@Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub)
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul) (@OfNat.ofNat Int (nat_lit 2) (@instOfNat (nat_lit 2)))
+ (@OfNat.ofNat Int (nat_lit 44) (@instOfNat (nat_lit 44))))
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul)
+ (@Neg.neg Int Int.instNegInt (@OfNat.ofNat Int (nat_lit 9) (@instOfNat (nat_lit 9))))
+ (@Neg.neg Int Int.instNegInt (@OfNat.ofNat Int (nat_lit 9) (@instOfNat (nat_lit 9))))))
+ (@OfNat.ofNat Int (nat_lit 7) (@instOfNat (nat_lit 7)))))
+UniversalLaw.Side24.smaller_eigenvalue_exceeds_third :
+ @LT.lt Nat instLTNat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 58) (instOfNatNat (nat_lit 58)))
+ (@OfNat.ofNat Nat (nat_lit 9) (instOfNatNat (nat_lit 9))))
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 23) (instOfNatNat (nat_lit 23)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+UniversalLaw.Side24.exponent_bounds (d : Nat) :
+ @Membership.mem Nat (List Nat) (@List.instMembership Nat)
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@List.cons Nat (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))) (@List.nil Nat)))
+ d →
+ And
+ (@LT.lt Nat instLTNat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (UniversalLaw.Side24.sixA d)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (UniversalLaw.Side24.sixB d)))
+ (@OfNat.ofNat Nat (nat_lit 84) (instOfNatNat (nat_lit 84))))
+ (@LT.lt Nat instLTNat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (UniversalLaw.Side24.sixA d))
+ (UniversalLaw.Side24.sixB d))
+ (@OfNat.ofNat Nat (nat_lit 78) (instOfNatNat (nat_lit 78))))
+UniversalLaw.Side24.exponent_values :
+ And
+ (@Eq Nat (UniversalLaw.Side24.sixA (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 13) (instOfNatNat (nat_lit 13))))
+ (And
+ (@Eq Nat (UniversalLaw.Side24.sixB (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 15) (instOfNatNat (nat_lit 15))))
+ (And
+ (@Eq Nat (UniversalLaw.Side24.sixA (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 25) (instOfNatNat (nat_lit 25))))
+ (@Eq Nat (UniversalLaw.Side24.sixB (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 27) (instOfNatNat (nat_lit 27))))))
+UniversalLaw.Side24.ratio_constant_ordering :
+ And
+ (@LE.le Nat instLENat (@OfNat.ofNat Nat (nat_lit 13) (instOfNatNat (nat_lit 13)))
+ (@OfNat.ofNat Nat (nat_lit 32) (instOfNatNat (nat_lit 32))))
+ (@LE.le Nat instLENat (@OfNat.ofNat Nat (nat_lit 28) (instOfNatNat (nat_lit 28)))
+ (@OfNat.ofNat Nat (nat_lit 32) (instOfNatNat (nat_lit 32))))
+UniversalLaw.Side24.density_comparison_below_reported :
+ @LT.lt Nat instLTNat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 32) (instOfNatNat (nat_lit 32)))
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10)))
+ (@OfNat.ofNat Nat (nat_lit 106) (instOfNatNat (nat_lit 106)))))
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10)))
+ (@OfNat.ofNat Nat (nat_lit 108) (instOfNatNat (nat_lit 108))))
+UniversalLaw.Side24.conditional_third_derivative_variance :
+ @Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub) (@OfNat.ofNat Int (nat_lit 15) (@instOfNat (nat_lit 15)))
+ (@HDiv.hDiv Int Int Int (@instHDiv Int Int.instDiv)
+ (@HMul.hMul Int Int Int (@instHMul Int Int.instMul)
+ (@Neg.neg Int Int.instNegInt (@OfNat.ofNat Int (nat_lit 3) (@instOfNat (nat_lit 3))))
+ (@Neg.neg Int Int.instNegInt (@OfNat.ofNat Int (nat_lit 3) (@instOfNat (nat_lit 3)))))
+ (@OfNat.ofNat Int (nat_lit 1) (@instOfNat (nat_lit 1)))))
+ (@OfNat.ofNat Int (nat_lit 6) (@instOfNat (nat_lit 6)))
+UniversalLaw.Side24.transverse_covariance_entries_thirds :
+ And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8))))
+ (And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))))
+ (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+UniversalLaw.Side24.cone_moment_m1_thirds :
+ @Eq Nat (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8)))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4))))
+UniversalLaw.Side24.trace_and_traceless_variances :
+ And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8)))
+ (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+ (@OfNat.ofNat Nat (nat_lit 20) (instOfNatNat (nat_lit 20))))
+ (And
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 20) (instOfNatNat (nat_lit 20)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5)))
+ (@OfNat.ofNat Nat (nat_lit 12) (instOfNatNat (nat_lit 12)))))
+ (And
+ (@Eq Nat
+ (@HSub.hSub Nat Nat Nat (@instHSub Nat instSubNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8)))
+ (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+ (@OfNat.ofNat Nat (nat_lit 12) (instOfNatNat (nat_lit 12))))
+ (And
+ (@Eq Nat (@OfNat.ofNat Nat (nat_lit 12) (instOfNatNat (nat_lit 12)))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))
+ (@OfNat.ofNat Nat (nat_lit 12) (instOfNatNat (nat_lit 12)))))
+ (@Eq Int
+ (@HSub.hSub Int Int Int (@instHSub Int Int.instSub) (@OfNat.ofNat Int (nat_lit 8) (@instOfNat (nat_lit 8)))
+ (@OfNat.ofNat Int (nat_lit 8) (@instOfNat (nat_lit 8))))
+ (@OfNat.ofNat Int (nat_lit 0) (@instOfNat (nat_lit 0)))))))
+UniversalLaw.Side24.fourth_moment_of_trace :
+ @Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 25) (instOfNatNat (nat_lit 25)))
+ (@OfNat.ofNat Nat (nat_lit 9) (instOfNatNat (nat_lit 9))))
+UniversalLaw.Side24.exponential_moment_of_trace :
+ @Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5))))
+ (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8)))
+UniversalLaw.Side24.cone_moment_m2_algebra :
+ And
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4)))
+ (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5))))
+ (@OfNat.ofNat Nat (nat_lit 20) (instOfNatNat (nat_lit 20))))
+ (And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HSub.hSub Nat Nat Nat (@instHSub Nat instSubNat) (@OfNat.ofNat Nat (nat_lit 25) (instOfNatNat (nat_lit 25)))
+ (@OfNat.ofNat Nat (nat_lit 20) (instOfNatNat (nat_lit 20))))
+ (@OfNat.ofNat Nat (nat_lit 24) (instOfNatNat (nat_lit 24))))
+ (@OfNat.ofNat Nat (nat_lit 29) (instOfNatNat (nat_lit 29))))
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6)))
+ (@OfNat.ofNat Nat (nat_lit 8) (instOfNatNat (nat_lit 8))))))
+UniversalLaw.Side24.cube_root_simplification :
+ @Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 24) (instOfNatNat (nat_lit 24))))
+UniversalLaw.Side24.pin_determinant_and_joint_dimension :
+ And
+ (@Eq Nat
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+ (@OfNat.ofNat Nat (nat_lit 6) (instOfNatNat (nat_lit 6))))
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
+ (@HDiv.hDiv Nat Nat Nat (@instHDiv Nat Nat.instDiv)
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4))))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
+ (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10)))))
+UniversalLaw.Side24.hessian_block_eigenvalues :
+ And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4))))
+ (And
+ (@Eq Nat
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
+ (@OfNat.ofNat Nat (nat_lit 5) (instOfNatNat (nat_lit 5))))
+ (@LT.lt Nat instLTNat (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))
+ (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
+ (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))))
+UniversalLaw.Side24.d2_endpoints_adjacent :
+ And (@LT.lt Nat instLTNat UniversalLaw.Side24.d2Lower UniversalLaw.Side24.d2Upper)
+ (@Eq Nat UniversalLaw.Side24.d2Upper
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) UniversalLaw.Side24.d2Lower
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
+UniversalLaw.Side24.d3_endpoints_adjacent :
+ And (@LT.lt Nat instLTNat UniversalLaw.Side24.d3Lower UniversalLaw.Side24.d3Upper)
+ (@Eq Nat UniversalLaw.Side24.d3Upper
+ (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) UniversalLaw.Side24.d3Lower
+ (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
+UniversalLaw.Side24.d3_below_d2 : @LT.lt Nat instLTNat UniversalLaw.Side24.d3Upper UniversalLaw.Side24.d2Lower
+UniversalLaw.Side24.endpoints_in_unit_tenth :
+ And (@LT.lt Nat instLTNat (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))) UniversalLaw.Side24.d3Lower)
+ (@LT.lt Nat instLTNat UniversalLaw.Side24.d2Upper
+ (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@instPowNat Nat instNatPowNat))
+ (@OfNat.ofNat Nat (nat_lit 10) (instOfNatNat (nat_lit 10)))
+ (@OfNat.ofNat Nat (nat_lit 19) (instOfNatNat (nat_lit 19)))))
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_covariance_bound.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_covariance_bound.lean
new file mode 100644
index 000000000..c4941c3c1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_covariance_bound.lean
@@ -0,0 +1,142 @@
+/-!
+# SIDE24 coefficient note — analytic-image ledger, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+sections 2–4, and the `image_ledger()` function of `coefficient.py`.
+
+What this module establishes: every *exact integer or rational* identity and
+inequality that sections 2–4 of the note rely on is checked by the Lean kernel.
+No `sorry`, no `native_decide`, no axioms (the `--run-lean` receipt records the
+transitive `#print axioms` result for every target).
+
+What this module does **not** establish: the analytic facts the arithmetic is
+attached to — the Gaussian derivative bound `76|x|^6 e^{-|x|^2/2}` for `|x| ≥ 1`,
+the geometric-tail argument, the positive-semidefinite covariance comparison,
+the Schur-complement monotonicity, the Gaussian density comparison, and the
+`log`/`exp` estimates that turn exponents into the factor `32ε`. Those remain
+author-side prose under nonauthor review (Layer 0). Nothing here changes the
+scientific status of the coefficient or of its parent theorem.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Factorial on `Nat`; kept local so that the library has no dependencies. -/
+def fact : Nat → Nat
+ | 0 => 1
+ | n + 1 => (n + 1) * fact n
+
+/-- Product-rule pairing count for `q` unit directional derivatives of
+`exp(-|x|^2/2)`: `∑_{j=0}^{⌊q/2⌋} q! / (2^j j! (q-2j)!)`. Section 2 of the note
+uses its value at `q = 6` and the fact that it dominates the lower orders. -/
+def pairingSum (q : Nat) : Nat :=
+ (List.range (q / 2 + 1)).foldl
+ (fun acc j => acc + fact q / (2 ^ j * fact j * fact (q - 2 * j))) 0
+
+/-- Source: "The coefficient sum for q=6 is 1+15+45+15=76". -/
+theorem pairing_sum_six : pairingSum 6 = 76 := by decide
+
+/-- Source: "and it bounds the smaller orders as well". -/
+theorem pairing_sum_le_six : ∀ q, q ∈ [0, 1, 2, 3, 4, 5, 6] → pairingSum q ≤ 76 := by
+ decide
+
+/-- The individual pairing terms at `q = 6`, as displayed in the note. -/
+theorem pairing_terms_six :
+ fact 6 / (2 ^ 0 * fact 0 * fact 6) = 1 ∧
+ fact 6 / (2 ^ 1 * fact 1 * fact 4) = 15 ∧
+ fact 6 / (2 ^ 2 * fact 2 * fact 2) = 45 ∧
+ fact 6 / (2 ^ 3 * fact 3 * fact 0) = 15 := by
+ decide
+
+/-- Source: "At zero, every such contraction has absolute value at most 15".
+The sixth Gaussian moment / sixth derivative of `exp(-x^2/2)` at zero is the
+double factorial `5!! = 1·3·5`. Only the arithmetic value is checked here. -/
+theorem sixth_moment_double_factorial : 1 * 3 * 5 = 15 := by decide
+
+/-- Source: "there are at most 27j^3 possibilities for d<=3, |n|^6<=27j^6" and
+"<=729 sum_{j>=1} j^9 e^(-288j^2) <=1458 e^(-288)". The two factors of 27 give
+729; the geometric tail with ratio at most 1/2 gives the factor 2. -/
+theorem lattice_shell_constant : 27 * 27 = 729 ∧ 729 * 2 = 1458 := by decide
+
+/-- Source: "successive terms have ratio at most 512e^(-864)". `512 = 2^9` is
+the worst ratio `(j+1)^9 / j^9` at `j = 1`; `864 = 288·3` is the exponent gap
+`288((j+1)^2 - j^2)` at `j = 1`. -/
+theorem geometric_ratio_constants : 2 ^ 9 = 512 ∧ 288 * 3 = 864 := by decide
+
+/-- `24^2 / 2 = 288`: the periodization exponent for lattice period 24. -/
+theorem period_exponent : 24 ^ 2 / 2 = 288 := by decide
+
+/-- The image constant `E · 10^125` of display (2):
+`1458 · (76 · 24^6 + 15)`. -/
+def imageConstant : Nat := 1458 * (76 * 24 ^ 6 + 15)
+
+/-- Source: "E := 1458*(76*24^6+15)*10^(-125) = 21175738586478 *10^(-125)". -/
+theorem image_constant_value : imageConstant = 21175738586478 := by decide
+
+/-- Numerator of the degree-20 Taylor partial sum of `exp(288/125)` after
+clearing the denominator `125^20 · 20!`:
+`∑_{k=0}^{20} 288^k · 125^(20-k) · 20!/k!`. -/
+def expTaylorNumerator : Nat :=
+ (List.range 21).foldl
+ (fun acc k => acc + 288 ^ k * 125 ^ (20 - k) * (fact 20 / fact k)) 0
+
+/-- Source: "The code proves e^(288/125)>10 using the positive rational Taylor
+sum through20". Because every Taylor term of `exp` at a positive argument is
+positive, the partial sum is a lower bound; this theorem checks that the exact
+rational partial sum exceeds 10. The step from the partial sum to `exp` itself
+is analysis and is not formalised here. -/
+theorem exp_taylor_partial_sum_gt_ten :
+ 10 * (125 ^ 20 * fact 20) < expTaylorNumerator := by decide
+
+/-- Source: "Each covariance entry differs from the reference by at most2E ...
+the spectral norm of the difference is at most20E" (dimension at most 10) and
+"C_ref >= I/3 ... epsilon=10^(-108), since60E 1/3 ⇔ 23/3 > √58 ⇔ 23^2 > 58·9`. -/
+theorem smaller_eigenvalue_exceeds_third : 58 * 9 < 23 ^ 2 := by decide
+
+/-- Source (section 4): with `m = d-1`, `n = m(m+1)/2`, `a = m + 2/3 + n/2`,
+`b = d + n/2`. These are `6a` and `6b` as natural numbers. -/
+def sixA (d : Nat) : Nat := 6 * (d - 1) + 4 + 3 * ((d - 1) * d / 2)
+def sixB (d : Nat) : Nat := 6 * d + 3 * ((d - 1) * d / 2)
+
+/-- Source: "For d=2,3, a+2b<14 and2a+b<13". In sixths: `6a + 12b < 84` and
+`12a + 6b < 78`. For `d = 3` the second inequality is `77 < 78`, so this is a
+genuinely tight check. -/
+theorem exponent_bounds :
+ ∀ d, d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 78 := by
+ decide
+
+/-- The exact values behind `exponent_bounds`: `d = 2` gives `a = 13/6`, `b = 5/2`;
+`d = 3` gives `a = 25/6`, `b = 9/2`. -/
+theorem exponent_values :
+ sixA 2 = 13 ∧ sixB 2 = 15 ∧ sixA 3 = 25 ∧ sixB 3 = 27 := by decide
+
+/-- Source: "ratio between1-13epsilon and1+28epsilon, hence safely between
+1-32epsilon and1+32epsilon". The analytic `log`/`exp` estimates are not
+formalised; the ordering of the constants is. -/
+theorem ratio_constant_ordering : 13 ≤ 32 ∧ 28 ≤ 32 := by decide
+
+/-- Source: "|c_d,24/c_d,ref -1| < 10^(-106)" together with `ε = 10^(-108)`
+and the factor 32 from section 4: `32 · 10^(-108) < 10^(-106)`. -/
+theorem density_comparison_below_reported : 32 * 10 ^ 106 < 10 ^ 108 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_covariance_bound.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_covariance_bound.log
new file mode 100644
index 000000000..4e58b81dc
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_covariance_bound.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/false_covariance_bound.lean:97:57: error: Tactic `decide` proved that the proposition
+ 2 * 10 * 3 = 60 ∧ 60 * imageConstant < 10 ^ 15
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_eigenvalue_third.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_eigenvalue_third.lean
new file mode 100644
index 000000000..34c7727b4
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_eigenvalue_third.lean
@@ -0,0 +1,142 @@
+/-!
+# SIDE24 coefficient note — analytic-image ledger, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+sections 2–4, and the `image_ledger()` function of `coefficient.py`.
+
+What this module establishes: every *exact integer or rational* identity and
+inequality that sections 2–4 of the note rely on is checked by the Lean kernel.
+No `sorry`, no `native_decide`, no axioms (the `--run-lean` receipt records the
+transitive `#print axioms` result for every target).
+
+What this module does **not** establish: the analytic facts the arithmetic is
+attached to — the Gaussian derivative bound `76|x|^6 e^{-|x|^2/2}` for `|x| ≥ 1`,
+the geometric-tail argument, the positive-semidefinite covariance comparison,
+the Schur-complement monotonicity, the Gaussian density comparison, and the
+`log`/`exp` estimates that turn exponents into the factor `32ε`. Those remain
+author-side prose under nonauthor review (Layer 0). Nothing here changes the
+scientific status of the coefficient or of its parent theorem.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Factorial on `Nat`; kept local so that the library has no dependencies. -/
+def fact : Nat → Nat
+ | 0 => 1
+ | n + 1 => (n + 1) * fact n
+
+/-- Product-rule pairing count for `q` unit directional derivatives of
+`exp(-|x|^2/2)`: `∑_{j=0}^{⌊q/2⌋} q! / (2^j j! (q-2j)!)`. Section 2 of the note
+uses its value at `q = 6` and the fact that it dominates the lower orders. -/
+def pairingSum (q : Nat) : Nat :=
+ (List.range (q / 2 + 1)).foldl
+ (fun acc j => acc + fact q / (2 ^ j * fact j * fact (q - 2 * j))) 0
+
+/-- Source: "The coefficient sum for q=6 is 1+15+45+15=76". -/
+theorem pairing_sum_six : pairingSum 6 = 76 := by decide
+
+/-- Source: "and it bounds the smaller orders as well". -/
+theorem pairing_sum_le_six : ∀ q, q ∈ [0, 1, 2, 3, 4, 5, 6] → pairingSum q ≤ 76 := by
+ decide
+
+/-- The individual pairing terms at `q = 6`, as displayed in the note. -/
+theorem pairing_terms_six :
+ fact 6 / (2 ^ 0 * fact 0 * fact 6) = 1 ∧
+ fact 6 / (2 ^ 1 * fact 1 * fact 4) = 15 ∧
+ fact 6 / (2 ^ 2 * fact 2 * fact 2) = 45 ∧
+ fact 6 / (2 ^ 3 * fact 3 * fact 0) = 15 := by
+ decide
+
+/-- Source: "At zero, every such contraction has absolute value at most 15".
+The sixth Gaussian moment / sixth derivative of `exp(-x^2/2)` at zero is the
+double factorial `5!! = 1·3·5`. Only the arithmetic value is checked here. -/
+theorem sixth_moment_double_factorial : 1 * 3 * 5 = 15 := by decide
+
+/-- Source: "there are at most 27j^3 possibilities for d<=3, |n|^6<=27j^6" and
+"<=729 sum_{j>=1} j^9 e^(-288j^2) <=1458 e^(-288)". The two factors of 27 give
+729; the geometric tail with ratio at most 1/2 gives the factor 2. -/
+theorem lattice_shell_constant : 27 * 27 = 729 ∧ 729 * 2 = 1458 := by decide
+
+/-- Source: "successive terms have ratio at most 512e^(-864)". `512 = 2^9` is
+the worst ratio `(j+1)^9 / j^9` at `j = 1`; `864 = 288·3` is the exponent gap
+`288((j+1)^2 - j^2)` at `j = 1`. -/
+theorem geometric_ratio_constants : 2 ^ 9 = 512 ∧ 288 * 3 = 864 := by decide
+
+/-- `24^2 / 2 = 288`: the periodization exponent for lattice period 24. -/
+theorem period_exponent : 24 ^ 2 / 2 = 288 := by decide
+
+/-- The image constant `E · 10^125` of display (2):
+`1458 · (76 · 24^6 + 15)`. -/
+def imageConstant : Nat := 1458 * (76 * 24 ^ 6 + 15)
+
+/-- Source: "E := 1458*(76*24^6+15)*10^(-125) = 21175738586478 *10^(-125)". -/
+theorem image_constant_value : imageConstant = 21175738586478 := by decide
+
+/-- Numerator of the degree-20 Taylor partial sum of `exp(288/125)` after
+clearing the denominator `125^20 · 20!`:
+`∑_{k=0}^{20} 288^k · 125^(20-k) · 20!/k!`. -/
+def expTaylorNumerator : Nat :=
+ (List.range 21).foldl
+ (fun acc k => acc + 288 ^ k * 125 ^ (20 - k) * (fact 20 / fact k)) 0
+
+/-- Source: "The code proves e^(288/125)>10 using the positive rational Taylor
+sum through20". Because every Taylor term of `exp` at a positive argument is
+positive, the partial sum is a lower bound; this theorem checks that the exact
+rational partial sum exceeds 10. The step from the partial sum to `exp` itself
+is analysis and is not formalised here. -/
+theorem exp_taylor_partial_sum_gt_ten :
+ 10 * (125 ^ 20 * fact 20) < expTaylorNumerator := by decide
+
+/-- Source: "Each covariance entry differs from the reference by at most2E ...
+the spectral norm of the difference is at most20E" (dimension at most 10) and
+"C_ref >= I/3 ... epsilon=10^(-108), since60E 1/3 ⇔ 23/3 > √58 ⇔ 23^2 > 58·9`. -/
+theorem smaller_eigenvalue_exceeds_third : 58 * 9 < 22 ^ 2 := by decide
+
+/-- Source (section 4): with `m = d-1`, `n = m(m+1)/2`, `a = m + 2/3 + n/2`,
+`b = d + n/2`. These are `6a` and `6b` as natural numbers. -/
+def sixA (d : Nat) : Nat := 6 * (d - 1) + 4 + 3 * ((d - 1) * d / 2)
+def sixB (d : Nat) : Nat := 6 * d + 3 * ((d - 1) * d / 2)
+
+/-- Source: "For d=2,3, a+2b<14 and2a+b<13". In sixths: `6a + 12b < 84` and
+`12a + 6b < 78`. For `d = 3` the second inequality is `77 < 78`, so this is a
+genuinely tight check. -/
+theorem exponent_bounds :
+ ∀ d, d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 78 := by
+ decide
+
+/-- The exact values behind `exponent_bounds`: `d = 2` gives `a = 13/6`, `b = 5/2`;
+`d = 3` gives `a = 25/6`, `b = 9/2`. -/
+theorem exponent_values :
+ sixA 2 = 13 ∧ sixB 2 = 15 ∧ sixA 3 = 25 ∧ sixB 3 = 27 := by decide
+
+/-- Source: "ratio between1-13epsilon and1+28epsilon, hence safely between
+1-32epsilon and1+32epsilon". The analytic `log`/`exp` estimates are not
+formalised; the ordering of the constants is. -/
+theorem ratio_constant_ordering : 13 ≤ 32 ∧ 28 ≤ 32 := by decide
+
+/-- Source: "|c_d,24/c_d,ref -1| < 10^(-106)" together with `ε = 10^(-108)`
+and the factor 32 from section 4: `32 · 10^(-108) < 10^(-106)`. -/
+theorem density_comparison_below_reported : 32 * 10 ^ 106 < 10 ^ 108 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_eigenvalue_third.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_eigenvalue_third.log
new file mode 100644
index 000000000..6d314fe0f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_eigenvalue_third.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/false_eigenvalue_third.lean:114:65: error: Tactic `decide` proved that the proposition
+ 58 * 9 < 22 ^ 2
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_endpoint_adjacency.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_endpoint_adjacency.lean
new file mode 100644
index 000000000..53568c6e9
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_endpoint_adjacency.lean
@@ -0,0 +1,42 @@
+/-!
+# SIDE24 published endpoints — consistency of the frozen artifact
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/ENCLOSURE.json`,
+1090 bytes, SHA-256 `72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811`.
+
+The published decimal endpoints are transcribed here as integers in units of
+`10^-20`. The kernel checks that each interval is nonempty and exactly one
+`10^-20` step wide, and that the two intervals are disjoint and ordered.
+
+This module does **not** establish that the coefficient lies in either
+interval: that claim needs `Real.Gamma`, `Real.pi`, `Real.exp` and the
+Gaussian cone moments, none of which exist in core Lean. That boundary is
+recorded target by target in `formal/SCOPE.md`; the enclosure itself is not a
+target of this package.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- `0.07340691930603427103` and `0.07340691930603427104` in units of `10^-20`. -/
+def d2Lower : Nat := 7340691930603427103
+def d2Upper : Nat := 7340691930603427104
+
+/-- `0.04177593184059834334` and `0.04177593184059834335` in units of `10^-20`. -/
+def d3Lower : Nat := 4177593184059834334
+def d3Upper : Nat := 4177593184059834335
+
+/-- Source: "0.07340691930603427103 < c_2,24 < 0.07340691930603427104" — the
+published endpoints are distinct and adjacent on the 20-digit grid. -/
+theorem d2_endpoints_adjacent : d2Lower < d2Upper ∧ d2Upper = d2Lower + 2 := by decide
+
+/-- Source: "0.04177593184059834334 < c_3,24 < 0.04177593184059834335". -/
+theorem d3_endpoints_adjacent : d3Lower < d3Upper ∧ d3Upper = d3Lower + 1 := by decide
+
+/-- The published `d = 3` interval lies strictly below the `d = 2` interval. -/
+theorem d3_below_d2 : d3Upper < d2Lower := by decide
+
+/-- Both published intervals lie in `(0, 1/10)`: `10^-20`-units below `10^19`. -/
+theorem endpoints_in_unit_tenth : 0 < d3Lower ∧ d2Upper < 10 ^ 19 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_endpoint_adjacency.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_endpoint_adjacency.log
new file mode 100644
index 000000000..573733867
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_endpoint_adjacency.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/false_endpoint_adjacency.lean:31:80: error: Tactic `decide` proved that the proposition
+ d2Lower < d2Upper ∧ d2Upper = d2Lower + 2
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exp_partial_sum.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exp_partial_sum.lean
new file mode 100644
index 000000000..1e10c9733
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exp_partial_sum.lean
@@ -0,0 +1,142 @@
+/-!
+# SIDE24 coefficient note — analytic-image ledger, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+sections 2–4, and the `image_ledger()` function of `coefficient.py`.
+
+What this module establishes: every *exact integer or rational* identity and
+inequality that sections 2–4 of the note rely on is checked by the Lean kernel.
+No `sorry`, no `native_decide`, no axioms (the `--run-lean` receipt records the
+transitive `#print axioms` result for every target).
+
+What this module does **not** establish: the analytic facts the arithmetic is
+attached to — the Gaussian derivative bound `76|x|^6 e^{-|x|^2/2}` for `|x| ≥ 1`,
+the geometric-tail argument, the positive-semidefinite covariance comparison,
+the Schur-complement monotonicity, the Gaussian density comparison, and the
+`log`/`exp` estimates that turn exponents into the factor `32ε`. Those remain
+author-side prose under nonauthor review (Layer 0). Nothing here changes the
+scientific status of the coefficient or of its parent theorem.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Factorial on `Nat`; kept local so that the library has no dependencies. -/
+def fact : Nat → Nat
+ | 0 => 1
+ | n + 1 => (n + 1) * fact n
+
+/-- Product-rule pairing count for `q` unit directional derivatives of
+`exp(-|x|^2/2)`: `∑_{j=0}^{⌊q/2⌋} q! / (2^j j! (q-2j)!)`. Section 2 of the note
+uses its value at `q = 6` and the fact that it dominates the lower orders. -/
+def pairingSum (q : Nat) : Nat :=
+ (List.range (q / 2 + 1)).foldl
+ (fun acc j => acc + fact q / (2 ^ j * fact j * fact (q - 2 * j))) 0
+
+/-- Source: "The coefficient sum for q=6 is 1+15+45+15=76". -/
+theorem pairing_sum_six : pairingSum 6 = 76 := by decide
+
+/-- Source: "and it bounds the smaller orders as well". -/
+theorem pairing_sum_le_six : ∀ q, q ∈ [0, 1, 2, 3, 4, 5, 6] → pairingSum q ≤ 76 := by
+ decide
+
+/-- The individual pairing terms at `q = 6`, as displayed in the note. -/
+theorem pairing_terms_six :
+ fact 6 / (2 ^ 0 * fact 0 * fact 6) = 1 ∧
+ fact 6 / (2 ^ 1 * fact 1 * fact 4) = 15 ∧
+ fact 6 / (2 ^ 2 * fact 2 * fact 2) = 45 ∧
+ fact 6 / (2 ^ 3 * fact 3 * fact 0) = 15 := by
+ decide
+
+/-- Source: "At zero, every such contraction has absolute value at most 15".
+The sixth Gaussian moment / sixth derivative of `exp(-x^2/2)` at zero is the
+double factorial `5!! = 1·3·5`. Only the arithmetic value is checked here. -/
+theorem sixth_moment_double_factorial : 1 * 3 * 5 = 15 := by decide
+
+/-- Source: "there are at most 27j^3 possibilities for d<=3, |n|^6<=27j^6" and
+"<=729 sum_{j>=1} j^9 e^(-288j^2) <=1458 e^(-288)". The two factors of 27 give
+729; the geometric tail with ratio at most 1/2 gives the factor 2. -/
+theorem lattice_shell_constant : 27 * 27 = 729 ∧ 729 * 2 = 1458 := by decide
+
+/-- Source: "successive terms have ratio at most 512e^(-864)". `512 = 2^9` is
+the worst ratio `(j+1)^9 / j^9` at `j = 1`; `864 = 288·3` is the exponent gap
+`288((j+1)^2 - j^2)` at `j = 1`. -/
+theorem geometric_ratio_constants : 2 ^ 9 = 512 ∧ 288 * 3 = 864 := by decide
+
+/-- `24^2 / 2 = 288`: the periodization exponent for lattice period 24. -/
+theorem period_exponent : 24 ^ 2 / 2 = 288 := by decide
+
+/-- The image constant `E · 10^125` of display (2):
+`1458 · (76 · 24^6 + 15)`. -/
+def imageConstant : Nat := 1458 * (76 * 24 ^ 6 + 15)
+
+/-- Source: "E := 1458*(76*24^6+15)*10^(-125) = 21175738586478 *10^(-125)". -/
+theorem image_constant_value : imageConstant = 21175738586478 := by decide
+
+/-- Numerator of the degree-20 Taylor partial sum of `exp(288/125)` after
+clearing the denominator `125^20 · 20!`:
+`∑_{k=0}^{20} 288^k · 125^(20-k) · 20!/k!`. -/
+def expTaylorNumerator : Nat :=
+ (List.range 21).foldl
+ (fun acc k => acc + 288 ^ k * 125 ^ (20 - k) * (fact 20 / fact k)) 0
+
+/-- Source: "The code proves e^(288/125)>10 using the positive rational Taylor
+sum through20". Because every Taylor term of `exp` at a positive argument is
+positive, the partial sum is a lower bound; this theorem checks that the exact
+rational partial sum exceeds 10. The step from the partial sum to `exp` itself
+is analysis and is not formalised here. -/
+theorem exp_taylor_partial_sum_gt_ten :
+ 11 * (125 ^ 20 * fact 20) < expTaylorNumerator := by decide
+
+/-- Source: "Each covariance entry differs from the reference by at most2E ...
+the spectral norm of the difference is at most20E" (dimension at most 10) and
+"C_ref >= I/3 ... epsilon=10^(-108), since60E 1/3 ⇔ 23/3 > √58 ⇔ 23^2 > 58·9`. -/
+theorem smaller_eigenvalue_exceeds_third : 58 * 9 < 23 ^ 2 := by decide
+
+/-- Source (section 4): with `m = d-1`, `n = m(m+1)/2`, `a = m + 2/3 + n/2`,
+`b = d + n/2`. These are `6a` and `6b` as natural numbers. -/
+def sixA (d : Nat) : Nat := 6 * (d - 1) + 4 + 3 * ((d - 1) * d / 2)
+def sixB (d : Nat) : Nat := 6 * d + 3 * ((d - 1) * d / 2)
+
+/-- Source: "For d=2,3, a+2b<14 and2a+b<13". In sixths: `6a + 12b < 84` and
+`12a + 6b < 78`. For `d = 3` the second inequality is `77 < 78`, so this is a
+genuinely tight check. -/
+theorem exponent_bounds :
+ ∀ d, d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 78 := by
+ decide
+
+/-- The exact values behind `exponent_bounds`: `d = 2` gives `a = 13/6`, `b = 5/2`;
+`d = 3` gives `a = 25/6`, `b = 9/2`. -/
+theorem exponent_values :
+ sixA 2 = 13 ∧ sixB 2 = 15 ∧ sixA 3 = 25 ∧ sixB 3 = 27 := by decide
+
+/-- Source: "ratio between1-13epsilon and1+28epsilon, hence safely between
+1-32epsilon and1+32epsilon". The analytic `log`/`exp` estimates are not
+formalised; the ordering of the constants is. -/
+theorem ratio_constant_ordering : 13 ≤ 32 ∧ 28 ≤ 32 := by decide
+
+/-- Source: "|c_d,24/c_d,ref -1| < 10^(-106)" together with `ε = 10^(-108)`
+and the factor 32 from section 4: `32 · 10^(-108) < 10^(-106)`. -/
+theorem density_comparison_below_reported : 32 * 10 ^ 106 < 10 ^ 108 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exp_partial_sum.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exp_partial_sum.log
new file mode 100644
index 000000000..b8640ddd1
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exp_partial_sum.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/false_exp_partial_sum.lean:90:57: error: Tactic `decide` proved that the proposition
+ 11 * (125 ^ 20 * fact 20) < expTaylorNumerator
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exponent_bound_d3.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exponent_bound_d3.lean
new file mode 100644
index 000000000..7153c6709
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exponent_bound_d3.lean
@@ -0,0 +1,142 @@
+/-!
+# SIDE24 coefficient note — analytic-image ledger, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+sections 2–4, and the `image_ledger()` function of `coefficient.py`.
+
+What this module establishes: every *exact integer or rational* identity and
+inequality that sections 2–4 of the note rely on is checked by the Lean kernel.
+No `sorry`, no `native_decide`, no axioms (the `--run-lean` receipt records the
+transitive `#print axioms` result for every target).
+
+What this module does **not** establish: the analytic facts the arithmetic is
+attached to — the Gaussian derivative bound `76|x|^6 e^{-|x|^2/2}` for `|x| ≥ 1`,
+the geometric-tail argument, the positive-semidefinite covariance comparison,
+the Schur-complement monotonicity, the Gaussian density comparison, and the
+`log`/`exp` estimates that turn exponents into the factor `32ε`. Those remain
+author-side prose under nonauthor review (Layer 0). Nothing here changes the
+scientific status of the coefficient or of its parent theorem.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Factorial on `Nat`; kept local so that the library has no dependencies. -/
+def fact : Nat → Nat
+ | 0 => 1
+ | n + 1 => (n + 1) * fact n
+
+/-- Product-rule pairing count for `q` unit directional derivatives of
+`exp(-|x|^2/2)`: `∑_{j=0}^{⌊q/2⌋} q! / (2^j j! (q-2j)!)`. Section 2 of the note
+uses its value at `q = 6` and the fact that it dominates the lower orders. -/
+def pairingSum (q : Nat) : Nat :=
+ (List.range (q / 2 + 1)).foldl
+ (fun acc j => acc + fact q / (2 ^ j * fact j * fact (q - 2 * j))) 0
+
+/-- Source: "The coefficient sum for q=6 is 1+15+45+15=76". -/
+theorem pairing_sum_six : pairingSum 6 = 76 := by decide
+
+/-- Source: "and it bounds the smaller orders as well". -/
+theorem pairing_sum_le_six : ∀ q, q ∈ [0, 1, 2, 3, 4, 5, 6] → pairingSum q ≤ 76 := by
+ decide
+
+/-- The individual pairing terms at `q = 6`, as displayed in the note. -/
+theorem pairing_terms_six :
+ fact 6 / (2 ^ 0 * fact 0 * fact 6) = 1 ∧
+ fact 6 / (2 ^ 1 * fact 1 * fact 4) = 15 ∧
+ fact 6 / (2 ^ 2 * fact 2 * fact 2) = 45 ∧
+ fact 6 / (2 ^ 3 * fact 3 * fact 0) = 15 := by
+ decide
+
+/-- Source: "At zero, every such contraction has absolute value at most 15".
+The sixth Gaussian moment / sixth derivative of `exp(-x^2/2)` at zero is the
+double factorial `5!! = 1·3·5`. Only the arithmetic value is checked here. -/
+theorem sixth_moment_double_factorial : 1 * 3 * 5 = 15 := by decide
+
+/-- Source: "there are at most 27j^3 possibilities for d<=3, |n|^6<=27j^6" and
+"<=729 sum_{j>=1} j^9 e^(-288j^2) <=1458 e^(-288)". The two factors of 27 give
+729; the geometric tail with ratio at most 1/2 gives the factor 2. -/
+theorem lattice_shell_constant : 27 * 27 = 729 ∧ 729 * 2 = 1458 := by decide
+
+/-- Source: "successive terms have ratio at most 512e^(-864)". `512 = 2^9` is
+the worst ratio `(j+1)^9 / j^9` at `j = 1`; `864 = 288·3` is the exponent gap
+`288((j+1)^2 - j^2)` at `j = 1`. -/
+theorem geometric_ratio_constants : 2 ^ 9 = 512 ∧ 288 * 3 = 864 := by decide
+
+/-- `24^2 / 2 = 288`: the periodization exponent for lattice period 24. -/
+theorem period_exponent : 24 ^ 2 / 2 = 288 := by decide
+
+/-- The image constant `E · 10^125` of display (2):
+`1458 · (76 · 24^6 + 15)`. -/
+def imageConstant : Nat := 1458 * (76 * 24 ^ 6 + 15)
+
+/-- Source: "E := 1458*(76*24^6+15)*10^(-125) = 21175738586478 *10^(-125)". -/
+theorem image_constant_value : imageConstant = 21175738586478 := by decide
+
+/-- Numerator of the degree-20 Taylor partial sum of `exp(288/125)` after
+clearing the denominator `125^20 · 20!`:
+`∑_{k=0}^{20} 288^k · 125^(20-k) · 20!/k!`. -/
+def expTaylorNumerator : Nat :=
+ (List.range 21).foldl
+ (fun acc k => acc + 288 ^ k * 125 ^ (20 - k) * (fact 20 / fact k)) 0
+
+/-- Source: "The code proves e^(288/125)>10 using the positive rational Taylor
+sum through20". Because every Taylor term of `exp` at a positive argument is
+positive, the partial sum is a lower bound; this theorem checks that the exact
+rational partial sum exceeds 10. The step from the partial sum to `exp` itself
+is analysis and is not formalised here. -/
+theorem exp_taylor_partial_sum_gt_ten :
+ 10 * (125 ^ 20 * fact 20) < expTaylorNumerator := by decide
+
+/-- Source: "Each covariance entry differs from the reference by at most2E ...
+the spectral norm of the difference is at most20E" (dimension at most 10) and
+"C_ref >= I/3 ... epsilon=10^(-108), since60E 1/3 ⇔ 23/3 > √58 ⇔ 23^2 > 58·9`. -/
+theorem smaller_eigenvalue_exceeds_third : 58 * 9 < 23 ^ 2 := by decide
+
+/-- Source (section 4): with `m = d-1`, `n = m(m+1)/2`, `a = m + 2/3 + n/2`,
+`b = d + n/2`. These are `6a` and `6b` as natural numbers. -/
+def sixA (d : Nat) : Nat := 6 * (d - 1) + 4 + 3 * ((d - 1) * d / 2)
+def sixB (d : Nat) : Nat := 6 * d + 3 * ((d - 1) * d / 2)
+
+/-- Source: "For d=2,3, a+2b<14 and2a+b<13". In sixths: `6a + 12b < 84` and
+`12a + 6b < 78`. For `d = 3` the second inequality is `77 < 78`, so this is a
+genuinely tight check. -/
+theorem exponent_bounds :
+ ∀ d, d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 77 := by
+ decide
+
+/-- The exact values behind `exponent_bounds`: `d = 2` gives `a = 13/6`, `b = 5/2`;
+`d = 3` gives `a = 25/6`, `b = 9/2`. -/
+theorem exponent_values :
+ sixA 2 = 13 ∧ sixB 2 = 15 ∧ sixA 3 = 25 ∧ sixB 3 = 27 := by decide
+
+/-- Source: "ratio between1-13epsilon and1+28epsilon, hence safely between
+1-32epsilon and1+32epsilon". The analytic `log`/`exp` estimates are not
+formalised; the ordering of the constants is. -/
+theorem ratio_constant_ordering : 13 ≤ 32 ∧ 28 ≤ 32 := by decide
+
+/-- Source: "|c_d,24/c_d,ref -1| < 10^(-106)" together with `ε = 10^(-108)`
+and the factor 32 from section 4: `32 · 10^(-108) < 10^(-106)`. -/
+theorem density_comparison_below_reported : 32 * 10 ^ 106 < 10 ^ 108 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exponent_bound_d3.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exponent_bound_d3.log
new file mode 100644
index 000000000..4dc63ed37
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exponent_bound_d3.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/false_exponent_bound_d3.lean:126:2: error: Tactic `decide` proved that the proposition
+ ∀ (d : Nat), d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 77
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_trace_variance.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_trace_variance.lean
new file mode 100644
index 000000000..1f9120725
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_trace_variance.lean
@@ -0,0 +1,85 @@
+/-!
+# SIDE24 coefficient note — reference covariance and cone moments, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+section 1.
+
+Core Lean has no rational-number type, so every rational identity is stated
+as the equivalent cross-multiplied integer identity, with the rational form in
+the docstring. The kernel checks the integers; a reviewer checks that the
+integer statement is the stated rational statement (the alignment review lane).
+
+Not formalised here: the Gaussian conditioning that produces the covariance
+formula `Cov(A_ij,A_kl | V=0) = (2/3)δ_ijδ_kl + δ_ikδ_jl + δ_ilδ_jk`, the
+elementary integral `∫_0^a (a-z)^2 e^{-z/2} dz/2 = a^2-4a+8-8e^{-a/2}`, the
+Gaussian moment identities `E s^4 = 3 (Var s)^2` and
+`E exp(-s^2/2) = (1+Var s)^{-1/2}`, and the Rayleigh cone integration. Only the
+arithmetic that combines those inputs is kernel-checked.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Source: "Var(t)=15, Cov(t,G)=(-3,0,...,0)" and "tau^2=Var(t|G=0)=6":
+the Gaussian conditional variance `15 - (-3)^2 / Var(G_1)` with `Var(G_1) = 1`. -/
+theorem conditional_third_derivative_variance : (15 : Int) - (-3) * (-3) / 1 = 6 := by
+ decide
+
+/-- Source: "Cov(A_ij,A_kl | V=0) = (2/3)delta_ij delta_kl + delta_ik delta_jl
++ delta_il delta_jk". With `i=j=k=l` the three deltas give `2/3 + 1 + 1 = 8/3`
+(source: "For m=1 the variance of A is8/3"); for `A_12` only `δ_ik δ_jl` survives
+(variance `1`); for the pair `A_11, A_22` only `(2/3)δ_ij δ_kl` survives
+(covariance `2/3`). All in thirds. -/
+theorem transverse_covariance_entries_thirds :
+ 2 + 3 + 3 = 8 ∧ 0 + 3 + 0 = 3 ∧ 2 + 0 + 0 = 2 := by decide
+
+/-- Source: "D_1=E[A^2 1{A<0}]=4/3" — half of the variance `8/3` by centred
+symmetry. In thirds: `8 = 2 · 4`. -/
+theorem cone_moment_m1_thirds : 8 = 2 * 4 := by decide
+
+/-- Source: "For m=2 write A=[[s+x,y],[y,s-x]]. Then s,x,y are independent,
+Var(s)=5/3 and Var(x)=Var(y)=1." With `s = (A_11+A_22)/2`, `x = (A_11-A_22)/2`:
+`Var s = (8/3 + 8/3 + 2·2/3)/4 = 20/12 = 5/3`,
+`Var x = (8/3 + 8/3 - 2·2/3)/4 = 12/12 = 1`,
+`Cov(s,x) = (Var A_11 - Var A_22)/4 = 0`, `Var y = Var A_12 = 1`.
+Stated in thirds over the common denominator 12. This is the "shared trace
+variance5/3" that the note lists first among the items for nonauthor review. -/
+theorem trace_and_traceless_variances :
+ 8 + 8 + 2 * 2 = 20 ∧ 20 * 3 = 6 * 12 ∧
+ 8 + 8 - 2 * 2 = 12 ∧ 12 = 1 * 12 ∧
+ (8 : Int) - 8 = 0 := by decide
+
+/-- Source: "E s^2=5/3, E s^4=25/3": for a centred Gaussian `E s^4 = 3 (E s^2)^2`,
+so `E s^4 = 3 · (5/3)^2 = 75/9 = 25/3`. Cross-multiplied: `3 · 5^2 · 3 = 25 · 9`. -/
+theorem fourth_moment_of_trace : 3 * 5 ^ 2 * 3 = 25 * 9 := by decide
+
+/-- Source: "E exp(-s^2/2)=sqrt(3/8)": `E exp(-s^2/2) = (1 + Var s)^{-1/2}` with
+`1 + 5/3 = 8/3`. In thirds: `3 + 5 = 8`. -/
+theorem exponential_moment_of_trace : 3 + 5 = 8 := by decide
+
+/-- Source: "D_2 = (1/2)[25/3-20/3+8-8sqrt(3/8)] = 29/6-sqrt(6)".
+The bracket is the polynomial `a^2 - 4a + 8 - 8e^{-a/2}` averaged at
+`a = s^2`, so `4 · E s^2 = 4 · 5/3 = 20/3`.
+Rational part: `(25/3 - 20/3 + 8)/2 = (29/3)/2 = 29/6`; in thirds
+`25 - 20 + 24 = 29`. Irrational part: `(1/2)·8·√(3/8) = 4√(3/8) = √(16·3/8) = √6`;
+cross-multiplied `4^2 · 3 = 6 · 8`. -/
+theorem cone_moment_m2_algebra :
+ 4 * 5 = 20 ∧ 25 - 20 + 24 = 29 ∧ 4 ^ 2 * 3 = 6 * 8 := by decide
+
+/-- Source: "simplifying 6^(2/3)/24^(1/3)=(3/2)^(1/3)". Cubing both sides:
+`6^2 / 24 = 3/2`, i.e. `6^2 · 2 = 3 · 24`. -/
+theorem cube_root_simplification : 6 ^ 2 * 2 = 3 * 24 := by decide
+
+/-- Source: "p_G(0) p_V(0) = (2pi)^(-d) / sqrt(3)": `det diag(3,1,...,1) = 3`, and
+"Its dimension is at most10": the joint vector `(G, t, svec H)` has
+`d + 1 + d(d+1)/2` coordinates, `6` for `d = 2` and `10` for `d = 3`. -/
+theorem pin_determinant_and_joint_dimension :
+ 3 * 1 * 1 = 3 ∧ 2 + 1 + 2 * 3 / 2 = 6 ∧ 3 + 1 + 3 * 4 / 2 = 10 := by decide
+
+/-- Source: "The reference Hessian block has eigenvalues d+2 on trace and2 on
+traceless matrices": for `d = 2,3` these are `4, 5` and `2`; each exceeds `1/3`
+(`1 < 3·2`), consistent with the later `C_ref >= I/3`. -/
+theorem hessian_block_eigenvalues : 2 + 2 = 4 ∧ 3 + 2 = 5 ∧ 1 < 3 * 2 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_trace_variance.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_trace_variance.log
new file mode 100644
index 000000000..70942504b
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_trace_variance.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/false_trace_variance.lean:51:28: error: Tactic `decide` proved that the proposition
+ 8 + 8 + 2 * 2 = 20 ∧ 20 * 3 = 6 * 12 ∧ 8 + 8 - 2 * 2 = 12 ∧ 12 = 1 * 12 ∧ 8 - 8 = 0
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/leanchecker.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/leanchecker.log
new file mode 100644
index 000000000..e69de29bb
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/native.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/native.lean
new file mode 100644
index 000000000..4ed222057
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/native.lean
@@ -0,0 +1,3 @@
+import UniversalLaw
+theorem injected : (2 : Nat) + 2 = 4 := by native_decide
+#print axioms injected
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/native.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/native.log
new file mode 100644
index 000000000..a494e022b
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/native.log
@@ -0,0 +1 @@
+'injected' depends on axioms: [injected._native.native_decide.ax_1_1]
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/preflight-version.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/preflight-version.log
new file mode 100644
index 000000000..3bdff924e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/preflight-version.log
@@ -0,0 +1 @@
+Lean (version 4.34.1, x86_64-unknown-linux-gnu, commit 5045d0056413266e57c625dcd7c365b10e377c52, Release)
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json
new file mode 100644
index 000000000..72cf869d0
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json
@@ -0,0 +1,77 @@
+{
+ "alignment_status": "PENDING_INDEPENDENT_REVIEW",
+ "axioms": {
+ "UniversalLaw.Side24.conditional_third_derivative_variance": [],
+ "UniversalLaw.Side24.cone_moment_m1_thirds": [],
+ "UniversalLaw.Side24.cone_moment_m2_algebra": [],
+ "UniversalLaw.Side24.covariance_relative_bound": [],
+ "UniversalLaw.Side24.cube_root_simplification": [],
+ "UniversalLaw.Side24.d2_endpoints_adjacent": [],
+ "UniversalLaw.Side24.d3_below_d2": [],
+ "UniversalLaw.Side24.d3_endpoints_adjacent": [],
+ "UniversalLaw.Side24.density_comparison_below_reported": [],
+ "UniversalLaw.Side24.endpoints_in_unit_tenth": [],
+ "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten": [],
+ "UniversalLaw.Side24.exponent_bounds": [],
+ "UniversalLaw.Side24.exponent_values": [],
+ "UniversalLaw.Side24.exponential_moment_of_trace": [],
+ "UniversalLaw.Side24.fourth_moment_of_trace": [],
+ "UniversalLaw.Side24.geometric_ratio_constants": [],
+ "UniversalLaw.Side24.hessian_block_eigenvalues": [],
+ "UniversalLaw.Side24.image_constant_value": [],
+ "UniversalLaw.Side24.lattice_shell_constant": [],
+ "UniversalLaw.Side24.odd_block_eigenvalues": [],
+ "UniversalLaw.Side24.odd_block_shifted_minors": [],
+ "UniversalLaw.Side24.pairing_sum_le_six": [],
+ "UniversalLaw.Side24.pairing_sum_six": [],
+ "UniversalLaw.Side24.pairing_terms_six": [],
+ "UniversalLaw.Side24.period_exponent": [],
+ "UniversalLaw.Side24.pin_determinant_and_joint_dimension": [],
+ "UniversalLaw.Side24.ratio_constant_ordering": [],
+ "UniversalLaw.Side24.sixth_moment_double_factorial": [],
+ "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third": [],
+ "UniversalLaw.Side24.trace_and_traceless_variances": [],
+ "UniversalLaw.Side24.transverse_covariance_entries_thirds": []
+ },
+ "checked_commit": "a7f602241f759285190d8deebfefb017a6167ee8",
+ "dependency_revisions": {},
+ "formalization_status": "kernel-checked",
+ "lean_version": "Lean (version 4.34.1, x86_64-unknown-linux-gnu, commit 5045d0056413266e57c625dcd7c365b10e377c52, Release)",
+ "logs": {
+ "axioms.log": "856d934eabb250bffb96085454fc04b3ddd64a47bb92829728f7d5bb7d286d0c",
+ "build.log": "6a7ae1a06694eb7d44106bbd4e578aa965abdae391a1678ac0a14ec7e0b0908e",
+ "custom_imported.log": "6e7f917c7fe2fdc3efe1943dcc327c56acadd0b0ca96507a4327073fdfd2f083",
+ "elaborated-types.log": "10a954ced98371c5cf98eecada196d50c1e6e570af9ea8e07caade4a80b0aab8",
+ "false_covariance_bound.log": "3e9f3d67aa666c88ed8e2b0b126163336cd5982dee6ce21b1118fa200292a4dd",
+ "false_eigenvalue_third.log": "fda3cc4e985c3309e132c150d4ba988a4d4699095ef2f0cab010dc8e2a5094b2",
+ "false_endpoint_adjacency.log": "62af9c46e66215424a5c82c4a1ee83700bbe7ca84906c14400cc4bfdcd5b276a",
+ "false_exp_partial_sum.log": "a82d1d1651352ec73a73ee7ad17a596d225fc808b9a3723dbbdd41f982f5328e",
+ "false_exponent_bound_d3.log": "bccf477ff397333506812af1a4a1475a3716f50a0ac0f3a20de77b421064b78d",
+ "false_trace_variance.log": "685a68785e68c9590b0479754dc6479d4e1be7a9f89b29a40bfed17c24a376bb",
+ "leanchecker.log": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+ "native.log": "8a0b9f79f3265724af58b27461627f9d532535f8a23681361da731c9ea37c101",
+ "preflight-version.log": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680",
+ "sorry.log": "50c0e4557dee071a09d39a848a5eb54324115cd8958a4564f1e845380a64677a",
+ "version.log": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680",
+ "wrong_image_constant.log": "56114d671544669de953160f6688ba962a052a17b8a00e614dc5cdab711744b1"
+ },
+ "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0",
+ "negative_controls": {
+ "custom_imported": "REJECTED_BY_AXIOM_GATE",
+ "false_covariance_bound": "REJECTED_BY_LEAN",
+ "false_eigenvalue_third": "REJECTED_BY_LEAN",
+ "false_endpoint_adjacency": "REJECTED_BY_LEAN",
+ "false_exp_partial_sum": "REJECTED_BY_LEAN",
+ "false_exponent_bound_d3": "REJECTED_BY_LEAN",
+ "false_trace_variance": "REJECTED_BY_LEAN",
+ "native": "REJECTED_BY_AXIOM_GATE",
+ "sorry": "REJECTED_BY_AXIOM_GATE",
+ "wrong_image_constant": "REJECTED_BY_LEAN"
+ },
+ "package": "side24-arithmetic-skeleton",
+ "repository": null,
+ "schema_version": 1,
+ "scientific_effect": "NONE",
+ "scientific_status_authority": false,
+ "workflow_run_id": null
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/sorry.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/sorry.lean
new file mode 100644
index 000000000..29e31c096
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/sorry.lean
@@ -0,0 +1,3 @@
+import UniversalLaw
+theorem injected : False := by sorry
+#print axioms injected
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/sorry.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/sorry.log
new file mode 100644
index 000000000..51b8af9ac
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/sorry.log
@@ -0,0 +1,2 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/sorry.lean:2:8: warning: declaration uses `sorry`
+'injected' depends on axioms: [sorryAx]
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/version.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/version.log
new file mode 100644
index 000000000..3bdff924e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/version.log
@@ -0,0 +1 @@
+Lean (version 4.34.1, x86_64-unknown-linux-gnu, commit 5045d0056413266e57c625dcd7c365b10e377c52, Release)
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/wrong_image_constant.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/wrong_image_constant.lean
new file mode 100644
index 000000000..837abc536
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/wrong_image_constant.lean
@@ -0,0 +1,142 @@
+/-!
+# SIDE24 coefficient note — analytic-image ledger, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+sections 2–4, and the `image_ledger()` function of `coefficient.py`.
+
+What this module establishes: every *exact integer or rational* identity and
+inequality that sections 2–4 of the note rely on is checked by the Lean kernel.
+No `sorry`, no `native_decide`, no axioms (the `--run-lean` receipt records the
+transitive `#print axioms` result for every target).
+
+What this module does **not** establish: the analytic facts the arithmetic is
+attached to — the Gaussian derivative bound `76|x|^6 e^{-|x|^2/2}` for `|x| ≥ 1`,
+the geometric-tail argument, the positive-semidefinite covariance comparison,
+the Schur-complement monotonicity, the Gaussian density comparison, and the
+`log`/`exp` estimates that turn exponents into the factor `32ε`. Those remain
+author-side prose under nonauthor review (Layer 0). Nothing here changes the
+scientific status of the coefficient or of its parent theorem.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Factorial on `Nat`; kept local so that the library has no dependencies. -/
+def fact : Nat → Nat
+ | 0 => 1
+ | n + 1 => (n + 1) * fact n
+
+/-- Product-rule pairing count for `q` unit directional derivatives of
+`exp(-|x|^2/2)`: `∑_{j=0}^{⌊q/2⌋} q! / (2^j j! (q-2j)!)`. Section 2 of the note
+uses its value at `q = 6` and the fact that it dominates the lower orders. -/
+def pairingSum (q : Nat) : Nat :=
+ (List.range (q / 2 + 1)).foldl
+ (fun acc j => acc + fact q / (2 ^ j * fact j * fact (q - 2 * j))) 0
+
+/-- Source: "The coefficient sum for q=6 is 1+15+45+15=76". -/
+theorem pairing_sum_six : pairingSum 6 = 76 := by decide
+
+/-- Source: "and it bounds the smaller orders as well". -/
+theorem pairing_sum_le_six : ∀ q, q ∈ [0, 1, 2, 3, 4, 5, 6] → pairingSum q ≤ 76 := by
+ decide
+
+/-- The individual pairing terms at `q = 6`, as displayed in the note. -/
+theorem pairing_terms_six :
+ fact 6 / (2 ^ 0 * fact 0 * fact 6) = 1 ∧
+ fact 6 / (2 ^ 1 * fact 1 * fact 4) = 15 ∧
+ fact 6 / (2 ^ 2 * fact 2 * fact 2) = 45 ∧
+ fact 6 / (2 ^ 3 * fact 3 * fact 0) = 15 := by
+ decide
+
+/-- Source: "At zero, every such contraction has absolute value at most 15".
+The sixth Gaussian moment / sixth derivative of `exp(-x^2/2)` at zero is the
+double factorial `5!! = 1·3·5`. Only the arithmetic value is checked here. -/
+theorem sixth_moment_double_factorial : 1 * 3 * 5 = 15 := by decide
+
+/-- Source: "there are at most 27j^3 possibilities for d<=3, |n|^6<=27j^6" and
+"<=729 sum_{j>=1} j^9 e^(-288j^2) <=1458 e^(-288)". The two factors of 27 give
+729; the geometric tail with ratio at most 1/2 gives the factor 2. -/
+theorem lattice_shell_constant : 27 * 27 = 729 ∧ 729 * 2 = 1458 := by decide
+
+/-- Source: "successive terms have ratio at most 512e^(-864)". `512 = 2^9` is
+the worst ratio `(j+1)^9 / j^9` at `j = 1`; `864 = 288·3` is the exponent gap
+`288((j+1)^2 - j^2)` at `j = 1`. -/
+theorem geometric_ratio_constants : 2 ^ 9 = 512 ∧ 288 * 3 = 864 := by decide
+
+/-- `24^2 / 2 = 288`: the periodization exponent for lattice period 24. -/
+theorem period_exponent : 24 ^ 2 / 2 = 288 := by decide
+
+/-- The image constant `E · 10^125` of display (2):
+`1458 · (76 · 24^6 + 15)`. -/
+def imageConstant : Nat := 1458 * (76 * 24 ^ 6 + 15)
+
+/-- Source: "E := 1458*(76*24^6+15)*10^(-125) = 21175738586479 *10^(-125)". -/
+theorem image_constant_value : imageConstant = 21175738586479 := by decide
+
+/-- Numerator of the degree-20 Taylor partial sum of `exp(288/125)` after
+clearing the denominator `125^20 · 20!`:
+`∑_{k=0}^{20} 288^k · 125^(20-k) · 20!/k!`. -/
+def expTaylorNumerator : Nat :=
+ (List.range 21).foldl
+ (fun acc k => acc + 288 ^ k * 125 ^ (20 - k) * (fact 20 / fact k)) 0
+
+/-- Source: "The code proves e^(288/125)>10 using the positive rational Taylor
+sum through20". Because every Taylor term of `exp` at a positive argument is
+positive, the partial sum is a lower bound; this theorem checks that the exact
+rational partial sum exceeds 10. The step from the partial sum to `exp` itself
+is analysis and is not formalised here. -/
+theorem exp_taylor_partial_sum_gt_ten :
+ 10 * (125 ^ 20 * fact 20) < expTaylorNumerator := by decide
+
+/-- Source: "Each covariance entry differs from the reference by at most2E ...
+the spectral norm of the difference is at most20E" (dimension at most 10) and
+"C_ref >= I/3 ... epsilon=10^(-108), since60E 1/3 ⇔ 23/3 > √58 ⇔ 23^2 > 58·9`. -/
+theorem smaller_eigenvalue_exceeds_third : 58 * 9 < 23 ^ 2 := by decide
+
+/-- Source (section 4): with `m = d-1`, `n = m(m+1)/2`, `a = m + 2/3 + n/2`,
+`b = d + n/2`. These are `6a` and `6b` as natural numbers. -/
+def sixA (d : Nat) : Nat := 6 * (d - 1) + 4 + 3 * ((d - 1) * d / 2)
+def sixB (d : Nat) : Nat := 6 * d + 3 * ((d - 1) * d / 2)
+
+/-- Source: "For d=2,3, a+2b<14 and2a+b<13". In sixths: `6a + 12b < 84` and
+`12a + 6b < 78`. For `d = 3` the second inequality is `77 < 78`, so this is a
+genuinely tight check. -/
+theorem exponent_bounds :
+ ∀ d, d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 78 := by
+ decide
+
+/-- The exact values behind `exponent_bounds`: `d = 2` gives `a = 13/6`, `b = 5/2`;
+`d = 3` gives `a = 25/6`, `b = 9/2`. -/
+theorem exponent_values :
+ sixA 2 = 13 ∧ sixB 2 = 15 ∧ sixA 3 = 25 ∧ sixB 3 = 27 := by decide
+
+/-- Source: "ratio between1-13epsilon and1+28epsilon, hence safely between
+1-32epsilon and1+32epsilon". The analytic `log`/`exp` estimates are not
+formalised; the ordering of the constants is. -/
+theorem ratio_constant_ordering : 13 ≤ 32 ∧ 28 ≤ 32 := by decide
+
+/-- Source: "|c_d,24/c_d,ref -1| < 10^(-106)" together with `ε = 10^(-108)`
+and the factor 32 from section 4: `32 · 10^(-108) < 10^(-106)`. -/
+theorem density_comparison_below_reported : 32 * 10 ^ 106 < 10 ^ 108 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/wrong_image_constant.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/wrong_image_constant.log
new file mode 100644
index 000000000..e9290ef83
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/wrong_image_constant.log
@@ -0,0 +1,3 @@
+/workspace/universal-law/website-repair-20261028/formal/.lake/formal-evidence/wrong_image_constant.lean:75:68: error: Tactic `decide` proved that the proposition
+ imageConstant = 21175738586479
+is false
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/main-latest-17-source-preservation.json b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/main-latest-17-source-preservation.json
new file mode 100644
index 000000000..a3f17b51e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/main-latest-17-source-preservation.json
@@ -0,0 +1,91 @@
+{
+ "checked_commit": "a7f602241f759285190d8deebfefb017a6167ee8",
+ "files": {
+ "formal/README.md": {
+ "source_sha256": "137e7c7ed44d732042d803eb4a0ee75f9ddc6475950a2bb6226a7711a44be14b",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/lake-manifest.json": {
+ "source_sha256": "562d38ad95598486b2b592e6d072d5d3212735bfeb1cb6d8eb8ec04492522ba2",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/lakefile.toml": {
+ "source_sha256": "58f0fa6864cc03e9bcbef2d8c0404e9f3385a30a6124000454319367906cbe4a",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/REVIEW_LANE.md": {
+ "source_sha256": "54d32104aa012e917ef40b73fa3a40228d023249b339cf30fe4bdb7dcbfed414",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/SCOPE.md": {
+ "source_sha256": "fd06700628b1fbc81c5cfe3786aaa455032375bcb879914f068a66b726802a17",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/UniversalLaw.lean": {
+ "source_sha256": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/manifest.json": {
+ "source_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/GLOSSARY.md": {
+ "source_sha256": "342d4efb374fea31c39e51f8f6bcdbc50d7fb5fea1fd393eda21afff92c62fb8",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/lean-toolchain": {
+ "source_sha256": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/ALIGNMENT.md": {
+ "source_sha256": "059fcf3b501e2a6e73b3c20c6294eb57467ffc9118db696e05c8c3fcd7b2fa75",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/reviews/README.md": {
+ "source_sha256": "333ca71e7c676cee89e5d01cd61999c21bb0584e41d6bdacb18afa410109f95d",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/reviews/TEMPLATE_alignment_review.json": {
+ "source_sha256": "e722e928ca43c16981e063d8eb1c91e9bf8c683241d9dcf156400a419e72feb3",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/sources/side24_v1/ENCLOSURE.json": {
+ "source_sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/sources/side24_v1/PROOF.md": {
+ "source_sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/UniversalLaw/Side24/Ledger.lean": {
+ "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/UniversalLaw/Side24/ConeMoments.lean": {
+ "source_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c",
+ "matches_original": true,
+ "matches_current_git_object": true
+ },
+ "formal/UniversalLaw/Side24/Endpoints.lean": {
+ "source_sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd",
+ "matches_original": true,
+ "matches_current_git_object": true
+ }
+ },
+ "result": "17/17_BYTE_IDENTICAL"
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-full-main-run.exit b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-full-main-run.exit
new file mode 100644
index 000000000..573541ac9
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-full-main-run.exit
@@ -0,0 +1 @@
+0
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-full-main-run.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-full-main-run.log
new file mode 100644
index 000000000..648a231fe
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-full-main-run.log
@@ -0,0 +1,17 @@
+preflight-version: exit 0
+build: exit 0
+leanchecker: exit 0
+axioms: exit 0
+elaborated-types: exit 0
+false_exponent_bound_d3: exit 1
+false_covariance_bound: exit 1
+false_exp_partial_sum: exit 1
+wrong_image_constant: exit 1
+false_eigenvalue_third: exit 1
+false_trace_variance: exit 1
+false_endpoint_adjacency: exit 1
+sorry: exit 0
+custom_imported: exit 0
+native: exit 0
+version: exit 0
+{"constants": 45, "proofs": 31, "receipt": "formal/.lake/cbz-evidence/receipt.json", "status": "PASS_LITERAL_MAIN_ARITHMETIC"}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-reviewer-original-probe-rejection.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-reviewer-original-probe-rejection.log
new file mode 100644
index 000000000..bfb6d4dd9
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-reviewer-original-probe-rejection.log
@@ -0,0 +1,9 @@
+Traceback (most recent call last):
+ File "/workspace/cbz0/review-tools/probe_witness_contract.py", line 16, in
+ result=m.validate_census(audit.stdout,set(m.WITNESSES),{'FakeWitness'})
+ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+ File "/workspace/universal-law/website-repair-20261028/tools/cbz_lean_check.py", line 80, in validate_census
+ require(row['kind'] == 'theorem' and not row['prop_premises'] and
+ File "/workspace/universal-law/website-repair-20261028/tools/cbz_lean_check.py", line 49, in require
+ raise ValueError(message)
+ValueError: witness type contract changed: CBZNonvacuity.dimensions_inhabited
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-tests-green.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-tests-green.log
new file mode 100644
index 000000000..dddfe781b
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-tests-green.log
@@ -0,0 +1,24 @@
+test_all_same_named_true_witnesses_rejected (test_cbz_lean_check.CensusProtocolTests.test_all_same_named_true_witnesses_rejected) ... ok
+test_audit_generator_refuses_missing_or_duplicate_boundary (test_cbz_lean_check.CensusProtocolTests.test_audit_generator_refuses_missing_or_duplicate_boundary) ... ok
+test_audit_generator_refuses_module_injection (test_cbz_lean_check.CensusProtocolTests.test_audit_generator_refuses_module_injection) ... ok
+test_changed_known_finite_premise_rejected (test_cbz_lean_check.CensusProtocolTests.test_changed_known_finite_premise_rejected) ... ok
+test_definition_not_promoted_to_proof (test_cbz_lean_check.CensusProtocolTests.test_definition_not_promoted_to_proof) ... ok
+test_duplicate_declaration_rejected (test_cbz_lean_check.CensusProtocolTests.test_duplicate_declaration_rejected) ... ok
+test_duplicate_json_key_rejected (test_cbz_lean_check.CensusProtocolTests.test_duplicate_json_key_rejected) ... ok
+test_each_weakened_witness_type_rejected (test_cbz_lean_check.CensusProtocolTests.test_each_weakened_witness_type_rejected) ... ok
+test_exact_witness_types_accepted (test_cbz_lean_check.CensusProtocolTests.test_exact_witness_types_accepted) ... ok
+test_false_premise_not_promoted (test_cbz_lean_check.CensusProtocolTests.test_false_premise_not_promoted) ... ok
+test_forged_count_and_missing_module_rejected (test_cbz_lean_check.CensusProtocolTests.test_forged_count_and_missing_module_rejected) ... ok
+test_honest_theorem_accepted (test_cbz_lean_check.CensusProtocolTests.test_honest_theorem_accepted) ... ok
+test_known_finite_premise_retained (test_cbz_lean_check.CensusProtocolTests.test_known_finite_premise_retained) ... ok
+test_missing_end_or_unknown_line_rejected (test_cbz_lean_check.CensusProtocolTests.test_missing_end_or_unknown_line_rejected) ... ok
+test_missing_target_rejected (test_cbz_lean_check.CensusProtocolTests.test_missing_target_rejected) ... ok
+test_partial_membership_witness_rejected (test_cbz_lean_check.CensusProtocolTests.test_partial_membership_witness_rejected) ... ok
+test_project_axiom_declaration_rejected (test_cbz_lean_check.CensusProtocolTests.test_project_axiom_declaration_rejected) ... ok
+test_unused_definition_with_custom_axiom_rejected (test_cbz_lean_check.CensusProtocolTests.test_unused_definition_with_custom_axiom_rejected) ... ok
+test_witness_contract_import_injection_rejected (test_cbz_lean_check.CensusProtocolTests.test_witness_contract_import_injection_rejected) ... ok
+
+----------------------------------------------------------------------
+Ran 19 tests in 0.071s
+
+OK
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-tests-optimized.log b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-tests-optimized.log
new file mode 100644
index 000000000..87a3732aa
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-tests-optimized.log
@@ -0,0 +1,24 @@
+test_all_same_named_true_witnesses_rejected (test_cbz_lean_check.CensusProtocolTests.test_all_same_named_true_witnesses_rejected) ... ok
+test_audit_generator_refuses_missing_or_duplicate_boundary (test_cbz_lean_check.CensusProtocolTests.test_audit_generator_refuses_missing_or_duplicate_boundary) ... ok
+test_audit_generator_refuses_module_injection (test_cbz_lean_check.CensusProtocolTests.test_audit_generator_refuses_module_injection) ... ok
+test_changed_known_finite_premise_rejected (test_cbz_lean_check.CensusProtocolTests.test_changed_known_finite_premise_rejected) ... ok
+test_definition_not_promoted_to_proof (test_cbz_lean_check.CensusProtocolTests.test_definition_not_promoted_to_proof) ... ok
+test_duplicate_declaration_rejected (test_cbz_lean_check.CensusProtocolTests.test_duplicate_declaration_rejected) ... ok
+test_duplicate_json_key_rejected (test_cbz_lean_check.CensusProtocolTests.test_duplicate_json_key_rejected) ... ok
+test_each_weakened_witness_type_rejected (test_cbz_lean_check.CensusProtocolTests.test_each_weakened_witness_type_rejected) ... ok
+test_exact_witness_types_accepted (test_cbz_lean_check.CensusProtocolTests.test_exact_witness_types_accepted) ... ok
+test_false_premise_not_promoted (test_cbz_lean_check.CensusProtocolTests.test_false_premise_not_promoted) ... ok
+test_forged_count_and_missing_module_rejected (test_cbz_lean_check.CensusProtocolTests.test_forged_count_and_missing_module_rejected) ... ok
+test_honest_theorem_accepted (test_cbz_lean_check.CensusProtocolTests.test_honest_theorem_accepted) ... ok
+test_known_finite_premise_retained (test_cbz_lean_check.CensusProtocolTests.test_known_finite_premise_retained) ... ok
+test_missing_end_or_unknown_line_rejected (test_cbz_lean_check.CensusProtocolTests.test_missing_end_or_unknown_line_rejected) ... ok
+test_missing_target_rejected (test_cbz_lean_check.CensusProtocolTests.test_missing_target_rejected) ... ok
+test_partial_membership_witness_rejected (test_cbz_lean_check.CensusProtocolTests.test_partial_membership_witness_rejected) ... ok
+test_project_axiom_declaration_rejected (test_cbz_lean_check.CensusProtocolTests.test_project_axiom_declaration_rejected) ... ok
+test_unused_definition_with_custom_axiom_rejected (test_cbz_lean_check.CensusProtocolTests.test_unused_definition_with_custom_axiom_rejected) ... ok
+test_witness_contract_import_injection_rejected (test_cbz_lean_check.CensusProtocolTests.test_witness_contract_import_injection_rejected) ... ok
+
+----------------------------------------------------------------------
+Ran 19 tests in 0.092s
+
+OK
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/ALIGNMENT.md b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/ALIGNMENT.md
new file mode 100644
index 000000000..8ef2c89d9
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/ALIGNMENT.md
@@ -0,0 +1,41 @@
+# Informal–formal alignment table
+
+Generated from `formal/manifest.json` by `tools/formal_gate_check.py --write-alignment`; do not hand-edit.
+Each row pairs one Lean target with the verbatim informal text it is attached to. The kernel checks the
+declaration; the independent alignment review (see REVIEW_LANE.md) checks that the declaration says what
+the anchor says. Source-level formalization status of every row is `proved`; only a trusted run receipt
+reports `kernel-checked`. Nothing here is a Layer 0 review outcome.
+
+| Lean target | Title | Informal anchor | Source | Does not claim |
+|---|---|---|---|---|
+| `UniversalLaw.Side24.pairing_sum_six` | Product-rule pairing count at q=6 equals 76 | `The coefficient sum for q=6 is 1+15+45+15=76` | side24-proof | the derivative bound 76\|x\|^6 e^(-\|x\|^2/2) itself |
+| `UniversalLaw.Side24.pairing_sum_le_six` | Pairing counts for q<=6 are at most 76 | `it bounds the smaller orders as well` | side24-proof | the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem |
+| `UniversalLaw.Side24.pairing_terms_six` | Individual pairing terms 1, 15, 45, 15 | `1+15+45+15=76` | side24-proof | the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem |
+| `UniversalLaw.Side24.sixth_moment_double_factorial` | Double factorial 5!! = 15 | `At zero, every such contraction has absolute value at most15.` | side24-proof | that Gaussian derivative contractions at zero are bounded by 15 |
+| `UniversalLaw.Side24.lattice_shell_constant` | Shell constants 27·27 = 729 and 729·2 = 1458 | `<=729 sum_{j>=1} j^9 e^(-288j^2) <=1458 e^(-288).` | side24-proof | the lattice-point count or the geometric tail sum |
+| `UniversalLaw.Side24.geometric_ratio_constants` | Ratio constants 2^9 = 512 and 288·3 = 864 | `successive terms have ratio at most512e^(-864)<1/2` | side24-proof | that the ratio is below 1/2 |
+| `UniversalLaw.Side24.period_exponent` | Period-24 exponent 24^2/2 = 288 | `sum_{n!=0} \|n\|^6 e^(-288\|n\|^2)` | side24-proof | the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem |
+| `UniversalLaw.Side24.image_constant_value` | Image constant 1458·(76·24^6+15) = 21175738586478 | `E := 1458*(76*24^6+15)*10^(-125) = 21175738586478 *10^(-125).` | side24-proof | the inequality \|D^q K_24(0)-D^q K_infty(0)\| < E |
+| `UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten` | Degree-20 Taylor partial sum of exp(288/125) exceeds 10 | `The code proves e^(288/125)>10 using the positive rational Taylor sum through20` | side24-proof | that the partial sum is below exp(288/125) (positivity of the omitted terms is analysis) |
+| `UniversalLaw.Side24.covariance_relative_bound` | 60E < 10^(-108) as the integer inequality 60·21175738586478 < 10^17 | `epsilon=10^(-108), since60E= I/3 |
+| `UniversalLaw.Side24.odd_block_eigenvalues` | Odd block trace 16 and determinant 6 = 8^2 - 58 | `[[1,-3],[-3,15]], whose eigenvalues are8 +/- sqrt(58)` | side24-proof | the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem |
+| `UniversalLaw.Side24.odd_block_shifted_minors` | Shifted odd block minors 2/3 and 7/9 (scaled by 3: 2 and 7) | `subtract I/3 and use first principal minor2/3 and determinant7/9` | side24-proof | Sylvester's criterion |
+| `UniversalLaw.Side24.smaller_eigenvalue_exceeds_third` | 8 - sqrt(58) > 1/3 via 23^2 > 58·9 | `Its smaller eigenvalue exceeds 1/3` | side24-proof | monotonicity of the square root |
+| `UniversalLaw.Side24.exponent_bounds` | Exponent inequalities a+2b<14 and 2a+b<13 for d=2,3 (in sixths) | `For d=2,3, a+2b<14 and2a+b<13.` | side24-proof | the log/exp estimates that follow |
+| `UniversalLaw.Side24.exponent_values` | Exact a, b values for d=2,3 | `a=m+2/3+n/2, b=d+n/2.` | side24-proof | the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem |
+| `UniversalLaw.Side24.ratio_constant_ordering` | 13 <= 32 and 28 <= 32 | `ratio between1-13epsilon and 1+28epsilon, hence safely between1-32epsilon and1+32epsilon` | side24-proof | the elementary log/exp bounds |
+| `UniversalLaw.Side24.density_comparison_below_reported` | 32·10^(-108) < 10^(-106) | `\|c_d,24/c_d,ref -1\| < 10^(-106), d=2,3.` | side24-proof | the multiplicative density comparison |
+| `UniversalLaw.Side24.conditional_third_derivative_variance` | Conditional variance tau^2 = 15 - 9 = 6 | `Var(t)=15, Cov(t,G)=(-3,0,...,0)` | side24-proof | the Gaussian conditioning formula or the covariance derivatives |
+| `UniversalLaw.Side24.transverse_covariance_entries_thirds` | Transverse covariance entries 8/3, 1, 2/3 from the delta formula | `Cov(A_ij,A_kl \| V=0) = (2/3)delta_ij delta_kl + delta_ik delta_jl + delta_il delta_jk.` | side24-proof | the delta formula itself |
+| `UniversalLaw.Side24.cone_moment_m1_thirds` | D_1 = 4/3 is half of 8/3 | `D_1=E[A^2 1{A<0}]=4/3.` | side24-proof | centred Gaussian symmetry |
+| `UniversalLaw.Side24.trace_and_traceless_variances` | Var(s) = 5/3, Var(x) = Var(y) = 1, Cov(s,x) = 0 from the 2x2 covariance entries | `Var(s)=5/3 and Var(x)=Var(y)=1.` | side24-proof | independence beyond zero covariance, which is Gaussian |
+| `UniversalLaw.Side24.fourth_moment_of_trace` | E s^4 = 3·(5/3)^2 = 25/3 | `E s^2=5/3, E s^4=25/3` | side24-proof | the Gaussian fourth-moment identity |
+| `UniversalLaw.Side24.exponential_moment_of_trace` | 1 + 5/3 = 8/3 behind E exp(-s^2/2) = sqrt(3/8) | `E exp(-s^2/2)=sqrt(3/8)` | side24-proof | the Gaussian exponential-moment identity |
+| `UniversalLaw.Side24.cone_moment_m2_algebra` | D_2 algebra: rational part 29/6 and 4·sqrt(3/8) = sqrt(6) | `D_2 = (1/2)[25/3-20/3+8-8sqrt(3/8)] = 29/6-sqrt(6).` | side24-proof | the integral identity or the Rayleigh cone integration |
+| `UniversalLaw.Side24.cube_root_simplification` | 6^2·2 = 3·24 behind 6^(2/3)/24^(1/3) = (3/2)^(1/3) | `simplifying 6^(2/3)/24^(1/3)=(3/2)^(1/3)` | side24-proof | the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem |
+| `UniversalLaw.Side24.pin_determinant_and_joint_dimension` | det diag(3,1,..,1) = 3 and joint dimensions 6, 10 | `Its dimension is at most10.` | side24-proof | the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem |
+| `UniversalLaw.Side24.hessian_block_eigenvalues` | Hessian block eigenvalues 4, 5, 2 exceed 1/3 | `The reference Hessian block has eigenvalues d+2 on trace and2 on traceless matrices` | side24-proof | the spectral decomposition |
+| `UniversalLaw.Side24.d2_endpoints_adjacent` | Published d=2 endpoints are adjacent 20-digit decimals | `"2": { "lower": "0.07340691930603427103", "upper": "0.07340691930603427104"` | side24-enclosure | that c_2,24 lies between them |
+| `UniversalLaw.Side24.d3_endpoints_adjacent` | Published d=3 endpoints are adjacent 20-digit decimals | `"3": { "lower": "0.04177593184059834334", "upper": "0.04177593184059834335"` | side24-enclosure | that c_3,24 lies between them |
+| `UniversalLaw.Side24.d3_below_d2` | Published d=3 interval lies below the d=2 interval | `"dimensions": { "2": { "lower": "0.07340691930603427103", "upper": "0.07340691930603427104" }, "3": { "lower": "0.04177593184059834334", "upper": "0.04177593184059834335"` | side24-enclosure | anything about the true coefficients; the ordering d3 upper < d2 lower is a derived artifact-consistency check of the displayed endpoints |
+| `UniversalLaw.Side24.endpoints_in_unit_tenth` | Published endpoints lie in (0, 1/10) | `"dimensions": { "2": { "lower": "0.07340691930603427103", "upper": "0.07340691930603427104" }, "3": { "lower": "0.04177593184059834334", "upper": "0.04177593184059834335"` | side24-enclosure | anything about the true coefficients; the range (0, 1/10) is a derived artifact-consistency check of the displayed endpoints |
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/GLOSSARY.md b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/GLOSSARY.md
new file mode 100644
index 000000000..c5736cd83
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/GLOSSARY.md
@@ -0,0 +1,91 @@
+# Formal glossary — project terms → standard mathematics → Lean
+
+A project term has to be given a formal translation before a statement using
+it can be written in Lean. This table records, descriptively, how the pinned
+sources use each term and which standard object the formaliser would have to
+define or import. These are **proposed correspondences, not adopted
+equivalences**: per the lane's
+[reconnaissance memo](../docs/reconnaissance/2026-09-27-formal-verification.md),
+elder selection needs its own point-process, pairing and conditioning
+definitions, a lifetime asymptotic coefficient is not automatically a
+Hermite-expansion coefficient, and **a missing formal translation is an
+obligation to resolve, not evidence of novelty or ill-definition**. Novelty
+claims are a separate matter for the
+[novelty reconnaissance](../docs/RECON_NOVELTY_20260925.md). Nothing here
+accepts or rejects any result.
+
+The Math- pilot ships its own source-grounded glossary for the GP-FOR-192
+companions; this file covers the SIDE24, RN-counting and P15 vocabulary that
+the pilot does not. Merge rather than duplicate if the two overlap later.
+
+Sources read for these entries: the SIDE24 note
+([`sources/side24_v1/PROOF.md`](sources/side24_v1/PROOF.md)), the D2 remainder
+note (`Math-` `frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md`), the D4
+remote-window proof (`frontiers/remote_window_20260924/PROOF.md`), the D6
+full-price proof (`frontiers/full_price_20260924/PROOF.md`) and
+[STATUS.md](../STATUS.md). Where an entry says "read the source", the standard
+mapping still has to be extracted by whoever formalises that object.
+
+Lean column: `—` means no Lean object yet; `core` means statable in core Lean;
+`Mathlib` means the standard object exists in Mathlib and a Mathlib lane is
+needed to state it.
+
+## Gaussian persistence (D1, D2, D3)
+
+| Project term | Standard object | Lean |
+|---|---|---|
+| **Periodized field**, `K_L`, `K_24` | Centred, variance-one stationary Gaussian random field on the flat torus `X = ℝ^d/(LZ^d)` whose covariance is the normalised theta-function periodisation of the Gaussian kernel `exp(−|z|²/2)`. `SIDE24` is the case `L = 24`. | Mathlib: `MeasureTheory` Gaussian measures, `AddCircle`; the covariance kernel itself is statable in core as a series but not usable |
+| **Reference / CONTACT covariance**, `K_∞` | The unperiodised kernel `exp(−|z|²/2)` used only to define the reference coefficient `c_{d,ref}`; no infinite-volume theorem is claimed | Mathlib: `Real.exp` |
+| **Pins** `M = −ru/2`, `S = ru/2` | Two conditioning points on the axis `u` at separation `r`, with prescribed heights `b`, `b − k r³` and zero gradients | — |
+| **Continuous Gaussian regression** `Q`, `Q_r` | Conditional law of a Gaussian field given finitely many linear observations (conditional Gaussian measure) | Mathlib (partial) |
+| **Endpoint weight** `W`, **FULL normalizer** `Z = E_Q W` | Kac–Rice Jacobian weight `|det H_M| · |det H_S|` times index indicators, and its expectation under the regression law | — |
+| **Candidate** pair, **candidate density** `ν_cand(ℓ)` | Ordered (maximum, index-`(d−1)` saddle) critical-point pair with height gap `ℓ`; its density is the intensity of the corresponding marked critical-point-pair process (first-moment / Kac–Rice density) | — |
+| **Elder** pair, **elder density** `ν_eld(ℓ)` | Critical-point pair actually paired by the elder rule of superlevel-set `H₀` persistent homology (a finite `H₀` bar of length `ℓ`); density = intensity of finite `H₀` persistence pairs | — |
+| **Lifetime** `ℓ` | Persistence (birth minus death height) of an `H₀` bar | core (`ℝ` needs Mathlib) |
+| **Lifetime coefficient** `c = c_{d,L}` | The constant in the leading term `c ℓ^{−1/3}` of the small-lifetime density asymptotics; defined by equation (15.2) of the parent note | — |
+| **Reference coefficient** `c_{d,ref}` | `Γ(7/6)·(3/2)^{1/3}·D_{d−1} / (2√3·π^{d−1}·√π)`, display (1) of the SIDE24 note | Mathlib: `Real.Gamma`, `Real.pi`, `Real.sqrt`, rpow |
+| **Cone moment** `D_m` | `E[det(A)² · 1{A ≺ 0}]` for a specified Gaussian symmetric `m×m` matrix `A`; a moment of the squared determinant over the negative-definite cone. `D_1 = 4/3`, `D_2 = 29/6 − √6` | Arithmetic parts: core (`cone_moment_m1_thirds`, `cone_moment_m2_algebra`); the integrals: Mathlib |
+| **Image ledger**, **omitted periodic image** | Deterministic bound on the difference between derivatives of the periodised and unperiodised kernels at `0`, i.e. on the Poisson-summation image terms `n ≠ 0` | Arithmetic parts: core (`image_constant_value`, `covariance_relative_bound`, `exp_taylor_partial_sum_gt_ten`) |
+| **Outward arithmetic** | Rational interval arithmetic with outward rounding to a fixed grid (`10^-80`), containment unconditional | — (would be Mathlib `Set.Icc` over `ℚ`) |
+| **Matrix cap**, **marked cylinder**, **elder selection** (D1) | Read the parent source (`imports/lifetime_parent_20260925/`) with its reading rule; the D1 chain is ACCEPT — scoped at Layer 0 (reconciled in Math- #126, see `STATUS.md`) and has no agreed standard mapping yet | — |
+| **RN / JETMOD / 24-jet obligations** | Historical downstream proof obligations tracked in `frontiers/downstream_gate_20260925/GRAPH.json`; not a single mathematical object | — |
+
+## RN counting (D4, D5)
+
+| Project term | Standard object | Lean |
+|---|---|---|
+| **Remote critical point** | Critical point `x` with `dist_X(x, 0) ≥ ρ`, i.e. outside a fixed neighbourhood of the two pins | — |
+| **Height window** (between-pin) | The height interval `(b − k r³, b)` between the pinned saddle and maximum | — |
+| **RN count** `N_{r,j}(E)` | Number of critical points of Morse index `j` in a Borel set `E` with height in the window; its expectation is a Kac–Rice integral | — |
+| **Three determinant factors** | The Kac–Rice integrand factors `|det H|` at the two pins and at the counted point, under the regression law | — |
+| **Contact kernel** | The positive mean kernel identified in the D4 proof for the counted point's conditional Hessian; read the source (section on the contact mean kernel) | — |
+| **Fixed-remote** vs **shrinking** `ρ`, `η` | Whether the spatial exclusion radius `ρ` and witness separation `η` are held fixed as `r → 0` or allowed to shrink with `r` | — |
+| **Pin neighbourhood**, **microdisk**, **collar**, **annulus** | Regions at distance `≲ r²`, `≪ r`, between scales, and at fixed scaled radius from the pins respectively (D5 decomposition); read the D5 sources | — |
+| **Witness collision** | Two counted critical points whose mutual separation tends to zero (factorial-moment / second-moment regime) | — |
+
+## P15 combinatorics (D6)
+
+| Project term | Standard object | Lean |
+|---|---|---|
+| **Realized family** | The decreasing (downward-closed) set family `D` on disjoint coordinate blocks `X_i` with `|X_i| = a_i d_i + 1`, `|U ∩ X_i| ≤ a_i`, whose occupied-block support contains no edge of the clutter `H` | Mathlib: `Finset`, downsets; statable |
+| **Clutter** `H` | Finite antichain of subsets (a Sperner family / simple hypergraph) of block indices | Mathlib: `Finset` antichain |
+| **Palette** `K`, `K_H(d)` | Number of colour classes; `K_H(d)` the least `K` admitting classes `P_i` with `|P_i| ≥ d_i` and empty intersection over every `H`-edge | Mathlib: statable |
+| **Capacity / demand** `d_i` | Per-block integer parameter; `d_i ≥ 2` is an essential hypothesis (demand one has an exact counterexample) | core |
+| **Price** `c_v`, **transformed price** `φ(p) = min(1, −log(1−p))` | A weight per coordinate bounded by the hazard transform of its probability | Mathlib: `Real.log` |
+| **Cover cost** `covercost_c(O_K(D))` | Minimum total generator price of a family covering the sets not partitionable into `K` members of `D` | Mathlib: statable |
+| **Global hazard** `−log μ_p(D)` | Negative log of the product-measure probability of `D` | Mathlib: `Real.log`, finite product measure |
+| **Sharp factor** `ρ* = 1/h*`, `h* = 3 − log(3e − 2)` | The constant in Theorem F; published enclosure `0.84547981724898672067 < ρ* < 0.84547981724898672068 < 6/7` | Mathlib: `Real.log`, `Real.exp`; a good `norm_num`/`Real.log` bound target |
+
+## Governance / process terms
+
+| Project term | Meaning here |
+|---|---|
+| **Layer 0** | Existing provenance, scope, review and CI system (hashes, `STATUS.md`, `PROOF_INDEX.md`, source-bound review, public-intake guard) |
+| **Layer 1** | This Lean layer: statements and proofs checked by the Lean kernel and bound to Layer 0 bytes |
+| **Author-side** | Produced by the author (human or model) and not yet checked by a distinct reviewer; applies equally to AI-generated Lean text |
+| **Alignment review** | A distinct reviewer's check that a Lean statement says what the informal statement says at the stated scope; it does not re-prove the theorem (the kernel did) |
+| **Informal anchor** | A verbatim quote from the pinned source bytes that a Lean target is attached to; verified as a substring by the gate |
+| **`proved`** | Manifest-level label: proof text supplied and bound by hash. The strongest label a committed manifest may carry |
+| **`kernel-checked`** | Receipt-level label only: a trusted `--run-lean` execution built the package, `leanchecker` passed, and every target's transitive axioms are within `propext`, `Classical.choice`, `Quot.sound` (here: none). Not a scientific status |
+| **Alignment record** | JSON record validated by `--alignment`: accepted disposition, exact manifest and scope digests, all targets, distinct author/reviewer provider–family–agent, immutable evidence reference. Validation is structural; authenticating that the review happened is a controller's job |
+| **Cross-check lane** | An independent AI prover producing a proof of the same Lean statement; extra evidence, same kernel, still author-side; requires actual availability, pinned identity and recorded execution |
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/README.md b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/README.md
new file mode 100644
index 000000000..274538a40
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/README.md
@@ -0,0 +1,144 @@
+# Formal package: SIDE24 arithmetic skeleton (Lean 4, core only)
+
+Scientific effect: **NONE**. This directory is the second package in the
+repository's formal-verification lane. The lane's contract is the
+[formal-verification guide](../docs/FORMAL_VERIFICATION.md); new work is claimed in
+the relevant current pull request or work discussion under the
+[current workflow](../governance/OP-WORKFLOW-20260930.md).
+Closed [work item #95](https://github.com/d6g8k5htny-coder/main/issues/95) is the
+historical formal-ladder work item; the first package is the
+[Math- pilot](https://github.com/d6g8k5htny-coder/Math-/tree/cc2989c1280f4f227d0c6aa30c8841d6ba01e46e/formal)
+(13 GP-FOR-192 scalar companions, Lean 4 + Mathlib). This package follows the same
+manifest, status, gate and alignment contract and adds nothing to the
+scientific-status vocabulary.
+
+What it covers: the exact integer and rational identities and inequalities that
+sections 1–4 of the [SIDE24 coefficient note](sources/side24_v1/PROOF.md)
+(`Math-@9d7b6802…`, SHA-256 `c06dacc…`) rely on — 31 theorems, stated in core
+Lean as cross-multiplied integer facts and proved by `decide`. What it does not
+cover is listed target by target in [SCOPE.md](SCOPE.md): not the coefficient
+bound `0.07340691930603427103 < c_{2,24} < 0.07340691930603427104`, not the
+definition of the coefficient, not any Gaussian, Kac–Rice, cone-integral,
+Stirling or interval-arithmetic step, not `coefficient.py`. Relative to the
+guide's historical work-offer table this is the **first step only** of the "Numerical
+formalizer" offer; the exact coefficient definition and the proof-producing
+enclosure pipeline are not supplied.
+
+## Layout
+
+| Path | Role |
+|---|---|
+| `lean-toolchain`, `lakefile.toml`, `lake-manifest.json` | Pinned toolchain `leanprover/lean4:v4.34.1`; Lake package `UniversalLaw` with **no** dependencies (`dependency_revisions` is empty and the gate checks the lock agrees) |
+| `UniversalLaw.lean` | Root module; imports exactly the three registered modules |
+| `UniversalLaw/Side24/Ledger.lean` | 17 targets: pairing count, image constant, `60E < 10^-108`, Taylor partial sum of `exp(288/125)`, odd-block minors, section-4 exponent bounds, density-comparison order of magnitude |
+| `UniversalLaw/Side24/ConeMoments.lean` | 10 targets: conditional variances, transverse covariance thirds, `D_1 = 4/3`, `D_2 = 29/6 − √6` algebra, cube-root simplification, Hessian block eigenvalues |
+| `UniversalLaw/Side24/Endpoints.lean` | 4 targets: the published 20-digit endpoints as integers — adjacency, ordering, magnitude. **Not an enclosure of the coefficient.** |
+| `sources/side24_v1/` | Byte copies of the two pinned Layer 0 sources (`PROOF.md`, `ENCLOSURE.json`) |
+| `manifest.json` | Evidence sidecar: package identity, toolchain, allowed axioms, SHA-256 of every bound file, pinned sources, 31 targets with verbatim informal anchors and `does_not_claim`, executable negative controls |
+| `SCOPE.md` | Exact coverage and "not established" per target; the review contract |
+| `ALIGNMENT.md` | Generated from the manifest (`--write-alignment`); never hand-edited |
+| `GLOSSARY.md` | Descriptive mapping of project terms to standard objects and Lean availability |
+| `REVIEW_LANE.md`, `reviews/` | Independent statement-alignment review procedure, JSON record template, validator |
+
+## Status vocabulary (same as the Math- lane)
+
+- `formalization_status` in `manifest.json` is **`proved`**: proof text is
+ supplied and bound by hash. The manifest cannot say `kernel-checked`; the gate
+ refuses a manifest that self-awards execution.
+- **`kernel-checked`** appears only in the receipt written by a trusted
+ `--run-lean` execution (`formal/.lake/formal-evidence/receipt.json`), which
+ records the checked Git commit, Lean version, manifest digest, per-target
+ transitive axioms (all `[]` here), log hashes, and negative-control outcomes.
+ A receipt supplied by a caller is untrusted until matched to the actual
+ workflow run and commit.
+- `alignment_status` is **`PENDING_INDEPENDENT_REVIEW`**. The author is
+ Anthropic / Claude via a Cursor cloud agent (2026-09-27); an alignment record
+ from the same provider, family or agent is refused by the validator. The
+ manifest cannot say `ACCEPTED`.
+- In the ladder of [#95](https://github.com/d6g8k5htny-coder/main/issues/95)
+ (L0 prose … L5 proof-assistant-checked, `verification_level` separate from
+ scientific status) a target with a trusted `kernel-checked` receipt is L5
+ evidence for exactly that target.
+- None of these labels is a Layer 0 ACCEPT/AMEND verdict or moves one.
+
+## Run it
+
+Toolchain (once, ~200 MB, no Mathlib cache needed):
+
+```sh
+curl -sSf https://raw.githubusercontent.com/leanprover/elan/master/elan-init.sh | sh -s -- -y --default-toolchain none
+export PATH="$HOME/.elan/bin:$PATH"
+```
+
+From the repository root:
+
+```sh
+python3 tools/formal_gate_check.py # source-only: hashes, inventory, anchors, no Lean run
+python3 tools/formal_gate_check.py --run-lean # fresh build, leanchecker, axiom audit, controls, receipt
+python3 -B -S -m unittest tests.test_formal_gate -v
+```
+
+The source-only gate prints `SOURCE_IDENTITY_PASS (not a Lean build or
+scientific acceptance): `. `--run-lean` removes `.lake/build`,
+runs `lake build`, `leanchecker` on every module, a transitive `#print axioms`
+audit restricted to `propext` / `Classical.choice` / `Quot.sound`, an
+elaborated-type capture, and the executable negative controls: seven
+tightened-or-wrong statements written into a scratch copy of the Lean text
+(each must be rejected by Lean), plus `sorry`, an indirectly imported custom
+axiom, and `native_decide` (each must be rejected by the axiom gate). It then
+re-runs the source check to confirm the manifest digest did not move, and only
+then writes the receipt. Locally the whole run takes about five seconds.
+
+Maintenance (these write): `--refresh-hashes` after editing any bound file,
+then `--write-alignment` after editing targets, then the gate again.
+
+The gate fails closed on: hash mismatch; an unregistered `.lean` file or any
+unbound file inside `formal/`; a bound file that does not exist; a control or
+scope file missing from the bound set; toolchain or dependency-lock drift;
+`sorry`, `native_decide` or an `axiom` declaration outside comments; a root
+module that imports anything but the registered modules; a target inventory
+that differs from the theorem names actually declared (in module order); a
+pinned source whose local bytes changed or whose repository is not one of the
+project's public repositories; an anchor that is not a verbatim substring; a
+missing `does_not_claim`; a stale `ALIGNMENT.md`; a manifest with duplicate JSON
+keys.
+
+## Why core Lean and not Mathlib here
+
+Everything the arithmetic skeleton needs is `Nat`/`Int` and `decide`, which the
+kernel evaluates with GMP-backed literals in well under a second. That keeps
+this package's CI cost at seconds with no multi-gigabyte cache. The Math- pilot
+already carries the Mathlib dependency (revision
+`d13f23b723b8a846827a245b89c10fc7d3f11612`, same Lean `v4.34.1`); any statement
+here that needs `ℝ`, `Real.Gamma`, `Real.exp`, `Real.pi`, Gaussian measures or
+matrices — the coefficient definition `c_{d,ref}`, the enclosure itself, the
+P15 constant `ρ*` — belongs in that Mathlib lane, not in a second dependency
+tree. See the rollout record for the coordination items.
+
+## Coordination
+
+Find current tasks and coordinate with other contributors on the
+[active coordination board, main #619](https://github.com/d6g8k5htny-coder/main/issues/619); architecture questions go to [main #666](https://github.com/d6g8k5htny-coder/main/issues/666).
+The pickup itself belongs in the relevant current pull request or work discussion.
+
+- [docs/FORMAL_VERIFICATION.md](../docs/FORMAL_VERIFICATION.md) — lane contract
+ and the historical work-offer table, not current assignments.
+- [docs/FORMAL_VERIFICATION_ROLLOUT_20260927.md](../docs/FORMAL_VERIFICATION_ROLLOUT_20260927.md)
+ — what this package adds, how it converged onto the Math- contract, what is
+ asked of other repositories and agents, and this session's capability limits.
+ This dated record preserves the original rollout; its pickup routing is
+ superseded by the current workflow linked below.
+- [Work item #95](https://github.com/d6g8k5htny-coder/main/issues/95) — historical
+ formal-ladder work item. Record actual pickup of alignment review or of the remaining
+ "Numerical formalizer" steps in the relevant current pull request or work
+ discussion under the [current workflow](../governance/OP-WORKFLOW-20260930.md).
+
+## What this package does not do
+
+It does not change `STATUS.md`, `PROOF_INDEX.md`, `LANDING_CLAIMS` or any
+ACCEPT/AMEND outcome. It does not turn a hash match, a green build or a
+kernel-checked lemma into acceptance of the theorem built on it. It does not
+verify `coefficient.py`. It does not make AI-authored Lean text independent;
+the author label stays until a distinct reviewer's record validates. It is not
+a second scientific-status database and adds no status vocabulary beyond the
+lane's.
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/REVIEW_LANE.md b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/REVIEW_LANE.md
new file mode 100644
index 000000000..916b3d89b
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/REVIEW_LANE.md
@@ -0,0 +1,94 @@
+# Independent statement-alignment review (this package)
+
+The Lean kernel checks that a proof establishes its statement. It cannot check
+that the statement is the one the informal text makes. That is an independent
+review task with its own lane, distinct from Layer 0 analytic review and from
+the author-side act of writing the Lean text. The contract is the lane's
+([formal-verification guide](../docs/FORMAL_VERIFICATION.md), "Gate and trust
+boundary") and is restated for this package in
+[SCOPE.md § Review contract](SCOPE.md#review-contract).
+
+## Who may review
+
+Anyone whose provider, family **and** agent all differ from the author's
+(`Anthropic` / `Claude` / Cursor cloud agent, 2026-09-27). The validator refuses
+a record where any of the three coincides, case-insensitively. Same-provider
+reviewers earn zero organizational-independence credit whatever they write;
+this is the repository's existing rule and it applies to Lean text as to prose.
+
+## What the reviewer does
+
+Read the exact current head first; a changed source, scope, toolchain or
+manifest stales any earlier record. Then, for each of the 31 targets in
+`manifest.json`:
+
+1. Locate the `informal_anchor` in the pinned local source copy under
+ `sources/side24_v1/` and read its context.
+2. Read the Lean **statement** (not the proof) and its docstring. Decide
+ whether it is the informal statement at the scope stated in `SCOPE.md`:
+ same constants, same quantifiers, same direction of inequality, same
+ scaling. Most targets are cross-multiplied integer forms of rational
+ identities; check the cross-multiplication.
+3. Read `does_not_claim` and the "Not established" column of `SCOPE.md`.
+ Confirm the Lean statement does not silently claim more than the anchor and
+ that what it omits is named.
+4. Record a per-target verdict: `ALIGNED`, `ALIGNED AT NARROWER SCOPE` (say
+ what is narrower) or `MISALIGNED` (say exactly how). Do not grade the proof
+ (the kernel did) and do not grade the Layer 0 mathematics (different lane).
+
+The reviewer need not run Lean, but should quote the gate output at the
+reviewed commit (`SOURCE_IDENTITY_PASS … ` and, if available,
+the workflow run that produced the receipt).
+
+## What the reviewer records
+
+Two files under `reviews/`, named `_.md` and `.json`:
+
+- **Markdown**: reviewer identity and provider; **source exposure** (whether the
+ Lean proof text or docstrings were read before forming a view of each
+ statement — reading the proof first is the weakest form and must be stated);
+ the reviewed commit, manifest digest and scope digest; one row per target
+ with the verdict.
+- **JSON**: copy [`reviews/TEMPLATE_alignment_review.json`](reviews/TEMPLATE_alignment_review.json)
+ and fill it in. `disposition` is `ACCEPTED` only if **every** target is
+ `ALIGNED` or `ALIGNED AT NARROWER SCOPE` with the narrowing recorded;
+ otherwise leave the record unaccepted — the validator refuses it, which is
+ the intended outcome. `manifest_sha256` is the SHA-256 of
+ `formal/manifest.json` at the reviewed commit; `scope_sha256` is the hash of
+ `formal/SCOPE.md` recorded in the manifest's `files`. `targets` is exactly
+ the 31 manifest target names. `evidence` points to the committed Markdown
+ record by repository, 40-character commit, path and SHA-256.
+
+Validate: `python3 tools/formal_gate_check.py --alignment formal/reviews/.json`.
+The validator checks structure, digests, coverage and lineage independence. It
+does not authenticate that the review happened; a controller has to retrieve
+the referenced evidence at the referenced commit.
+
+A `MISALIGNED` verdict is corrected at the source: fix the Lean statement (new
+hash, new `--run-lean` receipt) or fix the anchor, then re-review.
+
+## What this lane cannot do
+
+- Promote a Layer 0 status. `STATUS.md` and `PROOF_INDEX.md` move only through
+ their own source-bound review.
+- Make an author-side proof independent by relabelling; independence is
+ recorded from the reviewer's actual identity and lineage.
+- Substitute for formalising the analytic content. An aligned arithmetic lemma
+ remains an arithmetic lemma.
+- Flip `alignment_status` in `manifest.json`. That field stays
+ `PENDING_INDEPENDENT_REVIEW`; the accepted record is the evidence, and a
+ controller consumes it.
+
+## Current state
+
+All 31 targets: authored by Anthropic / Claude via a Cursor cloud agent on
+2026-09-27; `proved` at source; `kernel-checked` only in the receipt of a
+trusted run; alignment `PENDING_INDEPENDENT_REVIEW`. No record other than the
+template exists. Record actual pickup in the relevant current pull request or work
+discussion under the [current workflow](../governance/OP-WORKFLOW-20260930.md) so two
+reviewers do not duplicate the work. Find current tasks and coordinate with other
+contributors on the [active coordination board, main #619](https://github.com/d6g8k5htny-coder/main/issues/619); architecture
+questions go to [main #666](https://github.com/d6g8k5htny-coder/main/issues/666).
+Closed
+[work item #95](https://github.com/d6g8k5htny-coder/main/issues/95) remains the
+historical formal-ladder work item.
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/SCOPE.md b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/SCOPE.md
new file mode 100644
index 000000000..dea7de288
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/SCOPE.md
@@ -0,0 +1,65 @@
+# Exact formal scope and alignment review — SIDE24 arithmetic skeleton
+
+Scientific effect: NONE. This package offers 31 exact integer statements that are
+the arithmetic skeleton of the SIDE24 coefficient note, `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`
+(10,272 bytes, SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`),
+and of its published `ENCLOSURE.json` (1,090 bytes, SHA-256
+`72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811`). Both sources
+are preserved byte-identically under `sources/side24_v1/`. Core Lean has no
+rational type, so each rational identity is stated as the equivalent
+cross-multiplied integer identity; the docstring gives the rational form and the
+independent alignment review must check that the two agree.
+
+This package addresses the **first step only** of the "Numerical formalizer" work
+offer in [docs/FORMAL_VERIFICATION.md](../docs/FORMAL_VERIFICATION.md). It does
+**not** supply the exact definition of the SIDE24 coefficient, any real-analytic
+enclosure or remainder step, or a proof-producing enclosure pipeline. Per the
+[reconnaissance memo](../docs/reconnaissance/2026-09-27-formal-verification.md):
+rational arithmetic on two endpoints cannot establish that an analytically
+defined coefficient lies between them, and nothing below claims that it does.
+
+| Targets | Exact coverage | Not established |
+|---|---|---|
+| `pairing_sum_six`, `pairing_sum_le_six`, `pairing_terms_six` | Product-rule pairing counts `∑ q!/(2^j j! (q−2j)!)`: value `1+15+45+15 = 76` at `q = 6`, dominance of `q ≤ 6` | The Gaussian derivative bound `76|x|^6 e^{-|x|^2/2}` on `|x| ≥ 1` |
+| `sixth_moment_double_factorial` | `1·3·5 = 15` | That contractions of `D^6 e^{-|x|^2/2}` at `0` are bounded by 15 |
+| `lattice_shell_constant`, `geometric_ratio_constants`, `period_exponent` | `27·27 = 729`, `729·2 = 1458`, `2^9 = 512`, `288·3 = 864`, `24^2/2 = 288` | Lattice-point counting, the geometric tail sum, the ratio being below `1/2` |
+| `image_constant_value` | `1458·(76·24^6+15) = 21175738586478` | The image inequality `|D^q K_24(0) − D^q K_∞(0)| < E` |
+| `exp_taylor_partial_sum_gt_ten` | Degree-20 Taylor partial sum of `exp(288/125)`, cleared of denominators, exceeds `10` | That the partial sum is below `exp(288/125)` (positivity of omitted terms is analysis) |
+| `covariance_relative_bound` | `2·10·3 = 60` and `60·21175738586478 < 10^17` (i.e. `60E < 10^-108`) | The spectral-norm bound `20E`, `C_ref ≥ I/3`, positive-semidefinite ordering |
+| `odd_block_eigenvalues`, `odd_block_shifted_minors`, `smaller_eigenvalue_exceeds_third` | Trace/determinant of `[[1,−3],[−3,15]]`; minors `2`, `7` of `3M − I`; `58·9 < 23^2` | Sylvester's criterion, spectral decomposition, monotonicity of `√` |
+| `exponent_bounds`, `exponent_values` | For `d ∈ {2,3}`: `6a+12b < 84`, `12a+6b < 78` with `6a = 6(d−1)+4+3n`, `6b = 6d+3n`, `n = (d−1)d/2` | The `log(1±ε)` / `exp` estimates that use these exponents |
+| `ratio_constant_ordering`, `density_comparison_below_reported` | `13 ≤ 32`, `28 ≤ 32`, `32·10^106 < 10^108` | The multiplicative Gaussian density comparison and its integration |
+| `conditional_third_derivative_variance` | `15 − (−3)(−3)/1 = 6` | The Gaussian conditioning formula, covariance differentiation |
+| `transverse_covariance_entries_thirds`, `cone_moment_m1_thirds` | Entries `8/3`, `1`, `2/3` from the displayed delta formula; `D_1 = 4/3` as half of `8/3` | The delta formula itself; centred Gaussian symmetry |
+| `trace_and_traceless_variances`, `fourth_moment_of_trace`, `exponential_moment_of_trace` | `Var s = 5/3`, `Var x = 1`, `Cov(s,x) = 0` from the `2×2` entries; `3·(5/3)^2 = 25/3`; `1 + 5/3 = 8/3` | Gaussian independence from zero covariance, the fourth-moment and exponential-moment identities |
+| `cone_moment_m2_algebra` | `4·5 = 20`; `25 − 20 + 24 = 29`; `4^2·3 = 6·8` behind `D_2 = 29/6 − √6` | The integral `∫_0^a (a−z)^2 e^{-z/2} dz/2`, the Rayleigh cone integration |
+| `cube_root_simplification` | `6^2·2 = 3·24` behind `6^(2/3)/24^(1/3) = (3/2)^(1/3)` | Real cube roots |
+| `pin_determinant_and_joint_dimension`, `hessian_block_eigenvalues` | `det diag(3,1,1) = 3`; joint dimensions `6`, `10`; eigenvalues `4`, `5`, `2` exceed `1/3` | The joint covariance structure, the Hessian block decomposition |
+| `d2_endpoints_adjacent`, `d3_endpoints_adjacent`, `d3_below_d2`, `endpoints_in_unit_tenth` | The published 20-digit endpoints, transcribed as integers in `10^-20` units, are adjacent, ordered, and in `(0, 1/10)` | **That either coefficient lies between its endpoints.** This is a consistency check of the frozen artifact, not an enclosure |
+
+None of these targets is the SIDE24 coefficient enclosure, `Γ(7/6)`, `π`, `exp`
+or `log` bounds, the Stirling remainder, Gaussian conditioning, the cone
+integrals, the parent lifetime theorem, elder selection or Kac–Rice. The Layer 0
+status of D3 in [STATUS.md](../STATUS.md) is unchanged by anything here.
+
+## Review contract
+
+Identical to the Math- lane contract. The manifest is an evidence sidecar, not a
+scientific register. A trusted successful `--run-lean` execution establishes
+kernel evidence only for these 31 target declarations and their displayed
+hypotheses, relative to Lean's kernel, standard foundations and the pinned
+toolchain. Independent review must compare each Lean statement (and each
+cross-multiplication) to this scope note and the informal anchor in
+`manifest.json`. Review author, provider, family and agent must be explicit and
+differ from the author's (`Anthropic` / `Claude` / Cursor cloud agent). Validate
+a record with `python3 tools/formal_gate_check.py --alignment review.json`; the
+validator checks structure, digests, coverage and lineage, and does not
+authenticate that a review happened.
+
+The record contains disposition `ACCEPTED`, `manifest_sha256`, `scope_sha256`
+(the hash of this file as bound in the manifest), exactly the 31 targets,
+author/reviewer objects with provider/family/agent, and evidence
+repository/path/40-character commit/sha256. At publication no independent
+alignment review is claimed. A fresh source, scope, toolchain or manifest digest
+stales the old review.
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw.lean
new file mode 100644
index 000000000..ff12fa0eb
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw.lean
@@ -0,0 +1,13 @@
+import UniversalLaw.Side24.Ledger
+import UniversalLaw.Side24.ConeMoments
+import UniversalLaw.Side24.Endpoints
+
+/-!
+# Universal Law — main-side formal package (SIDE24 arithmetic skeleton)
+
+Root module. `tools/formal_gate_check.py` requires this file to import exactly
+the modules registered in `formal/manifest.json`, derives the target inventory
+from their `theorem` declarations, and in `--run-lean` mode builds the package,
+runs `leanchecker`, audits `#print axioms` for every target (only `propext`,
+`Classical.choice`, `Quot.sound` are allowed) and executes negative controls.
+-/
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/ConeMoments.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/ConeMoments.lean
new file mode 100644
index 000000000..e18e69b08
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/ConeMoments.lean
@@ -0,0 +1,85 @@
+/-!
+# SIDE24 coefficient note — reference covariance and cone moments, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+section 1.
+
+Core Lean has no rational-number type, so every rational identity is stated
+as the equivalent cross-multiplied integer identity, with the rational form in
+the docstring. The kernel checks the integers; a reviewer checks that the
+integer statement is the stated rational statement (the alignment review lane).
+
+Not formalised here: the Gaussian conditioning that produces the covariance
+formula `Cov(A_ij,A_kl | V=0) = (2/3)δ_ijδ_kl + δ_ikδ_jl + δ_ilδ_jk`, the
+elementary integral `∫_0^a (a-z)^2 e^{-z/2} dz/2 = a^2-4a+8-8e^{-a/2}`, the
+Gaussian moment identities `E s^4 = 3 (Var s)^2` and
+`E exp(-s^2/2) = (1+Var s)^{-1/2}`, and the Rayleigh cone integration. Only the
+arithmetic that combines those inputs is kernel-checked.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Source: "Var(t)=15, Cov(t,G)=(-3,0,...,0)" and "tau^2=Var(t|G=0)=6":
+the Gaussian conditional variance `15 - (-3)^2 / Var(G_1)` with `Var(G_1) = 1`. -/
+theorem conditional_third_derivative_variance : (15 : Int) - (-3) * (-3) / 1 = 6 := by
+ decide
+
+/-- Source: "Cov(A_ij,A_kl | V=0) = (2/3)delta_ij delta_kl + delta_ik delta_jl
++ delta_il delta_jk". With `i=j=k=l` the three deltas give `2/3 + 1 + 1 = 8/3`
+(source: "For m=1 the variance of A is8/3"); for `A_12` only `δ_ik δ_jl` survives
+(variance `1`); for the pair `A_11, A_22` only `(2/3)δ_ij δ_kl` survives
+(covariance `2/3`). All in thirds. -/
+theorem transverse_covariance_entries_thirds :
+ 2 + 3 + 3 = 8 ∧ 0 + 3 + 0 = 3 ∧ 2 + 0 + 0 = 2 := by decide
+
+/-- Source: "D_1=E[A^2 1{A<0}]=4/3" — half of the variance `8/3` by centred
+symmetry. In thirds: `8 = 2 · 4`. -/
+theorem cone_moment_m1_thirds : 8 = 2 * 4 := by decide
+
+/-- Source: "For m=2 write A=[[s+x,y],[y,s-x]]. Then s,x,y are independent,
+Var(s)=5/3 and Var(x)=Var(y)=1." With `s = (A_11+A_22)/2`, `x = (A_11-A_22)/2`:
+`Var s = (8/3 + 8/3 + 2·2/3)/4 = 20/12 = 5/3`,
+`Var x = (8/3 + 8/3 - 2·2/3)/4 = 12/12 = 1`,
+`Cov(s,x) = (Var A_11 - Var A_22)/4 = 0`, `Var y = Var A_12 = 1`.
+Stated in thirds over the common denominator 12. This is the "shared trace
+variance5/3" that the note lists first among the items for nonauthor review. -/
+theorem trace_and_traceless_variances :
+ 8 + 8 + 2 * 2 = 20 ∧ 20 * 3 = 5 * 12 ∧
+ 8 + 8 - 2 * 2 = 12 ∧ 12 = 1 * 12 ∧
+ (8 : Int) - 8 = 0 := by decide
+
+/-- Source: "E s^2=5/3, E s^4=25/3": for a centred Gaussian `E s^4 = 3 (E s^2)^2`,
+so `E s^4 = 3 · (5/3)^2 = 75/9 = 25/3`. Cross-multiplied: `3 · 5^2 · 3 = 25 · 9`. -/
+theorem fourth_moment_of_trace : 3 * 5 ^ 2 * 3 = 25 * 9 := by decide
+
+/-- Source: "E exp(-s^2/2)=sqrt(3/8)": `E exp(-s^2/2) = (1 + Var s)^{-1/2}` with
+`1 + 5/3 = 8/3`. In thirds: `3 + 5 = 8`. -/
+theorem exponential_moment_of_trace : 3 + 5 = 8 := by decide
+
+/-- Source: "D_2 = (1/2)[25/3-20/3+8-8sqrt(3/8)] = 29/6-sqrt(6)".
+The bracket is the polynomial `a^2 - 4a + 8 - 8e^{-a/2}` averaged at
+`a = s^2`, so `4 · E s^2 = 4 · 5/3 = 20/3`.
+Rational part: `(25/3 - 20/3 + 8)/2 = (29/3)/2 = 29/6`; in thirds
+`25 - 20 + 24 = 29`. Irrational part: `(1/2)·8·√(3/8) = 4√(3/8) = √(16·3/8) = √6`;
+cross-multiplied `4^2 · 3 = 6 · 8`. -/
+theorem cone_moment_m2_algebra :
+ 4 * 5 = 20 ∧ 25 - 20 + 24 = 29 ∧ 4 ^ 2 * 3 = 6 * 8 := by decide
+
+/-- Source: "simplifying 6^(2/3)/24^(1/3)=(3/2)^(1/3)". Cubing both sides:
+`6^2 / 24 = 3/2`, i.e. `6^2 · 2 = 3 · 24`. -/
+theorem cube_root_simplification : 6 ^ 2 * 2 = 3 * 24 := by decide
+
+/-- Source: "p_G(0) p_V(0) = (2pi)^(-d) / sqrt(3)": `det diag(3,1,...,1) = 3`, and
+"Its dimension is at most10": the joint vector `(G, t, svec H)` has
+`d + 1 + d(d+1)/2` coordinates, `6` for `d = 2` and `10` for `d = 3`. -/
+theorem pin_determinant_and_joint_dimension :
+ 3 * 1 * 1 = 3 ∧ 2 + 1 + 2 * 3 / 2 = 6 ∧ 3 + 1 + 3 * 4 / 2 = 10 := by decide
+
+/-- Source: "The reference Hessian block has eigenvalues d+2 on trace and2 on
+traceless matrices": for `d = 2,3` these are `4, 5` and `2`; each exceeds `1/3`
+(`1 < 3·2`), consistent with the later `C_ref >= I/3`. -/
+theorem hessian_block_eigenvalues : 2 + 2 = 4 ∧ 3 + 2 = 5 ∧ 1 < 3 * 2 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/Endpoints.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/Endpoints.lean
new file mode 100644
index 000000000..adccc6c2d
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/Endpoints.lean
@@ -0,0 +1,42 @@
+/-!
+# SIDE24 published endpoints — consistency of the frozen artifact
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/ENCLOSURE.json`,
+1090 bytes, SHA-256 `72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811`.
+
+The published decimal endpoints are transcribed here as integers in units of
+`10^-20`. The kernel checks that each interval is nonempty and exactly one
+`10^-20` step wide, and that the two intervals are disjoint and ordered.
+
+This module does **not** establish that the coefficient lies in either
+interval: that claim needs `Real.Gamma`, `Real.pi`, `Real.exp` and the
+Gaussian cone moments, none of which exist in core Lean. That boundary is
+recorded target by target in `formal/SCOPE.md`; the enclosure itself is not a
+target of this package.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- `0.07340691930603427103` and `0.07340691930603427104` in units of `10^-20`. -/
+def d2Lower : Nat := 7340691930603427103
+def d2Upper : Nat := 7340691930603427104
+
+/-- `0.04177593184059834334` and `0.04177593184059834335` in units of `10^-20`. -/
+def d3Lower : Nat := 4177593184059834334
+def d3Upper : Nat := 4177593184059834335
+
+/-- Source: "0.07340691930603427103 < c_2,24 < 0.07340691930603427104" — the
+published endpoints are distinct and adjacent on the 20-digit grid. -/
+theorem d2_endpoints_adjacent : d2Lower < d2Upper ∧ d2Upper = d2Lower + 1 := by decide
+
+/-- Source: "0.04177593184059834334 < c_3,24 < 0.04177593184059834335". -/
+theorem d3_endpoints_adjacent : d3Lower < d3Upper ∧ d3Upper = d3Lower + 1 := by decide
+
+/-- The published `d = 3` interval lies strictly below the `d = 2` interval. -/
+theorem d3_below_d2 : d3Upper < d2Lower := by decide
+
+/-- Both published intervals lie in `(0, 1/10)`: `10^-20`-units below `10^19`. -/
+theorem endpoints_in_unit_tenth : 0 < d3Lower ∧ d2Upper < 10 ^ 19 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/Ledger.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/Ledger.lean
new file mode 100644
index 000000000..c76f2ea2e
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/Ledger.lean
@@ -0,0 +1,142 @@
+/-!
+# SIDE24 coefficient note — analytic-image ledger, arithmetic skeleton
+
+Informal source (Layer 0, byte-pinned): `Math-` commit
+`9d7b6802424fb4715b31999066aafca8ee2f3cca`, `coefficients/side24_v1/PROOF.md`,
+SHA-256 `c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769`,
+sections 2–4, and the `image_ledger()` function of `coefficient.py`.
+
+What this module establishes: every *exact integer or rational* identity and
+inequality that sections 2–4 of the note rely on is checked by the Lean kernel.
+No `sorry`, no `native_decide`, no axioms (the `--run-lean` receipt records the
+transitive `#print axioms` result for every target).
+
+What this module does **not** establish: the analytic facts the arithmetic is
+attached to — the Gaussian derivative bound `76|x|^6 e^{-|x|^2/2}` for `|x| ≥ 1`,
+the geometric-tail argument, the positive-semidefinite covariance comparison,
+the Schur-complement monotonicity, the Gaussian density comparison, and the
+`log`/`exp` estimates that turn exponents into the factor `32ε`. Those remain
+author-side prose under nonauthor review (Layer 0). Nothing here changes the
+scientific status of the coefficient or of its parent theorem.
+-/
+
+namespace UniversalLaw.Side24
+
+/-- Factorial on `Nat`; kept local so that the library has no dependencies. -/
+def fact : Nat → Nat
+ | 0 => 1
+ | n + 1 => (n + 1) * fact n
+
+/-- Product-rule pairing count for `q` unit directional derivatives of
+`exp(-|x|^2/2)`: `∑_{j=0}^{⌊q/2⌋} q! / (2^j j! (q-2j)!)`. Section 2 of the note
+uses its value at `q = 6` and the fact that it dominates the lower orders. -/
+def pairingSum (q : Nat) : Nat :=
+ (List.range (q / 2 + 1)).foldl
+ (fun acc j => acc + fact q / (2 ^ j * fact j * fact (q - 2 * j))) 0
+
+/-- Source: "The coefficient sum for q=6 is 1+15+45+15=76". -/
+theorem pairing_sum_six : pairingSum 6 = 76 := by decide
+
+/-- Source: "and it bounds the smaller orders as well". -/
+theorem pairing_sum_le_six : ∀ q, q ∈ [0, 1, 2, 3, 4, 5, 6] → pairingSum q ≤ 76 := by
+ decide
+
+/-- The individual pairing terms at `q = 6`, as displayed in the note. -/
+theorem pairing_terms_six :
+ fact 6 / (2 ^ 0 * fact 0 * fact 6) = 1 ∧
+ fact 6 / (2 ^ 1 * fact 1 * fact 4) = 15 ∧
+ fact 6 / (2 ^ 2 * fact 2 * fact 2) = 45 ∧
+ fact 6 / (2 ^ 3 * fact 3 * fact 0) = 15 := by
+ decide
+
+/-- Source: "At zero, every such contraction has absolute value at most 15".
+The sixth Gaussian moment / sixth derivative of `exp(-x^2/2)` at zero is the
+double factorial `5!! = 1·3·5`. Only the arithmetic value is checked here. -/
+theorem sixth_moment_double_factorial : 1 * 3 * 5 = 15 := by decide
+
+/-- Source: "there are at most 27j^3 possibilities for d<=3, |n|^6<=27j^6" and
+"<=729 sum_{j>=1} j^9 e^(-288j^2) <=1458 e^(-288)". The two factors of 27 give
+729; the geometric tail with ratio at most 1/2 gives the factor 2. -/
+theorem lattice_shell_constant : 27 * 27 = 729 ∧ 729 * 2 = 1458 := by decide
+
+/-- Source: "successive terms have ratio at most 512e^(-864)". `512 = 2^9` is
+the worst ratio `(j+1)^9 / j^9` at `j = 1`; `864 = 288·3` is the exponent gap
+`288((j+1)^2 - j^2)` at `j = 1`. -/
+theorem geometric_ratio_constants : 2 ^ 9 = 512 ∧ 288 * 3 = 864 := by decide
+
+/-- `24^2 / 2 = 288`: the periodization exponent for lattice period 24. -/
+theorem period_exponent : 24 ^ 2 / 2 = 288 := by decide
+
+/-- The image constant `E · 10^125` of display (2):
+`1458 · (76 · 24^6 + 15)`. -/
+def imageConstant : Nat := 1458 * (76 * 24 ^ 6 + 15)
+
+/-- Source: "E := 1458*(76*24^6+15)*10^(-125) = 21175738586478 *10^(-125)". -/
+theorem image_constant_value : imageConstant = 21175738586478 := by decide
+
+/-- Numerator of the degree-20 Taylor partial sum of `exp(288/125)` after
+clearing the denominator `125^20 · 20!`:
+`∑_{k=0}^{20} 288^k · 125^(20-k) · 20!/k!`. -/
+def expTaylorNumerator : Nat :=
+ (List.range 21).foldl
+ (fun acc k => acc + 288 ^ k * 125 ^ (20 - k) * (fact 20 / fact k)) 0
+
+/-- Source: "The code proves e^(288/125)>10 using the positive rational Taylor
+sum through20". Because every Taylor term of `exp` at a positive argument is
+positive, the partial sum is a lower bound; this theorem checks that the exact
+rational partial sum exceeds 10. The step from the partial sum to `exp` itself
+is analysis and is not formalised here. -/
+theorem exp_taylor_partial_sum_gt_ten :
+ 10 * (125 ^ 20 * fact 20) < expTaylorNumerator := by decide
+
+/-- Source: "Each covariance entry differs from the reference by at most2E ...
+the spectral norm of the difference is at most20E" (dimension at most 10) and
+"C_ref >= I/3 ... epsilon=10^(-108), since60E 1/3 ⇔ 23/3 > √58 ⇔ 23^2 > 58·9`. -/
+theorem smaller_eigenvalue_exceeds_third : 58 * 9 < 23 ^ 2 := by decide
+
+/-- Source (section 4): with `m = d-1`, `n = m(m+1)/2`, `a = m + 2/3 + n/2`,
+`b = d + n/2`. These are `6a` and `6b` as natural numbers. -/
+def sixA (d : Nat) : Nat := 6 * (d - 1) + 4 + 3 * ((d - 1) * d / 2)
+def sixB (d : Nat) : Nat := 6 * d + 3 * ((d - 1) * d / 2)
+
+/-- Source: "For d=2,3, a+2b<14 and2a+b<13". In sixths: `6a + 12b < 84` and
+`12a + 6b < 78`. For `d = 3` the second inequality is `77 < 78`, so this is a
+genuinely tight check. -/
+theorem exponent_bounds :
+ ∀ d, d ∈ [2, 3] → sixA d + 2 * sixB d < 84 ∧ 2 * sixA d + sixB d < 78 := by
+ decide
+
+/-- The exact values behind `exponent_bounds`: `d = 2` gives `a = 13/6`, `b = 5/2`;
+`d = 3` gives `a = 25/6`, `b = 9/2`. -/
+theorem exponent_values :
+ sixA 2 = 13 ∧ sixB 2 = 15 ∧ sixA 3 = 25 ∧ sixB 3 = 27 := by decide
+
+/-- Source: "ratio between1-13epsilon and1+28epsilon, hence safely between
+1-32epsilon and1+32epsilon". The analytic `log`/`exp` estimates are not
+formalised; the ordering of the constants is. -/
+theorem ratio_constant_ordering : 13 ≤ 32 ∧ 28 ≤ 32 := by decide
+
+/-- Source: "|c_d,24/c_d,ref -1| < 10^(-106)" together with `ε = 10^(-108)`
+and the factor 32 from section 4: `32 · 10^(-108) < 10^(-106)`. -/
+theorem density_comparison_below_reported : 32 * 10 ^ 106 < 10 ^ 108 := by decide
+
+end UniversalLaw.Side24
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lake-manifest.json b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lake-manifest.json
new file mode 100644
index 000000000..fc7655fad
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lake-manifest.json
@@ -0,0 +1,6 @@
+{"version": "1.2.0",
+ "packagesDir": ".lake/packages",
+ "packages": [],
+ "name": "UniversalLaw",
+ "lakeDir": ".lake",
+ "fixedToolchain": false}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lakefile.toml b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lakefile.toml
new file mode 100644
index 000000000..d986aa8d7
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lakefile.toml
@@ -0,0 +1,11 @@
+name = "UniversalLaw"
+defaultTargets = ["UniversalLaw"]
+
+# Layer 1 (formal) pilot. Deliberately dependency-free: every theorem in this
+# library is checked by the Lean 4 kernel from core Lean alone, so `lake build`
+# needs no Mathlib cache, no network after the toolchain download, and finishes
+# in seconds. Adding Mathlib is the documented next step for statements that
+# need real analysis (see README.md, "Expansion path").
+
+[[lean_lib]]
+name = "UniversalLaw"
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lean-toolchain b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lean-toolchain
new file mode 100644
index 000000000..ba8ebf2db
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lean-toolchain
@@ -0,0 +1 @@
+leanprover/lean4:v4.34.1
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/manifest.json b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/manifest.json
new file mode 100644
index 000000000..a22f06a3a
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/manifest.json
@@ -0,0 +1,365 @@
+{
+ "schema_version": 1,
+ "scientific_effect": "NONE",
+ "scientific_status_authority": false,
+ "package": "side24-arithmetic-skeleton",
+ "package_root": "formal",
+ "root_module": "UniversalLaw",
+ "formalization_status": "proved",
+ "alignment_status": "PENDING_INDEPENDENT_REVIEW",
+ "meaning": "Evidence sidecar for the main-side Lean package, following the Math- formal lane contract (docs/FORMAL_VERIFICATION.md; historical formal-ladder work item #95, retained in coordination.work_item as provenance rather than current pickup routing). `proved` here means proof text supplied and bound by hash; `kernel-checked` is reported only by the receipt of a trusted --run-lean execution at an exact commit. Alignment is a separate pending/accepted/stale dimension. Nothing in this file is a scientific register entry or changes any ACCEPT/AMEND disposition.",
+ "coordination": {
+ "guide": "docs/FORMAL_VERIFICATION.md",
+ "work_item": "https://github.com/d6g8k5htny-coder/main/issues/95",
+ "math_pilot": "https://github.com/d6g8k5htny-coder/Math-/tree/cc2989c1280f4f227d0c6aa30c8841d6ba01e46e/formal",
+ "rollout_record": "docs/FORMAL_VERIFICATION_ROLLOUT_20260927.md",
+ "work_offer_addressed": "Numerical formalizer, first step only: the exact arithmetic skeleton of the SIDE24 note. The coefficient definition and the proof-producing enclosure pipeline are NOT supplied."
+ },
+ "author": {
+ "provider": "Anthropic",
+ "family": "Claude",
+ "agent": "Cursor cloud agent, 2026-09-27"
+ },
+ "lean_toolchain": "leanprover/lean4:v4.34.1",
+ "dependency_revisions": {},
+ "allowed_axioms": [
+ "propext",
+ "Classical.choice",
+ "Quot.sound"
+ ],
+ "files": {
+ "formal/lean-toolchain": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b",
+ "formal/lakefile.toml": "58f0fa6864cc03e9bcbef2d8c0404e9f3385a30a6124000454319367906cbe4a",
+ "formal/lake-manifest.json": "562d38ad95598486b2b592e6d072d5d3212735bfeb1cb6d8eb8ec04492522ba2",
+ "formal/UniversalLaw.lean": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e",
+ "formal/UniversalLaw/Side24/Ledger.lean": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7",
+ "formal/UniversalLaw/Side24/ConeMoments.lean": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c",
+ "formal/UniversalLaw/Side24/Endpoints.lean": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd",
+ "formal/sources/side24_v1/PROOF.md": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769",
+ "formal/sources/side24_v1/ENCLOSURE.json": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811",
+ "formal/SCOPE.md": "fd06700628b1fbc81c5cfe3786aaa455032375bcb879914f068a66b726802a17",
+ "formal/GLOSSARY.md": "342d4efb374fea31c39e51f8f6bcdbc50d7fb5fea1fd393eda21afff92c62fb8",
+ "formal/README.md": "137e7c7ed44d732042d803eb4a0ee75f9ddc6475950a2bb6226a7711a44be14b",
+ "formal/REVIEW_LANE.md": "54d32104aa012e917ef40b73fa3a40228d023249b339cf30fe4bdb7dcbfed414",
+ "formal/reviews/TEMPLATE_alignment_review.json": "e722e928ca43c16981e063d8eb1c91e9bf8c683241d9dcf156400a419e72feb3",
+ "formal/reviews/README.md": "333ca71e7c676cee89e5d01cd61999c21bb0584e41d6bdacb18afa410109f95d",
+ "tools/formal_gate_check.py": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5",
+ "tests/test_formal_gate.py": "2b13ad83b03d2b45f4be70ce03af597c195563a1ed0bd3983a2b7040068a3a84"
+ },
+ "unbound_files": [
+ "formal/manifest.json",
+ "formal/ALIGNMENT.md"
+ ],
+ "sources": [
+ {
+ "id": "side24-proof",
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "9d7b6802424fb4715b31999066aafca8ee2f3cca",
+ "path": "coefficients/side24_v1/PROOF.md",
+ "bytes": 10272,
+ "sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769",
+ "local_copy": "formal/sources/side24_v1/PROOF.md"
+ },
+ {
+ "id": "side24-enclosure",
+ "repository": "d6g8k5htny-coder/Math-",
+ "commit": "9d7b6802424fb4715b31999066aafca8ee2f3cca",
+ "path": "coefficients/side24_v1/ENCLOSURE.json",
+ "bytes": 1090,
+ "sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811",
+ "local_copy": "formal/sources/side24_v1/ENCLOSURE.json"
+ }
+ ],
+ "source_modules": [
+ "UniversalLaw/Side24/Ledger.lean",
+ "UniversalLaw/Side24/ConeMoments.lean",
+ "UniversalLaw/Side24/Endpoints.lean"
+ ],
+ "targets": [
+ {
+ "name": "UniversalLaw.Side24.pairing_sum_six",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Product-rule pairing count at q=6 equals 76",
+ "source": "side24-proof",
+ "informal_anchor": "The coefficient sum for q=6 is\n1+15+45+15=76",
+ "does_not_claim": "the derivative bound 76|x|^6 e^(-|x|^2/2) itself"
+ },
+ {
+ "name": "UniversalLaw.Side24.pairing_sum_le_six",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Pairing counts for q<=6 are at most 76",
+ "source": "side24-proof",
+ "informal_anchor": "it bounds the smaller orders as well",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.pairing_terms_six",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Individual pairing terms 1, 15, 45, 15",
+ "source": "side24-proof",
+ "informal_anchor": "1+15+45+15=76",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.sixth_moment_double_factorial",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Double factorial 5!! = 15",
+ "source": "side24-proof",
+ "informal_anchor": "At zero, every such\ncontraction has absolute value at most15.",
+ "does_not_claim": "that Gaussian derivative contractions at zero are bounded by 15"
+ },
+ {
+ "name": "UniversalLaw.Side24.lattice_shell_constant",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Shell constants 27·27 = 729 and 729·2 = 1458",
+ "source": "side24-proof",
+ "informal_anchor": "<=729 sum_{j>=1} j^9 e^(-288j^2)\n <=1458 e^(-288).",
+ "does_not_claim": "the lattice-point count or the geometric tail sum"
+ },
+ {
+ "name": "UniversalLaw.Side24.geometric_ratio_constants",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Ratio constants 2^9 = 512 and 288·3 = 864",
+ "source": "side24-proof",
+ "informal_anchor": "successive terms have ratio at most512e^(-864)<1/2",
+ "does_not_claim": "that the ratio is below 1/2"
+ },
+ {
+ "name": "UniversalLaw.Side24.period_exponent",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Period-24 exponent 24^2/2 = 288",
+ "source": "side24-proof",
+ "informal_anchor": "sum_{n!=0} |n|^6 e^(-288|n|^2)",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.image_constant_value",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Image constant 1458·(76·24^6+15) = 21175738586478",
+ "source": "side24-proof",
+ "informal_anchor": "E := 1458*(76*24^6+15)*10^(-125)\n = 21175738586478 *10^(-125).",
+ "does_not_claim": "the inequality |D^q K_24(0)-D^q K_infty(0)| < E"
+ },
+ {
+ "name": "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Degree-20 Taylor partial sum of exp(288/125) exceeds 10",
+ "source": "side24-proof",
+ "informal_anchor": "The code proves e^(288/125)>10 using the positive rational Taylor sum through20",
+ "does_not_claim": "that the partial sum is below exp(288/125) (positivity of the omitted terms is analysis)"
+ },
+ {
+ "name": "UniversalLaw.Side24.covariance_relative_bound",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "60E < 10^(-108) as the integer inequality 60·21175738586478 < 10^17",
+ "source": "side24-proof",
+ "informal_anchor": "epsilon=10^(-108), since60E= I/3"
+ },
+ {
+ "name": "UniversalLaw.Side24.odd_block_eigenvalues",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Odd block trace 16 and determinant 6 = 8^2 - 58",
+ "source": "side24-proof",
+ "informal_anchor": "[[1,-3],[-3,15]], whose eigenvalues are8 +/- sqrt(58)",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.odd_block_shifted_minors",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Shifted odd block minors 2/3 and 7/9 (scaled by 3: 2 and 7)",
+ "source": "side24-proof",
+ "informal_anchor": "subtract I/3 and use first principal minor2/3 and determinant7/9",
+ "does_not_claim": "Sylvester's criterion"
+ },
+ {
+ "name": "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "8 - sqrt(58) > 1/3 via 23^2 > 58·9",
+ "source": "side24-proof",
+ "informal_anchor": "Its smaller eigenvalue exceeds\n1/3",
+ "does_not_claim": "monotonicity of the square root"
+ },
+ {
+ "name": "UniversalLaw.Side24.exponent_bounds",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Exponent inequalities a+2b<14 and 2a+b<13 for d=2,3 (in sixths)",
+ "source": "side24-proof",
+ "informal_anchor": "For d=2,3, a+2b<14 and2a+b<13.",
+ "does_not_claim": "the log/exp estimates that follow"
+ },
+ {
+ "name": "UniversalLaw.Side24.exponent_values",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "Exact a, b values for d=2,3",
+ "source": "side24-proof",
+ "informal_anchor": "a=m+2/3+n/2, b=d+n/2.",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.ratio_constant_ordering",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "13 <= 32 and 28 <= 32",
+ "source": "side24-proof",
+ "informal_anchor": "ratio between1-13epsilon and\n1+28epsilon, hence safely between1-32epsilon and1+32epsilon",
+ "does_not_claim": "the elementary log/exp bounds"
+ },
+ {
+ "name": "UniversalLaw.Side24.density_comparison_below_reported",
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "title": "32·10^(-108) < 10^(-106)",
+ "source": "side24-proof",
+ "informal_anchor": "|c_d,24/c_d,ref -1| < 10^(-106), d=2,3.",
+ "does_not_claim": "the multiplicative density comparison"
+ },
+ {
+ "name": "UniversalLaw.Side24.conditional_third_derivative_variance",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "Conditional variance tau^2 = 15 - 9 = 6",
+ "source": "side24-proof",
+ "informal_anchor": "Var(t)=15, Cov(t,G)=(-3,0,...,0)",
+ "does_not_claim": "the Gaussian conditioning formula or the covariance derivatives"
+ },
+ {
+ "name": "UniversalLaw.Side24.transverse_covariance_entries_thirds",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "Transverse covariance entries 8/3, 1, 2/3 from the delta formula",
+ "source": "side24-proof",
+ "informal_anchor": "Cov(A_ij,A_kl | V=0)\n = (2/3)delta_ij delta_kl + delta_ik delta_jl + delta_il delta_jk.",
+ "does_not_claim": "the delta formula itself"
+ },
+ {
+ "name": "UniversalLaw.Side24.cone_moment_m1_thirds",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "D_1 = 4/3 is half of 8/3",
+ "source": "side24-proof",
+ "informal_anchor": "D_1=E[A^2 1{A<0}]=4/3.",
+ "does_not_claim": "centred Gaussian symmetry"
+ },
+ {
+ "name": "UniversalLaw.Side24.trace_and_traceless_variances",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "Var(s) = 5/3, Var(x) = Var(y) = 1, Cov(s,x) = 0 from the 2x2 covariance entries",
+ "source": "side24-proof",
+ "informal_anchor": "Var(s)=5/3 and Var(x)=Var(y)=1.",
+ "does_not_claim": "independence beyond zero covariance, which is Gaussian"
+ },
+ {
+ "name": "UniversalLaw.Side24.fourth_moment_of_trace",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "E s^4 = 3·(5/3)^2 = 25/3",
+ "source": "side24-proof",
+ "informal_anchor": "E s^2=5/3, E s^4=25/3",
+ "does_not_claim": "the Gaussian fourth-moment identity"
+ },
+ {
+ "name": "UniversalLaw.Side24.exponential_moment_of_trace",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "1 + 5/3 = 8/3 behind E exp(-s^2/2) = sqrt(3/8)",
+ "source": "side24-proof",
+ "informal_anchor": "E exp(-s^2/2)=sqrt(3/8)",
+ "does_not_claim": "the Gaussian exponential-moment identity"
+ },
+ {
+ "name": "UniversalLaw.Side24.cone_moment_m2_algebra",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "D_2 algebra: rational part 29/6 and 4·sqrt(3/8) = sqrt(6)",
+ "source": "side24-proof",
+ "informal_anchor": "D_2 = (1/2)[25/3-20/3+8-8sqrt(3/8)]\n = 29/6-sqrt(6).",
+ "does_not_claim": "the integral identity or the Rayleigh cone integration"
+ },
+ {
+ "name": "UniversalLaw.Side24.cube_root_simplification",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "6^2·2 = 3·24 behind 6^(2/3)/24^(1/3) = (3/2)^(1/3)",
+ "source": "side24-proof",
+ "informal_anchor": "simplifying 6^(2/3)/24^(1/3)=(3/2)^(1/3)",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.pin_determinant_and_joint_dimension",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "det diag(3,1,..,1) = 3 and joint dimensions 6, 10",
+ "source": "side24-proof",
+ "informal_anchor": "Its dimension is at most10.",
+ "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem"
+ },
+ {
+ "name": "UniversalLaw.Side24.hessian_block_eigenvalues",
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "title": "Hessian block eigenvalues 4, 5, 2 exceed 1/3",
+ "source": "side24-proof",
+ "informal_anchor": "The reference Hessian block has eigenvalues d+2 on trace and2 on traceless matrices",
+ "does_not_claim": "the spectral decomposition"
+ },
+ {
+ "name": "UniversalLaw.Side24.d2_endpoints_adjacent",
+ "module": "UniversalLaw/Side24/Endpoints.lean",
+ "title": "Published d=2 endpoints are adjacent 20-digit decimals",
+ "source": "side24-enclosure",
+ "informal_anchor": "\"2\": {\n \"lower\": \"0.07340691930603427103\",\n \"upper\": \"0.07340691930603427104\"",
+ "does_not_claim": "that c_2,24 lies between them"
+ },
+ {
+ "name": "UniversalLaw.Side24.d3_endpoints_adjacent",
+ "module": "UniversalLaw/Side24/Endpoints.lean",
+ "title": "Published d=3 endpoints are adjacent 20-digit decimals",
+ "source": "side24-enclosure",
+ "informal_anchor": "\"3\": {\n \"lower\": \"0.04177593184059834334\",\n \"upper\": \"0.04177593184059834335\"",
+ "does_not_claim": "that c_3,24 lies between them"
+ },
+ {
+ "name": "UniversalLaw.Side24.d3_below_d2",
+ "module": "UniversalLaw/Side24/Endpoints.lean",
+ "title": "Published d=3 interval lies below the d=2 interval",
+ "source": "side24-enclosure",
+ "informal_anchor": "\"dimensions\": {\n \"2\": {\n \"lower\": \"0.07340691930603427103\",\n \"upper\": \"0.07340691930603427104\"\n },\n \"3\": {\n \"lower\": \"0.04177593184059834334\",\n \"upper\": \"0.04177593184059834335\"",
+ "does_not_claim": "anything about the true coefficients; the ordering d3 upper < d2 lower is a derived artifact-consistency check of the displayed endpoints"
+ },
+ {
+ "name": "UniversalLaw.Side24.endpoints_in_unit_tenth",
+ "module": "UniversalLaw/Side24/Endpoints.lean",
+ "title": "Published endpoints lie in (0, 1/10)",
+ "source": "side24-enclosure",
+ "informal_anchor": "\"dimensions\": {\n \"2\": {\n \"lower\": \"0.07340691930603427103\",\n \"upper\": \"0.07340691930603427104\"\n },\n \"3\": {\n \"lower\": \"0.04177593184059834334\",\n \"upper\": \"0.04177593184059834335\"",
+ "does_not_claim": "anything about the true coefficients; the range (0, 1/10) is a derived artifact-consistency check of the displayed endpoints"
+ }
+ ],
+ "negative_controls": {
+ "false_exponent_bound_d3": {
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "replace": "sixB d < 78",
+ "with": "sixB d < 77"
+ },
+ "false_covariance_bound": {
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "replace": "60 * imageConstant < 10 ^ 17",
+ "with": "60 * imageConstant < 10 ^ 15"
+ },
+ "false_exp_partial_sum": {
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "replace": "10 * (125 ^ 20 * fact 20) < expTaylorNumerator",
+ "with": "11 * (125 ^ 20 * fact 20) < expTaylorNumerator"
+ },
+ "wrong_image_constant": {
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "replace": "= 21175738586478",
+ "with": "= 21175738586479"
+ },
+ "false_eigenvalue_third": {
+ "module": "UniversalLaw/Side24/Ledger.lean",
+ "replace": "58 * 9 < 23 ^ 2",
+ "with": "58 * 9 < 22 ^ 2"
+ },
+ "false_trace_variance": {
+ "module": "UniversalLaw/Side24/ConeMoments.lean",
+ "replace": "20 * 3 = 5 * 12",
+ "with": "20 * 3 = 6 * 12"
+ },
+ "false_endpoint_adjacency": {
+ "module": "UniversalLaw/Side24/Endpoints.lean",
+ "replace": "d2Upper = d2Lower + 1",
+ "with": "d2Upper = d2Lower + 2"
+ }
+ }
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/reviews/README.md b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/reviews/README.md
new file mode 100644
index 000000000..67c3520be
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/reviews/README.md
@@ -0,0 +1,16 @@
+# Alignment review records
+
+One Markdown record plus one JSON record per independent alignment review of
+this package. The Markdown file carries the per-target verdicts and the
+reviewer's exposure statement; the JSON file is the machine-validated record
+described in [SCOPE.md](../SCOPE.md#review-contract) and validated by
+`python3 tools/formal_gate_check.py --alignment .json`.
+
+Template: [`TEMPLATE_alignment_review.json`](TEMPLATE_alignment_review.json).
+Reviewer procedure: [`../REVIEW_LANE.md`](../REVIEW_LANE.md).
+
+No record other than the template exists at publication. The validator refuses
+a record whose author and reviewer share a provider, family or agent, whose
+manifest or scope digest is stale, or whose target list is not exactly the
+manifest's. Passing the validator does not establish that the review happened;
+a controller must retrieve and authenticate the referenced evidence.
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/reviews/TEMPLATE_alignment_review.json b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/reviews/TEMPLATE_alignment_review.json
new file mode 100644
index 000000000..ba5a1b4c2
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/reviews/TEMPLATE_alignment_review.json
@@ -0,0 +1,27 @@
+{
+ "disposition": "ACCEPTED | REJECTED | ACCEPTED_AT_NARROWER_SCOPE (only ACCEPTED validates)",
+ "manifest_sha256": "REPLACE_WITH_SHA256_OF_formal/manifest.json_AT_THE_REVIEWED_COMMIT",
+ "scope_sha256": "REPLACE_WITH_THE_files[formal/SCOPE.md]_VALUE_FROM_THAT_MANIFEST",
+ "targets": [
+ "UniversalLaw.Side24.pairing_sum_six",
+ "... exactly all 31 target names from manifest.json ..."
+ ],
+ "author": {
+ "provider": "Anthropic",
+ "family": "Claude",
+ "agent": "Cursor cloud agent, 2026-09-27"
+ },
+ "reviewer": {
+ "provider": "REPLACE (must differ from author)",
+ "family": "REPLACE (must differ)",
+ "agent": "REPLACE (must differ)"
+ },
+ "evidence": {
+ "repository": "d6g8k5htny-coder/main",
+ "commit": "REPLACE_WITH_40_HEX_COMMIT_CONTAINING_THE_REVIEW_FILE",
+ "path": "formal/reviews/YYYYMMDD_side24_arithmetic_.md",
+ "sha256": "REPLACE_WITH_SHA256_OF_THAT_REVIEW_FILE"
+ },
+ "source_exposure": "statements only | read proofs and docstrings first | ...",
+ "per_target_verdicts_in_review_file": true
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/sources/side24_v1/ENCLOSURE.json b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/sources/side24_v1/ENCLOSURE.json
new file mode 100644
index 000000000..57af39a05
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/sources/side24_v1/ENCLOSURE.json
@@ -0,0 +1,29 @@
+{
+ "cone_moments": {
+ "2": "4/3",
+ "3": "29/6-sqrt(6)"
+ },
+ "dimensions": {
+ "2": {
+ "lower": "0.07340691930603427103",
+ "upper": "0.07340691930603427104"
+ },
+ "3": {
+ "lower": "0.04177593184059834334",
+ "upper": "0.04177593184059834335"
+ }
+ },
+ "image_ledger": {
+ "covariance_relative_bound": "31763607879717/2500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+ "density_comparison_below_reported": true,
+ "derivative_bound": "10587869293239/50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+ "exp_lower_gt_10": true,
+ "image_constant": 21175738586478,
+ "relative_below_eps": true
+ },
+ "method": "outward rational arithmetic; analytic image and Stirling remainder bounds",
+ "object": "SIDE24-COEFFICIENT-D23-20260924-v1",
+ "relative_periodization_bound": "1e-106",
+ "scientific_acceptance": false,
+ "scope": "coefficient of issue63 Eq15.2; parent theorem unreviewed"
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/sources/side24_v1/PROOF.md b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/sources/side24_v1/PROOF.md
new file mode 100644
index 000000000..44b66f04f
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/sources/side24_v1/PROOF.md
@@ -0,0 +1,216 @@
+# SIDE24 coefficient in dimensions two and three
+
+Object: SIDE24-COEFFICIENT-D23-20260924-v1. Author: OpenAI / ChatGPT.
+Disposition: author-side coefficient-evaluation candidate; nonauthor review open.
+
+## Scope and exact parent
+
+This note evaluates the coefficient defined in equation (15.2) of
+UNIFORM-MATRIX-CAP-LIFETIME-20260924-v1, SHA256
+`9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7`,
+Drive ID `1foDgiDi4XIKOfbrZEE8dWKV_BkZU8LIb`, main issue63.
+It does not independently accept that parent's global elder-selection or Kac-Rice
+proof. Interpreting this coefficient as the finite-bar asymptotic constant remains
+conditional on that proof. The parent source is not modified.
+
+Use its centered variance-one field with the exact normalized covariance
+
+ K_24(z) = sum_{n in Z^d} exp(-|z+24n|^2/2)
+ / sum_{n in Z^d} exp(-|24n|^2/2), d in {2,3}.
+
+Let c_d,24 be precisely its equation (15.2), using ordinary sphere area, ordered
+maximum/saddle roles and the full height/gradient pin Jacobian. Then the bounds
+proved below, with endpoints rational decimal numbers, are
+
+ 0.07340691930603427103 < c_2,24 < 0.07340691930603427104,
+ 0.04177593184059834334 < c_3,24 < 0.04177593184059834335.
+
+The uncertainty in these intervals is numerical/arithmetic uncertainty in this
+specified expression, not a probability of correctness of the parent theorem.
+No finite-radius error estimate, unrestricted remainder or RN/24-jet claim follows.
+
+## 1. A nonperiodic reference coefficient with exact cone moments
+
+Use K_infty(z)=exp(-|z|^2/2) only to define a reference CONTACT covariance and its
+coefficient expression. No infinite-volume persistence theorem is asserted.
+In an orthonormal frame with u=e1, covariance differentiation gives
+
+ Cov(G)=I_d,
+ Cov(H_ij,H_kl)=delta_ij delta_kl+delta_ik delta_jl+delta_il delta_jk,
+ Var(t)=15, Cov(t,G)=(-3,0,...,0), t=partial_1^3 f.
+
+Thus V=Hu has covariance diag(3,1,...,1), tau^2=Var(t|G=0)=6, and
+
+ p_G(0) p_V(0) = (2pi)^(-d) / sqrt(3).
+
+Writing m=d-1 and A for the transverse Hessian, Gaussian conditioning on V=0 gives
+
+ Cov(A_ij,A_kl | V=0)
+ = (2/3)delta_ij delta_kl + delta_ik delta_jl + delta_il delta_jk.
+
+Equivalently A=Q+sqrt(2/3) Z I_m, with Q's diagonal variances2, off-diagonal
+variances1, and independent upper-triangular entries, and Z an independent standard
+normal. This explicitly specified reference law is not substituted for the actual
+periodic law without an error bound.
+
+For m=1 the variance of A is8/3. Centered Gaussian symmetry gives
+
+ D_1=E[A^2 1{A<0}]=4/3.
+
+For m=2 write A=[[s+x,y],[y,s-x]]. Then s,x,y are independent,
+Var(s)=5/3 and Var(x)=Var(y)=1. The negative-definite cone is s<-R,
+R=sqrt(x^2+y^2), and det A=s^2-R^2. The variable R^2 has density e^(-z/2)/2.
+For a>=0, elementary integration gives
+
+ integral_0^a (a-z)^2 e^(-z/2) dz/2 = a^2-4a+8-8e^(-a/2).
+
+Using symmetry in s, E s^2=5/3, E s^4=25/3 and
+E exp(-s^2/2)=sqrt(3/8), one obtains
+
+ D_2 = (1/2)[25/3-20/3+8-8sqrt(3/8)]
+ = 29/6-sqrt(6).
+
+The truncation R<|s| is essential: half the UNTRUNCATED determinant-squared moment
+would instead give29/6, an incorrect value. The shared scalar shift of the matrix
+is likewise essential.
+
+Substituting these moments and |S^1|=2pi, |S^2|=4pi into the exact parent coefficient
+and simplifying 6^(2/3)/24^(1/3)=(3/2)^(1/3) gives
+
+ c_d,ref = Gamma(7/6)*(3/2)^(1/3)*D_(d-1)
+ / [2sqrt(3)*pi^(d-1)*sqrt(pi)], d=2,3. (1)
+
+This eliminates BOTH the angular and cone integrals for the reference expression.
+
+## 2. A uniform, deterministic bound for every omitted periodic image
+
+For q<=6 unit directional differentiations of phi(x)=exp(-|x|^2/2), product-rule
+pairings bound the absolute derivative by
+
+ e^(-|x|^2/2) sum_{j=0}^{floor(q/2)}
+ q! |x|^(q-2j) / [2^j j! (q-2j)!].
+
+At |x|>=1 this is at most76 |x|^6 e^(-|x|^2/2). The coefficient sum for q=6 is
+1+15+45+15=76 and it bounds the smaller orders as well. At zero, every such
+contraction has absolute value at most15.
+
+For an integer point with maximum coordinate magnitude j>=1, there are at most
+27j^3 possibilities for d<=3, |n|^6<=27j^6, and |n|^2>=j^2. Consequently
+
+ sum_{n!=0} |n|^6 e^(-288|n|^2)
+ <=729 sum_{j>=1} j^9 e^(-288j^2)
+ <=1458 e^(-288).
+
+The last step follows because successive terms have ratio at most512e^(-864)<1/2.
+The code proves e^(288/125)>10 using the positive rational Taylor sum through20;
+hence e^(-288)<10^(-125) and the geometric-ratio inequality follows too.
+
+Normalizing by S=sum_n exp(-288|n|^2)>=1 costs the subtraction of
+(S-1)D^q phi(0), which is included. Thus for EVERY unit-direction contraction,
+including mixed directions, through total order6,
+
+ |D^q K_24(0)-D^q K_infty(0)|
+ < E := 1458*(76*24^6+15)*10^(-125)
+ = 21175738586478 *10^(-125). (2)
+
+This is a bound on the infinite image sum, not a sampled orientation or truncated
+floating-point comparison. It applies to the exact variance-one normalization.
+
+## 3. Full joint covariance and all orientations
+
+Use the joint vector (G,t,svec H), where svec lists diagonal Hessian entries and
+sqrt(2) times independent off-diagonal entries. Its dimension is at most10.
+Each covariance entry differs from the reference by at most2E, by (2).
+Hence the spectral norm of the difference is at most20E.
+
+The reference Hessian block has eigenvalues d+2 on trace and2 on traceless matrices;
+it is independent of the odd derivative block. The only nontrivial odd block is
+[[1,-3],[-3,15]], whose eigenvalues are8 +/- sqrt(58). Its smaller eigenvalue exceeds
+1/3: subtract I/3 and use first principal minor2/3 and determinant7/9.
+All remaining gradient variances are1. Thus C_ref >= I/3 and
+
+ (1-epsilon) C_ref <= C_24 <= (1+epsilon) C_ref,
+ epsilon=10^(-108), since60E0 its expectation scales by a^m, since h has degree2m and the cone is scale
+invariant. Thus the exact conditional cone moment has the same bounds, multiplied
+by (1-epsilon)^m D0 and (1+epsilon)^m D0 respectively. No continuity claim about
+an indicator at a singular matrix is used.
+
+Combining this with the two d-dimensional densities and tau^(4/3) yields an
+integrand ratio between
+
+ (1-epsilon)^a/(1+epsilon)^b and (1+epsilon)^a/(1-epsilon)^b,
+ a=m+2/3+n/2, b=d+n/2.
+
+For d=2,3, a+2b<14 and2a+b<13. Since epsilon is far below1/28, elementary bounds
+on log(1+epsilon), -log(1-epsilon) and exp give ratio between1-13epsilon and
+1+28epsilon, hence safely between1-32epsilon and1+32epsilon. Angular integration
+preserves these multiplicative bounds because every reference integrand is positive.
+It follows that
+
+ |c_d,24/c_d,ref -1| < 10^(-106), d=2,3. (4)
+
+The exact periodic constant is NOT claimed equal to the reference constant.
+Equation (4) bounds it and justifies the numerical interval in this note.
+
+## 5. Outward arithmetic and special-function remainder
+
+`coefficient.py` uses only integer and Fraction arithmetic to obtain (1)-(4).
+Every interval operation rounds outward to the rational grid10^(-80); negative
+values use mathematical floor/ceiling rather than rounding toward zero. Floats and
+booleans are rejected as inputs. Roots use exact integer root brackets.
+
+Pi uses Machin's identity16atan(1/5)-4atan(1/239) with alternating-series remainder.
+Log uses range reduction and the positive atanh series, with its geometric tail.
+Exp uses reduction to[0,1/4], its positive Taylor series and a ratio-bounded tail;
+negative arguments use reciprocal intervals.
+
+Gamma(7/6) is obtained by shifting to z=199/6, using Stirling's LOG-gamma expansion
+through B20, enclosing the remainder by the positive first omitted B22 term, then
+subtracting the32 recurrence logarithms and exponentiating. The rigorous positive-
+real remainder rule is NIST DLMF5.11(ii), and recurrence is DLMF5.5(i).
+The periodization allowance in (4) is applied to exact rational endpoints BEFORE
+the final outward rounding; it is not silently rounded to zero.
+The displayed endpoints are outward rational decimal bounds, not rounded guesses.
+
+The supplied unit tests and mutation runs are finite implementation/algebra checks.
+They do not constitute formal verification or nonauthor analytic acceptance.
+`ENCLOSURE.json` records the computed bounds and explicit scope.
+
+## Review and remaining work
+
+Nonauthor review should independently check the shared trace variance5/3, Rayleigh
+cone integration, ordered-pair/gamma normalization inherited from the parent,
+all-direction derivative bound, covariance and Schur-complement comparison, and
+rational interval implementation. No frozen proof, review grade, RN/24-jet obligation,
+P15 assertion or project completion flag is changed.
+
+### External reconnaissance, 24 September 2026
+
+Primary sources read: NIST DLMF5.11, especially equation5.11.1 and positive-real
+remainder statement in5.11(ii); DLMF5.5 for the gamma recurrence. These are established
+numerical-analysis inputs. The Gaussian covariance/cone and image comparison above
+are derived here; no priority or novelty claim follows. Main issue63 and its exact
+Drive source provide the project coefficient and conventions.
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tests/test_cbz_lean_check.py b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tests/test_cbz_lean_check.py
new file mode 100644
index 000000000..daf162b1b
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/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/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tools/CBZNonvacuity.lean b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tools/CBZNonvacuity.lean
new file mode 100644
index 000000000..3efd43999
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/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/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tools/cbz_lean_check.py b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tools/cbz_lean_check.py
new file mode 100644
index 000000000..9c8365024
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/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/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tools/formal_gate_check.py b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tools/formal_gate_check.py
new file mode 100644
index 000000000..263d8674c
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tools/formal_gate_check.py
@@ -0,0 +1,403 @@
+#!/usr/bin/env python3
+"""Source-bound Lean evidence gate for the main-side formal package (stdlib only).
+
+Follows the contract of the Math- formal lane (docs/FORMAL_VERIFICATION.md,
+work item #95): a manifest is an evidence sidecar, not a scientific register.
+
+Default (source-only, no Lean run): the manifest is well formed and cannot
+self-award execution or review; every bound file matches its SHA-256; every
+Lean module is registered; no `sorry`, `native_decide` or `axiom` appears
+outside comments; the root module imports exactly the registered modules; the
+target inventory equals the theorem declarations found in those modules; every
+pinned informal source has a local byte copy with the recorded size and hash;
+every target's informal anchor is a verbatim substring of its source.
+
+`--run-lean`: additionally performs a fresh build of the pinned package, runs a
+transitive `#print axioms` audit restricted to propext / Classical.choice /
+Quot.sound, captures elaborated types, executes real negative controls
+(tightened inequalities, a wrong constant, `sorry`, an indirect custom axiom,
+`native_decide`) and writes logs plus a receipt under `.lake/formal-evidence/`.
+Only that receipt carries `kernel-checked`; the committed manifest says
+`proved`. A receipt from arbitrary input is untrusted until matched to the
+actual workflow run and checked Git commit.
+
+`--axioms-output FILE`: audit a captured `#print axioms` output without running
+Lean (for tests and split CI steps).
+
+`--alignment REVIEW.json`: validate an independently authored alignment record
+against the current manifest and scope digests. This checks structure,
+identity, coverage and lineage independence; it does not authenticate that the
+review happened and never promotes scientific status.
+
+Nothing here edits STATUS.md, PROOF_INDEX.md or any review verdict.
+"""
+from __future__ import annotations
+
+import argparse
+import hashlib
+import json
+import os
+from pathlib import Path, PurePosixPath
+import re
+import shutil
+import subprocess
+import sys
+
+ROOT = Path(__file__).resolve().parents[1]
+MANIFEST = "formal/manifest.json"
+ALLOWED = frozenset({"propext", "Classical.choice", "Quot.sound"})
+NAME = r"[A-Za-z_][A-Za-z0-9_.']*"
+AXIOM_LINE = re.compile(r"'(" + NAME + r")' (?:depends on axioms: \[([^\]]*)\]|does not depend on any axioms)")
+HEX40 = re.compile(r"[0-9a-f]{40}")
+HEX64 = re.compile(r"[0-9a-f]{64}")
+PUBLIC_REPOS = {"d6g8k5htny-coder/main", "d6g8k5htny-coder/Math-", "d6g8k5htny-coder/query-",
+ "d6g8k5htny-coder/meta-framework", "d6g8k5htny-coder/Universal-Law-Workspace"}
+THEOREM = re.compile(r"^(?:theorem|lemma)\s+(" + NAME + r")", re.M)
+NAMESPACE = re.compile(r"^namespace\s+(\S+)", re.M)
+TOOLCHAIN = "leanprover/lean4:v4.34.1"
+LEAN_COMMIT = "5045d0056413266e57c625dcd7c365b10e377c52"
+BUILD_DIR = ".lake"
+
+
+def sha(data: bytes) -> str:
+ return hashlib.sha256(data).hexdigest()
+
+
+def require(condition, message):
+ if not condition:
+ raise ValueError(message)
+
+
+def load_json(text: str):
+ def unique(pairs):
+ obj = {}
+ for key, value in pairs:
+ require(key not in obj, "duplicate JSON key: " + key)
+ obj[key] = value
+ return obj
+ return json.loads(text, object_pairs_hook=unique)
+
+
+def safe_path(root: Path, relative) -> Path:
+ require(isinstance(relative, str) and relative and "\\" not in relative, f"invalid path: {relative!r}")
+ pure = PurePosixPath(relative)
+ require(not pure.is_absolute() and ".." not in pure.parts and str(pure) == relative, f"unsafe path: {relative}")
+ path = root
+ for part in pure.parts:
+ path = path / part
+ require(not path.is_symlink(), f"symlink refused: {relative}")
+ require(path.is_file() and path.resolve().is_relative_to(root.resolve()), f"missing or escaping file: {relative}")
+ return path
+
+
+def strip_lean_comments(text: str) -> str:
+ """Remove `--` line comments and nested `/- -/` block comments. Comment text
+ cannot smuggle a proof term; the kernel audit of `sorryAx` is authoritative."""
+ out, i, depth, n = [], 0, 0, len(text)
+ while i < n:
+ two = text[i:i + 2]
+ if depth:
+ if two == "/-":
+ depth, i = depth + 1, i + 2
+ elif two == "-/":
+ depth, i = depth - 1, i + 2
+ else:
+ out.append("\n" if text[i] == "\n" else " ")
+ i += 1
+ elif two == "/-":
+ depth, i = 1, i + 2
+ elif two == "--":
+ end = text.find("\n", i)
+ i = n if end < 0 else end
+ else:
+ out.append(text[i])
+ i += 1
+ return "".join(out)
+
+
+def audit_axioms(text: str, targets: list) -> dict:
+ require(isinstance(targets, list) and targets and len(set(targets)) == len(targets), "empty or duplicate target list")
+ records = {}
+ for match in AXIOM_LINE.finditer(text):
+ name, raw = match.groups()
+ require(name in targets and name not in records, "unexpected or duplicate axiom target: " + name)
+ axioms = [] if raw is None or not raw.strip() else [a.strip() for a in raw.split(",")]
+ require(all(re.fullmatch(NAME, a) for a in axioms), "malformed axiom name")
+ require(set(axioms) <= ALLOWED, "forbidden transitive axiom: " + repr(sorted(set(axioms) - ALLOWED)))
+ records[name] = sorted(set(axioms))
+ require(not AXIOM_LINE.sub("", text).strip(), "unrecognized audit output")
+ require(set(records) == set(targets), "missing target axiom report")
+ return records
+
+
+def source_check(root: Path, manifest_rel: str = MANIFEST) -> tuple[dict, str, Path]:
+ root = root.resolve()
+ raw = safe_path(root, manifest_rel).read_bytes()
+ m = load_json(raw.decode("utf-8"))
+ require(m.get("schema_version") == 1 and m.get("scientific_effect") == "NONE", "invalid evidence schema")
+ require(m.get("scientific_status_authority") is False, "manifest must declare scientific_status_authority false")
+ require(m.get("formalization_status") == "proved" and m.get("alignment_status") == "PENDING_INDEPENDENT_REVIEW",
+ "source metadata cannot self-award execution or review")
+ for key in ("package", "package_root", "root_module", "lean_toolchain"):
+ require(isinstance(m.get(key), str) and m[key].strip(), key + " must be a nonempty string")
+ require(m["lean_toolchain"] == TOOLCHAIN, "unsupported Lean toolchain in manifest")
+ pkg_rel = m["package_root"]
+ pkg = root / pkg_rel
+ require(pkg.is_dir() and not pkg.is_symlink(), "package root missing")
+ files = m.get("files")
+ require(isinstance(files, dict) and files, "empty file manifest")
+ for name, digest in files.items():
+ require(isinstance(digest, str) and HEX64.fullmatch(digest), "invalid source hash: " + name)
+ require(sha(safe_path(root, name).read_bytes()) == digest, "source hash mismatch: " + name)
+ required = {f"{pkg_rel}/lean-toolchain", f"{pkg_rel}/lakefile.toml", f"{pkg_rel}/lake-manifest.json",
+ f"{pkg_rel}/{m['root_module']}.lean", f"{pkg_rel}/SCOPE.md", f"{pkg_rel}/GLOSSARY.md",
+ f"{pkg_rel}/README.md", "tools/formal_gate_check.py", "tests/test_formal_gate.py"}
+ require(required <= set(files), "unbound control or scope file: " + repr(sorted(required - set(files))))
+ require((pkg / "lean-toolchain").read_text(encoding="utf-8").strip() == TOOLCHAIN, "wrong Lean toolchain file")
+ lock = load_json((pkg / "lake-manifest.json").read_text(encoding="utf-8"))
+ packages = lock.get("packages", [])
+ require(isinstance(packages, list), "invalid lake manifest")
+ actual = {p["name"]: p["rev"] for p in packages}
+ require(len(actual) == len(packages), "duplicate dependency")
+ require(actual == m.get("dependency_revisions"), "dependency lock mismatch")
+ require(all(HEX40.fullmatch(v) for v in actual.values()), "unpinned dependency")
+ modules = m.get("source_modules")
+ require(isinstance(modules, list) and modules and len(set(modules)) == len(modules), "invalid source module list")
+ expected_root = "".join("import " + path[:-5].replace("/", ".") + "\n" for path in modules)
+ root_text = strip_lean_comments((pkg / (m["root_module"] + ".lean")).read_text(encoding="utf-8"))
+ require("".join(line + "\n" for line in root_text.splitlines() if line.strip()) == expected_root,
+ "root must only import registered modules")
+ names = []
+ for path in modules:
+ require(f"{pkg_rel}/{path}" in files and path.endswith(".lean"), "unbound source module: " + path)
+ text = strip_lean_comments((pkg / path).read_text(encoding="utf-8"))
+ require(not re.search(r"\bsorry\b", text), "sorry in " + path)
+ require(not re.search(r"\bnative_decide\b", text), "native_decide in " + path)
+ require(not re.search(r"^\s*axiom\b", text, re.M), "custom axiom declaration in " + path)
+ namespaces = NAMESPACE.findall(text)
+ require(len(namespaces) == 1, "each module must open exactly one namespace: " + path)
+ names.extend(namespaces[0] + "." + n for n in THEOREM.findall(text))
+ targets = m.get("targets")
+ require(isinstance(targets, list) and targets, "empty target list")
+ target_names = []
+ sources = {s["id"]: s for s in m.get("sources", [])} if isinstance(m.get("sources"), list) else None
+ require(isinstance(sources, dict) and sources, "sources must be a nonempty list")
+ source_text = {}
+ for s in m["sources"]:
+ require(set(s) == {"id", "repository", "commit", "path", "bytes", "sha256", "local_copy"}, "source rows have a fixed schema")
+ require(s["repository"] in PUBLIC_REPOS, "nonpublic source repository refused: " + str(s["repository"]))
+ require(isinstance(s["commit"], str) and HEX40.fullmatch(s["commit"]), "invalid commit for " + s["id"])
+ require(isinstance(s["sha256"], str) and HEX64.fullmatch(s["sha256"]), "invalid sha256 for " + s["id"])
+ require(type(s["bytes"]) is int and s["bytes"] > 0, "invalid byte count for " + s["id"])
+ payload = safe_path(root, s["local_copy"]).read_bytes()
+ require(len(payload) == s["bytes"] and sha(payload) == s["sha256"], "local copy differs from pinned bytes: " + s["id"])
+ require(s["local_copy"] in files, "pinned source copy not bound in files: " + s["local_copy"])
+ source_text[s["id"]] = payload.decode("utf-8")
+ for t in targets:
+ require(isinstance(t, dict) and set(t) == {"name", "module", "title", "source", "informal_anchor", "does_not_claim"},
+ "target rows have a fixed schema")
+ require(isinstance(t["name"], str) and re.fullmatch(NAME, t["name"]), "invalid target name")
+ require(t["module"] in modules, "target module not registered: " + t["name"])
+ for key in ("title", "does_not_claim"):
+ require(isinstance(t[key], str) and t[key].strip(), f"{t['name']}: {key} must be nonempty")
+ require(t["source"] in source_text, f"{t['name']}: unknown source")
+ require(isinstance(t["informal_anchor"], str) and t["informal_anchor"].strip(), f"{t['name']}: empty informal anchor")
+ require(t["informal_anchor"] in source_text[t["source"]], f"{t['name']}: informal anchor is not a verbatim substring of its source")
+ target_names.append(t["name"])
+ require(target_names == names, "target inventory differs from source declarations")
+ lean_files = {p.relative_to(pkg).as_posix() for p in pkg.rglob("*.lean") if BUILD_DIR not in p.relative_to(pkg).parts}
+ require(lean_files == set(modules) | {m["root_module"] + ".lean"}, "unregistered Lean module: " + repr(sorted(lean_files - set(modules) - {m['root_module'] + '.lean'})))
+ for p in pkg.rglob("*"):
+ rel = p.relative_to(root).as_posix()
+ if p.is_file() and BUILD_DIR not in p.relative_to(pkg).parts and rel not in files:
+ require(rel in set(m.get("unbound_files", [])), "file in package not bound or declared unbound: " + rel)
+ return m, sha(raw), pkg
+
+
+def lake_binary() -> str | None:
+ found = shutil.which("lake")
+ if found:
+ return found
+ candidate = Path.home() / ".elan/bin/lake"
+ return str(candidate) if candidate.is_file() else None
+
+
+def check_lean_version(text: str) -> str:
+ pin = re.fullmatch(r"leanprover/lean4:v(\d+\.\d+\.\d+)", TOOLCHAIN)
+ require(pin is not None, "unsupported pinned Lean toolchain")
+ version = text.strip()
+ record = (r"Lean \(version " + re.escape(pin.group(1))
+ + r", [A-Za-z0-9_.+-]+, commit " + LEAN_COMMIT + r", Release\)")
+ require(re.fullmatch(record, version) is not None,
+ "unexpected running Lean version")
+ return version
+
+
+def run(command, label, out: Path, cwd: Path, env, expect_success=True):
+ result = subprocess.run(command, cwd=cwd, text=True, stdout=subprocess.PIPE, stderr=subprocess.STDOUT, timeout=900, env=env)
+ (out / (label + ".log")).write_text(result.stdout, encoding="utf-8")
+ print(label + ": exit " + str(result.returncode), flush=True)
+ require((result.returncode == 0) == expect_success, "unexpected process outcome: " + label + "\n" + result.stdout[-6000:])
+ return result.stdout
+
+
+def negative_controls(m: dict, pkg: Path) -> dict:
+ """Real mutation controls: each must be rejected by Lean or by the axiom gate."""
+ root_import = "import " + m["root_module"] + "\n"
+ cases = {}
+ for label, spec in m.get("negative_controls", {}).items():
+ module_text = (pkg / spec["module"]).read_text(encoding="utf-8")
+ require(spec["replace"] in module_text, "negative control text not found: " + label)
+ cases[label] = (module_text.replace(spec["replace"], spec["with"]), False, None)
+ cases["sorry"] = (root_import + "theorem injected : False := by sorry\n#print axioms injected\n", True, "injected")
+ cases["custom_imported"] = (root_import + "axiom hiddenPremise : False\ntheorem middle : False := hiddenPremise\n"
+ "theorem injected : False := middle\n#print axioms injected\n", True, "injected")
+ cases["native"] = (root_import + "theorem injected : (2 : Nat) + 2 = 4 := by native_decide\n#print axioms injected\n", True, "injected")
+ return cases
+
+
+def execute(m: dict, digest: str, pkg: Path, root: Path) -> dict:
+ lake = lake_binary()
+ require(lake is not None, "lake not found on PATH or in ~/.elan/bin")
+ env = dict(os.environ, PATH=f"{Path(lake).parent}{os.pathsep}{os.environ.get('PATH', '')}")
+ out = pkg / BUILD_DIR / "formal-evidence"
+ out.mkdir(parents=True, exist_ok=True)
+ require(not (pkg / BUILD_DIR).is_symlink() and not (pkg / BUILD_DIR / "build").is_symlink(), "symlink build directory")
+ check_lean_version(run([lake, "env", "lean", "--version"], "preflight-version", out, pkg, env))
+ if (pkg / BUILD_DIR / "build").exists():
+ shutil.rmtree(pkg / BUILD_DIR / "build")
+ targets = [t["name"] for t in m["targets"]]
+ run([lake, "build"], "build", out, pkg, env)
+ run([lake, "env", "leanchecker", m["root_module"]], "leanchecker", out, pkg, env)
+ audit = out / "Audit.lean"
+ audit.write_text("import " + m["root_module"] + "\n" + "\n".join("#print axioms " + n for n in targets) + "\n", encoding="utf-8")
+ axioms = audit_axioms(run([lake, "env", "lean", str(audit)], "axioms", out, pkg, env), targets)
+ types = out / "Types.lean"
+ types.write_text("import " + m["root_module"] + "\nset_option pp.explicit true\n" + "\n".join("#check " + n for n in targets) + "\n", encoding="utf-8")
+ run([lake, "env", "lean", str(types)], "elaborated-types", out, pkg, env)
+ outcomes = {}
+ for label, (source, succeeds, target) in negative_controls(m, pkg).items():
+ path = out / (label + ".lean")
+ path.write_text(source, encoding="utf-8")
+ log = run([lake, "env", "lean", str(path)], label, out, pkg, env, succeeds)
+ if target:
+ matches = list(AXIOM_LINE.finditer(log))
+ require(matches, "negative control missing axiom report: " + label)
+ try:
+ audit_axioms("\n".join(x.group() for x in matches), [target])
+ except ValueError:
+ outcomes[label] = "REJECTED_BY_AXIOM_GATE"
+ else:
+ raise ValueError("negative control escaped: " + label)
+ else:
+ require("is false" in log or "unsolved goals" in log or "failed" in log, "negative control did not fail on its proof goal: " + label)
+ outcomes[label] = "REJECTED_BY_LEAN"
+ _, after, _ = source_check(root)
+ require(after == digest, "manifest changed during execution")
+ version = check_lean_version(run([lake, "env", "lean", "--version"], "version", out, pkg, env))
+ head = subprocess.run(["git", "rev-parse", "HEAD"], cwd=root, text=True, capture_output=True).stdout.strip()
+ require(HEX40.fullmatch(head or ""), "missing exact checked commit")
+ receipt = dict(schema_version=1, scientific_effect="NONE", scientific_status_authority=False,
+ package=m["package"], formalization_status="kernel-checked",
+ alignment_status="PENDING_INDEPENDENT_REVIEW", manifest_sha256=digest, checked_commit=head,
+ repository=os.environ.get("GITHUB_REPOSITORY"), workflow_run_id=os.environ.get("GITHUB_RUN_ID"),
+ lean_version=version, dependency_revisions=m["dependency_revisions"], axioms=axioms,
+ negative_controls=outcomes)
+ receipt["logs"] = {p.name: sha(p.read_bytes()) for p in sorted(out.glob("*.log"))}
+ (out / "receipt.json").write_text(json.dumps(receipt, indent=2, sort_keys=True) + "\n", encoding="utf-8")
+ return receipt
+
+
+def check_alignment(review: dict, manifest_digest: str, targets: list, scope_digest: str):
+ require(isinstance(review, dict), "review must be object")
+ require(review.get("disposition") == "ACCEPTED", "alignment not accepted")
+ require(review.get("manifest_sha256") == manifest_digest, "stale alignment manifest")
+ require(review.get("scope_sha256") == scope_digest, "stale alignment scope")
+ covered = review.get("targets", [])
+ require(isinstance(covered, list) and len(covered) == len(set(covered)) and set(covered) == set(targets), "partial or ambiguous review")
+ a, r = review.get("author", {}), review.get("reviewer", {})
+ for key in ("provider", "family", "agent"):
+ require(isinstance(a.get(key), str) and a[key].strip() and isinstance(r.get(key), str) and r[key].strip(), "missing review lineage")
+ require(a[key].strip().casefold() != r[key].strip().casefold(), "lineage not independent: " + key)
+ e = review.get("evidence", {})
+ require(isinstance(e.get("repository"), str) and re.fullmatch(r"[^/\s]+/[^/\s]+", e["repository"]), "missing evidence repo")
+ require(isinstance(e.get("commit"), str) and HEX40.fullmatch(e["commit"]), "mutable review ref")
+ require(isinstance(e.get("sha256"), str) and HEX64.fullmatch(e["sha256"]), "missing review hash")
+ require(isinstance(e.get("path"), str) and e["path"] and not PurePosixPath(e["path"]).is_absolute()
+ and ".." not in PurePosixPath(e["path"]).parts, "missing or unsafe review path")
+
+
+def render_alignment(m: dict) -> str:
+ lines = ["# Informal–formal alignment table", "",
+ f"Generated from `{MANIFEST}` by `tools/formal_gate_check.py --write-alignment`; do not hand-edit.",
+ "Each row pairs one Lean target with the verbatim informal text it is attached to. The kernel checks the",
+ "declaration; the independent alignment review (see REVIEW_LANE.md) checks that the declaration says what",
+ "the anchor says. Source-level formalization status of every row is `proved`; only a trusted run receipt",
+ "reports `kernel-checked`. Nothing here is a Layer 0 review outcome.", "",
+ "| Lean target | Title | Informal anchor | Source | Does not claim |", "|---|---|---|---|---|"]
+ for t in m["targets"]:
+ anchor = "`" + " ".join(t["informal_anchor"].split()).replace("`", "'").replace("|", "\\|") + "`"
+ cells = [f"`{t['name']}`", t["title"].replace("|", "\\|"), anchor, t["source"], t["does_not_claim"].replace("|", "\\|")]
+ lines.append("| " + " | ".join(cells) + " |")
+ lines.append("")
+ return "\n".join(lines)
+
+
+def refresh_hashes(root: Path, manifest_rel: str = MANIFEST) -> int:
+ path = safe_path(root, manifest_rel)
+ m = load_json(path.read_text(encoding="utf-8"))
+ changed = 0
+ for name in list(m["files"]):
+ digest = sha(safe_path(root, name).read_bytes())
+ if m["files"][name] != digest:
+ m["files"][name] = digest
+ changed += 1
+ path.write_text(json.dumps(m, indent=2, ensure_ascii=False) + "\n", encoding="utf-8")
+ return changed
+
+
+def main(argv=None) -> int:
+ p = argparse.ArgumentParser(description=__doc__, formatter_class=argparse.RawDescriptionHelpFormatter)
+ p.add_argument("--root", type=Path, default=ROOT)
+ p.add_argument("--manifest", default=MANIFEST)
+ p.add_argument("--run-lean", action="store_true", help="fresh build, leanchecker, axiom audit, negative controls, receipt")
+ p.add_argument("--axioms-output", type=Path, help="audit a captured #print axioms output without running Lean")
+ p.add_argument("--alignment", type=Path, help="validate an independently authored alignment record; never promotes science")
+ p.add_argument("--alignment-table", default="formal/ALIGNMENT.md", help="generated table to compare against the manifest")
+ p.add_argument("--write-alignment", action="store_true", help="regenerate the alignment table and exit")
+ p.add_argument("--refresh-hashes", action="store_true", help="rewrite manifest file hashes from disk and exit")
+ args = p.parse_args(argv)
+ root = args.root.resolve()
+ try:
+ if args.refresh_hashes:
+ print(f"updated {refresh_hashes(root, args.manifest)} file hashes in {args.manifest}")
+ return 0
+ m, digest, pkg = source_check(root, args.manifest)
+ if args.write_alignment:
+ (root / args.alignment_table).write_text(render_alignment(m), encoding="utf-8")
+ print("wrote " + args.alignment_table)
+ return 0
+ require(safe_path(root, args.alignment_table).read_text(encoding="utf-8") == render_alignment(m),
+ "alignment table differs from the manifest rendering; regenerate with --write-alignment")
+ if args.alignment:
+ check_alignment(load_json(args.alignment.read_text(encoding="utf-8")), digest,
+ [t["name"] for t in m["targets"]], m["files"][f"{m['package_root']}/SCOPE.md"])
+ print("ALIGNMENT_RECORD_STRUCTURE_PASS (identity, coverage and lineage only; the review itself must be retrieved and authenticated)")
+ if args.axioms_output:
+ axioms = audit_axioms(args.axioms_output.read_text(encoding="utf-8"), [t["name"] for t in m["targets"]])
+ print(json.dumps({"axiom_audit": axioms, "manifest_sha256": digest}, indent=2, sort_keys=True))
+ if args.run_lean:
+ print(json.dumps(execute(m, digest, pkg, root), indent=2, sort_keys=True))
+ elif not args.axioms_output:
+ print("SOURCE_IDENTITY_PASS (not a Lean build or scientific acceptance): " + digest)
+ print(json.dumps({"package": m["package"], "targets": len(m["targets"]), "sources": len(m["sources"]),
+ "formalization_status": m["formalization_status"], "alignment_status": m["alignment_status"]},
+ sort_keys=True))
+ except (ValueError, KeyError, TypeError, OSError, UnicodeDecodeError, subprocess.SubprocessError) as e:
+ print("FORMAL_GATE_FAIL: " + str(e), file=sys.stderr)
+ return 1
+ return 0
+
+
+if __name__ == "__main__":
+ sys.exit(main())
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/toolchain-runtime-archive-verification.json b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/toolchain-runtime-archive-verification.json
new file mode 100644
index 000000000..d2706e022
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/toolchain-runtime-archive-verification.json
@@ -0,0 +1,31 @@
+{
+ "archive_sha256": "47bf4bbd78f70c2e9670598ab7124d92b6efb7330ff33e5fbb4030f6fd72e4e4",
+ "runtime_files": {
+ "lib/lean/libleanshared.so": {
+ "bytes": 233708536,
+ "sha256": "6b30cc963d065fc9d2f87f7e9cbe0682b23000ae5425bccd769c5d477fa74f13",
+ "archive_match": true
+ },
+ "lib/lean/LeanChecker.olean": {
+ "bytes": 439400,
+ "sha256": "d6829015630328e3c70909a4cba004a7933f6d52cad3721488a2efaa14c1bbbe",
+ "archive_match": true
+ },
+ "bin/lean": {
+ "bytes": 9024,
+ "sha256": "e8baaa71855a616dc351028f3ad2200051b0671f423a1696a100e809302d5550",
+ "archive_match": true
+ },
+ "bin/leanchecker": {
+ "bytes": 51080,
+ "sha256": "ccef1bfe9bfeecea65137d94a69033c1a89f360711f50fa3178e7ba3e696fcbe",
+ "archive_match": true
+ },
+ "bin/lake": {
+ "bytes": 13840,
+ "sha256": "6f53827dab18010d6c690d14c8401cacabc1db958edb3552a877ed4cf1dd995d",
+ "archive_match": true
+ }
+ },
+ "all_match": true
+}
diff --git a/cbz/evidence/website-foundation-20261029/sources/lean-foundation/STATEMENT_ALIGNMENT_GAPS.json b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/STATEMENT_ALIGNMENT_GAPS.json
new file mode 100644
index 000000000..862e9fac6
--- /dev/null
+++ b/cbz/evidence/website-foundation-20261029/sources/lean-foundation/STATEMENT_ALIGNMENT_GAPS.json
@@ -0,0 +1,95 @@
+{
+ "attribution": "OpenAI/Codex source-exposed engineering and source audit. Historical author/reviewer lineages remain as recorded. No new organizationally independent scientific review is claimed.",
+ "entries": [
+ {
+ "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
+ },
+ {
+ "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
+ },
+ {
+ "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
+ },
+ {
+ "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
+ },
+ {
+ "id": "ACTUAL_FIELD_WITNESS_PRESENT_BUT_NOT_PARENT",
+ "source_path": "/workspace/cbz0/repos/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeField.lean",
+ "source_sha256": "daf0949a14d4ed8bd19fbdc564f0f8c3fad72ed243de73e39d65b2951576919a",
+ "declarations": [
+ "I4LifetimeField.actualGaussianFieldInterface",
+ "I4LifetimeField.actualGaussianFieldInterface_exists"
+ ],
+ "gap": "A literal GaussianFieldInterface constructor with only01/2; reference hazard consequence verified.",
+ "note_file": "PROOF_ADVANCES_v7.md",
+ "record_id": "P15-TAIL",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "independent_local_proof",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V14",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Three-coordinate single-block witness proves the factor is optimal in the realized class.",
+ "note_file": "PROOF_ADVANCES_v7.md",
+ "record_id": "P15-SHARP",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "independent_local_proof",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V15",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Exact symmetric transform determinant, pin target, and r²/40 coefficient checked symbolically; no random-field theorem verified.",
+ "note_file": "PROOF_ADVANCES_v7.md",
+ "record_id": "D2-OBS",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "certified_symbolic_identity",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V16",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Exact endpoint cubic/Hermite and block-determinant algebra with standard moment import; see PROOF_ADVANCES_v8_D4.md.",
+ "note_file": "PROOF_ADVANCES_v8_D4.md",
+ "record_id": "D4-DET",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "independent_local_proof",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V17",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Positive r² endpoint-only normalizer reconstructed using Fourier point-jet rank and Gaussian regression; no remote pin in denominator.",
+ "note_file": "PROOF_ADVANCES_v8_D4.md",
+ "record_id": "D4-Z",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "independent_scoped_bound_reconstruction",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V18",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Weighted Kac-Rice factor and index/Jacobian accounting checked; general theorem imported, not reproved.",
+ "note_file": "PROOF_ADVANCES_v8_D4.md",
+ "record_id": "D4-KR",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "standard_theorem_specialization_checked",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V19",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "O(k r⁵|E|) remote numerator reconstructed with fixed rho, k_->0 and uniform conditional Gaussian moments; excludes collisions and shrinking rho.",
+ "note_file": "PROOF_ADVANCES_v8_D4.md",
+ "record_id": "D4-NUM",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "independent_scoped_bound_reconstruction",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V20",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "All-direction derivative image-sum tail bound through order six checked by rational inequalities; fixed d=2,3, L=24.",
+ "note_file": "PROOF_ADVANCES_v9_D3_D2.md",
+ "record_id": "D3-C4",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "independent_exact_inequality_chain",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V21",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Covariance spectral sandwich and conditional cone-moment transfer independently reconstructed; exact contact coefficient, not persistence theorem.",
+ "note_file": "PROOF_ADVANCES_v9_D3_D2.md",
+ "record_id": "D3-C5",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "independent_matrix_bound_reconstruction",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V22",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Periodic coefficient relative error <1e-106 reconstructed; decimal values independently recomputed numerically, not rigorously interval-certified.",
+ "note_file": "PROOF_ADVANCES_v9_D3_D2.md",
+ "record_id": "D3-04",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "analytic_bound_plus_numerical_crosscheck",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V23",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "The full-mark ell exponents and cutoff integration checked assuming R11/R12, cap selection, Kac-Rice and far-region bounds; full theorem not independently reproved. Reinspected cap/matrix imports in v11; global theorem not certified.",
+ "note_file": "PROOF_ADVANCES_v9_D3_D2.md",
+ "record_id": "D2-R",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "conditional_implication_checked",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V24",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Finite-jet Gaussian covariance rank and log-density interpolation checked under smooth positive Fourier spectrum. Original infinite-mode uniform estimates use standard Gaussian supremum moments.",
+ "note_file": "PROOF_ADVANCES_v10_R11_R12.md",
+ "record_id": "D2-R11-GAUSS",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "gaussian_regression_argument_checked",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V25",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Endpoint typed determinant product algebra and all-mark k-uniform R11 envelope reconstructed assuming the source R4 coupling; no full global persistence result.",
+ "note_file": "PROOF_ADVANCES_v10_R11_R12.md",
+ "record_id": "D2-R11-INTENSITY",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "conditional_scoped_bound_reconstruction",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V26",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Joint Gaussian jet nondegeneracy by positive Fourier polynomial rank; conditional C4 Gaussian residual moment bounds depend on standard smooth Gaussian theory.",
+ "note_file": "PROOF_ADVANCES_v10_R11_R12.md",
+ "record_id": "D2-R12-JOINT",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "gaussian_density_envelope_checked",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V27",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "m>=2 soft eigenvalue integral exact; m=1 near/far dichotomy proved for all positive parameters; Gaussian weighted full integration uses R13 and imported R14. Reinspected cap/matrix imports in v11; global theorem not certified.",
+ "note_file": "PROOF_ADVANCES_v10_R11_R12.md",
+ "record_id": "D2-R12-SOFT",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "exact_soft_eigenvalue_algebra_and_conditional_integral",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V28",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Fourth-moment weighted Markov tails checked with full Gaussian moments; R12 follows by combining soft branch and tails under R13/R14 and the deterministic cap criterion. Reinspected cap/matrix imports in v11; global theorem not certified.",
+ "note_file": "PROOF_ADVANCES_v10_R11_R12.md",
+ "record_id": "D2-R12-TAILS",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "conditional_weighted_tail_bound_reconstruction",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V29",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Hermite kernel, forced third derivative and transverse concavity constants reconstructed under cap assumptions.",
+ "note_file": "PROOF_ADVANCES_v11_CAP.md",
+ "record_id": "D1-CAP-HERMITE",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "independent_symbolic_local_check",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V30",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Strong concavity and ridge third derivative argument traced; constants checked exactly; not a claim ridge=gradient trajectory.",
+ "note_file": "PROOF_ADVANCES_v11_CAP.md",
+ "record_id": "D1-CAP-RIDGE",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "independent_local_argument_and_exact_constants",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V31",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Double soft factor and 3/2 saddle correction derived; 300 exact rational sharp matrix extremizers; not Gaussian probability certificate.",
+ "note_file": "PROOF_ADVANCES_v11_CAP.md",
+ "record_id": "D1-CAP-MATRIX",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "independent_matrix_envelope_proof",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V32",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Global maximin cap-to-elder proof traced under Morse/embedding imports; probability event inequality exact, not a new global theorem certificate.",
+ "note_file": "PROOF_ADVANCES_v11_CAP.md",
+ "record_id": "D1-CAP-ELDER",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "source_bound_topological_implication_and_event_inequality",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V33",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Corrected r^(-1/2) congruence and determinant/r proved symbolically; wrong original factor fails.",
+ "note_file": "PROOF_ADVANCES_v12_MARKED_KR.md",
+ "record_id": "D1-CORR-CONG",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/ERRATUM_CONGRUENCE.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "independent_exact_matrix_identity",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V34",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Embedded torus-radius inequality checked exactly; Slutsky law-vs-probability distinction checked logically, not Gaussian convergence independently re-established.",
+ "note_file": "PROOF_ADVANCES_v12_MARKED_KR.md",
+ "record_id": "D1-CORR-SCOPE",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "independent_geometric_bound_and_scope_check",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V35",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Countable strict-polygonal-path test gives Borel maximin elder mark given compact smooth Morse assumptions; not global Kac–Rice.",
+ "note_file": "PROOF_ADVANCES_v12_MARKED_KR.md",
+ "record_id": "D1-ELDER-MEAS",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "conditional_borel_measurability_argument",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V36",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Finite-dimensional Schur residual covariance identity checked; extension to a C²-valued conditional kernel uses standard Gaussian regularity on compact off-diagonal domains.",
+ "note_file": "PROOF_ADVANCES_v12_MARKED_KR.md",
+ "record_id": "D1-KR-KERNEL",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_section9_borel_repair_20260925/REPAIR.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "standard_gaussian_regression_specialization_checked",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V37",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Full Borel extension logically proved from finite measure identity on generating continuous cylinder algebra; original weighted Kac–Rice theorem remains an external import.",
+ "note_file": "PROOF_ADVANCES_v12_MARKED_KR.md",
+ "record_id": "D1-KR-BOREL",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_section9_borel_repair_20260925/REPAIR.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "conditional_finite_measure_monotone_class_proof",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V38",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Full directed ordered-pair, pin, radial and lifetime factor accounting recomputed; no 1/2 or extra determinant.",
+ "note_file": "PROOF_ADVANCES_v12_MARKED_KR.md",
+ "record_id": "D1-KR-JACOB",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "independent_exact_jacobian_and_power_check",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V39",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Exact k >= ell/r0³ restriction, k^-2/3 integrability, Gaussian envelope and local monotone exhaustion checked; Gaussian moment bounds imported.",
+ "note_file": "PROOF_ADVANCES_v12_MARKED_KR.md",
+ "record_id": "D1-KR-DOM",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "conditional_domination_and_cutoff_check",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ },
+ {
+ "artifact_sha256": null,
+ "checker_passed_for_full_statement": false,
+ "checker_version": null,
+ "custody": "unvalidated",
+ "full_proof_certificate": false,
+ "id": "V40",
+ "independent_full_proof_reproduction": false,
+ "kind": "scoped_local_check",
+ "limits": "Compact nondegenerate pin covariance and Gaussian-height-polynomial domination imply O(1) far density; not a shrinking annulus or global Kac-Rice certificate.",
+ "note_file": "PROOF_ADVANCES_v12_MARKED_KR.md",
+ "record_id": "D1-KR-FAR",
+ "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md",
+ "source_bytes_authenticated": false,
+ "verification_level": "conditional_uniform_far_region_bound",
+ "verifier_identity": "Earlier library local-audit author, no independent identification"
+ }
+ ],
+ "metadata": {
+ "authority": "curated source record; source bytes unauthenticated",
+ "automatic_source_sync": false,
+ "complete_proof_obligations_claimed": false,
+ "diagram_authority": false,
+ "generated_from": "v14 pinned offline library",
+ "mathematical_certifications": 0,
+ "mermaid_is_derived_output": true,
+ "original_known_required_links": 108,
+ "proof_bundles_are_proofs": false,
+ "quality_gate": "fail_closed",
+ "record_count": 104,
+ "scoped_local_check_items": 40,
+ "snapshot": "2026-10-24",
+ "status_listed_primary": 26
+ },
+ "obligations": [
+ {
+ "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
+ },
+ {
+ "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<ρ