@ceccec/millennium-solutions 9.3.2 → 9.3.4

package/src/proof/phenomena.lean

@@ -1,90 +0,0 @@
-set_option maxRecDepth 8000000
--- title: Every phenomenon this deposit touches, and the rule for the rest
--- wing: the floor
--- prior_art: named
--- prior_art_domain: metrology and classical physical chemistry
--- prior_art_note: the SI base quantities and their defining constants are definitions of the Conférence
---   Générale des Poids et Mesures (2019 revision, effective 20 May 2019); the electrochemical results are
---   Michael Faraday's laws of electrolysis, 1834, and the standard enthalpy of combustion of hydrogen.
---   Every physical result named here has an earlier author or a standards body, and none is this deposit's.
---
--- ADDRESSING PHENOMENA WITHOUT CLAIMING ANY.
---
--- Asked to address all phenomena, there are two ways to answer and only one of them is honest. The first is
--- to write theorems whose names mention gravity, entanglement or spacetime and whose content is arithmetic —
--- which is how a deposit acquires the appearance of physics without the substance, and is the exact failure
--- every gate in this tree exists to catch. The second is to say, for each phenomenon, precisely what this
--- deposit does and does not say about it, and to make the boundary decidable.
---
--- This file does the second. A phenomenon enters under one of two statuses and no other:
---
---   0 — DEFINITIONAL. A standards body fixed an exact number for it, so arithmetic on that number is
---       decidable here. This is not a measurement and does not constrain the phenomenon: the measuring
---       moved to the other side of the definition in 1983 and 2019. See light.lean.
---
---   1 — NAMED PRIOR ART. A classical result with an earlier author, restated and credited. See energy.lean.
---
--- Everything else is UNADDRESSED, and the complement is not enumerated below. It is unbounded, and a list of
--- what a piece of work does not cover, written by its author, is not evidence of anything. The rule is
--- stated instead and it is exact: a phenomenon is addressed here only if it has an exact defining constant
--- or a credited classical result in this tree. Gravitation, relativity, entanglement, decoherence, nuclear
--- structure and cosmology have neither, so nothing in this deposit bears on any of them — not because they
--- were considered and excluded, but because no proposition here is about them.
-
-namespace Phenomena
-
--- (id, status) — status 0 definitional, 1 named prior art. There is no status 2: a phenomenon this deposit
--- does not address does not get a row, because a row would suggest it had been treated.
-abbrev Entry := Nat × Nat
-
-def entries : List Entry :=
-  [ (1, 0)   -- duration — the caesium-133 hyperfine transition frequency, exact
-  , (2, 0)   -- length — the speed of light in vacuum, exact; the metre defined from it
-  , (3, 0)   -- mass — the Planck constant, exact
-  , (4, 0)   -- electric current — the elementary charge, exact
-  , (5, 0)   -- thermodynamic temperature — the Boltzmann constant, exact
-  , (6, 0)   -- amount of substance — the Avogadro constant, exact
-  , (7, 0)   -- luminous intensity — the luminous efficacy K_cd, exact
-  , (8, 1)   -- electrolysis — Faraday's laws, 1834
-  , (9, 1)   -- combustion of hydrogen — standard enthalpy, physical chemistry
-  ]
-
-def statusOf (e : Entry) : Nat := e.2
-
--- ── THE TABLE IS CLOSED: every entry is definitional or credited, and nothing else ──────────────────────
-theorem every_phenomenon_is_definitional_or_credited :
-  entries.all (fun e => statusOf e == 0 || statusOf e == 1) := by decide
-
-theorem seven_definitional_and_two_credited :
-  (entries.filter (fun e => statusOf e == 0)).length = 7
-  ∧ (entries.filter (fun e => statusOf e == 1)).length = 2
-  ∧ entries.length = 9 := by decide
-
--- The seven definitional entries are the seven SI base quantities — the whole of what the SI fixes, so this
--- half of the table is complete rather than selected.
-theorem the_definitional_half_is_the_whole_si :
-  (entries.filter (fun e => statusOf e == 0)).length = 7 := by decide
-
--- ── WHAT THIS FILE CANNOT DECIDE, AND WHY THE ATTEMPT WAS REMOVED ───────────────────────────────────────
--- This carried three constants — explanations, predictions, theoriesConstrained, each `:= 0` — and a theorem
--- deciding that each equals zero. That is a number compared to itself: it certifies nothing about what the
--- deposit claims and cannot go red however much it claims. It is the exact shape removed from index.lean
--- earlier the same day (`provenHere = 0 := rfl`), written back into this file hours later by the same hand,
--- and then QUOTED as evidence that the deposit proves zero physical claims.
---
--- It was quoted wrongly twice over. The tautology was the first error. The second is that the claim was
--- false on its own terms: captain.md offers the double torus as EARTH NAVIGATION and states sailing angles,
--- which are assertions about the world, and no theorem here bears on them. A file about ℤ/9 cannot decide
--- what a page elsewhere in the repository asserts.
---
--- So the refusal is not restated here as arithmetic. Where it belongs is a check that reads the corpus and
--- can fail — scripts/contradictions.ts sweeps every markdown and source file in the deposit's own voice —
--- and where THAT is silent, as it is on navigation, the honest record is that nothing checks it yet rather
--- than a theorem implying something does.
-
-theorem the_table_is_closed_and_that_is_all_this_file_decides :
-  entries.all (fun e => statusOf e == 0 || statusOf e == 1)
-  ∧ entries.length = 9
-  ∧ (entries.filter (fun e => statusOf e == 0)).length = 7 := by decide
-
-end Phenomena

package/src/proof/priorart.lean

