argument-selection.md

back to table · edit · history · where entries came from · files · download

2921 bytes, as of the version from 2026-11-20 01:33 (current). Recorded here, not run.

# Argument selection: individual Heegner-point logarithms

Quantity: the Abel–Jacobi logarithm of one oriented CM point on X_0(N), with cusp infinity as identity and differential 2*pi*i*f_N(tau)*d tau, f_N normalized by a_N(1)=1. The value is reduced in the full homology period basis, by reducing both real lattice coordinates into [-1/2,1/2). This is a single quantity with parameters (N,D,beta,a,b,c), not a trace or a quantity selector.

N is intrinsic geometric coverage: all twelve levels for which X_0(N) has genus one, as listed by Ogg (1974), p.449. No convenient subset of levels is selected. D is an arithmetic family index: negative fundamental discriminants, coprime to N, for which D is a square modulo 4N. The present complete bounded slice is |D|<=60, an explicitly noncanonical practical cutoff. It prioritizes all-level and full-class breadth before discriminant depth. It covers prime/composite levels, prime powers, odd/even discriminants, class-number-one controls, nontrivial class fields, and eligible exceptional-unit fields. There is no continuous coupling, probability grid, or interpolation mesh.

beta is the level orientation, exhaustively enumerated in [0,2N) subject to beta^2=D modulo 4N. The coordinates a,b,c jointly identify a proper ideal class: its unique reduced primitive positive-definite form, with b^2-4*a*c=D, |b|<=a<=c, and b>=0 when |b|=a or a=c. Each coordinate is an arithmetic structure, not an independently sampled integer box; all classes occur for every eligible (N,D,beta). Exact SL_2(Z) transformations are retained from each selected level form to that class label, and their coefficient action is checked. Watkins v2, Proposition 2.2 and Theorem 2.6, supplies these constraints and correspondence.

Enumeration is by N, increasing |D|, beta, then lexicographic (a,b,c). Exact enumeration gives 468 entries over 69 level/discriminant pairs, with per-level counts 36,48,32,44,40,28,40,32,42,44,32,50. No failures or vanishing values are filtered out. The finite slice is not the whole natural domain: use complete: no, and state the bound and rationale in complete-note. The generator, displayed program and stored identities must implement precisely this slice.

At 100 significant digits in each nonzero component, the 468 rows leave extension space under the 320-KB soft entries-block limit; actual serialized size is measured in deterministic checks. No new or extended table of traces, heights, coordinates, periods, or class numbers is authorized. Those quantities can appear only as identifying/check evidence and companion links.

Instruction evidence: ../20261120T010605Z-build-skills/manifest.json; core SHA-256 b79b7fbc9fa3ce63f2d642cccdac12b0d214757ab01db66c03a2d84264a58e5f, matching local/live bundle SHA-256 b5c3c7985b7c9e178b4899d083a9e3bc4284989dff76f05e5b0e52835d47eed2. Independent argument-selection verdict remains the critic's responsibility.