What was already known
Dick, Goda and Suzuki posed the digital-sequence question. Goda, Hofer and Suzuki excluded ordinary Halton sequences and some Halton-type sequences. Gruenschloss’s finite digital nets address finite sets.
AI involvement
Claude Opus 5.5 produced constructions, proofs and Lean code. Leonhard Gruenschloss selected problems, steered the research and signed off the four Palomar statements against the manuscript.
- Low-discrepancy quasi-uniform digital sequences in every dimensionLow-discrepancy quasi-uniform digital sequences in every dimension
Importance
One explicit sequence in each stated dimension and base works at all sample sizes, giving a new construction for a documented open question.
Technical verification
Lean and NanoDa accepted all 80 Comparator configurations in the report, including four selected sequence theorems. Author checked statement correspondence; that signoff does not cover every proof.
Formal checking
Lean and NanoDa accepted all 80 Comparator configurations in the report, including four selected sequence theorems. Author checked statement correspondence; that signoff does not cover every proof.
- Checker
- Lean kernel and NanoDa Comparator reported by Gruenschloss
- Scope
- Four Palomar statements, including existence and the all-prefix Euclidean mesh ratio. The explicit toroidal separation constant applies at . The discrepancy implication is classical and outside the selected Lean scope.
- Basis
- Reported by the linked checker
- Exact Lean statements and provenanceExact Lean statements and provenance
- Lean comparison resultsLean comparison results
Human understanding
Gruenschloss reports understanding some parts. He reviewed the four formal statements and their correspondence, and reports that he has not checked every proof by hand. The disclosure does not allocate a fuller human explanation of the residue construction.
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision