diff --git a/research/two-coordinate-euclidean-resolvent/PROOF.md b/research/two-coordinate-euclidean-resolvent/PROOF.md new file mode 100644 index 0000000000..4801e2826d --- /dev/null +++ b/research/two-coordinate-euclidean-resolvent/PROOF.md @@ -0,0 +1,127 @@ +# Exact two-coordinate Euclidean envelope + +## Statement + +Fix real 0 < rho < 1 and beta >= 1. Let E run over all complex 2-by-2 +matrices with absolute row sums at most rho and absolute column sums at +most beta*rho. Put + + c = min(beta-1, 1), + t = rho*c / (1-rho+rho*c), + L = 1-t+t^2 + t*sqrt(t^2-2t+2). + +Then the exact maximum is + + max ||(I-E)^(-1)||_2 = sqrt(L)/(1-rho). + +One attaining matrix is + + E_* = rho * [[1, 0], [c, 1-c]]. + +The theorem allows all complex phases and fractional beta. It concerns +exact matrices and the Euclidean operator norm. It assumes no support or +zero-diagonal restriction. Dimension is exactly two. + +## 1. Reduction to nonnegative saturated rows + +For M=|E|, the row cap makes both Neumann series converge, and + + |(I-E)^(-1)| <= (I-M)^(-1) + +entrywise. A nonnegative entrywise comparison A<=B implies +||A||_2<=||B||_2: apply |Ax|<=A|x|<=B|x| to every x. The same argument +therefore bounds the complex resolvent by its nonnegative comparison. + +We may fill the rows of M to sum exactly rho while keeping each column +sum at most beta*rho. Indeed, the two row deficits have total 2rho-sum M; +the two column capacities have total 2beta*rho-sum M, at least that much. +Every row can use either column. Greedily filling a deficient row against +available columns therefore cannot fail: before each such row, remaining +total capacity is at least remaining total deficit. This gives M' >= M +with both row sums rho and the same column caps. The Neumann series and +the preceding norm comparison give + + ||(I-M)^(-1)||_2 <= ||(I-M')^(-1)||_2. + +No prescribed support is preserved by this filling step. That is why the +theorem does not claim an optimum with prescribed zeros. + +## 2. The stochastic polygon + +Write M'=rho P, where + + P = [[a, 1-a], [b, 1-b]], 0<=a,b<=1. + +Set s=a+b-1 and d=a-b. The column caps say |s|<=beta-1; the four entry +inequalities say |s|+|d|<=1. Conversely these inequalities describe the +entire feasible polygon. Conjugating by the coordinate swap changes s to +-s and preserves d and the norm, so assume + + 0 <= s <= c, -(1-s) <= d <= 1-s. + +In the orthonormal basis u=(1,1)/sqrt(2), v=(1,-1)/sqrt(2), P becomes + + [[1, s], [0, d]]. + +Consequently its resolvent is + + [[alpha, alpha*rho*s/(1-rho*d)], [0, 1/(1-rho*d)]], + alpha = 1/(1-rho). + +All entries displayed are nonnegative. For fixed s they increase +entrywise with d, so the largest norm occurs at d=1-s. The resulting +matrix is + + alpha B(t_s), + B(t) = [[1, t], [0, 1-t]], + t_s = rho*s/(1-rho+rho*s). + +## 3. The final one-variable maximum + +The map s -> t_s is increasing, with t_0=0 and 0<=t_s<1. Also +||B(t)||_2>=1 because B(t)(1,0)=(1,0). For 0<=u<=v and v>0, + + B(u) = (u/v) B(v) + (1-u/v) I, + +so convexity of the operator norm gives + + ||B(u)||_2 <= (u/v)||B(v)||_2 + (1-u/v) <= ||B(v)||_2. + +Thus s=c maximizes the norm. A direct calculation gives + + tr(B(t)^T B(t)) = 2(1-t+t^2), + det(B(t)^T B(t)) = (1-t)^2. + +The larger eigenvalue is L above, since the discriminant divided by +four is t^2(t^2-2t+2). This proves the upper bound. The feasible matrix +E_* has s=c and d=1-c, so every final inequality is attained. This +proves equality and supplies the promised maximum, not only a supremum. + +## Consequences and a worked example + +At beta=1, the value is exactly 1/(1-rho). At beta>=2, the column +constraint is redundant and the formula uses t=rho. These cases are +included in the proof, without a limiting argument. + +At rho=1/2, beta=3/2, the attaining matrix and inverse are + + E_* = [[1/2, 0], [1/4, 1/4]], + (I-E_*)^(-1) = [[2, 0], [2/3, 4/3]], + ||(I-E_*)^(-1)||_2 = (2/3)*sqrt(7+sqrt(13)). + +## Scope and credit + +This settles only dimension two of the exact-finite-optimum question in +zhaobenny's PR6816. Its dimension-growth theorem is not used as a lemma. +Nick Petalas PR6788 and ToikY PR6806 concern the distinct induced 1-norm +problem. Nonnegative Neumann comparison, stochastic coordinates, +convexity of a norm and the 2-by-2 singular-value formula are classical. +The contribution is their exact optimization for this cap class; no +general literature-priority claim is made. + +This is a scoped written proof, corroborated by finite exact arithmetic. +It is not a physical Gaussian caller, complete invoice, proof-kernel +formalization, complete multiplication theorem or new kappa. Independent +human and formal proof-kernel review are unclaimed. + +This contribution was produced by Nick Petalas. Apache-2.0. diff --git a/research/two-coordinate-euclidean-resolvent/README.md b/research/two-coordinate-euclidean-resolvent/README.md new file mode 100644 index 0000000000..1e54b938d1 --- /dev/null +++ b/research/two-coordinate-euclidean-resolvent/README.md @@ -0,0 +1,123 @@ +# Exact two-coordinate Euclidean resolvent optimum + +Scoped written proof with exact finite corroboration. For complex 2-by-2 E +with absolute row sums at most rho and absolute column sums at most beta*rho, +where 0=1, the exact maximum is + +```text +c = min(beta-1, 1) +t = rho*c/(1-rho+rho*c) +max ||(I-E)^(-1)||_2 = sqrt(1-t+t^2+t*sqrt(t^2-2t+2))/(1-rho) +attainer: E = rho * [[1,0],[c,1-c]] +``` + +At rho=1/2 and beta=3/2, the value is exactly +`(2/3)*sqrt(7+sqrt(13))`. At beta=1 it is `1/(1-rho)`, while beta>=2 +gives the row-only optimum. [PROOF.md](PROOF.md) covers every allowed real +parameter and every complex phase. The proof reduces to nonnegative matrices, +fills the rows, triangularizes a stochastic 2-by-2 matrix and maximizes one +parameter by convexity. + +This takes dimension two of Open next question 2 in +[zhaobenny's PR6816](https://github.com/CrocSwap/integer-mult-bounds/pull/6816), +which asks for exact finite-dimensional Euclidean optima after proving sharp +dimension-growth orders. Its theorem is credited background, not a lemma used +or a result replayed here. Nick Petalas PR6788 and ToikY PR6806 solve distinct +induced 1-norm problems. No predecessor scientific program is imported or run. + +## Evidence and reproduction + +The standalone standard-library verifier passes exact checks on: + +- 4,952 nonnegative rational cap cases, including row completion, entrywise + inverse domination and the orthogonal-coordinate identity. +- 2,883 Gaussian-rational cap cases with independent entry phases in + `{1,-1,i,-i}`. These are finite cap cases, not a census of complex matrices. +- 594 attaining parameter presentations, including all p/q with + 2<=q<=12 and 1<=p=1, and the model permits diagonal entries and +arbitrary support. A prescribed-zero or zero-diagonal optimum is a different +problem. The mathematical theorem allows arbitrary real parameters. The +reference formula accepts Fraction parameters of at most 256 numerator or +denominator bits. Its finite tests use the displayed fixed small grids. +Helpers consume internal exact 2-by-2 or rational-pair data; there is no +external matrix parser or CLI input. + +All loops are bounded by those fixed grids, two coordinates, or six receipt +files capped at one MiB each. Functions stay below 60 physical lines. Explicit +inverse, cap, polygon, PSD and attainment checks remain active under `-O`. +There is no recursion, subprocess, network access, dynamic evaluation or +mutable global state. Power of Ten rule 3 has a managed-runtime deviation: +Python integers, Fractions and containers allocate dynamically. Fixed matrix +dimensions, bounded parameter height and streaming finite grids bound live +state. Warning-strict normal and optimized execution and in-memory syntax +and function-size inspection provide the available diagnostics; no separate +static analyzer is configured for this package. + +The selected baseline binding control passed at canonical main +`e54523517d0f03e58352e647c403a5af3e525a57`, selected PR7000 and historical +priority revision 8. No selected cold replay, native suite, Lean or Docker +run was needed. [SOURCES.json](SOURCES.json) pins the source question, +selected record and original card as provenance, without runtime imports. + +## Open next questions + +1. Determine the dimension-three optimum, starting at rho=1/2, beta=3/2. + Exact singular-value comparisons of rational transportation vertices are + a useful experiment, but a new extremality proof is required. This + two-dimensional proof does not justify checking only those vertices. +2. Bind the caps to an actual emitted two-coordinate Gaussian error block, + then price preparation, rounding and restoration. The source-bound block + and complete physical bill are still missing. + +## Credit and overlap + +This contribution was produced by Nick Petalas. Apache-2.0. Credit zhaobenny +PR6816 for the exact-finite-optimum question; Nick Petalas PR6788 and ToikY +PR6806 for the distinct cap-norm context; Ali Romman PR5255/PR5306, Cinna +Davis PR4100 and James Reed PR4282 for the retained Gaussian/conditioning +lineage. Nonnegative Neumann comparison, stochastic coordinates, norm +convexity and singular-value formulas are classical. No general literature +priority is claimed. All predecessor files and credit remain unchanged. + +The [advance claim](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19595245) +states this dimension-two scope. Live PR/Discussion metadata, local claims, +merged searches and distinctive searches across main's README inventory +were checked. The card's cached search has incomplete sparse local-note +coverage, supplemented by main-tree searches. Arbitrary historical diffs +and unpublished work remain outside the overlap coverage. diff --git a/research/two-coordinate-euclidean-resolvent/SOURCES.json b/research/two-coordinate-euclidean-resolvent/SOURCES.json new file mode 100644 index 0000000000..22fa6ee403 --- /dev/null +++ b/research/two-coordinate-euclidean-resolvent/SOURCES.json @@ -0,0 +1,24 @@ +{ + "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/column-cap-spectral-growth/README.md", + "usage": "provenance", + "git_blob": "684c38720a848351fe4b434e684e62ce8bf82c53", + "sha256": "04aac336287159c18ce76ed6eeb5a3fcacd1031b83da46740bf77840fdffbc6d" + } + ] +} diff --git a/research/two-coordinate-euclidean-resolvent/TASK.json b/research/two-coordinate-euclidean-resolvent/TASK.json new file mode 100644 index 0000000000..fbba6c0a70 --- /dev/null +++ b/research/two-coordinate-euclidean-resolvent/TASK.json @@ -0,0 +1,95 @@ +{ + "schema_version": 1, + "task_id": "uniform-transfer-audit", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "uniform-transfer-audit", + "question": "Can one of the selected record's five inherited assumptions be proved at its actual caller?", + "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": "Identify the proposition and what would change downstream; do not equate a finite replay with a universal proof.", + "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 one assumption ID (native_all_columns, owned_erasure, compiler, precision_tape, analytic_recovery), one quantified implication and exact dependency closure. Check current handoffs, including #5625 row reentry and #5707 root-prefix lowering, without treating their partial scope as the whole theorem. Prove or falsify that implication with a caller-bound argument; stop at the chosen obligation. Finite tests or root digits do not discharge an all-size statement.", + "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": [ + "native_all_columns", + "owned_erasure", + "compiler", + "precision_tape", + "analytic_recovery" + ], + "existing_checks": [ + { + "scope": "PR #4100: proposed unconditional construction and finite checks, without independent acceptance.", + "evidence": "research/unconditional-batched-crt/README.md", + "remaining": "Independent proof audit of one caller-bound all-size implication; all other premises remain explicit.", + "status": "author-checked", + "source_commit": "337d04939571a637aeab54a0f58f54fde811663a", + "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": "Exact Euclidean resolvent maximum for complex 2-by-2 matrices under absolute row and fractional column caps.", + "scope_change_reason": "Take dimension two of zhaobenny PR6816 Open next question 2. This is an abstract conditioning side result; the original actual-caller gate remains unmet.", + "bottleneck_link": "Side result adjacent to precision_tape: exact cap-dependent Euclidean amplification replaces an unspecified finite-dimensional maximum. No emitted Gaussian source or complete precision bill is supplied.", + "budget_minutes": 60, + "stop_rule": "Ship the dimension-two closed form and attaining matrix after exact finite conformance. Leave all higher dimensions and physical binding open.", + "outcome": "partial", + "evidence": "PROOF.md establishes the all-parameter scoped theorem; verify.py checks exact rational and Gaussian-rational finite domains, both inverse identities, PSD upper certificates and attaining eigenvalues.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "What is the exact finite-dimensional Euclidean optimum in dimension three?", + "why_it_matters": "The two-dimensional stochastic polygon no longer describes all nonnormal directions.", + "first_step": "Fix rho=1/2 and beta=3/2, enumerate the rational row-saturated transportation vertices and compare exact singular-value certificates.", + "blocked_by": "A new extremality proof is needed; enumeration of vertices alone does not prove the resolvent optimum." + }, + { + "question": "Can these cap parameters be established for an actual emitted two-coordinate Gaussian error block?", + "why_it_matters": "An abstract optimum cannot determine a physical precision bill.", + "first_step": "Extract a source-bound block and include its preparation, rounding and restoration costs.", + "blocked_by": "This package supplies no emitted matrix or caller implementation." + } + ], + "source_question": { + "pr": 6816, + "author": "zhaobenny", + "question": "Open next question 2: exact finite-dimensional Euclidean optimum", + "scope": "dimension two only" + } +} diff --git a/research/two-coordinate-euclidean-resolvent/VERIFY.json b/research/two-coordinate-euclidean-resolvent/VERIFY.json new file mode 100644 index 0000000000..75b00cb634 --- /dev/null +++ b/research/two-coordinate-euclidean-resolvent/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 rational and Gaussian-rational inverse identities, Hermitian PSD envelope certificates, stochastic reductions, attaining eigenvalues and domain/sign controls." + }, + { + "argv": [ + "{python}", + "-I", + "-O", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Exact rational and Gaussian-rational inverse identities, Hermitian PSD envelope certificates, stochastic reductions, attaining eigenvalues and domain/sign controls." + } + ] +} diff --git a/research/two-coordinate-euclidean-resolvent/verify.py b/research/two-coordinate-euclidean-resolvent/verify.py new file mode 100644 index 0000000000..aefd05f6ee --- /dev/null +++ b/research/two-coordinate-euclidean-resolvent/verify.py @@ -0,0 +1,252 @@ +#!/usr/bin/env python3 +"""Exact finite conformance for the two-coordinate Euclidean envelope.""" + +from fractions import Fraction as F +from hashlib import sha256 +from itertools import product +import json +from pathlib import Path + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def parameters(rho, beta): + for value in (rho, beta): + require(type(value) is F, "parameters must be Fractions") + require(max(abs(value.numerator).bit_length(), + value.denominator.bit_length()) <= 256, "parameter height") + require(0 < rho < 1 and beta >= 1, "parameter domain") + + +def envelope(rho, beta): + """Return A,B,D with the exact squared optimum A+B*sqrt(D).""" + parameters(rho, beta) + c = min(beta - 1, F(1)) + t = rho * c / (1 - rho + rho * c) + scale = 1 / (1 - rho) ** 2 + return scale * (1 - t + t * t), scale * t, t * t - 2 * t + 2 + + +def attainer(rho, beta): + parameters(rho, beta) + c = min(beta - 1, F(1)) + return ((rho, F(0)), (rho * c, rho * (1 - c))) + + +def nonnegative(a, b, d): + """Exact sign test for a+b*sqrt(d), with rational a,b and d>=0.""" + require(d >= 0, "negative radicand") + if b == 0 or d == 0: + return a >= 0 + if a >= 0 and b >= 0: + return True + if a <= 0 and b <= 0: + return a == b == 0 + if a >= 0: + return a * a >= b * b * d + return b * b * d >= a * a + + +def add(x, y): + return (x[0] + y[0], x[1] + y[1]) + + +def neg(x): + return (-x[0], -x[1]) + + +def mul(x, y): + return (x[0] * y[0] - x[1] * y[1], + x[0] * y[1] + x[1] * y[0]) + + +def conj(x): + return (x[0], -x[1]) + + +def norm2(x): + return x[0] * x[0] + x[1] * x[1] + + +def reciprocal(x): + n = norm2(x) + require(n > 0, "singular inverse") + return (x[0] / n, -x[1] / n) + + +def real_matrix(a): + return tuple(tuple((x, F(0)) for x in row) for row in a) + + +def matmul(a, b): + return tuple(tuple(add(mul(a[i][0], b[0][j]), + mul(a[i][1], b[1][j])) for j in range(2)) + for i in range(2)) + + +def inverse(a): + d = reciprocal(add(mul(a[0][0], a[1][1]), + neg(mul(a[0][1], a[1][0])))) + out = ((mul(a[1][1], d), mul(neg(a[0][1]), d)), + (mul(neg(a[1][0]), d), mul(a[0][0], d))) + ident = real_matrix(((F(1), F(0)), (F(0), F(1)))) + require(matmul(a, out) == ident, "right inverse") + require(matmul(out, a) == ident, "left inverse") + return out + + +def resolvent(e): + a = tuple(tuple(add((F(i == j), F(0)), neg(e[i][j])) + for j in range(2)) for i in range(2)) + return inverse(a) + + +def gram(r): + h00 = norm2(r[0][0]) + norm2(r[1][0]) + h11 = norm2(r[0][1]) + norm2(r[1][1]) + h01 = add(mul(conj(r[0][0]), r[0][1]), + mul(conj(r[1][0]), r[1][1])) + return h00, h11, h00 * h11 - norm2(h01) + + +def bound_check(e, rho, beta, attained=False): + a, b, d = envelope(rho, beta) + h00, h11, det = gram(resolvent(e)) + require(nonnegative(a - h00, b, d), "first PSD minor") + require(nonnegative(a - h11, b, d), "second PSD minor") + u = a * a + b * b * d - (h00 + h11) * a + det + v = 2 * a * b - (h00 + h11) * b + require(nonnegative(u, v, d), "determinant PSD minor") + if attained: + require(u == v == 0, "attaining eigenvalue") + + +def admitted_units(a, units, beta): + return all(sum(row) <= units for row in a) and all( + sum(a[i][j] for i in range(2)) <= beta * units for j in range(2)) + + +def saturate(a, rho, beta): + out = [list(row) for row in a] + for i in range(2): + deficit = rho - sum(out[i]) + for j in range(2): + room = beta * rho - sum(out[k][j] for k in range(2)) + delta = min(deficit, room) + require(delta >= 0, "completion capacity") + out[i][j] += delta + deficit -= delta + require(deficit == 0, "completion row") + require(all(out[i][j] >= a[i][j] for i in range(2) for j in range(2)), + "completion domination") + return tuple(tuple(row) for row in out) + + +def reduction_check(a, rho, beta): + completed = saturate(a, rho, beta) + r, old = resolvent(real_matrix(completed)), resolvent(real_matrix(a)) + require(all(r[i][j][0] >= old[i][j][0] + for i in range(2) for j in range(2)), "inverse domination") + p = tuple(tuple(x / rho for x in row) for row in completed) + if p[0][0] + p[1][0] < 1: + p = tuple(tuple(p[1-i][1-j] for j in range(2)) for i in range(2)) + s, delta = p[0][0] + p[1][0] - 1, p[0][0] - p[1][0] + require(0 <= s <= min(beta - 1, 1) and abs(delta) <= 1 - s, + "stochastic polygon") + q = real_matrix(((F(1), F(1)), (F(1), F(-1)))) + rp = resolvent(real_matrix(tuple(tuple(rho*x for x in row) for row in p))) + rotated = matmul(matmul(q, rp), q) + alpha, z = 1 / (1 - rho), 1 / (1 - rho * delta) + expected = real_matrix(((2 * alpha, 2 * alpha * rho * s * z), + (F(0), 2 * z))) + require(rotated == expected, "orthogonal-coordinate formula") + + +def rational_grid(): + count = 0 + rows = tuple((a, b) for a in range(5) for b in range(5-a)) + for rho, beta in product((F(1,5), F(1,2), F(3,4), F(9,10)), + (F(1), F(5,4), F(3,2), F(7,4), F(2), F(3))): + for a in product(rows, repeat=2): + if admitted_units(a, 4, beta): + e = tuple(tuple(rho*x/4 for x in row) for row in a) + bound_check(real_matrix(e), rho, beta) + reduction_check(e, rho, beta) + count += 1 + return count + + +def phase_grid(): + count = 0 + phases = ((1, 0), (-1, 0), (0, 1), (0, -1)) + rows = tuple((a, b) for a in range(3) for b in range(3-a)) + for beta, a in product((F(1), F(3,2), F(2)), product(rows, repeat=2)): + if not admitted_units(a, 2, beta): + continue + choices = tuple(phases if x else ((1, 0),) for row in a for x in row) + for phase in product(*choices): + e = tuple(tuple((F(a[i][j] * phase[2*i+j][0], 4), + F(a[i][j] * phase[2*i+j][1], 4)) + for j in range(2)) for i in range(2)) + bound_check(e, F(1,2), beta) + count += 1 + return count + + +def sharpness_grid(): + count = 0 + for denominator in range(2, 13): + for numerator, k in product(range(1, denominator), range(4, 13)): + rho, beta = F(numerator, denominator), F(k, 4) + e = attainer(rho, beta) + require(all(sum(row) == rho for row in e), "attainer row cap") + require(all(sum(e[i][j] for i in range(2)) <= beta * rho + for j in range(2)), "attainer column cap") + bound_check(real_matrix(e), rho, beta, attained=True) + count += 1 + return count + + +def controls(): + bad = ((F(0), F(1)), (F(1), F(1)), (F(-1), F(2)), + (F(2), F(2)), (F(1,2), F(3,4)), (True, F(2)), + (0.5, F(2)), (F(1,2), 2), (F(1, 2**257), F(2))) + for rho, beta in bad: + try: + envelope(rho, beta) + except ValueError: + continue + raise ValueError("invalid parameter accepted") + require(envelope(F(1,2), F(1))[:2] == (F(4), F(0)), "balanced cap") + require(envelope(F(1,2), F(2)) == envelope(F(1,2), F(100)), "redundant cap") + require(envelope(F(1,2), F(3,2)) == (F(28,9), F(4,3), F(13,9)), + "worked example") + require(not nonnegative(F(-2), F(1), F(3)), "negative surd") + require(nonnegative(F(2), F(-1), F(3)), "positive surd") + require(nonnegative(F(-2), F(1), F(4)), "zero surd") + require(not nonnegative(F(0), F(-1), F(3)), "pure negative surd") + return len(bad) + 7 + + +def main(): + counts = {"rational_cap_cases": rational_grid(), + "gaussian_rational_cap_cases": phase_grid(), + "attaining_parameter_presentations": sharpness_grid(), + "controls": controls()} + root = Path(__file__).resolve().parent + names = ("README.md", "PROOF.md", "TASK.json", "SOURCES.json", "VERIFY.json", "verify.py") + hashes = {} + for name in names: + with (root / name).open("rb") as source: + raw = source.read(1024 * 1024 + 1) + require(len(raw) <= 1024 * 1024, "receipt input size") + hashes[name] = sha256(raw).hexdigest() + print(json.dumps({"status": "PASS_TWO_COORDINATE_EUCLIDEAN_RESOLVENT", + "counts": counts, "sha256": hashes}, sort_keys=True)) + + +if __name__ == "__main__": + main()