← Lebesgue Universal Covering Problem / II · Computation and Reproduction / DLMVC · Deep-Lag Verification Methodology

Lebesgue Universal Covering Problem II · Computation and Reproduction DLMVC · Deep-Lag Verification Methodology 懸衡 (Xuán Héng) PARTIAL PASS

DLMVC: the method itself, and its four deep lagged passes on Round 04

DLMVC's mathematics holds, and in two places goes deeper than this layer's first reading. But its one "independent reproduction" re-ran the author's own script and so reproduced the script's error — the failure DLMVC exists to prevent. Every constant of the four deep passes recomputes; two of Pass 04's quantities are grid samples on the unsafe side.

PARTIAL · PASS This page is the second layer: the finite claims of the layer-1 document "DLMVC · Deep-Lag Verification Methodology" recomputed, its constructions reproduced, and its theorem-level steps read against the source. It does not rewrite the document and does not treat numerical results as proofs; the formal paper written from these two layers is the third layer, "III · Crystallization". Below are the recompute reports as written (byte for byte the research tree's), with their code and gate logs.

Connections

I · Precursor (the document)DLMVC · Deep-Lag Verification Methodology · DLMVC v0.1: A Deep-Lag Multi-Pass Verification—Closure Methodology Deliberately Desynchronized from the Frontier Line — Its First Field Audit Already Supplies Lebesgue Universal Covering Round 01 with a Missing Lemma and Falsifies One Active-Direction Classification
PreviousRound 37 · Latest Progress · II · Computation and Reproduction
NextUESFCM · Unbounded Expansion Self-Referential Closure · II · Computation and Reproduction

Recompute reports · Runs

RUN-041DLMVC: the lagged line's mathematics holds and in two places goes further than this tree's first reading; its one "independent reproduction" re-ran the author's script and reproduced the script's error — the failure DLMVC exists to prevent

Verdict: PASS for DLMVC's nine judgments; the other nineteen are labels. Its "Empirical validation: PARTIAL" is right — for a reason it does not give.

The report, the code and the gate log: report RUN-041.md · run041_dlmvc.py · gate log run041-dlmvc.json

Loads when opened…

RUN-042DLMVC's four deep passes on Round 04: every constant recomputes and the error bound holds on random bodies; two of Pass 04's quantities are grid samples on the unsafe side, and its figure for Pass 03's cell radius is a different quantity

Verdict: PASS for the passes' theorems and every constant and sanity number but three. Pass 04's inner-core factor and sharp cell radius are grid samples on the unsafe side, so what it boxes with them is not established by its own argument; and its figure for Pass 03's cell radius is another quantity.

The report, the code and the gate log: report RUN-042.md · run042_dlmvc_deep_passes.py · gate log run042-dlmvc-deep-passes.json

Loads when opened…