@@ -1,190 +0,0 @@
--- title: Prior art, and what novelty is claimed
--- wing: the record
--- prior_art: unclassified
--- prior_art_search: literature search PERFORMED 2026-09-05, terms "provenance metadata schema prior art
---   classification per-file attribution taxonomy research software credit". Prior art found and named below.
---   This row stays kind 1 — see why, because the taxonomy does not fit and forcing it would be the lie.
--- prior_art_note: THE PRACTICE IS PRIOR ART AND IS CREDITED. Recording provenance and attribution per
---   artefact is long established and formalised: W3C PROV-O, the DataCite metadata schema, Dublin Core
---   Metadata Terms, PREMIS for archived digital objects, the Open Provenance Model, and the software
---   citation principles' credit-and-attribution requirement. Nothing about keeping an attribution table is
---   new, and this deposit does not suggest otherwise.
---
---   THE PROPOSITIONS ARE NOT RESTATEMENTS OF IT. `every_source_is_classified`, `novelty_is_claimed_of_no_
---   source` and `zero_claims_is_not_full_attribution` decide facts about THIS table — its rows, its kinds,
---   its counts. PROV-O does not entail them and could not; no external work precedes a statement about the
---   contents of this file.
---
---   SO THE TAXONOMY HAS A GAP, AND IT IS NAMED RATHER THAN PAPERED OVER. Kind 0 would say these theorems
---   restate named work, which is false. Kind 2 requires a search that found NOTHING, and this one found a
---   great deal. Kind 1 as originally written means "no search performed", which is no longer true either.
---   The row remains kind 1 because kind 1 claims nothing, and claiming nothing is still correct — but it is
---   now unclassified having been SEARCHED, which is a different state from unclassified for want of looking,
---   and the deposit should not let those two look alike in a count.
--- prior_art_pool: unbounded
---   the subject is this deposit's own attribution table.
---   BOUNDED means a search is well posed and simply has not been run — the row is unclassified because
---   nobody looked. UNBOUNDED means the subject is this artifact, so there is no pool to search and the
---   row will stay unclassified however much work is done. They look identical in a count and need
---   opposite responses, which is the distinction uuidna-49 asked for and nobody had drawn.
--- prior_art_own: this file, about this deposit's own claim
--- What this deposit claims as its own, what it restates from named prior art, and the boundary between them.
--- Author: Tsvetan Rouschev · License: CC BY-NC-ND 4.0
---
--- "Claim all without prior art" has an exact reading and a dishonest one. The dishonest one asserts NOVELTY:
--- that no earlier work states these results. Nothing in this repository can decide that. A kernel decides
--- propositions over finite domains; it cannot search the literature, and no amount of computation here turns
--- "the author found none" into "none exists". That claim is refused below, as a theorem, so the refusal is
--- checked on every run rather than remembered.
---
--- The exact reading claims PRIORITY, which is a different thing and is evidenced rather than asserted: a
--- dated, content-addressed publication. The DOI fixes the date; the append-only receipt chain fixes which
--- statement was published; anyone can recompute either. Priority says "this was published, in this form, by
--- this date". It does not say "nobody said it earlier", and this file does not either.
---
--- So each source file DECLARES its own status in its frontmatter, and the two sets are decided here:
---
---   named       — the file restates a result, algorithm or physical constant that has an author already.
---                 FNV-1a is Fowler, Noll and Vo, 1991. The Merkle fold is Merkle, 1979. Nim is Bouton 1901
---                 with Sprague and Grundy after him. Cassini, Lucas and Brahmagupta–Fibonacci are named in
---                 the file that proves them. The arithmetic of ℤ/9 is Euler's and Fermat's. Electrolysis and
---                 combustion are physical chemistry. NO NOVELTY IS CLAIMED OVER ANY OF IT. What is done here
---                 is to decide each over a stated finite domain, which is a contribution of verification and
---                 not of discovery.
---
---   unclassified — no prior-art search has been performed for this source. THIS IS THE DEFAULT, and it claims
---                 nothing. The first version of this file marked eleven sources "none-known" — 300 theorems —
---                 on the strength of their own self-description, without anyone having looked. Asserting that
---                 nothing earlier exists because no one went to check is the same defect as asserting a proof
---                 because no one went to read it.
---
---   none-known  — a prior-art search WAS performed, and the source names it: what was searched, where, and
---                 when. Only this kind may claim novelty, and today no source is of this kind, so the number
---                 of novelty claims this deposit makes is zero.
---
--- The declaration lives in the source files and is compared against this table by scripts/priorart.ts, so the
--- two cannot drift: a file that changes its declaration and not this table fails the build.
-
-namespace PriorArt
-
--- (id, kind, claimsNovelty)
---   kind 0 — restates named prior art; the earlier author is credited and no novelty is claimed
---   kind 1 — unclassified: no search performed, so nothing is claimed
---   kind 2 — a named search was performed and found nothing; only this kind may claim
-abbrev Source := Nat × Nat × Bool
-def idOf    (s : Source) : Nat  := s.1
-def kindOf  (s : Source) : Nat  := s.2.1
-def novelty (s : Source) : Bool := s.2.2
-
--- One row per .lean file, in the order scripts/priorart.ts reads them.
-def sources : List Source :=
-  [ (1,  0, false)   -- address.lean      — composes FNV-1a (Fowler, Noll, Vo, 1991) with the Merkle hash tree (Merkle, 1979)
-  , (2,  0, false)   -- coin.lean         — the reflection d ↦ 10 − d is the TEN'S COMPLEMENT, and its sibling 9 − d the nines' complement — the method of complements, used to turn subtraction into addition in Pascal's calculator (1642), the Comptometer and the Curta, and in modern computer arithmetic. That it is an involution with a single fixed point is the property those machines rely on. Searched 2026-09-04, term "method of complements / nines' complement / ten's complement"; prior art found and credited
-  , (3,  0, false)   -- demand.lean       — the named results the search data asks for — Bézout’s identity (Étienne Bézout, 1779; Bachet, 1624), the Chinese remainder theorem (Sunzi, c. 3rd–5th century), and others named in their theorems
-  , (4,  0, false)   -- demand2.lean      — Wilson’s theorem — John Wilson; first proved by Joseph-Louis Lagrange, 1771; the Catalan conjecture on consecutive perfect powers — Eugène Catalan, 1844; proved by Preda Mihăilescu, 2002
-  , (5,  0, false)   -- demand3.lean      — Legendre’s three-square theorem — Adrien-Marie Legendre, 1797; Carmichael numbers — Robert Carmichael, 1910; amicable pairs — known to antiquity
-  , (6,  0, false)   -- elementary.lean   — Euclid (Elements IX.36) and Euler for the even perfect numbers; the amicable pair (220, 284) is attributed to Pythagoras; Eisenstein for the ring ℤ[ω]; Bouton (1901) for the subtraction game's losing positions. None of these results is this deposit's. What is this deposit's is the DECISION of each over a stated finite range, axiom-free, and the honest record of where the range stops short of what the older claim asserted.
-  , (7,  0, false)   -- energy.lean       — the laws of electrolysis — Michael Faraday, 1834; the enthalpy of combustion of hydrogen, standard physical chemistry
-  , (8,  0, false)   -- families.lean     — quantifies the ℤ/9 arithmetic above; the underlying results are Fermat’s, Euler’s and Gauss’s
-  , (9,  0, false)   -- flow.lean        — the order of 2 modulo 9 is six (Euler, φ(9) = 6): 2⁶ = 64 ≡ 1 (mod 9), textbook; credited
-  , (10, 0, false)   -- fnv.lean          — FNV-1a — Glenn Fowler, Landon Curt Noll and Phong Vo, 1991
-  , (11, 0, false)   -- generated.lean    — the structure underneath is standard and is credited. The doubling orbit 1 → 2 → 4 → 8 → 7 → 5 → 1 modulo 9 is the cyclic group generated by 2 in U(9), of order 6 because that is the multiplicative order of 2 mod 9; the units are {1,2,4,5,7,8} and the non-units {0,3,6}. Textbook abstract algebra, and treated directly in the literature on doubling maps modulo odd integers. Bounded, so the credit stops where the earlier work does: what is NOT prior art is the generator that enumerates propositions over this ring and discards the ones true of every sibling; that machinery is this deposit's own. Verification by exhaustion in Lean is this deposit's contribution, and verification is not discovery.
-  , (12, 0, false)   -- imagined.lean     — the doubling orbit 1,2,4,8,7,5 is the cyclic group U(9), which is cyclic of order 6 generated by 2, with units {1,2,4,5,7,8} = φ(9); 2 and 5 are its only generators. Standard elementary number theory, in Gauss and in every abstract-algebra text. The closure statements quantify that structure. Searched 2026-09-04, term "multiplicative group of units mod 9 cyclic order 6 generated by 2"; prior art found and credited
-  , (13, 0, false)   -- index.lean        — the structure underneath is standard and is credited. The doubling orbit 1 → 2 → 4 → 8 → 7 → 5 → 1 modulo 9 is the cyclic group generated by 2 in U(9), of order 6 because that is the multiplicative order of 2 mod 9; the units are {1,2,4,5,7,8} and the non-units {0,3,6}. Textbook abstract algebra, and treated directly in the literature on doubling maps modulo odd integers. Bounded, so the credit stops where the earlier work does: what is NOT prior art is the use of that orbit as a floor for what this deposit does and does not settle, which is a statement about this repository and has no earlier author. Verification by exhaustion in Lean is this deposit's contribution, and verification is not discovery.
-  , (14, 0, false)   -- involution.lean   — that a permutation of order two decomposes a finite set into fixed points and transpositions, and that the number of fixed points therefore matches the parity of the set, is classical and long predates this deposit. It is the orbit-counting argument in any first course. What is this deposit's own here is the EXHAUSTIVE decision over ℤ/9 and the measured refusal below.
-  , (15, 0, false)   -- ledgerclaims.lean — `membership_grows_by_one_seal_per_doubling` and `membership_is_logarithmic_not_linear` restate the O(log n) membership proof of a hash tree — Ralph Merkle, 1979 (thesis); CRYPTO 1987 — which merkle.lean in this same deposit already credits. Classified `unbounded` on the ground that the subject is this deposit's own ledger; the ledger is its own, the logarithm is not. Bounded: what is not prior art is what THIS ledger claims — the 967-receipt case, the saving arithmetic, and the 128-bit seal width as this deposit mints it.
-  , (16, 0, false)   -- light.lean        — the exact numerical values below are DEFINITIONS adopted by the Conférence Générale des Poids et Mesures, not results of this deposit: the metre from the speed of light (17th CGPM, 1983) and the seven defining constants fixed exactly in the 2019 revision of the SI, effective 20 May 2019 (BIPM, https://www.bipm.org/en/measurement-units/si-defining-constants). Nothing here measures anything.
-  , (17, 0, false)   -- mechanical.lean   — the Boolean rows are De Morgan's laws — Augustus De Morgan, 1847 — written in the arithmetic of {0,1}; the group rows are the additive group of Z/9. Both long prior. Searched 2026-09-04, terms "De Morgan's laws boolean algebra" and "additive group mod 9"; prior art found and credited
-  , (18, 0, false)   -- merkaba.lean      — the partition into {3,6,9} and two three-element classes closed under doubling is the subgroup and coset structure of Z/9 under the action of U(9); Lagrange. One theorem already credits Euler for the polyhedron formula. Searched 2026-09-04; prior art found and credited
-  , (19, 0, false)   -- merkle.lean       — the hash tree — Ralph Merkle, 1979 (thesis); CRYPTO 1987
-  , (20, 0, false)   -- nim.lean          — Nim — Charles L. Bouton, 1901; the Sprague–Grundy theorem — Roland Sprague, 1935 and Patrick M. Grundy, 1939
-  , (21, 0, false)   -- phenomena.lean    — the SI base quantities and their defining constants are definitions of the Conférence Générale des Poids et Mesures (2019 revision, effective 20 May 2019); the electrochemical results are Michael Faraday's laws of electrolysis, 1834, and the standard enthalpy of combustion of hydrogen. Every physical result named here has an earlier author or a standards body, and none is this deposit's.
-  , (22, 1, false)   -- priorart.lean     — this file, about this deposit's own claim
-  , (23, 0, false)   -- quantum.lean      — sorting a multiset into a canonical order BEFORE folding it is standard practice, not a discovery here. Sorted-leaf Merkle trees are the recommended construction for multiproofs and are shipped that way in OpenZeppelin's merkle-tree library; canonical ordering before hashing is long-established in cryptographic serialisation generally. The mathematical content is elementary: any function of a canonical form is invariant under permutation of its input, which is why `receipt_is_order_invariant` holds. What this file contributes is the Lean verification over a stated finite domain and the negative controls beside it — `naive_fold_is_not_order_invariant` shows the property is bought by the sort and not free, and `the_receipt_is_not_injective` and `the_invariance_is_canonicalisation_not_physics` state its limits. Verification and refusal, not discovery.
-  , (24, 0, false)   -- reach.lean        — that no finite set contains every natural number is Euclid's argument in form and is as old as mathematics; the deposit claims none of it. What is its own here is the decision over its OWN bounds, and the statement of where that decision stops.
-  , (25, 0, false)   -- recovered.lean    — every fact here is standard: the units of ℤ/9 are {1,2,4,5,7,8}, their product is −1 (Wilson), 2 generates them with order 6, and the Pisano period of Fibonacci mod 9 is 24. Textbook material, credited. What is NOT prior art is that these particular statements sat WITHDRAWN in this deposit's ledger, each recorded as "not backed by a Lean proof. Its evidence is a TypeScript test", while every one is decidable in a line.
-  , (26, 0, false)   -- reversal.lean     — digit reversal and digit sums; casting out nines, in use by the 12th century
-  , (27, 0, false)   -- rights.lean       — this file already NAMED its prior art in prose while the attribution table recorded none. The legal instruments are external and long-standing: the Berne Convention Art. 5(2) ("the enjoyment and the exercise of these rights shall not be subject to any formality"), the moral rights of Art. 6bis, and the sui generis database right of Directive 96/9/EC. `claims_exactly_what_arises_without_formality` and `the_claimed_are_copyright_moral_rights_and_the_database` rest entirely on them. Bounded: what is not prior art is the enumeration of instruments FOR THIS DEPOSIT and the decision, by exhaustion, that the set it claims is exactly the without-formality set. The law is not this deposit's; the audit of its own position against the law is.
-  , (28, 0, false)   -- sequences.lean    — Cassini’s identity — G. D. Cassini, 1680; Lucas sequences — Édouard Lucas, 1878; the Brahmagupta–Fibonacci identity — Brahmagupta, 628; Pascal’s triangle mod 2 — Blaise Pascal, 1654
-  , (29, 0, false)   -- speed.lean        — the structural claim is Merkle's and is credited here as merkle.lean already credits it: a hash tree over n leaves has an O(log n) membership proof, so the inclusion path at each power of two is exactly the exponent. Ralph Merkle, 1979 (thesis); CRYPTO 1987. `the_verify_path_is_the_exponent`, `membership_is_logarithmic_not_linear` and `the_gap_widens_with_every_doubling` RESTATE that property. This file was classified `unbounded` — "the subject is this deposit's own verification cost" — which was wrong: the cost is logarithmic BECAUSE of a known result, and the repository was already crediting that result three files away. Bounded: what is not prior art is the MEASURED constants on this machine (recompute 21,582,900 µs against a 38 µs walk) and the arithmetic over them. A measurement is not a discovery either, and the file says so.
-  , (30, 0, false)   -- split.lean        — the classification this file rests on is standard and is credited: the units of ℤ/9 are {1,2,4,5,7,8} and the non-units {0,3,6}, exactly the residues coprime to 9. That is textbook abstract algebra — Wikipedia's "multiplicative group of integers modulo n", and every algebra course. So `the_singles_are_exactly_the_non_units` and `the_pairs_are_exactly_the_units_in_order` RESTATE known mathematics and claim nothing. Stated precisely so the credit does not run past the earlier work: what is NOT claimed as prior art is the tokenisation itself — reading the digits as 0|12|3|45|6|78|9 by concatenating consecutive units into two-digit tokens, and the arithmetic that follows from it (every token a multiple of three, closure of the tokens under addition and multiplication). That arrangement is this deposit's presentation of a standard fact, and its verification is by exhaustion here. Crediting an earlier author for a presentation they did not make is the same defect as claiming their result, pointed the other way.
-  , (31, 0, false)   -- theorems.lean     — the universal reflection here is the same ten's complement d ↦ 10 − d as coin.lean, with its centre and its pairs summing to ten. Method of complements, long prior to this deposit. Searched 2026-09-04
-  , (32, 0, false)   -- z9.lean           — Fermat’s little theorem — Pierre de Fermat, 1640; Euler’s theorem — Leonhard Euler, 1763; primitive roots — Carl Friedrich Gauss, 1801
-  , (33, 0, false)   -- z9plus.lean       — digital roots (casting out nines) — in use by the 12th century; the Pisano period — after Leonardo Pisano; studied by Joseph-Louis Lagrange, 1774
-  ]
-
--- ── THE CLAIM. Only a source that names a completed search may claim, and none does ─────────────────────
--- The rule and the state are separate theorems on purpose. The first says what would have to be true for a
--- claim to be legitimate; the second says how many claims exist today. Stating only the second would leave
--- the rule to prose, and stating only the first would leave the reader to assume the count.
-theorem novelty_is_claimed_only_where_a_search_was_performed :
-  sources.all (fun s => novelty s == false || kindOf s == 2) := by decide
-
-theorem this_deposit_claims_no_novelty_today :
-  (sources.filter novelty).length = 0 := by decide
-
--- ── WHICH sources, not how many ──────────────────────────────────────────────────────────────────────────
-theorem the_restated_sources_are_named_and_claim_nothing :
-  (sources.filter (fun s => kindOf s == 0)).all (fun s => novelty s == false) := by decide
-
-theorem an_unsearched_source_claims_nothing :
-  (sources.filter (fun s => kindOf s == 1)).all (fun s => novelty s == false) := by decide
-
-theorem every_source_is_classified :
-  sources.all (fun s => kindOf s == 0 || kindOf s == 1 || kindOf s == 2) := by decide
-
-theorem the_kinds_cover_every_source :
-  (sources.filter (fun s => kindOf s == 0)).length + (sources.filter (fun s => kindOf s == 1)).length
-    + (sources.filter (fun s => kindOf s == 2)).length = sources.length := by decide
-
--- ── ZERO CLAIMS IS NOT FULL ATTRIBUTION ─────────────────────────────────────────────────────────────────
--- A count of zero novelty claims, stated on its own, reads as though the deposit concedes that everything in
--- it already has an author. It does not, and it must not be read that way: 21 of the 22 attributed works
--- predate the DOI system entirely — Fermat 1640, Euler 1763, Bouton 1901 — so "every theorem has registered
--- prior art" is not merely unproven here, it is impossible. And the larger part of the deposit has had NO
--- search at all, so its status is unknown rather than conceded.
---
--- The zero therefore has exactly one meaning: nobody has looked. It is a statement about work not done, not
--- about work found. These two propositions must always be read together, so the kernel decides them together.
---
--- ── IS CLAIMING NOTHING ITSELF AN UNDERCLAIM? ASKED, SEARCHED, AND ANSWERED NO. ─────────────────────────
--- Every source here is kind 0 and no source claims novelty, on the stated ground that verification is not
--- discovery. That policy deserved the same scrutiny as a boast, because an under-claim misrepresents the
--- record exactly as an over-claim does — it just fails in the direction nobody audits.
---
--- The argument against the policy is real: formal verification of KNOWN mathematics is a recognised
--- contribution in its own right — Flyspeck, the Four Colour Theorem in Coq, mathlib itself — so a deposit
--- that machine-checks known results and claims nothing might be giving away work it actually did. This
--- taxonomy has no slot for "restates known mathematics AND contributes a formalisation that did not exist".
---
--- So the question was put to the literature on 2026-09-05, terms "Lean 4 mathlib ZMod 9 units group
--- formalization decide finite modular arithmetic". Mathlib already carries ZMod n, IsUnit, cyclic group
--- structure and the general machinery these facts follow from, across some 232,000 theorems. The
--- FORMALISATION is therefore not new either, and the policy stands — not by assumption, which is how it
--- stood until today, but by a search that could have overturned it and did not.
---
--- What remains distinctive here is a METHOD and not a result: axiom-free, Mathlib-free, closing by decide
--- over stated finite domains. A method is not a discovery, and this file goes on claiming nothing.
-theorem some_sources_are_unsearched :
-  (sources.filter (fun s => kindOf s == 1)).length > 0 := by decide
-
-theorem zero_claims_is_not_full_attribution :
-  (sources.filter novelty).length = 0 ∧ (sources.filter (fun s => kindOf s == 1)).length > 0 := by decide
-
--- ── THE REFUSAL, stated as a theorem so it is checked and not merely written ─────────────────────────────
--- The Clay floor is measured over the tree, not certified by a constant — index.lean used to declare
--- `provenHere := 0` and prove it by `rfl`, and that was removed because a theorem deciding that a typed
--- literal equals itself certifies a declaration and not the world. THIS IS DIFFERENT, and the difference is
--- worth stating so the two are not confused: the number of results
--- here whose novelty has been ESTABLISHED — shown, by search, to have no earlier statement anywhere — is
--- zero. "No prior art known to the author" is a fact about the author. "No prior art exists" is a fact about
--- the world, and nothing in this repository can decide it. A reader who takes the claimed set as a claim of
--- originality has been misled, so the deposit says so here, in the layer that is checked.
--- `def noveltyEstablished : Nat := 0` stood here, decided against its own literal — a refusal certifying
--- itself, which is the worst place for this defect, because a refusal is the line a reader trusts without
--- checking it. Establishment is an act performed OUTSIDE this file (a search, with a result), so nothing
--- declared inside it can witness the count. What survives is the conjunct that reads a real list.
-theorem novelty_is_claimed_of_no_source :
-  (sources.filter novelty).length = 0 := by decide
-
-end PriorArt

package/src/proof/quantum.lean

@@ -1,159 +0,0 @@
--- title: Order-invariance
--- wing: the floor
--- prior_art: named
--- prior_art_domain: canonical forms and order-invariant commitments
--- prior_art_note: sorting a multiset into a canonical order BEFORE folding it is standard practice, not a
---   discovery here. Sorted-leaf Merkle trees are the recommended construction for multiproofs and are shipped
---   that way in OpenZeppelin's merkle-tree library; canonical ordering before hashing is long-established in
---   cryptographic serialisation generally. The mathematical content is elementary: any function of a canonical
---   form is invariant under permutation of its input, which is why `receipt_is_order_invariant` holds. What
---   this file contributes is the Lean verification over a stated finite domain and the negative controls
---   beside it — `naive_fold_is_not_order_invariant` shows the property is bought by the sort and not free,
---   and `the_receipt_is_not_injective` and `the_invariance_is_canonicalisation_not_physics` state its limits.
---   Verification and refusal, not discovery.
--- prior_art_search: literature search performed 2026-09-05, terms "sorted Merkle tree order-invariant set
---   commitment canonical ordering leaves"; prior art found and credited. This file was `unclassified` — no
---   search had ever been run for it — and it is one of the 8 files whose 86 theorems are staged for DOIs.
--- prior_art_pool: mixed
---   canonicalisation before folding is a searchable technique; the receipt it folds is ours.
---   BOUNDED means a search is well posed and simply has not been run — the row is unclassified because
---   nobody looked. UNBOUNDED means the subject is this artifact, so there is no pool to search and the
---   row will stay unclassified however much work is done. They look identical in a count and need
---   opposite responses, which is the distinction uuidna-49 asked for and nobody had drawn.
--- prior_art_own: order-invariance of this deposit's receipt
--- The quantum receipt — order invariance, proved rather than asserted.
--- Author: Tsvetan Rouschev · License: CC BY-NC-ND 4.0
---
--- "Quantum" here is a STRUCTURAL claim and nothing more: a set of perspectives held at once (superposition),
--- each collapsing to one observation, and a receipt that is the SAME for every observer regardless of the
--- order they observe in. No hardware, no speedup, no physics. The deposit asserted this order-invariance in
--- prose and in TypeScript; it is proved here, by decide, over every permutation — no anchors, no axioms,
--- no Mathlib.
---
--- It also proves the CONTRAST: an order-dependent fold is genuinely not invariant. Without that, the
--- invariance theorem could hold vacuously for a fold that ignores its input, which is the failure mode this
--- file exists to avoid. Integrity, not truth.
-
-namespace Quantum
-
-/-- Every way of inserting x into a list — the branch step of the permutation tree. -/
-def insertEverywhere (x : Nat) : List Nat → List (List Nat)
-  | [] => [[x]]
-  | y :: ys => (x :: y :: ys) :: (insertEverywhere x ys).map (fun l => y :: l)
-
-/-- All orderings of a list: every observer's order, enumerated. -/
-def perms : List Nat → List (List Nat)
-  | [] => [[]]
-  | x :: xs => (perms xs).flatMap (insertEverywhere x)
-
-/-- Insertion into a sorted list. -/
-def ins (x : Nat) : List Nat → List Nat
-  | [] => [x]
-  | y :: ys => if x ≤ y then x :: y :: ys else y :: ins x ys
-
-/-- The canonical order — what the fold imposes before combining. -/
-def sort : List Nat → List Nat
-  | [] => []
-  | x :: xs => ins x (sort xs)
-
-/-- The RECEIPT: canonicalise, then combine. Sorting first is exactly what makes it observer-independent. -/
-def receipt (l : List Nat) : Nat := (sort l).foldl (fun a b => (a * 2 + b) % 9) 0
-
-/-- The same combination WITHOUT canonicalising — order-dependent by construction, kept as the control. -/
-def naive (l : List Nat) : Nat := l.foldl (fun a b => (a * 2 + b) % 9) 0
-
--- ── 1 · the enumeration is complete: four elements have 4! = 24 orderings ──
-theorem perms_of_four_is_factorial : (perms [1, 2, 4, 8]).length = 24 := by decide
-
--- ── 2 · THE QUANTUM RECEIPT: every observer order yields the same receipt ──
-theorem receipt_is_order_invariant :
-  (perms [1, 2, 4, 8]).all (fun p => receipt p == receipt [1, 2, 4, 8]) := by decide
-
--- ── 3 · the same, on the doubling orbit itself (six elements, 720 orderings). The default recursion depth
---        is raised because the enumeration is larger, not because anything is assumed: `decide` still walks
---        every one of the 720 orderings and the kernel still checks the result. ──
-set_option maxRecDepth 8000 in
-theorem receipt_order_invariant_on_the_orbit :
-  (perms [1, 2, 4, 8, 7, 5]).all (fun p => receipt p == receipt [1, 2, 4, 8, 7, 5]) := by decide
-
--- ── 4 · THE CONTRAST — the invariance is not vacuous: drop canonicalisation and it fails ──
-theorem naive_fold_is_not_order_invariant :
-  ¬ ((perms [1, 2, 4, 8]).all (fun p => naive p == naive [1, 2, 4, 8])) := by decide
-
--- ── 5 · superposition and collapse, stated exactly: many perspectives, one receipt, and the count of
---        distinct receipts across all orderings is one ──
-theorem superposition_collapses_to_one :
-  ((perms [1, 2, 4, 8]).map receipt).eraseDups.length = 1 := by decide
-
--- ── 6 · THE MECHANISM, named. The invariance above is not a property of observation; it is canonicalisation.
---        Every ordering sorts to the SAME list, and the receipt reads only that. Saying so removes the last
---        room for reading the file as a claim about physics: nothing here is quantum, it is a sort. ──
-theorem the_invariance_is_canonicalisation_not_physics :
-  (perms [1, 2, 4, 8]).all (fun p => sort p == sort [1, 2, 4, 8]) := by decide
-
--- ── 7 · THE LIMIT, proved rather than admitted. The receipt lands in ℤ/9, so nine values must cover every
---        possible set — by pigeonhole it CANNOT identify one. Here are two different multisets sharing a
---        receipt. Counted exactly: 45 distinct two-element multisets over the digits produce 9 receipts, so
---        five sets share each value on average. Order-invariant does not mean collision-free, and a receipt
---        that cannot tell 45 things apart must never be read as naming one of them. ──
-def pairsOverNine : List (List Nat) :=
-  ((List.range' 1 9).flatMap (fun a => (List.range' 1 9).map (fun b => sort [a, b]))).eraseDups
-
-theorem the_receipt_is_not_injective :
-  pairsOverNine.length = 45 ∧ (pairsOverNine.map receipt).eraseDups.length = 9 := by decide
-
--- ── 8 · HOW BADLY order matters without the sort — counted, not gestured at. Across the same 24 orderings the
---        control fold returns 5 different answers, which is the size of the problem the sort solves. The first
---        draft of this theorem guessed 9 and the kernel refuted it; the number is measured now. A contrast
---        stated as a measured number cannot be softened later. ──
-theorem the_uncanonicalised_fold_gives_many_answers :
-  ((perms [1, 2, 4, 8]).map naive).eraseDups.length = 5 := by decide
-
--- ── WHAT THIS FILE SETTLES, stated positively. Two earlier names here were wrong in the same direction:
---    "quantum_settles_nothing" is refuted by the file itself, and "settles_no_clay_conjecture" states a negative
---    where the true statement is positive. Every theorem above is EXHAUSTIVE over its domain — every residue,
---    both directions of each iff, every one of the permutations, negatives proved rather than declared. Within
---    every ordering of a finite list there is no residual uncertainty: these are settled, totally.
-def settledHere : Nat := 11
-theorem quantum_settles_its_domain_totally : settledHere = 11 := rfl
-
--- ── WHAT THE REPORTED STATISTICS CANNOT TELL YOU ────────────────────────────────────────────────────────
---
--- uuidna's exact state-vector simulator reports, for a GHZ state, the outcome distribution and the
--- per-qubit marginals. Both were measured through it (receipts c292e1c8, e6e3aa09, e049c094) and the
--- marginals are 1/2 for every qubit — for GHZ, for a classical mixture, and for a product state alike.
---
--- MARGINALS NEVER DISCRIMINATE. A coin that flips all n bits together produces the SAME computational-basis
--- outcomes as GHZ, {0…0 : 1/2, 1…1 : 1/2}, and the same marginals. Nothing in the reported statistics
--- separates the entangled state from the classical correlation it is named for.
---
--- Measured in the X basis (a Hadamard on every qubit before reading) they separate completely, and that IS
--- decidable here: GHZ_3 lands only on EVEN-PARITY strings, four of the eight, while each computational
--- basis state spreads over all eight — so a mixture of them covers both parities.
-def bit (n i : Nat) : Nat := n / (2 ^ i) % 2
-def par3 (n : Nat) : Nat := (bit n 0 + bit n 1 + bit n 2) % 2
-
--- The four outcomes the simulator returned for GHZ_3 under H⊗3: 000, 011, 101, 110.
-def ghzXSupport : List Nat := [0, 3, 5, 6]
-
-theorem the_ghz_x_support_is_exactly_the_even_parity_strings :
-  (List.range 8).filter (fun n => par3 n == 0) = ghzXSupport := by decide
-
--- And it is HALF of them — so the measurement carries one bit that the computational basis does not.
-theorem it_is_half_of_the_eight :
-  ghzXSupport.length = 4 ∧ (List.range 8).length = 8 := by decide
-
--- The discriminating fact: a classical mixture spreads over BOTH parities, so a parity that is always even
--- is a fact about the state and not about the reporting. Odd-parity strings exist and GHZ never reaches them.
-theorem a_classical_mixture_reaches_the_parity_ghz_never_does :
-  ((List.range 8).filter (fun n => par3 n == 1)).length = 4
-  ∧ ((List.range 8).filter (fun n => par3 n == 1)).all (fun n => ¬ ghzXSupport.contains n) := by decide
-
--- A theorem named `the_witness_is_about_the_state_not_the_machine` stood here and is DELETED. It decided
--- `4 * 2 = 8 ∧ 2 ^ 3 = 8` — trivial arithmetic — under a name making a claim about states versus machines
--- that the proposition does not touch. The bound it wanted to state is real and is prose: the witness above
--- is a property of the SIMULATION, computed classically over 2^n exact amplitudes, and nothing in it runs
--- faster than the arithmetic that produced it. A sentence saying so is honest; the same sentence with
--- `:= by decide` after unrelated arithmetic is not.
-
-end Quantum

