sum-two-squares-zmod-eight-ne-sixStatus: packet-ready · generated mechanically (ADR-020 / SPEC-020-A) · sponsor: Chris Barlow
import Mathlib
theorem sum_two_squares_zmod_eight_ne_six (m n : ℤ) : (((m ^ 2 + n ^ 2 : ℤ)) : ZMod 8) ≠ 6 := by
sorry
Kernel-verified on main: library/Unsorry/SumTwoSquaresZmodEightNeSix.lean (theorem sum_two_squares_zmod_eight_ne_six),
through Gate A (build --wfail, axiom audit against the standard whitelist, leanchecker
kernel replay, regenerated ADR-011 binding obligation).
The git apply-able new-file diff is at sum-two-squares-zmod-eight-ne-six.patch. The target path
Mathlib/Unsorry/SumTwoSquaresZmodEightNeSix.lean is a placeholder — file placement and the
final name are Zulip questions, not ours to decide. Content:
/-
Copyright (c) 2026 Chris Barlow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Barlow
-/
import Mathlib
theorem sum_two_squares_zmod_eight_ne_six (m n : ℤ) : (((m ^ 2 + n ^ 2 : ℤ)) : ZMod 8) ≠ 6 := by
first
| (push_cast; generalize (m : ZMod 8) = z0; generalize (n : ZMod 8) = z1; revert z0 z1; decide)
| (generalize (m : ZMod 8) = z0; generalize (n : ZMod 8) = z1; revert z0 z1; decide)
| (push_cast; decide)
| decide
571b8a8e54219b4d393f75f4b8653fac08197fcc\bsum_two_squares_zmod_eight_ne_six\bA name-grep is a pre-filter, not a proof of absence; the kernel build at HEAD
(tools/upstream/verify_head.sh) is the strong evidence and its result belongs in the
PR conversation.
| Field | Value |
|---|---|
| source | #400 Identity Engine (ADR-043) — modular-arith family. |
| reference | A sum of two integer squares is never congruent to 6 modulo 8. Not a named mathlib lemma in this form. |
| absence | no-local-match (grep of pinned mathlib rev c5ea00351c, 2026-06-14); triviality-gate non-trivial (ADR-035). |
| triviality | machine-checked non-trivial (battery v1, rev c5ea00351c, 2026-06-14). |
| difficulty | 3 |
| decomposition sketch | Cast to ZMod 8; decide checks all 64 residue pairs, whose square sums avoid 6. |
| title | A sum of two integer squares is never congruent to 6 modulo 8. |
Proof produced by an autonomous Claude agent swarm (model policy ADR-013/ADR-015:
fable, progressive effort), merged with no human review through two CI gates
(ADR-006 soundness, Gate B hygiene). Full machine history: the goal’s PR trail in
this repository.
The Lean proof in this PR was produced by an autonomous LLM agent (Anthropic Claude, model
fable) operating in theunsorryproof swarm (github.com/agenticsnz/unsorry), and was machine-verified there by kernel replay, an axiom audit against the standard whitelist (propext,Classical.choice,Quot.sound), and a CI-regenerated statement-binding obligation. I have read and understood the proof in full and can justify each step without AI assistance. Label:LLM-generated.
python3 -m tools.upstream.raise_pr --goal sum-two-squares-zmod-eight-ne-six --fork <your-github-user> --understood
It clones mathlib master, applies the patch to a fresh branch, pushes to
your fork, and opens a draft PR pre-filled with the factual disclosure
and a placeholder where your narrative goes. (--understood is your
attestation that you’ve read the proof; --dry-run shows the plan first.)
The machine never marks it ready and never writes a review reply.
LLM-generated label, then
you flip draft → ready. Expect the linter to want golfing (binder
names, line length) — that editing is yours. See docs/upstreaming.md.in-discussion → pr-open →
merged | declined). Declined is a valid, recorded result.