Add exact coset-carrier reconstruction certificate for a supplied SL(2,5) source (#769) - #784
Merged
muellerberndt merged 3 commits intoSep 11, 2026
Conversation
…dral source Takes SL(2, F_5) as the exact finite representative of 2I, forms the central quotient, and classifies all 900 (C5, C3, C2) placements by exact checks on the three coset incidences. Exactly 120 placements reconstruct the committed oriented packet (PortFrameGram.neighbors, A5PortAction.perms, CoreAxioms.orientedFaces) under an explicit relabelling. They are the placements with generators satisfying xyz = 1, in bijection with the solutions of a^2 = b^3 = c^5 = abc, forming two inner orbits and one automorphism orbit. The other 780 fail closed in three typed classes. Fifteen negative controls, a recomputable receipt, tests, and a companion note are included. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
Enumerates Aut(G) exhaustively from generator images (120 automorphisms, equal to the conjugations by GL(2, F_5)) and identifies G with A5 and Aut(G) with S5 through the faithful actions on the five Klein four-subgroups. Pins the presentation to the common value -I (120 solutions of orders 4, 6, 10; 121 with the value free). Restates the companion note on the house template with hand proofs of the lemmas, a formalization-ready model with Lean-facing signatures, an acceptance matrix, and a cited claim boundary. Adds the README row and four tests. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
States the Result opening conditionally on the supplied source, proves the connectivity of the coset edge graph inside Lemma 769.5, states Lemma 769.2 as a bijection, names the dihedral normalizer of C5, adds the SO(3) image of 2I to the claim boundary, and cites Schur's 1911 paper under the author's initial. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR adds the bounded reconstruction check proposed in discussion #769, taking
SL(2, F_5)as the supplied binary icosahedral source. All 900 placements of the three cyclic stabilizers reproduce the local incidence counts of the A1 carrier. Exactly 120 close into the committed oriented carrier under an explicit relabelling: precisely the placements whose generators can be chosen withxyz = 1. A further 180 reproduce the committed edge graph and face vertex sets and fail the coset edge-face incidence, which is the failure mode the placement caveat in #769 anticipated, in its subtlest form.The construction forms the central quotient
Gand builds the coset geometry with verticesG/C5, facesG/C3, edgesG/C2, and incidence by nonempty coset intersection, for all 900 placements of the three cyclic subgroups. The companion note states the result as Theorem 769.1. Its central lemma, 769.3, is proved by hand: the base edgeC2lies on the base faceC3exactly when the generators can be chosen withxyz = 1, and every incident edge-face pair is a translate of that base pair. The note pairs such proofs with exhaustive finite verification; the sizes of the four placement classes come from the verifier.Acceptance
2I/Z(2I) ≅ A5identification and compatible choices ofC5,C3,C2SL(2, F_5)is checked for order 120, centre{+I, -I}, a unique involution, perfectness, and the binary icosahedral order profile. The quotient identificationG ≅ A5is computed from the faithful action ofGon its five Klein four-subgroups; the stepSL(2, 5) ≅ 2Iis cited, as the conditionality row states. All 900 placements are classified, and compatibility is exactlyxyz = 1.PortFrameGramandA5PortAction, and a Lean bridgePortFrameGram.neighbors,CoreAxioms.orientedFaces,PortFrameGram.antipode, and the sixtyA5PortAction.permsrows. Of its 120 graph relabellings, 60 carry the coset orientation ontoorientedFacesand the other 60 are exactly their compositions with the antipode. The Lean bridge is scoped below as a follow-up underLean/Screen/.Aut(G): the certificate enumeratesAut(G)exhaustively (120 automorphisms, all induced by conjugation inGL(2, F_5), withAut(G) ≅ S5), and the 120 compatible placements form one orbit underAut(G)and two orbits under inner automorphisms. Twelve ports selectC5, which removes the duality choice. The construction outputs the orientation and the relabelling matches it. No placement, duality, or orientation choice survives as an assumption; the supplied group is the only residual premise. Fifteen typed controls are recorded, and the 780 incompatible placements are classified by their first failing check.SL(2, 5) ≅ 2Irests on one cited fact, that the Schur multiplier ofA5isZ/2(Schur 1911; the full reference is in the note).Placement classes
(C5, C3)pairxyz = 1)C2inside the normalizer ofC5)A check restricted to vertex-level data accepts 300 placements; the full check accepts 120. In port labels, one of the 180 places the coset edge
{0, 6}on the faces{0, 1, 2}and{6, 9, 10}, while the faces containing it are{0, 3, 6}and{0, 4, 6}. A regression test corrupts one edge-face incidence of a compatible placement and confirms that the check rejects it.Lean follow-up
The Lean bridge is scoped as a separate PR under
Lean/Screen/.CoreAxioms.BoundaryPacketandCarrierUniqueness.BoundaryComplexstore edges and faces as sets of ports, so their edge-face incidence is containment by definition, and the 180 placements above agree with the committed packet on exactly that data. The bridge therefore carries the coset edge-face relation as its own object and proves that it coincides with containment exactly whenxyz = 1holds (edgeFaceContainment_iff_triangleRelation), beforefaces_determinedorcounts_forcedapply. Section 7 of the companion note records the proposed interface.Scope
This PR edits no ledger file. Selection-ledger row 4 keeps its class, menu, and compression accounting; the certificate supplies a conditional replacement route in which, given
SL(2, F_5)as the source, the committed boundary complex is reconstructed rather than separately supplied. Amending the row'swhereandreceiptsentries is a separate change. The reconstruction factors through the central quotient, so it cannot distinguish the source from its quotient, and it makes no physical selection of the source and no physical identification of the ports. The binary icosahedral double cover derived downstream from the port frame is not an input. The certificate makes no claim about excluding the cyclic and binary dihedral families, so the convergence question parked in #769 is untouched.The controls file carries the discussion number because row 4 has no owner issue. If an issue is opened for this lane, the file can take the
issue_NNN_negative_controls.jsonname.Files
code/a5_closure/coset_carrier_certificate.py: the certificate; Python standard library, exact integer arithmetic.code/a5_closure/coset_carrier_certificate.md: Theorem 769.1 with proofs, exact values, controls, formal model, acceptance matrix, and claim boundary.code/a5_closure/manifests/coset_carrier_reference.json,receipts/coset_carrier_reference.receipt.json,negative_controls/coset_carrier_negative_controls.json.code/a5_closure/tests/test_coset_carrier_certificate.py: 18 regression and adversarial tests.code/a5_closure/README.md: a Run line and a row in the certified table.tools/run_mandatory_suite.py: the test file joins the existing certificate pytest group.Reproduction
The certificate runs in about five seconds, and the receipt and the control bundle are byte-identical across runs and hash seeds. The patterns of
tools/check_reader_style.py, applied by hand to the added files, report no hits; the tool's own globs do not covercode/a5_closure/.