package/src/proof/reach.lean

@@ -1,105 +0,0 @@
-set_option maxRecDepth 8000000
--- title: What exhaustion reaches, and what lies outside it
--- wing: the floor
--- prior_art: named
--- prior_art_domain: elementary set theory — the naturals are not exhausted by any finite list
--- prior_art_note: that no finite set contains every natural number is Euclid's argument in form and is as
---   old as mathematics; the deposit claims none of it. What is its own here is the decision over its OWN
---   bounds, and the statement of where that decision stops.
---
--- THE QUESTION, asked directly: does a `by decide` proof of a Clay conjecture exist in this deposit?
---
--- The honest way to answer is not prose. `by decide` proves a proposition by walking its domain and
--- reporting what it found; it needs a Decidable instance, and it gets one by the domain being finite. Every
--- theorem in this tree is of that kind, and the largest domain any of them walks is 152,568,360,000 cases.
--- Each of the seven Clay conjectures quantifies over an infinite set. So the question is whether an
--- exhaustion can reach past its own bound.
---
--- It cannot, and that is decided below at fifty bounds: for each n, walking the first n naturals does not
--- reach n. Not once, at a flattering bound — at every one of them.
---
--- WHAT IS NOT PROVED HERE, said as plainly as what is. This decides the statement AT FIFTY BOUNDS. The
--- universal "for every n" needs induction, and induction is not exhaustion — it is the tactic this deposit
--- does not use, because its rule is that a theorem walks its domain. So the file demonstrates the boundary
--- at every bound it checks and does not claim the quantifier. A reader who wants the universal has it from
--- Euclid and does not need this deposit for it.
---
--- The answer to the question, then: no. Not because the seven are hard, and not because the effort was not
--- made — because the method reaches exactly as far as it counts, and a conjecture over an infinite domain
--- lies outside every count. That is a fact about `decide`, not a verdict on the conjectures.
-
-namespace Reach
-
-def bounds : List Nat := List.range' 1 50
-
--- ── 1 · AN EXHAUSTION DOES NOT REACH ITS OWN BOUND ──────────────────────────────────────────────────────
--- Walking the first n naturals produces exactly n of them, and n is not among them. Checked at fifty
--- bounds, so this is not one convenient n.
-theorem exhaustion_never_reaches_its_own_bound :
-  bounds.all (fun n => (List.range n).length == n && ¬ (List.range n).contains n) := by decide
-
--- ── 2 · AND SOMETHING ALWAYS LIES OUTSIDE ───────────────────────────────────────────────────────────────
--- The successor of the bound is outside the walk, at every bound checked. This is the shape of the whole
--- limit: whatever finite domain a theorem here exhausts, the naturals continue past it.
-theorem the_successor_of_every_bound_lies_outside :
-  bounds.all (fun n => ¬ (List.range n).contains (n + 1)) := by decide
-
--- ── 3 · GROWING THE BOUND DOES NOT CLOSE THE GAP ────────────────────────────────────────────────────────
--- Doubling the domain leaves the same hole. An exhaustion is not made complete by being made larger, which
--- is why no amount of compute turns this method into a proof over an infinite domain.
-theorem doubling_the_domain_leaves_the_same_hole :
-  bounds.all (fun n => ¬ (List.range (2 * n)).contains (2 * n)) := by decide
-
--- ── 4 · THE DEPOSIT'S OWN LARGEST DOMAIN IS STILL A BOUND ───────────────────────────────────────────────
--- 152,568,360,000 is the largest case-count any theorem in this tree walks. It is enormous and it is finite,
--- and the naturals do not stop there. Stated as a LAW with its inverse — the successor leaves every bound, the
--- predecessor brings it back, and the step flips parity — decided at every bound above AND at the largest
--- domain, so the number is an instance of the law rather than a value read back (2026-09-14).
-def largestDomainHere : Nat := 152568360000
-
-theorem the_successor_leaves_every_domain_and_the_predecessor_returns :
-  (bounds ++ [largestDomainHere]).all (fun n =>
-    n + 1 > n && (n + 1) - 1 == n && (n + 1) % 2 != n % 2) := by decide
-
--- ── AND FOR EVERY n, WHICH NO EXHAUSTION ABOVE CAN SAY. The file's point is that `decide` stops at its bound;
---    this is what goes past it: a PROOF that the predecessor returns every successor, for all naturals at once.
---    It is the only kind of statement that reaches an unbounded domain, and it rests on the standard axiom
---    propext, printed by lean.ts. ──
-theorem the_predecessor_returns_every_successor : ∀ n : Nat, (n + 1) - 1 = n := by
-  intro n; exact Nat.add_sub_cancel n 1
-
--- ── 5 · A THEOREM NAMED FOR THE CLAY PROBLEMS THAT DECIDED NOTHING ABOUT THEM — DELETED ─────────────────
--- `this_file_settles_none_of_the_seven` stood here and decided:
---
---     (bounds.filter (fun n => (List.range n).contains n)).length = 0  ∧  bounds.length = 50
---
--- `List.range n` is [0 … n-1] and NEVER contains n. The predicate is always false, the filter is always
--- empty, and the first conjunct holds for ANY list at all — it cannot fail. The second is a count. Nothing
--- in the proposition mentions a Clay problem, and the NAME asserted that this file settles none of them.
---
--- The comment above it argued it was written "rather than as a bare constant compared to itself — that
--- shape was removed from index.lean earlier and is not coming back through this door." It came back through
--- that door in a costume: an always-false predicate is a self-certifying literal one notation along, and
--- recognising the first shape did not confer recognition of the second.
---
--- THE FLOOR IS TRUE AND IS HELD WHERE IT CAN BE. That this deposit settles no Clay problem is a fact about
--- its TEXT — which theorem names and statements appear — and Lean cannot read its own text. It is decided
--- by scripts/contradictions.ts, which catches 960 Clay overclaim phrasings and is run on every commit, and
--- by claims-gate and boundaries. A refusal belongs in the layer that can observe it, and a Lean theorem
--- named for one it cannot observe is worse than no theorem: it reads as a kernel-checked proof of a
--- statement the kernel never saw.
-
-
--- ── the three bounded rows above, proved for every bound — no list of bounds ─────────────────────────────────
--- the file's own point, now without a range: no exhaustion over 0..n-1 contains n, n + 1, or (at 2n) 2n.
-theorem exhaustion_never_reaches_its_own_bound_for_every_n : ∀ n : Nat, (List.range n).length = n ∧ n ∉ List.range n := by
-  intro n
-  exact ⟨List.length_range n, fun h => Nat.lt_irrefl n (List.mem_range.mp h)⟩
-theorem the_successor_of_every_bound_lies_outside_for_every_n : ∀ n : Nat, n + 1 ∉ List.range n := by
-  intro n h
-  exact Nat.lt_irrefl n (Nat.lt_trans (Nat.lt_succ_self n) (List.mem_range.mp h))
-theorem doubling_the_domain_leaves_the_same_hole_for_every_n : ∀ n : Nat, 2 * n ∉ List.range (2 * n) := by
-  intro n h
-  exact Nat.lt_irrefl (2 * n) (List.mem_range.mp h)
-
-end Reach

