argument-selection.md

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

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

# Argument selection: cubic Gauss sums over the Eisenstein integers

The one index is the ideal (c) in O=Z[omega], omega=(-1+i*sqrt(3))/2.
Its unique generator c=a+b*omega congruent to 1 modulo 3 has ordered integer
coordinates a,b. Both declared parameters have category `arithmetic_structure`:
they jointly identify an ideal, and are not independently sampled couplings.
The natural domain consists of all nonunit squarefree ideals prime to 3.
The cubic residue character and trace-additive Gauss sum are specified by
Dunn–Radziwill, arXiv:2109.07463v3, Section 1.2, equations (1.6)–(1.8), and
David–de Faveri–Dunn–Stucky, arXiv:2410.03048v2, Sections 3.1 and 3.3,
equation (3.5). These inspected sources support the quantity and arithmetic
indexing; no application for each individual modulus is claimed.

The finite selection is every such ideal with norm N(c)=a^2-a*b+b^2 <= 500.
This noncanonical bound limits each direct sum to at most 500 residue classes,
while covering both conjugate split-prime ideals, inert quadratic residue
fields, and every eligible composite. This gives breadth across local and CRT
regimes before increasing prime norm depth. There is no quadrant, phase,
closed-form or convenient-output filter. Coordinates are kept together and
entries ordered by norm, then a, then b. No continuous parameter remains free.
No reference_sample group or statistical quantile is involved.

Squarefree is an ideal condition. In particular c=-2 (norm 4) and c=7
(norm 49) are included, whereas c=4 is excluded. The ramified prime over 3
is excluded by the generator congruence. The unit ideal is excluded because
its sum is the trivial empty-conductor value. Squareful unshifted sums are
zero by the cited local laws and are checked as omitted controls, rather than
listed as an undifferentiated zero family.

The generator enumerates a rigorously bounded integer lattice and rejects
repeated prime-ideal factors. The separate checker enumerates distinct products
of prime ideals obtained by factoring rational primes in Q(omega). The exact
ordered selected identities and group counts are retained in entries.json
and build-check-results.json. Enumeration, Programs, and complete-note use
this same selection. The planned counts (176, comprising 90 split primes,
4 inert primes and 82 composites) are assertions to verify computationally.

Skill archive: ../20261117T084433Z-build-skills/manifest.json. Its matching
local/live bundle SHA-256 is
984965681e2f8925c511a121c118efcde59581c7b0d906cac8b641bf6925e55a.
This is a builder's rationale; the controller must obtain an independent
argument-selection review and a revision-bound scientific verdict.