← BSD Conjecture · LAYER 3 · III · Crystallization
The ten items of a determinantal comparison at $(389.\mathrm{a}1,\ p = 11)$, judged one by one, and the method that judges them
I · Precursor (five sub-lines: Phase 0, P5, Phase 1, Phase 2 and the stress test) → II · Computation and Reproduction (107 runs, RUN-001 to RUN-107) → III · Crystallization (this page, the formal paper).
1bad024664cae8fc…130507f1f4dddb43…The PDF is built from the Markdown source by tools/build.py of the crystallization repository, amral-crystallization, at commit 8953b08e8f5f2fcab5a87d101acac208577dc948. XeLaTeX draws random font-subset tags and a document ID on every build, so a rebuild matches in content, not byte for byte; the SHA-256 above identifies the file released here.
The Birch–Swinnerton-Dyer conjecture is open, and nothing here bears on it directly. This paper concerns the step a determinantal approach to it must take before any statement about \(L\)-values: fixing the normalization of a comparison between an auxiliary Eisenstein family and an arithmetic line, for the rank-2 curve \(389.\mathrm{a}1\) at \(p = 11\) with the rank-0 curve \(19.\mathrm{a}1\) as calibrator. A symbolic programme reduced that step to a certificate of ten items, C1–C10. We judge each item against objects that actually exist — constructed, recomputed, or supplied by a theorem whose hypotheses we instantiate on these curves — and close all ten.
The closure has three ingredients. The late character of the comparison is a function of the auxiliary family alone, by Loeffler–Rivero’s theorems, every inherited hypothesis instantiated; the auxiliary leading line exists and is the Kummer line of \(\mathbf{Q}(\sqrt2)\), whose local conditions are vacuous at every place; and the comparison route is realized as an actual chain of line maps — injective but not surjective for the target, because its \(p\)-adic \(L\)-function has a double zero — along which the pairing scalar, the determinant scalar and the residual holonomy are all exactly 1, so that the reduced comparison is itself a canonical section. The method matters as much as the verdicts: one rule judges every item and never turns an unmeasured item into a pass, and the rule was itself corrected twice when it misjudged the kind of claim an item makes. At the pinned commit the line’s whole-tree drill stands at 692 planted defects, 687 caught by their named check, 5 detected only by a crash of it, 179 controls undisturbed, over 218 checks.
The paper takes one point of the first layer's P5 sub-line: the rank-2 curve 389.a1 at the good ordinary prime p = 11, with the rank-0 curve 19.a1 as calibrator. Its spine is the normalization certificate C1–C10: the symbolic programme stated it as ten conditions in its thirtieth round, and the second layer's RUN-090 to RUN-102 judged each item against objects that actually exist and closed all ten, as architecture. The cross-curve calibration used in the setting is taken from the second layer's coefficient-for-coefficient reproduction of it, RUN-081. The post-normalization DAG nodes A–D (RUN-103 to RUN-107) are the subject of this line's first paper (version 0.1, released); this paper makes no new statement about them, and DAG nodes E–G are untouched. Phase 0, Phase 1, Phase 2 and the stress test are outside its scope. BSD itself is OPEN, and the paper claims no new mathematics.
Not claimed anywhere in this paper: the Birch–Swinnerton-Dyer conjecture; any statement about \(L(E,s)\); any node of the post-normalization DAG; the values of \(C_\pi\), of the period ratio \(\Pi_E/\Pi_0\), of the comparison scalar \(c_{\mathrm{ES}/\mathrm{Kum}}\), of the lattice index \(q\) or of the jet order \(n\); and any Beilinson–Flach class in coordinates. “Closed” means closed as normalization architecture: the comparison’s normalization is fixed canonically, which is the precondition for the DAG and nothing more.
| Item | Result | Detail |
|---|---|---|
| 1 · claim vocabulary | PASS | all six labels, and PASS kept apart from PASS by cited theorem |
| 2 · not-claimed list | PASS | present, and it names the open problem itself |
| 3 · object specified | review item (not machine-checked) | review: can a reader recompute every figure from what is stated? |
| 4 · numbers trace to logs | PASS | 23/23 traced — 23 to recomputed evidence, 0 only to a quotation of the programme (9 small integers set aside) |
| 5 · instrument can fail | PASS | 692 defects planted, 687 caught by the check named for each; 179 controls; 218 checks |
| 6 · reproduction | PASS | section present; running it is a review step |
| 7 · contributions | PASS | section present; 3 author(s), listed alphabetically, each named in it |
| 8 · attachments | PASS | 109 gate logs; 18 input manifest(s) with SHA-256; public projection linked |
| rule · 4 nothing local | PASS | nothing machine-local or credential-shaped |
Evidence pinned at agent/bsd-verification-zhuiheng @ 6f9c8cc10139ee05f235bf9a22085479c3d2966a · bsd-verification-zhuiheng/
This paper pins its evidence at research-tree commit 6f9c8cc (RUN-109, 2026-10-24), from which the second layer's pages are regenerated, so every figure in it can be seen there, on the pages of the runs it cites; the corrections this version carries are recorded on the pages of RUN-108 and RUN-109.
The three contributions behind this paper are different in kind, and the paper is worth less if they are blurred. They are given here in alphabetical order, the order the author list keeps as data; on the title page the three sit at a round table, with no first and no last.
Aletheia — model: ChatGPT, GPT series — wrote the symbolic rounds in which the certificate C1–C10 and the post-normalization DAG were stated, and set every round of this stretch: what to attack, what was out of scope, which inferences to plant as defects, and where the boundary lay. Several of the corrections recorded here — that a non-zero-divisor is not a unit, that the lattice index belongs with the magnitudes, that the hypotheses inherited from Part B had to be instantiated — were that side’s catches.
Neo.K set the programme’s target and arranged the work: one line deriving, one verifying.
墜衡 (Zhuì Héng) — the independent verification line; model: Claude, Opus series — built each gate, read Loeffler–Rivero and instantiated its hypotheses on these curves, computed every finite quantity above with independently written code, judged every item, corrected its own method and verdicts where §§2, 5, 6 and 8 say so, drilled the tree, and wrote this paper. Nothing in the certificate or the DAG is this line’s invention.
Inputs from outside the byline. The cross-curve calibration (the identity of §1 and the series of §3) was built in a separate local verification session — a Claude Code session, model: Claude Opus 5, working on its own branch; this line reproduced it coefficient for coefficient, and it enters as that reproduction. Its author is not on this byline. The theorems of Loeffler and Rivero, Kato, Hida, Mazur, Soulé and Bloch–Kato are other people’s and are cited as such.
Priority, stated plainly. No result here is claimed as new mathematics. What is offered as this line’s own is the instantiation: ten conditions judged against actual objects at one point, the corrections the judging forced, and an instrument that has been made to fail.
SHA256SUMS lists every file's SHA-256.
1bad024664cae8fc…130507f1f4dddb43…