Skip to content
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
19 commits
Select commit Hold shift + click to select a range
7af365e
Formalize conditional attainment at the literal superlevel death height
d6g8k5htny-coder Oct 20, 2026
38b52f9
test: pin C296 regular-point chart interface
d6g8k5htny-coder Oct 20, 2026
73f879c
test: pin C296 Lake dependency closure
d6g8k5htny-coder Oct 20, 2026
9873446
feat: instantiate the regular scalar chart
d6g8k5htny-coder Oct 20, 2026
88ae37d
test: mark C296 chart harness noncomputable
d6g8k5htny-coder Oct 20, 2026
f096fca
test: close C296 noncomputable harness scopes
d6g8k5htny-coder Oct 20, 2026
7f60705
ci: use Lean 4.34 warning escalation
d6g8k5htny-coder Oct 20, 2026
4aaddf4
ci: match C296 negative diagnostic stream
d6g8k5htny-coder Oct 20, 2026
72edcf5
docs: freeze C296 execution scope
d6g8k5htny-coder Oct 20, 2026
6c03363
test(C296): add fail-closed negative classifier
d6g8k5htny-coder Oct 20, 2026
cd57f0c
test(C296): add negative-classifier mutations
d6g8k5htny-coder Oct 20, 2026
3181a4d
fix(C296): fail closed on negative diagnostics
d6g8k5htny-coder Oct 20, 2026
97d6065
fix(C296): accept Lean negation spacing
d6g8k5htny-coder Oct 20, 2026
98ecc54
test(C296): mirror exact Lean negation spacing
d6g8k5htny-coder Oct 20, 2026
762a6f3
test: exercise every C296 negative classifier guard
d6g8k5htny-coder Oct 20, 2026
9dfbe0d
fix(c296): enforce complete axiom audit and bind consumed inputs
d6g8k5htny-coder Oct 24, 2026
9c89753
Merge pull request #488 from d6g8k5htny-coder/codex/c296-regular-poin…
d6g8k5htny-coder Oct 24, 2026
dbc3a80
Merge pull request #505 from d6g8k5htny-coder/codex/c300-c296-audit-r…
d6g8k5htny-coder Oct 24, 2026
06a0575
Merge Math- main c88c34b2 into codex/c294-critical-level-attainment-2…
claude Nov 2, 2026
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
63 changes: 63 additions & 0 deletions .github/workflows/c296-regular-point-chart.yml
Original file line number Diff line number Diff line change
@@ -0,0 +1,63 @@
name: C296 regular-point chart

on:
pull_request:
paths:
- "frontiers/critical_level_attainment_20261020/final-project/Lifetime.lean"
- "frontiers/regular_point_chart_20261020/**"
- ".github/workflows/c296-regular-point-chart.yml"
workflow_dispatch:

permissions:
contents: read

jobs:
regular-point-chart:
runs-on: ubuntu-latest
timeout-minutes: 30
steps:
- uses: actions/checkout@3d3c42e5aac5ba805825da76410c181273ba90b1
with:
persist-credentials: false
fetch-depth: 0
- uses: leanprover/lean-action@f061402b660e0c34644504b324e830f2991d4865
with:
auto-config: 'false'
build: 'false'
test: 'false'
lint: 'false'
use-mathlib-cache: 'true'
use-github-cache: 'false'
lake-package-directory: frontiers/regular_point_chart_20261020
- name: Build and kernel-check the exact C296 interface
working-directory: frontiers/regular_point_chart_20261020
run: |
set -euo pipefail
sha256sum --check SOURCE_SHA256SUMS
lean --version
lake build RegularPointChart RegularPointChartInterface
lake env lean -E warning RegularPointChart.lean
lake env lean -E warning RegularPointChartInterface.lean
lake env leanchecker RegularPointChart
lake env leanchecker RegularPointChartInterface
lake env lean RegularPointChartAxiomAudit.lean
- name: Exercise axiom policy and inventory controls with Lean
working-directory: frontiers/regular_point_chart_20261020
run: |
set -euo pipefail
python3 -B -S scripts/test_axiom_audit.py
- name: Mutation-test the negative diagnostic classifier
working-directory: frontiers/regular_point_chart_20261020
run: |
set -euo pipefail
bash scripts/test_negative_classifier.sh
- name: Require omission of noncriticality to be rejected
working-directory: frontiers/regular_point_chart_20261020
run: |
set -euo pipefail
set +e
lake env lean WithoutNoncriticality.lean > negative.log 2>&1
status=$?
set -e
cat negative.log
bash scripts/classify_negative.sh negative.log "$status"
111 changes: 111 additions & 0 deletions docs/superpowers/plans/2026-10-20-c296-regular-point-chart.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,111 @@
# C296 Regular-Point Chart Implementation Plan