package/src/proof/recovered.lean

@@ -1,56 +0,0 @@
-set_option maxRecDepth 8000000
--- title: Recovered — claims that computed and were withdrawn for want of a proof
--- wing: the returned
--- prior_art: named
--- prior_art_domain: elementary number theory — the unit group of ℤ/9
--- prior_art_note: every fact here is standard: the units of ℤ/9 are {1,2,4,5,7,8}, their product is −1
---   (Wilson), 2 generates them with order 6, and the Pisano period of Fibonacci mod 9 is 24. Textbook
---   material, credited. What is NOT prior art is that these particular statements sat WITHDRAWN in this
---   deposit's ledger, each recorded as "not backed by a Lean proof. Its evidence is a TypeScript test",
---   while every one is decidable in a line.
--- prior_art_search: literature search performed 2026-09-05, terms "units and non-units of Z/9 multiplicative
---   inverses group of units modulo 9"; prior art found and credited.
---
--- WITHDRAWAL WAS NEVER THE ONLY OPTION. Each theorem below returns one claim to the record. The evidence
--- that existed was a TypeScript run — a computation that agreed once on one machine. The kernel walks the
--- whole stated domain. That was the gap, and closing it is arithmetic.
---
--- Author: Tsvetan Rouschev · License: CC BY-NC-ND 4.0 · No axioms, no Mathlib, no sorry.
-
-namespace Recovered
-
-def units : List Nat := [1, 2, 4, 5, 7, 8]
-def triad : List Nat := [3, 6, 9]
-def pow9 (b k : Nat) : Nat := (List.range k).foldl (fun a _ => a * b % 9) 1
-
-theorem units_sum_zero : (units.foldl (· + ·) 0) = 27 ∧ (units.foldl (· + ·) 0) % 9 = 0 := by decide
-
-theorem self_inverse_1_8 :
-  ((List.range 9).filter (fun d => d * d % 9 == 1)) = [1, 8] := by decide
-
-theorem triad_nilpotent : triad.all (fun d => d * d % 9 == 0) := by decide
-
-theorem triad_sum_zero : (triad.foldl (· + ·) 0) = 18 ∧ (triad.foldl (· + ·) 0) % 9 = 0 := by decide
-
-theorem units_product_neg1 : (units.foldl (· * ·) 1) % 9 = 8 := by decide
-
-theorem order_of_2_is_6 :
-  pow9 2 6 = 1 ∧ ((List.range' 1 5).all (fun k => pow9 2 k != 1)) := by decide
-
-theorem sum_1_to_9_zero :
-  ((List.range' 1 9).foldl (· + ·) 0) = 45 ∧ ((List.range' 1 9).foldl (· + ·) 0) % 9 = 0 := by decide
-
-theorem doubling_digitroot_period6 :
-  ((List.range 6).map (fun k => pow9 2 k)) = [1, 2, 4, 8, 7, 5] ∧ pow9 2 6 = pow9 2 0 := by decide
-
-theorem unit_exp_id_k6 : units.all (fun u => pow9 u 6 == 1) := by decide
-theorem unit_exp_id_k12 : units.all (fun u => pow9 u 12 == 1) := by decide
-theorem unit_exp_id_k18 : units.all (fun u => pow9 u 18 == 1) := by decide
-
-theorem powperm_k5 : (units.map (fun u => pow9 u 5)).eraseDups.length = 6 := by decide
-theorem powperm_k7 : (units.map (fun u => pow9 u 7)).eraseDups.length = 6 := by decide
-
-theorem qr_u1 : (List.range 9).any (fun d => d * d % 9 == 1) := by decide
-theorem qr_u4 : (List.range 9).any (fun d => d * d % 9 == 4) := by decide
-
-end Recovered