diff --git a/docs/atlas/claims/bridges.jsonl b/docs/atlas/claims/bridges.jsonl index 3472ac4..ef0186d 100644 --- a/docs/atlas/claims/bridges.jsonl +++ b/docs/atlas/claims/bridges.jsonl @@ -1,2 +1,3 @@ {"basis":"read","endpoints":[{"name":"MaxPlus rows","repository":"hyperpolymath/choreographic-types","state":"AGDA-PENDING","system":"agda"},{"name":"MaxPlus instance","repository":"hyperpolymath/tropical-types","state":"NOT-INVENTORIED","system":"lean"}],"id":"choreographic-maxplus-tropical","note":"choreographic-types says the rows equal the tropical-types Lean instance; that is not proved, and the Lean side is not audited","proposed_by":"agent","relation":"unassessed","reviewed_by":null,"source":"reconciliation register of 2026-11-09 (choreographic-types row)","stage":"candidate","state":"BRIDGE-PENDING","subject":"The MaxPlus rows of choreographic-types and the MaxPlus instance of tropical-types"} {"basis":"read","endpoints":[{"name":"EchoPartialSection.agda","repository":"hyperpolymath/echo-types","state":"AGDA-VERIFIED","system":"agda"},{"name":"formal/Recovery.v","repository":"hyperpolymath/verisimdb","state":"COQ-CHECKED","system":"rocq"}],"id":"squeakwell-r3-r9-merge-laws","note":"the register read the relation as a refinement: Agda states the laws pointwise, Rocq as function equalities under funext (functional_extensionality_dep whitelisted); no checked translation. The Agda state comes from a local run of 2026-11-09 (Agda 2.7.0.1), not from a home receipt","proposed_by":"agent","relation":"unassessed","reviewed_by":null,"source":"hyperpolymath/squeakwell PROOF-STATUS.adoc, read for the reconciliation register of 2026-11-09","stage":"candidate","state":"BRIDGE-PENDING","subject":"squeakwell recovery ladder R3 and R9: guarded fill inflationary and not monotone; resolve-parametric merge commutative, associative and idempotent"} +{"basis":"proved","endpoints":[{"name":"RA.MaxPlus (verification/proofs/lean4/ResourceAlgebra.lean)","repository":"hyperpolymath/resource-algebra","state":"LEAN-CHECKED","system":"lean"},{"name":"instance : CommSemiring Tropical (TropicalSessionTypes.lean)","repository":"hyperpolymath/tropical-types","state":"NOT-INVENTORIED","system":"lean"}],"id":"resource-algebra-maxplus-tropical","note":"proved in Lean with no axiom: toHT and ofHT are inverse, and toHT sends the four MaxPlus operations to the instance fields. Agent-proposed, so the relation stays unassessed until a person reviews it; there is no Agda statement, so resource-algebra grades M-2 ungraded","proposed_by":"agent","relation":"unassessed","reviewed_by":null,"source":"hyperpolymath/resource-algebra verification/bridges/tropical-types/TropicalBridge.lean (maxplus_agrees_tropical), in the proof receipt at c31bf1a (claim M-2), importing tropical-types at f2e465c","stage":"candidate","state":"LEAN-CHECKED","subject":"resource-algebra MaxPlus (M-2) and the tropical-types instance : CommSemiring Tropical"} diff --git a/docs/atlas/claims/claims.jsonl b/docs/atlas/claims/claims.jsonl index c2330d3..6e60123 100644 --- a/docs/atlas/claims/claims.jsonl +++ b/docs/atlas/claims/claims.jsonl @@ -15,35 +15,39 @@ {"agda":{"module":"Lintel.Instance","names":["tini-per-role","tini-coalition"]},"claim":"L-6","id":"metadatastician/lintel#L-6","kind":"theorem","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"tini holds at this lattice over the address, the query name and the client's local state, for each role's observer and for any two roles observing together","status_doc":"docs/status/PROOF-STATUS.adoc"} {"agda":{"module":"Lintel.Composition","names":["writes-flow","link-written-to-client","link-written-to-local","link-writable"]},"claim":"L-7","id":"metadatastician/lintel#L-7","kind":"theorem","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"Self-defeating privacy compositions cannot be built as programs: a typed command writes a value depending on both fields only into a variable the client alone may read","status_doc":"docs/status/PROOF-STATUS.adoc"} {"agda":null,"claim":"A-1","id":"metadatastician/lintel#A-1","kind":"assumption","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"Non-collusion: no party holds both the proxy and the target role (the gap is proved: collusion-gap)","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"FeatureReachability","names":["Cargo.absent-under-all-features","Monotone.reach-mono"]},"claim":"THY-1","id":"hyperpolymath/mathesis#THY-1","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"repo":"hyperpolymath/mathesis","shelf":"theory","source_commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","statement":"In a dependency graph whose edges are guarded by features closed under Horn rules, and by an arbitrary per-target condition, a node unreachable with every feature requested is unreachable under any request, on each target (`Cargo.absent-under-all-features`). The general form is `Monotone.reach-mono`: reachability over a monotone family of edge sets is monotone.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"Applied.Missing","names":["Proofs.closing-needs","Proofs.missing-persists","Proofs.closings-missing","Proofs.verdict-yes","Proofs.breach-decides","Proofs.verdict-missing","Proofs.verdict-not-yes"]},"claim":"APP-1","id":"hyperpolymath/mathesis#APP-1","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","statement":"Missing propagates: in the cohort model, an output that depends on a missing input is missing, in every period after it too, and never zero. A verdict is \"no\" on a known breach and otherwise missing when any value it depends on is missing; it is never \"yes\" then.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"Applied.Cash","names":["Proofs.cash-identity"]},"claim":"APP-2","id":"hyperpolymath/mathesis#APP-2","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","statement":"Cash identity: the closing cash of the last period equals the opening cash plus, summed over the periods, receipts minus payments; when a value is missing, both sides are missing. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"Applied.Cash","names":["Proofs.gap-sound","Proofs.gap-least"]},"claim":"APP-3","id":"hyperpolymath/mathesis#APP-3","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","statement":"The funding gap is sound and least: adding the gap to the opening cash keeps every closing balance at or above its floor, and no smaller non-negative amount does. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"Applied.Missing","names":["Proofs.members-needs","Proofs.receipts-needs","Proofs.payments-needs","Proofs.closing-needs","Proofs.shortfall-needs","Proofs.cashOk-needs","Proofs.hours-needs","Proofs.capacityOk-needs","Proofs.gap-needs"]},"claim":"APP-4","id":"hyperpolymath/mathesis#APP-4","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","statement":"Status never upgrades: the evidence status of an output is never stronger than the weakest status of the inputs that it depends on.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Core","names":["ResourceAlgebra","IsAltMonoid.unitʳ"]},"claim":"C-1","id":"hyperpolymath/resource-algebra#C-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"`ResourceAlgebra`: alternatives form an idempotent commutative monoid and sequencing a monoid.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Core","names":["≼-refl","≼-trans","≼-antisym","𝟘-least","⊕-upperˡ","⊕-upperʳ","⊕-least"]},"claim":"C-2","id":"hyperpolymath/resource-algebra#C-2","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"The relation `≼` induced by ⊕ is a partial order. `𝟘` is least and `⊕` is its join.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Core","names":["IsDioid.ordered"]},"claim":"C-3","id":"hyperpolymath/resource-algebra#C-3","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"Every dioid is ordered: distributivity makes `⊗` monotone on both sides.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Instances.HWM","names":["HWM-dioid","HWM-not-annihilating"]},"claim":"C-4a","id":"hyperpolymath/resource-algebra#C-4a","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"A dioid need not be annihilating. HWM is a dioid and is not annihilating.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Instances.Loss","names":["Loss","Loss-dioid","Loss-ordered","Loss-annihilating"]},"claim":"L-1","id":"hyperpolymath/resource-algebra#L-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"`Loss` is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ = min, ⊗ = +, 𝟘 = inf and 𝟙 = fin 0.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Instances.MaxPlus","names":["MaxPlus","MaxPlus-dioid","MaxPlus-ordered","MaxPlus-annihilating"]},"claim":"M-1","id":"hyperpolymath/resource-algebra#M-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"`MaxPlus` is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ = max, ⊗ = +, 𝟘 = bot and 𝟙 = val 0.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Instances.HWM","names":["HWM","HWM-dioid","HWM-ordered"]},"claim":"H-1","id":"hyperpolymath/resource-algebra#H-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"`HWM` (peak, drift, with drift ≤ peak) is a `ResourceAlgebra`, `IsDioid` and `IsOrdered`, and 𝟘 ≡ 𝟙.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Instances.HWM","names":["HWM-not-annihilating"]},"claim":"H-3","id":"hyperpolymath/resource-algebra#H-3","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"`HWM` has no annihilating zero.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Instances.MinMax","names":["MinMax","MinMax-dioid","MinMax-ordered","MinMax-annihilating"]},"claim":"N-1","id":"hyperpolymath/resource-algebra#N-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"`MinMax` (the bottleneck algebra) is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating` on the Loss carrier. Its operations are ⊕ = min and ⊗ = max (`_⊔g_`, with `inf` absorbing), with 𝟘 = inf and 𝟙 = fin 0.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Instances.Questions","names":["Questions","Questions-dioid","Questions-ordered","Questions-annihilating"]},"claim":"Q-1","id":"hyperpolymath/resource-algebra#Q-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"`Questions n` (a \"which\" grade over `n` downstream questions) is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`. A grade is `n` booleans, `true` where a step loses that question. Its operations are ⊕ = intersection and ⊗ = union, bit by bit, with 𝟘 = every question lost and 𝟙 = none lost.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Instances.Questions","names":["same-amount-different-loss"]},"claim":"Q-2","id":"hyperpolymath/resource-algebra#Q-2","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"With two questions, `collapse` (loses question 1) and `shuffle` (loses question 0) each lose one question and are different grades: a count of lost questions cannot tell them apart.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Instances.Questions","names":["both-lost"]},"claim":"Q-3","id":"hyperpolymath/resource-algebra#Q-3","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"In sequence, `collapse` then `shuffle` loses both questions.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Instances.Questions","names":["no-branch-achieves-meet"]},"claim":"Q-4","id":"hyperpolymath/resource-algebra#Q-4","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"As alternatives, `collapse ⊕ shuffle` is 𝟙 (no question lost), while neither branch is 𝟙. So ⊕ answers \"is question i kept on some branch?\" and not \"does one branch keep every question?\".","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Morphism","names":["id-hom","_∘h_","id-lax","_∘l_","lax"]},"claim":"F-1","id":"hyperpolymath/resource-algebra#F-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"Both notions have identities and compose, and every strict morphism is lax.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Morphism","names":["peak-lax"]},"claim":"F-2","id":"hyperpolymath/resource-algebra#F-2","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"`peak : HWM → MaxPlus` is lax: the peak of a sequence never exceeds the sum of the peaks.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Morphism","names":["peak-not-strict"]},"claim":"F-3","id":"hyperpolymath/resource-algebra#F-3","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"`peak` is not strict: it does not preserve ⊗, whatever it does to the units.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Morphism","names":["no-strict-from-HWM","no-strict-HWM→MaxPlus","no-strict-HWM→Loss"]},"claim":"F-4","id":"hyperpolymath/resource-algebra#F-4","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"No strict morphism leaves HWM for an algebra with 𝟘 ≢ 𝟙. In particular, none goes to MaxPlus or to Loss.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Morphism","names":["zero-test-hom","support-hom","Loss→MaxPlus","maps-disagree-at-positive","Loss→MaxPlus-collapses","no-injective-Loss→MaxPlus"]},"claim":"F-5","id":"hyperpolymath/resource-algebra#F-5","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"Exactly two strict morphisms Loss → MaxPlus exist, `zero-test` and `support`. Neither distinguishes `fin 1` from `fin 2`.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Morphism","names":["support′-hom","MaxPlus→Loss"]},"claim":"F-6","id":"hyperpolymath/resource-algebra#F-6","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"Exactly one strict morphism MaxPlus → Loss exists, `support′`. resource-algebra#3 sketched this direction as \"symmetric\" to Loss → MaxPlus, but it is not: there is one map, not two. The issue's other claim, that every positive grade goes to a single point, holds.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Morphism","names":["loss-bottleneck"]},"claim":"F-7","id":"hyperpolymath/resource-algebra#F-7","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"The identity on the carrier is a lax morphism Loss → MinMax: a bottleneck never exceeds the sum.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Morphism","names":["one-question-hom","one-question-needs","one-question-unique"]},"claim":"F-8","id":"hyperpolymath/resource-algebra#F-8","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"Out of one question there is exactly one strict morphism into an algebra `B`: lost goes to 𝟘 and kept goes to 𝟙. It exists exactly when `B` has 𝟘 ⊗ 𝟘 ≡ 𝟘, which every annihilating algebra has, and HWM too.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Morphism","names":["first-question","later-questions"]},"claim":"F-9","id":"hyperpolymath/resource-algebra#F-9","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"Taking the first question of `Questions (suc n)`, and dropping it, are strict morphisms. Composed, they read any single question alone.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Morphism","names":["count-not-⊕"]},"claim":"F-10","id":"hyperpolymath/resource-algebra#F-10","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"The number of lost questions does not preserve ⊕: `collapse` and `shuffle` each count 1 and their ⊕ counts 0. So no map into Loss or MinMax that factors through the count is strict or lax.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Separation","names":["occupancy-is-not-cost"]},"claim":"S-1","id":"hyperpolymath/resource-algebra#S-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"Sequencing peaks 2 and 3 gives 3 under HWM and 5 under MaxPlus: an occupancy bound is not a cost bound.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Separation","names":["alternatives-differ"]},"claim":"S-2","id":"hyperpolymath/resource-algebra#S-2","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"On the same numbers, alternatives give `fin 2` under Loss and `val 3` under MaxPlus: echo's join is min, while tropical's is max.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Separation","names":["maxplus-order","loss-order-reversed"]},"claim":"S-3","id":"hyperpolymath/resource-algebra#S-3","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"`val 1 ≼ val 2` in MaxPlus but `fin 2 ≼ fin 1` in Loss: the induced orders run in opposite directions.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"ResourceAlgebra.Separation","names":["bottleneck-is-not-sum"]},"claim":"S-4","id":"hyperpolymath/resource-algebra#S-4","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"Sequencing 2 then 3 gives `fin 5` under Loss but `fin 3` under MinMax: a bottleneck bound is not a loss bound.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"FeatureReachability","names":["Cargo.absent-under-all-features","Monotone.reach-mono"]},"claim":"THY-1","id":"hyperpolymath/mathesis#THY-1","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"e57efc6832f884bc697dd2f99f0073c8d0e765fd0430c438ff604f9d199b9098"},"repo":"hyperpolymath/mathesis","shelf":"theory","source_commit":"10f9f46ff7e1c8a0433164bc8bf6d8f30842fd4c","statement":"In a dependency graph whose edges are guarded by features closed under Horn rules, and by an arbitrary per-target condition, a node unreachable with every feature requested is unreachable under any request, on each target (`Cargo.absent-under-all-features`). The general form is `Monotone.reach-mono`: reachability over a monotone family of edge sets is monotone.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"Applied.Missing","names":["Proofs.closing-needs","Proofs.missing-persists","Proofs.closings-missing","Proofs.verdict-yes","Proofs.breach-decides","Proofs.verdict-missing","Proofs.verdict-not-yes"]},"claim":"APP-1","id":"hyperpolymath/mathesis#APP-1","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"e57efc6832f884bc697dd2f99f0073c8d0e765fd0430c438ff604f9d199b9098"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"10f9f46ff7e1c8a0433164bc8bf6d8f30842fd4c","statement":"Missing propagates: in the cohort model, an output that depends on a missing input is missing, in every period after it too, and never zero. A verdict is \"no\" on a known breach and otherwise missing when any value it depends on is missing; it is never \"yes\" then.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"Applied.Cash","names":["Proofs.cash-identity"]},"claim":"APP-2","id":"hyperpolymath/mathesis#APP-2","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"e57efc6832f884bc697dd2f99f0073c8d0e765fd0430c438ff604f9d199b9098"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"10f9f46ff7e1c8a0433164bc8bf6d8f30842fd4c","statement":"Cash identity: the closing cash of the last period equals the opening cash plus, summed over the periods, receipts minus payments; when a value is missing, both sides are missing. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"Applied.Cash","names":["Proofs.gap-sound","Proofs.gap-least"]},"claim":"APP-3","id":"hyperpolymath/mathesis#APP-3","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"e57efc6832f884bc697dd2f99f0073c8d0e765fd0430c438ff604f9d199b9098"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"10f9f46ff7e1c8a0433164bc8bf6d8f30842fd4c","statement":"The funding gap is sound and least: adding the gap to the opening cash keeps every closing balance at or above its floor, and no smaller non-negative amount does. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"Applied.Missing","names":["Proofs.members-needs","Proofs.receipts-needs","Proofs.payments-needs","Proofs.closing-needs","Proofs.shortfall-needs","Proofs.cashOk-needs","Proofs.hours-needs","Proofs.capacityOk-needs","Proofs.gap-needs"]},"claim":"APP-4","id":"hyperpolymath/mathesis#APP-4","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"e57efc6832f884bc697dd2f99f0073c8d0e765fd0430c438ff604f9d199b9098"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"10f9f46ff7e1c8a0433164bc8bf6d8f30842fd4c","statement":"Status never upgrades: the evidence status of an output is never stronger than the weakest status of the inputs that it depends on.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Core","names":["ResourceAlgebra","IsAltMonoid.unitʳ"]},"claim":"C-1","id":"hyperpolymath/resource-algebra#C-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"`ResourceAlgebra`: alternatives form an idempotent commutative monoid and sequencing a monoid.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Core","names":["≼-refl","≼-trans","≼-antisym","𝟘-least","⊕-upperˡ","⊕-upperʳ","⊕-least"]},"claim":"C-2","id":"hyperpolymath/resource-algebra#C-2","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"The relation `≼` induced by ⊕ is a partial order. `𝟘` is least and `⊕` is its join.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Core","names":["IsDioid.ordered"]},"claim":"C-3","id":"hyperpolymath/resource-algebra#C-3","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"Every dioid is ordered: distributivity makes `⊗` monotone on both sides.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Instances.HWM","names":["HWM-dioid","HWM-not-annihilating"]},"claim":"C-4a","id":"hyperpolymath/resource-algebra#C-4a","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"A dioid need not be annihilating. HWM is a dioid and is not annihilating.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Instances.Loss","names":["Loss","Loss-dioid","Loss-ordered","Loss-annihilating"]},"claim":"L-1","id":"hyperpolymath/resource-algebra#L-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"`Loss` is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ = min, ⊗ = +, 𝟘 = inf and 𝟙 = fin 0.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Instances.MaxPlus","names":["MaxPlus","MaxPlus-dioid","MaxPlus-ordered","MaxPlus-annihilating"]},"claim":"M-1","id":"hyperpolymath/resource-algebra#M-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"`MaxPlus` is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ = max, ⊗ = +, 𝟘 = bot and 𝟙 = val 0.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Instances.HWM","names":["HWM","HWM-dioid","HWM-ordered"]},"claim":"H-1","id":"hyperpolymath/resource-algebra#H-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"`HWM` (peak, drift, with drift ≤ peak) is a `ResourceAlgebra`, `IsDioid` and `IsOrdered`, and 𝟘 ≡ 𝟙.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Instances.HWM","names":["HWM-not-annihilating"]},"claim":"H-3","id":"hyperpolymath/resource-algebra#H-3","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"`HWM` has no annihilating zero.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Instances.MinMax","names":["MinMax","MinMax-dioid","MinMax-ordered","MinMax-annihilating"]},"claim":"N-1","id":"hyperpolymath/resource-algebra#N-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"`MinMax` (the bottleneck algebra) is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating` on the Loss carrier. Its operations are ⊕ = min and ⊗ = max (`_⊔g_`, with `inf` absorbing), with 𝟘 = inf and 𝟙 = fin 0.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Instances.Questions","names":["Questions","Questions-dioid","Questions-ordered","Questions-annihilating"]},"claim":"Q-1","id":"hyperpolymath/resource-algebra#Q-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"`Questions n` (a \"which\" grade over `n` downstream questions) is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`. A grade is `n` booleans, `true` where a step loses that question. Its operations are ⊕ = intersection and ⊗ = union, bit by bit, with 𝟘 = every question lost and 𝟙 = none lost.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Instances.Questions","names":["same-amount-different-loss"]},"claim":"Q-2","id":"hyperpolymath/resource-algebra#Q-2","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"With two questions, `collapse` (loses question 1) and `shuffle` (loses question 0) each lose one question and are different grades: a count of lost questions cannot tell them apart.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Instances.Questions","names":["both-lost"]},"claim":"Q-3","id":"hyperpolymath/resource-algebra#Q-3","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"In sequence, `collapse` then `shuffle` loses both questions.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Instances.Questions","names":["no-branch-achieves-meet"]},"claim":"Q-4","id":"hyperpolymath/resource-algebra#Q-4","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"As alternatives, `collapse ⊕ shuffle` is 𝟙 (no question lost), while neither branch is 𝟙. So ⊕ answers \"is question i kept on some branch?\" and not \"does one branch keep every question?\".","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Morphism","names":["id-hom","_∘h_","id-lax","_∘l_","lax"]},"claim":"F-1","id":"hyperpolymath/resource-algebra#F-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"Both notions have identities and compose, and every strict morphism is lax.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Morphism","names":["peak-lax"]},"claim":"F-2","id":"hyperpolymath/resource-algebra#F-2","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"`peak : HWM → MaxPlus` is lax: the peak of a sequence never exceeds the sum of the peaks.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Morphism","names":["peak-not-strict"]},"claim":"F-3","id":"hyperpolymath/resource-algebra#F-3","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"`peak` is not strict: it does not preserve ⊗, whatever it does to the units.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Morphism","names":["no-strict-from-HWM","no-strict-HWM→MaxPlus","no-strict-HWM→Loss"]},"claim":"F-4","id":"hyperpolymath/resource-algebra#F-4","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"No strict morphism leaves HWM for an algebra with 𝟘 ≢ 𝟙. In particular, none goes to MaxPlus or to Loss.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Morphism","names":["zero-test-hom","support-hom","Loss→MaxPlus","maps-disagree-at-positive","Loss→MaxPlus-collapses","no-injective-Loss→MaxPlus"]},"claim":"F-5","id":"hyperpolymath/resource-algebra#F-5","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"Exactly two strict morphisms Loss → MaxPlus exist, `zero-test` and `support`. Neither distinguishes `fin 1` from `fin 2`.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Morphism","names":["support′-hom","MaxPlus→Loss"]},"claim":"F-6","id":"hyperpolymath/resource-algebra#F-6","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"Exactly one strict morphism MaxPlus → Loss exists, `support′`. resource-algebra#3 sketched this direction as \"symmetric\" to Loss → MaxPlus, but it is not: there is one map, not two. The issue's other claim, that every positive grade goes to a single point, holds.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Morphism","names":["loss-bottleneck"]},"claim":"F-7","id":"hyperpolymath/resource-algebra#F-7","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"The identity on the carrier is a lax morphism Loss → MinMax: a bottleneck never exceeds the sum.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Morphism","names":["one-question-hom","one-question-needs","one-question-unique"]},"claim":"F-8","id":"hyperpolymath/resource-algebra#F-8","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"Out of one question there is exactly one strict morphism into an algebra `B`: lost goes to 𝟘 and kept goes to 𝟙. It exists exactly when `B` has 𝟘 ⊗ 𝟘 ≡ 𝟘, which every annihilating algebra has, and HWM too.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Morphism","names":["first-question","later-questions"]},"claim":"F-9","id":"hyperpolymath/resource-algebra#F-9","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"Taking the first question of `Questions (suc n)`, and dropping it, are strict morphisms. Composed, they read any single question alone.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Morphism","names":["count-not-⊕"]},"claim":"F-10","id":"hyperpolymath/resource-algebra#F-10","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"The number of lost questions does not preserve ⊕: `collapse` and `shuffle` each count 1 and their ⊕ counts 0. So no map into Loss or MinMax that factors through the count is strict or lax.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Separation","names":["occupancy-is-not-cost"]},"claim":"S-1","id":"hyperpolymath/resource-algebra#S-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"Sequencing peaks 2 and 3 gives 3 under HWM and 5 under MaxPlus: an occupancy bound is not a cost bound.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Separation","names":["alternatives-differ"]},"claim":"S-2","id":"hyperpolymath/resource-algebra#S-2","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"On the same numbers, alternatives give `fin 2` under Loss and `val 3` under MaxPlus: echo's join is min, while tropical's is max.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Separation","names":["maxplus-order","loss-order-reversed"]},"claim":"S-3","id":"hyperpolymath/resource-algebra#S-3","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"`val 1 ≼ val 2` in MaxPlus but `fin 2 ≼ fin 1` in Loss: the induced orders run in opposite directions.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Separation","names":["bottleneck-is-not-sum"]},"claim":"S-4","id":"hyperpolymath/resource-algebra#S-4","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"Sequencing 2 then 3 gives `fin 5` under Loss but `fin 3` under MinMax: a bottleneck bound is not a loss bound.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Instances.Diamond","names":["Diamond","Diamond-ordered","Diamond-annihilating","Diamond-not-dioid"]},"claim":"C-4b","id":"hyperpolymath/resource-algebra#C-4b","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"An annihilating ordered algebra need not be a dioid: the diamond lattice M3 (⊕ = join, ⊗ = meet) is ordered and annihilating but not a dioid, since a ⊗ (b ⊕ c) = a while (a ⊗ b) ⊕ (a ⊗ c) = 𝟘.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Instances.Evidence","names":["Evidence","Evidence-dioid","Evidence-ordered","Evidence-annihilating","≼→≤","≤→≼","≼-proven","⊓e-lowerˡ","⊓e-lowerʳ","⊓e-greatest"]},"claim":"E-1","id":"hyperpolymath/resource-algebra#E-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"`Evidence`, the PROOF-POLICY §5 statuses as a chain (open-row < tested-only < argued < proven-with-postulates < proven), is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ the stronger and ⊗ the weaker status; ⊗ is the meet of `≼`.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Ledger","names":["eff-≼-own","eff-≼-dep","eff-≼-reach"]},"claim":"E-2","id":"hyperpolymath/resource-algebra#E-2","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"Soundness: a ledger row's derived status is no stronger than its own evidence, than any row it depends on, or than any row it reaches through dependencies.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"ResourceAlgebra.Ledger","names":["Respects","eff-respects","restrict","eff-greatest"]},"claim":"E-3","id":"hyperpolymath/resource-algebra#E-3","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"735d0044f9783c1d7fcc5443ee347e6987dd92007d4b19f36eb1705c9d4e88a7"},"repo":"hyperpolymath/resource-algebra","source_commit":"c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b","statement":"Maximality: the derived status respects the ledger, and every respectful assignment is below it row by row, so it is the strongest status the ledger supports.","status_doc":"docs/status/PROOF-STATUS.adoc"} diff --git a/docs/atlas/generated/bridges.adoc b/docs/atlas/generated/bridges.adoc index 7773f6e..c2f8496 100644 --- a/docs/atlas/generated/bridges.adoc +++ b/docs/atlas/generated/bridges.adoc @@ -10,7 +10,7 @@ stays `unassessed` until a person reviews a comparison that a home repository holds. The full record, with the commit, path and blob digest at each end, comes with re-anchoring plan WO 5.2. -Candidates: 2. +Candidates: 3. [cols="2,4,4,1,1,3",options="header"] |=== @@ -19,6 +19,9 @@ Candidates: 2. |`choreographic-maxplus-tropical` |The MaxPlus rows of choreographic-types and the MaxPlus instance of tropical-types |https://github.com/hyperpolymath/choreographic-types[hyperpolymath/choreographic-types] agda `MaxPlus rows` (AGDA-PENDING) + https://github.com/hyperpolymath/tropical-types[hyperpolymath/tropical-types] lean `MaxPlus instance` (NOT-INVENTORIED) |`unassessed` |`BRIDGE-PENDING` |reconciliation register of 2026-11-09 (choreographic-types row); choreographic-types says the rows equal the tropical-types Lean instance; that is not proved, and the Lean side is not audited +|`resource-algebra-maxplus-tropical` |resource-algebra MaxPlus (M-2) and the tropical-types instance : CommSemiring Tropical |https://github.com/hyperpolymath/resource-algebra[hyperpolymath/resource-algebra] lean `RA.MaxPlus (verification/proofs/lean4/ResourceAlgebra.lean)` (LEAN-CHECKED) + +https://github.com/hyperpolymath/tropical-types[hyperpolymath/tropical-types] lean `instance : CommSemiring Tropical (TropicalSessionTypes.lean)` (NOT-INVENTORIED) |`unassessed` |`LEAN-CHECKED` |hyperpolymath/resource-algebra verification/bridges/tropical-types/TropicalBridge.lean (maxplus_agrees_tropical), in the proof receipt at c31bf1a (claim M-2), importing tropical-types at f2e465c; proved in Lean with no axiom: toHT and ofHT are inverse, and toHT sends the four MaxPlus operations to the instance fields. Agent-proposed, so the relation stays unassessed until a person reviews it; there is no Agda statement, so resource-algebra grades M-2 ungraded + |`squeakwell-r3-r9-merge-laws` |squeakwell recovery ladder R3 and R9: guarded fill inflationary and not monotone; resolve-parametric merge commutative, associative and idempotent |https://github.com/hyperpolymath/echo-types[hyperpolymath/echo-types] agda `EchoPartialSection.agda` (AGDA-VERIFIED) + https://github.com/hyperpolymath/verisimdb[hyperpolymath/verisimdb] rocq `formal/Recovery.v` (COQ-CHECKED) |`unassessed` |`BRIDGE-PENDING` |hyperpolymath/squeakwell PROOF-STATUS.adoc, read for the reconciliation register of 2026-11-09; the register read the relation as a refinement: Agda states the laws pointwise, Rocq as function equalities under funext (functional_extensionality_dep whitelisted); no checked translation. The Agda state comes from a local run of 2026-11-09 (Agda 2.7.0.1), not from a home receipt diff --git a/docs/atlas/generated/registry.adoc b/docs/atlas/generated/registry.adoc index 89dfd2e..8ae6bea 100644 --- a/docs/atlas/generated/registry.adoc +++ b/docs/atlas/generated/registry.adoc @@ -10,75 +10,83 @@ assigned (§8.5). A grade is not a discharge (§8.4): `PWG-3` theorems still owe their Rocq and Lean legs. Status of this slice: accepted in link:../../decisions/0004-claims-registry.adoc[ADR 0004], ratified by the owner. -Census: 0 at `PWG-1`, 0 at `PWG-2ii`, 0 at `PWG-2i`, 0 at `PWG-3`, 44 `ungraded`, of 44 theorems. 5 demonstrations and assumptions are listed and not graded. +Census: 0 at `PWG-1`, 5 at `PWG-2ii`, 31 at `PWG-2i`, 0 at `PWG-3`, 12 `ungraded`, of 48 theorems. 5 demonstrations and assumptions are listed and not graded. [cols="2,1,1,4,3",options="header"] |=== |Claim |Kind |PWG |Statement (home repository's wording) |Why not higher -|https://github.com/hyperpolymath/mathesis/blob/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-1] at `58ebefbd9318` |theorem |`ungraded` |Missing propagates: in the cohort model, an output that depends on a missing input is missing, in every period after it too, and never zero. A verdict is "no" on a known breach and otherwise missing when any value it depends on is missing; it is never "yes" then. (`Applied.Missing`: `Proofs.closing-needs`, `Proofs.missing-persists`, `Proofs.closings-missing`, `Proofs.verdict-yes`, `Proofs.breach-decides`, `Proofs.verdict-missing`, `Proofs.verdict-not-yes`) |the canon reader refuses the receipt: line 28: identity field :beholding-chora carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) +|https://github.com/hyperpolymath/mathesis/blob/10f9f46ff7e1c8a0433164bc8bf6d8f30842fd4c/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-1] at `10f9f46ff7e1`; the receipt describes `8c55804163fd` |theorem |`PWG-2ii` |Missing propagates: in the cohort model, an output that depends on a missing input is missing, in every period after it too, and never zero. A verdict is "no" on a known breach and otherwise missing when any value it depends on is missing; it is never "yes" then. (`Applied.Missing`: `Proofs.closing-needs`, `Proofs.missing-persists`, `Proofs.closings-missing`, `Proofs.verdict-yes`, `Proofs.breach-decides`, `Proofs.verdict-missing`, `Proofs.verdict-not-yes`) |the reader derives PWG-2ii from the legs and receipts at `8c55804163fd` -|https://github.com/hyperpolymath/mathesis/blob/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-2] at `58ebefbd9318` |theorem |`ungraded` |Cash identity: the closing cash of the last period equals the opening cash plus, summed over the periods, receipts minus payments; when a value is missing, both sides are missing. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one. (`Applied.Cash`: `Proofs.cash-identity`) |the canon reader refuses the receipt: line 28: identity field :beholding-chora carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) +|https://github.com/hyperpolymath/mathesis/blob/10f9f46ff7e1c8a0433164bc8bf6d8f30842fd4c/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-2] at `10f9f46ff7e1`; the receipt describes `8c55804163fd` |theorem |`PWG-2ii` |Cash identity: the closing cash of the last period equals the opening cash plus, summed over the periods, receipts minus payments; when a value is missing, both sides are missing. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one. (`Applied.Cash`: `Proofs.cash-identity`) |the reader derives PWG-2ii from the legs and receipts at `8c55804163fd` -|https://github.com/hyperpolymath/mathesis/blob/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-3] at `58ebefbd9318` |theorem |`ungraded` |The funding gap is sound and least: adding the gap to the opening cash keeps every closing balance at or above its floor, and no smaller non-negative amount does. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one. (`Applied.Cash`: `Proofs.gap-sound`, `Proofs.gap-least`) |the canon reader refuses the receipt: line 28: identity field :beholding-chora carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) +|https://github.com/hyperpolymath/mathesis/blob/10f9f46ff7e1c8a0433164bc8bf6d8f30842fd4c/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-3] at `10f9f46ff7e1`; the receipt describes `8c55804163fd` |theorem |`PWG-2ii` |The funding gap is sound and least: adding the gap to the opening cash keeps every closing balance at or above its floor, and no smaller non-negative amount does. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one. (`Applied.Cash`: `Proofs.gap-sound`, `Proofs.gap-least`) |the reader derives PWG-2ii from the legs and receipts at `8c55804163fd` -|https://github.com/hyperpolymath/mathesis/blob/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-4] at `58ebefbd9318` |theorem |`ungraded` |Status never upgrades: the evidence status of an output is never stronger than the weakest status of the inputs that it depends on. (`Applied.Missing`: `Proofs.members-needs`, `Proofs.receipts-needs`, `Proofs.payments-needs`, `Proofs.closing-needs`, `Proofs.shortfall-needs`, `Proofs.cashOk-needs`, `Proofs.hours-needs`, `Proofs.capacityOk-needs`, `Proofs.gap-needs`) |the canon reader refuses the receipt: line 28: identity field :beholding-chora carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) +|https://github.com/hyperpolymath/mathesis/blob/10f9f46ff7e1c8a0433164bc8bf6d8f30842fd4c/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-4] at `10f9f46ff7e1`; the receipt describes `8c55804163fd` |theorem |`PWG-2ii` |Status never upgrades: the evidence status of an output is never stronger than the weakest status of the inputs that it depends on. (`Applied.Missing`: `Proofs.members-needs`, `Proofs.receipts-needs`, `Proofs.payments-needs`, `Proofs.closing-needs`, `Proofs.shortfall-needs`, `Proofs.cashOk-needs`, `Proofs.hours-needs`, `Proofs.capacityOk-needs`, `Proofs.gap-needs`) |the reader derives PWG-2ii from the legs and receipts at `8c55804163fd` -|https://github.com/hyperpolymath/mathesis/blob/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#THY-1] at `58ebefbd9318` |theorem |`ungraded` |In a dependency graph whose edges are guarded by features closed under Horn rules, and by an arbitrary per-target condition, a node unreachable with every feature requested is unreachable under any request, on each target (`Cargo.absent-under-all-features`). The general form is `Monotone.reach-mono`: reachability over a monotone family of edge sets is monotone. (`FeatureReachability`: `Cargo.absent-under-all-features`, `Monotone.reach-mono`) |the canon reader refuses the receipt: line 28: identity field :beholding-chora carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) +|https://github.com/hyperpolymath/mathesis/blob/10f9f46ff7e1c8a0433164bc8bf6d8f30842fd4c/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#THY-1] at `10f9f46ff7e1`; the receipt describes `8c55804163fd` |theorem |`PWG-2ii` |In a dependency graph whose edges are guarded by features closed under Horn rules, and by an arbitrary per-target condition, a node unreachable with every feature requested is unreachable under any request, on each target (`Cargo.absent-under-all-features`). The general form is `Monotone.reach-mono`: reachability over a monotone family of edge sets is monotone. (`FeatureReachability`: `Cargo.absent-under-all-features`, `Monotone.reach-mono`) |the reader derives PWG-2ii from the legs and receipts at `8c55804163fd` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-1] at `a17ffb6cc653` |theorem |`ungraded` |`ResourceAlgebra`: alternatives form an idempotent commutative monoid and sequencing a monoid. (`ResourceAlgebra.Core`: `ResourceAlgebra`, `IsAltMonoid.unitʳ`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-1] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |`ResourceAlgebra`: alternatives form an idempotent commutative monoid and sequencing a monoid. (`ResourceAlgebra.Core`: `ResourceAlgebra`, `IsAltMonoid.unitʳ`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-2] at `a17ffb6cc653` |theorem |`ungraded` |The relation `≼` induced by ⊕ is a partial order. `𝟘` is least and `⊕` is its join. (`ResourceAlgebra.Core`: `≼-refl`, `≼-trans`, `≼-antisym`, `𝟘-least`, `⊕-upperˡ`, `⊕-upperʳ`, `⊕-least`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-2] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |The relation `≼` induced by ⊕ is a partial order. `𝟘` is least and `⊕` is its join. (`ResourceAlgebra.Core`: `≼-refl`, `≼-trans`, `≼-antisym`, `𝟘-least`, `⊕-upperˡ`, `⊕-upperʳ`, `⊕-least`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-3] at `a17ffb6cc653` |theorem |`ungraded` |Every dioid is ordered: distributivity makes `⊗` monotone on both sides. (`ResourceAlgebra.Core`: `IsDioid.ordered`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-3] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |Every dioid is ordered: distributivity makes `⊗` monotone on both sides. (`ResourceAlgebra.Core`: `IsDioid.ordered`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-4a] at `a17ffb6cc653` |theorem |`ungraded` |A dioid need not be annihilating. HWM is a dioid and is not annihilating. (`ResourceAlgebra.Instances.HWM`: `HWM-dioid`, `HWM-not-annihilating`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-4a] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |A dioid need not be annihilating. HWM is a dioid and is not annihilating. (`ResourceAlgebra.Instances.HWM`: `HWM-dioid`, `HWM-not-annihilating`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-1] at `a17ffb6cc653` |theorem |`ungraded` |Both notions have identities and compose, and every strict morphism is lax. (`ResourceAlgebra.Morphism`: `id-hom`, `_∘h_`, `id-lax`, `_∘l_`, `lax`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-4b] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |An annihilating ordered algebra need not be a dioid: the diamond lattice M3 (⊕ = join, ⊗ = meet) is ordered and annihilating but not a dioid, since a ⊗ (b ⊕ c) = a while (a ⊗ b) ⊕ (a ⊗ c) = 𝟘. (`ResourceAlgebra.Instances.Diamond`: `Diamond`, `Diamond-ordered`, `Diamond-annihilating`, `Diamond-not-dioid`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-2] at `a17ffb6cc653` |theorem |`ungraded` |`peak : HWM → MaxPlus` is lax: the peak of a sequence never exceeds the sum of the peaks. (`ResourceAlgebra.Morphism`: `peak-lax`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#E-1] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |`Evidence`, the PROOF-POLICY §5 statuses as a chain (open-row < tested-only < argued < proven-with-postulates < proven), is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ the stronger and ⊗ the weaker status; ⊗ is the meet of `≼`. (`ResourceAlgebra.Instances.Evidence`: `Evidence`, `Evidence-dioid`, `Evidence-ordered`, `Evidence-annihilating`, `≼→≤`, `≤→≼`, `≼-proven`, `⊓e-lowerˡ`, `⊓e-lowerʳ`, `⊓e-greatest`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-3] at `a17ffb6cc653` |theorem |`ungraded` |`peak` is not strict: it does not preserve ⊗, whatever it does to the units. (`ResourceAlgebra.Morphism`: `peak-not-strict`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#E-2] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |Soundness: a ledger row's derived status is no stronger than its own evidence, than any row it depends on, or than any row it reaches through dependencies. (`ResourceAlgebra.Ledger`: `eff-≼-own`, `eff-≼-dep`, `eff-≼-reach`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-4] at `a17ffb6cc653` |theorem |`ungraded` |No strict morphism leaves HWM for an algebra with 𝟘 ≢ 𝟙. In particular, none goes to MaxPlus or to Loss. (`ResourceAlgebra.Morphism`: `no-strict-from-HWM`, `no-strict-HWM→MaxPlus`, `no-strict-HWM→Loss`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#E-3] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |Maximality: the derived status respects the ledger, and every respectful assignment is below it row by row, so it is the strongest status the ledger supports. (`ResourceAlgebra.Ledger`: `Respects`, `eff-respects`, `restrict`, `eff-greatest`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-5] at `a17ffb6cc653` |theorem |`ungraded` |Exactly two strict morphisms Loss → MaxPlus exist, `zero-test` and `support`. Neither distinguishes `fin 1` from `fin 2`. (`ResourceAlgebra.Morphism`: `zero-test-hom`, `support-hom`, `Loss→MaxPlus`, `maps-disagree-at-positive`, `Loss→MaxPlus-collapses`, `no-injective-Loss→MaxPlus`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-1] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |Both notions have identities and compose, and every strict morphism is lax. (`ResourceAlgebra.Morphism`: `id-hom`, `_∘h_`, `id-lax`, `_∘l_`, `lax`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-6] at `a17ffb6cc653` |theorem |`ungraded` |Exactly one strict morphism MaxPlus → Loss exists, `support′`. resource-algebra#3 sketched this direction as "symmetric" to Loss → MaxPlus, but it is not: there is one map, not two. The issue's other claim, that every positive grade goes to a single point, holds. (`ResourceAlgebra.Morphism`: `support′-hom`, `MaxPlus→Loss`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-2] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |`peak : HWM → MaxPlus` is lax: the peak of a sequence never exceeds the sum of the peaks. (`ResourceAlgebra.Morphism`: `peak-lax`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-7] at `a17ffb6cc653` |theorem |`ungraded` |The identity on the carrier is a lax morphism Loss → MinMax: a bottleneck never exceeds the sum. (`ResourceAlgebra.Morphism`: `loss-bottleneck`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-3] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |`peak` is not strict: it does not preserve ⊗, whatever it does to the units. (`ResourceAlgebra.Morphism`: `peak-not-strict`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-8] at `a17ffb6cc653` |theorem |`ungraded` |Out of one question there is exactly one strict morphism into an algebra `B`: lost goes to 𝟘 and kept goes to 𝟙. It exists exactly when `B` has 𝟘 ⊗ 𝟘 ≡ 𝟘, which every annihilating algebra has, and HWM too. (`ResourceAlgebra.Morphism`: `one-question-hom`, `one-question-needs`, `one-question-unique`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-4] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |No strict morphism leaves HWM for an algebra with 𝟘 ≢ 𝟙. In particular, none goes to MaxPlus or to Loss. (`ResourceAlgebra.Morphism`: `no-strict-from-HWM`, `no-strict-HWM→MaxPlus`, `no-strict-HWM→Loss`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-9] at `a17ffb6cc653` |theorem |`ungraded` |Taking the first question of `Questions (suc n)`, and dropping it, are strict morphisms. Composed, they read any single question alone. (`ResourceAlgebra.Morphism`: `first-question`, `later-questions`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-5] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |Exactly two strict morphisms Loss → MaxPlus exist, `zero-test` and `support`. Neither distinguishes `fin 1` from `fin 2`. (`ResourceAlgebra.Morphism`: `zero-test-hom`, `support-hom`, `Loss→MaxPlus`, `maps-disagree-at-positive`, `Loss→MaxPlus-collapses`, `no-injective-Loss→MaxPlus`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-10] at `a17ffb6cc653` |theorem |`ungraded` |The number of lost questions does not preserve ⊕: `collapse` and `shuffle` each count 1 and their ⊕ counts 0. So no map into Loss or MinMax that factors through the count is strict or lax. (`ResourceAlgebra.Morphism`: `count-not-⊕`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-6] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |Exactly one strict morphism MaxPlus → Loss exists, `support′`. resource-algebra#3 sketched this direction as "symmetric" to Loss → MaxPlus, but it is not: there is one map, not two. The issue's other claim, that every positive grade goes to a single point, holds. (`ResourceAlgebra.Morphism`: `support′-hom`, `MaxPlus→Loss`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#H-1] at `a17ffb6cc653` |theorem |`ungraded` |`HWM` (peak, drift, with drift ≤ peak) is a `ResourceAlgebra`, `IsDioid` and `IsOrdered`, and 𝟘 ≡ 𝟙. (`ResourceAlgebra.Instances.HWM`: `HWM`, `HWM-dioid`, `HWM-ordered`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-7] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |The identity on the carrier is a lax morphism Loss → MinMax: a bottleneck never exceeds the sum. (`ResourceAlgebra.Morphism`: `loss-bottleneck`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#H-3] at `a17ffb6cc653` |theorem |`ungraded` |`HWM` has no annihilating zero. (`ResourceAlgebra.Instances.HWM`: `HWM-not-annihilating`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-8] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |Out of one question there is exactly one strict morphism into an algebra `B`: lost goes to 𝟘 and kept goes to 𝟙. It exists exactly when `B` has 𝟘 ⊗ 𝟘 ≡ 𝟘, which every annihilating algebra has, and HWM too. (`ResourceAlgebra.Morphism`: `one-question-hom`, `one-question-needs`, `one-question-unique`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#L-1] at `a17ffb6cc653` |theorem |`ungraded` |`Loss` is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ = min, ⊗ = +, 𝟘 = inf and 𝟙 = fin 0. (`ResourceAlgebra.Instances.Loss`: `Loss`, `Loss-dioid`, `Loss-ordered`, `Loss-annihilating`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-9] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |Taking the first question of `Questions (suc n)`, and dropping it, are strict morphisms. Composed, they read any single question alone. (`ResourceAlgebra.Morphism`: `first-question`, `later-questions`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#M-1] at `a17ffb6cc653` |theorem |`ungraded` |`MaxPlus` is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ = max, ⊗ = +, 𝟘 = bot and 𝟙 = val 0. (`ResourceAlgebra.Instances.MaxPlus`: `MaxPlus`, `MaxPlus-dioid`, `MaxPlus-ordered`, `MaxPlus-annihilating`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-10] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |The number of lost questions does not preserve ⊕: `collapse` and `shuffle` each count 1 and their ⊕ counts 0. So no map into Loss or MinMax that factors through the count is strict or lax. (`ResourceAlgebra.Morphism`: `count-not-⊕`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#N-1] at `a17ffb6cc653` |theorem |`ungraded` |`MinMax` (the bottleneck algebra) is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating` on the Loss carrier. Its operations are ⊕ = min and ⊗ = max (`_⊔g_`, with `inf` absorbing), with 𝟘 = inf and 𝟙 = fin 0. (`ResourceAlgebra.Instances.MinMax`: `MinMax`, `MinMax-dioid`, `MinMax-ordered`, `MinMax-annihilating`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#H-1] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |`HWM` (peak, drift, with drift ≤ peak) is a `ResourceAlgebra`, `IsDioid` and `IsOrdered`, and 𝟘 ≡ 𝟙. (`ResourceAlgebra.Instances.HWM`: `HWM`, `HWM-dioid`, `HWM-ordered`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-1] at `a17ffb6cc653` |theorem |`ungraded` |`Questions n` (a "which" grade over `n` downstream questions) is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`. A grade is `n` booleans, `true` where a step loses that question. Its operations are ⊕ = intersection and ⊗ = union, bit by bit, with 𝟘 = every question lost and 𝟙 = none lost. (`ResourceAlgebra.Instances.Questions`: `Questions`, `Questions-dioid`, `Questions-ordered`, `Questions-annihilating`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#H-3] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |`HWM` has no annihilating zero. (`ResourceAlgebra.Instances.HWM`: `HWM-not-annihilating`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-2] at `a17ffb6cc653` |theorem |`ungraded` |With two questions, `collapse` (loses question 1) and `shuffle` (loses question 0) each lose one question and are different grades: a count of lost questions cannot tell them apart. (`ResourceAlgebra.Instances.Questions`: `same-amount-different-loss`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#L-1] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |`Loss` is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ = min, ⊗ = +, 𝟘 = inf and 𝟙 = fin 0. (`ResourceAlgebra.Instances.Loss`: `Loss`, `Loss-dioid`, `Loss-ordered`, `Loss-annihilating`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-3] at `a17ffb6cc653` |theorem |`ungraded` |In sequence, `collapse` then `shuffle` loses both questions. (`ResourceAlgebra.Instances.Questions`: `both-lost`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#M-1] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |`MaxPlus` is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ = max, ⊗ = +, 𝟘 = bot and 𝟙 = val 0. (`ResourceAlgebra.Instances.MaxPlus`: `MaxPlus`, `MaxPlus-dioid`, `MaxPlus-ordered`, `MaxPlus-annihilating`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-4] at `a17ffb6cc653` |theorem |`ungraded` |As alternatives, `collapse ⊕ shuffle` is 𝟙 (no question lost), while neither branch is 𝟙. So ⊕ answers "is question i kept on some branch?" and not "does one branch keep every question?". (`ResourceAlgebra.Instances.Questions`: `no-branch-achieves-meet`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#N-1] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |`MinMax` (the bottleneck algebra) is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating` on the Loss carrier. Its operations are ⊕ = min and ⊗ = max (`_⊔g_`, with `inf` absorbing), with 𝟘 = inf and 𝟙 = fin 0. (`ResourceAlgebra.Instances.MinMax`: `MinMax`, `MinMax-dioid`, `MinMax-ordered`, `MinMax-annihilating`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-1] at `a17ffb6cc653` |theorem |`ungraded` |Sequencing peaks 2 and 3 gives 3 under HWM and 5 under MaxPlus: an occupancy bound is not a cost bound. (`ResourceAlgebra.Separation`: `occupancy-is-not-cost`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-1] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |`Questions n` (a "which" grade over `n` downstream questions) is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`. A grade is `n` booleans, `true` where a step loses that question. Its operations are ⊕ = intersection and ⊗ = union, bit by bit, with 𝟘 = every question lost and 𝟙 = none lost. (`ResourceAlgebra.Instances.Questions`: `Questions`, `Questions-dioid`, `Questions-ordered`, `Questions-annihilating`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-2] at `a17ffb6cc653` |theorem |`ungraded` |On the same numbers, alternatives give `fin 2` under Loss and `val 3` under MaxPlus: echo's join is min, while tropical's is max. (`ResourceAlgebra.Separation`: `alternatives-differ`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-2] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |With two questions, `collapse` (loses question 1) and `shuffle` (loses question 0) each lose one question and are different grades: a count of lost questions cannot tell them apart. (`ResourceAlgebra.Instances.Questions`: `same-amount-different-loss`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-3] at `a17ffb6cc653` |theorem |`ungraded` |`val 1 ≼ val 2` in MaxPlus but `fin 2 ≼ fin 1` in Loss: the induced orders run in opposite directions. (`ResourceAlgebra.Separation`: `maxplus-order`, `loss-order-reversed`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-3] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |In sequence, `collapse` then `shuffle` loses both questions. (`ResourceAlgebra.Instances.Questions`: `both-lost`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-4] at `a17ffb6cc653` |theorem |`ungraded` |Sequencing 2 then 3 gives `fin 5` under Loss but `fin 3` under MinMax: a bottleneck bound is not a loss bound. (`ResourceAlgebra.Separation`: `bottleneck-is-not-sum`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-4] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |As alternatives, `collapse ⊕ shuffle` is 𝟙 (no question lost), while neither branch is 𝟙. So ⊕ answers "is question i kept on some branch?" and not "does one branch keep every question?". (`ResourceAlgebra.Instances.Questions`: `no-branch-achieves-meet`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` + +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-1] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |Sequencing peaks 2 and 3 gives 3 under HWM and 5 under MaxPlus: an occupancy bound is not a cost bound. (`ResourceAlgebra.Separation`: `occupancy-is-not-cost`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` + +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-2] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |On the same numbers, alternatives give `fin 2` under Loss and `val 3` under MaxPlus: echo's join is min, while tropical's is max. (`ResourceAlgebra.Separation`: `alternatives-differ`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` + +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-3] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |`val 1 ≼ val 2` in MaxPlus but `fin 2 ≼ fin 1` in Loss: the induced orders run in opposite directions. (`ResourceAlgebra.Separation`: `maxplus-order`, `loss-order-reversed`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` + +|https://github.com/hyperpolymath/resource-algebra/blob/c31bf1a9ae9d186674c7ed79c6c9b018a1d59c2b/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-4] at `c31bf1a9ae9d`; the receipt describes `15fa113c7427` |theorem |`PWG-2i` |Sequencing 2 then 3 gives `fin 5` under Loss but `fin 3` under MinMax: a bottleneck bound is not a loss bound. (`ResourceAlgebra.Separation`: `bottleneck-is-not-sum`) |the reader derives PWG-2i from the legs and receipts at `15fa113c7427` |https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-1] at `4ed067220f13` |theorem |`ungraded` |TINI at the two-point lattice: two finishing runs of a well-typed command from low-equivalent stores end low-equivalent, fuels independent (`SecretTypes.Noninterference`: `tini`) |the canon reader refuses the receipt: claim "N-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) diff --git a/docs/status/PROOF-STATUS.adoc b/docs/status/PROOF-STATUS.adoc index 587ccc2..08742a6 100644 --- a/docs/status/PROOF-STATUS.adoc +++ b/docs/status/PROOF-STATUS.adoc @@ -27,7 +27,7 @@ reader of PROOF-POLICY §8.5.1. |Proved in Agda, Rocq and Lean |`PWG-2ii` |The receipt `verification/receipts/theory_praxis.deed`; the record below. -Claim pins at main `58ebefb` (2026-11-17) +Claim pins at main `10f9f46` (2026-11-18) |=== *Overall*: 5 of 6 obligations are proved in all three provers, and each of the @@ -362,6 +362,11 @@ bash tests/proofs/gate_controls_test.sh agda |=== |Date |Change +|2026-11-18 +|The claim pins of THY-1 and APP-1 to APP-4 name the receipt at main +`10f9f46` (PR 115). The registry catalogues `PWG-2ii` for all five, and +the theory ledger records THY-1's change (entry 6). + |2026-11-18 |The claims registry pins the canon reader at standards `940a27af` (it was `e5a39d7`). That reader reads `(import …)` clauses and applies diff --git a/docs/status/ROADMAP.adoc b/docs/status/ROADMAP.adoc index 9c9a3ef..a9f458c 100644 --- a/docs/status/ROADMAP.adoc +++ b/docs/status/ROADMAP.adoc @@ -318,6 +318,25 @@ One pull request that changes census rows is open at a time (atlas README, names `verdict-missing` and `verdict-not-yes`. The registry catalogues `PWG-1` for all five, and the theory ledger records THY-1's receipt change (entry 4). +** Fifth change (2026-11-18), PR 115: the claims registry pins the canon + reader at standards `940a27af`, which reads `(import …)` clauses and + applies standards#1625 (`PWG-1` needs a container image pinned by + digest). The receipt is recorded again with the canon `#u8` + `:beholding-chora`; the reader derives `PWG-2ii` for all five. +** Sixth change (2026-11-18): the claim pins of THY-1 and APP-1 to APP-4 + name the receipt at main `10f9f46`, and the theory ledger records THY-1's + move to `PWG-2ii` (entry 6). resource-algebra's rows name its receipt at + main `c31bf1a`, and C-4b, E-1, E-2 and E-3 are catalogued. Its Lean leg is + `superseded` there (resource-algebra PR 53 changed the Lean inputs), so + the reader derives `PWG-2i` for its 31 rows until a Lean run is recorded + again. M-2's link to tropical-types is a + bridge candidate (`resource-algebra-maxplus-tropical`), relation + `unassessed`, not a claims row: a claims row needs an Agda module, and + that theorem lives in Lean only. Census: 0 `PWG-1`, 5 `PWG-2ii`, 31 + `PWG-2i`, 0 `PWG-3` and 12 `ungraded`, of 48 theorems. The 12 are + secret-types' and lintel's: the new reader refuses their receipts (a `#u5` + identity literal, and secret-types' recorded `PWG-1` that the image rule + no longer supports) until they are recorded again. [[stages]] == Stages diff --git a/docs/theory/generated/index.adoc b/docs/theory/generated/index.adoc index 98017dd..a179b05 100644 --- a/docs/theory/generated/index.adoc +++ b/docs/theory/generated/index.adoc @@ -13,6 +13,6 @@ Theorems: 1. |=== |Theorem |Statement |PWG |Source and receipt |Dependant -|THY-1 |In a dependency graph whose edges are guarded by features closed under Horn rules, and by an arbitrary per-target condition, a node unreachable with every feature requested is unreachable under any request, on each target (`Cargo.absent-under-all-features`). The general form is `Monotone.reach-mono`: reachability over a monotone family of edge sets is monotone. |`ungraded` |`FeatureReachability`: `Cargo.absent-under-all-features`, `Monotone.reach-mono`; `verification/receipts/theory_praxis.deed` at `58ebefbd9318` |https://github.com/metadatastician/standards/blob/main/docs/UPSTREAM-DEPENDENCY-WATCH.adoc[metadatastician/standards]: Run cargo tree --target all --workspace --all-features, and read a crate missing there as missing from every build. +|THY-1 |In a dependency graph whose edges are guarded by features closed under Horn rules, and by an arbitrary per-target condition, a node unreachable with every feature requested is unreachable under any request, on each target (`Cargo.absent-under-all-features`). The general form is `Monotone.reach-mono`: reachability over a monotone family of edge sets is monotone. |`PWG-2ii` |`FeatureReachability`: `Cargo.absent-under-all-features`, `Monotone.reach-mono`; `verification/receipts/theory_praxis.deed` at `10f9f46ff7e1` |https://github.com/metadatastician/standards/blob/main/docs/UPSTREAM-DEPENDENCY-WATCH.adoc[metadatastician/standards]: Run cargo tree --target all --workspace --all-features, and read a crate missing there as missing from every build. |=== diff --git a/docs/theory/ledger.jsonl b/docs/theory/ledger.jsonl index b13dcae..a23cf91 100644 --- a/docs/theory/ledger.jsonl +++ b/docs/theory/ledger.jsonl @@ -3,3 +3,4 @@ {"admission_sha256":"91977ed786bb4a63913234167876096bf6e93491e828dcc3e1e7538862349fc5","changes":["pwg","receipt"],"date":"2026-11-14","event":"changed","id":"hyperpolymath/mathesis#THY-1","note":"THY-1's claim pin moved to main a1388fc, where the receipt written under PROOF-POLICY 8.5.1 (PR 90) is on main. The canon reader at standards e5a39d7 derives PWG-1 from it, and the 8.5.3 git checks hold, so the registry catalogues PWG-1 again.","pwg":"PWG-1","receipt":{"commit":"a1388fcc922ea6d6930fdae78f569139493be975","path":"verification/receipts/theory_praxis.deed","sha256":"7e175ec06b47177983d5cd9360043358268fb53ea5a69cd75dde58d196cf1c2c"},"seq":3} {"admission_sha256":"91977ed786bb4a63913234167876096bf6e93491e828dcc3e1e7538862349fc5","changes":["receipt"],"date":"2026-11-17","event":"changed","id":"hyperpolymath/mathesis#THY-1","note":"THY-1's claim pin moved to main 58ebefb (PR 113), where the receipt is earned again from CI run 44190913019 on main 8c55804: the first run under the gate of PR 107, which audits definitions as well as theorems, refuses an empty audit and a declared Lean axiom, and checks each Rocq library and its import cone with the kernel checker coqchk -o. THY-1's Lean leg now has axiom evidence from an audit that inspected its results; the receipt it replaces had an empty axiom list from an audit that inspected none of them. The canon reader at standards e5a39d7 derives PWG-1, and the 8.5.3 git checks hold.","pwg":"PWG-1","receipt":{"commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"seq":4} {"admission_sha256":"91977ed786bb4a63913234167876096bf6e93491e828dcc3e1e7538862349fc5","changes":["pwg"],"date":"2026-11-18","event":"changed","id":"hyperpolymath/mathesis#THY-1","note":"The reader pin moved to standards 940a27af, which refuses a #u5 identity literal (owner ruling Q2) and requires a digest-pinned checker image for PWG-1 (standards#1625). The receipt that THY-1's claim pin names (58ebefb) has a #u5 :beholding-chora, so the reader refuses it. The Mathesis receipt is recorded again in the same change, where the reader derives PWG-2ii, and the next change moves THY-1's pin to it.","pwg":"ungraded","receipt":{"commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"seq":5} +{"admission_sha256":"91977ed786bb4a63913234167876096bf6e93491e828dcc3e1e7538862349fc5","changes":["pwg","receipt"],"date":"2026-11-18","event":"changed","id":"hyperpolymath/mathesis#THY-1","note":"THY-1's claim pin moved to main 10f9f46 (PR 115), where the receipt is recorded again under the reader at standards 940a27af: its :beholding-chora is the canon #u8 form, and the reader derives PWG-2ii, not PWG-1, because the proof lanes run in the pinned Guix shell rather than a container image pinned by digest (standards#1625).","pwg":"PWG-2ii","receipt":{"commit":"10f9f46ff7e1c8a0433164bc8bf6d8f30842fd4c","path":"verification/receipts/theory_praxis.deed","sha256":"e57efc6832f884bc697dd2f99f0073c8d0e765fd0430c438ff604f9d199b9098"},"seq":6}