> **For agentic workers:** REQUIRED SUB-SKILL: Use superpowers:subagent-driven-development (recommended) or superpowers:executing-plans to implement this plan task-by-task. Steps use checkbox (`- [ ]`) syntax for tracking.

**Goal:** Kernel-check the literal regular scalar chart at a noncritical point of the project space `E d`, without weakening C294's closed-superlevel local-path-connectivity premise.

**Architecture:** Add one isolated Lean package based on Math- PR #487 head `7af365e8c8db1ae0275d4efe08a70a678f153ca2`. The package copies C294's exact `Lifetime.lean` input, proves only the strict-derivative/surjective-derivative chart interface, and carries positive, negative, and axiom-audit modules. A packet-specific GitHub workflow provides red-then-green hosted execution because the local runtime cannot read `/proc/<pid>/exe` in this environment.

**Tech Stack:** Lean 4.34.1; Mathlib `d13f23b723b8a846827a245b89c10fc7d3f11612`; GitHub Actions `leanprover/lean-action@f061402b660e0c34644504b324e830f2991d4865`.

**Spec:** `frontiers/critical_level_attainment_20261020/SCOPE.md`, narrowed by C295 finding `Math-#487/6289066726` and C296 pickup `Math-#487/6289277782`.

## Global Constraints

- Preserve every existing C294/C293 byte; the new packet is additive.
- Scientific effect remains NONE; no formal or scientific registry promotion.
- Do not prove or suggest a critical-point Morse chart, quotient transport, half-space relative LPC, or removal of C294's `LocallyPathConnectedSpace` premise.
- Pin Lean 4.34.1, Mathlib `d13f23b723b8a846827a245b89c10fc7d3f11612`, and every hosted source head used as evidence.
- Treat the local `/proc/<pid>/exe` denial as a stop for local Lean execution; do not patch or bypass it.

## Review Focus

- Noncriticality must be used to prove the scalar derivative is nonzero; the negative module omits exactly that premise.
- Continuous-linear-map versus linear-map coercion must preserve the exact derivative and range statement.
- First-coordinate equality is global as a function equality, while inverse/homeomorphism claims remain restricted to source/target.
- The base point and `(g x, 0)` must be proved members of the chart's source and target.
- No theorem may silently imply closed-superlevel local path connectivity at critical points.

---

### Task 1: Hosted red test for the missing project chart

**Files:**
- Create: `frontiers/regular_point_chart_20261020/lean-toolchain`
- Create: `frontiers/regular_point_chart_20261020/lakefile.toml`
- Create: `frontiers/regular_point_chart_20261020/Lifetime.lean`
- Create: `frontiers/regular_point_chart_20261020/RegularPointChart.lean`
- Test: `frontiers/regular_point_chart_20261020/RegularPointChartInterface.lean`
- Create: `.github/workflows/c296-regular-point-chart.yml`

**Interfaces:**
- Consumes: C294 `UniversalLaw.Spec.Lifetime.E`, `IsSmooth`, and `IsCriticalPoint` from the exact copied `Lifetime.lean`.
- Produces: a failing interface test naming the intended `regularPointChart` declaration and its source/target identities.

- [x] **Step 1: Write the failing interface test**

The test imports `RegularPointChart` and invokes the wished-for chart plus first-coordinate, self, source-membership, and target-membership declarations at arbitrary `d`, `g`, and `x` under smoothness and noncriticality.

- [x] **Step 2: Run the hosted test to verify it fails**

Run: open a draft PR from `codex/c296-regular-point-chart-20261020` to `codex/c294-critical-level-attainment-20261020` and wait for `c296-regular-point-chart`.

Expected: FAIL at the exact red commit because `regularPointChart` (or its first intended helper) is unknown; setup/toolchain/source errors do not count as RED.

