From aaca1ff31e2e699e538f397d1750ce59bc407875 Mon Sep 17 00:00:00 2001 From: apoursh <8867770+apoursh@users.noreply.github.com> Date: Thu, 19 Nov 2026 12:46:03 -0500 Subject: [PATCH 1/2] Prove the five-qubit Gaussian-dyadic Clifford threshold is 15 --- .../CHARACTERS.json | 1196 +++++++++++++++++ .../clifford-five-qubit-modular-seed/PROOF.md | 43 + .../README.md | 44 + .../SOURCES.json | 55 + .../TASK.json | 93 ++ .../clifford-five-qubit-modular-seed/THREE.md | 35 + .../VERIFY.json | 63 + .../check_orthogonal.py | 137 ++ .../gap_rows.g | 18 + .../rebuild.py | 136 ++ .../verify.py | 123 ++ 11 files changed, 1943 insertions(+) create mode 100644 research/clifford-five-qubit-modular-seed/CHARACTERS.json create mode 100644 research/clifford-five-qubit-modular-seed/PROOF.md create mode 100644 research/clifford-five-qubit-modular-seed/README.md create mode 100644 research/clifford-five-qubit-modular-seed/SOURCES.json create mode 100644 research/clifford-five-qubit-modular-seed/TASK.json create mode 100644 research/clifford-five-qubit-modular-seed/THREE.md create mode 100644 research/clifford-five-qubit-modular-seed/VERIFY.json create mode 100644 research/clifford-five-qubit-modular-seed/check_orthogonal.py create mode 100644 research/clifford-five-qubit-modular-seed/gap_rows.g create mode 100644 research/clifford-five-qubit-modular-seed/rebuild.py create mode 100644 research/clifford-five-qubit-modular-seed/verify.py diff --git a/research/clifford-five-qubit-modular-seed/CHARACTERS.json b/research/clifford-five-qubit-modular-seed/CHARACTERS.json new file mode 100644 index 0000000000..7054da94de --- /dev/null +++ b/research/clifford-five-qubit-modular-seed/CHARACTERS.json @@ -0,0 +1,1196 @@ +{"S10(2)":{"ordinary":[[1,1,1],[155,27,-5],[187,59,27],[341,85,21],[495,111,15],[527,143,47],[6138,-6,-6],[11594,330,74],[11594,1354,330],[11935,287,-65],[17050,1690,410],[17391,1647,271],[18445,525,141],[28985,1593,-135],[29512,840,-184],[40392,3528,456],[40579,2051,99],[46035,3411,435],[46376,3368,808],[46376,-1240,168],[52173,3021,-51],[52360,2184,-120],[57288,3528,328],[57970,3442,50],[63240,4872,520],[81158,-1274,134],[173910,342,470],[184450,-3710,450],[190960,-2576,240],[202895,-3185,591],[202895,-497,-145],[202895,3983,335],[202895,-2289,175],[231880,1992,840],[231880,10184,840],[278256,-1296,496],[313038,13518,1614],[365211,-3045,123],[371008,4416,-1216],[381920,2016,-800],[405790,-6370,670],[405790,-6370,1182],[405790,2590,-930],[405790,-2786,30],[405790,15134,1950],[417384,13416,1512],[434775,10455,-905],[515592,-504,-504],[556512,12768,1760],[649264,25648,2864],[736560,26928,3120],[782595,2691,-285],[782595,21123,-285],[811580,5180,-836],[869550,24750,430],[944384,-1792,-768],[973896,27720,2120],[973896,6216,-184],[1014475,15435,-1365],[1014475,15435,1195],[1014475,6475,235],[1095633,15057,-111],[1095633,-9135,369],[1159400,20200,1640],[1217370,7770,1306],[1292544,2304,-768],[1298528,15456,-160],[1298528,1120,-1696],[1408671,8991,63],[1432200,34440,2440],[1473120,26208,2400],[1565190,12294,390],[1623160,-14728,760],[1623160,21112,-520],[1623160,-18312,1400],[1675520,41216,1280],[1826055,-20601,1575],[1826055,8967,135],[1826055,19719,-1785],[1826055,33159,-345],[1826055,22407,1575],[1855040,26176,-960],[1855040,30272,4160],[1947792,33936,1936],[2023680,45312,1280],[2028950,39830,790],[2028950,3990,-3050],[2028950,-13930,150],[2213400,9240,920],[2347785,25353,-2295],[2347785,-26487,2025],[2434740,26292,-2380],[2434740,15540,2612],[2782560,26976,3680],[2921688,-24360,984],[3055360,-12544,-1280],[3142656,-3072,-3072],[3246320,-22288,240],[3246320,-15120,3056],[3246320,27888,1520],[3286899,-3213,-2445],[3286899,-3213,-2445],[3339072,52032,4416],[3478200,-23880,1720],[3652110,-30450,1230],[3652110,-3570,-3570],[4057900,-9940,2220],[4382532,60228,-444],[4452096,-8448,-1280],[4637600,80800,6560],[4869480,-22680,-536],[4869480,-1176,-280],[4869480,74088,1640],[5008608,22752,-1056],[5079040,-32768,0],[5478165,2709,885],[5478165,-21483,1365],[5478165,51093,-75],[5902400,-47040,1600],[5936128,21504,1024],[5936128,5120,-3072],[5936128,37888,5120],[6127616,-32768,0],[6260760,21528,-2280],[6260760,-24552,1560],[6492640,48608,4320],[6492640,-30240,-2080],[6573798,-6426,-4890],[6956400,-17040,880],[7332864,107520,5120],[8115800,69720,-1320],[8115800,15960,-1960],[8115800,-19880,4440],[8115800,-1960,1240],[8729600,46080,5120],[8765064,23688,1032],[9130275,17955,-2205],[9130275,58275,-5565],[9130275,-22365,1155],[9130275,-62685,4515],[9738960,40656,2000],[9738960,-45360,-1072],[9860697,62937,441],[10388224,94976,3840],[10956330,5418,1770],[10956330,-42966,2730],[11269368,71928,504],[11738925,-28755,1485],[11738925,-80595,5805],[11738925,23085,-2835],[11738925,74925,-7155],[11784960,99072,3840],[12521520,98352,3120],[12985280,11200,-576],[13147596,-12852,-564],[13147596,-12852,-564],[14501025,-14175,-2655],[14501025,-14175,-2655],[14501025,-14175,-2655],[14501025,-14175,-2655],[14608440,-25032,3000],[14608440,82488,-840],[14608440,71736,1080],[14840320,-44544,2560],[16220160,98304,0],[16231600,103600,3760],[16434495,-16065,-3009],[16434495,-64449,4095],[16434495,56511,-5985],[16434495,-16065,-3009],[17268736,98304,0],[17530128,47376,2064],[18260550,35910,-4410],[18260550,-44730,2310],[18887680,-35840,1024],[21130065,72657,-7695],[21130065,-82863,5265],[21912660,10836,3540],[22347776,65536,0],[22410675,-87885,1395],[22410675,-87885,1395],[22410675,-87885,1395],[23477850,-57510,2970],[23477850,46170,-5670],[23856525,-93555,1485],[23856525,-93555,1485],[23856525,-93555,1485],[25970560,22400,-1152],[25970560,51072,1920],[26295192,-25704,-1128],[26712576,-1536,4608],[29002050,-28350,-5310],[29002050,-28350,-5310],[29216880,-7056,-1680],[29680640,41984,5120],[32868990,-32130,-6018],[33554432,0,0],[37564560,-9072,-2160]],"reduction":{"5":[[[1,1]], +[[2,1]], +[[3,1]], +[[4,1]], +[[5,1]], +[[6,1]], +[[7,1]], +[[1,1],[8,1]], +[[1,1],[9,1]], +[[10,1]], +[[11,1]], +[[12,1]], +[[13,1]], +[[16,1]], +[[7,1],[14,1]], +[[9,1],[15,1]], +[[4,1],[17,1]], +[[19,1]], +[[3,1],[6,1],[18,1]], +[[20,1]], +[[14,1],[15,1]], +[[21,1]], +[[6,1],[22,1]], +[[23,1]], +[[24,1]], +[[25,1]], +[[26,1]], +[[27,1]], +[[28,1]], +[[29,1]], +[[30,1]], +[[31,1]], +[[32,1]], +[[34,1]], +[[5,1],[33,1]], +[[8,1],[35,1]], +[[4,1],[12,1],[36,1]], +[[40,1]], +[[14,1],[38,1]], +[[41,1]], +[[42,1]], +[[44,1]], +[[43,1]], +[[45,1]], +[[19,1],[39,1]], +[[6,1],[18,1],[22,1],[37,1]], +[[47,1]], +[[25,1],[46,1]], +[[3,1],[18,1],[48,1]], +[[1,1],[9,1],[15,1],[49,1]], +[[24,1],[51,1]], +[[53,1]], +[[2,1],[52,1]], +[[13,1],[54,1]], +[[56,1]], +[[20,1],[57,1]], +[[12,1],[36,1],[50,1]], +[[17,1],[59,1]], +[[60,1]], +[[61,1]], +[[62,1]], +[[46,1],[50,1]], +[[63,1]], +[[64,1]], +[[66,1]], +[[40,1],[58,1]], +[[22,1],[37,1],[58,1]], +[[46,1],[55,1]], +[[48,1],[57,1]], +[[68,1]], +[[34,1],[67,1]], +[[70,1]], +[[75,1]], +[[76,1]], +[[72,1]], +[[33,1],[69,1]], +[[78,1]], +[[30,1],[73,1]], +[[79,1]], +[[41,1],[69,1]], +[[31,1],[74,1]], +[[21,1],[77,1]], +[[51,1],[65,1]], +[[4,1],[17,1],[36,1],[71,1]], +[[52,1],[67,1]], +[[80,1]], +[[81,1]], +[[82,1]], +[[83,1]], +[[85,1]], +[[86,1]], +[[16,1],[87,1]], +[[90,1]], +[[39,1],[88,1]], +[[92,1]], +[[94,1]], +[[57,1],[84,1]], +[[96,1]], +[[95,1]], +[[73,1],[74,1]], +[[38,1],[93,1]], +[[55,1],[89,1]], +[[1,1],[8,1],[49,1],[91,1]], +[[99,1]], +[[42,1],[97,1]], +[[43,1],[98,1]], +[[102,1]], +[[7,1],[14,1],[15,1],[38,1],[101,1]], +[[59,1],[63,1],[89,1]], +[[105,1]], +[[29,1],[106,1]], +[[53,1],[103,1]], +[[23,1],[107,1]], +[[17,1],[59,1],[71,1],[89,1]], +[[109,1]], +[[88,1],[94,1]], +[[72,1],[100,1]], +[[10,1],[110,1]], +[[111,1]], +[[8,1],[35,1],[91,1],[93,1]], +[[37,1],[40,1],[58,1],[104,1]], +[[18,1],[37,1],[48,1],[108,1]], +[[35,1],[92,1],[93,1]], +[[87,1],[100,1]], +[[65,1],[109,1]], +[[26,1],[112,1]], +[[97,1],[98,1]], +[[84,1],[104,1]], +[[113,1]], +[[15,1],[49,1],[91,1],[101,1]], +[[117,1]], +[[118,1]], +[[119,1]], +[[120,1]], +[[122,1]], +[[20,1],[48,1],[57,1],[84,1],[108,1]], +[[123,1]], +[[124,1]], +[[125,1]], +[[126,1]], +[[70,1],[121,1]], +[[44,1],[127,1]], +[[25,1],[46,1],[50,1],[55,1],[116,1]], +[[36,1],[50,1],[71,1],[116,1]], +[[96,1],[115,1]], +[[32,1],[129,1]], +[[7,1],[101,1],[114,1]], +[[130,1]], +[[131,1]], +[[132,1]], +[[133,1]], +[[110,1],[112,1]], +[[107,1],[115,1]], +[[66,1],[134,1]], +[[92,1],[93,1],[114,1]], +[[63,1],[89,1],[128,1]], +[[138,1]], +[[139,1]], +[[140,1]], +[[141,1]], +[[75,1],[135,1]], +[[76,1],[136,1]], +[[28,1],[137,1]], +[[103,1],[129,1]], +[[77,1],[137,1]], +[[145,1]], +[[106,1],[134,1]], +[[78,1],[142,1]], +[[79,1],[143,1]], +[[54,1],[144,1]], +[[38,1],[91,1],[93,1],[101,1],[114,1]], +[[25,1],[116,1],[128,1]], +[[146,1]], +[[147,1]], +[[95,1],[144,1]], +[[85,1],[148,1]], +[[86,1],[149,1]], +[[45,1],[150,1]], +[[55,1],[71,1],[89,1],[116,1],[128,1]], +[[152,1]], +[[153,1]], +[[154,1]], +[[155,1]], +[[156,1]], +[[158,1]], +[[159,1]], +[[160,1]], +[[90,1],[157,1]], +[[135,1],[136,1]], +[[40,1],[104,1],[151,1]], +[[20,1],[108,1],[151,1]], +[[161,1]], +[[162,1]], +[[142,1],[143,1]], +[[121,1],[150,1]], +[[127,1],[157,1]], +[[37,1],[84,1],[104,1],[108,1],[151,1]], +[[148,1],[149,1]]],"7":[[[1,1]], +[[2,1]], +[[3,1]], +[[4,1]], +[[5,1]], +[[6,1]], +[[2,1],[7,1]], +[[5,1],[8,1]], +[[9,1]], +[[10,1]], +[[11,1]], +[[12,1]], +[[13,1]], +[[14,1]], +[[15,1]], +[[16,1]], +[[18,1]], +[[19,1]], +[[20,1]], +[[7,1],[17,1]], +[[21,1]], +[[22,1]], +[[23,1]], +[[24,1]], +[[25,1]], +[[26,1]], +[[4,1],[27,1]], +[[28,1]], +[[29,1]], +[[30,1]], +[[31,1]], +[[32,1]], +[[33,1]], +[[6,1],[34,1]], +[[35,1]], +[[1,1],[36,1]], +[[37,1]], +[[38,1]], +[[39,1]], +[[40,1]], +[[42,1]], +[[43,1]], +[[44,1]], +[[45,1]], +[[46,1]], +[[11,1],[41,1]], +[[47,1]], +[[48,1]], +[[16,1],[49,1]], +[[50,1]], +[[20,1],[51,1]], +[[14,1],[52,1]], +[[53,1]], +[[54,1]], +[[55,1]], +[[56,1]], +[[57,1]], +[[58,1]], +[[60,1]], +[[61,1]], +[[62,1]], +[[63,1]], +[[64,1]], +[[19,1],[65,1]], +[[66,1]], +[[36,1],[59,1]], +[[67,1]], +[[68,1]], +[[21,1],[70,1]], +[[72,1]], +[[25,1],[71,1]], +[[24,1],[74,1]], +[[75,1]], +[[76,1]], +[[77,1]], +[[78,1]], +[[79,1]], +[[80,1]], +[[81,1]], +[[82,1]], +[[83,1]], +[[41,1],[73,1]], +[[9,1],[84,1]], +[[85,1]], +[[51,1],[69,1]], +[[86,1]], +[[87,1]], +[[88,1]], +[[89,1]], +[[59,1],[69,1]], +[[17,1],[90,1]], +[[91,1]], +[[92,1]], +[[12,1],[94,1]], +[[96,1]], +[[97,1]], +[[39,1],[95,1]], +[[99,1]], +[[100,1]], +[[101,1]], +[[102,1]], +[[103,1]], +[[35,1],[98,1]], +[[52,1],[93,1]], +[[104,1]], +[[105,1]], +[[107,1]], +[[110,1]], +[[27,1],[108,1]], +[[37,1],[109,1]], +[[112,1]], +[[113,1]], +[[114,1]], +[[65,1],[106,1]], +[[90,1],[95,1]], +[[117,1]], +[[118,1]], +[[119,1]], +[[123,1]], +[[71,1],[111,1]], +[[34,1],[121,1]], +[[3,1],[124,1]], +[[8,1],[125,1]], +[[47,1],[122,1]], +[[70,1],[115,1]], +[[126,1]], +[[127,1]], +[[128,1]], +[[74,1],[116,1]], +[[129,1]], +[[131,1]], +[[132,1]], +[[133,1]], +[[134,1]], +[[98,1],[120,1]], +[[135,1]], +[[137,1]], +[[138,1]], +[[139,1]], +[[140,1]], +[[141,1]], +[[142,1]], +[[143,1]], +[[145,1]], +[[147,1]], +[[148,1]], +[[53,1],[146,1]], +[[120,1],[125,1]], +[[93,1],[136,1]], +[[108,1],[130,1]], +[[73,1],[144,1]], +[[109,1],[130,1]], +[[55,1],[149,1]], +[[150,1]], +[[151,1]], +[[152,1]], +[[153,1]], +[[154,1]], +[[155,1]], +[[156,1]], +[[157,1]], +[[158,1]], +[[159,1]], +[[122,1],[136,1]], +[[124,1],[144,1]], +[[162,1]], +[[163,1]], +[[164,1]], +[[165,1]], +[[166,1]], +[[84,1],[160,1]], +[[167,1]], +[[169,1]], +[[170,1]], +[[171,1]], +[[121,1],[160,1]], +[[115,1],[161,1]], +[[173,1]], +[[94,1],[172,1]], +[[174,1]], +[[175,1]], +[[176,1]], +[[116,1],[168,1]], +[[106,1],[172,1]], +[[177,1]], +[[178,1]], +[[179,1]], +[[180,1]], +[[181,1]], +[[182,1]], +[[146,1],[161,1]], +[[183,1]], +[[184,1]], +[[185,1]], +[[149,1],[168,1]], +[[186,1]], +[[49,1],[187,1]], +[[111,1],[187,1]]],"11":[[[1,1]], +[[2,1]], +[[3,1]], +[[4,1]], +[[5,1]], +[[1,1],[6,1]], +[[7,1]], +[[8,1]], +[[9,1]], +[[10,1]], +[[11,1]], +[[12,1]], +[[13,1]], +[[14,1]], +[[2,1],[15,1]], +[[16,1]], +[[17,1]], +[[18,1]], +[[19,1]], +[[20,1]], +[[21,1]], +[[22,1]], +[[23,1]], +[[24,1]], +[[6,1],[25,1]], +[[26,1]], +[[27,1]], +[[28,1]], +[[29,1]], +[[30,1]], +[[31,1]], +[[32,1]], +[[33,1]], +[[34,1]], +[[35,1]], +[[36,1]], +[[37,1]], +[[38,1]], +[[39,1]], +[[40,1]], +[[41,1]], +[[42,1]], +[[43,1]], +[[44,1]], +[[45,1]], +[[46,1]], +[[47,1]], +[[48,1]], +[[49,1]], +[[50,1]], +[[51,1]], +[[52,1]], +[[53,1]], +[[54,1]], +[[55,1]], +[[15,1],[56,1]], +[[57,1]], +[[58,1]], +[[59,1]], +[[60,1]], +[[61,1]], +[[62,1]], +[[63,1]], +[[64,1]], +[[65,1]], +[[66,1]], +[[67,1]], +[[68,1]], +[[69,1]], +[[70,1]], +[[71,1]], +[[72,1]], +[[73,1]], +[[74,1]], +[[75,1]], +[[76,1]], +[[77,1]], +[[78,1]], +[[79,1]], +[[80,1]], +[[81,1]], +[[82,1]], +[[83,1]], +[[84,1]], +[[25,1],[85,1]], +[[86,1]], +[[87,1]], +[[88,1]], +[[13,1],[89,1]], +[[90,1]], +[[91,1]], +[[92,1]], +[[93,1]], +[[94,1]], +[[95,1]], +[[96,1]], +[[97,1]], +[[98,1]], +[[99,1]], +[[100,1]], +[[101,1]], +[[102,1]], +[[103,1]], +[[104,1]], +[[105,1]], +[[106,1]], +[[107,1]], +[[109,1]], +[[110,1]], +[[111,1]], +[[112,1]], +[[113,1]], +[[114,1]], +[[115,1]], +[[56,1],[108,1]], +[[116,1]], +[[117,1]], +[[118,1]], +[[28,1],[119,1]], +[[120,1]], +[[121,1]], +[[122,1]], +[[123,1]], +[[124,1]], +[[125,1]], +[[126,1]], +[[127,1]], +[[128,1]], +[[129,1]], +[[130,1]], +[[131,1]], +[[132,1]], +[[133,1]], +[[134,1]], +[[135,1]], +[[136,1]], +[[137,1]], +[[138,1]], +[[139,1]], +[[140,1]], +[[141,1]], +[[142,1]], +[[143,1]], +[[144,1]], +[[145,1]], +[[146,1]], +[[147,1]], +[[148,1]], +[[149,1]], +[[150,1]], +[[151,1]], +[[152,1]], +[[153,1]], +[[154,1]], +[[155,1]], +[[156,1]], +[[157,1]], +[[158,1]], +[[159,1]], +[[160,1]], +[[161,1]], +[[162,1]], +[[163,1]], +[[164,1]], +[[166,1]], +[[167,1]], +[[168,1]], +[[169,1]], +[[170,1]], +[[171,1]], +[[85,1],[165,1]], +[[173,1]], +[[175,1]], +[[176,1]], +[[89,1],[172,1]], +[[177,1]], +[[178,1]], +[[179,1]], +[[180,1]], +[[108,1],[174,1]], +[[119,1],[172,1]], +[[119,1],[172,1]], +[[181,1]], +[[182,1]], +[[183,1]], +[[184,1]], +[[185,1]], +[[186,1]], +[[187,1]], +[[188,1]], +[[189,1]], +[[190,1]], +[[191,1]], +[[192,1]], +[[193,1]], +[[194,1]], +[[165,1],[174,1]], +[[195,1]]],"17":[[[1,1]], +[[2,1]], +[[3,1]], +[[4,1]], +[[5,1]], +[[6,1]], +[[7,1]], +[[8,1]], +[[9,1]], +[[10,1]], +[[1,1],[11,1]], +[[12,1]], +[[13,1]], +[[14,1]], +[[15,1]], +[[16,1]], +[[17,1]], +[[4,1],[18,1]], +[[19,1]], +[[20,1]], +[[21,1]], +[[22,1]], +[[5,1],[23,1]], +[[24,1]], +[[25,1]], +[[26,1]], +[[27,1]], +[[28,1]], +[[7,1],[29,1]], +[[30,1]], +[[31,1]], +[[32,1]], +[[33,1]], +[[34,1]], +[[35,1]], +[[36,1]], +[[37,1]], +[[38,1]], +[[39,1]], +[[2,1],[40,1]], +[[41,1]], +[[42,1]], +[[43,1]], +[[44,1]], +[[45,1]], +[[46,1]], +[[47,1]], +[[10,1],[48,1]], +[[49,1]], +[[50,1]], +[[11,1],[51,1]], +[[52,1]], +[[53,1]], +[[54,1]], +[[55,1]], +[[56,1]], +[[57,1]], +[[58,1]], +[[59,1]], +[[60,1]], +[[61,1]], +[[62,1]], +[[63,1]], +[[64,1]], +[[65,1]], +[[66,1]], +[[67,1]], +[[68,1]], +[[70,1]], +[[18,1],[69,1]], +[[23,1],[71,1]], +[[72,1]], +[[73,1]], +[[74,1]], +[[75,1]], +[[76,1]], +[[77,1]], +[[78,1]], +[[79,1]], +[[80,1]], +[[81,1]], +[[82,1]], +[[83,1]], +[[84,1]], +[[85,1]], +[[86,1]], +[[87,1]], +[[88,1]], +[[89,1]], +[[90,1]], +[[91,1]], +[[92,1]], +[[93,1]], +[[96,1]], +[[97,1]], +[[48,1],[94,1]], +[[40,1],[95,1]], +[[98,1]], +[[99,1]], +[[100,1]], +[[101,1]], +[[102,1]], +[[103,1]], +[[104,1]], +[[105,1]], +[[106,1]], +[[107,1]], +[[108,1]], +[[109,1]], +[[110,1]], +[[111,1]], +[[112,1]], +[[113,1]], +[[115,1]], +[[29,1],[114,1]], +[[116,1]], +[[117,1]], +[[118,1]], +[[119,1]], +[[120,1]], +[[121,1]], +[[122,1]], +[[123,1]], +[[124,1]], +[[125,1]], +[[126,1]], +[[127,1]], +[[128,1]], +[[130,1]], +[[51,1],[129,1]], +[[132,1]], +[[133,1]], +[[134,1]], +[[135,1]], +[[71,1],[131,1]], +[[136,1]], +[[137,1]], +[[138,1]], +[[139,1]], +[[140,1]], +[[142,1]], +[[143,1]], +[[144,1]], +[[145,1]], +[[147,1]], +[[148,1]], +[[149,1]], +[[150,1]], +[[151,1]], +[[152,1]], +[[153,1]], +[[69,1],[146,1]], +[[155,1]], +[[156,1]], +[[157,1]], +[[158,1]], +[[94,1],[154,1]], +[[94,1],[154,1]], +[[114,1],[141,1]], +[[114,1],[141,1]], +[[159,1]], +[[160,1]], +[[161,1]], +[[162,1]], +[[129,1],[141,1]], +[[163,1]], +[[164,1]], +[[165,1]], +[[166,1]], +[[167,1]], +[[168,1]], +[[169,1]], +[[170,1]], +[[171,1]], +[[172,1]], +[[173,1]], +[[174,1]], +[[175,1]], +[[146,1],[154,1]], +[[176,1]], +[[177,1]], +[[178,1]], +[[179,1]], +[[180,1]], +[[181,1]], +[[182,1]], +[[183,1]], +[[184,1]], +[[185,1]], +[[187,1]], +[[188,1]], +[[95,1],[186,1]], +[[95,1],[186,1]], +[[189,1]], +[[190,1]], +[[191,1]], +[[131,1],[186,1]], +[[192,1]]],"31":[[[1,1]], +[[2,1]], +[[3,1]], +[[4,1]], +[[1,1],[5,1]], +[[6,1]], +[[7,1]], +[[8,1]], +[[9,1]], +[[10,1]], +[[11,1]], +[[12,1]], +[[13,1]], +[[14,1]], +[[15,1]], +[[3,1],[16,1]], +[[17,1]], +[[18,1]], +[[19,1]], +[[20,1]], +[[22,1]], +[[5,1],[21,1]], +[[23,1]], +[[24,1]], +[[25,1]], +[[26,1]], +[[27,1]], +[[28,1]], +[[29,1]], +[[30,1]], +[[31,1]], +[[32,1]], +[[33,1]], +[[34,1]], +[[35,1]], +[[36,1]], +[[37,1]], +[[38,1]], +[[39,1]], +[[40,1]], +[[41,1]], +[[42,1]], +[[43,1]], +[[44,1]], +[[45,1]], +[[46,1]], +[[47,1]], +[[48,1]], +[[49,1]], +[[50,1]], +[[51,1]], +[[52,1]], +[[53,1]], +[[54,1]], +[[55,1]], +[[56,1]], +[[57,1]], +[[58,1]], +[[59,1]], +[[60,1]], +[[61,1]], +[[62,1]], +[[63,1]], +[[64,1]], +[[65,1]], +[[21,1],[66,1]], +[[67,1]], +[[68,1]], +[[69,1]], +[[70,1]], +[[71,1]], +[[72,1]], +[[73,1]], +[[74,1]], +[[75,1]], +[[16,1],[76,1]], +[[77,1]], +[[78,1]], +[[79,1]], +[[80,1]], +[[81,1]], +[[82,1]], +[[83,1]], +[[84,1]], +[[85,1]], +[[86,1]], +[[87,1]], +[[88,1]], +[[89,1]], +[[90,1]], +[[91,1]], +[[92,1]], +[[93,1]], +[[94,1]], +[[95,1]], +[[96,1]], +[[97,1]], +[[98,1]], +[[99,1]], +[[100,1]], +[[101,1]], +[[102,1]], +[[103,1]], +[[104,1]], +[[105,1]], +[[106,1]], +[[107,1]], +[[108,1]], +[[109,1]], +[[110,1]], +[[111,1]], +[[112,1]], +[[113,1]], +[[115,1]], +[[116,1]], +[[117,1]], +[[118,1]], +[[119,1]], +[[120,1]], +[[121,1]], +[[122,1]], +[[123,1]], +[[66,1],[114,1]], +[[124,1]], +[[125,1]], +[[126,1]], +[[127,1]], +[[128,1]], +[[129,1]], +[[130,1]], +[[131,1]], +[[132,1]], +[[133,1]], +[[134,1]], +[[135,1]], +[[136,1]], +[[137,1]], +[[138,1]], +[[139,1]], +[[140,1]], +[[141,1]], +[[142,1]], +[[143,1]], +[[144,1]], +[[145,1]], +[[146,1]], +[[147,1]], +[[148,1]], +[[149,1]], +[[150,1]], +[[151,1]], +[[152,1]], +[[153,1]], +[[154,1]], +[[155,1]], +[[156,1]], +[[157,1]], +[[158,1]], +[[159,1]], +[[160,1]], +[[162,1]], +[[163,1]], +[[164,1]], +[[165,1]], +[[76,1],[161,1]], +[[166,1]], +[[167,1]], +[[168,1]], +[[169,1]], +[[170,1]], +[[171,1]], +[[172,1]], +[[173,1]], +[[174,1]], +[[175,1]], +[[177,1]], +[[178,1]], +[[179,1]], +[[180,1]], +[[181,1]], +[[182,1]], +[[183,1]], +[[184,1]], +[[185,1]], +[[114,1],[176,1]], +[[114,1],[176,1]], +[[114,1],[176,1]], +[[186,1]], +[[187,1]], +[[188,1]], +[[189,1]], +[[190,1]], +[[191,1]], +[[192,1]], +[[193,1]], +[[194,1]], +[[161,1],[176,1]], +[[195,1]]]}},"O10+(2)":{"ordinary":[[1,1,1],[155,27,-5],[186,58,26],[340,84,20],[868,-28,4],[2108,316,124],[5270,22,-10],[6324,308,84],[7905,609,65],[9300,980,180],[11067,315,-69],[13020,476,-100],[13888,-448,64],[14756,1316,260],[15810,1090,-30],[18445,-371,45],[18445,525,141],[22848,1344,64],[31620,1028,-220],[31620,-764,100],[36890,154,-70],[42160,2736,560],[50592,1440,416],[55335,-1113,135],[55335,-1113,135],[66402,-798,66],[73780,1204,-300],[73780,-588,20],[73780,-1484,180],[101184,832,320],[110670,4046,430],[110670,-1330,366],[110670,462,-210],[110670,462,-210],[147560,-1176,40],[147560,616,-280],[148800,5440,320],[158100,3220,340],[166005,-651,-75],[166005,2037,-555],[166005,-651,-75],[168640,5824,960],[208320,448,-320],[221340,6300,-100],[221340,924,-420],[236096,6720,576],[265608,2184,-696],[298809,441,345],[316200,3880,40],[332010,-3990,330],[332010,1386,-630],[332010,1386,-630],[337280,1408,-640],[348160,4096,0],[355725,6285,-435],[355725,-5235,525],[355725,525,45],[355725,525,45],[368900,1540,580],[439425,-4095,225],[439425,-4095,225],[439425,-4095,225],[439425,-4095,225],[439425,-4095,225],[439425,-4095,225],[442680,3640,-136],[442680,7224,760],[442680,-3528,120],[442680,-3528,120],[498015,-1953,-225],[498015,-1953,-225],[505920,3136,320],[539648,7168,1024],[590240,-4704,160],[634880,-4096,0],[664020,-2604,-300],[664020,-2604,-300],[708288,-1344,-576],[711450,6810,-390],[711450,6810,-390],[711450,-4710,570],[711450,-4710,570],[722925,-2835,45],[722925,-2835,45],[722925,-2835,45],[722925,-2835,45],[722925,-2835,45],[722925,-2835,45],[761856,8192,0],[830025,-3255,-375],[885360,7280,240],[1011840,-1920,640],[1048576,0,0],[1180480,-2240,64],[1195236,1764,-924],[1422900,2100,180],[1494045,2205,-579]],"reduction":{"3":[[[1,1]], +[[2,1]], +[[1,1],[3,1]], +[[2,1],[3,1]], +[[4,1]], +[[1,1],[3,1],[5,1]], +[[4,1],[6,1]], +[[5,1],[6,1]], +[[4,1],[7,1]], +[[1,1],[2,1],[3,1],[5,1],[7,1]], +[[9,1]], +[[6,1],[8,1]], +[[10,1]], +[[1,1],[2,1],[3,1],[11,1]], +[[2,1],[7,1],[8,1]], +[[4,1],[12,1]], +[[13,1]], +[[1,1],[4,1],[5,1],[6,1],[7,1],[8,1]], +[[8,1],[14,1]], +[[2,1],[10,1],[12,1]], +[[10,1],[14,1]], +[[1,1],[2,1],[3,1],[5,1],[7,1],[11,1],[13,1]], +[[2,1],[11,1],[12,1],[13,1]], +[[15,1]], +[[15,1]], +[[9,1],[15,1]], +[[2,1],[17,1]], +[[4,1],[6,1],[8,1],[16,1]], +[[10,1],[16,1]], +[[4,1],[5,1],[6,1],[7,1],[8,1],[13,1],[16,1]], +[[7,1],[18,1]], +[[4,1],[10,1],[12,1],[13,1],[16,1]], +[[19,1]], +[[19,1]], +[[4,1],[10,1],[12,1],[20,1]], +[[4,1],[21,1]], +[[1,1],[3,1],[5,1],[6,1],[7,1],[8,1],[14,1],[18,1]], +[[10,1],[12,1],[14,1],[18,1]], +[[10,2],[14,1],[20,1]], +[[9,1],[22,1]], +[[15,1],[19,1]], +[[1,1],[2,1],[3,1],[4,1],[5,1],[6,1],[7,1],[11,1],[12,1],[13,1],[18,1]], +[[2,1],[4,2],[12,1],[17,1],[20,1]], +[[2,1],[4,1],[6,1],[7,1],[8,1],[14,1],[17,1],[18,1]], +[[9,1],[15,1],[22,1]], +[[1,1],[2,2],[3,1],[4,1],[7,1],[11,1],[12,1],[13,1],[17,1],[18,1]], +[[19,1],[22,1]], +[[25,1]], +[[4,2],[6,1],[12,1],[17,1],[18,1],[20,1]], +[[15,1],[24,1]], +[[9,1],[15,1],[19,1],[22,1]], +[[9,1],[15,1],[19,1],[22,1]], +[[4,2],[17,1],[20,1],[21,1]], +[[2,1],[3,1],[4,1],[10,1],[12,1],[14,1],[17,1],[18,1],[20,1]], +[[26,1]], +[[27,1]], +[[28,1]], +[[29,1]], +[[12,1],[13,1],[16,1],[23,1]], +[[30,1]], +[[31,1]], +[[30,1]], +[[30,1]], +[[31,1]], +[[31,1]], +[[14,1],[21,1],[23,1]], +[[7,1],[12,1],[13,1],[14,1],[18,1],[23,1]], +[[15,1],[19,1],[24,1]], +[[15,1],[19,1],[24,1]], +[[19,2],[24,1]], +[[19,2],[24,1]], +[[4,1],[7,1],[13,1],[16,1],[21,1],[23,1]], +[[1,1],[2,1],[3,1],[4,1],[5,1],[6,1],[7,2],[8,1],[10,1],[12,1],[13,1],[14,1],[16,1],[18,1],[23,1]], +[[4,1],[10,1],[16,1],[32,1]], +[[8,1],[10,2],[14,1],[16,1],[32,1]], +[[4,2],[21,1],[32,1]], +[[9,1],[15,2],[19,1],[22,1],[24,1]], +[[15,1],[19,2],[22,1],[24,1]], +[[26,1],[28,1]], +[[26,1],[29,1]], +[[27,1],[29,1]], +[[27,1],[28,1]], +[[33,1]], +[[34,1]], +[[35,1]], +[[36,1]], +[[37,1]], +[[38,1]], +[[1,1],[2,1],[3,1],[4,2],[7,1],[12,1],[14,1],[17,1],[18,1],[20,1],[21,1],[23,1]], +[[4,2],[10,2],[14,1],[20,1],[21,1],[32,1]], +[[2,1],[4,3],[6,1],[7,1],[8,1],[10,1],[12,2],[13,1],[14,1],[16,1],[17,1],[18,1],[20,1],[21,1],[23,1]], +[[2,1],[4,1],[7,1],[8,1],[10,2],[12,1],[13,1],[14,1],[16,2],[23,1],[32,1]], +[[1,1],[4,1],[7,1],[8,1],[10,1],[14,1],[16,1],[21,1],[23,1],[32,1]], +[[4,2],[10,2],[12,1],[14,1],[16,1],[20,1],[21,1],[23,1],[32,1]], +[[39,1]], +[[26,1],[27,1],[28,1],[29,1]], +[[25,1],[39,1]]]}},"O10-(2)":{"ordinary":[[1,1,1],[154,26,-6],[187,59,27],[340,84,20],[595,-45,51],[595,-45,51],[748,-20,44],[2244,324,100],[5236,-12,-44],[5236,-268,148],[5950,190,30],[5950,190,30],[6545,145,81],[6545,273,-15],[7700,660,180],[9350,1030,230],[10692,324,36],[13090,418,-190],[14960,1136,240],[15147,1323,171],[15708,1116,28],[15708,1116,284],[15708,1116,284],[22848,1344,64],[26180,-700,4],[26180,-700,4],[32725,85,-395],[35904,-960,64],[39270,-282,70],[39270,-1050,646],[41888,928,-96],[56100,420,580],[59840,-576,-320],[65450,2090,330],[65450,-470,-310],[65450,-470,-310],[71400,-1560,680],[71400,-1560,680],[78540,-1332,460],[83776,3904,320],[104720,-240,656],[104720,-240,656],[106029,-1107,-243],[106029,-1107,525],[106029,-1107,525],[106029,-1107,525],[123200,320,320],[130900,1620,20],[130900,4820,180],[130900,-940,660],[130900,-2220,340],[130900,2900,340],[130900,2900,340],[157080,-360,-296],[157080,2712,-40],[171072,5184,576],[181764,5508,612],[190400,960,-320],[190400,960,-320],[191488,3072,1024],[212058,8154,954],[227205,-891,-315],[251328,2496,-320],[251328,2496,704],[251328,2496,704],[261800,4520,-920],[261800,680,-600],[261800,3240,40],[294525,6525,-195],[294525,-4995,765],[294525,765,285],[294525,765,285],[302940,5724,540],[314160,2352,-1360],[348160,4096,0],[418880,-6080,1344],[418880,2112,320],[424116,-4428,-972],[424116,-4428,-204],[424116,-4428,-204],[424116,-4428,-204],[523600,3920,-560],[523600,3920,-560],[530145,4833,225],[530145,-5535,321],[530145,-5535,321],[530145,-5535,321],[589050,-4230,1050],[589050,-4230,1050],[589050,7290,90],[589050,7290,90],[598400,4480,-640],[609280,-5120,1024],[609280,-5120,1024],[630784,8192,0],[681615,-2673,-945],[681615,-2673,-945],[722925,-2835,45],[722925,-2835,45],[722925,-2835,45],[722925,-2835,45],[722925,-2835,45],[722925,-2835,45],[765952,-4096,0],[837760,-3968,640],[848232,11880,936],[908820,-3564,-1260],[969408,1728,-576],[1047200,-2400,1440],[1048576,0,0],[1060290,-702,-990],[1136025,-4455,-1575],[1178100,3060,1140],[1403325,3645,-675],[1403325,3645,-675]],"reduction":{"3":[[[1,1]], +[[1,1],[2,1]], +[[1,1],[3,1]], +[[1,1],[2,1],[3,1]], +[[4,1]], +[[4,1]], +[[2,1],[4,1]], +[[3,1],[5,1]], +[[1,1],[2,1],[4,1],[6,1]], +[[7,1]], +[[8,1]], +[[8,1]], +[[4,1],[8,1]], +[[5,1],[6,1]], +[[1,1],[2,1],[3,1],[4,1],[9,1]], +[[1,2],[2,1],[3,2],[5,1],[9,1]], +[[11,1]], +[[6,1],[10,1]], +[[1,1],[3,1],[5,1],[8,1],[9,1]], +[[12,1]], +[[1,1],[2,1],[3,1],[9,1],[10,1]], +[[1,1],[2,1],[3,1],[4,1],[5,1],[8,1],[9,1]], +[[1,1],[2,1],[3,1],[4,1],[5,1],[8,1],[9,1]], +[[1,1],[2,1],[3,1],[4,1],[5,1],[6,1],[9,1],[10,1]], +[[13,1]], +[[13,1]], +[[6,1],[14,1]], +[[1,1],[6,1],[7,1],[13,1]], +[[4,1],[5,1],[6,1],[8,1],[13,1]], +[[4,1],[7,1],[15,1]], +[[1,1],[2,1],[3,1],[4,1],[8,1],[9,1],[14,1]], +[[2,1],[4,2],[8,1],[9,1],[10,1],[15,1]], +[[1,1],[2,1],[3,1],[4,1],[6,1],[13,1],[14,1]], +[[5,1],[7,1],[16,1]], +[[4,1],[6,1],[8,1],[13,1],[14,1]], +[[4,1],[6,1],[8,1],[13,1],[14,1]], +[[4,1],[7,1],[8,1],[13,1],[15,1]], +[[4,1],[7,1],[8,1],[13,1],[15,1]], +[[4,1],[6,1],[7,1],[10,1],[13,1],[15,1]], +[[3,1],[5,2],[8,1],[9,1],[10,1],[16,1]], +[[4,1],[8,1],[15,1],[17,1]], +[[4,1],[8,1],[15,1],[17,1]], +[[18,1]], +[[19,1]], +[[19,1]], +[[19,1]], +[[1,1],[2,1],[3,1],[4,2],[5,1],[6,1],[8,2],[9,1],[10,1],[13,1],[14,1],[15,1]], +[[4,1],[5,1],[6,1],[7,1],[8,1],[13,1],[14,1],[16,1]], +[[1,2],[2,2],[3,2],[4,2],[5,2],[6,1],[8,2],[9,2],[10,1],[14,1],[16,1]], +[[4,1],[8,1],[13,1],[15,1],[17,1]], +[[4,2],[6,1],[7,1],[8,1],[13,2],[14,1],[15,1]], +[[5,1],[8,1],[16,1],[17,1]], +[[5,1],[8,1],[16,1],[17,1]], +[[7,1],[8,1],[13,1],[20,1]], +[[8,1],[14,1],[16,1],[17,1]], +[[22,1]], +[[11,1],[22,1]], +[[8,1],[17,1],[20,1]], +[[8,1],[17,1],[20,1]], +[[4,1],[5,1],[7,1],[8,2],[9,1],[10,1],[15,1],[16,1],[17,1]], +[[12,1],[23,1]], +[[24,1]], +[[1,1],[2,1],[3,1],[4,2],[5,1],[6,1],[8,1],[9,1],[10,1],[14,1],[15,1],[21,1]], +[[1,1],[2,1],[3,1],[4,2],[5,1],[6,1],[7,1],[8,2],[9,1],[10,1],[13,1],[14,1],[15,1],[16,1],[17,1]], +[[1,1],[2,1],[3,1],[4,2],[5,1],[6,1],[7,1],[8,2],[9,1],[10,1],[13,1],[14,1],[15,1],[16,1],[17,1]], +[[5,1],[6,1],[10,1],[14,1],[16,1],[21,1]], +[[4,1],[6,1],[10,1],[13,1],[14,1],[15,1],[21,1]], +[[5,1],[7,1],[8,2],[16,1],[17,1],[20,1]], +[[5,2],[7,1],[10,1],[16,2],[21,1]], +[[7,1],[25,1]], +[[8,2],[15,1],[17,2],[20,1]], +[[8,2],[15,1],[17,2],[20,1]], +[[18,1],[23,1]], +[[8,1],[14,1],[20,1],[21,1]], +[[1,1],[3,1],[4,1],[5,2],[6,1],[7,1],[8,2],[9,1],[10,1],[13,1],[14,1],[15,1],[16,1],[21,1]], +[[7,1],[13,1],[15,1],[17,1],[25,1]], +[[4,1],[7,1],[8,3],[13,1],[14,1],[15,1],[16,1],[17,2],[20,1]], +[[26,1]], +[[27,1]], +[[27,1]], +[[27,1]], +[[4,1],[5,1],[6,1],[7,1],[8,2],[10,1],[13,1],[14,1],[15,1],[16,1],[17,1],[20,1],[21,1]], +[[4,1],[5,1],[6,1],[7,1],[8,2],[10,1],[13,1],[14,1],[15,1],[16,1],[17,1],[20,1],[21,1]], +[[28,1]], +[[19,1],[27,1]], +[[19,1],[27,1]], +[[19,1],[27,1]], +[[7,1],[8,2],[15,1],[17,2],[20,1],[25,1]], +[[7,1],[8,2],[15,1],[17,2],[20,1],[25,1]], +[[5,2],[7,1],[8,2],[10,1],[15,1],[16,2],[17,2],[20,1],[21,1]], +[[5,2],[7,1],[8,2],[10,1],[15,1],[16,2],[17,2],[20,1],[21,1]], +[[1,2],[2,1],[3,2],[4,2],[5,2],[6,2],[7,1],[8,3],[9,1],[10,1],[13,2],[14,2],[15,1],[16,1],[17,1],[20,1],[21,1]], +[[7,1],[8,1],[13,1],[15,1],[17,2],[20,1],[25,1]], +[[7,1],[8,1],[13,1],[15,1],[17,2],[20,1],[25,1]], +[[3,1],[4,1],[5,2],[7,1],[8,3],[9,1],[10,1],[14,1],[15,1],[16,2],[17,2],[20,1],[21,1]], +[[29,1]], +[[30,1]], +[[31,1]], +[[32,1]], +[[31,1]], +[[32,1]], +[[32,1]], +[[31,1]], +[[1,1],[3,1],[5,1],[6,1],[7,1],[8,1],[13,2],[14,1],[15,1],[17,1],[20,1],[21,1],[25,1]], +[[4,1],[7,1],[8,2],[13,1],[14,1],[15,2],[17,2],[20,1],[21,1],[25,1]], +[[12,1],[18,1],[23,1],[28,1]], +[[33,1]], +[[12,1],[26,1],[28,1]], +[[4,2],[5,1],[6,1],[7,2],[8,3],[10,1],[13,2],[14,1],[15,3],[16,1],[17,3],[20,1],[21,1],[25,1]], +[[3,1],[5,1],[7,1],[8,2],[13,1],[14,1],[15,1],[16,1],[17,3],[20,2],[21,1],[25,1]], +[[18,1],[26,1],[28,1]], +[[24,1],[33,1]], +[[5,2],[7,2],[8,4],[10,1],[15,2],[16,2],[17,4],[20,2],[21,1],[25,1]], +[[34,1]], +[[35,1]]]}}} diff --git a/research/clifford-five-qubit-modular-seed/PROOF.md b/research/clifford-five-qubit-modular-seed/PROOF.md new file mode 100644 index 0000000000..b36817bed6 --- /dev/null +++ b/research/clifford-five-qubit-modular-seed/PROOF.md @@ -0,0 +1,43 @@ +# The raw width-15 Gaussian-dyadic splitting + +Let $R=\mathbb Z[i,1/2]$, $G=\mathrm{Sp}_{10}(2)$, and $C$ be the elementary abelian group of 64 alternating shears supported on the first four of the five binary coordinates. For the full five-qubit Clifford alphabet, choose one Gaussian-dyadic unitary lift $U_a$ of each projective class. Let $A_f$ have columns $\operatorname{vec}(U_a^{\otimes f})$, without normalization. The minimum integer width with an $R$-linear left inverse of $A_f$ is **15**. + +## From one Bell seed to an integral splitting + +Use the seven Bell labels $(0,Z_1,Z_2,Z_3,Z_4,Z_5,X_5)$ and one unpaired tensor factor. Their simultaneous stabilizer in the symplectic label group is $C$. The real controlled-$Z$ lifts of its six generators act trivially on the corrected seed phase. Every left-right translate of the subgroup sum then occurs as a Bell observation after an $R$-linear correction. The explicit correction for seven pairs uses the conjugate singleton $\bar U_a$ and acts linearly on mixture coefficients. All Bell contractions and the final Pauli trace division by 32 use only Gaussian dyadics. These are the seven-pair seed and interpolation implication proved in Sections 1, 2 and 4 of #7803. [Pinned Bell correction and recovery](https://github.com/apoursh/integer-mult-bounds/blob/0fefff647d869054f2e2c4eef3cdcb6e3c60c573/research/clifford-general-width/PROOF.md) + +Put $e=64^{-1}\sum_{c\in C}c$ and $I=R[G]eR[G]$. If $1\in I$, expand it in translated subgroup averages, recovering a single symplectic fibre from the seed observations. Translation gives the remaining fibres and trace pairing within a fibre recovers every coefficient. It suffices to show $R[G]/I=0$. + +For any field $k$ of odd characteristic, the ideal $k[G]e k[G]$ equals $k[G]$ if and only if every simple $k[G]$-module has a nonzero $C$-fixed vector. Indeed, $eM=M^C$. Every nonzero quotient of the group algebra by a two-sided ideal has a simple module, obtained by taking a maximal left ideal of the quotient. An obstruction therefore supplies a simple module killed by $e$, and conversely any such module witnesses a proper ideal. This argument also applies in the nonsemisimple characteristics. + +The module $R[G]/I$ is finite over $R$. Every maximal ideal of $R$ has a finite residue field of odd characteristic. The two-sided ideal commutes with base change at the level of the quotient, by right exactness and by using the finite set of generators $g e h$. An algebraic closure of a residue field is a faithfully flat extension of that field. Thus the vanishing of the quotient over the algebraic closure implies that its residue fibre vanishes. Nakayama's lemma then gives vanishing at each maximal ideal. A nonzero finite module has a maximal ideal in its support, proving the required global implication. This establishes existence of Gaussian-dyadic coefficients for the seed expansion. + +## The ordinary and modular tests + +The three relevant classes are the identity, a rank-two alternating shear $c_2$, and a rank-four alternating shear $c_4$. Their multiplicities in $C$ are $1,35,28$. For any Brauer character $\varphi$ in odd characteristic define +$$ + b(\varphi)=\frac{\varphi(1)+35\varphi(c_2)+28\varphi(c_4)}{64}. +$$ +The restriction to the elementary abelian 2-group is a sum of sign characters. Its eigenvalues lift uniquely to $\pm1$ in characteristic zero, so this exact integer is the dimension of the fixed subspace, including in characteristics that divide the dimension. It is additive on short exact sequences. + +The group order is $2^{25}3^6 5^2\cdot7\cdot11\cdot17\cdot31$. For a prime away from this order the ordinary character table gives the Brauer table over an algebraically closed residue field. In modular character theory these are all defect-zero blocks and their ordinary characters reduce irreducibly with unchanged lifted values. All 198 ordinary irreducibles have $b>0$, as found in #7806 and checked again from the three ordinary class columns here. For each of the five available odd-characteristic symplectic tables in CTblLib, the full modular computation gives the following results. [Ordinary predecessor census](https://github.com/apoursh/integer-mult-bounds/blob/b42e665721e76e69d05f24a19bdabee0e0f77c04/research/clifford-five-qubit-threshold/MOMENTS.md) · [CTblLib symplectic table record](https://www.math.rwth-aachen.de/~Thomas.Breuer/ctbllib/ctbltoc/data/S10%282%29.html) + +| Characteristic | Irreducible Brauer rows | Least $b$ | Least $b$ on a nontrivial row | +|---:|---:|---:|---:| +| 5 | 162 | 1 | 15 | +| 7 | 187 | 1 | 15 | +| 11 | 195 | 1 | 15 | +| 17 | 192 | 1 | 15 | +| 31 | 195 | 1 | 15 | + +At 3, compare the restrictions to the simple plus and minus orthogonal subgroups containing the same $C$. If a nonzero $G$-module had zero $C$-fixed dimension, the additivity and nonnegativity of $b$ would restrict every composition factor in each subgroup to one of its zero rows. At $c_2$ the normalized Brauer trace of such a module would have to be both $-1/31$ and $-67/1309$. The two rational numbers differ, and lifting the involution eigenvalues makes this an equality test in characteristic zero. This proves positivity in the last exceptional characteristic. [Subgroup embeddings, class fusions and all zero rows](THREE.md) + +The global argument now gives the raw $R$-left inverse. Given a target row at width 15, tensor it with the linear functional $\operatorname{vec}(U_a)^*/32$ for each extra slot. This preserves its value one on the target and zero on the others, and it also shows that a left inverse at any width below 14 would give one at 14. Width 14 already has a nonzero complex kernel of dimension 6,954,742,423,552 by #7806. Since base change to $\mathbb C$ preserves a left inverse, this proves the lower bound as well. [Pinned width-14 kernel](https://github.com/apoursh/integer-mult-bounds/blob/b42e665721e76e69d05f24a19bdabee0e0f77c04/research/clifford-five-qubit-threshold/PROOF.md) + +## Reconstructing the finite table calculation + +Write $O$ for the three selected columns of the ordinary character table, $D$ for the ordinary-to-modular decomposition matrix and $B$ for the same three columns of the table of irreducible Brauer characters. The three classes are regular for every odd prime, so $D B=O$. The numerical evidence stores $O$ and the positive entries of $D$, indexed from one. For each of the seven tables a sequence of integer pivots recovers all unknown rows of $B$. Substitution into every ordinary row checks the complete overdetermined system. Ordinary column orthogonality separately checks each group's order, the two centralizers and the vanishing cross products. + +The Fourier coefficients of the restricted class function on $C$ provide a second set of integer constraints. The 64 signs have three orbits under change of basis on the four-space, indexed by ranks 0, 2 and 4. The sums of each representative sign over the three original rank classes are respectively $(1,35,28),(1,3,-4),(1,-5,4)$. For example, enumerate the 64 symmetric zero-diagonal bit matrices in off-diagonal order $(12,13,14,23,24,34)$. A representative sign is the parity on none, on coordinate 12, or on 12 plus 34. The replay checks divisibility by 64, nonnegativity and recovery of the full degree from these three multiplicities. GAP's native irreducible Brauer tables independently reproduce all 1,005 modular triples in their published ordering. + +The theorem applies to raw observations. At odd width the Hilbert–Schmidt unit normalization contains $\sqrt 2$ when there are five qubits. A normalized inverse follows over the extended ring $R[\sqrt 2]$ by rescaling. None of these existence statements prices the extraction of all fibres, a coefficient-growth bound or a multiplication interface. diff --git a/research/clifford-five-qubit-modular-seed/README.md b/research/clifford-five-qubit-modular-seed/README.md new file mode 100644 index 0000000000..e529aba1fb --- /dev/null +++ b/research/clifford-five-qubit-modular-seed/README.md @@ -0,0 +1,44 @@ +# Five qubits split over the Gaussian dyadics at width 15 + +**Fifteen is the minimum raw tensor width for an exact Gaussian-dyadic left inverse of the full projective five-qubit Clifford alphabet.** The seven-Bell-pair seed already suffices at that width. Width 14 has a complex kernel, and #7803 previously gave an integral construction at width 17. The result closes the interval [15,17] from #7806. [Global proof](PROOF.md) · [Characteristic-three argument](THREE.md) + +The obstruction is a simple symplectic-group module with no fixed vector for the same group of 64 shears. The published tables rule this out at 5, 7, 11, 17 and 31 in all 931 cases. At 3, the two orthogonal subgroups give incompatible trace ratios for an obstruction. Their tables have only three possible zero rows between them. Together with the ordinary calculation at primes away from the group order, these checks lift the subgroup-average identity to $\mathbb Z[i,1/2]$. The proof establishes existence of an exact raw inverse. A usable decoding circuit, a noise bound, the cost of its observations and any effect on the selected multiplication bound remain open. + +## Reproduce the certificate + +From the repository root run the registered CPython 3.12 checks. Their inputs are the compact numerical evidence and the code in this directory. + +~~~sh +python3.12 -B scripts/research_package.py --package research/clifford-five-qubit-modular-seed +~~~ + +The primary checker recovers all 1,005 modular triples from exact decomposition equations, compares the two trace ratios and checks the ordinary class columns and the full restriction to the 64-element subgroup. A separate program generates all 64 binary shears, realizes the six generators as commutators in both orthogonal groups and counts the classes geometrically. [Retained numerical data](CHARACTERS.json) · [Primary checker](verify.py) · [Independent geometry check](check_orthogonal.py) + +### Regenerating from the original sources + +Two independent extraction routes reproduce the character calculation. The first uses the standard GAP interface with CTblLib 1.3.11. In this directory run + +~~~sh +gap -r -T -A -q -b gap_rows.g > /tmp/clifford-five-brauer-rows.json +python3.12 -I -B verify.py --gap-rows /tmp/clifford-five-brauer-rows.json +~~~ + +The second route uses the original GAP archive for the ordinary characters and the published MOC decomposition-matrix PDFs for the seven modular tables. Put the original PDFs in one directory under their published names. Run the following from this package with Python and PyMuPDF. Both external methods were exercised during preparation, using GAP 4.14.0 and PyMuPDF 1.26.3 respectively. The registered replay needs only CPython and its standard library. [Release archive](https://www.math.rwth-aachen.de/~Thomas.Breuer/ctbllib/ctbllib-1.3.11.tar.gz) · [Archive and PDF SHA-256 pins](rebuild.py) + +~~~sh +python -B rebuild.py /path/to/ctbllib-1.3.11.tar.gz /path/to/pdfs +python -B check_orthogonal.py /path/to/ctbllib-1.3.11.tar.gz +~~~ + +The symplectic PDFs are [mod 5](https://www.math.rwth-aachen.de/~MOC/decomposition/tex/S10%282%29/S10%282%29mod5.pdf), [mod 7](https://www.math.rwth-aachen.de/~MOC/decomposition/tex/S10%282%29/S10%282%29mod7.pdf), [mod 11](https://www.math.rwth-aachen.de/~MOC/decomposition/tex/S10%282%29/S10%282%29mod11.pdf), [mod 17](https://www.math.rwth-aachen.de/~MOC/decomposition/tex/S10%282%29/S10%282%29mod17.pdf) and [mod 31](https://www.math.rwth-aachen.de/~MOC/decomposition/tex/S10%282%29/S10%282%29mod31.pdf). The orthogonal PDFs use the simple groups. [Plus group mod 3](https://www.math.rwth-aachen.de/~MOC/decomposition/tex/O10%2B%282%29/O10%2B%282%29mod3.pdf) · [Minus group mod 3](https://www.math.rwth-aachen.de/~MOC/decomposition/tex/O10-%282%29/O10-%282%29mod3.pdf) + +## Attribution and scope + +The source character data belong to the ATLAS of Finite Groups, the Modular ATLAS, Gerhard Hiss and Thomas Breuer's GAP Character Table Library, with decomposition matrices published by the MOC project. CTblLib retains its GPL-3.0-or-later license. The package records numerical character values and decomposition multiplicities keyed to those published tables. The new proof and code were prepared by apoursh with substantial OpenAI Codex assistance under Apache-2.0. + +The group-algebra reduction is from apoursh's raw Bell interpolation construction, with earlier Clifford representation and spectrum results by alephnan and Ali Romman. The complex lower bound and ordinary fixed-space calculation at five qubits are from #7806. The new result handles all odd residue characteristics and proves sharpness over the Gaussian dyadics. [Coordination claim](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19755739) [#7803 pinned Bell construction](https://github.com/apoursh/integer-mult-bounds/blob/0fefff647d869054f2e2c4eef3cdcb6e3c60c573/research/clifford-general-width/PROOF.md) · [#7806 pinned complex threshold](https://github.com/apoursh/integer-mult-bounds/blob/b42e665721e76e69d05f24a19bdabee0e0f77c04/research/clifford-five-qubit-threshold/PROOF.md) + +## Open next questions + +1. Can one exhibit a short translated-subgroup identity over the Gaussian dyadics? Start by constructing a sparse expression for 1 in the ideal of the seven-pair seed and bounding its support and coefficient sizes. The local-to-global existence argument supplies neither quantity. +2. Can an explicit five-qubit decoder at width 15 meet the complex noise target with a priced observation interface? Begin with one fibre and its required inputs, compare its row norm against the Gram enclosure in #7806, and account for acquisition, precision and storage. Recoverability alone does not establish a supplier. diff --git a/research/clifford-five-qubit-modular-seed/SOURCES.json b/research/clifford-five-qubit-modular-seed/SOURCES.json new file mode 100644 index 0000000000..84b996b008 --- /dev/null +++ b/research/clifford-five-qubit-modular-seed/SOURCES.json @@ -0,0 +1,55 @@ +{ + "schema_version": 1, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "files": [ + { + "path": "certificates/selected-result.json", + "usage": "provenance", + "git_blob": "75d77b328ea02ded535e7f23aee5b1e55d0bb1a8", + "sha256": "154c3d30455d778fd3343b6b4851f0fa4665f0f7625b0adb3675e2bafbbf6bf1" + }, + { + "path": "docs/research/agent-task-catalog.json", + "usage": "provenance", + "git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec", + "sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81" + } + ], + "cited_research": [ + { + "pr": 6714, + "head": "f7f32a18dde54e67624a9ed9cc7e1b266d9585c0", + "author": "alephnan", + "title": "Prove the sharp three-qubit Clifford tensor threshold T(3)=10", + "url": "https://github.com/CrocSwap/integer-mult-bounds/pull/6714" + }, + { + "pr": 7766, + "head": "d7c2dd1868c70f0addce2c0a4d3220149452f14b", + "author": "aliromman", + "title": "Prove the sharp four-qubit Clifford tensor threshold T(4)=13", + "url": "https://github.com/CrocSwap/integer-mult-bounds/pull/7766" + }, + { + "pr": 7799, + "head": "7f08a74037788311cc6b7da27297b25f1b188e45", + "author": "apoursh", + "title": "Prove the sharp Gaussian-dyadic four-qubit Clifford tensor width is 13 (no κ)", + "url": "https://github.com/CrocSwap/integer-mult-bounds/pull/7799" + }, + { + "pr": 7803, + "head": "0fefff647d869054f2e2c4eef3cdcb6e3c60c573", + "author": "apoursh", + "title": "Prove linear Gaussian-dyadic tensor widths for the full n-qubit Clifford alphabet", + "url": "https://github.com/CrocSwap/integer-mult-bounds/pull/7803" + }, + { + "pr": 7806, + "head": "b42e665721e76e69d05f24a19bdabee0e0f77c04", + "author": "apoursh", + "title": "Prove the sharp five-qubit Clifford tensor threshold T(5) = 15", + "url": "https://github.com/CrocSwap/integer-mult-bounds/pull/7806" + } + ] +} diff --git a/research/clifford-five-qubit-modular-seed/TASK.json b/research/clifford-five-qubit-modular-seed/TASK.json new file mode 100644 index 0000000000..44d5e3d382 --- /dev/null +++ b/research/clifford-five-qubit-modular-seed/TASK.json @@ -0,0 +1,93 @@ +{ + "schema_version": 1, + "task_id": "uniform-transfer-audit", + "original_card": { + "id": "uniform-transfer-audit", + "question": "Can one of the selected record's five inherited assumptions be proved at its actual caller?", + "starting_points": [ + "docs/research/current-priorities.md", + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md" + ], + "methods": [ + "Construct and independently check one source-bound instance of the stated first experiment.", + "Seek an exact counterexample or target-specific complete-budget obstruction to that same proposed change." + ], + "acceptance_gate": "Identify the proposition and what would change downstream; do not equate a finite replay with a universal proof.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.", + "scope": "Source-bound orientation only, not a supplier replay or theorem proof." + }, + "first_experiment": "Choose one assumption ID (native_all_columns, owned_erasure, compiler, precision_tape, analytic_recovery), one quantified implication and exact dependency closure. Check current handoffs, including #5625 row reentry and #5707 root-prefix lowering, without treating their partial scope as the whole theorem. Prove or falsify that implication with a caller-bound argument; stop at the chosen obligation. Finite tests or root digits do not discharge an all-size statement.", + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "allowed_variations": [ + "One exact source head, helper/cut region or quantified proposition and changed hypothesis; check live handoffs first. Different seeds are not different scopes." + ], + "scope_change_triggers": [ + "Changing source head, helper/cut domain, operation alphabet or caller boundary without recording the new scope.", + "Treating an archived proposal or local numerical pass as complete supplier admission." + ], + "overlap_terms": [ + "native_all_columns", + "owned_erasure", + "compiler", + "precision_tape", + "analytic_recovery" + ], + "existing_checks": [ + { + "scope": "PR #4100: proposed unconditional construction and finite checks, without independent acceptance.", + "evidence": "research/unconditional-batched-crt/README.md", + "remaining": "Independent proof audit of one caller-bound all-size implication; all other premises remain explicit.", + "status": "author-checked", + "source_commit": "337d04939571a637aeab54a0f58f54fde811663a", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.", + "status": "reviewed", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5" + } + ] + }, + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "selection_nonce": "ca9a7296a4f888a2ced564283efb8020", + "scope_key": "58d0403e3078b2c5ae8a", + "scope_status": "changed", + "actual_scope": "Determine whether the order-64 Bell subgroup already yields a five-qubit raw Gaussian-dyadic decoder at width 15.", + "scope_change_reason": "The complex threshold in #7806 and the width-17 dyadic construction in #7803 left two lower candidate widths. Odd-characteristic generation is the remaining seed obligation.", + "bottleneck_link": "Settles the minimum raw width for five qubits by controlling every residue characteristic of the Gaussian dyadic coefficient ring.", + "stop_rule": "Cover every odd characteristic with checked modular data, show whole-ideal generation over the coefficient ring and verify transfer to the raw Bell readout.", + "outcome": "completed", + "evidence": "The package README, proof and registered verification commands describe the exact scope and controls.", + "author": "apoursh", + "ai_assistance": "Substantial OpenAI Codex assistance with mathematical derivation, verification and review.", + "open_questions": [ + { + "question": "Can one produce a small explicit group-algebra identity for the five-qubit width-15 seed?", + "why_it_matters": "Existence and minimum width alone do not price extraction or establish a usable coefficient norm.", + "first_step": "Search for a sparse identity among the measured left-right cosets and verify its coefficients over the Gaussian dyadics.", + "blocked_by": "The modular proof provides no practical support, norm or operation bound." + } + ], + "claim": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19755739", + "overlap": "Read #1163, recent #1166 handoffs, active #7111 work and recent PRs; checked relevant all-state PR searches. The local overlap cache and sparse inventory have limited coverage. Checked #7804 and the #7786 continuations for a distinct boundary.", + "upstream_refresh": { + "date_utc": "2026-11-19", + "canonical_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "selected_orientation": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "selected": "The selected result is #7000. The revision-8 catalogue refers to the earlier #5599.", + "before_submission": "Fetched canonical main again and checked the current work against the live PR queue." + } +} diff --git a/research/clifford-five-qubit-modular-seed/THREE.md b/research/clifford-five-qubit-modular-seed/THREE.md new file mode 100644 index 0000000000..f0177a7244 --- /dev/null +++ b/research/clifford-five-qubit-modular-seed/THREE.md @@ -0,0 +1,35 @@ +# Characteristic three via the two orthogonal subgroups + +Let $G=\mathrm{Sp}_{10}(2)$ and let $C$ be the width-15 subgroup of 64 alternating shears. Every nonzero finite-dimensional $\overline{\mathbb F}_3G$-module has a $C$-fixed vector. We prove this by comparing the Brauer trace of the same involution after restriction to two subgroups. The traces are ordinary integers, including when the module dimension is divisible by 3. + +## Realizing the same subgroup twice + +Write a vector as $(x,z)$ with five binary coordinates in each half. Use the two quadratic refinements $q_+(x,z)=x\cdot z$ and $q_-(x,z)=x\cdot z+x_5+z_5$. They have respectively 528 and 496 zeros. The group $C$ acts by $z\mapsto z+Mx$, where $M$ is zero off its first four coordinates and is alternating. This preserves each form. In fact $C$ lies in both derived orthogonal groups $H_+=\Omega_{10}^{+}(2)$ and $H_-=\Omega_{10}^{-}(2)$, the simple groups called `O10+(2)` and `O10-(2)` in the ATLAS. + +For distinct indices $i,j,k$ among the first four, let $s_{ij}$ be the pair shear for $e_i e_j^t+e_j e_i^t$. Let $T$ send $e_k$ to $e_k+e_i$ on the $z$-space and act contragrediently on the $x$-space. Both $T$ and $s_{kj}$ are involutions in both orthogonal groups. Conjugating the shear by $T$ gives $s_{kj}s_{ij}$. Thus $[T,s_{kj}]=s_{ij}$, which puts every generator in both derived groups. + +The 35 nonidentity rank-two shears and 28 rank-four shears each occupy a single class in each $H_\epsilon$. For rank $r$ choose a totally singular image of dimension $r$ and a nonsingular alternating form on its dual. Witt extension and change of basis on the image give a single full orthogonal orbit. Its stabilizer contains an element outside the derived group. Indeed, split off $r$ hyperbolic planes around the image and choose a nonsingular vector in the residual quadratic space of dimension $10-2r\ge2$. Its orthogonal symmetry fixes those planes pointwise and has Dickson invariant one. The orbit therefore stays transitive in the derived group. + +After a singular frame of length $j$, its perpendicular modulo the frame has dimension $10-2j$ and the original sign. Each nonzero singular vector in that quotient has $2^j$ lifts. Dividing the resulting ordered frame count by $|\mathrm{GL}_r(2)|$ and multiplying by the number $|\mathrm{GL}_r(2)|/|\mathrm{Sp}_r(2)|$ of alternating forms gives the following class sizes. In each simple orthogonal group the sizes identify unique columns. Both published class fusions agree with the symplectic columns below. In particular two symplectic columns have size 21,912,660, so that size alone cannot distinguish them. + +| Group | Rank two, class size (one-based column) | Rank four, class size (one-based column) | +|---|---:|---:| +| $H_+$ | 23,715 (2) | 1,992,060 (4) | +| $H_-$ | 19,635 (2) | 706,860 (4) | +| $G$ | 86,955 (3) | 21,912,660 (6) | + +## Excluding a fixed-point-free restriction + +On each simple orthogonal module with Brauer character $\varphi$, the dimension of the fixed space is $(\varphi(1)+35\varphi(c_2)+28\varphi(c_4))/64$. Here $c_r$ denotes a fixed member of $C$ of rank $r$. The published decomposition matrices and the ordinary character values at these three columns determine all modular triples. The only rows with zero fixed-space dimension are as follows. The underlying matrices have 97 ordinary rows and 39 modular columns for the plus group and 115 rows and 35 columns for the minus group. [Plus decomposition matrix](https://www.math.rwth-aachen.de/~moc/decomposition/tex/O10%2B%282%29/O10%2B%282%29mod3.pdf) · [Minus decomposition matrix](https://www.math.rwth-aachen.de/~moc/decomposition/tex/O10-%282%29/O10-%282%29mod3.pdf) + +| Group | Modular row | Dimension | Trace at $c_2$ | Trace at $c_4$ | +|---|---:|---:|---:|---:| +| $H_+$ | 4 | 868 | −28 | 4 | +| $H_+$ | 10 | 13,888 | −448 | 64 | +| $H_-$ | 7 | 5,236 | −268 | 148 | + +Suppose a nonzero $G$-module $V$ has zero $C$-fixed space. Averaging over the 2-group $C$ is exact in characteristic three. Consequently every composition factor in either subgroup restriction has zero fixed space and must appear in this table. Brauer characters are additive along composition series, even if the restricted module is indecomposable. The two plus rows force the Brauer trace of $c_2$ on $V$, divided by $\dim V$, to be $-1/31$. The minus row forces the very same quotient to be $-67/1309$. The unequal rational numbers contradict the existence of $V$. + +The geometric checker enumerates all 64 shears, verifies six commutator identities on all 1,024 points, and counts each class in the table. With the original CTblLib 1.3.11 archive as its sole argument it also checks both two-stage class fusions and centralizer orders. The modular calculation and the ideal-to-decoder argument are in the main proof. [Geometric checker](check_orthogonal.py) · [Main proof](PROOF.md) + +Prepared by apoursh with substantial OpenAI Codex assistance. New work is Apache-2.0. ATLAS and Modular Atlas character data retain their source attribution. diff --git a/research/clifford-five-qubit-modular-seed/VERIFY.json b/research/clifford-five-qubit-modular-seed/VERIFY.json new file mode 100644 index 0000000000..d9160f82c6 --- /dev/null +++ b/research/clifford-five-qubit-modular-seed/VERIFY.json @@ -0,0 +1,63 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-E", + "-s", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 180, + "checks": "All 1,005 modular character triples, five symplectic positivity tests and the incompatible orthogonal traces" + }, + { + "argv": [ + "{python}", + "-E", + "-s", + "-O", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 180, + "checks": "All 1,005 modular character triples, five symplectic positivity tests and the incompatible orthogonal traces under optimized Python" + }, + { + "argv": [ + "{python}", + "-E", + "-s", + "-W", + "error", + "-B", + "{package}/check_orthogonal.py" + ], + "timeout_seconds": 180, + "checks": "Explicit commutators on both quadratic spaces, all 64 shears and six geometric class sizes" + }, + { + "argv": [ + "{python}", + "-E", + "-s", + "-O", + "-W", + "error", + "-B", + "{package}/check_orthogonal.py" + ], + "timeout_seconds": 180, + "checks": "Explicit commutators on both quadratic spaces, all 64 shears and six geometric class sizes under optimized Python" + } + ] +} diff --git a/research/clifford-five-qubit-modular-seed/check_orthogonal.py b/research/clifford-five-qubit-modular-seed/check_orthogonal.py new file mode 100644 index 0000000000..b58ecd1016 --- /dev/null +++ b/research/clifford-five-qubit-modular-seed/check_orthogonal.py @@ -0,0 +1,137 @@ +"""Check the seed inside two orthogonal subgroups independently of Brauer data.""" +import argparse +from collections import Counter +from fractions import Fraction +from hashlib import sha256 +from itertools import combinations +import json +from math import prod +from pathlib import Path +import tarfile + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def pair_shear(point, i, j): + """Add x_j e_i + x_i e_j to the z half.""" + return point ^ (((point >> j) & 1) << (5 + i)) ^ (((point >> i) & 1) << (5 + j)) + + +def change_basis(point, i, k): + """z_i += z_k, with the contragredient change x_k += x_i.""" + return point ^ (((point >> (5 + k)) & 1) << (5 + i)) ^ (((point >> i) & 1) << k) + + +def quadratic(point, sign): + x, z = point & 31, point >> 5 + return ((x & z).bit_count() + (0 if sign == 1 else (x >> 4) + (z >> 4))) % 2 + + +def gl_order(rank): + return prod(2**rank - 2**i for i in range(rank)) + + +def sp_order(half_rank): + return 2**(half_rank**2) * prod(4**i - 1 for i in range(1, half_rank + 1)) + + +def class_size(rank, sign=None): + if sign is None: + frames = prod(2**(10-j) - 2**j for j in range(rank)) + else: + frames = prod(2**j * (2**(9-2*j) + sign*2**(4-j) - 1) for j in range(rank)) + # Each singular image carries |GL(r)|/|Sp(r)| nonsingular alternating shears. + return Fraction(frames, gl_order(rank)) * Fraction(gl_order(rank), sp_order(rank // 2)) + + +def check_geometry(): + points = range(1024) + pairs = list(combinations(range(4), 2)) + require([sum(quadratic(v, e) == 0 for v in points) for e in (1, -1)] == [528, 496], + "Wrong quadratic refinements") + for i, j in pairs: + k = next(h for h in range(4) if h not in (i, j)) + for v in points: + # Both factors of [T, s_kj] are involutions in both orthogonal groups. + t = change_basis(v, i, k) + s = pair_shear(v, k, j) + for e in (1, -1): + require(quadratic(t, e) == quadratic(s, e) == quadratic(v, e), + "Commutator factor fails to preserve a quadratic form") + w = change_basis(pair_shear(change_basis(s, i, k), k, j), i, k) + require(w == pair_shear(v, i, j), "Incorrect commutator") + ranks = Counter() + elements = set() + for mask in range(64): + chosen = [p for b, p in enumerate(pairs) if mask & (1 << b)] + images = [] + for v in points: + w = v + for i, j in chosen: + w = pair_shear(w, i, j) + images.append(w ^ v) + rank = len(set(images)).bit_length() - 1 + require(len(set(images)) == 2**rank, "Nonlinear image size") + elements.add(tuple(images[1 << i] for i in range(10))) + ranks[rank] += 1 + require(len(elements) == 64 and ranks == {0: 1, 2: 35, 4: 28}, "Seed census") + sizes = {sign: tuple(class_size(r, sign) for r in (2, 4)) for sign in (None, 1, -1)} + require(sizes == {None: (86955, 21912660), 1: (23715, 1992060), -1: (19635, 706860)}, + "Singular frame and alternating form counts") + return sizes + + +def first_list(text): + start = text.index("[") + depth = 0 + for i in range(start, len(text)): + depth += (text[i] == "[") - (text[i] == "]") + if depth == 0: + return text[start:i + 1], text[i + 1:] + raise ValueError("Unterminated CTblLib list") + + +def fusion(source, small, large): + tail = source.split(f'ALF("{small}","{large}",', 1)[1] + return json.loads(first_list(tail)[0]) + + +def check_archive(path, sizes): + totals = {"S10(2)": (None, (3, 6)), "O10+(2)": (1, (2, 4)), "O10-(2)": (-1, (2, 4))} + require(sha256(path.read_bytes()).hexdigest() == + "f201e9da571c681a7bbfb1e4683bdb2c80a23b005099ed0453521f59cb443434", + "Wrong CTblLib release") + with tarfile.open(path, "r:gz") as t: + symp, orth = [t.extractfile("ctbllib-1.3.11/data/" + name).read().decode("latin1") + for name in ("ctosymp1.tbl", "ctoorth3.tbl")] + for name, (sign, indices) in totals.items(): + source = symp if sign is None else orth + _, tail = first_list(source.split(f'MOT("{name}",', 1)[1]) + cs = json.loads(first_list(tail)[0]) + for size, index in zip(sizes[sign], indices, strict=True): + hits = [i for i, c in enumerate(cs, 1) if c * size == cs[0]] + # Symplectic columns 5 and 6 have equal size. Both subgroup fusions + # below select column 6 from the unique orthogonal column. + expected = [5, 6] if sign is None and index == 6 else [index] + require(hits == expected, "Unexpected centralizer sizes") + if sign is not None: + to_full = fusion(orth, name, name + ".2") + to_symp = fusion(orth, name + ".2", "S10(2)") + mapped = [to_symp[i-1] for i in to_full] + for col, target in zip(indices, (3, 6), strict=True): + require([i for i, c in enumerate(mapped, 1) if c == target] == [col], + "Geometric column disagrees with the class fusion") + print("PASS original CTblLib class sizes and both two-stage fusions") + + +if __name__ == "__main__": + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument("archive", nargs="?", type=Path) + args = parser.parse_args() + computed = check_geometry() + if args.archive: + check_archive(args.archive, computed) + print("PASS six explicit orthogonal commutators, 64 shears, two quadratic signs, six class sizes") diff --git a/research/clifford-five-qubit-modular-seed/gap_rows.g b/research/clifford-five-qubit-modular-seed/gap_rows.g new file mode 100644 index 0000000000..c30b0cddc6 --- /dev/null +++ b/research/clifford-five-qubit-modular-seed/gap_rows.g @@ -0,0 +1,18 @@ +# Independent check with GAP 4.14.0 and CTblLib 1.3.11. +if LoadPackage("CTblLib", "= 1.3.11") <> true then + Error("Install the pinned CTblLib 1.3.11 release"); +fi; +OutputBrauerTriples := function(name, p, ordcols) + local t, b, fusion, cols; + t := CharacterTable(name); + b := t mod p; + fusion := GetFusionMap(b, t); + cols := List(ordcols, i -> Position(fusion, i)); + if fail in cols then Error("Seed class is not p-regular"); fi; + return List(Irr(b), chi -> chi{cols}); +end; +result := List([5,7,11,17,31], p -> OutputBrauerTriples("S10(2)", p, [1,3,6]));; +Add(result, OutputBrauerTriples("O10+(2)", 3, [1,2,4])); +Add(result, OutputBrauerTriples("O10-(2)", 3, [1,2,4])); +Print(result, "\n"); +QUIT; diff --git a/research/clifford-five-qubit-modular-seed/rebuild.py b/research/clifford-five-qubit-modular-seed/rebuild.py new file mode 100644 index 0000000000..7eef81fd5d --- /dev/null +++ b/research/clifford-five-qubit-modular-seed/rebuild.py @@ -0,0 +1,136 @@ +"""Optional reconstruction from CTblLib's release and the seven original MOC PDFs. + +Usage: python rebuild.py path/to/ctbllib-1.3.11.tar.gz directory/of/PDFs +The PDF files must retain their published names. PyMuPDF is needed only here. +""" +import argparse +import hashlib +import json +from pathlib import Path +import re +import tarfile + +from verify import EXPECTED, MINUS, PLUS, ROOT, SP, require, verify + + +ARCHIVE = "f201e9da571c681a7bbfb1e4683bdb2c80a23b005099ed0453521f59cb443434" +ORDINARY_FILES = { + "ctosymp1.tbl": "461519e33cb31b2bc46f554b09f283f0afb7125fd805840d79bfc614fce75b6f", + "ctoorth3.tbl": "736b8f34211dd8a20c51312015fa72c1bb0a4931db19b317ea436ac0e9644626", +} +PDFS = { + (SP, 5): "1c886ad45671812c7c1cd3b9b7032c7a8057ca091673488c76ffac8c865ff5f0", + (SP, 7): "cdb7f8814c8a3fed2416ac994fa246d32b9dc875c0d61b0ad4439b3400b72708", + (SP, 11): "44a7cd8da9136d08f2988dc72e370db129cbace6c27dc7adfac222c858f973b3", + (SP, 17): "1da32315cddc39cea3ef162462e23dc48b29fde9651b48772a658989b5f5b03e", + (SP, 31): "935757534974ac96c14b2a96c36e1f8b1772d8cdeab2fe3671a24a76ab617204", + (PLUS, 3): "f0fde410061164fea325b9f7cf4893edb6197d0713eb675eeb7bbe0f6be4ce67", + (MINUS, 3): "6d2e24c110cfdc780f8f1d700e0407f3a38ba6999c809375c6025d8b35b07d37", +} + + +def take_list(text): + start, depth = text.index("["), 0 + for i in range(start, len(text)): + depth += (text[i] == "[") - (text[i] == "]") + if depth == 0: + return text[start:i+1], text[i+1:] + raise ValueError("Unterminated CTblLib list") + + +def ordinary_triples(source, group): + rest = source.split(f'MOT("{group}",', 1)[1] + for _ in range(3): # header, centralizer sizes, power maps + _, rest = take_list(rest) + table, _ = take_list(rest) + rest = "".join(table[1:-1].split()) + rows = [] + cols = [0, 2, 5] if group == SP else [0, 1, 3] + while rest: + record, rest = take_list(rest) + rest = rest.removeprefix(",") + ref = re.fullmatch(r"\[(GALOIS|TENSOR),\[(\d+),(\d+)\]\]", record) + if ref: + kind, a, b = ref.groups() + row = rows[int(a)-1] + if kind == "TENSOR": + row = [x*y for x, y in zip(row, rows[int(b)-1], strict=True)] + # Galois acts trivially on rational values at order one or two. + else: + entries = record[1:-1].split(",") + row = [int(entries[j]) for j in cols] + rows.append(row) + return rows + + +def read_decomposition(path, digest, nord, nmod): + import pymupdf + + require(hashlib.sha256(path.read_bytes()).hexdigest() == digest, f"Wrong source: {path.name}") + rows = [{} for _ in range(nord)] + + def insert(i, j, value): + require(1 <= i <= nord and 1 <= j <= nmod, "Decomposition index outside table") + require(j not in rows[i-1], "Duplicate matrix entry") + rows[i-1][j] = value + + with pymupdf.open(path) as document: + for page in document: + lines = page.get_text().splitlines() + for i, line in enumerate(lines): + single = re.search(r"= χ(\d+), ϕ(\d+)$", line) + if single: + insert(int(single[1]), int(single[2]), 1) + if not re.fullmatch(r"\(?Block\s*\d+:\)?", line): + continue + pos = i+1 + cols = [] + while pos < len(lines) and re.fullmatch(r"ϕ\d+", lines[pos]): + cols.append(int(lines[pos][1:])) + pos += 1 + require(cols, "Missing block header") + while pos < len(lines): + row = re.fullmatch(r"\d+\s*= χ(\d+)", lines[pos]) + if not row: + break + pos += 1 + for col, cell in zip(cols, lines[pos:pos+len(cols)], strict=True): + insert(int(row[1]), col, 0 if cell == "." else int(cell)) + pos += len(cols) + return [[[j, a] for j, a in sorted(row.items()) if a] for row in rows] + + +def rebuild(archive, directory): + require(hashlib.sha256(archive.read_bytes()).hexdigest() == ARCHIVE, "Wrong release archive") + sources = {} + with tarfile.open(archive) as tar: + for name, digest in ORDINARY_FILES.items(): + with tar.extractfile("ctbllib-1.3.11/data/"+name) as f: + raw = f.read() + require(hashlib.sha256(raw).hexdigest() == digest, "Wrong ordinary table") + sources[name] = raw.decode("latin-1") + result = {} + for group, primes in EXPECTED.items(): + rows = ordinary_triples(sources["ctosymp1.tbl" if group == SP else "ctoorth3.tbl"], group) + reductions = {} + for p, count in primes.items(): + path = directory / f"{group}mod{p}.pdf" + reductions[str(p)] = read_decomposition(path, PDFS[group, p], len(rows), count) + result[group] = {"ordinary": rows, "reduction": reductions} + return result + + +if __name__ == "__main__": + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument("archive", type=Path) + parser.add_argument("pdf_directory", type=Path) + parser.add_argument("--output", type=Path, help="Write reconstructed data to a new file") + args = parser.parse_args() + result = rebuild(args.archive, args.pdf_directory) + verify(result) + if args.output: + with args.output.open("x", encoding="utf-8") as f: + f.write(json.dumps(result, separators=(",", ":")).replace("]],[[", "]],\n[[")+"\n") + else: + require(result == json.loads((ROOT/"CHARACTERS.json").read_text()), "Retained data changed") + print("PASS original numerical sources: two ordinary table files and seven decomposition matrices") diff --git a/research/clifford-five-qubit-modular-seed/verify.py b/research/clifford-five-qubit-modular-seed/verify.py new file mode 100644 index 0000000000..2a61d87db0 --- /dev/null +++ b/research/clifford-five-qubit-modular-seed/verify.py @@ -0,0 +1,123 @@ +"""Exact restrictions to the 64-element Bell stabilizer, using integer arithmetic.""" +import argparse +from fractions import Fraction +import json +from math import prod +from pathlib import Path + +ROOT = Path(__file__).resolve().parent +SP, PLUS, MINUS = "S10(2)", "O10+(2)", "O10-(2)" +# ATLAS positions are one-based throughout the data and proof. +EXPECTED = {SP: {5: 162, 7: 187, 11: 195, 17: 192, 31: 195}, + PLUS: {3: 39}, MINUS: {3: 35}} + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def recover(ordinary, sparse, count): + """Solve D times the Brauer columns = ordinary columns; check every row.""" + require(len(ordinary) == len(sparse), "Missing ordinary reduction") + pending = {} + for i, encoded in enumerate(sparse): + row = dict(encoded) + require(len(row) == len(encoded) and row and + all(1 <= j <= count and a > 0 for j, a in row.items()), + "Invalid sparse decomposition entry") + pending[i] = row + solutions = {} + while pending: + before = len(pending) + for i, row in list(pending.items()): + unknown = row.keys() - solutions.keys() + if len(unknown) > 1: + continue + known = [(a, solutions[j]) for j, a in row.items() if j in solutions] + residual = [v-sum(a*r[t] for a, r in known) for t, v in enumerate(ordinary[i])] + if unknown: + j, = unknown + a = row[j] + require(all(v % a == 0 for v in residual), "Nonintegral Brauer entry") + solutions[j] = [v // a for v in residual] + else: + require(not any(residual), "Inconsistent decomposition equation") + del pending[i] + require(len(pending) < before, "Decomposition system lacks a triangular pivot") + require(len(solutions) == count, "Incomplete Brauer character coverage") + return [solutions[j] for j in range(1, count+1)] + + +def restrictions(row): + degree, lo, hi = row + # Characters of the binary alternating-four-space are indexed by dual + # alternating forms of ranks 0, 2 and 4. The three orbit sizes are 1,35,28. + fourier = (degree+35*lo+28*hi, degree+3*lo-4*hi, degree-5*lo+4*hi) + require(degree > 0 and all(v >= 0 and v % 64 == 0 for v in fourier), + "Not a character of the elementary abelian seed") + a, b, c = (v // 64 for v in fourier) + require(a+35*b+28*c == degree, "Seed restriction has wrong dimension") + return a, b, c + + +def ordinary_control(group, rows): + sp_order = 2**25 * prod(4**i-1 for i in range(1, 6)) + order = {SP: sp_order, PLUS: sp_order // (528*2), MINUS: sp_order // (496*2)}[group] + class_count, c2, c4 = {SP: (198, 285380444160, 1132462080), + PLUS: (97, 990904320, 11796480), + MINUS: (115, 1274019840, 35389440)}[group] + require(len(rows) == class_count, "Missing ordinary character") + columns = list(zip(*rows, strict=True)) + require(len(columns) == 3, "Missing class column") + squared = [sum(x*x for x in col) for col in columns] + require(squared == [order, c2, c4], "Wrong ordinary column norms") + for i in range(3): + for j in range(i): + require(sum(a*b for a, b in zip(columns[i], columns[j], strict=True)) == 0, + "Ordinary columns are not orthogonal") + return [restrictions(row)[0] for row in rows] + + +def verify(data, gap_rows=None): + require(list(data) == list(EXPECTED), "Unexpected groups") + if gap_rows is not None: + external = iter(gap_rows) + bad_three = {} + for group, counts in EXPECTED.items(): + ordinary = data[group]["ordinary"] + fixed = ordinary_control(group, ordinary) + if group == SP: + require(min(fixed) == fixed.count(1) == 1, "Ordinary symplectic positivity") + tables = data[group]["reduction"] + require({int(p) for p in tables} == set(counts), "Missing prime") + for p, count in counts.items(): + matrix = tables[str(p)] + rows = recover(ordinary, matrix, count) + if gap_rows is not None: + require(rows == next(external), "Mismatch against native GAP Brauer values") + fixed = [restrictions(row)[0] for row in rows] + if p == 3: + bad_three[group] = [(i, r) for i, (r, f) in enumerate(zip(rows, fixed), 1) if f == 0] + print(f"{group} p=3 rows={count} zero seed rows={bad_three[group]}") + else: + require(min(fixed) == fixed.count(1) == 1 and min(fixed[1:]) == 15, + "Unexpected modular fixed dimensions") + print(f"{group} p={p} rows={count} minimum nontrivial fixed dimension=15") + if gap_rows is not None: + require(next(external, None) is None, "Extra GAP table") + require(bad_three[PLUS] == [(4, [868,-28,4]), (10, [13888,-448,64])] and + bad_three[MINUS] == [(7, [5236,-268,148])], "Changed characteristic-three obstructions") + ratios = {g: {Fraction(r[1], r[0]) for _, r in bad_three[g]} for g in (PLUS, MINUS)} + require(ratios == {PLUS: {Fraction(-1,31)}, MINUS: {Fraction(-67,1309)}} and + ratios[PLUS].isdisjoint(ratios[MINUS]), "Restrictions do not exclude an obstruction") + print("PASS five-qubit width 15: 931 symplectic and 74 orthogonal Brauer rows") + + +if __name__ == "__main__": + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument("--gap-rows", type=Path, help="Optional numerical output from gap_rows.g") + args = parser.parse_args() + saved = json.loads((ROOT/"CHARACTERS.json").read_text()) + gap_rows = json.loads(args.gap_rows.read_text()) if args.gap_rows else None + verify(saved, gap_rows) From 9cdeb734ea8d0e6ddf3914dd92b6ced5046a6910 Mon Sep 17 00:00:00 2001 From: apoursh <8867770+apoursh@users.noreply.github.com> Date: Thu, 19 Nov 2026 12:47:51 -0500 Subject: [PATCH 2/2] Quantify the minimum fixed-space fraction in odd characteristic --- .../clifford-five-qubit-modular-seed/PROOF.md | 15 ++++++++++ .../README.md | 2 ++ .../verify.py | 28 ++++++++++++++++++- 3 files changed, 44 insertions(+), 1 deletion(-) diff --git a/research/clifford-five-qubit-modular-seed/PROOF.md b/research/clifford-five-qubit-modular-seed/PROOF.md index b36817bed6..f5fa33abb0 100644 --- a/research/clifford-five-qubit-modular-seed/PROOF.md +++ b/research/clifford-five-qubit-modular-seed/PROOF.md @@ -34,6 +34,21 @@ At 3, compare the restrictions to the simple plus and minus orthogonal subgroups The global argument now gives the raw $R$-left inverse. Given a target row at width 15, tensor it with the linear functional $\operatorname{vec}(U_a)^*/32$ for each extra slot. This preserves its value one on the target and zero on the others, and it also shows that a left inverse at any width below 14 would give one at 14. Width 14 already has a nonzero complex kernel of dimension 6,954,742,423,552 by #7806. Since base change to $\mathbb C$ preserves a left inverse, this proves the lower bound as well. [Pinned width-14 kernel](https://github.com/apoursh/integer-mult-bounds/blob/b42e665721e76e69d05f24a19bdabee0e0f77c04/research/clifford-five-qubit-threshold/PROOF.md) +## A universal lower bound for the fixed dimension + +The same data give a quantitative result. For every finite-dimensional $G$-module $M$ in odd characteristic, let $d=\dim M$, $b=\dim M^C$ and $t$ be the Brauer trace at $c_2$. Then +$$ + b\ \ge\ \frac{6}{6919}d. +$$ +To see this at 3, the 39 plus-group Brauer rows satisfy $31t+d\ge32b$ and the 35 minus-group rows satisfy $1309t+67d\le29920b$, including the respective zero rows. All three quantities are additive on restriction and passage to composition factors. Canceling the shared trace gives +$$ + 768d=31(1309t+67d)-1309(31t+d) + \le (31\cdot29920-1309\cdot32)b=885632b. +$$ +The coefficient is sharp for the relaxation that matches only degree and the two shear traces across restrictions. For the plus group take $168\varphi_1+223\varphi_4$, and for the minus group take $6\varphi_{13}+7\varphi_7$. Their common triple is $(193732,-6076,1060)$ with $b=168$, attaining $6/6919$. Whether a symplectic-group module attains that fraction at 3 remains open. + +Away from the group order the ordinary minimum of $b/d$ is $15/5797$. The same minimum holds in characteristics 5, 11, 17 and 31. In characteristic 7 it is $45/40393$. These are minima over all nonzero modules because every module has a composition series and $b/d$ is a dimension-weighted average of the simple ratios. Each of these minima exceeds $6/6919$. Extending the ground field to its algebraic closure preserves both dimensions since $e$ is an idempotent with image $M^C$. + ## Reconstructing the finite table calculation Write $O$ for the three selected columns of the ordinary character table, $D$ for the ordinary-to-modular decomposition matrix and $B$ for the same three columns of the table of irreducible Brauer characters. The three classes are regular for every odd prime, so $D B=O$. The numerical evidence stores $O$ and the positive entries of $D$, indexed from one. For each of the seven tables a sequence of integer pivots recovers all unknown rows of $B$. Substitution into every ordinary row checks the complete overdetermined system. Ordinary column orthogonality separately checks each group's order, the two centralizers and the vanishing cross products. diff --git a/research/clifford-five-qubit-modular-seed/README.md b/research/clifford-five-qubit-modular-seed/README.md index e529aba1fb..4f225b0767 100644 --- a/research/clifford-five-qubit-modular-seed/README.md +++ b/research/clifford-five-qubit-modular-seed/README.md @@ -4,6 +4,8 @@ The obstruction is a simple symplectic-group module with no fixed vector for the same group of 64 shears. The published tables rule this out at 5, 7, 11, 17 and 31 in all 931 cases. At 3, the two orthogonal subgroups give incompatible trace ratios for an obstruction. Their tables have only three possible zero rows between them. Together with the ordinary calculation at primes away from the group order, these checks lift the subgroup-average identity to $\mathbb Z[i,1/2]$. The proof establishes existence of an exact raw inverse. A usable decoding circuit, a noise bound, the cost of its observations and any effect on the selected multiplication bound remain open. +The fixed space has dimension at least $6\dim(M)/6919$ for **every** finite-dimensional symplectic-group module in odd characteristic. The coefficient is sharp when matching the two orthogonal restrictions only on the identity and both shear classes. [Quantitative bound and matching witness](PROOF.md#a-universal-lower-bound-for-the-fixed-dimension) + ## Reproduce the certificate From the repository root run the registered CPython 3.12 checks. Their inputs are the compact numerical evidence and the code in this directory. diff --git a/research/clifford-five-qubit-modular-seed/verify.py b/research/clifford-five-qubit-modular-seed/verify.py index 2a61d87db0..58c2d38869 100644 --- a/research/clifford-five-qubit-modular-seed/verify.py +++ b/research/clifford-five-qubit-modular-seed/verify.py @@ -79,16 +79,37 @@ def ordinary_control(group, rows): return [restrictions(row)[0] for row in rows] +def quantitative_three(tables): + plus, minus = tables[PLUS], tables[MINUS] + # These inequalities include the zero-fixed rows, where both sides vanish. + for d, t, u in plus: + require(31*t+d >= 32*restrictions([d, t, u])[0], "Plus trace inequality") + for d, t, u in minus: + require(1309*t+67*d <= 29920*restrictions([d, t, u])[0], "Minus trace inequality") + lower = Fraction(31*67-1309, 31*29920-1309*32) + require(lower == Fraction(6, 6919), "Universal fixed fraction") + + # A pair of subgroup modules attains the linear relaxation on (1,c2,c4). + pos = [168*a+223*b for a, b in zip(plus[0], plus[3], strict=True)] + neg = [6*a+7*b for a, b in zip(minus[12], minus[6], strict=True)] + require(pos == neg == [193732, -6076, 1060] and + Fraction(restrictions(pos)[0], pos[0]) == lower, "Tight restriction witness") + print("PASS universal dimension fraction 6/6919; tight on the three shared columns") + + def verify(data, gap_rows=None): require(list(data) == list(EXPECTED), "Unexpected groups") if gap_rows is not None: external = iter(gap_rows) bad_three = {} + orthogonal = {} for group, counts in EXPECTED.items(): ordinary = data[group]["ordinary"] fixed = ordinary_control(group, ordinary) if group == SP: require(min(fixed) == fixed.count(1) == 1, "Ordinary symplectic positivity") + require(min(Fraction(b, r[0]) for b, r in zip(fixed, ordinary, strict=True)) == + Fraction(15, 5797), "Ordinary fixed fraction") tables = data[group]["reduction"] require({int(p) for p in tables} == set(counts), "Missing prime") for p, count in counts.items(): @@ -98,12 +119,16 @@ def verify(data, gap_rows=None): require(rows == next(external), "Mismatch against native GAP Brauer values") fixed = [restrictions(row)[0] for row in rows] if p == 3: + orthogonal[group] = rows bad_three[group] = [(i, r) for i, (r, f) in enumerate(zip(rows, fixed), 1) if f == 0] print(f"{group} p=3 rows={count} zero seed rows={bad_three[group]}") else: require(min(fixed) == fixed.count(1) == 1 and min(fixed[1:]) == 15, "Unexpected modular fixed dimensions") - print(f"{group} p={p} rows={count} minimum nontrivial fixed dimension=15") + fraction = min(Fraction(b, r[0]) for b, r in zip(fixed, rows, strict=True)) + expected = Fraction(45, 40393) if p == 7 else Fraction(15, 5797) + require(fraction == expected and fraction > Fraction(6, 6919), "Modular fixed fraction") + print(f"{group} p={p} rows={count} minimum nontrivial dimension=15 fixed fraction={fraction}") if gap_rows is not None: require(next(external, None) is None, "Extra GAP table") require(bad_three[PLUS] == [(4, [868,-28,4]), (10, [13888,-448,64])] and @@ -111,6 +136,7 @@ def verify(data, gap_rows=None): ratios = {g: {Fraction(r[1], r[0]) for _, r in bad_three[g]} for g in (PLUS, MINUS)} require(ratios == {PLUS: {Fraction(-1,31)}, MINUS: {Fraction(-67,1309)}} and ratios[PLUS].isdisjoint(ratios[MINUS]), "Restrictions do not exclude an obstruction") + quantitative_three(orthogonal) print("PASS five-qubit width 15: 931 symplectic and 74 orthogonal Brauer rows")