diff --git a/research/shared-fourier-unit-input-error/PROOF.md b/research/shared-fourier-unit-input-error/PROOF.md new file mode 100644 index 0000000000..9c20cd888e --- /dev/null +++ b/research/shared-fourier-unit-input-error/PROOF.md @@ -0,0 +1,149 @@ +# Sharp unit-input error for a shared translated Fourier routine + +This scoped written proof was produced by Nick Petalas. Apache-2.0. + +## Contract and new result + +Let G be a finite product of cyclic groups, N=|G|, with its standard +symmetric nondegenerate unit character pairing chi. Both Fourier signs have +the normalization + + (F±u)(x) = (1/N) sum_y chi(x,y)^±1 u(y). + +Fix a nonzero element b of order two. Put c(x)=chi(b,x), so c takes the +values +1 and -1 equally often. Let w be any unit-modulus complex function. +As in Nick Petalas's PR #6307, define + + P_b f(x) = f(x+b), + B_w(u,v) = D_conj(w) P_b F+ [(D_w P_b F-u)(D_w P_b F-v)], + B(u,v) = (u*v)/N². + +Convolution has no normalization. For a complex bilinear map T write + + ||T||_bil = sup { ||T(u,v)||_2 : ||u||_2=||v||_2=1 }. + +The desired map has ||B||_bil=N^(-3/2). The relative unit-input error is + + D(w) = ||B_w-B||_bil / ||B||_bil. + +The new result, answering Open next question 2 of #6307, is + + min_(|w|=1) D(w) = sqrt(2 - 8/(3 sqrt(3))). (1) + +The inherited phase choice + + w(x)=1/sqrt(3) - i sqrt(2/3)c(x) (2) + +attains (1). Every pair of equal normalized characters attains the +unit-input supremum for (2). More generally the following exact formula +computes the unit-input norm for every phase function, without optimizing +over pairs of input vectors: + + m = (1/N) sum_x c(x)w(x), + D(w)² = max_y {2 - 2 Re[conj(m)c(y)w(y)²]}. (3) + +This statement is about absolute operator error divided by the norm of B. +It does not divide by ||B(u,v)|| at each input pair, which can be zero. + +## A bilinear column-norm lemma + +Let U,V be any unitary maps on C^N and M any complex matrix with N columns. +For T(u,v)=M[(Uu) pointwise (Vv)], + + ||T||_bil = max_j ||M e_j||_2. (4) + +Indeed, for unit u,v, Cauchy-Schwarz gives + + sum_j |(Uu)_j(Vv)_j| <= ||Uu||_2 ||Vv||_2 = 1. + +The triangle inequality then bounds ||T(u,v)|| by the right side of (4). +If j maximizes it, choose u=U*e_j and v=V*e_j. Both are unit vectors, +their transformed pointwise product is e_j, and equality holds. This +argument works over complex inputs and for rectangular M as well. + +The inequalities and the extremizing construction are classical elementary +norm facts. The contribution is their exact application at this normalized, +shared three-pass Fourier boundary and the resulting sharp minimax theorem. + +## Apply the lemma with every normalization retained + +Write f=F-u and g=F-v. Then sqrt(N)F- is unitary, and the difference is + + (B_w-B)(u,v)=M(f pointwise g), + M_(x,z) = [conj(w(x))w(z-b)² chi(x+b,z-b)-chi(x,z)]/N. + +The maps multiplying u and v each supply another factor 1/sqrt(N). +Equation (4) therefore gives + + ||B_w-B||_bil = (1/N) max_z ||M e_z||_2. (5) + +For the desired map alone M=F+, whose columns all have norm 1/sqrt(N). +This proves ||B||_bil=N^(-3/2), including attainment. + +Put y=z-b. The ratio of the implemented and desired coefficients in +column z is + + rho(x,y)=conj(w(x))w(y)² c(x)c(y). + +Here chi(x+b,y)/chi(x,y+b)=c(y)/c(x)=c(y)c(x), using that b has order two. +Every desired coefficient has modulus 1/N. Squaring (5) and dividing by +||B||_bil² gives + + D(w)² = max_y (1/N) sum_x |rho(x,y)-1|². + +All rho have modulus one. Their average over x is +conj(m)c(y)w(y)². Expanding |rho-1|² proves (3). + +For any maximizing y, z=y+b and the explicit unit inputs are + + u(x)=v(x)=chi(x,z)/sqrt(N). + +Fourier orthogonality gives F-u=F-v=e_z/sqrt(N). They attain the column +in (5), so the upper bound is an attained supremum, not a relaxation. + +## Sharp minimization using the credited predecessor inequality + +PR #6307 proves, for every unit phase w in this same contract, that + + E(w)² = 2 - 2 Re[conj(m)n] >= 2 - 8/(3 sqrt(3)), + n=(1/N)sum_y c(y)w(y)². + +Its E is the relative coefficient Frobenius error N||B_w-B||_F. +The predecessor scalar moment inequality and its lower bound are cited +premises here. They are not re-proved or scientifically replayed. +Equation (3) immediately gives + + D(w)² >= (1/N)sum_y {2-2 Re[conj(m)c(y)w(y)²]} = E(w)². + +This proves the lower bound in (1) from the cited theorem. + +For the inherited choice (2), put h=1/sqrt(3), r=sqrt(2/3). Then + + m=-ir, + c(y)w(y)²=(h²-r²)c(y)-2ihr, + Re[conj(m)c(y)w(y)²]=2hr²=4/(3 sqrt(3)). + +Thus every column in (3) has squared error 2-8/(3 sqrt(3)). This supplies +the new arbitrary-unit-input upper bound and proves (1). Every equal +character pair attains it, independently of chi(b,b) and N. +The optimal unnormalized absolute error is N^(-3/2) times (1). + +## Scope and credit + +Nick Petalas #6307 supplies the question, coefficient lower bound, scalar +inequality and phase choice. Hanson Sun / bbMisk #1477 supplies the exact +weighted-layout contract, extending Ross Richardson #940. Character +orthogonality, unitary Fourier normalization, Cauchy-Schwarz and elementary +induced-norm arguments retain their classical credit. Only the unit-input +norm formula, its extremizers and the sharp extension to the stronger input +contract are claimed here. + +All finite products of cyclic groups and arbitrary unit complex phase functions are covered by +the written theorem under the stated order-two and shared-routine hypotheses. +The finite verifier uses only products of cyclic factors 2 and 4 of size at +most 16. Its exact arithmetic corroborates the new reduction and attaining +upper bound; it does not prove the universal theorem or audit the predecessor. +Other translation orders, physical phase preparation, rounding, routing, +restoration, compiler closure and the complete supplier bill are unsettled. +No new kappa, supplier admission or complete multiplication theorem follows. +Independent human and formal proof-kernel review are unclaimed. diff --git a/research/shared-fourier-unit-input-error/README.md b/research/shared-fourier-unit-input-error/README.md new file mode 100644 index 0000000000..ca0a383b01 --- /dev/null +++ b/research/shared-fourier-unit-input-error/README.md @@ -0,0 +1,139 @@ +# Sharp shared Fourier error on arbitrary unit inputs + +This scoped written proof with exact finite corroboration was produced by +Nick Petalas. Apache-2.0. It answers Open next question 2 of +[PR #6307](https://github.com/CrocSwap/integer-mult-bounds/pull/6307). + +For every finite product of cyclic groups and every nonzero order-two +translation, the shared phase-weighted three-pass Fourier routine has + + min relative induced bilinear l2 error = sqrt(2 - 8/(3 sqrt(3))). + +The inputs range over all pairs of complex unit-l2 vectors. Both Fourier +signs use 1/N, the desired output is convolution divided by N², and its +induced bilinear norm is N^(-3/2). Relative error divides the absolute +operator error by this norm, rather than by each input pair's output norm. +The latter can be zero. + +The new exact formula for any unit phase function w is + + c(x)=chi(b,x), m=average_x c(x)w(x), + D(w)²=max_y {2-2 Re[conj(m)c(y)w(y)²]}. + +Equal normalized character inputs attain every column in this maximum. +The inherited choice `w=1/sqrt(3)-i sqrt(2/3)c` makes all columns equal +and attains the stated optimum. [PROOF.md](PROOF.md) retains every Fourier +normalization and proves the arbitrary-input upper bound. It cites #6307's +coefficient-error lower bound and scalar inequality as premises. Their proof, +phase choice and earlier basis-input result are predecessor work. + +## Evidence + +The standard-library verifier implements the three literal Fourier passes +and direct group-addition convolution in exact Q(sqrt(2),sqrt(3),i). +It does not import or run a predecessor module. + +- All fourth-root phase assignments on Z/2, Z/4 and (Z/2)^2, at every + nonzero order-two translation, give 1,040 assignments. Each transformed + character input is checked directly against the new column formula. +- Eighteen minimizing fixtures on six group shapes of size 2 through 16 + check column flatness and attainment. Together with the phase census, + this gives 1,058 assignments and 4,274 equal-character input pairs. +- Another 72 pairs use distinct characters and real or complex unit + superpositions. Their literal errors obey the new sharp upper bound. +- Ten controls cover omitted final conjugation, omitted final translation, + missing normalization, maximum versus mean, and six malformed domains + rejected for the exact expected reasons. In the maximum-versus-mean + fixture, squared coefficient error is 7/4 while squared unit-input error + is 5/2. Thus averaging columns would miss the new norm. + +Every count is enumerated. The universal result is the written proof; +these finite checks corroborate its reduction and upper bound. Each run +prints a generated JSON receipt binding all six package files by SHA256. +Ordinary verification writes nothing. No hand-written receipt is retained. + +## Reproduce + +From the repository root, with CPython 3.12 and the standard library: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -B research/shared-fourier-unit-input-error/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -O -B research/shared-fourier-unit-input-error/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/shared-fourier-unit-input-error +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/shared-fourier-unit-input-error --check-source-history --check-modes +``` + +Another CPython 3.12 path may replace the displayed local interpreter. +Expected markers are `PASS_SHARED_FOURIER_UNIT_INPUT_ERROR`, +`PASS_REGISTERED_RESEARCH_PACKAGE` and `PASS_RESEARCH_COMMIT_BYTES`. +Both registered checks have a 120-second timeout. Explicit guards remain +active under optimized Python. The direct verifier needs only these six +files and also works without Git; source-history checking needs full history. + +## Scope, sources and credit + +Base is canonical main `e54523517d0f03e58352e647c403a5af3e525a57`, priority +revision 8. The selected source-binding orientation passed for #7000, +conditional kappa .00363005817. The catalogue still describes the older +#5599 assessment; it does not establish the current selected value. +The joint-query-controller card is explicitly changed to this analytic +side result in [TASK.json](TASK.json). It supplies an approximation boundary, +not a changed physical caller or a favorable complete recursive invoice. + +[SOURCES.json](SOURCES.json) pins the card, selected record and predecessor +proof text as historical provenance. No predecessor bytes are runtime inputs. +Credit Nick Petalas #6307 for the question, scalar moment inequality, +coefficient lower bound and minimizing phases; Hanson Sun / bbMisk #1477 +for the weighted-layout contract, extending Ross Richardson #940. +Character orthogonality, Cauchy-Schwarz, the triangle inequality and elementary +induced-norm arguments retain their classical status. The contribution is +the exact unit-input formula, explicit extremizers and sharp extension. + +[Advance CLAIM](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19592047). +Live PRs, recent account work, active Discussions, reservations, main-tree +README terms and distinctive merged searches were checked. The overlap +snapshot covers 810 open PRs and 7,416 Discussion records with complete +remote pagination. Its sparse local-note search covers 215 of 10,178 notes. +This does not establish absence of unpublished or differently worded work. + +Only the stated shared routine, complex l2 input norm and nonzero order-two +translation are covered. Other translations, physical phase preparation, +rounded arithmetic, routing, dirty restoration, storage, compiler closure, +analytic recovery and a complete supplier bill remain unsettled. The five +selected framework assumptions retain their status. No new kappa, supplier +admission, selected-frontier change or complete multiplication theorem is +claimed. Selected cold replay, predecessor scientific suites, Lean, Docker +and a literal physical caller were unrun. Independent human and formal +proof-kernel review are unclaimed. + +## Open next questions + +- Determine the sharp unit-input error at a translation of order three. + Begin with its column formula. A matching nonbinary phase inequality and + attaining construction are missing. +- Price an actual rounded caller using approximations to the attaining + phases. Begin with its grid and norm contract; charge coefficient + preparation, routing, restoration and the complete recursive invoice. + +Structured relevance, first steps and blockers are in TASK.json. No further +question is reserved by this package. + +## Verifier constraints + +There is no recursion, subprocess, network, dynamic code execution, callback +dispatch or file-writing path. Functions are below sixty physical lines. +Group dimension is at most four, group size at most sixteen, field dimension +eight, and the largest phase loop has 4^4 assignments. Each literal Fourier +pass has at most 16² terms and each convolution at most 16² pairs. Comparisons +use at most four exact integer-square-root enclosures, through 256 bits, and +fail if they cannot separate a nonzero value. Six package reads are each +capped at 256 KiB plus one guard byte. Syntax inspection and warning-strict +normal/optimized execution provide the available Python diagnostics. + +Power of Ten rule 3 deviation: CPython and Fraction allocate managed objects. +This fixed, one-shot census streams assignments, holds vectors of at most +sixteen eight-component field values and no result cache, and reads package +files one at a time under the stated cap. Dynamic allocation cannot be +disabled in this runtime. The finite domain, capacity rejection and both +registered runs are the compensating controls. A fixed-allocation native +implementation would need its own storage contract before integration. diff --git a/research/shared-fourier-unit-input-error/SOURCES.json b/research/shared-fourier-unit-input-error/SOURCES.json new file mode 100644 index 0000000000..9199335cf7 --- /dev/null +++ b/research/shared-fourier-unit-input-error/SOURCES.json @@ -0,0 +1,36 @@ +{ + "schema_version": 1, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "files": [ + { + "path": "certificates/selected-result.json", + "usage": "provenance", + "git_blob": "75d77b328ea02ded535e7f23aee5b1e55d0bb1a8", + "sha256": "154c3d30455d778fd3343b6b4851f0fa4665f0f7625b0adb3675e2bafbbf6bf1" + }, + { + "path": "docs/research/agent-task-catalog.json", + "usage": "provenance", + "git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec", + "sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81" + }, + { + "path": "research/shared-fourier-translation-floor/README.md", + "usage": "provenance", + "git_blob": "d1ed80965d756b3cd568fa0f2b5c5863080c6659", + "sha256": "7b48f98e16de222060af66fdcc4ce42273268468eeeaa302fe713f0869f462d3" + }, + { + "path": "research/shared-fourier-translation-floor/PROOF.md", + "usage": "provenance", + "git_blob": "acc9c3488da5400a05734d828f520bb38869dae7", + "sha256": "d8b456848f573de232822591e45e2b22720fdfa0236830495f5c0bfa631cf7bc" + }, + { + "path": "research/weighted-fourier-layout/README.md", + "usage": "provenance", + "git_blob": "7cd23891f12ea1f054ed778289bc45a7e8fb622e", + "sha256": "676e107f9e312a36793ec87ca9eec3df3c8764c71268153055c2d6064a40e79e" + } + ] +} diff --git a/research/shared-fourier-unit-input-error/TASK.json b/research/shared-fourier-unit-input-error/TASK.json new file mode 100644 index 0000000000..4646cc80dc --- /dev/null +++ b/research/shared-fourier-unit-input-error/TASK.json @@ -0,0 +1,122 @@ +{ + "schema_version": 1, + "task_id": "joint-query-controller", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "joint-query-controller", + "question": "Can a changed query demand or caller remove real work while satisfying native chronology and restoration?", + "starting_points": [ + "docs/research/current-priorities.md", + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md" + ], + "methods": [ + "Construct and independently check one source-bound instance of the stated first experiment.", + "Seek an exact counterexample or target-specific complete-budget obstruction to that same proposed change." + ], + "acceptance_gate": "A source-bound arbitrary-input identity and legal producer/consumer boundary with the complete paid and productive target invoice, including restoration, ownership, native alignment and extra charges. Price under the actual current model; historical ceiling.py assumptions must be established before use. A favorable optimistic relaxation keeps a route open but is not a completed supplier. A scoped local result remains useful; expansion requires the family-level budget gate.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.", + "scope": "Source-bound orientation only, not a supplier replay or theorem proof." + }, + "first_experiment": "Choose an exact caller and a new demand/interface hypothesis. Read the scoped #5617/#5631/#5649/#5747 and #5720/#5745 objections before rebuilding an excluded schedule. Compare the complete matched source/consumer protocols including all retained helper outputs. For an active-mode injection, first check #5745: its canonical delivery claim repays the eight removed centre jobs. Audit that exact claim or change its channel/feedback hypothesis; do not repeat the same free-injection search. Stop if the full favorable budget fails or the required restored output is unobservable.", + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "allowed_variations": [ + "One exact source head, helper/cut region or quantified proposition and changed hypothesis; check live handoffs first. Different seeds are not different scopes." + ], + "scope_change_triggers": [ + "Changing source head, helper/cut domain, operation alphabet or caller boundary without recording the new scope.", + "Treating an archived proposal or local numerical pass as complete supplier admission." + ], + "overlap_terms": [ + "query demand", + "active mode", + "5720", + "5745", + "5747", + "caller" + ], + "existing_checks": [ + { + "scope": "PR #4166: author-checked installed producer/service/return/bridge connection; native-component comparison loses.", + "evidence": "research/qq16-caller-install/README.md", + "remaining": "Complete matched physical protocol bill, or changed source-compatible demand/circuit; no affordable supplier yet.", + "status": "author-checked", + "source_commit": "0b082d22a0e9a442d264ab0633e35ef26c790630", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.", + "status": "reviewed", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5" + } + ] + }, + "scope_status": "changed", + "actual_scope": "Sharp relative induced bilinear l2 error of the shared order-two translated Fourier routine on arbitrary complex unit-l2 input pairs.", + "scope_change_reason": "A bounded analytic side result answering PR6307 Open next question 2; it does not construct the native caller requested by the card.", + "bottleneck_link": "Quantifies an approximation obstruction at a Fourier consumer boundary. No selected physical caller, completed signed invoice or kappa improvement is supplied.", + "budget_minutes": 60, + "stop_rule": "Stop at the first proved arbitrary-unit-input norm formula and sharp minimizer extension. Package that result without pursuing higher-order translations or physical implementation.", + "outcome": "completed", + "evidence": "PROOF.md proves the exact column-norm reduction and sharp minimax theorem, citing the PR6307 lower bound. The direct exact interpreter checks 1058 phase assignments, 4274 unit-character pairs, 18 minimizing fixtures, 72 further unit-input pairs and ten controls.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "What is the sharp unit-input error for a higher-order nonzero translation?", + "why_it_matters": "The new column reduction still applies to a shared spectral product, but order-two character signs were essential to the cited lower bound and attaining choice.", + "first_step": "Derive the maximum-column expression for a translation of order three before attempting a nonbinary phase minimax problem.", + "blocked_by": "No matching scalar inequality or attaining phase choice is known here." + }, + { + "question": "Can a literal rounded Fourier caller realize a useful approximation to the attaining phases at favorable complete cost?", + "why_it_matters": "The analytic optimum alone does not supply a physical phase program or recursive saving.", + "first_step": "Freeze one caller and error norm, approximate both algebraic coefficients on its actual grid, then charge preparation, routing, restoration and the complete invoice.", + "blocked_by": "No priced native realization, consumer connection or rounded error budget is supplied." + } + ], + "claim_type": "scoped written proof with exact finite corroboration", + "predecessors": [ + { + "pr": 6307, + "author": "Nick Petalas / petalas", + "head": "53dbf9395c03f5253f3a810855bdca043360c86f", + "used": "Open question 2, coefficient-norm lower bound, scalar moment inequality and phase choice; not replayed." + }, + { + "pr": 1477, + "author": "Hanson Sun / bbMisk", + "used": "Weighted Fourier layout contract and normalization, extending Ross Richardson PR940." + } + ], + "coordination": { + "claim": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19592047" + }, + "overlap_review": { + "remote_open_pr_records": 810, + "remote_discussion_records": 7416, + "local_notes_searched": 215, + "local_notes_at_head": 10178, + "limits": "Sparse local-note search is incomplete; main-tree README terms and targeted live/merged searches supplement it. Unpublished work and arbitrary historical diffs are not covered.", + "main_predecessor_pr": 6307, + "source_created_at": "2026-10-30T18:29:05Z" + }, + "verification": { + "python": "CPython 3.12.15", + "predecessor_scientific_replays": "none", + "selected_orientation": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY; selected #7000", + "ci": "pending" + } +} diff --git a/research/shared-fourier-unit-input-error/VERIFY.json b/research/shared-fourier-unit-input-error/VERIFY.json new file mode 100644 index 0000000000..af83ad7058 --- /dev/null +++ b/research/shared-fourier-unit-input-error/VERIFY.json @@ -0,0 +1,34 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Exact literal unit-character extremizers, arbitrary-phase column reduction, attaining unit-input bound, dense-pair corroboration and semantic/invalid-domain controls." + }, + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Exact literal unit-character extremizers, arbitrary-phase column reduction, attaining unit-input bound, dense-pair corroboration and semantic/invalid-domain controls with assertions disabled." + } + ] +} diff --git a/research/shared-fourier-unit-input-error/verify.py b/research/shared-fourier-unit-input-error/verify.py new file mode 100644 index 0000000000..cdd94b64be --- /dev/null +++ b/research/shared-fourier-unit-input-error/verify.py @@ -0,0 +1,321 @@ +#!/usr/bin/env python3 +"""Exact finite corroboration of the unit-input Fourier norm reduction.""" + +from fractions import Fraction +from hashlib import sha256 +from itertools import product +from math import isqrt, prod +from pathlib import Path +import json + + +# Basis: 1, sqrt(2), sqrt(3), sqrt(6), i, i sqrt(2), i sqrt(3), i sqrt(6). +Number = tuple[Fraction, ...] +Group = tuple[tuple[int, ...], ...] + + +def number(value: int | Fraction, basis: int = 0) -> Number: + if not 0 <= basis < 8: + raise ValueError("field basis") + return tuple(Fraction(value) if j == basis else Fraction(0) for j in range(8)) + + +ZERO = number(0) +ONE = number(1) +ROOT2 = number(1, 1) +ROOT3 = number(1, 2) +I = number(1, 4) +ROOTS = (ONE, I, number(-1), number(-1, 4)) + + +def add(a: Number, b: Number) -> Number: + return tuple(a[j] + b[j] for j in range(8)) + + +def scale(a: Number, factor: int | Fraction) -> Number: + return tuple(x * factor for x in a) + + +def multiply(a: Number, b: Number) -> Number: + out = [Fraction(0) for _ in range(8)] + for j, x in enumerate(a): + if x: + for k, y in enumerate(b): + if y: + common = j & k + factor = (2 if common & 1 else 1) + factor *= 3 if common & 2 else 1 + factor *= -1 if common & 4 else 1 + out[j ^ k] += factor * x * y + return tuple(out) + + +def conjugate(a: Number) -> Number: + return tuple(x if j < 4 else -x for j, x in enumerate(a)) + + +def real_part(a: Number) -> Number: + return a[:4] + (Fraction(0),) * 4 + + +def require(condition: bool, message: str) -> None: + if not condition: + raise RuntimeError(message) + + +def sign(a: Number) -> int: + require(not any(a[4:]), "non-real comparison") + if a == ZERO: + return 0 + for bits in (32, 64, 128, 256): + unit = 1 << bits + s2, s3 = isqrt(2 * unit * unit), isqrt(3 * unit * unit) + lower = (Fraction(1), Fraction(s2, unit), Fraction(s3, unit), + Fraction(s2 * s3, unit * unit)) + upper = (Fraction(1), Fraction(s2 + 1, unit), Fraction(s3 + 1, unit), + Fraction((s2 + 1) * (s3 + 1), unit * unit)) + lo = sum(a[j] * (lower[j] if a[j] >= 0 else upper[j]) for j in range(4)) + hi = sum(a[j] * (upper[j] if a[j] >= 0 else lower[j]) for j in range(4)) + if lo > 0: + return 1 + if hi < 0: + return -1 + raise RuntimeError("comparison precision exhausted") + + +def norm_squared(vector: tuple[Number, ...]) -> Number: + total = ZERO + for value in vector: + total = add(total, multiply(conjugate(value), value)) + require(not any(total[4:]), "non-real squared norm") + return total + + +def make_group(moduli: tuple[int, ...]) -> Group: + if not 1 <= len(moduli) <= 4 or any(type(q) is not int or q not in (2, 4) + for q in moduli) or prod(moduli) > 16: + raise ValueError("finite checker group domain") + return tuple(product(*(range(q) for q in moduli))) + + +def character(moduli: tuple[int, ...], x: tuple[int, ...], + y: tuple[int, ...]) -> Number: + turns = sum(x[j] * y[j] * (4 // q) for j, q in enumerate(moduli)) % 4 + return ROOTS[turns] + + +def validate(moduli: tuple[int, ...], b: tuple[int, ...], + weights: tuple[Number, ...]) -> Group: + group = make_group(moduli) + if b not in group or not any(b) or any(2 * b[j] % q for j, q in enumerate(moduli)): + raise ValueError("nonzero order-two translation required") + if len(weights) != len(group): + raise ValueError("phase length") + if any(len(w) != 8 or multiply(conjugate(w), w) != ONE for w in weights): + raise ValueError("unit phase required") + return group + + +def fourier(moduli: tuple[int, ...], vector: tuple[Number, ...], + direction: int) -> tuple[Number, ...]: + group = make_group(moduli) + require(len(vector) == len(group) and direction in (-1, 1), "Fourier domain") + out = [] + for x in group: + total = ZERO + for y, value in zip(group, vector, strict=True): + phase = character(moduli, x, y) + total = add(total, multiply(value, phase if direction == 1 else conjugate(phase))) + out.append(scale(total, Fraction(1, len(group)))) + return tuple(out) + + +def shift(moduli: tuple[int, ...], b: tuple[int, ...], + vector: tuple[Number, ...]) -> tuple[Number, ...]: + group = make_group(moduli) + positions = {x: j for j, x in enumerate(group)} + return tuple(vector[positions[tuple((x[j] + b[j]) % q + for j, q in enumerate(moduli))]] for x in group) + + +def literal(moduli: tuple[int, ...], b: tuple[int, ...], weights: tuple[Number, ...], + u: tuple[Number, ...], v: tuple[Number, ...], mutation: int = 0 + ) -> tuple[Number, ...]: + require(mutation in (0, 1, 2, 3), "literal mutation domain") + left = shift(moduli, b, fourier(moduli, u, -1)) + right = shift(moduli, b, fourier(moduli, v, -1)) + middle = tuple(multiply(multiply(w, x), multiply(w, y)) + for w, x, y in zip(weights, left, right, strict=True)) + final = fourier(moduli, middle, 1) + if mutation != 2: + final = shift(moduli, b, final) + out = tuple(multiply(w if mutation == 1 else conjugate(w), x) + for w, x in zip(weights, final, strict=True)) + return tuple(scale(x, len(weights)) for x in out) if mutation == 3 else out + + +def desired(moduli: tuple[int, ...], u: tuple[Number, ...], + v: tuple[Number, ...]) -> tuple[Number, ...]: + group = make_group(moduli) + positions = {x: j for j, x in enumerate(group)} + out = [ZERO for _ in group] + for s, x in zip(group, u, strict=True): + for t, y in zip(group, v, strict=True): + k = tuple((s[j] + t[j]) % q for j, q in enumerate(moduli)) + index = positions[k] + out[index] = add(out[index], multiply(x, y)) + return tuple(scale(x, Fraction(1, len(group) ** 2)) for x in out) + + +def unit_character(moduli: tuple[int, ...], z: tuple[int, ...]) -> tuple[Number, ...]: + group = make_group(moduli) + exponent = len(group).bit_length() - 1 + if exponent % 2: + factor = scale(ROOT2, Fraction(1, 2 ** ((exponent + 1) // 2))) + else: + factor = number(Fraction(1, 2 ** (exponent // 2))) + out = tuple(multiply(factor, character(moduli, x, z)) for x in group) + require(norm_squared(out) == ONE, "unit character normalization") + return out + + +def column_errors(moduli: tuple[int, ...], b: tuple[int, ...], + weights: tuple[Number, ...]) -> tuple[Number, ...]: + group = validate(moduli, b, weights) + moment = ZERO + for x, w in zip(group, weights, strict=True): + moment = add(moment, multiply(character(moduli, b, x), w)) + moment = scale(moment, Fraction(1, len(group))) + out = [] + for y, w in zip(group, weights, strict=True): + phase = multiply(character(moduli, b, y), multiply(w, w)) + cross = real_part(multiply(conjugate(moment), phase)) + out.append(add(number(2), scale(cross, -2))) + return tuple(out) + + +def error_squared(actual: tuple[Number, ...], expected: tuple[Number, ...]) -> Number: + return norm_squared(tuple(add(x, scale(y, -1)) + for x, y in zip(actual, expected, strict=True))) + + +def check_columns(moduli: tuple[int, ...], b: tuple[int, ...], + weights: tuple[Number, ...], counts: dict[str, int]) -> None: + group = validate(moduli, b, weights) + errors = column_errors(moduli, b, weights) + for y, predicted in zip(group, errors, strict=True): + z = tuple((y[j] + b[j]) % q for j, q in enumerate(moduli)) + u = unit_character(moduli, z) + expected = desired(moduli, u, u) + require(norm_squared(expected) == number(Fraction(1, len(group) ** 3)), + "desired bilinear norm attainment") + actual = literal(moduli, b, weights, u, u) + require(scale(error_squared(actual, expected), len(group) ** 3) == predicted, + "literal character / column norm disagreement") + counts["character_pairs"] += 1 + counts["phase_assignments"] += 1 + + +def minimizer(moduli: tuple[int, ...], b: tuple[int, ...]) -> tuple[Number, ...]: + h, imaginary_r = scale(ROOT3, Fraction(1, 3)), number(Fraction(1, 3), 7) + return tuple(add(h, scale(multiply(character(moduli, b, x), imaginary_r), -1)) + for x in make_group(moduli)) + + +SHARP_SQUARED = add(number(2), scale(ROOT3, Fraction(-8, 9))) + + +def check_dense(moduli: tuple[int, ...], b: tuple[int, ...], weights: tuple[Number, ...], + counts: dict[str, int]) -> None: + group = make_group(moduli) + first, second = unit_character(moduli, group[0]), unit_character(moduli, group[-1]) + real_mix = tuple(add(scale(x, Fraction(3, 5)), scale(y, Fraction(4, 5))) + for x, y in zip(first, second, strict=True)) + complex_mix = tuple(add(scale(x, Fraction(5, 13)), + scale(multiply(I, y), Fraction(12, 13))) + for x, y in zip(first, second, strict=True)) + for u, v in ((first, second), (real_mix, real_mix), + (complex_mix, real_mix), (complex_mix, complex_mix)): + require(norm_squared(u) == ONE and norm_squared(v) == ONE, "dense input norm") + observed = scale(error_squared(literal(moduli, b, weights, u, v), + desired(moduli, u, v)), len(group) ** 3) + require(sign(add(SHARP_SQUARED, scale(observed, -1))) >= 0, + "dense pair exceeds proved norm") + counts["dense_pairs"] += 1 + + +def finite_census() -> dict[str, int]: + counts = dict(phase_assignments=0, character_pairs=0, minimizer_fixtures=0, + dense_pairs=0, controls=0) + for moduli in ((2,), (4,), (2, 2)): + group = make_group(moduli) + for b in group[1:]: + if all(2 * b[j] % q == 0 for j, q in enumerate(moduli)): + for entries in product(range(4), repeat=len(group)): + weights = tuple(ROOTS[j] for j in entries) + check_columns(moduli, b, weights, counts) + for moduli in ((2,), (4,), (2, 2), (2, 2, 2), (4, 2), (4, 4)): + for b in make_group(moduli)[1:]: + if all(2 * b[j] % q == 0 for j, q in enumerate(moduli)): + weights = minimizer(moduli, b) + check_columns(moduli, b, weights, counts) + require(all(x == SHARP_SQUARED for x in column_errors(moduli, b, weights)), + "minimizer column flatness") + check_dense(moduli, b, weights, counts) + counts["minimizer_fixtures"] += 1 + return counts + + +def controls(counts: dict[str, int]) -> dict[str, str]: + moduli, b = (2, 2), (1, 0) + weights = minimizer(moduli, b) + u = unit_character(moduli, (0, 0)) + target = desired(moduli, u, u) + for mutation in (1, 2, 3): + observed = scale(error_squared(literal(moduli, b, weights, u, u, mutation), target), 64) + require(observed != SHARP_SQUARED, "semantic mutation survived") + counts["controls"] += 1 + uneven = column_errors(moduli, b, (ONE, ONE, ONE, I)) + maximum = max(x[0] for x in uneven) + mean = sum(x[0] for x in uneven) / len(uneven) + require(all(not any(x[1:]) for x in uneven) and maximum > mean, + "maximum must differ from mean for the control") + counts["controls"] += 1 + cases = (((3,), (1,), (ONE,) * 3, "finite checker group domain"), + ((2,) * 5, (1,) * 5, (ONE,) * 32, "finite checker group domain"), + ((2,), (0,), (ONE, ONE), "nonzero order-two translation required"), + ((4,), (1,), (ONE,) * 4, "nonzero order-two translation required"), + ((2,), (1,), (ONE,), "phase length"), + ((2,), (1,), (ONE, number(2)), "unit phase required")) + for shape, translation, phases, reason in cases: + try: + validate(shape, translation, phases) + except ValueError as error: + require(str(error) == reason, "wrong rejection reason") + counts["controls"] += 1 + else: + raise RuntimeError("invalid fixture accepted") + return {"squared_coefficient_error": str(mean), "squared_unit_input_error": str(maximum)} + + +def main() -> None: + require(multiply(ROOT2, ROOT2) == number(2), "sqrt2 arithmetic") + require(multiply(ROOT3, ROOT3) == number(3), "sqrt3 arithmetic") + require(multiply(I, I) == number(-1), "imaginary arithmetic") + counts = finite_census() + discrimination = controls(counts) + paths = ("README.md", "PROOF.md", "TASK.json", "SOURCES.json", "VERIFY.json", "verify.py") + hashes = {} + for name in paths: + with (Path(__file__).resolve().parent / name).open("rb") as handle: + data = handle.read(262145) + require(len(data) <= 262144, "package file capacity") + hashes[name] = sha256(data).hexdigest() + print(json.dumps({"marker": "PASS_SHARED_FOURIER_UNIT_INPUT_ERROR", "counts": counts, + "sharp_relative_error_squared": [str(x) for x in SHARP_SQUARED], + "mean_vs_max_control": discrimination, + "package_sha256": hashes}, sort_keys=True)) + + +if __name__ == "__main__": + main()