- [x] **Step 3: Commit the red harness**

Commit message: `test: pin C296 regular-point chart interface`

### Task 2: Minimal literal chart implementation

**Files:**
- Modify: `frontiers/regular_point_chart_20261020/RegularPointChart.lean`
- Test: `frontiers/regular_point_chart_20261020/RegularPointChartInterface.lean`
- Test: `frontiers/regular_point_chart_20261020/WithoutNoncriticality.lean`
- Test: `frontiers/regular_point_chart_20261020/RegularPointChartAxiomAudit.lean`

**Interfaces:**
- Consumes: `(hg 1).hasStrictFDerivAt`, `Module.Dual.range_eq_top_of_ne_zero`, and `HasStrictFDerivAt.implicitToOpenPartialHomeomorph` at the pinned Mathlib revision.
- Produces: `regularPointDerivative_range_eq_top`, `regularPointHasStrictFDerivAt`, `regularPointChart`, `regularPointChart_fst`, `regularPointChart_self`, `mem_regularPointChart_source`, and `mem_regularPointChart_target`.

- [x] **Step 1: Implement only the derivative and chart declarations required by the failing interface test**

Use `fderiv ℝ g x` literally; derive strict differentiability from `IsSmooth`; convert noncriticality to a nonzero continuous linear functional, then to full scalar range; invoke the existing Mathlib chart.

- [x] **Step 2: Add the omitted-noncriticality interface rejection**

The negative module must fail by leaving the required `¬ IsCriticalPoint d g x` argument unsupplied. The workflow must require a nonzero exit and a diagnostic mentioning `IsCriticalPoint`; timeout/import/syntax/unknown-production-identifier failures do not count.

- [x] **Step 3: Run hosted tests to verify they pass**

Expected: positive modules build with warnings as errors; the negative module is rejected for the intended missing premise; named-module `leanchecker` and the axiom audit succeed.

- [x] **Step 4: Commit the minimal implementation**

Commit message: `feat: instantiate the regular scalar chart`

### Task 3: Freeze source identities and hand off review

**Files:**
- Create: `frontiers/regular_point_chart_20261020/README.md`
- Create: `frontiers/regular_point_chart_20261020/SCOPE.md`
- Create: `frontiers/regular_point_chart_20261020/SOURCE_SHA256SUMS`
- Create: `frontiers/regular_point_chart_20261020/RESULTS.md`

**Interfaces:**
- Consumes: exact green head, workflow run/job identities, test streams, and Git blob/SHA-256 identities.
- Produces: a source-bound reviewable packet and explicit release record; no acceptance or integration claim.

- [x] **Step 1: Record exact source, toolchain, positive/negative, axiom, and hosted-run identities**

- [ ] **Step 2: Re-run the full hosted workflow at the frozen documentation head**

Expected: all C296 jobs green at the new exact head; previous green evidence is stale if source bytes changed.

- [ ] **Step 3: Commit documentation and request bounded nonauthor review**

Commit message: `docs: freeze C296 execution scope`

- [ ] **Step 4: Post result/release on Math-#487 and pointer on main#419**

The release must state exact head, source blobs/digests, run IDs, negative-control reason, axiom scope, local platform denial, and all exclusions.
184 changes: 184 additions & 0 deletions frontiers/critical_level_attainment_20261020/AUTHOR_NOTES.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,184 @@
# C294 author notes — conditional attainment at literal death

Author: OpenAI/Codex agent `/root/adapter_feasibility_c292`, delegated by the
parent for Dylan Roy. Same-provider and source/design exposure are explicit.
No organizational independence or human review is claimed. This is a new
formal implementation unit of the already delivered conventional C292 argument,
not a claim of a new conventional theorem or of full C292 formalization.

Claim supplied and verified by parent: R17 Work Events 2392,
`2afaffe8-cf58-4bc7-9824-7585f9feb788`, 2026-10-20 08:18:25.505179 UTC through
10:18:25.505179 UTC. Canonical pickup:
[Math #419 / 6286648588](https://github.com/d6g8k5htny-coder/Math-/pull/419#issuecomment-6286648588);
mirror:
[Main #419 / 6286653565](https://github.com/d6g8k5htny-coder/main/pull/419#issuecomment-6286653565).
Parent handles continuing ownership, review, final isolated verification,
publication and custody. Shared libraries and all previous deliveries are
unchanged.

## Exact acceptance boundary

The public declarations are
`TorusCriticalAttainment.quotient_death_attainment` and
`TorusCriticalAttainment.euclidean_death_attainment`.
Their inputs are literal Lifetime smoothness, period-L periodicity, and Morse
distinctness, a positive real period, a starting point, and C263 nonessentiality.
The one additional geometric premise is

```lean
LocallyPathConnectedSpace
{q : torus_quotient d L hL //
superlevelBar_deathHeight g M ≤ descendedHeight d L hL g hperiodic q}
```

Here `descendedHeight` is exactly C263 `torus_descend`, using the identical
Lifetime/C263 lattice-vector formula. There is no product-torus replacement
or half-open representative-domain compactness assumption.

The quotient theorem derives one strictly older literal quotient critical point,
an actual path to it in the closed death superlevel, and equality with death at
some path parameter. The Euclidean theorem lifts this one path from the
prescribed representative M, derives literal criticality of the resulting
endpoint, and preserves every path height. It does not select one Euclidean
representative consistently across separate strict-level lifts.

No fixed endpoint, finite event list, supplied path, trap, or desired death
identity is an input. Neither theorem claims strict death drop. The hypotheses
in fact permit every natural dimension; C292's positive-dimensional
nondegenerate-maximum locus specializes them without changing its d or L.
Only the nondegeneracy conjunct of Morse distinctness is used, through C293.
The distinct-critical-values conjunct is retained in the public source-facing
signature.

## Proof and reuse

For each a below the literal death delta, form the connected component K_a of
the starting quotient point in the closed superlevel {F >= a}. C263's strict
cut supplies a path to a strictly higher point and hence a higher point in K_a.
C263 already proves delta <= g(M), so no strict-death-drop or Taylor argument
is needed here.

K_a is compact and connected. A maximizer of F on K_a lies strictly above g(M)
and therefore in the interior of {F >= a}. Ambient local connectedness implies
that K_a is a neighborhood of that maximizer. It is consequently a local
maximum on the quotient. Pulling back through the continuous projection and
using Fermat's theorem proves literal Euclidean criticality, hence membership
in C293's quotient critical set.

Intersect that finite critical set with {F > g(M)}. This compact older set
meets every K_a. Since the K_a form a downward-directed family of closed sets,
compactness supplies one older critical Q in all of them. This is an actual
fixed-endpoint argument, without assuming a candidate/event list.

The directed intersection of the K_a is preconnected. The new elementary
helper proves this by normal separation and the existing compact
directed-closed-family lemma: a separation of the intersection would give a
separation of one K_a. This argument concerns compact sets, not path space.
Every point of the intersection lies in {F >= delta}, so M and Q belong to
the same connected component of that actual closed level.

The explicit closed-level local-path-connectivity premise is used at this last
step to turn connected-component membership into a path. If the path never
equalled delta, its heights would all be strictly above delta, contradicting
C263's `superlevelBar_death_not_mem_clearance`. Finally, specified-start
covering-map lifting preserves the whole path and C293's quotient derivative
identifies the lifted endpoint as a literal critical point.

Before adding this helper, inspected C258 `DEATH_PAIR_PROOF.md` and
`NEXT_TASK.md`: these are a conventional proof and a formal dependency list,
not a Lean intersection implementation. C258 expressly leaves formal
realization open. Also inspected the actual frozen `ClosedSuperlevel`,
`OrdinaryH0`, `ElderClearance`, `ElderInterval`, and `ElderBridge`
declarations. The existing trap has a `closed_path` input; its attainment
theorem assumes the displayed path and its closed-height bound.
`OrdinaryH0` explicitly supplies no critical-level attainment theorem.
`ClosedSuperlevel` is reused unchanged, including its closed-level definition
and `superlevel_neg_height`/`superlevel_isClosed` facts. No generic
compact-directed-connected-intersection theorem was located in these modules
or in the pinned Mathlib search.

The immutable module DAG is:

```text
Lifetime ───────┐
├── MorseFiniteCritical ──┐
TorusTopology ─┘ │
SuperlevelBar ───────────────────────────┼── CriticalLevelAttainment
ClosedSuperlevel ────────────────────────┘
```

Exact source bytes, SHA-256 and Git blobs are in `SOURCE_INPUTS.json`.
Mathlib is pinned at `d13f23b723b8a846827a245b89c10fc7d3f11612`.
The runtime is the existing Lean 4.34.1 binary, SHA-256
`1b370cfcbf44e80d1b004ab1b1ab9a4c73951f9f7c242140bcff9bc577576554`.

## Remaining mathematical boundary

The implication from literal Morse data to local path connectivity of the
actual closed death superlevel remains open in this formal development.
No smooth Morse normal-form theorem was found at the pin.
The submersion file defines its property through local normal forms and lists
the implication from a derivative right inverse/surjectivity as future work.
C293's inverse-function argument for the derivative map proves critical-point
isolation, not a quadratic normal form for g.

This unit does not prove the full C292 trap/frontier package, strict death
drop, a saddle index, actual elder pairing, exhaustive once-counted bars,
all-small-bars converses, regional shrinking-collision statements, or any
probabilistic/asymptotic conclusion. There is no coefficient-field input or
limit-order change: this is deterministic geometry of one literal sample
function at fixed d and positive L.

## Development evidence

Development writes are confined to C294. The runner serializes Lean,
uses two threads and a 4096 MB limit, retains stdout/stderr and receipts,
and stores each compiled source snapshot by SHA-256. Shared dependencies
are read only.

The first fresh Lifetime dependency build timed out at 240.03 seconds with
empty diagnostics and unchanged exact source. This failure is retained.
The three C293 dependency objects were then copied only after live source
and object hashes matched C293's terminal receipt. That explicit development
reuse is recorded in `evidence/DEVELOPMENT_OBJECT_REUSE.json`; it is not
fresh C294 source-build evidence.

The independent fresh ClosedSuperlevel build also timed out at 240.06 seconds
with empty diagnostics and unchanged source. Its old object was copied only
after its live hash and source hash matched the existing successful build
record and reviewed compiled-artifact manifest. This separate development
reuse is in `evidence/CLOSED_SUPERLEVEL_OBJECT_REUSE.json`.
The original 240-second runner is retained in evidence. Later development
invocations have a bounded 600-second limit. A one-second sample of the
running SuperlevelBar process located the active worker in Lean import
finalization (`lean_mark_persistent`), not theorem elaboration.
SuperlevelBar then passed a fresh build in 204.61 seconds with clean output.

The main module's first three attempts failed elaboration in 92.74, 75.04,
and 67.34 seconds. Their exact source snapshots and diagnostics are retained.
Corrections made actual set-membership inequalities explicit, installed the
actual quotient's derived ambient local-path-connectivity instance explicitly,
used the existing JoinedIn subtype/component API, and replaced obsolete
proof-local `letI` style with `let`. The public endpoint signatures and
mathematical hypotheses did not change.

The fourth main-module attempt passed in 73.72253683299999 seconds, return code
zero, with empty stdout and stderr and unchanged source. Receipt:
`runs/20261020T084025Z-CriticalLevelAttainment-deeba258/RECEIPT.json`,
SHA-256 `e64482068df7b48ac984c156054188b09b4ef865b504e6d1faa39334875aab1c`.

Stable main source: 14,338 bytes,
SHA-256 `ec4b6ceb9475143434c25269bccc45cdd627d83af359609007001c9284bb9a12`,
Git blob `1579751ec03c14f3dfd90df98db7a37d8ca74e09`.
Development object SHA-256:
`ea5f6a80ee778ec7708ddc1775cfbf829372127958a0db23efc7a7e1c7d5e235`.
`AUTHOR_MODULE_INVENTORY.json` binds these records and lists the thirteen
explicit declarations; this count is not a generated/transitive axiom census.
Proof edits stopped at this clean source.

Status: **clean author development compilation passed**. This does not claim
fresh C294 compilation of all reused dependencies. Parent's isolated final
source builds, standard named-module kernel replays, complete axiom census,
omitted-LPC negative invocation, exact-artifact nonauthor review, publication
and custody remain separate work. No final acceptance or scientific promotion
is claimed.
Loading
Loading